{"meta":{"query_hash":"1469ad049f25","filters":{"venue":"Electronic Journal of Linear Algebra"},"cohort_total":79,"direct_labels_cover":0,"predictions_cover":79,"exported":79,"export_cap":100000,"truncated":false,"label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"permalink":"https://metacan.xera.ac/q/1469ad049f25","api":"https://metacan.xera.ac/api/v1/cohort?venue=Electronic+Journal+of+Linear+Algebra"},"results":[{"id":"W111037872","doi":"10.13001/1081-3810.2830","title":"A determinantal inequality for positive semidefinite matrices","year":2014,"lang":"en","type":"article","venue":"Electronic Journal of Linear Algebra","topic":"Mathematical Inequalities and Applications","field":"Mathematics","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Mathematics; Positive-definite matrix; Combinatorics; Inequality; Pure mathematics; Eigenvalues and eigenvectors; Mathematical analysis; Physics","score_opus":0.0381644346963784,"score_gpt":0.3446024513037973,"score_spread":0.3064380166074189,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W111037872","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.52239496,0.00029233412,0.47468594,0.0011886636,0.00007002442,0.0003245225,0.000027902628,0.000032011187,0.0009836169],"genre_scores_gemma":[0.9711416,0.000057887617,0.027715776,0.00018475758,0.00053444423,0.000019539384,0.0000046941677,0.000032897064,0.00030842345],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99830157,0.00010278745,0.0007887962,0.00012528918,0.00024359561,0.00043794006],"domain_scores_gemma":[0.9970079,0.0018152378,0.000622272,0.00020420614,0.0002544066,0.000095986645],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017520043,0.00015102948,0.00041872673,0.00007949433,0.00011481232,0.00003129396,0.0002618476,0.00007612203,0.000055147477],"category_scores_gemma":[0.0009836119,0.000115791074,0.00025451215,0.00013325382,0.00004994391,0.00011342642,0.00003268861,0.00029456604,0.000011814151],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000052704076,0.00015023295,0.000022558721,0.0001295864,0.000070994414,7.7625475e-7,0.00030607978,0.0000016152932,0.00047324505,0.9964425,0.0006543021,0.0016954183],"study_design_scores_gemma":[0.00068774197,0.00065174594,0.000024312989,0.000092301554,0.00012649366,0.0001152107,0.00018187545,0.0019309798,0.003970052,0.9862662,0.0057885908,0.00016451188],"about_ca_topic_score_codex":0.000004240372,"about_ca_topic_score_gemma":0.000007546407,"teacher_disagreement_score":0.44874662,"about_ca_system_score_codex":0.00007761195,"about_ca_system_score_gemma":0.00013628285,"threshold_uncertainty_score":0.4721823},"labels":[],"label_agreement":null},{"id":"W13075019","doi":"10.13001/1081-3810.2003","title":"Positive semidefinite 3 x 3 block matrices","year":2014,"lang":"en","type":"article","venue":"Electronic Journal of Linear Algebra","topic":"Mathematical Inequalities and Applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Mathematics; Positive-definite matrix; Semidefinite programming; Block (permutation group theory); Combinatorics; Pure mathematics; Eigenvalues and eigenvectors; Mathematical optimization","score_opus":0.02416978466760582,"score_gpt":0.3063983396139193,"score_spread":0.2822285549463135,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W13075019","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8197354,0.0013546799,0.15579173,0.004837155,0.00015176811,0.00032363852,0.000013709367,0.00009220177,0.01769968],"genre_scores_gemma":[0.9846822,0.00016686054,0.013143334,0.00028106922,0.00063285785,0.000004714502,0.0000018150466,0.000034451186,0.0010527011],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984124,0.00010015831,0.0006612489,0.000106638414,0.00031033205,0.00040923798],"domain_scores_gemma":[0.99781036,0.0011477353,0.00050551427,0.00021536236,0.00021690545,0.000104142986],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011406372,0.0001406823,0.00035037246,0.00009102209,0.000093926225,0.000031063104,0.00027790674,0.00006816417,0.0001591252],"category_scores_gemma":[0.0005727682,0.0001071214,0.00018225875,0.00018886778,0.000037789516,0.00009447985,0.000035287147,0.00043664456,0.0000634695],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014709838,0.00011750418,0.000011973104,0.00004423062,0.0000820997,0.00000143656,0.0002361606,0.0000063383513,0.000356735,0.99664867,0.0018952074,0.0005849443],"study_design_scores_gemma":[0.00042577373,0.00036356106,0.00001601174,0.00008856093,0.00011196108,0.00019879335,0.00016040164,0.0008370914,0.0027427732,0.9798588,0.01504186,0.0001543836],"about_ca_topic_score_codex":0.0000037140044,"about_ca_topic_score_gemma":0.0000035715348,"teacher_disagreement_score":0.16494676,"about_ca_system_score_codex":0.00006660029,"about_ca_system_score_gemma":0.00012302253,"threshold_uncertainty_score":0.43682837},"labels":[],"label_agreement":null},{"id":"W1488440181","doi":"10.13001/1081-3810.1352","title":"Sign patterns that require or allow power-positivity","year":2009,"lang":"en","type":"article","venue":"Electronic Journal of Linear Algebra","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada; American Institute of Mathematics; National Science Foundation","keywords":"Digraph; Sign (mathematics); Mathematics; Power (physics); Integer (computer science); Combinatorics; Matrix (chemical analysis); Nonnegative matrix; Pure mathematics; Discrete mathematics; Mathematical analysis; Computer science; Symmetric matrix; Chemistry; Physics; Eigenvalues and eigenvectors","score_opus":0.011711444163003456,"score_gpt":0.25350927364926945,"score_spread":0.241797829486266,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1488440181","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20100772,0.00096587196,0.79336745,0.0035387496,0.00037382517,0.0001110423,0.000002170728,0.00007337924,0.00055977935],"genre_scores_gemma":[0.99436826,0.00018557042,0.0037571006,0.0007226524,0.0003526903,5.440468e-7,6.1439744e-7,0.000010908629,0.0006016528],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979912,0.00021312803,0.00040214983,0.00023253038,0.00047269152,0.00068828056],"domain_scores_gemma":[0.9988253,0.00014722189,0.00037022543,0.00037595426,0.00011663203,0.00016468286],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013423415,0.00019939675,0.0003278622,0.00014081967,0.00013725975,0.00012229836,0.0011278334,0.000084023486,0.00014209114],"category_scores_gemma":[0.000059220532,0.00014491772,0.00021342971,0.00028612532,0.000025413832,0.0011553093,0.00006910565,0.00067265594,0.00003122013],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00071626436,0.0010730528,0.00066361076,0.000038579037,0.00040500943,0.0016881496,0.0020549374,0.00021299266,0.007982341,0.73627067,0.001425766,0.24746867],"study_design_scores_gemma":[0.008961115,0.030923996,0.014858173,0.0007381423,0.00022170892,0.014009925,0.00040034507,0.019592537,0.14573894,0.71418303,0.04744957,0.002922479],"about_ca_topic_score_codex":0.0000019473857,"about_ca_topic_score_gemma":0.0000033707286,"teacher_disagreement_score":0.79336053,"about_ca_system_score_codex":0.00012238164,"about_ca_system_score_gemma":0.00044961055,"threshold_uncertainty_score":0.5909573},"labels":[],"label_agreement":null},{"id":"W1651011902","doi":"10.13001/1081-3810.1550","title":"Some majorization inequalities for coneigenvalues","year":2012,"lang":"en","type":"article","venue":"Electronic Journal of Linear Algebra","topic":"Mathematical Inequalities and Applications","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Majorization; Mathematics; Eigenvalues and eigenvectors; Singular value; Basis (linear algebra); Inequality; Pure mathematics; Matrix (chemical analysis); Complex matrix; Combinatorics; Mathematical analysis; Geometry; Physics","score_opus":0.0769601161696527,"score_gpt":0.36159688406722207,"score_spread":0.28463676789756936,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1651011902","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4773458,0.00565041,0.512628,0.0019515171,0.000438415,0.000697938,0.00003370969,0.000080607875,0.0011735951],"genre_scores_gemma":[0.9748275,0.0002431376,0.020641027,0.00020461487,0.0028681527,0.000032664815,0.0000091015745,0.00004499431,0.0011288091],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984012,0.000063057836,0.0007003086,0.00006873954,0.00024164248,0.0005250301],"domain_scores_gemma":[0.998299,0.0007828243,0.00045500643,0.00016141885,0.00019448559,0.000107270906],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014717468,0.00012720737,0.00031779445,0.0000769509,0.00010072887,0.000021174414,0.00017510926,0.00006934395,0.00009186142],"category_scores_gemma":[0.0004896697,0.00010008303,0.00017387752,0.000094624564,0.000035236622,0.00031831482,0.000020418274,0.00020389988,0.000013378335],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018560768,0.00015253307,0.000031620624,0.00010856517,0.00007828321,9.4514306e-8,0.0006984593,0.0000016624648,0.00044476584,0.9966121,0.0015601396,0.00029322662],"study_design_scores_gemma":[0.00042111392,0.00019432597,0.0000080484015,0.000034259705,0.000094553965,0.000031109746,0.00066946336,0.00015974937,0.0054998724,0.97991556,0.012846405,0.00012552718],"about_ca_topic_score_codex":0.0000016238472,"about_ca_topic_score_gemma":7.8695473e-7,"teacher_disagreement_score":0.4974817,"about_ca_system_score_codex":0.000088054,"about_ca_system_score_gemma":0.00012858244,"threshold_uncertainty_score":0.40812674},"labels":[],"label_agreement":null},{"id":"W1745419424","doi":"10.13001/1081-3810.3115","title":"Preface: Special volume of Electronic Journal of Linear Algebra dedicated to Professor Ravindra B. Bapat","year":2015,"lang":"en","type":"article","venue":"Electronic Journal of Linear Algebra","topic":"Advanced Mathematical Theories","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Linear algebra; Algebra over a field; Mathematics; Volume (thermodynamics); Matrix (chemical analysis); Matrix analysis; Theme (computing); Matrix algebra; Numerical linear algebra; Linear system; Pure mathematics; Computer science; Mathematical analysis; Geometry; Physics; Quantum mechanics","score_opus":0.030533953765568684,"score_gpt":0.3290536253988832,"score_spread":0.29851967163331455,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1745419424","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8767062,0.0026969258,0.11640608,0.0018316094,0.00085815054,0.00079137937,0.000014722677,0.00005427108,0.0006406601],"genre_scores_gemma":[0.9430284,0.0004262161,0.047117386,0.00016596436,0.00569818,0.000011117634,0.0000049934865,0.00024395481,0.0033038186],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9930094,0.00044042946,0.00286515,0.0002969832,0.0017644723,0.0016235766],"domain_scores_gemma":[0.9928228,0.00068997295,0.0030075584,0.0005936493,0.0022716003,0.0006144204],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.005176872,0.00052405964,0.0017256241,0.00046074885,0.00011983983,0.000037024896,0.0012946174,0.00030762053,0.0004113559],"category_scores_gemma":[0.006712544,0.00041963285,0.0005523516,0.00088111113,0.0002625961,0.0006004637,0.00021294407,0.0023594645,0.0000834483],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.005507278,0.0027847919,0.0003204986,0.000706777,0.002627653,0.00014784766,0.010553329,0.0005226273,0.010176454,0.9421059,0.020155862,0.0043909987],"study_design_scores_gemma":[0.00376356,0.005724447,0.000024538947,0.00047805777,0.00051782484,0.0010662047,0.0016034828,0.00025519557,0.03519366,0.93591833,0.014948352,0.0005063324],"about_ca_topic_score_codex":0.0000020827454,"about_ca_topic_score_gemma":0.00001727462,"teacher_disagreement_score":0.06928869,"about_ca_system_score_codex":0.0009549105,"about_ca_system_score_gemma":0.003854005,"threshold_uncertainty_score":0.9999421},"labels":[],"label_agreement":null},{"id":"W1767070251","doi":"10.13001/1081-3810.1081","title":"Proof of Atiyah's conjecture for two special types of configurations","year":2002,"lang":"en","type":"article","venue":"Electronic Journal of Linear Algebra","topic":"Mathematics and Applications","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Conjecture; Pure mathematics; Type (biology); Calculus (dental); Algebra over a field","score_opus":0.03405532937974066,"score_gpt":0.314238939221805,"score_spread":0.28018360984206436,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1767070251","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5410991,0.0034760605,0.4287623,0.0047369706,0.0003790631,0.0025416617,0.00015585624,0.000038158138,0.018810887],"genre_scores_gemma":[0.9809571,0.000048343725,0.01734583,0.000019435247,0.00081871316,0.000010246466,0.0000027655801,0.000023661529,0.0007739074],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99879324,0.00002421759,0.00070271874,0.00007113802,0.00020798807,0.00020068843],"domain_scores_gemma":[0.9982454,0.00035643522,0.00082787755,0.00017481261,0.00035570862,0.000039751478],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037286233,0.00009894376,0.00036603824,0.000084277,0.00004686598,0.0000071461504,0.00019328891,0.000051186755,0.0005639094],"category_scores_gemma":[0.00028546495,0.000078430916,0.00018031988,0.00014025948,0.00005042149,0.00004979909,0.000010600428,0.00019305926,0.0000026745442],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029451567,0.0004924147,0.000007997305,0.0002023263,0.00025236738,5.4748887e-7,0.0009394242,0.00007271569,0.007146247,0.9715632,0.017360922,0.0019323824],"study_design_scores_gemma":[0.0023316743,0.0011919662,0.0000073751976,0.00015815398,0.00038669523,0.00010531724,0.00018482567,0.0061961026,0.15731618,0.8003375,0.03156523,0.00021896641],"about_ca_topic_score_codex":8.7612744e-7,"about_ca_topic_score_gemma":0.000012289467,"teacher_disagreement_score":0.43985802,"about_ca_system_score_codex":0.00003196687,"about_ca_system_score_gemma":0.00013968829,"threshold_uncertainty_score":0.6174413},"labels":[],"label_agreement":null},{"id":"W1798424565","doi":"10.13001/1081-3810.3117","title":"On the Principal Permanent Rank Characteristic Sequences of Graphs and Digraphs","year":2016,"lang":"en","type":"preprint","venue":"Electronic Journal of Linear Algebra","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; University of Calgary","funders":"","keywords":"Combinatorics; Mathematics; Rank (graph theory); Sequence (biology); Diagonal; Principal (computer security); Binary number; Skew; Zero (linguistics); Characterization (materials science); Main diagonal; Discrete mathematics; Physics; Arithmetic; Geometry; Computer science","score_opus":0.007944830767194344,"score_gpt":0.2128902299548589,"score_spread":0.20494539918766455,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1798424565","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9902345,0.007870408,0.00041307881,0.0001927923,0.0006470385,0.00020951885,0.000024263893,0.00003230425,0.00037610313],"genre_scores_gemma":[0.9970145,0.0026651316,0.000010082793,0.000024086345,0.00019262715,0.000009624844,0.0000028768136,0.000036879024,0.000044167755],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981604,0.00017513364,0.000727169,0.00016270569,0.0003506288,0.0004239307],"domain_scores_gemma":[0.9987359,0.00027485203,0.00048765875,0.00031192615,0.00010328232,0.000086364125],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011007645,0.00030323307,0.00055746536,0.00023323964,0.00006558911,0.00003202526,0.00047379927,0.00017719464,0.00005611334],"category_scores_gemma":[0.000051704523,0.0001763622,0.00032252967,0.00009917822,0.00014433388,0.00006426113,0.00006401449,0.0012158006,0.0000069287466],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00055432704,0.00016790038,0.0010016178,0.001366746,0.0029403036,0.000083921914,0.0027387172,0.0017899766,0.04652525,0.9389778,0.00051929813,0.0033341348],"study_design_scores_gemma":[0.0015948098,0.0012807547,0.0030263,0.003525872,0.0005281219,0.00078610214,0.00027791687,0.0011148158,0.02822076,0.9562537,0.0023832996,0.0010075594],"about_ca_topic_score_codex":0.0000023007901,"about_ca_topic_score_gemma":0.0000026293737,"teacher_disagreement_score":0.018304491,"about_ca_system_score_codex":0.00007054878,"about_ca_system_score_gemma":0.00014723335,"threshold_uncertainty_score":0.71918416},"labels":[],"label_agreement":null},{"id":"W1906887099","doi":"10.13001/1081-3810.2855","title":"Spectral Properties of Finite-dimensional Waveguide Systems","year":2015,"lang":"en","type":"article","venue":"Electronic Journal of Linear Algebra","topic":"Spectral Theory in Mathematical Physics","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Eigenvalues and eigenvectors; Context (archaeology); Mathematics; Spectrum (functional analysis); Waveguide; Type (biology); Spectral properties; Algebra over a field; Pure mathematics; Physics; Quantum mechanics","score_opus":0.06529658768139328,"score_gpt":0.2984794310263363,"score_spread":0.233182843344943,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1906887099","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98899895,0.0022514586,0.0059668766,0.0002603273,0.00034694767,0.0002343171,0.0000026867456,0.00003781409,0.001900625],"genre_scores_gemma":[0.99430746,0.000019523219,0.0045477794,0.000029903744,0.00065052893,0.000002361216,6.370805e-7,0.000048831676,0.0003929592],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99711525,0.0001998789,0.0011329328,0.00013696298,0.000857161,0.0005578024],"domain_scores_gemma":[0.99767184,0.0004618889,0.000781737,0.00030696398,0.0005911258,0.00018643499],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020698966,0.00022554414,0.0006917762,0.00013556879,0.000040912484,0.000022289529,0.0004204167,0.00009235832,0.000043403983],"category_scores_gemma":[0.0017616065,0.00016032098,0.0002526043,0.00023597549,0.0001362241,0.00020451342,0.000053511318,0.00063300796,0.00003947613],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002966263,0.00045155207,0.000019659623,0.00019367157,0.00035229983,0.000022005775,0.0007770665,0.0012112355,0.013898558,0.9815866,0.0011341076,0.000056627974],"study_design_scores_gemma":[0.0009991295,0.00096686766,0.0000030567069,0.00033081628,0.00013743786,0.00036107952,0.00037241413,0.004803627,0.07118256,0.92033863,0.00029370232,0.00021070329],"about_ca_topic_score_codex":0.0000061912524,"about_ca_topic_score_gemma":0.000001855393,"teacher_disagreement_score":0.061247982,"about_ca_system_score_codex":0.00026535537,"about_ca_system_score_gemma":0.0007540997,"threshold_uncertainty_score":0.65376997},"labels":[],"label_agreement":null},{"id":"W2096600852","doi":"10.13001/1081-3810.1127","title":"Matrix inversion and digraphs: the one factor case","year":2004,"lang":"en","type":"article","venue":"Electronic Journal of Linear Algebra","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Invertible matrix; Digraph; Mathematics; Inverse; Combinatorics; Matrix (chemical analysis); Diagonal matrix; Involutory matrix; Block matrix; Diagonal; Square matrix; Diagonally dominant matrix; Pure mathematics; Sequence (biology); Simple (philosophy); Inversion (geology); Symmetric matrix; Eigenvalues and eigenvectors; Physics","score_opus":0.009089055789342236,"score_gpt":0.23904091061957805,"score_spread":0.2299518548302358,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2096600852","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8004881,0.0042169862,0.1917031,0.003248122,0.00017960269,0.00008655674,0.0000011722318,0.000025815918,0.000050526327],"genre_scores_gemma":[0.9947856,0.00045262743,0.0042861584,0.00018861891,0.00021367223,4.474774e-7,1.5422142e-7,0.0000067350807,0.00006596812],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989602,0.00008289286,0.0002634349,0.00012483152,0.00023493092,0.000333706],"domain_scores_gemma":[0.99931264,0.000097264754,0.0002034956,0.00021526768,0.0000741852,0.00009712062],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006053651,0.00010661176,0.0001563344,0.00010338319,0.00020234768,0.00008309754,0.00047600988,0.000044098157,0.0000157271],"category_scores_gemma":[0.000039559527,0.00006853629,0.000097299104,0.0002736477,0.000056166085,0.00041409035,0.00009461741,0.00049183297,0.000011059141],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007612353,0.00021537887,0.000095767486,0.000028312938,0.000230102,0.0012283352,0.0030951197,0.00026508304,0.0022896456,0.9547698,0.000114365386,0.037591953],"study_design_scores_gemma":[0.005500307,0.0034780302,0.00034773367,0.00017259481,0.00014396002,0.04999362,0.0006987216,0.0073267967,0.03278183,0.885684,0.013124397,0.0007480094],"about_ca_topic_score_codex":0.000012280595,"about_ca_topic_score_gemma":0.000008565221,"teacher_disagreement_score":0.1942975,"about_ca_system_score_codex":0.000064707456,"about_ca_system_score_gemma":0.00023097514,"threshold_uncertainty_score":0.27948287},"labels":[],"label_agreement":null},{"id":"W2115774893","doi":"10.13001/1081-3810.1180","title":"Inertially arbitrary nonzero patterns of order 4","year":2007,"lang":"en","type":"article","venue":"Electronic Journal of Linear Algebra","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Redeemer University College; University of Regina","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Order (exchange); Equivalence (formal languages); Sign (mathematics); Pure mathematics; Combinatorics; Mathematical analysis","score_opus":0.006131947615819681,"score_gpt":0.239668162957194,"score_spread":0.23353621534137434,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2115774893","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31889355,0.00057847635,0.6795733,0.00051826035,0.000079113575,0.00004773524,7.368942e-7,0.00001878397,0.00029005657],"genre_scores_gemma":[0.984918,0.00010326709,0.014447747,0.00020377137,0.00020336853,6.193529e-7,0.0000017743738,0.000011003523,0.00011043383],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9985297,0.000027841352,0.0005772805,0.00013100368,0.00033130037,0.00040290516],"domain_scores_gemma":[0.9989045,0.000084441715,0.00037675284,0.00031898476,0.00022304988,0.00009222246],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008325288,0.00010479882,0.00020628337,0.00016528594,0.00004799285,0.00002328806,0.000816392,0.000053629432,0.000033051496],"category_scores_gemma":[0.000031441676,0.000089370624,0.00012469028,0.00042410518,0.000021936265,0.00026580848,0.00007924003,0.00038716942,0.000014420903],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009441924,0.0009674614,0.004642663,0.000063983534,0.0003863865,0.00013979439,0.0013595563,0.00022363078,0.12409379,0.764158,0.0007354666,0.10313484],"study_design_scores_gemma":[0.0053386507,0.0033398615,0.034308042,0.00026913916,0.0002011746,0.002846876,0.00023796437,0.025005221,0.74958706,0.07892952,0.09860589,0.0013305767],"about_ca_topic_score_codex":0.000012542231,"about_ca_topic_score_gemma":0.000021858312,"teacher_disagreement_score":0.68522847,"about_ca_system_score_codex":0.000051853407,"about_ca_system_score_gemma":0.0004653403,"threshold_uncertainty_score":0.36444283},"labels":[],"label_agreement":null},{"id":"W2119055371","doi":"10.13001/1081-3810.1302","title":"Generating potentially nilpotent full sign patterns","year":2009,"lang":"en","type":"article","venue":"Electronic Journal of Linear Algebra","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":25,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Redeemer University; University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada; American Institute of Mathematics","keywords":"Sign (mathematics); Nilpotent; Mathematics; Nilpotent matrix; Nilpotent group; Matrix (chemical analysis); Construct (python library); Pure mathematics; Computer science; Physics; Mathematical analysis; Square matrix; Eigenvalues and eigenvectors; Symmetric matrix; Chemistry","score_opus":0.004609314179226482,"score_gpt":0.1954632527866797,"score_spread":0.19085393860745323,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2119055371","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.87180376,0.0032711462,0.123916656,0.00013667943,0.00044394372,0.00007424275,0.0000015767039,0.000070674,0.00028133663],"genre_scores_gemma":[0.998083,0.00024334401,0.0005123632,0.00011450473,0.00094677554,8.184757e-7,0.0000022384834,0.00002739997,0.00006956883],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9984638,0.000074676806,0.00055540353,0.00009996263,0.00026492873,0.0005412011],"domain_scores_gemma":[0.99948233,0.000023092038,0.00015172057,0.00015091873,0.00008428039,0.000107635875],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063123566,0.00017780182,0.00027666424,0.00013508547,0.00007716516,0.00004294277,0.00025451643,0.00008145912,0.00007073084],"category_scores_gemma":[0.000016840464,0.00015685614,0.00021003112,0.0001424772,0.000009863057,0.0001708574,0.000007499185,0.00057834765,0.000022235665],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021546701,0.0002483487,0.00033268114,0.00010587235,0.0009029341,0.0003089245,0.0011489941,0.22412096,0.6282273,0.033555113,0.0016689218,0.10916447],"study_design_scores_gemma":[0.016791211,0.023264105,0.007814016,0.0020849032,0.0015011717,0.019313205,0.0028923908,0.33067483,0.37937397,0.151469,0.05815635,0.0066648554],"about_ca_topic_score_codex":0.0000011864175,"about_ca_topic_score_gemma":0.000004676902,"teacher_disagreement_score":0.24885336,"about_ca_system_score_codex":0.00010050852,"about_ca_system_score_gemma":0.00007698493,"threshold_uncertainty_score":0.63964075},"labels":[],"label_agreement":null},{"id":"W2121454630","doi":"10.13001/1081-3810.1065","title":"How to establish universal block-matrix factorizations","year":2001,"lang":"en","type":"article","venue":"Electronic Journal of Linear Algebra","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Mathematics; Factorization; Algebra over a field; Quaternion; Block (permutation group theory); Matrix decomposition; Pure mathematics; Combinatorics; Algorithm; Eigenvalues and eigenvectors","score_opus":0.007173415064601761,"score_gpt":0.23528526945593906,"score_spread":0.2281118543913373,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2121454630","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07486405,0.0005151348,0.9172498,0.0063697053,0.0004774893,0.00009157487,0.0000017152855,0.00005870818,0.00037182955],"genre_scores_gemma":[0.9821038,0.00019547214,0.013199825,0.00018384123,0.0007823027,7.439313e-7,0.0000010590243,0.000015667021,0.0035172931],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99853843,0.00009483917,0.00027596505,0.00018010043,0.00036146058,0.0005491785],"domain_scores_gemma":[0.99890226,0.00010157358,0.00021725136,0.00029296847,0.00026786828,0.00021805144],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005332267,0.00014218464,0.0002158954,0.00028282593,0.00014848312,0.00023033307,0.0010510841,0.00005824794,0.000035184574],"category_scores_gemma":[0.00014226872,0.0001247303,0.00013025667,0.00093359733,0.000020624255,0.0009546574,0.00010799259,0.00043633505,0.000026951378],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000075760705,0.00023914526,0.0003360178,0.000009692952,0.00018852284,0.00024764254,0.0012200677,0.002401581,0.004313404,0.9729465,0.002641788,0.015379833],"study_design_scores_gemma":[0.0028002716,0.0031002585,0.0003117289,0.00009390344,0.00011178475,0.0032695273,0.00070841156,0.017254928,0.015135306,0.094158426,0.86200243,0.0010530086],"about_ca_topic_score_codex":0.0000032146922,"about_ca_topic_score_gemma":0.000005738674,"teacher_disagreement_score":0.90723974,"about_ca_system_score_codex":0.00015018995,"about_ca_system_score_gemma":0.0004833869,"threshold_uncertainty_score":0.5086354},"labels":[],"label_agreement":null},{"id":"W2132750688","doi":"10.13001/1081-3810.1114","title":"On nonnegative matrices with given row and column sums","year":2003,"lang":"en","type":"article","venue":"Electronic Journal of Linear Algebra","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Mathematics; Column (typography); Combinatorics; Row and column spaces; Pure mathematics; Row; Geometry","score_opus":0.004411372928628116,"score_gpt":0.21326746395661283,"score_spread":0.20885609102798472,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2132750688","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5894926,0.004189568,0.40103748,0.0018139468,0.00026394977,0.00022885975,0.0000018253314,0.000049929873,0.0029218048],"genre_scores_gemma":[0.9883641,0.0001791369,0.010818827,0.00018487591,0.00010565106,0.0000012589062,1.860191e-7,0.00001104756,0.00033492947],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99876857,0.00016223388,0.00023629518,0.00016950225,0.00028536492,0.0003780142],"domain_scores_gemma":[0.99914455,0.00019259017,0.0002703704,0.00016987613,0.00011705101,0.000105535844],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00080556195,0.00013229107,0.00021688401,0.00012268712,0.0001225583,0.000086196495,0.0003692793,0.000040486877,0.000031675983],"category_scores_gemma":[0.00007152366,0.000094820185,0.00005425361,0.00032238872,0.000050831593,0.00037689804,0.000026761632,0.0004343171,0.000012681816],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011306075,0.00012462883,0.00014846982,0.00001303185,0.00013699036,0.00008452467,0.00066856766,0.00022561495,0.0001516337,0.99238384,0.00026621725,0.0056833997],"study_design_scores_gemma":[0.007615839,0.01829702,0.00066801754,0.0003676419,0.00015858523,0.005187397,0.00066006725,0.011789688,0.03736006,0.8818084,0.034852404,0.0012348641],"about_ca_topic_score_codex":0.0000019899724,"about_ca_topic_score_gemma":0.0000051310576,"teacher_disagreement_score":0.39887145,"about_ca_system_score_codex":0.000059685382,"about_ca_system_score_gemma":0.00030144956,"threshold_uncertainty_score":0.3866655},"labels":[],"label_agreement":null},{"id":"W2145896379","doi":"10.13001/1081-3810.1270","title":"A further look into combinatorial orthogonality","year":2008,"lang":"en","type":"article","venue":"Electronic Journal of Linear Algebra","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Converse; Unitary state; Block matrix; Orthogonality; Unitary matrix; Matrix (chemical analysis); Degree (music); Circular ensemble; Combinatorics; Pure mathematics; Algebra over a field; Eigenvalues and eigenvectors","score_opus":0.005878386680850079,"score_gpt":0.20296672907733945,"score_spread":0.19708834239648937,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2145896379","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9912157,0.003939435,0.002635381,0.0000683843,0.0010794078,0.00006809474,8.6887485e-7,0.000064075226,0.0009286512],"genre_scores_gemma":[0.9986552,0.00026422585,0.00007971512,0.000028956241,0.0008540067,0.000001771788,0.0000012071285,0.00003306475,0.00008185428],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986546,0.000096244636,0.0004729827,0.000087076376,0.00027862945,0.00041047545],"domain_scores_gemma":[0.9994545,0.00005190877,0.00012084406,0.00016443973,0.00010157221,0.00010671585],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066824444,0.00015418722,0.00030238452,0.0001040496,0.00008510352,0.000010173069,0.00023907101,0.00009395081,0.00010900341],"category_scores_gemma":[0.000030558953,0.00013475338,0.00020244512,0.00020487269,0.000058164478,0.00016188565,0.000013008811,0.00062105467,0.00005633263],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015499223,0.0011051127,0.022279724,0.0005087892,0.004512384,0.0010623189,0.019040823,0.010123288,0.0471822,0.8710644,0.011159218,0.010411804],"study_design_scores_gemma":[0.013415413,0.003844266,0.00616909,0.00036331438,0.0003873227,0.010448565,0.0013707065,0.004743187,0.05551541,0.6942433,0.20713037,0.0023690339],"about_ca_topic_score_codex":0.0000045256447,"about_ca_topic_score_gemma":0.0000060057855,"teacher_disagreement_score":0.19597116,"about_ca_system_score_codex":0.00012157612,"about_ca_system_score_gemma":0.00017953177,"threshold_uncertainty_score":0.54950833},"labels":[],"label_agreement":null},{"id":"W2161495039","doi":"10.13001/1081-3810.1563","title":"When can perfect state transfer occur?","year":2012,"lang":"en","type":"preprint","venue":"Electronic Journal of Linear Algebra","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Valency; Combinatorics; Adjacency matrix; Spectral radius; Mathematics; Transfer (computing); State (computer science); Discrete mathematics; Graph; Eigenvalues and eigenvectors; Physics; Computer science; Algorithm; Quantum mechanics","score_opus":0.010034022107578323,"score_gpt":0.23605967423593877,"score_spread":0.22602565212836045,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2161495039","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3777509,0.008321949,0.609058,0.0027609998,0.0017154203,0.00020137982,0.000012114913,0.000101601836,0.00007761798],"genre_scores_gemma":[0.98038507,0.00048115588,0.016661158,0.00037457424,0.0018703078,0.0000031940253,0.0000059613217,0.00005824365,0.00016032564],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961461,0.00034464552,0.0009047913,0.00047443225,0.00077066896,0.0013593605],"domain_scores_gemma":[0.9980003,0.00015672679,0.00047098575,0.0007589215,0.00028260445,0.0003304385],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.001795611,0.0005058394,0.00078967644,0.00035004792,0.00016250223,0.00022187525,0.002458966,0.00023539126,0.000033445158],"category_scores_gemma":[0.000044997996,0.00040861525,0.0006175171,0.00022745163,0.00006214046,0.00020110508,0.00059418293,0.0042263656,0.000018851137],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00038979194,0.0016790273,0.0011496186,0.0010077653,0.0049005384,0.00082618755,0.056051467,0.12242328,0.0029396855,0.06564934,0.0060155736,0.73696774],"study_design_scores_gemma":[0.0049305297,0.004356159,0.0020702495,0.0017236705,0.0006811872,0.0057679643,0.000080168036,0.48855877,0.0144858705,0.40695557,0.066080116,0.0043097525],"about_ca_topic_score_codex":0.000046664707,"about_ca_topic_score_gemma":0.000025231866,"teacher_disagreement_score":0.73265797,"about_ca_system_score_codex":0.0002899687,"about_ca_system_score_gemma":0.0020622618,"threshold_uncertainty_score":0.99983656},"labels":[],"label_agreement":null},{"id":"W2161590236","doi":"10.13001/1081-3810.1086","title":"On the Cayley transform of positivity classes of matrices","year":2002,"lang":"en","type":"article","venue":"Electronic Journal of Linear Algebra","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Cayley transform; Combinatorics; Factorization; Matrix (chemical analysis); Pure mathematics; Class (philosophy); Nonnegative matrix; Involution (esoterism); Matrix decomposition; Symmetric matrix; Graph; Eigenvalues and eigenvectors","score_opus":0.009571181560378063,"score_gpt":0.22473492134106846,"score_spread":0.2151637397806904,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2161590236","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8298272,0.005420911,0.15480392,0.0054950723,0.00024560594,0.00018333025,0.000005448549,0.00002285792,0.0039956667],"genre_scores_gemma":[0.9982907,0.00052581326,0.0008762544,0.00008492572,0.00009242367,5.1924656e-7,1.01984604e-7,0.000006001005,0.00012321779],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99865484,0.00014809667,0.00043651013,0.0000990878,0.00037612813,0.00028533879],"domain_scores_gemma":[0.9986735,0.00048256628,0.00042634606,0.0002406966,0.00013210048,0.000044790046],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010731104,0.00010575123,0.00025575171,0.000119584285,0.00006399679,0.000019106754,0.00080821733,0.000043201482,0.00010632708],"category_scores_gemma":[0.00006208951,0.00006522374,0.0001943631,0.00036634717,0.000060982584,0.00026281885,0.000027836339,0.00040154246,0.000007802208],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000062384745,0.00032878036,0.00002779659,0.00003344197,0.00014398979,0.000012669578,0.0008013612,0.0001643276,0.0030958469,0.97001135,0.00034131506,0.024976758],"study_design_scores_gemma":[0.0021140636,0.0066955644,0.00039646224,0.0003111941,0.000145213,0.00072543055,0.00020441669,0.037449937,0.48453262,0.46254504,0.0044074175,0.00047264062],"about_ca_topic_score_codex":0.0000052901855,"about_ca_topic_score_gemma":0.000002961128,"teacher_disagreement_score":0.50746626,"about_ca_system_score_codex":0.000036248857,"about_ca_system_score_gemma":0.00012109193,"threshold_uncertainty_score":0.2659747},"labels":[],"label_agreement":null},{"id":"W2161640119","doi":"10.13001/1081-3810.1063","title":"An upper bound on algebraic connectivity of graphs with many cutpoints","year":2001,"lang":"en","type":"article","venue":"Electronic Journal of Linear Algebra","topic":"Graph theory and applications","field":"Mathematics","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Mathematics; Algebraic number; Upper and lower bounds; Combinatorics; Algebraic connectivity; Discrete mathematics; Algebra over a field; Graph; Pure mathematics; Mathematical analysis; Laplacian matrix","score_opus":0.01586762715091431,"score_gpt":0.2926576746754576,"score_spread":0.2767900475245433,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2161640119","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9929118,0.00017205246,0.005549201,0.00032002287,0.000037079426,0.00016881431,0.000003611104,0.000025024423,0.0008123657],"genre_scores_gemma":[0.9984138,0.00009517515,0.0011156017,0.00010333759,0.000110801375,0.00000494671,0.0000019839986,0.000036559002,0.00011776392],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99837387,0.000161359,0.0004934683,0.00017802983,0.00035324527,0.0004400364],"domain_scores_gemma":[0.9983747,0.00032492136,0.00055006274,0.00040865617,0.00021696369,0.00012467935],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010195561,0.00019192978,0.00039711848,0.0002309972,0.00013447765,0.000020242778,0.0003439918,0.000081125814,0.00017291111],"category_scores_gemma":[0.00009608793,0.0001438585,0.00018475653,0.00041359305,0.00013070101,0.00021986169,0.000013262685,0.00059359166,0.000012308822],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00042895667,0.0007767447,0.0014539628,0.000017017195,0.00020830947,0.000012335232,0.00024188467,0.000014379202,0.003547108,0.9924508,0.00011885317,0.00072965946],"study_design_scores_gemma":[0.0011165442,0.0023679328,0.001556213,0.00007920119,0.00013044005,0.000499459,0.00018988577,0.00007401551,0.014184394,0.9788792,0.00074039714,0.00018228803],"about_ca_topic_score_codex":0.0000047562394,"about_ca_topic_score_gemma":0.00003035645,"teacher_disagreement_score":0.013571559,"about_ca_system_score_codex":0.000062775456,"about_ca_system_score_gemma":0.00021544316,"threshold_uncertainty_score":0.5866379},"labels":[],"label_agreement":null},{"id":"W2168756291","doi":"10.13001/1081-3810.1163","title":"On determining minimal spectrally arbitrary patterns","year":2005,"lang":"en","type":"article","venue":"Electronic Journal of Linear Algebra","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Nilpotent; Jacobian matrix and determinant; Realization (probability); Spectrum (functional analysis); Pure mathematics; Discrete mathematics; Algebra over a field; Applied mathematics; Physics","score_opus":0.019303179289010125,"score_gpt":0.30221711797841966,"score_spread":0.2829139386894095,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2168756291","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97479314,0.00021635648,0.022886055,0.00049391505,0.00028961423,0.00013555799,0.0000018501593,0.000053152104,0.0011303765],"genre_scores_gemma":[0.9627195,0.00006667218,0.035269663,0.00025999002,0.0013854521,0.0000023926004,6.333603e-7,0.00007362494,0.0002220432],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975999,0.000077208635,0.00089238945,0.00017360477,0.0005536141,0.00070327887],"domain_scores_gemma":[0.99801177,0.0007108391,0.0007236549,0.0003091637,0.00012847384,0.000116127885],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00068323495,0.00026109495,0.0004940851,0.00018055979,0.0000805152,0.000030025038,0.00046081867,0.000103660575,0.00014725271],"category_scores_gemma":[0.0006138508,0.00022445769,0.00024987088,0.00014383113,0.000029599489,0.0002754639,0.00004197018,0.0010384172,0.000050624785],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002613953,0.00076217344,0.00014231603,0.00008664832,0.0002692757,0.0001354057,0.0009422324,0.000097735065,0.001795414,0.988155,0.00095267216,0.0063997405],"study_design_scores_gemma":[0.0016166974,0.0019021635,0.000053000305,0.00023471736,0.0000980202,0.0006359923,0.00009521958,0.00064156135,0.018169245,0.9746974,0.0015383959,0.00031756618],"about_ca_topic_score_codex":2.9140455e-7,"about_ca_topic_score_gemma":0.000005325106,"teacher_disagreement_score":0.016373832,"about_ca_system_score_codex":0.00032719935,"about_ca_system_score_gemma":0.00032100486,"threshold_uncertainty_score":0.9153119},"labels":[],"label_agreement":null},{"id":"W2169257454","doi":"10.13001/1081-3810.1300","title":"On the minimum rank of not necessarily symmetric matrices: A preliminary study","year":2009,"lang":"en","type":"article","venue":"Electronic Journal of Linear Algebra","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":52,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Digraph; Rank (graph theory); Zero (linguistics); Graph; Cover (algebra); Simple graph; Discrete mathematics","score_opus":0.010352681736522,"score_gpt":0.24872913210156505,"score_spread":0.23837645036504304,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2169257454","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.92372316,0.0033239156,0.066909164,0.004197154,0.00034908205,0.00044195866,0.0000014754147,0.000039800907,0.0010142806],"genre_scores_gemma":[0.9980533,0.00011668206,0.0009339358,0.0004929693,0.00022587279,0.0000015367999,1.7979177e-7,0.000008993197,0.00016652698],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975665,0.00036426823,0.00068903563,0.00021001059,0.00069278205,0.000477363],"domain_scores_gemma":[0.99772865,0.00081747264,0.00067724945,0.00050055055,0.00019372597,0.000082377475],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026530258,0.00018748108,0.0003760405,0.00040412534,0.00013697555,0.000067122724,0.00175737,0.000056576882,0.00002896331],"category_scores_gemma":[0.00025638545,0.000116376556,0.0002166898,0.0013205314,0.000033592376,0.00032446062,0.00008055922,0.00070557784,0.00001843335],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010278632,0.0025293613,0.00007216207,0.000023293176,0.00032784272,0.00013969606,0.0021264944,0.00056393084,0.0007058668,0.93756056,0.0009924645,0.05393047],"study_design_scores_gemma":[0.012760871,0.12159866,0.008503792,0.0004888721,0.00066916546,0.0018395286,0.0019273745,0.07491245,0.038357463,0.73332137,0.0040063127,0.0016141185],"about_ca_topic_score_codex":0.0000026800367,"about_ca_topic_score_gemma":4.3133227e-7,"teacher_disagreement_score":0.20423916,"about_ca_system_score_codex":0.00006633291,"about_ca_system_score_gemma":0.0003340558,"threshold_uncertainty_score":0.47456983},"labels":[],"label_agreement":null},{"id":"W2169257893","doi":"10.13001/1081-3810.1171","title":"Schur complements and Banachiewicz-Schur forms","year":2005,"lang":"en","type":"article","venue":"Electronic Journal of Linear Algebra","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Mathematics; Schur complement; Idempotent matrix; Schur's theorem; Schur product theorem; Idempotence; Rank (graph theory); Schur decomposition; Schur algebra; Pure mathematics; Matrix (chemical analysis); Algebra over a field; Schur's lemma; Combinatorics; Eigenvalues and eigenvectors","score_opus":0.007760726781642667,"score_gpt":0.24745581324726929,"score_spread":0.23969508646562662,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2169257893","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4396288,0.008160943,0.54447365,0.005518032,0.00030821547,0.00018948985,0.000002849958,0.0000723829,0.0016456463],"genre_scores_gemma":[0.974844,0.00040169084,0.023310987,0.0005189441,0.0005328094,0.0000010226285,9.4406033e-7,0.000012302553,0.0003773136],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99838555,0.000078686564,0.00046949,0.00017481596,0.00033206053,0.0005593908],"domain_scores_gemma":[0.9991578,0.000066230095,0.00028981638,0.00023616735,0.00009866032,0.00015133395],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011895167,0.00015072485,0.00025231967,0.00015321752,0.00016008843,0.00009216288,0.000722996,0.0000449794,0.00008168888],"category_scores_gemma":[0.000033755652,0.00011689868,0.000103709695,0.00022240919,0.00003794075,0.0008431223,0.00013711471,0.0005058508,0.000039857077],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004106993,0.00014137308,0.00025258554,0.000015040564,0.00015136364,0.000021705342,0.00036895525,0.000085417945,0.0006863726,0.84373546,0.00065791956,0.15384273],"study_design_scores_gemma":[0.0073546562,0.0036682137,0.002061475,0.00016336425,0.00012903933,0.0037259418,0.00019884933,0.07524752,0.017889379,0.37656134,0.5118309,0.0011692815],"about_ca_topic_score_codex":0.0000017991623,"about_ca_topic_score_gemma":0.0000064962715,"teacher_disagreement_score":0.5352152,"about_ca_system_score_codex":0.000083898085,"about_ca_system_score_gemma":0.00021961045,"threshold_uncertainty_score":0.47669896},"labels":[],"label_agreement":null},{"id":"W2281730717","doi":"10.13001/1081-3810.3178","title":"A counterexample to a question of Bapat and Sunder","year":2016,"lang":"en","type":"article","venue":"Electronic Journal of Linear Algebra","topic":"History and Theory of Mathematics","field":"Mathematics","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Counterexample; Mathematics; Mathematical economics; Calculus (dental); Combinatorics","score_opus":0.02277754956060874,"score_gpt":0.2932086477767483,"score_spread":0.2704310982161396,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2281730717","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9247687,0.00038519353,0.07390673,0.000476376,0.000069428505,0.00008925314,0.000002556711,0.000010624987,0.000291146],"genre_scores_gemma":[0.9932722,0.00007666618,0.005755926,0.000052836727,0.00011741298,0.0000010527838,1.1431896e-7,0.000019157958,0.0007046498],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998919,0.000095602096,0.0004505311,0.00007998516,0.00022113648,0.00023372202],"domain_scores_gemma":[0.99881065,0.00045300968,0.00033782763,0.00014682206,0.00016571229,0.00008596884],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014447272,0.00010010883,0.0002921229,0.000113976435,0.00003813376,0.000005444027,0.00013731339,0.00005043025,0.00013029053],"category_scores_gemma":[0.00063134223,0.000064490014,0.00007498745,0.00007141809,0.000055859447,0.00011476831,0.000022663255,0.00014163885,0.000012365255],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023789109,0.00019056568,0.0000947295,0.00012353965,0.00014890441,0.0000071035365,0.0017479864,9.639498e-7,0.021489488,0.97026235,0.0012895811,0.004406888],"study_design_scores_gemma":[0.0009291223,0.0010252643,0.000052093867,0.00039830766,0.00008131864,0.0002986643,0.00013380042,0.00001448345,0.009611971,0.97788405,0.009437115,0.00013378753],"about_ca_topic_score_codex":0.0000016069483,"about_ca_topic_score_gemma":0.000015374097,"teacher_disagreement_score":0.068503484,"about_ca_system_score_codex":0.0001155139,"about_ca_system_score_gemma":0.0001528147,"threshold_uncertainty_score":0.26298264},"labels":[],"label_agreement":null},{"id":"W2334200621","doi":"10.13001/1081-3810.3271","title":"On the amplitude and phase response in the non-abelian Fourier transform","year":2016,"lang":"en","type":"article","venue":"Electronic Journal of Linear Algebra","topic":"Image and Signal Denoising Methods","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Mount Royal University","funders":"","keywords":"Mathematics; Fourier transform; Discrete Fourier transform (general); Fractional Fourier transform; Abelian group; Fourier transform on finite groups; Convolution (computer science); Discrete-time Fourier transform; Hartley transform; Fourier inversion theorem; Amplitude; Mathematical analysis; Context (archaeology); Non-uniform discrete Fourier transform; Filter (signal processing); Phase (matter); Pure mathematics; Fourier analysis; Physics; Optics; Computer science; Quantum mechanics","score_opus":0.01452316084526662,"score_gpt":0.29424674104201554,"score_spread":0.2797235801967489,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2334200621","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5124453,0.00043234823,0.45586354,0.030983442,0.000066387736,0.000096997945,4.682677e-7,0.0000043594077,0.00010718621],"genre_scores_gemma":[0.994789,0.00014994729,0.0031467257,0.0016430756,0.00011682858,0.000002498051,3.5309757e-8,0.000008071948,0.00014381931],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981679,0.00062612316,0.00031031802,0.00013452763,0.00035381777,0.00040736943],"domain_scores_gemma":[0.9977932,0.0016610142,0.0001251407,0.00031139038,0.00005867807,0.000050570314],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00677966,0.0001144102,0.00015999601,0.00013144317,0.00012453945,0.0000990631,0.0008389189,0.000039871782,0.000013051212],"category_scores_gemma":[0.00029707613,0.000045992263,0.000089448935,0.00025883573,0.0000660666,0.00022924918,0.000025225709,0.0004608308,0.000009045742],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.006315271,0.0006214636,0.000040044048,0.00001082139,0.00016702477,0.0004151676,0.008727173,0.000018635445,0.12006307,0.2194251,0.002083809,0.64211243],"study_design_scores_gemma":[0.02279613,0.018579042,0.0033363313,0.00055752916,0.00009810761,0.0030229753,0.00035505768,0.007654089,0.08569777,0.7927028,0.064354084,0.0008460707],"about_ca_topic_score_codex":0.000002718901,"about_ca_topic_score_gemma":0.0000035332653,"teacher_disagreement_score":0.64126635,"about_ca_system_score_codex":0.00006617819,"about_ca_system_score_gemma":0.00029187094,"threshold_uncertainty_score":0.23497085},"labels":[],"label_agreement":null},{"id":"W2400749722","doi":"10.13001/1081-3810.3129","title":"Totally Positive Density Matrices and Linear Preservers","year":2016,"lang":"en","type":"article","venue":"Electronic Journal of Linear Algebra","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Mathematics; Intersection (aeronautics); Density matrix; Set (abstract data type); Matrix (chemical analysis); Quantum; Qubit; Pure mathematics; Combinatorics; Discrete mathematics; Quantum mechanics; Computer science; Physics","score_opus":0.005074375965425664,"score_gpt":0.22262417888748373,"score_spread":0.21754980292205806,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2400749722","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5977355,0.0023816035,0.39605498,0.0031355505,0.00022791167,0.00009489746,0.000002500485,0.00004042076,0.0003266287],"genre_scores_gemma":[0.98904705,0.0007094077,0.009184613,0.00014017127,0.00038290973,5.4171903e-7,2.1394712e-7,0.000010407015,0.00052469975],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986069,0.00014175878,0.00032410218,0.00019332484,0.00029818714,0.00043573568],"domain_scores_gemma":[0.9989166,0.00024378662,0.00028518957,0.00021652685,0.00019811651,0.00013973784],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009759912,0.0001363381,0.0002267953,0.00012382555,0.00010858076,0.000053180032,0.0006151245,0.0000598299,0.00002692038],"category_scores_gemma":[0.00011126717,0.000086350025,0.000107502514,0.00020223614,0.000049091173,0.0007955092,0.00016821241,0.00027875355,0.000022983217],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00036126585,0.00022410763,0.00093891344,0.000036608475,0.00046580093,0.00028553992,0.0009039256,0.000033438344,0.013487092,0.89555854,0.00061282865,0.087091915],"study_design_scores_gemma":[0.010735892,0.009631678,0.011111663,0.0007781462,0.00031616134,0.009059041,0.00022159402,0.0172545,0.24536516,0.67192155,0.021542758,0.0020618476],"about_ca_topic_score_codex":0.0000047902545,"about_ca_topic_score_gemma":0.000003375263,"teacher_disagreement_score":0.39131153,"about_ca_system_score_codex":0.00007500115,"about_ca_system_score_gemma":0.0002722943,"threshold_uncertainty_score":0.3521252},"labels":[],"label_agreement":null},{"id":"W242749661","doi":"10.13001/1081-3810.2990","title":"Normalized rational semiregular graphs","year":2015,"lang":"en","type":"article","venue":"Electronic Journal of Linear Algebra","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Royal Military College of Canada","funders":"","keywords":"Combinatorics; Mathematics; Adjacency matrix; Vertex (graph theory); Eigenvalues and eigenvectors; Bipartite graph; Incidence matrix; Discrete mathematics; Diagonal; Adjacency list; Graph energy; Graph; Line graph; Graph power","score_opus":0.033567273929795464,"score_gpt":0.3073047502799164,"score_spread":0.2737374763501209,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W242749661","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97828615,0.0011169147,0.01747794,0.0012061539,0.00013492363,0.00015137828,0.000003350764,0.000039413215,0.001583753],"genre_scores_gemma":[0.9929096,0.000054135646,0.0060777073,0.000118219556,0.0002635407,0.000005359547,0.000004434174,0.000021483436,0.0005455009],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99866503,0.0001101504,0.00046666607,0.00008965817,0.0003529121,0.00031559702],"domain_scores_gemma":[0.9988353,0.00015752082,0.00034689927,0.00018558705,0.0003290146,0.00014567797],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014772911,0.000115172006,0.00022898716,0.0001291719,0.00008519606,0.000018387145,0.00026316612,0.000061678315,0.000097593045],"category_scores_gemma":[0.00026251463,0.00009489631,0.00017702306,0.00027218103,0.00005428202,0.00017762366,0.000020475709,0.00038312934,0.000029354278],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007112478,0.0001151791,0.000097644166,0.0000053929853,0.00009984632,0.000003832359,0.00021323904,0.000018456545,0.0011081015,0.99426156,0.003822086,0.00018353976],"study_design_scores_gemma":[0.0009812728,0.0001966146,0.000028662998,0.000014187003,0.00006622722,0.00027246954,0.000121446305,0.00010139352,0.0044209133,0.9773978,0.016297057,0.000101945116],"about_ca_topic_score_codex":0.0000011349154,"about_ca_topic_score_gemma":0.0000045588417,"teacher_disagreement_score":0.016863748,"about_ca_system_score_codex":0.00007055825,"about_ca_system_score_gemma":0.00046720175,"threshold_uncertainty_score":0.38697594},"labels":[],"label_agreement":null},{"id":"W244166733","doi":"10.13001/1081-3810.1438","title":"Multiplicative diagonals of matrix semigroups","year":2011,"lang":"en","type":"article","venue":"Electronic Journal of Linear Algebra","topic":"Advanced Topics in Algebra","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; University of Prince Edward Island","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Diagonal; Multiplicative function; Diagonal matrix; Semigroup; Main diagonal; Special classes of semigroups; Matrix (chemical analysis); Product (mathematics); Pure mathematics; Combinatorics; Mathematical analysis; Geometry","score_opus":0.0441982632141202,"score_gpt":0.33727679741019784,"score_spread":0.29307853419607766,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W244166733","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9159594,0.0028932113,0.078480355,0.00014344316,0.0001916633,0.00026651006,0.000007777048,0.00004044963,0.002017158],"genre_scores_gemma":[0.92449045,0.00036075248,0.07421795,0.00004032362,0.0002959414,0.0000044397243,9.31236e-7,0.000050971965,0.0005382315],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997792,0.00010741382,0.0009969157,0.00016693008,0.00041578882,0.0005209552],"domain_scores_gemma":[0.9973006,0.0005333496,0.0012553938,0.00038664902,0.00041339756,0.00011056215],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00092992344,0.00020739171,0.00055503735,0.00017697082,0.00005014849,0.0000050809263,0.0005565823,0.0001170914,0.0003536562],"category_scores_gemma":[0.0008214007,0.000173703,0.0002746332,0.00025771375,0.00011713528,0.00021756745,0.00007884159,0.0007552069,0.000021648273],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017444567,0.0004323991,0.0007815013,0.000068247675,0.00038643435,0.000019859055,0.0020937494,0.0000037345599,0.0047964132,0.98919326,0.00035183574,0.0016981245],"study_design_scores_gemma":[0.0008389701,0.00057780015,0.00031324802,0.00007966891,0.00010379613,0.00017818982,0.00023158267,0.000038410355,0.097959764,0.8982793,0.0012187711,0.00018051517],"about_ca_topic_score_codex":0.000004005787,"about_ca_topic_score_gemma":0.0000070024994,"teacher_disagreement_score":0.09316335,"about_ca_system_score_codex":0.00013394956,"about_ca_system_score_gemma":0.00028182977,"threshold_uncertainty_score":0.7083402},"labels":[],"label_agreement":null},{"id":"W2461609678","doi":"10.13001/1081-3810.3222","title":"Kemeny's Constant And An Analogue Of Braess' Paradox For Trees","year":2016,"lang":"en","type":"article","venue":"Electronic Journal of Linear Algebra","topic":"Graph theory and applications","field":"Mathematics","cited_by":33,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Mathematics; Combinatorics; Random walk; Constant (computer programming); Markov chain; Stochastic matrix; Discrete mathematics; Tree (set theory); Graph; Directed graph; State (computer science); Statistics; Algorithm","score_opus":0.026274736854813296,"score_gpt":0.3229007666529536,"score_spread":0.2966260297981403,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2461609678","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9542826,0.000636618,0.044013485,0.0007111652,0.000030168501,0.00016863414,0.00002585049,0.000010259658,0.00012124696],"genre_scores_gemma":[0.99489444,0.000249053,0.0046242634,0.000028397093,0.00011685152,0.0000052571218,0.0000012168376,0.0000146212815,0.000065878114],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99905044,0.00005862107,0.00043129493,0.00009503431,0.00011598943,0.00024862887],"domain_scores_gemma":[0.9987225,0.00050395867,0.00039053854,0.00016338596,0.00014630961,0.00007331843],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008181944,0.00009433736,0.0002640275,0.000086929926,0.000061537954,0.0000072430416,0.00016112559,0.000047127058,0.000031131443],"category_scores_gemma":[0.00015513,0.000059376394,0.000102106285,0.00008891628,0.00011224446,0.00012760797,0.000012057069,0.00011158175,8.7424587e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010769539,0.00012140667,0.00019194922,0.000016270224,0.00009887463,7.0685144e-7,0.00011134063,3.5736625e-7,0.018258933,0.97734576,0.00014888891,0.0035977918],"study_design_scores_gemma":[0.0010804828,0.0007969387,0.00009939147,0.000061205596,0.000090449124,0.000050788334,0.00011724886,0.00002559228,0.015443522,0.9804503,0.0017010786,0.00008304485],"about_ca_topic_score_codex":9.764931e-7,"about_ca_topic_score_gemma":0.000026968428,"teacher_disagreement_score":0.04061189,"about_ca_system_score_codex":0.000023222628,"about_ca_system_score_gemma":0.00014190315,"threshold_uncertainty_score":0.2421299},"labels":[],"label_agreement":null},{"id":"W24921706","doi":"10.13001/1081-3810.1120","title":"On two conjectures regarding an inverse eigenvalue problem for acyclic symmetric matrices","year":2004,"lang":"en","type":"article","venue":"Electronic Journal of Linear Algebra","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":43,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Eigenvalues and eigenvectors; Combinatorics; Inverse; Multiplicity (mathematics); Graph; Symmetric matrix; Discrete mathematics; Mathematical analysis","score_opus":0.011138583638077884,"score_gpt":0.27106278956923513,"score_spread":0.2599242059311572,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W24921706","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35829496,0.0020150852,0.6373891,0.00096594705,0.00046425167,0.00038374958,0.0000027239064,0.00009231225,0.00039184952],"genre_scores_gemma":[0.94084394,0.00017670238,0.05758709,0.00051719125,0.00075016357,0.000006282111,0.0000017497606,0.0000273813,0.00008952473],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99796724,0.00013596816,0.00051443017,0.00029203203,0.00040690642,0.00068344874],"domain_scores_gemma":[0.99853003,0.0002685546,0.0004976885,0.00033706575,0.00018939692,0.00017728936],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017169317,0.00021558229,0.00033799693,0.0005410785,0.00022920225,0.00015046752,0.0011167777,0.000075474105,0.000010116017],"category_scores_gemma":[0.00017598223,0.00016936011,0.00024074929,0.000781956,0.000035319394,0.00076423376,0.00006376403,0.00056419306,0.000018238525],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000121055244,0.00016947965,0.000008531168,0.000025823729,0.00010798647,0.00002716076,0.0003821644,0.011131898,0.0008424298,0.9742926,0.00011418354,0.012776723],"study_design_scores_gemma":[0.004127432,0.0038609074,0.000015173633,0.00009916298,0.00006656086,0.0005687652,0.000063035375,0.011414389,0.025862953,0.95047575,0.0030802551,0.00036561344],"about_ca_topic_score_codex":0.000010541834,"about_ca_topic_score_gemma":0.000010017438,"teacher_disagreement_score":0.582549,"about_ca_system_score_codex":0.00025350074,"about_ca_system_score_gemma":0.00066424266,"threshold_uncertainty_score":0.69063044},"labels":[],"label_agreement":null},{"id":"W2519986854","doi":"10.13001/1081-3810.3333","title":"Generalizations of the Cauchy and Fujiwara Bounds for Products of Zeros of a Polynomial","year":2016,"lang":"en","type":"article","venue":"Electronic Journal of Linear Algebra","topic":"Mathematical functions and polynomials","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Mathematics; Generalization; Upper and lower bounds; Polynomial; Cauchy distribution; Modulus; Product (mathematics); Combinatorics; Pure mathematics; Mathematical analysis; Geometry","score_opus":0.02758767786774267,"score_gpt":0.2877214676727623,"score_spread":0.2601337898050196,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2519986854","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97006625,0.00074356725,0.027228702,0.001391103,0.00015156755,0.0003116489,0.000035137105,0.0000038922217,0.0000681192],"genre_scores_gemma":[0.9927514,0.00012981432,0.006027237,0.00001743878,0.00026142524,0.000004243033,4.2098233e-7,0.0000194616,0.00078852376],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9986224,0.00006619832,0.0008126881,0.00008236298,0.00019862528,0.00021773083],"domain_scores_gemma":[0.99798214,0.0004947405,0.0008487678,0.00024136741,0.00039341615,0.00003955645],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000760934,0.00010129838,0.0004121979,0.00008650402,0.000052231608,0.0000050283925,0.00018232713,0.000060614188,0.000051508723],"category_scores_gemma":[0.0012350145,0.000053191805,0.00017049439,0.00016494274,0.0001334594,0.00007411967,0.000033743025,0.00009949896,3.540351e-7],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035134438,0.00052763644,0.0005513488,0.00076579367,0.0005772193,2.7785637e-7,0.0010744,0.000009804098,0.360563,0.6248223,0.008777174,0.0019796912],"study_design_scores_gemma":[0.0027062478,0.0014397198,0.00022380793,0.00044399008,0.0004976511,0.000113895236,0.000103672275,0.00012748524,0.6926889,0.29436052,0.0071088313,0.00018527335],"about_ca_topic_score_codex":0.0000049314285,"about_ca_topic_score_gemma":0.0000070664496,"teacher_disagreement_score":0.3321259,"about_ca_system_score_codex":0.000038058104,"about_ca_system_score_gemma":0.0005048575,"threshold_uncertainty_score":0.21690989},"labels":[],"label_agreement":null},{"id":"W2533396634","doi":"10.13001/1081-3810.3109","title":"Numerical Range for the Matrix Exponential Function","year":2016,"lang":"en","type":"article","venue":"Electronic Journal of Linear Algebra","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Mathematics; Numerical range; Matrix function; Matrix exponential; Matrix (chemical analysis); Range (aeronautics); Function (biology); Exponential function; Pure mathematics; Mathematical analysis; Applied mathematics; Eigenvalues and eigenvectors; Symmetric matrix; Differential equation","score_opus":0.0085252060231517,"score_gpt":0.24774125764244567,"score_spread":0.23921605161929396,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2533396634","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0041361176,0.0018834627,0.9881241,0.004895701,0.00078719715,0.000112534406,9.061726e-7,0.000025294257,0.00003470709],"genre_scores_gemma":[0.99259645,0.00020459876,0.004360556,0.00018665114,0.0017381487,0.0000067891588,2.3905554e-7,0.000013120224,0.0008934253],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987962,0.000092346636,0.00031870513,0.00013018546,0.00025657789,0.00040596144],"domain_scores_gemma":[0.9988724,0.0004588769,0.00024496226,0.00023161118,0.00012841228,0.00006376042],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012262333,0.000101584075,0.00015788946,0.000065708846,0.00015504048,0.000048042068,0.0007142669,0.000044056193,0.00009312562],"category_scores_gemma":[0.000093372095,0.000049225164,0.00021960668,0.00013179457,0.000031131956,0.0003885597,0.00004159606,0.0002071234,0.000040617695],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006669469,0.00013626904,0.000043701642,0.000013000559,0.00029249012,0.000010298787,0.00021969494,0.00009490117,0.0053650276,0.7500931,0.0036677797,0.23939678],"study_design_scores_gemma":[0.008663276,0.0055252253,0.00047539137,0.00010816728,0.00026723792,0.0013029361,0.00008631001,0.036348794,0.020860188,0.5304898,0.39517272,0.0006999471],"about_ca_topic_score_codex":0.0000012932235,"about_ca_topic_score_gemma":5.921192e-7,"teacher_disagreement_score":0.98846036,"about_ca_system_score_codex":0.00005276315,"about_ca_system_score_gemma":0.00018705126,"threshold_uncertainty_score":0.20073439},"labels":[],"label_agreement":null},{"id":"W2599943070","doi":"10.13001/1081-3810.3249","title":"The Enhanced Principal Rank Characteristic Sequence for Hermitian Matrices","year":2017,"lang":"en","type":"article","venue":"Electronic Journal of Linear Algebra","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Hermitian matrix; Mathematics; Rank (graph theory); Combinatorics; Sequence (biology); Matrix (chemical analysis); Symmetric matrix; Matrix analysis; Pure mathematics; Eigenvalues and eigenvectors; Physics; Quantum mechanics; Chemistry","score_opus":0.015516357366676262,"score_gpt":0.28922071721186376,"score_spread":0.2737043598451875,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2599943070","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20742722,0.002137334,0.7830584,0.0050009573,0.0014273743,0.00034137227,0.0000050406834,0.000045718425,0.000556583],"genre_scores_gemma":[0.9933719,0.0005701001,0.0043838657,0.00009676145,0.0008673835,0.000007801378,5.231552e-7,0.000012268796,0.0006893704],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998437,0.00008326014,0.00043188056,0.00017688691,0.00027280598,0.0005981925],"domain_scores_gemma":[0.99785906,0.00030170288,0.0008911837,0.0006081348,0.0002429951,0.00009693855],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018267846,0.00014107957,0.0002307719,0.000050440554,0.0010433074,0.000500656,0.0025252576,0.00005058702,0.0000092309765],"category_scores_gemma":[0.0004054087,0.000092471455,0.00018364035,0.00007165242,0.000107609616,0.00076260907,0.00012861947,0.00039627275,0.0000165636],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002627083,0.00008508504,0.000036501522,0.00004681904,0.0002078611,0.000048529695,0.00049460254,0.000028370767,0.011159557,0.7585454,0.00013260072,0.22895195],"study_design_scores_gemma":[0.006252121,0.003898709,0.0023201704,0.00035062624,0.00019710425,0.0017849241,0.00013726593,0.056281116,0.12599555,0.6386066,0.16287713,0.0012986881],"about_ca_topic_score_codex":0.0000022559009,"about_ca_topic_score_gemma":0.0000054917277,"teacher_disagreement_score":0.7859447,"about_ca_system_score_codex":0.00007744661,"about_ca_system_score_gemma":0.0005275219,"threshold_uncertainty_score":0.8024382},"labels":[],"label_agreement":null},{"id":"W267502919","doi":"10.13001/1081-3810.1676","title":"Refined inertias of tree sign-patterns","year":2013,"lang":"en","type":"article","venue":"Electronic Journal of Linear Algebra","topic":"Graph theory and applications","field":"Mathematics","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Digraph; Sign (mathematics); Combinatorics; Diagonal; Eigenvalues and eigenvectors; Star (game theory); Zero (linguistics); Tree (set theory); Order (exchange); Path (computing); Diagonal matrix; Discrete mathematics; Mathematical analysis; Geometry; Physics; Computer science","score_opus":0.01815009844258741,"score_gpt":0.2780404169671313,"score_spread":0.25989031852454386,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W267502919","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9900103,0.00026976556,0.007892374,0.0009257695,0.000039210638,0.00013799063,0.0000023134414,0.000016351734,0.0007059285],"genre_scores_gemma":[0.9971833,0.000067678266,0.0020176456,0.00008137705,0.00015927372,0.0000072524053,0.0000014758155,0.000022708304,0.00045929285],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986601,0.00007929772,0.0006313962,0.000089954854,0.00021921353,0.00032006478],"domain_scores_gemma":[0.99865144,0.0002514158,0.0005341803,0.0002512166,0.00023613714,0.0000756336],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054910756,0.000120910685,0.00030285132,0.00013104265,0.000046940782,0.000011293499,0.0003186244,0.00006345115,0.00049240043],"category_scores_gemma":[0.00017692537,0.00009363944,0.00019086742,0.00020085023,0.00004021003,0.00014250269,0.000025610552,0.00038727946,0.000037740767],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004800779,0.00035337027,0.0005102596,0.000050615054,0.00022583103,0.0000024224516,0.00032336556,0.0000069871885,0.035917785,0.9550518,0.0023277816,0.00518182],"study_design_scores_gemma":[0.0007217648,0.0005013537,0.0010979085,0.00005999771,0.00009648895,0.00008490652,0.00015648136,0.000099024735,0.04082387,0.9546504,0.0015744619,0.00013334569],"about_ca_topic_score_codex":0.00000981825,"about_ca_topic_score_gemma":0.00001771261,"teacher_disagreement_score":0.007173,"about_ca_system_score_codex":0.00003947832,"about_ca_system_score_gemma":0.00013192103,"threshold_uncertainty_score":0.5391439},"labels":[],"label_agreement":null},{"id":"W2750797687","doi":"10.13001/1081-3810.3400","title":"A new kind of companion matrix","year":2017,"lang":"en","type":"article","venue":"Electronic Journal of Linear Algebra","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Mandelbrot set; Mathematics; Matrix (chemical analysis); Pure mathematics; Companion matrix; Combinatorics; Algebra over a field; Discrete mathematics; Polynomial matrix; Polynomial; Matrix polynomial; Mathematical analysis","score_opus":0.010201391416485068,"score_gpt":0.2765194685385296,"score_spread":0.2663180771220445,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2750797687","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14509274,0.002235154,0.8491562,0.001833038,0.0006185799,0.00008060703,9.02192e-7,0.000020425303,0.00096234475],"genre_scores_gemma":[0.9722765,0.00013760425,0.026237998,0.000032378524,0.00054924213,1.7237535e-7,2.1563442e-7,0.000008603374,0.0007572671],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998716,0.00006649914,0.0004247682,0.00012256746,0.00031923558,0.0003509541],"domain_scores_gemma":[0.99827164,0.000060591512,0.0008778937,0.0005387251,0.00013331848,0.00011782695],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009303795,0.00010970015,0.0002871635,0.00010808914,0.00016464028,0.00010337028,0.0017854568,0.00005123904,0.00005819129],"category_scores_gemma":[0.00008726345,0.000089398425,0.00016923914,0.000093542156,0.00004053491,0.00060155557,0.00015572543,0.00039378053,0.000022868682],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006954193,0.00010252188,0.00036152467,0.000022610264,0.00014060891,0.00003884863,0.0004035348,0.00010433215,0.0038540158,0.9364876,0.0011860126,0.057228852],"study_design_scores_gemma":[0.0060946424,0.003200389,0.005802321,0.0003410247,0.00013499212,0.0019881995,0.000074670694,0.025207482,0.11034149,0.795984,0.050060034,0.00077069894],"about_ca_topic_score_codex":0.000015411504,"about_ca_topic_score_gemma":0.00000426671,"teacher_disagreement_score":0.8271838,"about_ca_system_score_codex":0.000043892607,"about_ca_system_score_gemma":0.00058712834,"threshold_uncertainty_score":0.3645562},"labels":[],"label_agreement":null},{"id":"W2758431483","doi":"10.13001/1081-3810.3746","title":"Average Mixing Matrix of Trees","year":2018,"lang":"en","type":"preprint","venue":"Electronic Journal of Linear Algebra","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mixing (physics); Combinatorics; Mathematics; Bounded function; Rank (graph theory); Eigenvalues and eigenvectors; Upper and lower bounds; Tree (set theory); Matrix (chemical analysis); Physics; Mathematical analysis; Chemistry","score_opus":0.02305407482216389,"score_gpt":0.32347463859494224,"score_spread":0.30042056377277837,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2758431483","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9608125,0.0023381545,0.034940768,0.00033536492,0.00033804929,0.00026832378,0.000021550934,0.000033318614,0.00091195613],"genre_scores_gemma":[0.98913175,0.00042071458,0.008931933,0.000019460167,0.00087220344,0.0000055720243,0.0000058858946,0.000050685507,0.00056177855],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997771,0.00020328298,0.0010478914,0.0001922492,0.00036392608,0.00042161337],"domain_scores_gemma":[0.99692893,0.00045458763,0.0016564478,0.00051151647,0.00036575066,0.000082784114],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021151833,0.00025130194,0.0006711309,0.0002516227,0.000082140716,0.00002305917,0.00071375817,0.00024203418,0.00021902229],"category_scores_gemma":[0.0003454327,0.00021642553,0.00052619807,0.00017639987,0.000111140616,0.00006698905,0.00018886392,0.0013821349,0.000017383632],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019891158,0.0004107848,0.00010437912,0.00034764613,0.0008894466,0.0000097768125,0.0008466083,0.00022813708,0.004071311,0.9899548,0.0022897455,0.00064840267],"study_design_scores_gemma":[0.00038225623,0.00026206186,0.0000418851,0.00030796597,0.00022390293,0.000078571065,0.000056399946,0.00020267816,0.014090823,0.98155135,0.0026131666,0.00018895013],"about_ca_topic_score_codex":0.000003242802,"about_ca_topic_score_gemma":0.000014232071,"teacher_disagreement_score":0.02831925,"about_ca_system_score_codex":0.000104927356,"about_ca_system_score_gemma":0.0005777686,"threshold_uncertainty_score":0.8825577},"labels":[],"label_agreement":null},{"id":"W2888104633","doi":"10.13001/1081-3810.3647","title":"Inertia sets allowed by matrix patterns","year":2018,"lang":"en","type":"article","venue":"Electronic Journal of Linear Algebra","topic":"Mathematical Dynamics and Fractals","field":"Mathematics","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Mathematics; Eigenvalues and eigenvectors; Zero (linguistics); Sign (mathematics); Inertia; Equivalence (formal languages); Matrix (chemical analysis); Pure mathematics; Combinatorics; Mathematical analysis; Physics; Quantum mechanics","score_opus":0.014047141536572074,"score_gpt":0.31822282345464015,"score_spread":0.3041756819180681,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2888104633","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.92635137,0.00047437294,0.07076035,0.001121055,0.00018890195,0.00014190993,0.000013955475,0.000034062694,0.0009140007],"genre_scores_gemma":[0.9944295,0.00012281368,0.0035867025,0.00017964338,0.00046499225,0.0000017090829,0.0000042256306,0.000050185485,0.0011602214],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99795383,0.000074070675,0.00078860193,0.0001445989,0.00043139324,0.00060752884],"domain_scores_gemma":[0.9985453,0.00025575238,0.0005265579,0.0002641872,0.00025307154,0.00015512988],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000965377,0.00019846285,0.00043785386,0.00009825797,0.000079082136,0.000040643063,0.00038690114,0.000116030635,0.000809239],"category_scores_gemma":[0.00039867265,0.00015066462,0.00020575894,0.00014677459,0.000059304635,0.00014572096,0.000053971547,0.00054499984,0.00009202206],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004273791,0.0019867872,0.0012994102,0.00043308022,0.001575936,0.0001081989,0.0016208272,0.0000048628863,0.02786541,0.8787981,0.07870563,0.0071743713],"study_design_scores_gemma":[0.0024303123,0.0026456886,0.00015618028,0.000286552,0.00031530237,0.00071920414,0.00016954576,0.011113134,0.009505082,0.9432567,0.028720612,0.0006817319],"about_ca_topic_score_codex":0.0000048456877,"about_ca_topic_score_gemma":0.000017011535,"teacher_disagreement_score":0.068078116,"about_ca_system_score_codex":0.000106013336,"about_ca_system_score_gemma":0.00016086228,"threshold_uncertainty_score":0.88605994},"labels":[],"label_agreement":null},{"id":"W2888141495","doi":"10.13001/1081-3810.3613","title":"Some Graphs Determined By Their Distance Spectrum","year":2018,"lang":"en","type":"article","venue":"Electronic Journal of Linear Algebra","topic":"Graph theory and applications","field":"Mathematics","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Mathematics; Lambda; Spectrum (functional analysis); Combinatorics; Graph; Order (exchange); Discrete mathematics; Physics; Quantum mechanics","score_opus":0.012449170809009053,"score_gpt":0.2699552457101116,"score_spread":0.25750607490110256,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2888141495","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98197335,0.0016873385,0.0143501,0.0012633344,0.00015309338,0.00014434027,0.00001606924,0.00004464408,0.00036773752],"genre_scores_gemma":[0.99760985,0.00025004984,0.00077395054,0.00015720369,0.0007171481,0.000004074475,0.0000023507819,0.000031412645,0.00045393116],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99860674,0.00007701485,0.00047609003,0.00014206392,0.00019444354,0.0005036425],"domain_scores_gemma":[0.9988845,0.00020074865,0.00041400315,0.00029814363,0.0001019576,0.0001006386],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006833194,0.0001664196,0.00027876298,0.00009802693,0.00017820233,0.000024356863,0.00041600526,0.000064774715,0.00010422668],"category_scores_gemma":[0.00009088177,0.00012702716,0.00020062024,0.000265041,0.0001579091,0.00018759363,0.00002463257,0.0004332058,0.000025440959],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000062823965,0.00013812412,0.00006123928,0.000008727087,0.000099129415,0.0000021516232,0.000224463,1.6016409e-7,0.006172225,0.9891168,0.0036223826,0.0004917927],"study_design_scores_gemma":[0.00042349272,0.00045856516,0.000027786447,0.000025669078,0.000039012197,0.00010154556,0.00005360722,0.00004360674,0.049214464,0.9344197,0.015059387,0.00013317542],"about_ca_topic_score_codex":9.926745e-7,"about_ca_topic_score_gemma":0.000014383487,"teacher_disagreement_score":0.054697093,"about_ca_system_score_codex":0.0000629049,"about_ca_system_score_gemma":0.00012859337,"threshold_uncertainty_score":0.5180017},"labels":[],"label_agreement":null},{"id":"W2895947321","doi":"10.13001/1081-3810.3918","title":"On Orthogonal Matrices with Zero Diagonal","year":2019,"lang":"en","type":"preprint","venue":"Electronic Journal of Linear Algebra","topic":"Graph theory and applications","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba; Memorial University of Newfoundland","funders":"Natural Sciences and Engineering Research Council of Canada; Memorial University of Newfoundland; University of Manitoba; University of Regina","keywords":"Diagonal; Zero (linguistics); Eigenvalues and eigenvectors; Combinatorics; Mathematics; Diagonal matrix; Main diagonal; Physics; Geometry; Quantum mechanics","score_opus":0.017305659884399725,"score_gpt":0.2892703387843755,"score_spread":0.2719646788999758,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2895947321","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97029734,0.0013003309,0.025925852,0.0006135521,0.00022552426,0.00038533856,0.000029947614,0.000039862633,0.0011822649],"genre_scores_gemma":[0.99506664,0.00037978828,0.0032796925,0.00012997496,0.0004695084,0.000015513619,0.00001643947,0.0000722412,0.00057017733],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977012,0.00013924531,0.00070186023,0.00029147588,0.0006273708,0.00053881324],"domain_scores_gemma":[0.99705756,0.0007896185,0.0012454162,0.00051382964,0.0002774354,0.00011612543],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0010887813,0.0003555505,0.0006384969,0.0002818982,0.00010067553,0.000052432442,0.00068387145,0.00024215684,0.00020157655],"category_scores_gemma":[0.00011120829,0.0002563648,0.00038041355,0.00020235612,0.00007095784,0.00007930655,0.00012351385,0.0025968903,0.00007400139],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033799617,0.0003194836,0.00013250936,0.00012562319,0.00053722295,0.0000153909,0.00011757023,0.00087086955,0.00005384255,0.99535257,0.0017163529,0.00042055122],"study_design_scores_gemma":[0.000659968,0.0007562721,0.00008545059,0.00034096095,0.00028294005,0.00022279772,0.000027203849,0.000111619316,0.0005439297,0.9947692,0.0019114962,0.00028811922],"about_ca_topic_score_codex":0.000001218423,"about_ca_topic_score_gemma":0.0000058492014,"teacher_disagreement_score":0.024769338,"about_ca_system_score_codex":0.00014837741,"about_ca_system_score_gemma":0.0011307638,"threshold_uncertainty_score":0.99998885},"labels":[],"label_agreement":null},{"id":"W2914801290","doi":"10.13001/1081-3810.3842","title":"Pairwise Completely Positive Matrices and Conjugate Local Diagonal Unitary Invariant Quantum States","year":2019,"lang":"en","type":"article","venue":"Electronic Journal of Linear Algebra","topic":"Quantum Information and Cryptography","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Mount Allison University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Quantum entanglement; Positive-definite matrix; Diagonal; Invariant (physics); Unitary state; Quantum state; Pairwise comparison; Quantum; Unitary matrix","score_opus":0.005177168390815553,"score_gpt":0.20872590632698293,"score_spread":0.20354873793616737,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2914801290","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7070327,0.002529258,0.2882726,0.001606338,0.00019541051,0.00012800937,0.0000068524246,0.000034116376,0.00019471928],"genre_scores_gemma":[0.9964493,0.0008553092,0.001580189,0.0010163583,0.00006677902,7.220092e-7,0.0000072176035,0.000009728602,0.000014412026],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99828196,0.00012879136,0.000550103,0.00015530591,0.00040299457,0.0004808684],"domain_scores_gemma":[0.9987819,0.00022197569,0.00040335674,0.00018405772,0.00024632868,0.00016237308],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007878557,0.00017148102,0.00029420698,0.00029613855,0.00009773002,0.0001287234,0.0005313553,0.000055953795,0.00005525911],"category_scores_gemma":[0.000016676711,0.00013741522,0.00012219173,0.00040274728,0.00009253278,0.0010777755,0.00010885473,0.0005154577,0.00008359997],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017802524,0.00011697675,0.0013593414,0.000041623673,0.00025507258,0.000049593073,0.0016896095,0.00046954173,0.00040598912,0.9874798,0.00076474994,0.007189671],"study_design_scores_gemma":[0.0057444186,0.007443528,0.017387837,0.00027553207,0.00010969648,0.0026875753,0.0020563023,0.70295423,0.0037765433,0.23960666,0.016857198,0.0011004381],"about_ca_topic_score_codex":0.000022447892,"about_ca_topic_score_gemma":0.0000060332695,"teacher_disagreement_score":0.7478731,"about_ca_system_score_codex":0.000060158323,"about_ca_system_score_gemma":0.00037005992,"threshold_uncertainty_score":0.560363},"labels":[],"label_agreement":null},{"id":"W2953398301","doi":"10.13001/1081-3810.3839","title":"Non-sparse Companion Matrices","year":2019,"lang":"en","type":"article","venue":"Electronic Journal of Linear Algebra","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Redeemer University; University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; Universities Space Research Association","keywords":"Companion matrix; Mathematics; Matrix (chemical analysis); Simple (philosophy); Integer matrix; Realization (probability); Matrix analysis; Combinatorics; Polynomial; Polynomial matrix; Discrete mathematics; Matrix polynomial; Algebra over a field; Pure mathematics; Symmetric matrix; Nonnegative matrix; Eigenvalues and eigenvectors; Mathematical analysis","score_opus":0.006020204244693108,"score_gpt":0.23034148273373148,"score_spread":0.22432127848903838,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2953398301","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7417164,0.002426708,0.25252354,0.00082894845,0.00092580443,0.00013742465,5.642543e-7,0.00004588076,0.0013947813],"genre_scores_gemma":[0.99264413,0.00024328282,0.0059571504,0.00016512179,0.000392827,4.9070843e-7,5.0670104e-7,0.000010895149,0.0005856042],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985598,0.00007058329,0.00039533785,0.00016208692,0.0003461036,0.00046610736],"domain_scores_gemma":[0.99901986,0.00008572893,0.00036746566,0.00030563388,0.00012667292,0.00009461899],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010281885,0.00013024341,0.0002682271,0.00016727745,0.0000627366,0.00007524982,0.0010383484,0.000053172625,0.0001155576],"category_scores_gemma":[0.000013811216,0.00010363595,0.00015363573,0.00036284197,0.000017242013,0.00061392586,0.00009964483,0.0005018474,0.00037228368],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012700523,0.0003835914,0.0017617459,0.00007640048,0.00028864166,0.00009396647,0.0010502349,0.0014260687,0.009670822,0.9460844,0.002030914,0.03700622],"study_design_scores_gemma":[0.010111485,0.0079670325,0.003913139,0.000511144,0.00017494401,0.005061192,0.0004548204,0.2910047,0.09498968,0.3916585,0.19202794,0.0021254197],"about_ca_topic_score_codex":0.0000027599847,"about_ca_topic_score_gemma":6.635173e-7,"teacher_disagreement_score":0.5544259,"about_ca_system_score_codex":0.000073541654,"about_ca_system_score_gemma":0.00032621584,"threshold_uncertainty_score":0.4785078},"labels":[],"label_agreement":null},{"id":"W2962704689","doi":"10.13001/1081-3810.3436","title":"Refined Inertia of Matrix Patterns","year":2017,"lang":"en","type":"article","venue":"Electronic Journal of Linear Algebra","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Redeemer University","funders":"","keywords":"Digraph; Mathematics; Eigenvalues and eigenvectors; Matrix (chemical analysis); Class (philosophy); Order (exchange); Property (philosophy); Combinatorics; Inertia; Matrix analysis; Pure mathematics; Computer science; Physics; Classical mechanics; Artificial intelligence","score_opus":0.009638604857215034,"score_gpt":0.27288219778819467,"score_spread":0.26324359293097965,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2962704689","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6032807,0.0013774742,0.39145452,0.002623198,0.0006221617,0.00008080439,0.0000031595343,0.000028316967,0.00052962673],"genre_scores_gemma":[0.99357927,0.00017420475,0.005311658,0.000060789007,0.00036466285,5.025218e-7,3.8262573e-7,0.000010061651,0.0004984467],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985679,0.000077253506,0.000507794,0.00013875976,0.0003144432,0.00039384293],"domain_scores_gemma":[0.9980337,0.00006369415,0.0009494783,0.0006806564,0.00018513385,0.00008734091],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010889759,0.000123285,0.0003019726,0.00012066696,0.00016459076,0.00008964049,0.0019490795,0.00005729954,0.00005144277],"category_scores_gemma":[0.00015101115,0.000097137694,0.00018059225,0.00008452274,0.00004773503,0.00059495587,0.0001934771,0.00041769288,0.000016381548],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001591726,0.0003388034,0.0036420885,0.00009373119,0.00037345593,0.00015979388,0.00066170515,0.0001447132,0.011991351,0.9124342,0.00070412166,0.069296874],"study_design_scores_gemma":[0.011302059,0.006819953,0.029828772,0.0008330311,0.00031145464,0.0033365951,0.00018160747,0.046880983,0.32019433,0.5252258,0.05321476,0.0018706404],"about_ca_topic_score_codex":0.000011488742,"about_ca_topic_score_gemma":0.000005956775,"teacher_disagreement_score":0.39029855,"about_ca_system_score_codex":0.00004365161,"about_ca_system_score_gemma":0.0003054351,"threshold_uncertainty_score":0.39611602},"labels":[],"label_agreement":null},{"id":"W2963967099","doi":"10.13001/1081-3810.3244","title":"Spectral Bound for Separations in Eulerian Digraphs","year":2017,"lang":"en","type":"article","venue":"Electronic Journal of Linear Algebra","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Digraph; Mathematics; Combinatorics; Eulerian path; Upper and lower bounds; Eigenvalues and eigenvectors; Laplacian matrix; Laplace operator; Discrete mathematics; Graph; Pure mathematics; Mathematical analysis","score_opus":0.036065542766523406,"score_gpt":0.3548031906885405,"score_spread":0.3187376479220171,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963967099","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9890486,0.00023861554,0.0074273925,0.0015612603,0.000102143335,0.00025680056,0.0000070768424,0.000011664445,0.001346428],"genre_scores_gemma":[0.9959607,0.00006659299,0.0032141616,0.000032641197,0.00029379112,0.000015182791,0.0000019694146,0.000018059454,0.00039691787],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99895865,0.00003513242,0.00041492647,0.000101789396,0.000117554584,0.00037192783],"domain_scores_gemma":[0.9988647,0.00018562004,0.00046538337,0.00033076646,0.00009312828,0.00006038945],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00086402864,0.00010379755,0.0002292536,0.00012487877,0.00037516077,0.000081085906,0.00041921256,0.000056936533,0.00003911713],"category_scores_gemma":[0.00031435615,0.00009187227,0.00019504121,0.00008045634,0.000074880234,0.00023780133,0.00001688514,0.0003339648,0.0000058991873],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000055017335,0.00013264664,0.0003471709,0.000009877582,0.000059539983,0.0000020328741,0.0002048776,0.0000062543113,0.0014596106,0.99692404,0.0005216428,0.0002772775],"study_design_scores_gemma":[0.000828665,0.00021380087,0.0011404401,0.000025556876,0.000046606536,0.000047686455,0.00006940746,0.000121441495,0.0031425366,0.988182,0.0060824594,0.000099406694],"about_ca_topic_score_codex":0.000003929733,"about_ca_topic_score_gemma":0.00023573317,"teacher_disagreement_score":0.00874206,"about_ca_system_score_codex":0.000058167756,"about_ca_system_score_gemma":0.00022500419,"threshold_uncertainty_score":0.37464425},"labels":[],"label_agreement":null},{"id":"W2964220986","doi":"10.13001/ela.2021.4975","title":"Generalized Standard Triples for Algebraic Linearizations of Matrix Polynomials","year":2021,"lang":"en","type":"preprint","venue":"Electronic Journal of Linear Algebra","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"Universidad de Alcalá","keywords":"Combinatorics; Mathematics; Polynomial; Order (exchange); Matrix (chemical analysis); Eigenvalues and eigenvectors; Physics; Mathematical analysis; Quantum mechanics","score_opus":0.014153262761410266,"score_gpt":0.288571903447922,"score_spread":0.27441864068651173,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2964220986","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.058536153,0.012810342,0.92544085,0.0012797972,0.0013006266,0.00046218364,0.00008320616,0.000046470257,0.000040389736],"genre_scores_gemma":[0.43609178,0.0050460817,0.553245,0.00028576935,0.0034335467,0.000044106735,0.00013671341,0.00013468767,0.0015823115],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99605185,0.000394818,0.0017309688,0.000463065,0.00063843187,0.0007208501],"domain_scores_gemma":[0.99540824,0.0004256015,0.0020381426,0.0007936889,0.0011607532,0.00017356683],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0025999898,0.00039803248,0.0012980794,0.0004641132,0.00015342684,0.00023857964,0.0019431477,0.00034012226,0.00008922822],"category_scores_gemma":[0.0005239085,0.00036272997,0.0009817807,0.00048578953,0.00007884629,0.00033934004,0.0005839389,0.0011322185,0.0000022795814],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007215146,0.00054585974,0.0000468877,0.0008037919,0.0023388183,0.000059303373,0.0018315904,0.0152073605,0.012750909,0.9465435,0.0019114605,0.017238962],"study_design_scores_gemma":[0.011157908,0.0038078297,0.000053648142,0.0013379793,0.0011869948,0.00097058644,0.00031300605,0.0985037,0.22603337,0.6163037,0.038163308,0.002167956],"about_ca_topic_score_codex":0.000009305331,"about_ca_topic_score_gemma":0.000007991282,"teacher_disagreement_score":0.37755564,"about_ca_system_score_codex":0.00022301967,"about_ca_system_score_gemma":0.0047972403,"threshold_uncertainty_score":0.99988246},"labels":[],"label_agreement":null},{"id":"W2972815894","doi":"10.13001/1081-3810.3950","title":"Consistency of Quaternion Matrix Equations $AX^{\\star}-XB=C$ and $X-AX^\\star B=C$","year":2019,"lang":"en","type":"article","venue":"Electronic Journal of Linear Algebra","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Transpose; Star (game theory); Quaternion; Mathematics; Uniqueness; Matrix (chemical analysis); Complex conjugate; Positive-definite matrix; Hermitian matrix; Pure mathematics; Combinatorics; Mathematical analysis; Physics; Geometry; Eigenvalues and eigenvectors; Quantum mechanics","score_opus":0.007281889495071087,"score_gpt":0.2452739567139639,"score_spread":0.23799206721889282,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2972815894","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.82236195,0.004666979,0.17079397,0.0011483148,0.00046472915,0.0002034734,0.0000042529973,0.000033506465,0.00032285132],"genre_scores_gemma":[0.98994887,0.00037088484,0.008764385,0.00007998075,0.00016995179,0.0000010768439,0.00000176255,0.000014439859,0.00064867403],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980082,0.00018713195,0.00069848285,0.0002259711,0.000415931,0.00046430124],"domain_scores_gemma":[0.9983803,0.00028129938,0.00059290446,0.00037264734,0.0002529631,0.00011990177],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014359282,0.00017339014,0.00039252118,0.00023537625,0.00009268405,0.00006136099,0.0006466789,0.00008095821,0.00011088211],"category_scores_gemma":[0.00010435039,0.00014584935,0.0001644926,0.00032326468,0.000067397865,0.0005800717,0.00012202456,0.0004732575,0.00005575704],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010312693,0.00020046228,0.0007795915,0.00010363718,0.00022174334,0.000024945472,0.001222446,0.00020970439,0.008657823,0.9790584,0.00011455843,0.009303568],"study_design_scores_gemma":[0.010393902,0.010001948,0.003270319,0.00073869963,0.00039430035,0.0025498052,0.0011588618,0.2313596,0.051632695,0.6610736,0.025495123,0.001931114],"about_ca_topic_score_codex":0.000015588628,"about_ca_topic_score_gemma":0.0000057756647,"teacher_disagreement_score":0.31798476,"about_ca_system_score_codex":0.00007996901,"about_ca_system_score_gemma":0.00050930714,"threshold_uncertainty_score":0.59475636},"labels":[],"label_agreement":null},{"id":"W301072399","doi":"10.13001/1081-3810.1348","title":"Matrices of positive polynomials","year":2009,"lang":"en","type":"article","venue":"Electronic Journal of Linear Algebra","topic":"Mathematical Dynamics and Fractals","field":"Mathematics","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Invariant (physics); Pure mathematics; Eigenvalues and eigenvectors; Endomorphism; Markov chain; Discrete mathematics","score_opus":0.013435833032795783,"score_gpt":0.3008375346143684,"score_spread":0.28740170158157263,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W301072399","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96160626,0.0019389543,0.030720105,0.0013044663,0.00008083975,0.00017761972,0.000008322833,0.000016513892,0.004146894],"genre_scores_gemma":[0.990979,0.00024641698,0.008229159,0.00009610998,0.00020898343,3.215028e-7,8.044048e-7,0.000015101553,0.00022407396],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99833137,0.00006234651,0.0008265571,0.0000859063,0.00033502642,0.00035880294],"domain_scores_gemma":[0.9982829,0.00042386845,0.00083329517,0.0001595535,0.00021749122,0.0000828769],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009767237,0.00013407347,0.00051184796,0.00014556933,0.00003524559,0.000014997756,0.00026584524,0.00007957246,0.00012695607],"category_scores_gemma":[0.00042918863,0.00010096896,0.00024126453,0.00018088603,0.000031989734,0.00012764224,0.000016863718,0.00035416358,0.000008143784],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012689432,0.00048065398,0.000028170696,0.00005551311,0.00020308347,0.000017243341,0.00036139606,0.0000065542686,0.008331208,0.9848144,0.00069011736,0.004884732],"study_design_scores_gemma":[0.0005974919,0.0012779084,0.00020487023,0.00013969501,0.00013463006,0.00019988568,0.000072370596,0.0006235952,0.010923163,0.9854234,0.00026221664,0.00014080858],"about_ca_topic_score_codex":0.0000018183667,"about_ca_topic_score_gemma":0.0000013516387,"teacher_disagreement_score":0.029372746,"about_ca_system_score_codex":0.00007031663,"about_ca_system_score_gemma":0.00019122043,"threshold_uncertainty_score":0.41173947},"labels":[],"label_agreement":null},{"id":"W3011317023","doi":"10.13001/ela.2020.5149","title":"The triangle graph $T_6$ is not SPN","year":2020,"lang":"en","type":"article","venue":"Electronic Journal of Linear Algebra","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Mathematics; Combinatorics; Graph; Converse; Symmetric matrix; Positive-definite matrix; Matrix (chemical analysis); Nonnegative matrix; Discrete mathematics; Eigenvalues and eigenvectors","score_opus":0.008990989875618341,"score_gpt":0.1987404812043778,"score_spread":0.18974949132875946,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3011317023","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9468574,0.030308878,0.0105383275,0.007860857,0.0014035418,0.00027578426,0.000009123431,0.00018901499,0.0025570514],"genre_scores_gemma":[0.9976865,0.0009026168,0.00003318539,0.00044462533,0.00078078767,0.0000017417319,5.124219e-7,0.000032484997,0.00011752538],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9986496,0.000079457175,0.00047929763,0.00008471614,0.00025013127,0.0004568145],"domain_scores_gemma":[0.9994064,0.000116348245,0.00013397854,0.00014830208,0.00006249008,0.0001324845],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006833856,0.00014324435,0.00026458304,0.00005624757,0.00012420578,0.000044565757,0.00038618495,0.00006377385,0.00007240376],"category_scores_gemma":[0.00006188794,0.000098280325,0.00028481203,0.00030984893,0.000034765337,0.00011882174,0.00001415881,0.00066626497,0.00007632568],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.003146737,0.00027889598,0.0008931156,0.0005251582,0.007507114,0.00035219936,0.01847416,0.01448401,0.12587623,0.579305,0.16033468,0.08882272],"study_design_scores_gemma":[0.0039052109,0.0018970086,0.0002313458,0.000108842316,0.00024985266,0.0005637276,0.0012591259,0.009932821,0.11382555,0.046014816,0.821263,0.0007486827],"about_ca_topic_score_codex":9.881459e-7,"about_ca_topic_score_gemma":0.000002724364,"teacher_disagreement_score":0.6609283,"about_ca_system_score_codex":0.000043510117,"about_ca_system_score_gemma":0.00008427294,"threshold_uncertainty_score":0.40077552},"labels":[],"label_agreement":null},{"id":"W3015171101","doi":"10.13001/ela.2020.5057","title":"Spectral Properties of Sign Patterns","year":2020,"lang":"en","type":"article","venue":"Electronic Journal of Linear Algebra","topic":"Advanced Differential Equations and Dynamical Systems","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Redeemer University; University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Sign (mathematics); Mathematics; Jacobian matrix and determinant; Nilpotent; Pure mathematics; Mathematical analysis; Applied mathematics","score_opus":0.04031225265795369,"score_gpt":0.2748174595637456,"score_spread":0.2345052069057919,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3015171101","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7531012,0.00047142597,0.24570368,0.0005017438,0.00005200856,0.000092607355,0.0000023574107,0.0000125675915,0.00006239705],"genre_scores_gemma":[0.9980751,0.000052285184,0.0013824631,0.00004532303,0.00037003006,0.0000010009765,6.916962e-7,0.000018860606,0.00005418954],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99868244,0.00006401173,0.00061695545,0.000084543244,0.00028396625,0.0002680859],"domain_scores_gemma":[0.9991748,0.00006380948,0.00044017838,0.00009247503,0.00013678806,0.000091996495],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020053961,0.00010640738,0.0003479953,0.00004253835,0.000030682524,0.0000098115715,0.0001875273,0.000043763288,0.00008134757],"category_scores_gemma":[0.00026036546,0.00007502755,0.00016651665,0.00011651147,0.000025786372,0.00010753314,0.000022275077,0.00031771086,0.0000061304077],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00088720047,0.00090865884,0.0020701508,0.0009677707,0.000994782,0.000035004847,0.004461439,0.0009435934,0.23250347,0.74779373,0.00036752282,0.008066664],"study_design_scores_gemma":[0.006814142,0.008739012,0.0007809685,0.0011312527,0.0006781136,0.00032501674,0.0024653906,0.039376516,0.28750762,0.64881605,0.0021812173,0.0011846824],"about_ca_topic_score_codex":0.000004908695,"about_ca_topic_score_gemma":0.000007052092,"teacher_disagreement_score":0.24497394,"about_ca_system_score_codex":0.000055653927,"about_ca_system_score_gemma":0.00014885643,"threshold_uncertainty_score":0.30595347},"labels":[],"label_agreement":null},{"id":"W3035542725","doi":"10.13001/ela.2020.5217","title":"Maximal Orientations of Graphs","year":2020,"lang":"en","type":"article","venue":"Electronic Journal of Linear Algebra","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Mathematics; Combinatorics; Discrete mathematics; Pure mathematics","score_opus":0.007608641683185857,"score_gpt":0.2030779890287413,"score_spread":0.19546934734555543,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3035542725","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97970873,0.0027441203,0.016342906,0.00018119645,0.00023038097,0.00005766204,0.000003965857,0.00003700451,0.00069404684],"genre_scores_gemma":[0.99942756,0.00014318092,0.00019658246,0.000039297516,0.0001610592,7.548274e-7,0.0000012844085,0.000017538605,0.000012721639],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9991348,0.000034138866,0.00039552542,0.00005119976,0.00015830046,0.00022604573],"domain_scores_gemma":[0.99962544,0.00003104496,0.00011655753,0.00006949528,0.00007280244,0.00008465767],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020956041,0.000084979576,0.00020482845,0.0000830477,0.000024917044,0.0000063572,0.0001640221,0.00003819068,0.00007650662],"category_scores_gemma":[0.000027444752,0.00007677468,0.00014864728,0.00031003915,0.000031969663,0.00011227143,0.0000069166667,0.0003172396,0.000013053895],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031220654,0.00013507601,0.0027883595,0.00033317544,0.0013571556,0.00005188888,0.005625739,0.019304646,0.11536024,0.8475739,0.0027761813,0.004381482],"study_design_scores_gemma":[0.010724656,0.009399825,0.0043772524,0.0005109507,0.0010541672,0.0017192841,0.007237175,0.034786347,0.51425403,0.32494187,0.088897444,0.0020970027],"about_ca_topic_score_codex":7.137184e-7,"about_ca_topic_score_gemma":0.0000010201736,"teacher_disagreement_score":0.52263194,"about_ca_system_score_codex":0.000022194046,"about_ca_system_score_gemma":0.00006625961,"threshold_uncertainty_score":0.31307808},"labels":[],"label_agreement":null},{"id":"W306917649","doi":"10.13001/1081-3810.3010","title":"Sparse spectrally arbitrary patterns","year":2015,"lang":"en","type":"article","venue":"Electronic Journal of Linear Algebra","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Redeemer University","funders":"","keywords":"Mathematics; Jacobian matrix and determinant; Monic polynomial; Matrix (chemical analysis); Order (exchange); Nilpotent matrix; Companion matrix; Zero (linguistics); Pure mathematics; Eigenvalues and eigenvectors; Polynomial; Combinatorics; Mathematical analysis; Polynomial matrix; Matrix polynomial; Applied mathematics; Symmetric matrix; Matrix function; Physics","score_opus":0.015614961687269835,"score_gpt":0.24412826624810127,"score_spread":0.22851330456083144,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W306917649","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30224118,0.002198511,0.6905019,0.002251055,0.00079625,0.000088095636,0.0000014317254,0.00007351726,0.0018480286],"genre_scores_gemma":[0.98140335,0.00015498984,0.016275484,0.00062586385,0.0010772181,7.8325735e-7,8.911325e-7,0.0000170274,0.00044440807],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99825674,0.00013413557,0.00043315376,0.00016945343,0.00044188325,0.0005646144],"domain_scores_gemma":[0.9989623,0.00005844898,0.00029126968,0.0003162215,0.00016128113,0.00021052216],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014079368,0.0001492365,0.00025065898,0.00014818706,0.000051926803,0.000079447236,0.001111081,0.00005527043,0.000042512474],"category_scores_gemma":[0.00006229774,0.00012152396,0.00015734324,0.00026255744,0.00002519479,0.0006465676,0.0000939997,0.00065858616,0.00008170187],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013139134,0.00036032897,0.0009233268,0.00001974201,0.00023213396,0.00063324766,0.0013079818,0.00029932207,0.00064993236,0.9714931,0.002943492,0.021005992],"study_design_scores_gemma":[0.004013466,0.004189026,0.0008599335,0.00012309305,0.000076374636,0.0059438255,0.00022462383,0.017695803,0.026995426,0.88578504,0.05322527,0.0008681373],"about_ca_topic_score_codex":0.0000040311324,"about_ca_topic_score_gemma":0.000003453373,"teacher_disagreement_score":0.67916214,"about_ca_system_score_codex":0.00011604865,"about_ca_system_score_gemma":0.0008608997,"threshold_uncertainty_score":0.49556032},"labels":[],"label_agreement":null},{"id":"W3075990811","doi":"10.13001/ela.2020.4929","title":"Relations between classes of potentially stable sign patterns","year":2020,"lang":"en","type":"article","venue":"Electronic Journal of Linear Algebra","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada; St. Olaf College","keywords":"Sign (mathematics); Mathematics; Combinatorics; Order (exchange); Graph; Tree (set theory); Mathematical analysis","score_opus":0.019165488024013043,"score_gpt":0.2461088728421662,"score_spread":0.22694338481815315,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3075990811","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17251588,0.0006520406,0.82231164,0.0041272524,0.00013213299,0.00010529488,0.0000053668323,0.00004291653,0.000107503576],"genre_scores_gemma":[0.9690533,0.000052326734,0.030150123,0.00016051998,0.00052661996,7.9217745e-7,0.0000022678773,0.00001578182,0.000038267506],"study_design_codex":"observational","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975124,0.00021182958,0.0008761224,0.00026903258,0.0006033572,0.00052723585],"domain_scores_gemma":[0.9981108,0.00031766878,0.00063523324,0.00032160155,0.00041375667,0.0002009876],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008344372,0.00017387708,0.00045285258,0.00013828443,0.00008847653,0.0000680466,0.0012712365,0.00008414794,0.0000791233],"category_scores_gemma":[0.00022694614,0.0001567053,0.00024655214,0.00060580485,0.000044248613,0.0005844176,0.00025214735,0.0007345124,0.000023012608],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035026766,0.0023082732,0.33598828,0.00055537635,0.003710605,0.000376681,0.0112317195,0.04138415,0.027394239,0.27095646,0.0064307773,0.29931316],"study_design_scores_gemma":[0.010904776,0.025186732,0.24915239,0.00050949573,0.0010552591,0.0008142991,0.00072848273,0.2547109,0.09846841,0.31542647,0.03968075,0.003362028],"about_ca_topic_score_codex":0.000015193907,"about_ca_topic_score_gemma":0.0000075994685,"teacher_disagreement_score":0.7965374,"about_ca_system_score_codex":0.00013783379,"about_ca_system_score_gemma":0.0010122079,"threshold_uncertainty_score":0.6390257},"labels":[],"label_agreement":null},{"id":"W3099424694","doi":"10.13001/ela.2020.5461","title":"Some notes on quantum Hellinger divergences with Heinz means","year":2020,"lang":"en","type":"article","venue":"Electronic Journal of Linear Algebra","topic":"Statistical Mechanics and Entropy","field":"Physics and Astronomy","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Mathematics; Convexity; Limiting; Hellinger distance; Betweenness centrality; Quantum; Property (philosophy); Pure mathematics; Combinatorics; Applied mathematics; Quantum mechanics; Philosophy; Epistemology; Physics","score_opus":0.014830893304945195,"score_gpt":0.23999432400816845,"score_spread":0.22516343070322326,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3099424694","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5403102,0.0012015147,0.45190528,0.0058292183,0.00031990084,0.00013474934,0.000027107366,0.00002201423,0.00025004067],"genre_scores_gemma":[0.99716675,0.00009431838,0.0006453886,0.00036300987,0.0016824339,0.0000011697695,0.000003584961,0.00002046375,0.00002287057],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988244,0.000035462253,0.00028210605,0.00014472436,0.00030327373,0.00041000123],"domain_scores_gemma":[0.99933386,0.00012488196,0.00020058267,0.00007987521,0.00008894682,0.00017188294],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013385642,0.00015357067,0.00026461255,0.000034452307,0.000084262356,0.000029763107,0.00019894005,0.000023775961,0.00041445738],"category_scores_gemma":[0.00002601329,0.000102074824,0.00011554731,0.00012613223,0.000024547708,0.0001032526,0.000018364295,0.00047820996,0.000072639225],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022900193,0.00009873954,0.0006497455,0.000006242701,0.00024251825,0.000012237667,0.00018983718,0.00078405126,0.00045524287,0.99391675,0.0003059034,0.0031097454],"study_design_scores_gemma":[0.0044672326,0.016839324,0.00034444773,0.000228962,0.00049962295,0.000026551737,0.0009928895,0.10943177,0.04112176,0.80199313,0.022931844,0.0011224729],"about_ca_topic_score_codex":0.000013455616,"about_ca_topic_score_gemma":5.493754e-7,"teacher_disagreement_score":0.45685658,"about_ca_system_score_codex":0.000023391436,"about_ca_system_score_gemma":0.0001653569,"threshold_uncertainty_score":0.45380175},"labels":[],"label_agreement":null},{"id":"W3100702052","doi":"","title":"Pairwise Completely Positive Matrices and Conjugate Local Diagonal Unitary Invariant Quantum States","year":2019,"lang":"en","type":"article","venue":"Electronic Journal of Linear Algebra","topic":"Quantum Information and Cryptography","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Mount Allison University","funders":"","keywords":"Mathematics; Quantum entanglement; Separable state; Quantum state; Diagonal; Separable space; Unitary state; Positive-definite matrix; Invariant (physics); Pairwise comparison; Pure mathematics; Quantum; Combinatorics; Quantum mechanics; Quantum discord; Mathematical physics; Mathematical analysis; Physics; Eigenvalues and eigenvectors","score_opus":0.005177168390815553,"score_gpt":0.20872590632698293,"score_spread":0.20354873793616737,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3100702052","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7070327,0.002529258,0.2882726,0.001606338,0.00019541051,0.00012800937,0.0000068524246,0.000034116376,0.00019471928],"genre_scores_gemma":[0.9964493,0.0008553092,0.001580189,0.0010163583,0.00006677902,7.220092e-7,0.0000072176035,0.000009728602,0.000014412026],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99828196,0.00012879136,0.000550103,0.00015530591,0.00040299457,0.0004808684],"domain_scores_gemma":[0.9987819,0.00022197569,0.00040335674,0.00018405772,0.00024632868,0.00016237308],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007878557,0.00017148102,0.00029420698,0.00029613855,0.00009773002,0.0001287234,0.0005313553,0.000055953795,0.00005525911],"category_scores_gemma":[0.000016676711,0.00013741522,0.00012219173,0.00040274728,0.00009253278,0.0010777755,0.00010885473,0.0005154577,0.00008359997],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017802524,0.00011697675,0.0013593414,0.000041623673,0.00025507258,0.000049593073,0.0016896095,0.00046954173,0.00040598912,0.9874798,0.00076474994,0.007189671],"study_design_scores_gemma":[0.0057444186,0.007443528,0.017387837,0.00027553207,0.00010969648,0.0026875753,0.0020563023,0.70295423,0.0037765433,0.23960666,0.016857198,0.0011004381],"about_ca_topic_score_codex":0.000022447892,"about_ca_topic_score_gemma":0.0000060332695,"teacher_disagreement_score":0.7478731,"about_ca_system_score_codex":0.000060158323,"about_ca_system_score_gemma":0.00037005992,"threshold_uncertainty_score":0.560363},"labels":[],"label_agreement":null},{"id":"W3123329527","doi":"10.13001/1081-3810.3616","title":"Correlation Matrices with the Perron Frobenius Property","year":2018,"lang":"en","type":"article","venue":"Electronic Journal of Linear Algebra","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University","funders":"","keywords":"Mathematics; Eigenvalues and eigenvectors; Matrix (chemical analysis); Correlation; Property (philosophy); Covariance matrix; Random matrix; Pure mathematics; Positive-definite matrix; Applied mathematics; Statistics","score_opus":0.0038440464567341044,"score_gpt":0.1836140637354046,"score_spread":0.17977001727867048,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3123329527","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96533316,0.00426404,0.027086765,0.00030165978,0.00039289612,0.00013918964,7.01174e-7,0.00006141069,0.0024201476],"genre_scores_gemma":[0.9986608,0.000095955824,0.000075418415,0.00002940454,0.0007170992,0.0000017417184,6.072256e-7,0.000023430995,0.00039552661],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991839,0.00005800524,0.00022250626,0.00006103469,0.000191676,0.00028289005],"domain_scores_gemma":[0.99957293,0.000034809,0.000116870884,0.00012398024,0.00011246641,0.000038954546],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005108415,0.00010731197,0.0001413127,0.00006626533,0.000110170215,0.000027592363,0.00020103088,0.000046699763,0.00007090086],"category_scores_gemma":[0.000009631304,0.00004881004,0.00006167958,0.00020618323,0.00005519355,0.00016983523,0.0000067939304,0.00039685905,0.00005001151],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0074724983,0.0010062191,0.01890034,0.0010290394,0.0101457825,0.00028228675,0.057840213,0.21357337,0.11265844,0.3217539,0.112583995,0.14275393],"study_design_scores_gemma":[0.007995327,0.014972832,0.00611132,0.00096560235,0.0011942032,0.007394981,0.0063199247,0.2506712,0.05135664,0.023598133,0.6271623,0.0022575413],"about_ca_topic_score_codex":0.000004075191,"about_ca_topic_score_gemma":0.000030339654,"teacher_disagreement_score":0.5145783,"about_ca_system_score_codex":0.00006268332,"about_ca_system_score_gemma":0.000073396004,"threshold_uncertainty_score":0.19904156},"labels":[],"label_agreement":null},{"id":"W3136240306","doi":"10.13001/ela.2021.5361","title":"Spectral theory for self-adjoint quadratic eigenvalue problems - a review","year":2021,"lang":"en","type":"review","venue":"Electronic Journal of Linear Algebra","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada; European Regional Development Fund; Euskal Herriko Unibertsitatea; Ministerio de Ciencia, Innovación y Universidades","keywords":"Mathematics; Hermitian matrix; Eigenvalues and eigenvectors; Lambda; Canonical form; Polynomial; Pure mathematics; Matrix (chemical analysis); Combinatorics; Mathematical analysis; Quantum mechanics","score_opus":0.023936926911975073,"score_gpt":0.3078404321934674,"score_spread":0.28390350528149233,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3136240306","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[3.067798e-7,0.7879441,0.21022688,0.00021129861,0.00047672325,0.0009868331,0.000005633564,0.00005482546,0.000093402836],"genre_scores_gemma":[8.868081e-7,0.97735125,0.020629792,0.00022847207,0.0012008984,0.000060887178,0.0000145194745,0.0000709229,0.0004423757],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9943394,0.0013219446,0.0020971855,0.0005608078,0.00057962275,0.0011010456],"domain_scores_gemma":[0.9956451,0.0008013333,0.002079823,0.00087459903,0.00037327837,0.00022585403],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0070950408,0.0006380115,0.0031522873,0.00028123072,0.0001758356,0.0001612107,0.002270537,0.00024113756,0.000098364966],"category_scores_gemma":[0.00037348876,0.00046299025,0.0022855196,0.000877332,0.0000411876,0.0004001919,0.00020005122,0.0016974629,0.000051844192],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000033583224,0.0001490228,1.4993018e-8,0.025410863,0.00078697864,0.000052502026,0.00008685427,0.0000034056784,3.5795722e-7,0.41582885,0.0006656746,0.55701214],"study_design_scores_gemma":[0.00029082177,0.00068192324,1.1981188e-8,0.037675053,0.0013668368,0.0020773814,0.0000051455095,0.00023010171,0.000010868318,0.063441016,0.8937484,0.0004724196],"about_ca_topic_score_codex":4.925809e-7,"about_ca_topic_score_gemma":8.824485e-7,"teacher_disagreement_score":0.89308274,"about_ca_system_score_codex":0.00045569678,"about_ca_system_score_gemma":0.00534274,"threshold_uncertainty_score":0.9997822},"labels":[],"label_agreement":null},{"id":"W3153741534","doi":"10.13001/ela.2021.5691","title":"Beyond the Fan-Hoffman inequality","year":2021,"lang":"en","type":"article","venue":"Electronic Journal of Linear Algebra","topic":"Mathematical Inequalities and Applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Mathematics; Zhàng; Inequality; Ky Fan inequality; Conjecture; Mathematical economics; Log sum inequality; Singular value; Bernoulli's inequality; Kantorovich inequality; Rearrangement inequality; Value (mathematics); Calculus (dental); Pure mathematics; Algebra over a field; Mathematical analysis; Linear inequality; Statistics; Political science; Law; China","score_opus":0.04645091527640388,"score_gpt":0.3433889793378438,"score_spread":0.2969380640614399,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3153741534","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8181563,0.003333732,0.13299833,0.03169118,0.0002812744,0.0003274653,0.000017370814,0.0000665051,0.0131278355],"genre_scores_gemma":[0.9898033,0.00020037094,0.0059791612,0.00085854775,0.0007330555,0.0000083128625,0.0000038342255,0.000032740794,0.002380653],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980703,0.0001901703,0.000791612,0.00012110767,0.00040413064,0.00042269347],"domain_scores_gemma":[0.99773365,0.00097096636,0.00042567533,0.00043218417,0.00034902387,0.000088497094],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016156974,0.00013696196,0.0003385277,0.00003330537,0.00016225636,0.0000466766,0.00036146698,0.000065718275,0.00064553745],"category_scores_gemma":[0.00084615045,0.000085819534,0.00024573292,0.00026452,0.00006168288,0.00008965237,0.00007095128,0.0006530236,0.000033074488],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000078902285,0.00016680628,0.00001602999,0.000040543746,0.00010472839,0.0000072391394,0.00043995705,0.0000016545155,0.0006144083,0.9922786,0.0057529444,0.0005692129],"study_design_scores_gemma":[0.0002959535,0.000090096255,0.000024808263,0.0000260287,0.00008536217,0.00023504705,0.0007610943,0.00011886075,0.0063238638,0.9699716,0.021959092,0.00010819522],"about_ca_topic_score_codex":0.0000029768885,"about_ca_topic_score_gemma":0.000020311732,"teacher_disagreement_score":0.17164703,"about_ca_system_score_codex":0.00007993652,"about_ca_system_score_gemma":0.00041175683,"threshold_uncertainty_score":0.7068182},"labels":[],"label_agreement":null},{"id":"W3177520723","doi":"10.13001/ela.2022.6695","title":"Linear systems of Diophantine equations","year":2022,"lang":"en","type":"preprint","venue":"Electronic Journal of Linear Algebra","topic":"Commutative Algebra and Its Applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Quotient; Rank (graph theory); Basis (linear algebra); Diophantine equation; Mathematics; Ideal (ethics); Matrix (chemical analysis); Principal ideal; Domain (mathematical analysis); Combinatorics; Discrete mathematics; Pure mathematics; Algebra over a field; Mathematical analysis; Geometry","score_opus":0.04729433940681459,"score_gpt":0.34656374351991037,"score_spread":0.29926940411309577,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3177520723","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6837851,0.020168446,0.2895413,0.0017572584,0.0012784147,0.0014900647,0.00022660966,0.00010082569,0.0016519642],"genre_scores_gemma":[0.9924557,0.0009913971,0.0044631306,0.000028333136,0.0008040559,0.00005687143,0.00005224458,0.00009564995,0.0010525971],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9961841,0.0003683456,0.0018363408,0.00027105925,0.00082860806,0.0005115286],"domain_scores_gemma":[0.9943172,0.0011568432,0.002833448,0.0007918764,0.00078800187,0.00011268051],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0019792428,0.00034335573,0.001056495,0.00044008484,0.00018345173,0.00003203696,0.0010830452,0.00018433979,0.00049337273],"category_scores_gemma":[0.0008761212,0.0003144236,0.0005606324,0.00045238802,0.00008849564,0.00010108659,0.0005974725,0.0025602325,0.000011355779],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011776466,0.00089575705,0.00016704707,0.00069201476,0.0016364614,0.000014832408,0.0014513733,0.0046516764,0.0017075257,0.98554903,0.0024551987,0.00066132436],"study_design_scores_gemma":[0.0025955022,0.00198621,0.00021137991,0.0008676117,0.001956307,0.0003231301,0.001683074,0.017446134,0.00438657,0.93587357,0.03151349,0.0011570174],"about_ca_topic_score_codex":0.000034785404,"about_ca_topic_score_gemma":0.000014373763,"teacher_disagreement_score":0.3086706,"about_ca_system_score_codex":0.00035208976,"about_ca_system_score_gemma":0.0016965896,"threshold_uncertainty_score":0.9999308},"labels":[],"label_agreement":null},{"id":"W3199683255","doi":"10.13001/ela.2022.7149","title":"Birkhoff-James orthogonality in the trace norm, with applications to quantum resource theories","year":2022,"lang":"en","type":"preprint","venue":"Electronic Journal of Linear Algebra","topic":"Quantum Information and Cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brandon University; University of Guelph; Mount Allison University","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Hermitian matrix; TRACE (psycholinguistics); Quantum entanglement; Positive-definite matrix; Mathematics; Orthogonality; Diagonal; Matrix (chemical analysis); Norm (philosophy); Quantum; Pure mathematics; Combinatorics; Quantum mechanics; Physics; Eigenvalues and eigenvectors","score_opus":0.010421250204409066,"score_gpt":0.2629180261600888,"score_spread":0.25249677595567976,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3199683255","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14113548,0.0030993912,0.83706224,0.015866257,0.00016936986,0.00089227344,0.000015797972,0.000078641235,0.0016805147],"genre_scores_gemma":[0.99121803,0.00026784564,0.005501638,0.0025133898,0.0002531767,0.00015872064,0.000013427368,0.000023626855,0.00005014735],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9968489,0.00042449692,0.0008660731,0.00030170663,0.0009959819,0.000562862],"domain_scores_gemma":[0.9976895,0.00027217728,0.0008052439,0.00091063697,0.00021183252,0.000110608176],"candidate_categories":["research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0032551286,0.00027614692,0.00040040104,0.0005149638,0.00026987624,0.00025735775,0.0031386847,0.00009713616,0.00004872468],"category_scores_gemma":[0.000049334307,0.00018210214,0.0002578337,0.0014499143,0.0000825926,0.00032571758,0.0004496074,0.0024902953,0.000011830303],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000089778114,0.00014858488,0.00030731948,0.000034829667,0.000087456385,0.00000851961,0.005290508,0.004215792,0.0000044992453,0.98438644,0.00063157507,0.004794704],"study_design_scores_gemma":[0.00096904504,0.0014957599,0.0047141276,0.00012730957,0.00007913358,0.00057415414,0.0049963365,0.004220702,0.00015190613,0.36505175,0.616857,0.00076279294],"about_ca_topic_score_codex":0.0000212022,"about_ca_topic_score_gemma":0.00005163465,"teacher_disagreement_score":0.8500825,"about_ca_system_score_codex":0.00016729783,"about_ca_system_score_gemma":0.0012673616,"threshold_uncertainty_score":0.999811},"labels":[],"label_agreement":null},{"id":"W3203646126","doi":"10.13001/ela.2021.4991","title":"Generalized Commutators and the Moore-Penrose Inverse","year":2021,"lang":"en","type":"article","venue":"Electronic Journal of Linear Algebra","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Division of Mathematical Sciences; Fields Institute for Research in Mathematical Sciences","keywords":"Mathematics; Commutator; Combinatorics; Inverse; Kernel (algebra); Conjecture; Rank (graph theory); Matrix (chemical analysis); Operator (biology); TRACE (psycholinguistics); Algebra over a field; Pure mathematics","score_opus":0.0066310965750864806,"score_gpt":0.23013447642621795,"score_spread":0.22350337985113147,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3203646126","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7618983,0.018890984,0.2043597,0.013364896,0.0006939883,0.00014660113,0.000001400923,0.000045999193,0.00059814035],"genre_scores_gemma":[0.9794846,0.001620551,0.015817124,0.0019385775,0.0004270746,0.0000017004293,0.0000010219086,0.000014710059,0.0006946057],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985466,0.00041969825,0.00033453904,0.00012759336,0.00024266049,0.00032891487],"domain_scores_gemma":[0.99901706,0.00021547383,0.00022362686,0.0003045104,0.00015007539,0.000089255576],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015065209,0.00011016135,0.0002530743,0.000055818553,0.00017017455,0.00011712512,0.0005967534,0.000039040988,0.000041222447],"category_scores_gemma":[0.00012582882,0.00006989327,0.00013758204,0.0002970109,0.000121621146,0.00029672252,0.00017060833,0.0005104429,0.000010135196],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006684508,0.000044819986,0.000056297744,0.0000063121347,0.00011790376,0.000099128956,0.0008198395,0.00008124602,0.0004662807,0.9916214,0.00046828826,0.0061516752],"study_design_scores_gemma":[0.011532981,0.00046105045,0.00017954632,0.000059112357,0.00012615343,0.00571174,0.0004009447,0.057814986,0.02664155,0.85506207,0.041560378,0.00044951474],"about_ca_topic_score_codex":0.0000046400637,"about_ca_topic_score_gemma":0.000007264468,"teacher_disagreement_score":0.21758634,"about_ca_system_score_codex":0.00003996669,"about_ca_system_score_gemma":0.00044870796,"threshold_uncertainty_score":0.28501648},"labels":[],"label_agreement":null},{"id":"W3208141921","doi":"10.13001/ela.2022.6721","title":"Strong cospectrality and twin vertices in weighted graphs","year":2022,"lang":"en","type":"article","venue":"Electronic Journal of Linear Algebra","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"University of Manitoba","keywords":"Adjacency matrix; Combinatorics; Joins; Mathematics; Graph homomorphism; Graph; Algebraic properties; Adjacency list; Algebraic number; Discrete mathematics; Computer science; Graph power; Line graph","score_opus":0.006627293534976792,"score_gpt":0.23266641883297126,"score_spread":0.22603912529799447,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3208141921","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9736632,0.003168843,0.02104374,0.0016830397,0.00030884167,0.00006434191,9.853203e-7,0.000025497746,0.00004151387],"genre_scores_gemma":[0.99510086,0.00007784818,0.004560978,0.0001464669,0.000081088154,0.0000013704498,5.129292e-7,0.0000081111175,0.000022781187],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983116,0.00022555188,0.0003882888,0.00020500715,0.0003777109,0.0004918479],"domain_scores_gemma":[0.99937797,0.0000922604,0.00022673659,0.00018283649,0.000039736202,0.00008049051],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001141762,0.00012088695,0.00023344364,0.00023847686,0.00018974958,0.000055586675,0.0006662053,0.000023703358,0.000019529334],"category_scores_gemma":[0.000020653162,0.000106157335,0.000084524414,0.00056157843,0.000033017666,0.00019265599,0.00023682868,0.0010503802,8.380387e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030206534,0.0010564646,0.017822225,0.00005855321,0.00042395506,0.00068346,0.0072520785,0.018494183,0.0026923514,0.8093308,0.00074202265,0.14114183],"study_design_scores_gemma":[0.0028313538,0.0029664862,0.017735098,0.000048097892,0.000030930805,0.001791444,0.00025163285,0.72211254,0.001214161,0.2431349,0.007368057,0.00051530055],"about_ca_topic_score_codex":0.00002551044,"about_ca_topic_score_gemma":0.000016285285,"teacher_disagreement_score":0.70361835,"about_ca_system_score_codex":0.00012227826,"about_ca_system_score_gemma":0.0002835517,"threshold_uncertainty_score":0.45634374},"labels":[],"label_agreement":null},{"id":"W3214894396","doi":"10.13001/ela.2022.6737","title":"Constructions of cospectral graphs with different zero forcing numbers","year":2022,"lang":"en","type":"article","venue":"Electronic Journal of Linear Algebra","topic":"Graph theory and applications","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ontario Tech University","funders":"Medical Research Council; Vlaamse regering; Natural Sciences and Engineering Research Council of Canada; Fonds Wetenschappelijk Onderzoek; American Mathematical Society; National Science Foundation","keywords":"Mathematics; Combinatorics; Adjacency matrix; Graph; Discrete mathematics; Zero (linguistics)","score_opus":0.011724130021918576,"score_gpt":0.25743601313154585,"score_spread":0.24571188310962727,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3214894396","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9845831,0.00018549249,0.014182861,0.0001983898,0.000065259344,0.00013808734,0.000009627551,0.00001726278,0.00061994867],"genre_scores_gemma":[0.997692,0.00003349185,0.002083777,0.000022957482,0.000037233214,0.000011229804,0.0000022555225,0.000020935844,0.000096131385],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987451,0.00009346483,0.0004462304,0.000098015626,0.0003078032,0.00030940064],"domain_scores_gemma":[0.9989449,0.00019112602,0.00052603555,0.00018162327,0.000094047755,0.00006228264],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041723042,0.00011754601,0.00028771206,0.0001506683,0.00026272458,0.000007698808,0.00023830621,0.000023198823,0.00023294154],"category_scores_gemma":[0.000028738523,0.0000932498,0.00018769491,0.00033887668,0.0001025133,0.00006724412,0.000032272175,0.0006413151,6.589223e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000103857536,0.00019433889,0.0008399032,0.000013679263,0.00022980072,0.0000030409735,0.0003099457,0.00010341268,0.0015788439,0.9962025,0.00020586603,0.00021477684],"study_design_scores_gemma":[0.000856692,0.00073579233,0.00011374447,0.000020342748,0.00016619635,0.0007941286,0.00082951284,0.000050395636,0.006714884,0.98898137,0.0006272244,0.00010971018],"about_ca_topic_score_codex":0.000003705738,"about_ca_topic_score_gemma":0.000015167982,"teacher_disagreement_score":0.013108917,"about_ca_system_score_codex":0.00010457383,"about_ca_system_score_gemma":0.00019485556,"threshold_uncertainty_score":0.38026166},"labels":[],"label_agreement":null},{"id":"W340250899","doi":"10.13001/1081-3810.1173","title":"Schur complements of matrices with acyclic bipartite graphs","year":2005,"lang":"en","type":"article","venue":"Electronic Journal of Linear Algebra","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Schur complement; Combinatorics; Sign (mathematics); Bipartite graph; Invertible matrix; Factorization; Inverse; Matrix (chemical analysis); Discrete mathematics; Pure mathematics; Graph; Mathematical analysis; Algorithm; Geometry","score_opus":0.00782412159649532,"score_gpt":0.24721593812946457,"score_spread":0.23939181653296926,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W340250899","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7561139,0.004273176,0.23750225,0.0013590284,0.00013952625,0.00013382525,0.0000025285271,0.00004001714,0.0004357486],"genre_scores_gemma":[0.9755762,0.00031871616,0.023651313,0.00012345634,0.0002072226,9.785853e-7,6.544805e-7,0.000010666529,0.00011078281],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982882,0.00009718551,0.000540889,0.00015137716,0.000445488,0.00047684094],"domain_scores_gemma":[0.99878037,0.000077702905,0.00059159676,0.0002759375,0.00017257928,0.000101787424],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008704321,0.00014166355,0.00029076575,0.00025713033,0.00008358979,0.00004351724,0.0009334696,0.00003410184,0.00007197149],"category_scores_gemma":[0.000017452563,0.00010265165,0.00012519339,0.0005766466,0.00005188939,0.0006228051,0.00007656763,0.00035781,0.000022383778],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00032465404,0.0007689309,0.0028853945,0.00007530437,0.00075814454,0.000054843258,0.0010987362,0.0015444958,0.0057290453,0.88000494,0.0008156343,0.10593985],"study_design_scores_gemma":[0.01819751,0.016485725,0.0060599684,0.00088579283,0.0005806246,0.0043952675,0.00048222806,0.07663071,0.29457727,0.35231805,0.22692235,0.002464488],"about_ca_topic_score_codex":0.0000050024055,"about_ca_topic_score_gemma":0.000011583661,"teacher_disagreement_score":0.5276869,"about_ca_system_score_codex":0.000048160982,"about_ca_system_score_gemma":0.00026143854,"threshold_uncertainty_score":0.41860127},"labels":[],"label_agreement":null},{"id":"W344607830","doi":"10.13001/1081-3810.1387","title":"Refined inertially and spectrally arbitrary zero-nonzero patterns","year":2010,"lang":"en","type":"article","venue":"Electronic Journal of Linear Algebra","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Zero (linguistics); Mathematics; Eigenvalues and eigenvectors; Inertia; Zero order; Matrix (chemical analysis); Order (exchange); Mathematical analysis; Pure mathematics; Physics; Applied mathematics; First order; Classical mechanics; Quantum mechanics","score_opus":0.004421461717682794,"score_gpt":0.21843429756039076,"score_spread":0.21401283584270797,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W344607830","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7749723,0.00056635373,0.22104001,0.0022939933,0.0005450424,0.000071496055,0.000001427877,0.00005110977,0.00045822558],"genre_scores_gemma":[0.9730105,0.00021389141,0.025157053,0.0006609035,0.0007003513,9.552131e-7,8.998883e-7,0.000018105697,0.00023737292],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983249,0.00009277455,0.0004823843,0.0002272399,0.00031771968,0.0005550179],"domain_scores_gemma":[0.998985,0.00010276713,0.00030275006,0.00033934094,0.00011379376,0.00015634045],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012656046,0.00018390223,0.00028175407,0.00016400336,0.000126869,0.000119186465,0.0008809999,0.0000944189,0.00006210815],"category_scores_gemma":[0.00008894605,0.00014835663,0.00012695996,0.00021290308,0.000047018395,0.000594506,0.00011917641,0.0015195041,0.000014941296],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013325382,0.00023910777,0.0007034578,0.00003477289,0.00019697785,0.00027527937,0.0006764567,0.000018517616,0.056704696,0.87648493,0.00051018974,0.064022355],"study_design_scores_gemma":[0.005507668,0.0045922445,0.0077124774,0.00015702535,0.00013632415,0.009681186,0.00006190035,0.01424376,0.1028605,0.7948639,0.058714654,0.0014684038],"about_ca_topic_score_codex":0.0000052373243,"about_ca_topic_score_gemma":0.000018920853,"teacher_disagreement_score":0.19803813,"about_ca_system_score_codex":0.000029282783,"about_ca_system_score_gemma":0.00043683022,"threshold_uncertainty_score":0.6601574},"labels":[],"label_agreement":null},{"id":"W350056888","doi":"10.13001/1081-3810.1640","title":"Techniques for identifying inertially arbitrary patterns","year":2013,"lang":"en","type":"article","venue":"Electronic Journal of Linear Algebra","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Redeemer University; Discovery Centre; University of Victoria; University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Jacobian matrix and determinant; Mathematics; Nilpotent; Applied mathematics; Matrix (chemical analysis); Eigenvalues and eigenvectors; Algorithm; Algebra over a field; Pure mathematics; Physics","score_opus":0.012218735288437896,"score_gpt":0.26284107341778207,"score_spread":0.25062233812934415,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W350056888","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06653594,0.0006333455,0.9310762,0.0010965411,0.00023093025,0.00020503174,8.922771e-7,0.00006668989,0.00015441618],"genre_scores_gemma":[0.9088916,0.00015801127,0.08906771,0.0006169593,0.0009380502,0.00001871618,0.0000014191492,0.000022258873,0.0002852403],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99858266,0.00006794773,0.00046897473,0.0001581928,0.00023442588,0.00048779446],"domain_scores_gemma":[0.9990203,0.00011502838,0.00031423336,0.00023524355,0.00022235591,0.00009286292],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008571035,0.00013243337,0.00022954581,0.00016440485,0.00009807923,0.00014869698,0.00094313774,0.00006119386,0.00005928189],"category_scores_gemma":[0.000055590095,0.0001070105,0.00019175775,0.00016759324,0.000018235765,0.0009802275,0.00008561289,0.00040541275,0.00002081531],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000060442308,0.00029208514,0.00028850875,0.00012527223,0.0002976707,0.00004124935,0.00079164817,0.000021561975,0.029441366,0.66423064,0.0023143408,0.30209523],"study_design_scores_gemma":[0.0011660318,0.0018950655,0.00042497678,0.00019057114,0.00004677838,0.00074442406,0.00008168827,0.015940888,0.20510098,0.7603397,0.013527092,0.00054180465],"about_ca_topic_score_codex":0.00000766211,"about_ca_topic_score_gemma":0.0000018847368,"teacher_disagreement_score":0.84235567,"about_ca_system_score_codex":0.000060681516,"about_ca_system_score_gemma":0.00026377794,"threshold_uncertainty_score":0.43637615},"labels":[],"label_agreement":null},{"id":"W397639302","doi":"10.13001/1081-3810.1624","title":"On the Kemeny constant and stationary distribution vector for a Markov chain","year":2014,"lang":"en","type":"article","venue":"Electronic Journal of Linear Algebra","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Mathematics; Markov chain; Constant (computer programming); Stationary distribution; Distribution (mathematics); Chain (unit); Continuous-time Markov chain; Markov property; Applied mathematics; Combinatorics; Statistical physics; Pure mathematics; Mathematical analysis; Markov model; Statistics; Computer science; Physics","score_opus":0.005698658319957989,"score_gpt":0.2231411339679574,"score_spread":0.2174424756479994,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W397639302","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06057825,0.00040049845,0.9334232,0.0052205184,0.0001371523,0.00013566138,0.000008997733,0.000012124594,0.00008360687],"genre_scores_gemma":[0.99677944,0.00006184496,0.0024638895,0.0003797914,0.0002160661,0.0000043979735,0.0000036160768,0.0000054631932,0.000085497704],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99909735,0.00014453076,0.00022315522,0.00010582605,0.0001735326,0.00025561365],"domain_scores_gemma":[0.99877506,0.000746663,0.00019361523,0.00013460797,0.00010052407,0.000049537255],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017753363,0.000081401246,0.00012030518,0.000035501653,0.00015524929,0.000048785394,0.00029186357,0.000025774129,0.000012893094],"category_scores_gemma":[0.00024702091,0.000051556046,0.000060474365,0.00010549545,0.00004049266,0.00013298444,0.000029882141,0.00021655216,0.000002778566],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000056360757,0.00002559057,0.0000044019475,0.0000049834,0.000025038724,0.0000010553429,0.000067264955,0.00001692101,0.00017517609,0.9860992,0.00050255784,0.013021459],"study_design_scores_gemma":[0.0012728531,0.002229642,0.00018020048,0.00005507159,0.000022919286,0.00016782801,0.000049738726,0.113050014,0.002515668,0.85956895,0.020714136,0.00017295625],"about_ca_topic_score_codex":4.926613e-7,"about_ca_topic_score_gemma":6.8693174e-7,"teacher_disagreement_score":0.9362012,"about_ca_system_score_codex":0.000055220204,"about_ca_system_score_gemma":0.0001555712,"threshold_uncertainty_score":0.21023946},"labels":[],"label_agreement":null},{"id":"W4200067354","doi":"10.13001/ela.2022.5913","title":"Families of graphs with twin pendent paths and the Braess edge","year":2021,"lang":"en","type":"article","venue":"Electronic Journal of Linear Algebra","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"Natural Sciences and Engineering Research Council of Canada; Universitetet i Oslo; University of Manitoba","keywords":"Combinatorics; Vertex (graph theory); Mathematics; Constant (computer programming); Random graph; Enhanced Data Rates for GSM Evolution; Discrete mathematics; Graph; Random walk; Random regular graph; Context (archaeology); Undirected graph; Pathwidth; Line graph; Computer science; Statistics; Artificial intelligence; Geography","score_opus":0.004516494244874784,"score_gpt":0.22593601391469612,"score_spread":0.22141951966982132,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4200067354","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9792438,0.0042324397,0.015136167,0.00041912944,0.000025454618,0.000080034435,0.0000024688159,0.0000074142754,0.0008531051],"genre_scores_gemma":[0.998733,0.00036750187,0.00055402366,0.0000377857,0.00018503542,0.0000023654165,0.0000032118082,0.000012996154,0.00010409929],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988813,0.00013297725,0.00037783393,0.00011143215,0.00024079473,0.0002557017],"domain_scores_gemma":[0.999027,0.00012878318,0.00036286633,0.00019615325,0.00024278139,0.000042425294],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050656946,0.00012190882,0.00037716868,0.0000733249,0.00007399292,0.000028386781,0.00019063754,0.000019526027,0.000108159846],"category_scores_gemma":[0.000008020107,0.000073797106,0.00020065682,0.00028759174,0.00013690827,0.000080781196,0.000058925896,0.00040325796,6.582819e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00047312316,0.00037177137,0.054971572,0.000029681687,0.00239239,0.000023534343,0.001266178,0.00020558387,0.0021076368,0.90470374,0.0007903058,0.03266446],"study_design_scores_gemma":[0.01392067,0.0023376122,0.015369628,0.0005579733,0.0024920173,0.00055989047,0.007852834,0.003946336,0.12082496,0.8128994,0.018115124,0.0011235437],"about_ca_topic_score_codex":0.00004076095,"about_ca_topic_score_gemma":0.000031385014,"teacher_disagreement_score":0.11871733,"about_ca_system_score_codex":0.000019532255,"about_ca_system_score_gemma":0.00029332284,"threshold_uncertainty_score":0.30093586},"labels":[],"label_agreement":null},{"id":"W4200580284","doi":"10.13001/ela.2021.6489","title":"On the Ger\\v{s}gorin disks of distance matrices of graphs","year":2021,"lang":"en","type":"article","venue":"Electronic Journal of Linear Algebra","topic":"Graph theory and applications","field":"Mathematics","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Mathematics; Counterexample; Combinatorics; Spectral radius; Distance matrix; Laplacian matrix; Eigenvalues and eigenvectors; Vertex (graph theory); Laplace operator; Resistance distance; Matrix (chemical analysis); Diagonal; Graph; Discrete mathematics; Graph power; Line graph; Physics; Mathematical analysis; Geometry; Chemistry","score_opus":0.018929415637558438,"score_gpt":0.28980123315826745,"score_spread":0.270871817520709,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4200580284","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9906857,0.0020420875,0.0056099063,0.00078840763,0.00004625798,0.00008309006,0.000009188756,0.00000610806,0.00072922517],"genre_scores_gemma":[0.99850863,0.0004894457,0.0007329998,0.000032893924,0.000051664112,0.0000027170486,9.561052e-7,0.000013635309,0.00016707824],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987503,0.00012713268,0.0005420422,0.000086704094,0.00027638001,0.00021743563],"domain_scores_gemma":[0.99786013,0.0009138762,0.0006622132,0.00030588344,0.00022265178,0.00003526977],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00079791655,0.00009846834,0.00027571234,0.00007088191,0.00006704257,0.0000077604345,0.00030871274,0.00004140588,0.0001241752],"category_scores_gemma":[0.00031010524,0.000064171625,0.00024460861,0.00043831248,0.00008542358,0.000052837928,0.000023499992,0.0003913539,0.0000029756704],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000045611683,0.00022058732,0.000092004586,0.00003780388,0.00012634147,0.000002568646,0.00017922964,0.0000085081065,0.0041676355,0.99446195,0.00029813722,0.0003596463],"study_design_scores_gemma":[0.00023139018,0.00017254145,0.00010304015,0.00008017203,0.00008032749,0.000035036664,0.0002236392,0.000021909964,0.066482715,0.9314587,0.001051912,0.00005862738],"about_ca_topic_score_codex":0.0000013894087,"about_ca_topic_score_gemma":0.000009103544,"teacher_disagreement_score":0.063003235,"about_ca_system_score_codex":0.000023478891,"about_ca_system_score_gemma":0.00018218889,"threshold_uncertainty_score":0.2616843},"labels":[],"label_agreement":null},{"id":"W4231748513","doi":"10.13001/ela.2019.5175","title":"Computing Kemeny's constant for a barbell graph","year":2019,"lang":"en","type":"article","venue":"Electronic Journal of Linear Algebra","topic":"Graph theory and applications","field":"Mathematics","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ontario Tech University","funders":"Iowa State University","keywords":"Mathematics; Combinatorics; Regular graph; Distance-regular graph; Discrete mathematics; Line graph; Graph power; Voltage graph; Graph; Spectral graph theory; Null graph","score_opus":0.01659689781592324,"score_gpt":0.2962628181128738,"score_spread":0.2796659202969506,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4231748513","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.92950845,0.00056390074,0.067852914,0.00034121348,0.00013243251,0.00040324687,0.000005182435,0.000027200416,0.0011654651],"genre_scores_gemma":[0.9910227,0.00004074834,0.008362845,0.00011341544,0.00017956858,0.0000030684096,0.0000017906137,0.000025069843,0.000250771],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987402,0.00005307875,0.0004999797,0.00011839497,0.00016734659,0.0004210289],"domain_scores_gemma":[0.99854016,0.00057821744,0.00043337335,0.00019381063,0.00018804465,0.00006639913],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012284386,0.00012197347,0.00029294792,0.00011566522,0.000103821316,0.000018035491,0.00025496347,0.00005535162,0.00009012365],"category_scores_gemma":[0.000108072316,0.00010164807,0.00024693026,0.00019051082,0.000038001708,0.00007559583,0.000021660924,0.00036285617,0.000022084592],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000614808,0.00009624209,0.00012234741,0.000035944828,0.00013398871,8.665516e-7,0.0001573842,0.000020424897,0.0035823102,0.99463624,0.00052761316,0.0006251504],"study_design_scores_gemma":[0.001151545,0.00059398514,0.000013205703,0.000055107,0.00008325562,0.00010137316,0.00020775948,0.0005550155,0.0042884788,0.9851782,0.007642882,0.00012924738],"about_ca_topic_score_codex":5.647977e-7,"about_ca_topic_score_gemma":0.0000022135052,"teacher_disagreement_score":0.061514277,"about_ca_system_score_codex":0.000050621344,"about_ca_system_score_gemma":0.00021839756,"threshold_uncertainty_score":0.4145088},"labels":[],"label_agreement":null},{"id":"W4319725279","doi":"10.13001/ela.2023.7209","title":"Flat portions on the boundary of the numerical range of a 5 × 5 companion matrix","year":2023,"lang":"en","type":"article","venue":"Electronic Journal of Linear Algebra","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"York University; New York University Abu Dhabi","keywords":"Numerical range; Mathematics; Boundary (topology); Conjecture; Matrix (chemical analysis); Range (aeronautics); Complex matrix; Numerical analysis; Pure mathematics; Combinatorics; Mathematical analysis; Algebra over a field","score_opus":0.011616387272249422,"score_gpt":0.25954353528803936,"score_spread":0.24792714801578994,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4319725279","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9023917,0.0015306448,0.08213255,0.012150623,0.00089451816,0.0002938188,0.000010540884,0.000057647118,0.00053799624],"genre_scores_gemma":[0.99905753,0.0000930452,0.00035558164,0.00010931829,0.00016508214,0.0000011705664,6.372505e-7,0.0000080922155,0.0002095374],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99840933,0.00024423652,0.0004863834,0.00009873982,0.00046401855,0.00029729592],"domain_scores_gemma":[0.9986585,0.0003228082,0.0005051966,0.0003667244,0.00010555595,0.000041256444],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014470213,0.000096178235,0.00022995115,0.00010573378,0.00015529705,0.000023319333,0.001042761,0.000038149945,0.000047146117],"category_scores_gemma":[0.000096037744,0.0000511996,0.0002192343,0.00081446907,0.000078405734,0.00012693873,0.00012588056,0.0005062823,0.000024401601],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000805455,0.0001532883,0.00032917733,0.00002587953,0.00016719144,0.000013083195,0.00083993113,0.0008774279,0.0030135438,0.9874783,0.0032671744,0.003754443],"study_design_scores_gemma":[0.004219519,0.0047451183,0.019707117,0.00059683213,0.00028372413,0.0014101868,0.0007808492,0.18084356,0.071562394,0.6487847,0.06621536,0.00085065933],"about_ca_topic_score_codex":0.0000045527236,"about_ca_topic_score_gemma":0.0000012881176,"teacher_disagreement_score":0.33869365,"about_ca_system_score_codex":0.000042467294,"about_ca_system_score_gemma":0.0003534051,"threshold_uncertainty_score":0.21995729},"labels":[],"label_agreement":null},{"id":"W4362721336","doi":"10.13001/ela.2023.7773","title":"The matrix inverse Young inequality","year":2023,"lang":"en","type":"article","venue":"Electronic Journal of Linear Algebra","topic":"Mathematical Inequalities and Applications","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Mathematics; Inverse; Inequality; Positive-definite matrix; Matrix (chemical analysis); Moore–Penrose pseudoinverse; Pure mathematics; Mathematical analysis; Eigenvalues and eigenvectors; Geometry","score_opus":0.05523622021952425,"score_gpt":0.36863797070425447,"score_spread":0.31340175048473023,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4362721336","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96489406,0.00054110074,0.022523597,0.009066392,0.0002969555,0.00034190153,0.000010263025,0.00015844317,0.0021673196],"genre_scores_gemma":[0.98587674,0.0010010083,0.0030667214,0.0001391069,0.00089209963,0.000022195938,0.0000044226435,0.00005801543,0.008939684],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99804944,0.00012847592,0.00078328804,0.000095270676,0.00040896054,0.0005345867],"domain_scores_gemma":[0.9976812,0.0012793875,0.0004355452,0.00032819662,0.00018351569,0.00009216629],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029774555,0.00012405237,0.0002611698,0.00006961521,0.00026517914,0.00004985031,0.0004161105,0.000060466773,0.00010147675],"category_scores_gemma":[0.0010729478,0.00007645131,0.00020014062,0.0004401945,0.00006755188,0.00009111162,0.00006864881,0.0005054792,0.00016101517],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016387618,0.00004676849,0.000038807742,0.00003796623,0.00008006985,0.00000401,0.00040810328,0.000006484345,0.00019905459,0.9827794,0.015987704,0.00039524984],"study_design_scores_gemma":[0.00030217922,0.00010666296,0.000038760474,0.000027036032,0.000050386734,0.00007068407,0.0010523215,0.0017074142,0.00044486526,0.97218233,0.023911472,0.00010589212],"about_ca_topic_score_codex":0.0000067363712,"about_ca_topic_score_gemma":0.00003793871,"teacher_disagreement_score":0.020982718,"about_ca_system_score_codex":0.00009233233,"about_ca_system_score_gemma":0.00021394716,"threshold_uncertainty_score":0.31175938},"labels":[],"label_agreement":null},{"id":"W4366176180","doi":"10.13001/ela.2023.7405","title":"On low-dimensional partial isometries","year":2023,"lang":"en","type":"article","venue":"Electronic Journal of Linear Algebra","topic":"Advanced Topics in Algebra","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"York University; New York University Abu Dhabi","keywords":"Mathematics; Pure mathematics; Nilpotent; Combinatorics","score_opus":0.026363231705155536,"score_gpt":0.3236923029690093,"score_spread":0.2973290712638538,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4366176180","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99299425,0.00034292327,0.0042679952,0.0012027918,0.00061915326,0.00011609299,0.0000036898093,0.000107219545,0.00034591364],"genre_scores_gemma":[0.9935932,0.0001285444,0.003260995,0.00027790846,0.0010433462,0.0000035231697,0.0000038993626,0.00006552869,0.0016230327],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99756724,0.000089047215,0.0006727638,0.00018511346,0.00075117074,0.00073464186],"domain_scores_gemma":[0.9977641,0.001186689,0.0004348598,0.0002889676,0.00020247139,0.00012291515],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010862643,0.00020356668,0.0003978697,0.00044288585,0.00013554789,0.000022360628,0.00034835344,0.00010657348,0.000291193],"category_scores_gemma":[0.0019870286,0.0001689727,0.00022520404,0.00079626444,0.00007498713,0.00017288164,0.00007350433,0.00093264435,0.00031745824],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017876479,0.00016237193,0.00004692256,0.000027620885,0.00017266326,0.00008983526,0.00017451175,0.0002895486,0.0008383158,0.98941255,0.0073265927,0.0012802768],"study_design_scores_gemma":[0.00092265336,0.00074560667,0.00006185634,0.00008106226,0.000039494927,0.00012255623,0.0000533558,0.00032673913,0.017192157,0.975604,0.0046658316,0.00018469429],"about_ca_topic_score_codex":4.8949926e-7,"about_ca_topic_score_gemma":0.0000017379841,"teacher_disagreement_score":0.016353842,"about_ca_system_score_codex":0.00020372373,"about_ca_system_score_gemma":0.00038246892,"threshold_uncertainty_score":0.68905073},"labels":[],"label_agreement":null},{"id":"W4377115366","doi":"10.13001/ela.2023.7635","title":"Bounding real tensor optimizations via the numerical range","year":2023,"lang":"en","type":"article","venue":"Electronic Journal of Linear Algebra","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Mount Allison University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Bounding overwatch; Eigenvalues and eigenvectors; Semidefinite programming; Numerical range; Linear algebra; Tensor (intrinsic definition); Numerical linear algebra; Matrix (chemical analysis); Tensor product; Rank (graph theory); Subspace topology; Range (aeronautics); Linear programming; Upper and lower bounds; Positive-definite matrix; Numerical analysis; Algebra over a field; Combinatorics; Pure mathematics; Algorithm; Mathematical optimization; Mathematical analysis; Computer science; Geometry","score_opus":0.02920302873916053,"score_gpt":0.3254095091602312,"score_spread":0.2962064804210707,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4377115366","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.53356075,0.00055429724,0.42632726,0.034770157,0.00045346766,0.00067184685,0.00001652399,0.00044372166,0.003201971],"genre_scores_gemma":[0.98940784,0.0005706047,0.0077234237,0.0002473241,0.00067383784,0.000015619968,0.000009369742,0.000047163932,0.0013048295],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99868584,0.00009077627,0.00045002403,0.00009908068,0.0002812563,0.00039302948],"domain_scores_gemma":[0.9988348,0.00042527658,0.00028277416,0.00021386494,0.00016323366,0.00008007714],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006651675,0.00010603572,0.00020359959,0.00012414271,0.00031186367,0.000042165288,0.00029367825,0.00005011982,0.00015106493],"category_scores_gemma":[0.00015299792,0.000071995055,0.00017103898,0.00062356435,0.000044940913,0.00009434325,0.000030249597,0.00046529452,0.00013743047],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009417391,0.00038085924,0.0005441845,0.000027277416,0.00043254832,0.000033394146,0.0016247685,0.0015019043,0.0029301455,0.95391726,0.035508323,0.0030051454],"study_design_scores_gemma":[0.002834827,0.0006709214,0.0037090972,0.00009426816,0.00054933707,0.0017220874,0.0011264976,0.06223643,0.0015200544,0.82976675,0.09512022,0.000649489],"about_ca_topic_score_codex":0.000003814115,"about_ca_topic_score_gemma":0.0000045354004,"teacher_disagreement_score":0.45584708,"about_ca_system_score_codex":0.000081278165,"about_ca_system_score_gemma":0.00013518495,"threshold_uncertainty_score":0.2935873},"labels":[],"label_agreement":null},{"id":"W4388723858","doi":"10.13001/ela.2023.7971","title":"Eigenvalues for stochastic matrices with a prescribed stationary distribution","year":2023,"lang":"en","type":"article","venue":"Electronic Journal of Linear Algebra","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Eigenvalues and eigenvectors; Vertex (graph theory); Lambda; Sigma; Matrix (chemical analysis); Graph; Physics; Quantum mechanics","score_opus":0.009728455201395713,"score_gpt":0.2531222988154118,"score_spread":0.24339384361401611,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388723858","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.047141623,0.0009159078,0.9507502,0.0007510861,0.00013913191,0.00017469766,0.00001647295,0.00010091944,0.000010004377],"genre_scores_gemma":[0.98342323,0.00013329009,0.0154377315,0.00005901104,0.00049319735,0.000016836999,0.000041014988,0.00001922368,0.00037648776],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99874824,0.00006499675,0.0002975456,0.00014847319,0.00031165316,0.00042910647],"domain_scores_gemma":[0.999005,0.00027345808,0.00027002694,0.00015175002,0.0002285643,0.00007115613],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00092561665,0.0001091137,0.00017160561,0.00013042145,0.00014669607,0.000062199586,0.0004774334,0.000033659686,0.000007595467],"category_scores_gemma":[0.00009072934,0.00008137419,0.0000888856,0.00056379114,0.000027241047,0.0004650842,0.00004217528,0.00020346754,0.000016640457],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007341574,0.00023275988,0.000051915573,0.00011230994,0.00045054124,0.00006638211,0.0015083076,0.023410596,0.000640669,0.9359145,0.005362585,0.03151525],"study_design_scores_gemma":[0.0030510288,0.0045992946,0.0005686519,0.0001441528,0.00013271248,0.00053774944,0.00025075677,0.53959805,0.0029127733,0.43790126,0.009798911,0.0005046794],"about_ca_topic_score_codex":0.0000012491694,"about_ca_topic_score_gemma":0.0000010625608,"teacher_disagreement_score":0.93628156,"about_ca_system_score_codex":0.00007633571,"about_ca_system_score_gemma":0.00044307875,"threshold_uncertainty_score":0.33183432},"labels":[],"label_agreement":null},{"id":"W4388857145","doi":"10.13001/ela.2023.8025","title":"Sparks of symmetric matrices and their graphs","year":2023,"lang":"en","type":"article","venue":"Electronic Journal of Linear Algebra","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"Natural Sciences and Engineering Research Council of Canada; American Institute of Mathematics; National Science Foundation","keywords":"Mathematics; Combinatorics; Diagonal; Vertex (graph theory); Graph; Skew-symmetric matrix; Null (SQL); Discrete mathematics; Symmetric matrix; Square matrix; Geometry; Physics; Computer science","score_opus":0.00785242508233393,"score_gpt":0.23013409278902844,"score_spread":0.2222816677066945,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388857145","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.91596687,0.012978095,0.06928753,0.00081343646,0.00038012437,0.00009503093,0.0000025115028,0.00006984619,0.00040652844],"genre_scores_gemma":[0.9957037,0.00243537,0.0015770893,0.0000412138,0.00012876207,5.6151885e-7,4.4452258e-7,0.0000084864005,0.00010439464],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987919,0.00009474772,0.0003852406,0.0001317266,0.00022146945,0.00037495396],"domain_scores_gemma":[0.9989972,0.00027717906,0.00034293593,0.00019221871,0.000110855115,0.00007959063],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014364608,0.000112600545,0.00026293573,0.00062893296,0.00006669155,0.0000374563,0.00063133525,0.00004734754,0.000010751387],"category_scores_gemma":[0.00007595959,0.0000801739,0.00012580382,0.0017991931,0.000042453063,0.00030587602,0.00011523438,0.0003263393,0.000010244855],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000033191114,0.00007034403,0.00033774757,0.00005116111,0.00017526493,0.000030668492,0.0006009506,0.00008867729,0.0015917475,0.9223669,0.00039117222,0.07426217],"study_design_scores_gemma":[0.0013286003,0.0017000341,0.0018124491,0.00009966132,0.00004666331,0.0008021188,0.00026092102,0.03267924,0.027089033,0.9271798,0.0066455305,0.00035595233],"about_ca_topic_score_codex":0.0000029335433,"about_ca_topic_score_gemma":7.9350787e-7,"teacher_disagreement_score":0.079736784,"about_ca_system_score_codex":0.000019671279,"about_ca_system_score_gemma":0.00016417916,"threshold_uncertainty_score":0.32693967},"labels":[],"label_agreement":null},{"id":"W4391135163","doi":"10.13001/ela.2024.7779","title":"The allow sequence of distinct eigenvalues for a sign pattern","year":2024,"lang":"en","type":"article","venue":"Electronic Journal of Linear Algebra","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia; The Scarborough Hospital; University of Toronto; Redeemer University; University of Victoria; Ontario Tech University","funders":"Natural Sciences and Engineering Research Council of Canada; Universities Space Research Association; American Institute of Mathematics","keywords":"Mathematics; Eigenvalues and eigenvectors; Sign (mathematics); Sequence (biology); Pure mathematics; Combinatorics; Mathematical analysis; Physics; Biology","score_opus":0.010694569745821806,"score_gpt":0.24141335960754337,"score_spread":0.23071878986172156,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391135163","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8155,0.04755835,0.13468769,0.00029819107,0.0012709027,0.00027433524,0.000024998435,0.000095876494,0.00028962028],"genre_scores_gemma":[0.9989943,0.00042892876,0.00004769956,0.000008749616,0.00036938765,0.0000064249743,0.0000015995206,0.000029741073,0.00011317653],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99896467,0.00005093747,0.00041502443,0.00007074525,0.00016395064,0.00033466285],"domain_scores_gemma":[0.99937475,0.00031539882,0.00007955359,0.00012176683,0.00006753472,0.000040969135],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001035497,0.00011104032,0.00018701695,0.000061031256,0.000063452644,0.00003735908,0.00025731963,0.00004341036,0.000013326321],"category_scores_gemma":[0.00004401262,0.000072041235,0.00021582993,0.00013500004,0.00004227384,0.00009373766,0.00000817495,0.00030732574,0.0000065699505],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00062332774,0.0001613244,0.0009367482,0.0028344241,0.0058697774,0.00016071378,0.0058609555,0.013848562,0.15756878,0.47935018,0.00828818,0.324497],"study_design_scores_gemma":[0.0020184957,0.0040636593,0.00046429594,0.0019421743,0.0007138969,0.0015244362,0.0012204378,0.21216603,0.14438805,0.36051005,0.26982823,0.0011602319],"about_ca_topic_score_codex":0.000002365619,"about_ca_topic_score_gemma":0.000010876337,"teacher_disagreement_score":0.32333678,"about_ca_system_score_codex":0.00006725268,"about_ca_system_score_gemma":0.00012028584,"threshold_uncertainty_score":0.29377562},"labels":[],"label_agreement":null},{"id":"W4392367436","doi":"10.13001/ela.2024.8491","title":"The numerical range of matrix products","year":2024,"lang":"en","type":"article","venue":"Electronic Journal of Linear Algebra","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Mathematics; Numerical range; Matrix (chemical analysis); Range (aeronautics); Pure mathematics; Algebra over a field; Chemistry","score_opus":0.006577779928596201,"score_gpt":0.25522844220933383,"score_spread":0.24865066228073762,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392367436","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05387931,0.12539266,0.7980448,0.018870013,0.0027631798,0.00027151225,0.000002372292,0.00013085722,0.00064532633],"genre_scores_gemma":[0.9918154,0.00087837584,0.005246753,0.000045797835,0.0008801937,0.0000013065608,2.0490508e-7,0.000013942556,0.0011180657],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99857944,0.0001331727,0.00042225767,0.0001395958,0.00035034548,0.0003751668],"domain_scores_gemma":[0.99908185,0.00026849296,0.00017260805,0.00027412636,0.00014908939,0.00005381259],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017699429,0.00009985851,0.00018621933,0.00008982659,0.00009239851,0.000096501826,0.0009105615,0.000034148576,0.000015021611],"category_scores_gemma":[0.0001261229,0.000058592945,0.00014827584,0.0005783781,0.00005042577,0.00030212116,0.000079179976,0.0005271555,0.000032493626],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000041578474,0.00005024332,0.000011139529,0.000044238594,0.00013524338,0.000049910814,0.00035334617,0.000055553683,0.00089845184,0.95256144,0.0014308253,0.044368036],"study_design_scores_gemma":[0.001097406,0.0024769967,0.00013776119,0.0002580615,0.00012842503,0.0032045804,0.0001096702,0.075057395,0.038590323,0.4251477,0.4532936,0.00049809617],"about_ca_topic_score_codex":0.0000014792146,"about_ca_topic_score_gemma":3.2904754e-7,"teacher_disagreement_score":0.93793607,"about_ca_system_score_codex":0.00005148005,"about_ca_system_score_gemma":0.000558715,"threshold_uncertainty_score":0.23893508},"labels":[],"label_agreement":null},{"id":"W4403619422","doi":"10.13001/ela.2024.8671","title":"Characterizations of complex P-matrices","year":2024,"lang":"en","type":"article","venue":"Electronic Journal of Linear Algebra","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Pure mathematics","score_opus":0.007500226076614021,"score_gpt":0.22135283934090658,"score_spread":0.21385261326429256,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403619422","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96042687,0.018577298,0.018664103,0.00012986,0.0007317411,0.00007293105,0.000011823658,0.00010167254,0.0012837074],"genre_scores_gemma":[0.9987715,0.0007276225,0.000082924795,0.000007905595,0.00030202526,8.0689574e-7,0.0000038446224,0.000021368078,0.00008201664],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99919635,0.000029914876,0.0003888771,0.000048112033,0.00013137724,0.00020539781],"domain_scores_gemma":[0.99970585,0.00005431385,0.000070442846,0.00007937586,0.000052402767,0.00003759371],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003166392,0.00008280386,0.00018924019,0.00019343551,0.000023111448,0.000020428473,0.00014413211,0.000038572296,0.00012950799],"category_scores_gemma":[0.000010587158,0.000069874965,0.00012554442,0.0003229779,0.000019046665,0.00015549557,0.000006385314,0.0002661674,0.00002225911],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000060690127,0.000114196104,0.00037334408,0.0011262841,0.0017178634,0.000068294976,0.0022892272,0.007733801,0.45059788,0.51723367,0.0033087176,0.015376062],"study_design_scores_gemma":[0.0021439688,0.0021703183,0.004585709,0.002104395,0.00082903507,0.0031873109,0.0010354299,0.1497552,0.13862462,0.09006196,0.6040807,0.0014213928],"about_ca_topic_score_codex":8.4788246e-7,"about_ca_topic_score_gemma":0.0000012086138,"teacher_disagreement_score":0.60077196,"about_ca_system_score_codex":0.000037669015,"about_ca_system_score_gemma":0.00008246649,"threshold_uncertainty_score":0.28494182},"labels":[],"label_agreement":null},{"id":"W4407762323","doi":"10.13001/ela.2025.8827","title":"The non-symmetric strong multiplicity property for sign patterns","year":2025,"lang":"en","type":"article","venue":"Electronic Journal of Linear Algebra","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Redeemer University","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Mathematics; Multiplicity (mathematics); Property (philosophy); Sign (mathematics); Pure mathematics; Mathematical analysis","score_opus":0.010567342672131752,"score_gpt":0.2640629811688472,"score_spread":0.2534956384967154,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407762323","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034641284,0.0009542272,0.9608786,0.002718284,0.00044411927,0.00022762678,0.0000010492137,0.00001345359,0.000121360004],"genre_scores_gemma":[0.99201447,0.00013486022,0.0063011018,0.00023855102,0.00032163845,0.000010415351,0.0000016621341,0.0000055584896,0.0009717593],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99876827,0.00006721645,0.00039242266,0.0001524784,0.00024988837,0.0003697336],"domain_scores_gemma":[0.9986453,0.00044484253,0.00022926436,0.0001907715,0.00044322672,0.00004659012],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001150673,0.00010305753,0.00015053635,0.0002131373,0.00032415302,0.00012832058,0.00069701154,0.000039822677,0.0000018545419],"category_scores_gemma":[0.00023138813,0.000058497484,0.00014436948,0.00066882756,0.000015614136,0.00026345084,0.000074551965,0.00029361178,0.0000029008627],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001465855,0.00023216692,0.0006459241,0.000040550607,0.00033515636,0.0000037461057,0.00020224447,0.010663112,0.0020463036,0.36618608,0.0038383799,0.6156598],"study_design_scores_gemma":[0.0028716745,0.0015967911,0.0059654485,0.000084971485,0.000071527305,0.00007063399,0.00007726863,0.8333451,0.025795015,0.049722593,0.08006442,0.00033453424],"about_ca_topic_score_codex":0.0000055858986,"about_ca_topic_score_gemma":0.00001552009,"teacher_disagreement_score":0.95737314,"about_ca_system_score_codex":0.0001393101,"about_ca_system_score_gemma":0.0007346069,"threshold_uncertainty_score":0.24931557},"labels":[],"label_agreement":null},{"id":"W4410619980","doi":"10.13001/ela.2025.9483","title":"A note on Lidskii's theorem for the directional derivatives of the eigenvalues of symmetric matrices","year":2025,"lang":"en","type":"article","venue":"Electronic Journal of Linear Algebra","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Eigenvalues and eigenvectors; Pure mathematics; Symmetric matrix; Mathematical analysis; Combinatorics; Physics","score_opus":0.007641676673642443,"score_gpt":0.26505283448327194,"score_spread":0.2574111578096295,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410619980","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07645365,0.012235076,0.9037918,0.005079206,0.0010027576,0.00040961173,0.000007978316,0.00002019305,0.000999745],"genre_scores_gemma":[0.993829,0.00044486794,0.005039686,0.00016586392,0.00020233865,0.00000409782,1.6190361e-7,0.0000066961734,0.00030726488],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986378,0.0001901051,0.0004598809,0.00012249396,0.00033883352,0.00025090828],"domain_scores_gemma":[0.99690664,0.0019411677,0.0005747334,0.00029431292,0.00026154553,0.000021601943],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016207956,0.00011363642,0.00024102362,0.00024202703,0.00017911164,0.000026984575,0.0012516819,0.000043659806,0.000008614959],"category_scores_gemma":[0.0004608112,0.000058176163,0.0003037244,0.0011536776,0.00011090808,0.00014325282,0.00010447585,0.00032637618,7.6980433e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009166695,0.000102535625,0.00006563183,0.000029358487,0.00019132275,3.4388412e-7,0.0002750545,0.0005107146,0.0011349311,0.97281337,0.00012682144,0.024658259],"study_design_scores_gemma":[0.0010807392,0.0011534907,0.0017998085,0.0002293052,0.00013772756,0.00004640911,0.00013170949,0.01719514,0.28606576,0.68346786,0.0085326275,0.000159465],"about_ca_topic_score_codex":0.0000035511343,"about_ca_topic_score_gemma":0.0000015248326,"teacher_disagreement_score":0.9173754,"about_ca_system_score_codex":0.00005779352,"about_ca_system_score_gemma":0.0005615006,"threshold_uncertainty_score":0.2372355},"labels":[],"label_agreement":null},{"id":"W4416916517","doi":"10.13001/ela.2025.9507","title":"Combinatorial considerations for the number of distinct eigenvalues of a matrix","year":2025,"lang":"","type":"article","venue":"Electronic Journal of Linear Algebra","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"North York General Hospital; Redeemer University; The Scarborough Hospital; University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Eigenvalues and eigenvectors; Digraph; Sequence (biology); Matrix (chemical analysis); Inverse; Binary number; Spectrum of a matrix; Spectrum (functional analysis)","score_opus":0.011783968537994724,"score_gpt":0.3009380608544846,"score_spread":0.28915409231648986,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416916517","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.088343315,0.01722133,0.88209146,0.005023738,0.0056186067,0.00090445316,0.000053531512,0.000017171005,0.00072638417],"genre_scores_gemma":[0.99354184,0.0005118177,0.0047396123,0.00006858056,0.00068671146,0.000005892533,8.176881e-7,0.000015016798,0.00042972737],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9965607,0.00040087977,0.0016996248,0.00023728822,0.000501478,0.00060005905],"domain_scores_gemma":[0.9932148,0.0034926175,0.001530767,0.00052905816,0.0011538351,0.00007890653],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034251781,0.0002592981,0.0007584525,0.00017260686,0.00038466984,0.000091619535,0.0010854971,0.00013838583,0.00020119025],"category_scores_gemma":[0.0012160663,0.00018972662,0.00065338984,0.00064580014,0.0003459463,0.00029613887,0.00018242889,0.0007180751,0.0000045423108],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027995263,0.00034123508,0.00016097371,0.00013816102,0.0007328706,0.0000037296736,0.0005479184,0.00022602623,0.00033231484,0.9933494,0.0004984528,0.0033889995],"study_design_scores_gemma":[0.0028808934,0.0009617744,0.00013431151,0.0002517358,0.0005613741,0.00017859448,0.00015470003,0.029873643,0.018518819,0.9431879,0.0031026714,0.00019360473],"about_ca_topic_score_codex":0.000015385607,"about_ca_topic_score_gemma":0.0000049780638,"teacher_disagreement_score":0.9051985,"about_ca_system_score_codex":0.000111372065,"about_ca_system_score_gemma":0.0035020348,"threshold_uncertainty_score":0.7736827},"labels":[],"label_agreement":null},{"id":"W573636968","doi":"10.13001/1081-3810.2988","title":"Stationary vectors of stochastic matrices subject to combinatorial constraints","year":2015,"lang":"en","type":"article","venue":"Electronic Journal of Linear Algebra","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Mathematics; Combinatorics; Polytope; Bipartite graph; Directed graph; Matrix (chemical analysis); Discrete mathematics; Graph","score_opus":0.008634904918265188,"score_gpt":0.22576911177524084,"score_spread":0.21713420685697565,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W573636968","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97700155,0.001974228,0.019141816,0.00002855604,0.0013774824,0.00011798136,0.0000074508075,0.000031556512,0.00031941055],"genre_scores_gemma":[0.99950045,0.000014091115,0.00011024451,0.000008371766,0.00032855402,0.0000016139581,0.0000019718761,0.000021811917,0.000012902583],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99876434,0.00007382793,0.00047415218,0.0000675044,0.00031513555,0.00030502726],"domain_scores_gemma":[0.9992789,0.000111656926,0.00015409039,0.00009723036,0.00020010294,0.00015799476],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000806172,0.000120020115,0.00028411002,0.00022408759,0.000022481372,0.000010644717,0.00019732372,0.000055891036,0.000031092084],"category_scores_gemma":[0.00011182228,0.000109899556,0.000092420574,0.000300175,0.000041097028,0.0001222904,0.000011018759,0.0002871584,0.000019468593],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00227203,0.0006423597,0.0018237161,0.00048614418,0.0027831257,0.00014087318,0.0122955,0.34999377,0.030119078,0.5822664,0.0083730295,0.008803992],"study_design_scores_gemma":[0.035312258,0.02821459,0.0037436518,0.0021673278,0.0014750208,0.005261508,0.017032197,0.033169314,0.109267585,0.742723,0.017075459,0.004558099],"about_ca_topic_score_codex":0.0000035095638,"about_ca_topic_score_gemma":0.000002273819,"teacher_disagreement_score":0.31682444,"about_ca_system_score_codex":0.00012445268,"about_ca_system_score_gemma":0.00029829488,"threshold_uncertainty_score":0.4481574},"labels":[],"label_agreement":null},{"id":"W804643316","doi":"10.13001/1081-3810.1483","title":"Structure of nilpotent matrices over fields","year":2011,"lang":"en","type":"article","venue":"Electronic Journal of Linear Algebra","topic":"Advanced Topics in Algebra","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Lakehead University; Redeemer University","funders":"Natural Sciences and Engineering Research Council of Canada; Universities Space Research Association","keywords":"Mathematics; Nilpotent; Pure mathematics; Algebra over a field","score_opus":0.024753113956268013,"score_gpt":0.29386206841502055,"score_spread":0.26910895445875255,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W804643316","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9727785,0.0017417226,0.024230296,0.00007737205,0.00028521908,0.00010281591,0.0000040281493,0.000018178936,0.0007618503],"genre_scores_gemma":[0.9676392,0.00026343222,0.031448185,0.00006135747,0.000345516,4.021989e-7,5.605187e-7,0.00003080045,0.00021055844],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982841,0.000056912337,0.0007273779,0.00012348172,0.00039637252,0.0004117575],"domain_scores_gemma":[0.99841285,0.00016321661,0.00084520027,0.00029148723,0.00021143966,0.00007578176],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0003036257,0.00016968176,0.00040659087,0.00015477864,0.000041257434,0.000006511649,0.00043708377,0.00014237524,0.0009449746],"category_scores_gemma":[0.0002649403,0.00013364412,0.00020018886,0.00019433141,0.00005582239,0.0001879118,0.00005833883,0.00076347066,0.0000038105713],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020746188,0.00025217273,0.0010033023,0.00013977963,0.00044982263,0.0000382204,0.0016769002,0.000014552051,0.005232618,0.98714685,0.00091701536,0.0029213137],"study_design_scores_gemma":[0.0005849425,0.00052199303,0.00034168537,0.000054312073,0.000101744954,0.00017182564,0.0000883762,0.000025623209,0.06582662,0.9314294,0.00071560993,0.00013790367],"about_ca_topic_score_codex":0.000005296408,"about_ca_topic_score_gemma":0.000017077571,"teacher_disagreement_score":0.060594,"about_ca_system_score_codex":0.000093843184,"about_ca_system_score_gemma":0.0002184899,"threshold_uncertainty_score":0.9999683},"labels":[],"label_agreement":null}]}