{"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07691179,0.0031048201,0.727453,0.0035383774,0.00096543453,0.000059416303,0.0007765316,0.00016830533,0.18702233],"genre_scores_gemma":[0.90909386,0.0022012682,0.06566429,0.0015416025,0.00053619576,0.000122601,0.000549676,0.000078212426,0.020212354],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99895847,0.00027291736,0.00006128235,0.00024423568,0.00034592793,0.00011715215],"domain_scores_gemma":[0.9978771,0.0011617052,0.00022221827,0.000106004656,0.0004996575,0.00013334755],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010726389,0.0006023412,0.00031637689,0.00077349367,0.00047642188,0.0017115902,0.00050443044,0.0005178311,0.006580844],"category_scores_gemma":[0.0044813207,0.00021003564,0.0003539464,0.0009871785,0.0016043657,0.0014428501,0.0010231058,0.0019733403,0.0009840896],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007006544,0.000048013077,0.00054284197,0.00017734784,0.000032416705,0.00030891807,0.00026343702,0.012894723,0.010669924,0.925224,0.009477291,0.040291093],"study_design_scores_gemma":[0.000028537967,0.00017609025,0.0021913552,0.00010813682,0.00002997289,0.0007175707,0.00018041901,0.16691034,0.0048144464,0.79849404,0.026272802,0.00007632169],"about_ca_topic_score_codex":0.0014839097,"about_ca_topic_score_gemma":0.0021688908,"teacher_disagreement_score":0.006580844,"about_ca_system_score_codex":0.0008842166,"about_ca_system_score_gemma":0.00068205455,"threshold_uncertainty_score":0.022015095},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10356323,0.0020628253,0.7734604,0.00092416833,0.000632944,0.00009248812,0.00082518597,0.000409019,0.11802969],"genre_scores_gemma":[0.829663,0.0023886794,0.12306523,0.00089633075,0.00056978426,0.0002412745,0.0009801923,0.0002466647,0.041948885],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99942636,0.0001489899,0.000024968407,0.000107579835,0.0001848801,0.000107183514],"domain_scores_gemma":[0.9984413,0.0006720611,0.00030364157,0.00012884292,0.00031011205,0.00014412338],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005128136,0.00074412255,0.00041684503,0.00071178365,0.00043825922,0.0012752059,0.00048474022,0.00053422444,0.014649007],"category_scores_gemma":[0.0023695538,0.00025304704,0.00043688962,0.00076958956,0.0008672444,0.0013182027,0.0007672843,0.0013256094,0.002747852],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012816122,0.00006244912,0.00039197964,0.00018893696,0.000024954801,0.00031625424,0.0002183981,0.0128921885,0.014172397,0.92433184,0.008747432,0.038525008],"study_design_scores_gemma":[0.000022805905,0.00014912902,0.00083979004,0.000054665074,0.000016757538,0.00057039777,0.00011664729,0.077313,0.0065337177,0.88069,0.033636764,0.000056516095],"about_ca_topic_score_codex":0.00054943364,"about_ca_topic_score_gemma":0.00090650265,"teacher_disagreement_score":0.014649007,"about_ca_system_score_codex":0.00050350424,"about_ca_system_score_gemma":0.00041047588,"threshold_uncertainty_score":0.049005806},"labels":[],"label_agreement":null},{"id":"W1488440181","doi":"10.13001/1081-3810.1352","title":"Sign patterns that require or allow power-positivity","year":2009,"lang":"en","type":"article","venue":"Electronic Journal of Linear Algebra","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada; American Institute of Mathematics; National Science Foundation","keywords":"Digraph; Sign (mathematics); Mathematics; Power (physics); Integer (computer science); Combinatorics; Matrix (chemical analysis); Nonnegative matrix; Pure mathematics; Discrete mathematics; Mathematical analysis; Computer science; Symmetric matrix; Chemistry; Physics; Eigenvalues and eigenvectors","score_opus":0.011711444163003456,"score_gpt":0.25350927364926945,"score_spread":0.241797829486266,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1488440181","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26784527,0.00059484015,0.5010159,0.0019325186,0.0013593336,0.0006117591,0.0013485532,0.0022257857,0.22306615],"genre_scores_gemma":[0.89712906,0.0005583015,0.07507687,0.0010111881,0.00030105686,0.00040201694,0.00076564046,0.00041183672,0.024344027],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99845755,0.00024745497,0.00018925755,0.00029285342,0.00039306923,0.00041990008],"domain_scores_gemma":[0.9950504,0.0015292448,0.00064141594,0.001221496,0.0010641675,0.0004933728],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011293709,0.0008553516,0.00061467197,0.00054805516,0.0010657645,0.0030157405,0.0008250594,0.0010776089,0.017118646],"category_scores_gemma":[0.009570607,0.00041446168,0.0007104909,0.00085121026,0.0023432071,0.0049301917,0.002137718,0.0016501334,0.0039013843],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007010246,0.00012298994,0.0024656507,0.00027327763,0.000032899145,0.0022222684,0.00038547604,0.0037725947,0.02535605,0.8822946,0.010706514,0.0716667],"study_design_scores_gemma":[0.0001130481,0.00019655375,0.0007758284,0.000078459074,0.000040914078,0.0015569478,0.00031447402,0.015305515,0.018292839,0.92798525,0.03527738,0.00006275038],"about_ca_topic_score_codex":0.00042414665,"about_ca_topic_score_gemma":0.0006981887,"teacher_disagreement_score":0.017118646,"about_ca_system_score_codex":0.00041072324,"about_ca_system_score_gemma":0.00078947545,"threshold_uncertainty_score":0.057267547},"labels":[],"label_agreement":null},{"id":"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17741321,0.005429102,0.5892316,0.004635834,0.0006630207,0.00016185372,0.0009994239,0.00024332207,0.2212226],"genre_scores_gemma":[0.92511857,0.0016785457,0.041899245,0.0011403153,0.0008882712,0.00022538261,0.00058189617,0.00016941484,0.028298426],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986896,0.00032578368,0.00006405115,0.0002745821,0.0003935552,0.00025245585],"domain_scores_gemma":[0.99608237,0.0017694217,0.0004088379,0.00017930812,0.0011241644,0.00043599453],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019095396,0.0007604753,0.00054000976,0.0015478646,0.0008444501,0.0019529883,0.0008697974,0.00050390395,0.007939718],"category_scores_gemma":[0.005771454,0.0002953618,0.0008461863,0.00088874105,0.0021019082,0.0028861156,0.0019315061,0.0032438997,0.00066584983],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004084238,0.000018823157,0.00040308177,0.000042935604,0.0000087958315,0.00012347783,0.00014155156,0.0010837548,0.0021530788,0.985182,0.0029736257,0.007828128],"study_design_scores_gemma":[0.000017795159,0.0000801711,0.0011100454,0.000040068444,0.000011012057,0.00032266675,0.00014834228,0.023520216,0.0021248667,0.9582871,0.0143141,0.00002358555],"about_ca_topic_score_codex":0.000692916,"about_ca_topic_score_gemma":0.00063137914,"teacher_disagreement_score":0.007939718,"about_ca_system_score_codex":0.001789568,"about_ca_system_score_gemma":0.00069647783,"threshold_uncertainty_score":0.026561022},"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":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0023395903,0.04002093,0.009002205,0.037984204,0.7256065,0.00023014266,0.0031637782,0.0010964796,0.18055618],"genre_scores_gemma":[0.017801713,0.029029755,0.0041661193,0.009028452,0.49311736,0.00020599802,0.0047430764,0.0015988279,0.44030863],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9985207,0.00018836414,0.00011238086,0.00025784556,0.0008180784,0.00010266772],"domain_scores_gemma":[0.99248683,0.0015563244,0.00044410414,0.0004787044,0.0037406362,0.001293328],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012708567,0.0013008534,0.0015363524,0.0038624187,0.0018941875,0.0057455515,0.0013201577,0.0014167354,0.1836124],"category_scores_gemma":[0.006870201,0.00043845148,0.0009010127,0.0030815732,0.0008203865,0.0035401175,0.001694525,0.0035646067,0.089995824],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022789853,0.000018472374,0.00008549509,0.00021396665,0.000008064104,0.000037890593,0.000029005632,0.00008780479,0.00036320064,0.0027879726,0.9660095,0.030335918],"study_design_scores_gemma":[0.0000069652356,0.000051258732,0.0007446769,0.00021013111,0.000009157262,0.000257698,0.0000543188,0.00025790898,0.00026247933,0.005157181,0.99297184,0.000016388072],"about_ca_topic_score_codex":0.00051821826,"about_ca_topic_score_gemma":0.0007308216,"teacher_disagreement_score":0.1836124,"about_ca_system_score_codex":0.0014142502,"about_ca_system_score_gemma":0.0015674462,"threshold_uncertainty_score":0.6142447},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.72429895,0.0010533406,0.118822224,0.0080473,0.001331532,0.0001552614,0.0007552299,0.0008381641,0.14469807],"genre_scores_gemma":[0.98134685,0.0001573003,0.012879209,0.0003939698,0.00031390815,0.00007373381,0.00026952865,0.000020679978,0.004544873],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985562,0.0002492421,0.00009282231,0.00030943513,0.00043476472,0.0003575871],"domain_scores_gemma":[0.9965353,0.001127287,0.00040126237,0.0007852351,0.00057193433,0.0005790123],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001504604,0.00053788227,0.00081192894,0.0016957629,0.002615181,0.0016003257,0.0015476597,0.0020853619,0.013585575],"category_scores_gemma":[0.006364499,0.0006474433,0.0008220244,0.0015307283,0.0057241996,0.0032890926,0.004229689,0.0026792677,0.0007859033],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012449118,0.000044473403,0.0029837596,0.00009280623,0.000014543082,0.0006375034,0.000552015,0.0025498043,0.00086497364,0.97828215,0.0055586593,0.0082949335],"study_design_scores_gemma":[0.00007765092,0.00006511023,0.002083884,0.000044240318,0.000012250229,0.0007244239,0.000405746,0.015375661,0.001043146,0.97383183,0.0062968037,0.000039164184],"about_ca_topic_score_codex":0.0010556183,"about_ca_topic_score_gemma":0.0008594119,"teacher_disagreement_score":0.013585575,"about_ca_system_score_codex":0.0014877779,"about_ca_system_score_gemma":0.0008470066,"threshold_uncertainty_score":0.045448244},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35223365,0.0029214995,0.5412533,0.0017159416,0.0002678072,0.00013869605,0.0013053194,0.0004551014,0.099708706],"genre_scores_gemma":[0.8974115,0.0028846953,0.07426289,0.00040750598,0.00047266248,0.00017830024,0.0008689324,0.00014360834,0.023369951],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99933463,0.00018831015,0.000040734674,0.00014454151,0.00018249592,0.00010921164],"domain_scores_gemma":[0.9962041,0.0021550998,0.00049071264,0.00027409132,0.00048671887,0.00038940035],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007998316,0.00071410724,0.00043665938,0.0022523294,0.0009945395,0.0018336638,0.0004970858,0.0007429067,0.0048678606],"category_scores_gemma":[0.0056193545,0.0003772412,0.00042798562,0.0021099881,0.0021187086,0.0033199056,0.0010314977,0.0013612664,0.0008445511],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000048886555,0.000026164767,0.00033543675,0.00005802644,0.0000039457595,0.00009857554,0.0002157153,0.0069816685,0.0011101033,0.97343904,0.0012755328,0.016407032],"study_design_scores_gemma":[0.0000064257256,0.00003076364,0.00020883612,0.00002156681,0.0000028418397,0.00012364579,0.000050527018,0.013402093,0.00033638196,0.9826779,0.0031261449,0.000012902027],"about_ca_topic_score_codex":0.0010754254,"about_ca_topic_score_gemma":0.0011768646,"teacher_disagreement_score":0.0048678606,"about_ca_system_score_codex":0.0011464336,"about_ca_system_score_gemma":0.0007238342,"threshold_uncertainty_score":0.016284585},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.68306124,0.00075435225,0.24910043,0.0009752897,0.00011265383,0.000044015436,0.00012710868,0.00020825244,0.06561666],"genre_scores_gemma":[0.9875646,0.00017850361,0.007230711,0.00006314207,0.000039763087,0.000025132184,0.000041099083,0.000026854143,0.0048302254],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997708,0.000065115346,0.0000093832505,0.00003322387,0.000082130406,0.00003933999],"domain_scores_gemma":[0.99963915,0.00012283755,0.00006667902,0.000053732372,0.000054317716,0.00006313778],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004280177,0.00034391714,0.00033564266,0.00063860684,0.0006573588,0.0018388308,0.0005996801,0.00062960765,0.0035490068],"category_scores_gemma":[0.001019443,0.00018595501,0.00031030682,0.00023522731,0.0018258917,0.0020863514,0.00093953154,0.0006563191,0.00036833255],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011772279,0.000014329753,0.00017095217,0.000018173494,0.0000040422783,0.00005713809,0.0001287935,0.0071189473,0.004459971,0.9869284,0.0001911155,0.00089632015],"study_design_scores_gemma":[0.000012511072,0.00003442532,0.0003050184,0.000016243359,0.000004018536,0.00015214013,0.00013741596,0.1382127,0.0017895707,0.8579384,0.0013785291,0.00001890514],"about_ca_topic_score_codex":0.00048075596,"about_ca_topic_score_gemma":0.000264321,"teacher_disagreement_score":0.0035490068,"about_ca_system_score_codex":0.00055667484,"about_ca_system_score_gemma":0.000301019,"threshold_uncertainty_score":0.011872649},"labels":[],"label_agreement":null},{"id":"W2096600852","doi":"10.13001/1081-3810.1127","title":"Matrix inversion and digraphs: the one factor case","year":2004,"lang":"en","type":"article","venue":"Electronic Journal of Linear Algebra","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Invertible matrix; Digraph; Mathematics; Inverse; Combinatorics; Matrix (chemical analysis); Diagonal matrix; Involutory matrix; Block matrix; Diagonal; Square matrix; Diagonally dominant matrix; Pure mathematics; Sequence (biology); Simple (philosophy); Inversion (geology); Symmetric matrix; Eigenvalues and eigenvectors; Physics","score_opus":0.009089055789342236,"score_gpt":0.23904091061957805,"score_spread":0.2299518548302358,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2096600852","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14275584,0.001294633,0.7694542,0.0007731441,0.00019378636,0.000109681074,0.0005405415,0.0004847846,0.08439343],"genre_scores_gemma":[0.8341456,0.0013427965,0.13490038,0.0003579708,0.00026719598,0.00012394712,0.00062426605,0.00013686567,0.02810098],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995065,0.00008473772,0.00002693364,0.00014781962,0.00013572507,0.00009833959],"domain_scores_gemma":[0.99870753,0.000588367,0.00020136999,0.00018842399,0.00018591133,0.00012839783],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037931403,0.00048817744,0.00037141284,0.0009876272,0.0006801186,0.0014661456,0.00050779944,0.00082882395,0.007436911],"category_scores_gemma":[0.0027969317,0.00026653605,0.00048139013,0.0012028173,0.0019214957,0.002805008,0.0009430144,0.0010824739,0.0011770631],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029326888,0.00002037759,0.00027013628,0.000046841895,0.000005304894,0.00020918017,0.00017229811,0.005821765,0.0017945333,0.970088,0.0011568482,0.020385357],"study_design_scores_gemma":[0.000010043902,0.000035894856,0.00014786387,0.000019935216,0.0000052605283,0.00026722826,0.00008547419,0.027479218,0.0010214874,0.96319604,0.007712632,0.000018937766],"about_ca_topic_score_codex":0.002070062,"about_ca_topic_score_gemma":0.002306514,"teacher_disagreement_score":0.007436911,"about_ca_system_score_codex":0.0007874697,"about_ca_system_score_gemma":0.000562412,"threshold_uncertainty_score":0.02487892},"labels":[],"label_agreement":null},{"id":"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.864788,0.00014088888,0.07339715,0.00019417204,0.00014385248,0.00005530516,0.00020654945,0.0003618212,0.06071228],"genre_scores_gemma":[0.97790694,0.00009680986,0.01121451,0.000038106664,0.000029184392,0.000027769893,0.00022518457,0.000059248254,0.010402257],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995982,0.000051224775,0.000029817063,0.000059922906,0.00011032163,0.00015055943],"domain_scores_gemma":[0.99934715,0.000097691605,0.00017131158,0.00017319183,0.000134862,0.000075732074],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020067746,0.00038832347,0.00026598672,0.0006333605,0.00074635574,0.0010653508,0.0003982389,0.0002855234,0.006986893],"category_scores_gemma":[0.0011643459,0.00018859432,0.00030703182,0.0005141069,0.0014666491,0.0011157251,0.0008701767,0.00053800043,0.0006791441],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030218915,0.000084256826,0.006847243,0.00010062491,0.000017352242,0.0007630624,0.000737226,0.004212078,0.0920287,0.84773403,0.0028885733,0.04428464],"study_design_scores_gemma":[0.00006976105,0.00040405552,0.007721171,0.00005357357,0.00005120618,0.0014845184,0.0012257636,0.045644064,0.10654718,0.8059577,0.030714462,0.0001265603],"about_ca_topic_score_codex":0.0005038775,"about_ca_topic_score_gemma":0.0011819341,"teacher_disagreement_score":0.006986893,"about_ca_system_score_codex":0.0003663916,"about_ca_system_score_gemma":0.00045576817,"threshold_uncertainty_score":0.023373485},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42056313,0.00025392135,0.48583862,0.0004351597,0.0003162767,0.00019610894,0.00038313816,0.00078722736,0.09122648],"genre_scores_gemma":[0.855254,0.0002209201,0.10829217,0.0002553667,0.00007426621,0.0001540238,0.00053063896,0.00032625117,0.034892507],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995797,0.000070097245,0.000025790192,0.00006849919,0.00016138711,0.0000946539],"domain_scores_gemma":[0.9993012,0.00015341368,0.000071828836,0.00019646286,0.00015581383,0.000121300836],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002969738,0.00041738342,0.00035897148,0.0007499401,0.0005687377,0.0009838805,0.00060840696,0.00041223638,0.009805052],"category_scores_gemma":[0.0017496245,0.00029254414,0.00037885274,0.00051543245,0.0010394967,0.0014279153,0.0021474294,0.00067670713,0.0020303242],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002093654,0.00007338114,0.0010022644,0.00016312892,0.000017845157,0.0007075436,0.00060717005,0.0059288414,0.054465313,0.84511787,0.0054103113,0.08629691],"study_design_scores_gemma":[0.00007258373,0.00021368447,0.0005602509,0.000055804092,0.000020294068,0.0007761249,0.00034263363,0.059890967,0.04737832,0.86783767,0.022797016,0.00005471791],"about_ca_topic_score_codex":0.00017566314,"about_ca_topic_score_gemma":0.00046530846,"teacher_disagreement_score":0.009805052,"about_ca_system_score_codex":0.00031419855,"about_ca_system_score_gemma":0.00041716764,"threshold_uncertainty_score":0.03280115},"labels":[],"label_agreement":null},{"id":"W2121454630","doi":"10.13001/1081-3810.1065","title":"How to establish universal block-matrix factorizations","year":2001,"lang":"en","type":"article","venue":"Electronic Journal of Linear Algebra","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Mathematics; Factorization; Algebra over a field; Quaternion; Block (permutation group theory); Matrix decomposition; Pure mathematics; Combinatorics; Algorithm; Eigenvalues and eigenvectors","score_opus":0.007173415064601761,"score_gpt":0.23528526945593906,"score_spread":0.2281118543913373,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2121454630","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015481104,0.0005693136,0.9551724,0.00034307686,0.0002978227,0.00011003426,0.00025822848,0.0007622327,0.027005743],"genre_scores_gemma":[0.3999078,0.0013567255,0.57782143,0.00085103733,0.0005364452,0.0004123004,0.0009769929,0.0012052171,0.016931994],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9964664,0.0007626784,0.00032001708,0.0009172745,0.0009343114,0.00059937435],"domain_scores_gemma":[0.9957848,0.0014043773,0.00030534453,0.000986742,0.001215226,0.00030355022],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037930987,0.0012498291,0.001289628,0.002630828,0.0019293939,0.0021808967,0.0011504468,0.0010167098,0.018524418],"category_scores_gemma":[0.010994314,0.0008620844,0.0014854883,0.0014191727,0.0028497644,0.009574255,0.0043947226,0.002853424,0.005737643],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004748804,0.00002471542,0.00030628362,0.00013641351,0.000021323427,0.0001392033,0.00032223016,0.001989185,0.0033552316,0.94901174,0.003542827,0.04110347],"study_design_scores_gemma":[0.000011649854,0.000029851994,0.00014757071,0.000061427054,0.000015316205,0.00014791747,0.000082046616,0.012187921,0.0058254353,0.96864855,0.012807492,0.000034839497],"about_ca_topic_score_codex":0.0012617211,"about_ca_topic_score_gemma":0.0013235095,"teacher_disagreement_score":0.018524418,"about_ca_system_score_codex":0.00082353404,"about_ca_system_score_gemma":0.0009591568,"threshold_uncertainty_score":0.061970294},"labels":[],"label_agreement":null},{"id":"W2132750688","doi":"10.13001/1081-3810.1114","title":"On nonnegative matrices with given row and column sums","year":2003,"lang":"en","type":"article","venue":"Electronic Journal of Linear Algebra","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Mathematics; Column (typography); Combinatorics; Row and column spaces; Pure mathematics; Row; Geometry","score_opus":0.004411372928628116,"score_gpt":0.21326746395661283,"score_spread":0.20885609102798472,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2132750688","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.057051945,0.001988127,0.89518255,0.0010206265,0.000447464,0.00009119777,0.0007687738,0.00044575945,0.043003567],"genre_scores_gemma":[0.49729285,0.007853534,0.43101293,0.0017838477,0.0012807259,0.0006386885,0.0034265441,0.00081372884,0.055897217],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99798286,0.00065923546,0.00014722413,0.00036583224,0.0005532593,0.00029154663],"domain_scores_gemma":[0.9946741,0.0027754458,0.0006664713,0.00053103204,0.0009176523,0.00043527517],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001563583,0.0022555238,0.0009165429,0.001960715,0.0010534694,0.0027430803,0.001112416,0.0012271006,0.007911213],"category_scores_gemma":[0.010776085,0.0006747115,0.0007119763,0.0024078737,0.0027735296,0.0050740587,0.0024818503,0.0017343615,0.0035463131],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020851596,0.000057369783,0.0005642213,0.00032335214,0.000021707667,0.00045704845,0.0002773062,0.017871754,0.00716623,0.8978354,0.010385459,0.06483167],"study_design_scores_gemma":[0.00002185919,0.000068501206,0.00036923427,0.000093686955,0.000010547093,0.00030707667,0.00006781436,0.047055904,0.0017528636,0.9420824,0.008125223,0.00004488844],"about_ca_topic_score_codex":0.001350933,"about_ca_topic_score_gemma":0.002477153,"teacher_disagreement_score":0.007911213,"about_ca_system_score_codex":0.0007538268,"about_ca_system_score_gemma":0.00075071555,"threshold_uncertainty_score":0.026465595},"labels":[],"label_agreement":null},{"id":"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41421822,0.0044912044,0.19460525,0.008527447,0.00065932586,0.000067355024,0.00038006355,0.00018936762,0.37686175],"genre_scores_gemma":[0.9367391,0.0026014422,0.037977103,0.0011154442,0.0007650097,0.000050246,0.00036879923,0.000085475076,0.020297369],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99935395,0.00014794583,0.000032647877,0.000131109,0.0002121127,0.00012227721],"domain_scores_gemma":[0.99789906,0.0008431765,0.00026173127,0.00043037592,0.0003673115,0.0001983363],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063267694,0.00041359814,0.00040478873,0.0014756606,0.00085915555,0.0020769285,0.00050447346,0.0005367346,0.0076772114],"category_scores_gemma":[0.003122339,0.00018031265,0.00043937925,0.0012619819,0.002978677,0.004336387,0.001751828,0.0017166522,0.000450407],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000127953035,0.000021094036,0.00059731083,0.00003459678,0.0000037839873,0.00007268985,0.0001499341,0.00074656954,0.0017619234,0.98325366,0.00083317666,0.012512456],"study_design_scores_gemma":[0.000005430253,0.00006369261,0.0013384615,0.00003080006,0.0000065082113,0.00041733726,0.0003792841,0.0061366283,0.0010832521,0.9727084,0.017816842,0.000013410507],"about_ca_topic_score_codex":0.00036319514,"about_ca_topic_score_gemma":0.00040033105,"teacher_disagreement_score":0.0076772114,"about_ca_system_score_codex":0.00046519953,"about_ca_system_score_gemma":0.00028650695,"threshold_uncertainty_score":0.025682807},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7208552,0.0011143817,0.17408895,0.00910803,0.00051406445,0.00018579053,0.0005225675,0.0027222175,0.09088892],"genre_scores_gemma":[0.9907707,0.00016484276,0.0052977283,0.0003132811,0.000044150976,0.00005076689,0.00009734696,0.000118846205,0.0031422938],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984855,0.00030600745,0.00006838682,0.00041496212,0.00023947438,0.00048561802],"domain_scores_gemma":[0.99408877,0.002736455,0.00048755796,0.0019007284,0.0002959468,0.00049067294],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017578296,0.00041443363,0.0007500709,0.00068412896,0.0024210187,0.0022567348,0.001349874,0.002640986,0.012594594],"category_scores_gemma":[0.015934495,0.00062849314,0.0007967254,0.00066972437,0.0042275367,0.010284864,0.002449255,0.0022127745,0.001504629],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00036509702,0.00015592118,0.0029445346,0.00016576114,0.0000378519,0.0007786121,0.00079939637,0.01645994,0.0062675606,0.93458337,0.005951718,0.0314901],"study_design_scores_gemma":[0.000026809168,0.00007671933,0.0006356906,0.000038868748,0.000018396386,0.00039005902,0.0005556391,0.027938101,0.007284889,0.95787853,0.005118848,0.00003745493],"about_ca_topic_score_codex":0.0008400528,"about_ca_topic_score_gemma":0.00068468536,"teacher_disagreement_score":0.012594594,"about_ca_system_score_codex":0.0017284934,"about_ca_system_score_gemma":0.00088339805,"threshold_uncertainty_score":0.042133093},"labels":[],"label_agreement":null},{"id":"W2161590236","doi":"10.13001/1081-3810.1086","title":"On the Cayley transform of positivity classes of matrices","year":2002,"lang":"en","type":"article","venue":"Electronic Journal of Linear Algebra","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Cayley transform; Combinatorics; Factorization; Matrix (chemical analysis); Pure mathematics; Class (philosophy); Nonnegative matrix; Involution (esoterism); Matrix decomposition; Symmetric matrix; Graph; Eigenvalues and eigenvectors","score_opus":0.009571181560378063,"score_gpt":0.22473492134106846,"score_spread":0.2151637397806904,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2161590236","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.60129845,0.00067151047,0.32348487,0.00074358,0.00014375767,0.000072747454,0.00022502383,0.00015931066,0.07320075],"genre_scores_gemma":[0.9709811,0.00059126824,0.018678155,0.00022749187,0.00020081122,0.000063894375,0.0002722638,0.00008543613,0.008899416],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994455,0.0001432023,0.00001775065,0.0001211596,0.0001513275,0.00012104365],"domain_scores_gemma":[0.9963965,0.0018209113,0.00043844114,0.0002682689,0.000638513,0.0004374246],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013114685,0.000485803,0.0003913424,0.0012847258,0.0012088923,0.0019598624,0.0004938667,0.0005931638,0.0073579927],"category_scores_gemma":[0.006375358,0.00029002532,0.000510087,0.00079433026,0.0023197543,0.0028498813,0.00089844986,0.0012850581,0.0008187727],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009019214,0.000028268681,0.0009529741,0.000025528983,0.0000065147747,0.00017269533,0.0003105858,0.0042570266,0.0040183607,0.97593075,0.0012968564,0.0129102515],"study_design_scores_gemma":[0.000019043819,0.000053795913,0.00056003645,0.000017612098,0.0000050644244,0.00024416964,0.00018071062,0.05033851,0.001996864,0.94405156,0.0025086305,0.000023942768],"about_ca_topic_score_codex":0.0014584465,"about_ca_topic_score_gemma":0.0011499708,"teacher_disagreement_score":0.0073579927,"about_ca_system_score_codex":0.00058024377,"about_ca_system_score_gemma":0.0004782954,"threshold_uncertainty_score":0.02461493},"labels":[],"label_agreement":null},{"id":"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4596415,0.008225297,0.3921179,0.006438585,0.00028536216,0.00018368472,0.0028391725,0.0013218742,0.12894663],"genre_scores_gemma":[0.9441288,0.0035915175,0.045585524,0.00047697977,0.00053578924,0.00019083293,0.0015151346,0.00028321438,0.0036920162],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9968303,0.0005523264,0.00013180565,0.0009254199,0.00093437143,0.00062577164],"domain_scores_gemma":[0.95641303,0.034528807,0.0025577038,0.0027472216,0.001968699,0.0017845929],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018449216,0.0014914285,0.0017160805,0.0043042446,0.0023237525,0.0046883216,0.0028811798,0.0018450982,0.010751908],"category_scores_gemma":[0.028144091,0.0011957352,0.001005537,0.00554732,0.003942955,0.010873411,0.00434653,0.0045753126,0.0012376168],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00071339455,0.00022755537,0.011105277,0.0010685194,0.00019095387,0.0011589347,0.0014580601,0.091287576,0.020287188,0.7734154,0.014233242,0.08485397],"study_design_scores_gemma":[0.000063708765,0.00022194424,0.008794468,0.000262888,0.00015764116,0.0017756125,0.0004745891,0.1200063,0.00772742,0.8460277,0.014346624,0.00014103868],"about_ca_topic_score_codex":0.0019081334,"about_ca_topic_score_gemma":0.0026862936,"teacher_disagreement_score":0.010751908,"about_ca_system_score_codex":0.0014994435,"about_ca_system_score_gemma":0.0005494928,"threshold_uncertainty_score":0.03596872},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39615938,0.0006653357,0.53593576,0.00045351015,0.00021460152,0.00012428407,0.00022592672,0.00054380484,0.06567738],"genre_scores_gemma":[0.81829286,0.000439659,0.16674742,0.0002076114,0.00011824874,0.00018124809,0.00050913065,0.0002700496,0.013233744],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993007,0.00013487926,0.000046282443,0.00014965299,0.00024001252,0.00012834455],"domain_scores_gemma":[0.9988231,0.00036277942,0.0001720021,0.00024568592,0.00025093983,0.00014539219],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006171168,0.0005127464,0.00057232176,0.0012347067,0.001179955,0.0011690235,0.0009922741,0.00087408035,0.005544572],"category_scores_gemma":[0.0033578326,0.0003634582,0.00041675064,0.0007328336,0.0016051839,0.0021373814,0.0016933437,0.0012713798,0.0011258428],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019872822,0.00006869213,0.002516036,0.00014633693,0.000016252168,0.0006921573,0.0003841547,0.0058606463,0.028216537,0.87349623,0.003509789,0.08489441],"study_design_scores_gemma":[0.0000386917,0.0001048018,0.00085685943,0.00005099066,0.000013094859,0.0012120114,0.0003974127,0.039729163,0.022526588,0.92054164,0.014475606,0.000053072792],"about_ca_topic_score_codex":0.00027130073,"about_ca_topic_score_gemma":0.00041288493,"teacher_disagreement_score":0.005544572,"about_ca_system_score_codex":0.00041811875,"about_ca_system_score_gemma":0.00039554105,"threshold_uncertainty_score":0.018548429},"labels":[],"label_agreement":null},{"id":"W2169257454","doi":"10.13001/1081-3810.1300","title":"On the minimum rank of not necessarily symmetric matrices: A preliminary study","year":2009,"lang":"en","type":"article","venue":"Electronic Journal of Linear Algebra","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":52,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Digraph; Rank (graph theory); Zero (linguistics); Graph; Cover (algebra); Simple graph; Discrete mathematics","score_opus":0.010352681736522,"score_gpt":0.24872913210156505,"score_spread":0.23837645036504304,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2169257454","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11083836,0.004695161,0.85165036,0.0014509922,0.00020529164,0.000086712,0.000531182,0.00028483063,0.030257175],"genre_scores_gemma":[0.72921073,0.008523044,0.24345887,0.00055876217,0.0013086618,0.00016964422,0.0013057429,0.0003380213,0.015126543],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981092,0.0006829429,0.00012227234,0.0003482185,0.0004981278,0.00023912676],"domain_scores_gemma":[0.976073,0.017756242,0.0017212386,0.001624221,0.0022044242,0.0006208851],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030398734,0.0011436533,0.0011567285,0.0016973934,0.00084930874,0.0024174142,0.0012270333,0.0011569776,0.005860564],"category_scores_gemma":[0.023791954,0.00068041816,0.0011079282,0.002633403,0.0029027215,0.006893528,0.001558484,0.0023347207,0.0013829344],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028105683,0.00024104965,0.003109012,0.0008190425,0.000067858375,0.00043946863,0.00055088743,0.08145505,0.006414099,0.829823,0.008406213,0.06839318],"study_design_scores_gemma":[0.000031072894,0.0003083824,0.0012404651,0.00012055992,0.00003080845,0.00052971696,0.00020522118,0.1854534,0.0035029356,0.80157435,0.006939307,0.00006373506],"about_ca_topic_score_codex":0.0014822284,"about_ca_topic_score_gemma":0.001724331,"teacher_disagreement_score":0.005860564,"about_ca_system_score_codex":0.0008807322,"about_ca_system_score_gemma":0.00089361204,"threshold_uncertainty_score":0.019605577},"labels":[],"label_agreement":null},{"id":"W2169257893","doi":"10.13001/1081-3810.1171","title":"Schur complements and Banachiewicz-Schur forms","year":2005,"lang":"en","type":"article","venue":"Electronic Journal of Linear Algebra","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Mathematics; Schur complement; Idempotent matrix; Schur's theorem; Schur product theorem; Idempotence; Rank (graph theory); Schur decomposition; Schur algebra; Pure mathematics; Matrix (chemical analysis); Algebra over a field; Schur's lemma; Combinatorics; Eigenvalues and eigenvectors","score_opus":0.007760726781642667,"score_gpt":0.24745581324726929,"score_spread":0.23969508646562662,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2169257893","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22581312,0.0004907009,0.70099455,0.00064071827,0.00018611588,0.00017563804,0.00030500581,0.00026404412,0.07113012],"genre_scores_gemma":[0.89129865,0.0005215636,0.09028392,0.00026552854,0.00022739165,0.00022328932,0.0003305396,0.00007834194,0.01677077],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984484,0.00037981538,0.00007550012,0.0003008016,0.00054234004,0.0002530736],"domain_scores_gemma":[0.9975708,0.0008366536,0.0004421518,0.00021671857,0.00067270134,0.000260886],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012248391,0.0010543007,0.00068122236,0.0013747547,0.0012380123,0.0025659318,0.0005880733,0.0007387826,0.011662323],"category_scores_gemma":[0.0056389184,0.00040950676,0.00072666514,0.000717109,0.0034710385,0.0036387965,0.0018149767,0.0016862537,0.0010186785],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006840805,0.00002924377,0.00022935549,0.000062346444,0.000016573435,0.00029054115,0.00020340264,0.005155784,0.00427583,0.98098963,0.0006686498,0.008010376],"study_design_scores_gemma":[0.000046842422,0.00015737128,0.00036757518,0.000044056032,0.000019621244,0.0006273848,0.00039633567,0.04301012,0.0077883378,0.94133234,0.0061558317,0.000054187363],"about_ca_topic_score_codex":0.0008534209,"about_ca_topic_score_gemma":0.001219902,"teacher_disagreement_score":0.011662323,"about_ca_system_score_codex":0.00064604107,"about_ca_system_score_gemma":0.0012168875,"threshold_uncertainty_score":0.0390144},"labels":[],"label_agreement":null},{"id":"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12843163,0.007445099,0.10925441,0.34222496,0.014899091,0.00017987096,0.0012770292,0.0011779014,0.39511],"genre_scores_gemma":[0.9038807,0.002827996,0.029581526,0.026500737,0.005299611,0.00025706273,0.0007181018,0.0004380159,0.030496204],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9967746,0.0010915644,0.00020995887,0.000712244,0.0007414056,0.00047021962],"domain_scores_gemma":[0.9852483,0.011042146,0.0005627301,0.0012416994,0.0012949583,0.00061016413],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034173976,0.0006666223,0.0014588722,0.0018608883,0.0066743,0.00458776,0.002008313,0.009244675,0.018737512],"category_scores_gemma":[0.02819958,0.00081077317,0.0016594415,0.0027483434,0.009381159,0.013115801,0.008525676,0.00774195,0.0021557217],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009570404,0.00003714104,0.0003792044,0.00007154755,0.000021722351,0.00046693365,0.00067607075,0.00021066892,0.00022400153,0.969624,0.023740828,0.00445211],"study_design_scores_gemma":[0.0000923237,0.000025327425,0.00039182545,0.00007634862,0.000030019119,0.00089799805,0.00057637144,0.001183378,0.00036138916,0.9406531,0.05568132,0.000030603016],"about_ca_topic_score_codex":0.0012235857,"about_ca_topic_score_gemma":0.0007989202,"teacher_disagreement_score":0.018737512,"about_ca_system_score_codex":0.0014753977,"about_ca_system_score_gemma":0.0008553956,"threshold_uncertainty_score":0.062683284},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.058670167,0.0034748188,0.8600642,0.0021987413,0.00083005783,0.000036523936,0.00012280117,0.0001648221,0.07443781],"genre_scores_gemma":[0.76198035,0.010217321,0.1721786,0.0024352795,0.0032812501,0.00018519342,0.00027594317,0.000475356,0.04897072],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992405,0.00031186218,0.00003144279,0.00013864084,0.00021484605,0.0000626273],"domain_scores_gemma":[0.9988532,0.000714177,0.00010966342,0.00010304833,0.00015208047,0.00006785626],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015611545,0.0007154301,0.0003637147,0.0010076526,0.0004920562,0.0012357027,0.0005072015,0.001027244,0.0038674287],"category_scores_gemma":[0.0038145354,0.00021988754,0.0004352263,0.0006134424,0.0036332062,0.0023740274,0.0013427513,0.001909526,0.0012811],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003240024,0.000009966085,0.000058470232,0.000046842033,0.0000035577657,0.000108190885,0.00015653805,0.0022451456,0.004309718,0.98442644,0.0005399327,0.008062789],"study_design_scores_gemma":[0.000006993421,0.000046815436,0.00022719172,0.000031854794,0.000005292733,0.00030447426,0.00007277609,0.031154972,0.002002916,0.95938575,0.0067402404,0.000020818947],"about_ca_topic_score_codex":0.00047928648,"about_ca_topic_score_gemma":0.0002611109,"teacher_disagreement_score":0.0038674287,"about_ca_system_score_codex":0.0003544112,"about_ca_system_score_gemma":0.00027449813,"threshold_uncertainty_score":0.012937784},"labels":[],"label_agreement":null},{"id":"W2400749722","doi":"10.13001/1081-3810.3129","title":"Totally Positive Density Matrices and Linear Preservers","year":2016,"lang":"en","type":"article","venue":"Electronic Journal of Linear Algebra","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Mathematics; Intersection (aeronautics); Density matrix; Set (abstract data type); Matrix (chemical analysis); Quantum; Qubit; Pure mathematics; Combinatorics; Discrete mathematics; Quantum mechanics; Computer science; Physics","score_opus":0.005074375965425664,"score_gpt":0.22262417888748373,"score_spread":0.21754980292205806,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2400749722","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49563104,0.0016631428,0.33349702,0.0017127249,0.00022340188,0.00008285578,0.00066597795,0.00044005486,0.16608368],"genre_scores_gemma":[0.97019124,0.0005436093,0.019551244,0.00020611762,0.00026531427,0.000069441776,0.00032331713,0.00007153222,0.008778268],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99836713,0.00043801728,0.00007790386,0.00030170762,0.0005508568,0.0002644197],"domain_scores_gemma":[0.9966043,0.0014710878,0.00063856883,0.00038502348,0.00046209956,0.0004388313],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014378704,0.00057427335,0.0003877248,0.0015552916,0.000995038,0.0027606783,0.00088061,0.0007075058,0.0059691863],"category_scores_gemma":[0.004487722,0.00029991212,0.0005103671,0.00097230857,0.0035791018,0.0034732115,0.001856937,0.0016156097,0.00068656914],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019837687,0.000013785884,0.000114537506,0.000020612453,0.0000037740951,0.00007040996,0.000117199685,0.001148453,0.00092752377,0.9937034,0.00048926316,0.0033711817],"study_design_scores_gemma":[0.000006833826,0.000033497254,0.00016216056,0.000011466606,0.0000029243902,0.000168183,0.000107364096,0.010787872,0.0008261431,0.9863849,0.0014941425,0.000014480226],"about_ca_topic_score_codex":0.00052188244,"about_ca_topic_score_gemma":0.00037689073,"teacher_disagreement_score":0.0059691863,"about_ca_system_score_codex":0.00059269724,"about_ca_system_score_gemma":0.0005293886,"threshold_uncertainty_score":0.019968927},"labels":[],"label_agreement":null},{"id":"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.73662335,0.00031862265,0.17767453,0.0003228857,0.00008019827,0.000096897034,0.00086761866,0.00056974264,0.08344616],"genre_scores_gemma":[0.9771115,0.00018854081,0.016348569,0.000074171054,0.00004211924,0.0000359368,0.0005476416,0.00005132405,0.00560009],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999585,0.00007408417,0.000023079308,0.000122272,0.0000951091,0.00010043396],"domain_scores_gemma":[0.9991953,0.00018073356,0.00017846347,0.00013887208,0.00015505988,0.00015158136],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027201712,0.00030396637,0.00032822078,0.000896264,0.00053277187,0.0008816272,0.0004506553,0.00031136657,0.0059360955],"category_scores_gemma":[0.0015324018,0.00020533183,0.0003302484,0.00049958646,0.0012042881,0.001064813,0.00064891536,0.00045688107,0.0006731495],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014889854,0.00002487789,0.001314492,0.000061294726,0.000016952245,0.00028063907,0.00023112676,0.009814175,0.010105924,0.95839006,0.0015523821,0.018059222],"study_design_scores_gemma":[0.000031028227,0.00006789252,0.0021622127,0.000018221463,0.000015553036,0.0005467333,0.00033982086,0.04320471,0.0048526227,0.9377627,0.010969929,0.00002865097],"about_ca_topic_score_codex":0.00080039963,"about_ca_topic_score_gemma":0.0011602599,"teacher_disagreement_score":0.0059360955,"about_ca_system_score_codex":0.0006250321,"about_ca_system_score_gemma":0.0003214473,"threshold_uncertainty_score":0.019858181},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3108851,0.0010805371,0.5331078,0.0012840669,0.0007748343,0.00014867018,0.0004615795,0.0006160533,0.15164131],"genre_scores_gemma":[0.9007228,0.0006269223,0.065549985,0.00042207103,0.0007034541,0.00017739485,0.00033301496,0.00014451756,0.031319883],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988896,0.0002363164,0.00007916303,0.00022994874,0.00042502643,0.00013999923],"domain_scores_gemma":[0.99760073,0.0008411875,0.0003394691,0.0002550834,0.0006109599,0.0003525269],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010729388,0.000535474,0.00034099666,0.0011554732,0.0012892706,0.0021080703,0.00057286315,0.0005586857,0.0075987717],"category_scores_gemma":[0.0027608974,0.00040746143,0.0008264364,0.0004378072,0.0018010827,0.0025427793,0.0016656598,0.0011243428,0.0018726384],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022055745,0.000020374277,0.0001516447,0.00003860979,0.0000057772663,0.00012366992,0.00036682884,0.0003309847,0.0045755845,0.9900476,0.0005522346,0.0037644785],"study_design_scores_gemma":[0.000026722419,0.000109553024,0.00032462398,0.000021223772,0.000013855266,0.00044648067,0.00021931816,0.006498161,0.0060929116,0.9759344,0.010289219,0.000023539309],"about_ca_topic_score_codex":0.00023367773,"about_ca_topic_score_gemma":0.00027664093,"teacher_disagreement_score":0.0075987717,"about_ca_system_score_codex":0.0003848473,"about_ca_system_score_gemma":0.00036844562,"threshold_uncertainty_score":0.025420368},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.58455735,0.0034706863,0.29043162,0.006895734,0.00042192466,0.00008656053,0.00032880125,0.00040985062,0.11339736],"genre_scores_gemma":[0.9765132,0.00056622113,0.015653627,0.0003830166,0.0001157426,0.000052782118,0.000042110878,0.000050736737,0.0066224793],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988972,0.00039543214,0.0000468074,0.00022663234,0.00025168396,0.00018224092],"domain_scores_gemma":[0.9929838,0.0046362723,0.00068869756,0.0008205525,0.00031397401,0.00055675075],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025910719,0.00033090205,0.00080912764,0.0009971524,0.0016422418,0.0024161106,0.0012103538,0.001632513,0.0053933803],"category_scores_gemma":[0.013179911,0.0003232241,0.0007725496,0.0010421294,0.0036909254,0.004978385,0.0016962942,0.002622174,0.0005006257],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003333645,0.0000109518405,0.00016618229,0.000024144849,0.000005515598,0.00008093835,0.00010236006,0.0032471288,0.0008032151,0.9929997,0.00049181585,0.0020346607],"study_design_scores_gemma":[0.000009862486,0.00001100857,0.00013946714,0.0000067725914,0.0000035527746,0.000078438,0.000034478362,0.014228355,0.00029129107,0.9842461,0.0009396654,0.000011031586],"about_ca_topic_score_codex":0.00090241444,"about_ca_topic_score_gemma":0.0007474878,"teacher_disagreement_score":0.0053933803,"about_ca_system_score_codex":0.0014444271,"about_ca_system_score_gemma":0.000911894,"threshold_uncertainty_score":0.018042684},"labels":[],"label_agreement":null},{"id":"W24921706","doi":"10.13001/1081-3810.1120","title":"On two conjectures regarding an inverse eigenvalue problem for acyclic symmetric matrices","year":2004,"lang":"en","type":"article","venue":"Electronic Journal of Linear Algebra","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":43,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Eigenvalues and eigenvectors; Combinatorics; Inverse; Multiplicity (mathematics); Graph; Symmetric matrix; Discrete mathematics; Mathematical analysis","score_opus":0.011138583638077884,"score_gpt":0.27106278956923513,"score_spread":0.2599242059311572,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W24921706","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15592475,0.0019678664,0.67151535,0.04404648,0.0025546174,0.00026577743,0.0012089459,0.0007231334,0.12179314],"genre_scores_gemma":[0.75061697,0.0022054324,0.18389532,0.012275443,0.007003955,0.00076757383,0.0029215547,0.00055335,0.03976029],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9949067,0.0016912661,0.00031264903,0.0014834855,0.0009353875,0.0006704801],"domain_scores_gemma":[0.9503417,0.03524129,0.0034816642,0.005361381,0.00315606,0.0024180578],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0073183607,0.0011204302,0.001394302,0.0023343496,0.003055319,0.005553247,0.0032678328,0.0062347827,0.018889772],"category_scores_gemma":[0.044987883,0.0008597428,0.0016592845,0.0023279993,0.010058041,0.016076853,0.004689034,0.0061298828,0.0025202073],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027221307,0.00014936941,0.0009711291,0.0001523913,0.000015977532,0.00017813087,0.000575749,0.003601599,0.00055698055,0.9691526,0.012867016,0.011506764],"study_design_scores_gemma":[0.000028628076,0.000037022335,0.00022306574,0.0000292708,0.000005883403,0.00010705843,0.00018333984,0.0068899277,0.00031449422,0.9897569,0.0024051226,0.000019386138],"about_ca_topic_score_codex":0.00068672455,"about_ca_topic_score_gemma":0.0006748555,"teacher_disagreement_score":0.018889772,"about_ca_system_score_codex":0.0015108616,"about_ca_system_score_gemma":0.0011317208,"threshold_uncertainty_score":0.063192606},"labels":[],"label_agreement":null},{"id":"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04093516,0.005505283,0.8680517,0.0018927911,0.0006785975,0.00012336724,0.00036852682,0.00030732353,0.08213727],"genre_scores_gemma":[0.64014417,0.00940348,0.31149018,0.0014483249,0.0030349651,0.0005473419,0.0006996912,0.00078681076,0.03244507],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997015,0.0005805387,0.00020460616,0.0007226006,0.0010319438,0.00044548055],"domain_scores_gemma":[0.9877082,0.006478465,0.0010767092,0.0018915947,0.002180522,0.0006645659],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004820007,0.0025825729,0.0013953655,0.0048289653,0.0016992149,0.0035536657,0.0022370387,0.0014671282,0.009814348],"category_scores_gemma":[0.026097827,0.0008594717,0.0020995561,0.0031865523,0.00409383,0.014130017,0.0046300236,0.0071716984,0.0031351456],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000117773445,0.000035506706,0.00043729364,0.0001626843,0.000027363112,0.00021054156,0.00031829174,0.007940492,0.005262345,0.9513641,0.0034890447,0.030634694],"study_design_scores_gemma":[0.000009076598,0.00007609657,0.0004825722,0.000084371444,0.000027149037,0.00028835234,0.0000692778,0.03408714,0.0049412427,0.9488119,0.011061274,0.00006161125],"about_ca_topic_score_codex":0.00095260056,"about_ca_topic_score_gemma":0.0011073722,"teacher_disagreement_score":0.009814348,"about_ca_system_score_codex":0.0020453678,"about_ca_system_score_gemma":0.001121107,"threshold_uncertainty_score":0.032832265},"labels":[],"label_agreement":null},{"id":"W2533396634","doi":"10.13001/1081-3810.3109","title":"Numerical Range for the Matrix Exponential Function","year":2016,"lang":"en","type":"article","venue":"Electronic Journal of Linear Algebra","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Mathematics; Numerical range; Matrix function; Matrix exponential; Matrix (chemical analysis); Range (aeronautics); Function (biology); Exponential function; Pure mathematics; Mathematical analysis; Applied mathematics; Eigenvalues and eigenvectors; Symmetric matrix; Differential equation","score_opus":0.0085252060231517,"score_gpt":0.24774125764244567,"score_spread":0.23921605161929396,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2533396634","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.106170185,0.0028985143,0.7474285,0.0019078145,0.0003583313,0.000048060523,0.00014947717,0.0006976262,0.14034152],"genre_scores_gemma":[0.9354853,0.0009033096,0.052017376,0.00030715,0.0002988327,0.00009759248,0.0001336966,0.00024862666,0.010508026],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99890625,0.00033239857,0.000056361918,0.00013967202,0.0004709316,0.00009442258],"domain_scores_gemma":[0.996438,0.0021229857,0.00024240508,0.00036064864,0.00061103224,0.00022486338],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018666951,0.00061485654,0.00031844949,0.0014048564,0.0007018242,0.0020771935,0.0008957599,0.0009668087,0.006391754],"category_scores_gemma":[0.01176228,0.00023725268,0.0003499645,0.00059065357,0.0021876197,0.0037529955,0.0020759285,0.0017931106,0.0014625333],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000893533,0.000021611315,0.00034592353,0.00011714898,0.0000075038115,0.00012519443,0.000121542274,0.016136555,0.008494337,0.96066844,0.0011382175,0.012734133],"study_design_scores_gemma":[0.000016537666,0.00006830495,0.0003708383,0.000103892795,0.000009629295,0.0005759557,0.00007330911,0.19447687,0.010346092,0.78688365,0.0070287506,0.000046164096],"about_ca_topic_score_codex":0.00022613685,"about_ca_topic_score_gemma":0.00016974514,"teacher_disagreement_score":0.006391754,"about_ca_system_score_codex":0.0007249639,"about_ca_system_score_gemma":0.0004393987,"threshold_uncertainty_score":0.02138257},"labels":[],"label_agreement":null},{"id":"W2599943070","doi":"10.13001/1081-3810.3249","title":"The Enhanced Principal Rank Characteristic Sequence for Hermitian Matrices","year":2017,"lang":"en","type":"article","venue":"Electronic Journal of Linear Algebra","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Hermitian matrix; Mathematics; Rank (graph theory); Combinatorics; Sequence (biology); Matrix (chemical analysis); Symmetric matrix; Matrix analysis; Pure mathematics; Eigenvalues and eigenvectors; Physics; Quantum mechanics; Chemistry","score_opus":0.015516357366676262,"score_gpt":0.28922071721186376,"score_spread":0.2737043598451875,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2599943070","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31265777,0.00085319293,0.6314039,0.0010034785,0.00020543212,0.0001438598,0.00075543165,0.0004436153,0.05253335],"genre_scores_gemma":[0.88913244,0.00065664283,0.09708834,0.00034861665,0.0002785783,0.00016429365,0.0006075386,0.000086283406,0.011637374],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998961,0.00027963988,0.000057101748,0.0002251019,0.00030356474,0.00017351829],"domain_scores_gemma":[0.9958205,0.0015970747,0.00077035103,0.00058845954,0.00081835553,0.00040516426],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010461207,0.0004837771,0.0003508165,0.0012605126,0.00056981744,0.0012797919,0.0005639467,0.00067924935,0.0055838823],"category_scores_gemma":[0.006678117,0.00020475098,0.00031100077,0.0009014515,0.0017886882,0.0027726856,0.0010634399,0.0013077823,0.0013595639],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013221394,0.000033850556,0.00076799194,0.00009775834,0.000008088965,0.00019161415,0.00021870357,0.008875789,0.0073660114,0.9559056,0.0018727934,0.024529504],"study_design_scores_gemma":[0.000022690567,0.00015929563,0.00053163833,0.000029937213,0.0000055089095,0.00044929856,0.00008266451,0.046369515,0.00494228,0.9417762,0.0055861,0.00004477497],"about_ca_topic_score_codex":0.00033668565,"about_ca_topic_score_gemma":0.00035350918,"teacher_disagreement_score":0.0055838823,"about_ca_system_score_codex":0.0005069463,"about_ca_system_score_gemma":0.0007926022,"threshold_uncertainty_score":0.018679976},"labels":[],"label_agreement":null},{"id":"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8461228,0.00015816458,0.12827234,0.00010229379,0.00006580523,0.000065453154,0.00029457564,0.00031428816,0.02460425],"genre_scores_gemma":[0.97066295,0.000107070446,0.022782663,0.000058613285,0.000051123654,0.0000757847,0.00035778314,0.00010164409,0.005802364],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99945194,0.00006785407,0.000054767002,0.000099871424,0.00014901448,0.00017650299],"domain_scores_gemma":[0.99758255,0.0005178858,0.0005350715,0.00043255585,0.00041237942,0.0005195642],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036783877,0.0003242123,0.00041639185,0.0013221275,0.00058419147,0.0011419964,0.00047675532,0.00049232756,0.005951543],"category_scores_gemma":[0.003002528,0.00032746408,0.00054541306,0.0006038791,0.001296279,0.001464559,0.0011005008,0.0006593032,0.00074795913],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005316209,0.00013449651,0.009908198,0.00020384682,0.00004126993,0.0015827226,0.0010667352,0.026318252,0.10563469,0.8017182,0.003266293,0.04959374],"study_design_scores_gemma":[0.00013629794,0.00048037537,0.01502162,0.000071082366,0.000054658303,0.0015960159,0.0005571283,0.18649364,0.027566375,0.7546776,0.013203423,0.00014177624],"about_ca_topic_score_codex":0.0006904934,"about_ca_topic_score_gemma":0.0010730297,"teacher_disagreement_score":0.005951543,"about_ca_system_score_codex":0.0003497277,"about_ca_system_score_gemma":0.00047846689,"threshold_uncertainty_score":0.019909918},"labels":[],"label_agreement":null},{"id":"W2750797687","doi":"10.13001/1081-3810.3400","title":"A new kind of companion matrix","year":2017,"lang":"en","type":"article","venue":"Electronic Journal of Linear Algebra","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Mandelbrot set; Mathematics; Matrix (chemical analysis); Pure mathematics; Companion matrix; Combinatorics; Algebra over a field; Discrete mathematics; Polynomial matrix; Polynomial; Matrix polynomial; Mathematical analysis","score_opus":0.010201391416485068,"score_gpt":0.2765194685385296,"score_spread":0.2663180771220445,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2750797687","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.038166743,0.00035774749,0.9309425,0.0005208706,0.0006808695,0.000101239675,0.00023348152,0.00071760075,0.02827888],"genre_scores_gemma":[0.5344569,0.0007872033,0.424036,0.0011502556,0.0009097141,0.00025545334,0.00070111564,0.0006346329,0.037068736],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991062,0.00016070981,0.000043378186,0.00022847245,0.00035732202,0.00010387077],"domain_scores_gemma":[0.99875,0.00023627479,0.000121644836,0.00029652915,0.0003892386,0.00020629412],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061371835,0.00061858306,0.0005974407,0.0011070158,0.0009723248,0.0013811686,0.00080036453,0.00088992866,0.008303966],"category_scores_gemma":[0.0031972528,0.00035858652,0.0006412865,0.0010203122,0.0014482733,0.0026884573,0.0018975349,0.0018623157,0.0018755257],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010856293,0.000048140704,0.00047529535,0.00010009396,0.000018272953,0.00031960482,0.0002659768,0.0039470745,0.01831052,0.91714853,0.005145946,0.054112054],"study_design_scores_gemma":[0.000059049493,0.00044878534,0.000754535,0.000048019814,0.00003204122,0.0022455107,0.00015714878,0.10733696,0.023851575,0.7681849,0.09676682,0.00011466404],"about_ca_topic_score_codex":0.0003294927,"about_ca_topic_score_gemma":0.00041526472,"teacher_disagreement_score":0.008303966,"about_ca_system_score_codex":0.00049002527,"about_ca_system_score_gemma":0.0007574452,"threshold_uncertainty_score":0.02777952},"labels":[],"label_agreement":null},{"id":"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6446831,0.0014003933,0.31412402,0.0006081694,0.00011942696,0.000058384063,0.0012294829,0.00072401273,0.03705297],"genre_scores_gemma":[0.9696256,0.0004660189,0.02287104,0.00008343625,0.00013666949,0.000038966442,0.0006658207,0.00010961872,0.0060028657],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999212,0.00016503496,0.000027670345,0.00016752379,0.00024769863,0.00018015494],"domain_scores_gemma":[0.9972389,0.0011027836,0.00048872764,0.0002673222,0.00051998,0.00038227756],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00062860816,0.00047875842,0.00052535394,0.0017974004,0.0008892654,0.0019194375,0.0006003802,0.00056800473,0.0068721264],"category_scores_gemma":[0.0052454257,0.00030302195,0.000435718,0.0010468315,0.0011015771,0.001883478,0.0008359266,0.0010529571,0.0010194465],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00040534444,0.00005995235,0.0034227618,0.00021996287,0.000061004048,0.00039437713,0.0004568463,0.063035265,0.03997046,0.84363467,0.0056974445,0.04264193],"study_design_scores_gemma":[0.00002323812,0.00015674734,0.002888092,0.000036543846,0.0000289574,0.00054042385,0.00018752739,0.31196025,0.011078867,0.66554886,0.0074738655,0.000076560515],"about_ca_topic_score_codex":0.0007673213,"about_ca_topic_score_gemma":0.00069190474,"teacher_disagreement_score":0.0068721264,"about_ca_system_score_codex":0.00052856654,"about_ca_system_score_gemma":0.00042231925,"threshold_uncertainty_score":0.022989511},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7639461,0.00036079765,0.14064908,0.00039037614,0.00014049669,0.000071121394,0.00030322434,0.00042566773,0.093713164],"genre_scores_gemma":[0.9695579,0.00017210809,0.020968877,0.00009374558,0.00007294092,0.00011072517,0.00025584377,0.00009365183,0.008674267],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995061,0.00007229588,0.000050389524,0.00011132953,0.00012234437,0.00013749447],"domain_scores_gemma":[0.9986362,0.00047195287,0.00021232208,0.00024191584,0.00016304314,0.0002744156],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003074419,0.0003793582,0.00040259364,0.0018201283,0.0013065521,0.0019393814,0.0005493166,0.0006010377,0.0058777635],"category_scores_gemma":[0.0018374886,0.0003858583,0.00065258914,0.00053509435,0.0017442427,0.0017792619,0.0015151737,0.000880475,0.00063502026],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007392675,0.0000339706,0.0007673224,0.000043845706,0.00000922924,0.0003071938,0.0003327197,0.002760475,0.009906517,0.9758966,0.0007380246,0.0091300765],"study_design_scores_gemma":[0.00003902649,0.00008279071,0.0015784536,0.00004525991,0.000021483853,0.000446747,0.00026562167,0.036430486,0.007043985,0.9475055,0.006495003,0.000045621455],"about_ca_topic_score_codex":0.00063574937,"about_ca_topic_score_gemma":0.0008334304,"teacher_disagreement_score":0.0058777635,"about_ca_system_score_codex":0.00059439044,"about_ca_system_score_gemma":0.00042393422,"threshold_uncertainty_score":0.019663095},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8755585,0.00067111925,0.046609,0.00058228057,0.00006713496,0.000035804973,0.00060444704,0.00014640682,0.07572526],"genre_scores_gemma":[0.9763106,0.0004004037,0.013952045,0.00015131937,0.00007184506,0.00005022693,0.00058120076,0.000047249483,0.008435112],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996722,0.00005669296,0.000013946306,0.00011921397,0.00008165873,0.000056343473],"domain_scores_gemma":[0.99935156,0.00021904873,0.00011638517,0.000048140835,0.000119240874,0.00014557112],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001973195,0.0003734113,0.0002732351,0.0020921445,0.0012501184,0.001454774,0.00039336327,0.00046749692,0.0045136604],"category_scores_gemma":[0.0010164164,0.0002399443,0.00033934726,0.00089080416,0.0013919292,0.0012116735,0.0009953271,0.0006568753,0.00044492036],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000075449454,0.000021929045,0.0011409109,0.000041393232,0.0000095491505,0.00016472246,0.00030504508,0.0013920896,0.0043102084,0.9829606,0.0011817769,0.008396383],"study_design_scores_gemma":[0.000037578047,0.000040308172,0.002407196,0.000031074756,0.000020352189,0.0005144264,0.00044314392,0.013551697,0.0033807333,0.9688815,0.0106629,0.000029145074],"about_ca_topic_score_codex":0.0014646427,"about_ca_topic_score_gemma":0.0014328607,"teacher_disagreement_score":0.0045136604,"about_ca_system_score_codex":0.00101122,"about_ca_system_score_gemma":0.00038977028,"threshold_uncertainty_score":0.015099645},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5045397,0.0019272992,0.41739315,0.00061174104,0.00029122713,0.00006415948,0.00032280636,0.00019538049,0.07465441],"genre_scores_gemma":[0.9371692,0.0011827954,0.04927671,0.00026340617,0.00031783365,0.00009501051,0.0003708368,0.00008034422,0.011243755],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99918777,0.00023924821,0.00003528595,0.00018075375,0.0001812362,0.00017573337],"domain_scores_gemma":[0.99846834,0.0005950578,0.00033551783,0.00017842533,0.00023876675,0.0001838851],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005761758,0.0007203896,0.00037848487,0.0012535899,0.0010137289,0.0010140892,0.0004337307,0.00062131375,0.0039289],"category_scores_gemma":[0.003287172,0.00028791607,0.00036033677,0.0009316861,0.0019011525,0.0017238747,0.0012214757,0.00080334535,0.000689376],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000057508107,0.000025077232,0.0004210552,0.000055978755,0.000007518271,0.00015474843,0.00015182568,0.006811617,0.0041707293,0.975749,0.0012268403,0.011168041],"study_design_scores_gemma":[0.000020206475,0.00007338152,0.0005115452,0.000039431612,0.0000067935803,0.0002927958,0.00013722121,0.053912193,0.002488266,0.9369588,0.0055321907,0.000027225735],"about_ca_topic_score_codex":0.0009377898,"about_ca_topic_score_gemma":0.0011554341,"teacher_disagreement_score":0.0039289,"about_ca_system_score_codex":0.00053938525,"about_ca_system_score_gemma":0.00041579848,"threshold_uncertainty_score":0.01314348},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43090025,0.00063038996,0.47775796,0.0006882755,0.00017834733,0.0001458957,0.0005497305,0.0002995196,0.0888497],"genre_scores_gemma":[0.9570538,0.00025962843,0.035634216,0.00020403127,0.00011428724,0.000091835704,0.00028818223,0.000047439393,0.00630656],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99900144,0.0002159679,0.00004989024,0.00024089399,0.00033385993,0.00015798635],"domain_scores_gemma":[0.998691,0.0004005475,0.00028922228,0.00024229764,0.00020065143,0.00017639401],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006385551,0.0004544571,0.00029692877,0.0009267463,0.00076004566,0.0014271847,0.0005837885,0.000607803,0.0040371977],"category_scores_gemma":[0.0023106786,0.00026740352,0.00041571108,0.00068701355,0.0030346294,0.0020535453,0.0017734836,0.0014854182,0.0005163276],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003150269,0.000019998086,0.00038430066,0.000024524401,0.000006147646,0.00018807751,0.00009975375,0.0023236882,0.0039856723,0.98559266,0.0006142518,0.0067294207],"study_design_scores_gemma":[0.000014649642,0.0000869475,0.00060757314,0.00001641485,0.0000091975135,0.00062985375,0.00015504207,0.032227106,0.00505237,0.9567803,0.0043898327,0.000030765197],"about_ca_topic_score_codex":0.00035713386,"about_ca_topic_score_gemma":0.0003268755,"teacher_disagreement_score":0.0040371977,"about_ca_system_score_codex":0.0004623087,"about_ca_system_score_gemma":0.0006369702,"threshold_uncertainty_score":0.013505757},"labels":[],"label_agreement":null},{"id":"W2953398301","doi":"10.13001/1081-3810.3839","title":"Non-sparse Companion Matrices","year":2019,"lang":"en","type":"article","venue":"Electronic Journal of Linear Algebra","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Redeemer University; University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; Universities Space Research Association","keywords":"Companion matrix; Mathematics; Matrix (chemical analysis); Simple (philosophy); Integer matrix; Realization (probability); Matrix analysis; Combinatorics; Polynomial; Polynomial matrix; Discrete mathematics; Matrix polynomial; Algebra over a field; Pure mathematics; Symmetric matrix; Nonnegative matrix; Eigenvalues and eigenvectors; Mathematical analysis","score_opus":0.006020204244693108,"score_gpt":0.23034148273373148,"score_spread":0.22432127848903838,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2953398301","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1423262,0.00044149873,0.82763314,0.00047560403,0.00014221334,0.00009983521,0.00035637798,0.00069223775,0.027832868],"genre_scores_gemma":[0.82093245,0.00046570232,0.15868197,0.00025863198,0.00018706592,0.00012119942,0.0008468643,0.00019438741,0.018311674],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992519,0.00015085733,0.000044256318,0.00018379348,0.0002605932,0.00010849485],"domain_scores_gemma":[0.99734724,0.0008713775,0.00038678755,0.00068481546,0.0004993455,0.00021040028],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054635404,0.0006507207,0.00048766672,0.00057682063,0.0006162787,0.00096204254,0.0006661907,0.00073590444,0.0076052686],"category_scores_gemma":[0.005501896,0.00032849438,0.0003305483,0.0005303457,0.0010235669,0.0021789705,0.0012429287,0.0013089298,0.0019166898],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018301286,0.00006639016,0.0007891034,0.00020285013,0.000019131072,0.00057220575,0.00036790204,0.021197556,0.028053476,0.8846432,0.0059012324,0.05800381],"study_design_scores_gemma":[0.000038409136,0.0002109145,0.00083352136,0.000035822562,0.000015346706,0.0011778144,0.00019783787,0.1503706,0.017440211,0.80757904,0.022048054,0.000052458527],"about_ca_topic_score_codex":0.00026243116,"about_ca_topic_score_gemma":0.00047564344,"teacher_disagreement_score":0.0076052686,"about_ca_system_score_codex":0.0003811814,"about_ca_system_score_gemma":0.0005135992,"threshold_uncertainty_score":0.025442123},"labels":[],"label_agreement":null},{"id":"W2962704689","doi":"10.13001/1081-3810.3436","title":"Refined Inertia of Matrix Patterns","year":2017,"lang":"en","type":"article","venue":"Electronic Journal of Linear Algebra","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Redeemer University","funders":"","keywords":"Digraph; Mathematics; Eigenvalues and eigenvectors; Matrix (chemical analysis); Class (philosophy); Order (exchange); Property (philosophy); Combinatorics; Inertia; Matrix analysis; Pure mathematics; Computer science; Physics; Classical mechanics; Artificial intelligence","score_opus":0.009638604857215034,"score_gpt":0.27288219778819467,"score_spread":0.26324359293097965,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2962704689","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.71849626,0.00016698717,0.25416264,0.00015260167,0.00007400138,0.00005410454,0.00012444002,0.00030247305,0.026466452],"genre_scores_gemma":[0.9686309,0.000102774255,0.024266075,0.000060722745,0.000053110456,0.000047473208,0.00013620466,0.00009865734,0.006604221],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994974,0.0000792334,0.000036549296,0.00011080679,0.00013776982,0.00013816654],"domain_scores_gemma":[0.9985864,0.0003319355,0.0002883468,0.00039345078,0.00021227992,0.00018768203],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033984258,0.0003425293,0.00036348196,0.000704262,0.0006224897,0.0009071261,0.00048614418,0.00044542283,0.006261135],"category_scores_gemma":[0.002830653,0.0003104672,0.00043063387,0.00040410206,0.0016929319,0.0021848413,0.0012854408,0.00071129476,0.00070867693],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002089991,0.000047736983,0.0034213408,0.00009479094,0.00001750669,0.00055317837,0.00074054266,0.019237846,0.033567447,0.9124247,0.0012163938,0.028469468],"study_design_scores_gemma":[0.000055471774,0.0002888045,0.0040971977,0.000040005343,0.000023295619,0.0007023122,0.000406465,0.117227405,0.013944328,0.8524404,0.010704699,0.00006957654],"about_ca_topic_score_codex":0.0005562073,"about_ca_topic_score_gemma":0.00076934317,"teacher_disagreement_score":0.006261135,"about_ca_system_score_codex":0.00028054137,"about_ca_system_score_gemma":0.0002881061,"threshold_uncertainty_score":0.020945609},"labels":[],"label_agreement":null},{"id":"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45161155,0.003426754,0.4486645,0.0037748814,0.00035957067,0.00007866365,0.001070618,0.0007338558,0.09027956],"genre_scores_gemma":[0.96799254,0.0010220913,0.021220686,0.00043796524,0.00033868937,0.0001002532,0.00054873194,0.0001477922,0.008191305],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989901,0.00019665998,0.00004923401,0.00026223666,0.00026941826,0.00023236872],"domain_scores_gemma":[0.9893387,0.0071219266,0.00077297457,0.0006055251,0.00075708836,0.0014038283],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009367928,0.0008164249,0.0009020018,0.002333712,0.0014711273,0.002881515,0.00129949,0.0012418714,0.0099083865],"category_scores_gemma":[0.010521245,0.0004925336,0.0005584323,0.0012194094,0.002673755,0.0048719095,0.0024998588,0.002594858,0.0011973623],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013980601,0.00006087709,0.0009465421,0.00013097837,0.00002538444,0.00014560364,0.0003087713,0.014856884,0.003625305,0.9647229,0.0037442856,0.011292748],"study_design_scores_gemma":[0.00001453357,0.00002621512,0.0003865899,0.000037323996,0.000010503368,0.00011718567,0.00009312353,0.05192383,0.00074914977,0.9443131,0.002309591,0.000018821924],"about_ca_topic_score_codex":0.00080444384,"about_ca_topic_score_gemma":0.001032266,"teacher_disagreement_score":0.0099083865,"about_ca_system_score_codex":0.0019200761,"about_ca_system_score_gemma":0.0005667874,"threshold_uncertainty_score":0.0331468},"labels":[],"label_agreement":null},{"id":"W2964220986","doi":"10.13001/ela.2021.4975","title":"Generalized Standard Triples for Algebraic Linearizations of Matrix Polynomials","year":2021,"lang":"en","type":"preprint","venue":"Electronic Journal of Linear Algebra","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"Universidad de Alcalá","keywords":"Combinatorics; Mathematics; Polynomial; Order (exchange); Matrix (chemical analysis); Eigenvalues and eigenvectors; Physics; Mathematical analysis; Quantum mechanics","score_opus":0.014153262761410266,"score_gpt":0.288571903447922,"score_spread":0.27441864068651173,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2964220986","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1704246,0.0005614112,0.6036086,0.0010179115,0.0009382334,0.00024167883,0.00088451186,0.0020900576,0.22023307],"genre_scores_gemma":[0.84444594,0.0005316554,0.09404041,0.00093513576,0.00047594824,0.00035770153,0.0009993477,0.00088556844,0.057328306],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99926955,0.00014788269,0.000038913575,0.00013879211,0.00023028138,0.00017456093],"domain_scores_gemma":[0.99953496,0.00005944398,0.00006876197,0.00007923706,0.00019071662,0.000066835106],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005278187,0.00085527054,0.00043284948,0.0014774399,0.001339454,0.001797249,0.0008856627,0.0005618848,0.015421916],"category_scores_gemma":[0.0012035089,0.0003596554,0.0008782056,0.00090617756,0.0020506168,0.0020264005,0.0014261691,0.0015168216,0.0050340975],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024292242,0.000018719049,0.000086657594,0.00004156719,0.0000084104395,0.000106194755,0.00021997077,0.0015034252,0.0021963213,0.9811918,0.002794474,0.011808169],"study_design_scores_gemma":[0.00002077552,0.00006556704,0.00021053749,0.000031811942,0.000010257515,0.00022207056,0.00028799305,0.012148439,0.0040514707,0.96150476,0.021383097,0.00006322893],"about_ca_topic_score_codex":0.0015082777,"about_ca_topic_score_gemma":0.0016843998,"teacher_disagreement_score":0.015421916,"about_ca_system_score_codex":0.0011515559,"about_ca_system_score_gemma":0.0007610309,"threshold_uncertainty_score":0.051591456},"labels":[],"label_agreement":null},{"id":"W2972815894","doi":"10.13001/1081-3810.3950","title":"Consistency of Quaternion Matrix Equations $AX^{\\star}-XB=C$ and $X-AX^\\star B=C$","year":2019,"lang":"en","type":"article","venue":"Electronic Journal of Linear Algebra","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Transpose; Star (game theory); Quaternion; Mathematics; Uniqueness; Matrix (chemical analysis); Complex conjugate; Positive-definite matrix; Hermitian matrix; Pure mathematics; Combinatorics; Mathematical analysis; Physics; Geometry; Eigenvalues and eigenvectors; Quantum mechanics","score_opus":0.007281889495071087,"score_gpt":0.2452739567139639,"score_spread":0.23799206721889282,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2972815894","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12367094,0.00088503317,0.8195805,0.0016463313,0.00078283064,0.00015861046,0.0005547685,0.00031542496,0.052405566],"genre_scores_gemma":[0.7942553,0.0008599408,0.17481844,0.00081416,0.00038070494,0.00038038794,0.0012566055,0.00040707883,0.0268274],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981523,0.0006262187,0.00012465281,0.00041169106,0.0005102657,0.00017486469],"domain_scores_gemma":[0.99750024,0.00092178927,0.0004925902,0.00024163444,0.00071996794,0.00012367459],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020854215,0.00057673623,0.0006934623,0.0009587572,0.0009821769,0.002625361,0.0013273269,0.0012920481,0.007270552],"category_scores_gemma":[0.008830645,0.00047837658,0.0009234085,0.0009578217,0.0025159004,0.0029113505,0.0015504395,0.0017671696,0.0017626808],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006526906,0.000030243707,0.0008733186,0.00010794164,0.000028846503,0.00016544588,0.00035335537,0.0077551287,0.003430725,0.9683546,0.003976843,0.014858307],"study_design_scores_gemma":[0.00006833378,0.000086132415,0.0007504114,0.000044898363,0.000019847044,0.00032140565,0.00025801398,0.11969791,0.004791372,0.8653587,0.008538319,0.000064542626],"about_ca_topic_score_codex":0.0013583053,"about_ca_topic_score_gemma":0.0009376026,"teacher_disagreement_score":0.007270552,"about_ca_system_score_codex":0.000586469,"about_ca_system_score_gemma":0.0013038849,"threshold_uncertainty_score":0.02432239},"labels":[],"label_agreement":null},{"id":"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.52630925,0.00081512507,0.32962438,0.0011110638,0.00063519855,0.00009959039,0.00038190302,0.0005247587,0.14049874],"genre_scores_gemma":[0.95468986,0.00024214109,0.017896205,0.00020516332,0.0004205545,0.000041531508,0.00017647298,0.00006858544,0.026259426],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994265,0.000084350235,0.000018903289,0.00014768253,0.00019956744,0.00012300951],"domain_scores_gemma":[0.99926406,0.00013135839,0.00016681476,0.00009384136,0.0001762241,0.00016780786],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032200027,0.0004034925,0.00028707733,0.00096924254,0.00067404495,0.0014761855,0.00037833015,0.00037416889,0.0055131996],"category_scores_gemma":[0.0015796113,0.00016990335,0.00033922496,0.0004533901,0.0018270002,0.0016519821,0.0010005111,0.0008370397,0.0008814432],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022857466,0.000010357125,0.00016987546,0.000015093907,0.0000029450684,0.000068075526,0.00011824459,0.00074751984,0.0026299276,0.9899164,0.0006531516,0.005645485],"study_design_scores_gemma":[0.000021197213,0.00009423217,0.0010361255,0.000014883198,0.000008641142,0.00057240203,0.00014657536,0.02059971,0.0060755047,0.95451957,0.016873458,0.00003769863],"about_ca_topic_score_codex":0.0005399748,"about_ca_topic_score_gemma":0.0004311302,"teacher_disagreement_score":0.0055131996,"about_ca_system_score_codex":0.00061484834,"about_ca_system_score_gemma":0.00045345834,"threshold_uncertainty_score":0.018443465},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32735652,0.0006594307,0.3921108,0.0042719804,0.0008927621,0.00032159747,0.0026640475,0.0005300648,0.27119276],"genre_scores_gemma":[0.87237316,0.0007445502,0.07672884,0.0016348199,0.00019729491,0.000277847,0.0038115482,0.00033533355,0.04389659],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99929905,0.000106875304,0.000034814762,0.0002481141,0.0001848636,0.00012623626],"domain_scores_gemma":[0.9980439,0.00060214225,0.00029336652,0.00037384508,0.00049571885,0.00019089524],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031012463,0.0004365316,0.0005965553,0.00044792602,0.0014341596,0.001151879,0.0006448554,0.0007177312,0.015412203],"category_scores_gemma":[0.002452448,0.00028952115,0.0005240898,0.0006642738,0.0015476944,0.0027186817,0.0010169549,0.0016828441,0.0016785805],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012360899,0.000034465465,0.00081456424,0.00017074822,0.00002332435,0.0005073208,0.00023441525,0.005021025,0.004478905,0.9537255,0.013537485,0.021328658],"study_design_scores_gemma":[0.00002910073,0.000079116806,0.0007561718,0.000035437766,0.00002055841,0.0012110402,0.00029669725,0.037255738,0.0026580305,0.9237124,0.033917323,0.000028484521],"about_ca_topic_score_codex":0.0038257607,"about_ca_topic_score_gemma":0.004194951,"teacher_disagreement_score":0.015412203,"about_ca_system_score_codex":0.00071047025,"about_ca_system_score_gemma":0.0007948531,"threshold_uncertainty_score":0.05155897},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.79055625,0.00018632639,0.1413896,0.00030343953,0.00013510272,0.00004570006,0.00010827003,0.00026415073,0.06701107],"genre_scores_gemma":[0.9829679,0.00010331441,0.010345787,0.000060053753,0.000041399147,0.00002551608,0.00010273531,0.0000940656,0.006259213],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994547,0.000074532,0.00003874258,0.00007663353,0.00024425564,0.00011115099],"domain_scores_gemma":[0.9991641,0.00017326648,0.00013112785,0.00019830084,0.00020559096,0.00012762194],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003125756,0.00024820192,0.00022406444,0.00075300224,0.0009417403,0.001115205,0.00034778353,0.00033440164,0.0050713923],"category_scores_gemma":[0.0020277482,0.00019549175,0.000301075,0.0004055299,0.0019368062,0.0016299464,0.00095019833,0.00081560726,0.0005844156],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000057671925,0.00002029648,0.0011933114,0.00004413004,0.0000045164043,0.00034478554,0.00034451703,0.0016522763,0.021435322,0.95961666,0.000625006,0.014661571],"study_design_scores_gemma":[0.000021804406,0.000086024695,0.0014332263,0.00002816527,0.000009448951,0.0011474122,0.0003295532,0.01964378,0.021739056,0.9463423,0.009176244,0.00004297612],"about_ca_topic_score_codex":0.0002493585,"about_ca_topic_score_gemma":0.00028816075,"teacher_disagreement_score":0.0050713923,"about_ca_system_score_codex":0.0002991742,"about_ca_system_score_gemma":0.0003086975,"threshold_uncertainty_score":0.016965508},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8073187,0.0007975482,0.1068192,0.000860451,0.00015733858,0.00007848835,0.00067684904,0.00032460495,0.08296676],"genre_scores_gemma":[0.97622925,0.00041683932,0.016262045,0.00012489708,0.000112364774,0.000056306213,0.00043695632,0.00012554003,0.006235776],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995908,0.00011281374,0.000013338796,0.00007900093,0.0000945972,0.000109441615],"domain_scores_gemma":[0.9988475,0.0004289993,0.00017508329,0.000090223875,0.00017110858,0.00028714217],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037409223,0.000501646,0.00037032127,0.0014646859,0.0010455966,0.0024207905,0.0005167309,0.0006266521,0.0049221977],"category_scores_gemma":[0.0026608482,0.0004201256,0.00030721657,0.0008392948,0.0014866841,0.0015843033,0.0009028432,0.00081816665,0.00065655273],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013047163,0.00003649004,0.0017261169,0.00006134954,0.000011132112,0.00008342845,0.00026021578,0.0064932615,0.0076159528,0.9663853,0.0031234485,0.014072827],"study_design_scores_gemma":[0.000021436372,0.000026962702,0.001131705,0.000027199347,0.000009834899,0.00012948566,0.00036259746,0.01709743,0.0029448855,0.97325146,0.0049808347,0.00001629534],"about_ca_topic_score_codex":0.0007123228,"about_ca_topic_score_gemma":0.0011345504,"teacher_disagreement_score":0.0049221977,"about_ca_system_score_codex":0.00080929307,"about_ca_system_score_gemma":0.00039718318,"threshold_uncertainty_score":0.016466439},"labels":[],"label_agreement":null},{"id":"W306917649","doi":"10.13001/1081-3810.3010","title":"Sparse spectrally arbitrary patterns","year":2015,"lang":"en","type":"article","venue":"Electronic Journal of Linear Algebra","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Redeemer University","funders":"","keywords":"Mathematics; Jacobian matrix and determinant; Monic polynomial; Matrix (chemical analysis); Order (exchange); Nilpotent matrix; Companion matrix; Zero (linguistics); Pure mathematics; Eigenvalues and eigenvectors; Polynomial; Combinatorics; Mathematical analysis; Polynomial matrix; Matrix polynomial; Applied mathematics; Symmetric matrix; Matrix function; Physics","score_opus":0.015614961687269835,"score_gpt":0.24412826624810127,"score_spread":0.22851330456083144,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W306917649","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7767829,0.00018528859,0.18049407,0.00054379576,0.0001248235,0.00008219983,0.00030773671,0.00044006604,0.041039113],"genre_scores_gemma":[0.96563685,0.00006947212,0.02663869,0.00013318747,0.00004188041,0.000043618482,0.00022797416,0.00009420864,0.0071141147],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996563,0.00006994522,0.000018426783,0.000069246526,0.00010183261,0.00008408898],"domain_scores_gemma":[0.99901223,0.00025558638,0.00017606126,0.00022617562,0.0001941747,0.00013589971],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002214563,0.00036966574,0.00034655826,0.00051673333,0.0006722673,0.0007321167,0.0005629213,0.00055529125,0.0065748366],"category_scores_gemma":[0.0025891303,0.00023005312,0.00026723582,0.00048413116,0.0010740669,0.0012427504,0.00083342526,0.00069913256,0.0007031045],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003628111,0.0001657374,0.0066066794,0.00019921213,0.000032557786,0.00174148,0.0006559862,0.02479983,0.05179305,0.86481965,0.0061440445,0.04267894],"study_design_scores_gemma":[0.00006742679,0.00021843113,0.003311043,0.00003501787,0.000018967517,0.0016402095,0.0006031019,0.18998976,0.019581407,0.7724463,0.012028432,0.00006005573],"about_ca_topic_score_codex":0.00053288514,"about_ca_topic_score_gemma":0.0010658335,"teacher_disagreement_score":0.0065748366,"about_ca_system_score_codex":0.00028203247,"about_ca_system_score_gemma":0.0003727935,"threshold_uncertainty_score":0.021995008},"labels":[],"label_agreement":null},{"id":"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8567441,0.00046783057,0.10159601,0.00051821617,0.00009078893,0.000121856385,0.0010550937,0.0003578491,0.0390482],"genre_scores_gemma":[0.98137295,0.0001357782,0.013836942,0.00009914534,0.0000679039,0.00011436398,0.0010488111,0.000067267036,0.0032568055],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983688,0.0002027457,0.00016621768,0.00052162167,0.0004426853,0.00029782765],"domain_scores_gemma":[0.9919932,0.003692583,0.001402186,0.0011415783,0.00081734906,0.000953116],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008670205,0.0003262441,0.0004532909,0.0021493174,0.0016469363,0.0035609773,0.0008213389,0.00082604587,0.0065724603],"category_scores_gemma":[0.0066923914,0.00042598328,0.0007779737,0.0013890736,0.0028339187,0.0042261216,0.0019065094,0.001421887,0.0005241675],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003310863,0.000111912435,0.026907159,0.00015332164,0.000060863837,0.0014636731,0.001778295,0.0024491164,0.011175395,0.91174406,0.0027874669,0.04103754],"study_design_scores_gemma":[0.00008321701,0.000120278564,0.019344363,0.0000677321,0.0000611891,0.0018790903,0.0013141122,0.019220902,0.006886027,0.93801165,0.012932645,0.00007873819],"about_ca_topic_score_codex":0.000980828,"about_ca_topic_score_gemma":0.0011218068,"teacher_disagreement_score":0.0065724603,"about_ca_system_score_codex":0.0008441145,"about_ca_system_score_gemma":0.00054325577,"threshold_uncertainty_score":0.02198708},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27463573,0.0112251425,0.3863774,0.015605356,0.0021316519,0.00009355358,0.00050462206,0.00031839276,0.30910823],"genre_scores_gemma":[0.94254243,0.003610714,0.028127633,0.0013333219,0.0017925389,0.000058030037,0.00018355403,0.00011555496,0.022236066],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999514,0.0001410791,0.000027507058,0.00007002262,0.00018390501,0.000063598556],"domain_scores_gemma":[0.99845934,0.0009217745,0.00015618223,0.00011168911,0.00019666275,0.00015444333],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014053817,0.0005590018,0.00055252685,0.0020316183,0.0014147203,0.0018969371,0.000809607,0.001046145,0.0051374296],"category_scores_gemma":[0.0034210356,0.00031916858,0.00059541245,0.0014529555,0.0036139952,0.0037804744,0.0016138393,0.0025188364,0.00040704],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000395348,0.0000044857366,0.00006536665,0.000014767603,0.0000018813615,0.000056193574,0.00005689849,0.0005379366,0.00028024934,0.9964993,0.0008962229,0.0015827136],"study_design_scores_gemma":[0.0000020886018,0.0000075123407,0.00014706142,0.0000064320584,0.000001439673,0.0000533946,0.00002974548,0.0026297604,0.00011766978,0.99534565,0.0016526135,0.0000067110154],"about_ca_topic_score_codex":0.0010283187,"about_ca_topic_score_gemma":0.00081439613,"teacher_disagreement_score":0.0051374296,"about_ca_system_score_codex":0.0015412471,"about_ca_system_score_gemma":0.00053545943,"threshold_uncertainty_score":0.017186463},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43090025,0.00063038996,0.47775796,0.0006882755,0.00017834733,0.0001458957,0.0005497305,0.0002995196,0.0888497],"genre_scores_gemma":[0.9570538,0.00025962843,0.035634216,0.00020403127,0.00011428724,0.000091835704,0.00028818223,0.000047439393,0.00630656],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99900144,0.0002159679,0.00004989024,0.00024089399,0.00033385993,0.00015798635],"domain_scores_gemma":[0.998691,0.0004005475,0.00028922228,0.00024229764,0.00020065143,0.00017639401],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006385551,0.0004544571,0.00029692877,0.0009267463,0.00076004566,0.0014271847,0.0005837885,0.000607803,0.0040371977],"category_scores_gemma":[0.0023106786,0.00026740352,0.00041571108,0.00068701355,0.0030346294,0.0020535453,0.0017734836,0.0014854182,0.0005163276],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003150269,0.000019998086,0.00038430066,0.000024524401,0.000006147646,0.00018807751,0.00009975375,0.0023236882,0.0039856723,0.98559266,0.0006142518,0.0067294207],"study_design_scores_gemma":[0.000014649642,0.0000869475,0.00060757314,0.00001641485,0.0000091975135,0.00062985375,0.00015504207,0.032227106,0.00505237,0.9567803,0.0043898327,0.000030765197],"about_ca_topic_score_codex":0.00035713386,"about_ca_topic_score_gemma":0.0003268755,"teacher_disagreement_score":0.0040371977,"about_ca_system_score_codex":0.0004623087,"about_ca_system_score_gemma":0.0006369702,"threshold_uncertainty_score":0.013505757},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21259226,0.0007595981,0.7450842,0.000874237,0.00012852822,0.00010813164,0.00039450297,0.00030516734,0.039753344],"genre_scores_gemma":[0.9310396,0.00080211984,0.055507597,0.0003277518,0.00022093602,0.00015074837,0.0003177261,0.00011271466,0.011520707],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99835795,0.0004443364,0.000074071184,0.0003230089,0.00043569558,0.00036492647],"domain_scores_gemma":[0.9946344,0.0026931937,0.0009514487,0.0004128475,0.00086426653,0.00044388525],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015778817,0.0008171316,0.00080961664,0.0013372641,0.00088861445,0.0016579484,0.0004915201,0.0010765202,0.0058283363],"category_scores_gemma":[0.009840416,0.000545568,0.0005286721,0.0010357483,0.0022950112,0.0028546657,0.0010756232,0.0012099681,0.001584105],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013258212,0.000035458368,0.0008842555,0.00012786902,0.000027865748,0.00049915386,0.00019291375,0.018809257,0.012802045,0.9494042,0.0023451822,0.014739252],"study_design_scores_gemma":[0.00007017371,0.00017775032,0.001488249,0.00006500228,0.000022644132,0.001148002,0.0001572912,0.15674041,0.009593906,0.8243306,0.0060949815,0.00011093616],"about_ca_topic_score_codex":0.0011813118,"about_ca_topic_score_gemma":0.0010790542,"teacher_disagreement_score":0.0058283363,"about_ca_system_score_codex":0.00056475867,"about_ca_system_score_gemma":0.0013293169,"threshold_uncertainty_score":0.019497752},"labels":[],"label_agreement":null},{"id":"W3136240306","doi":"10.13001/ela.2021.5361","title":"Spectral theory for self-adjoint quadratic eigenvalue problems - a review","year":2021,"lang":"en","type":"review","venue":"Electronic Journal of Linear Algebra","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada; European Regional Development Fund; Euskal Herriko Unibertsitatea; Ministerio de Ciencia, Innovación y Universidades","keywords":"Mathematics; Hermitian matrix; Eigenvalues and eigenvectors; Lambda; Canonical form; Polynomial; Pure mathematics; Matrix (chemical analysis); Combinatorics; Mathematical analysis; Quantum mechanics","score_opus":0.023936926911975073,"score_gpt":0.3078404321934674,"score_spread":0.28390350528149233,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3136240306","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016078257,0.95294935,0.015457349,0.0014665719,0.0011872042,0.000014432964,0.000063542604,0.000052567462,0.027201125],"genre_scores_gemma":[0.023711314,0.9573473,0.007756287,0.00096442783,0.0040799836,0.000046782836,0.00017147575,0.00007442272,0.0058480618],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9995957,0.00010273033,0.000031831838,0.000096675154,0.00013258513,0.000040469433],"domain_scores_gemma":[0.99939704,0.0003765034,0.00003843245,0.000038878617,0.0001114794,0.000037633898],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007446819,0.0010973759,0.0015110112,0.00238135,0.0008861013,0.0019849732,0.0015802875,0.0018662286,0.0046033366],"category_scores_gemma":[0.001121676,0.00061316206,0.0009021281,0.003104222,0.002209605,0.003373071,0.0014453413,0.0033925297,0.0033888542],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000050746734,0.0002404005,0.00048706622,0.010193245,0.000101336256,0.0002324657,0.0005091211,0.0044684457,0.0020981238,0.628678,0.04256599,0.31037506],"study_design_scores_gemma":[0.000012287376,0.00011717358,0.0010339123,0.0029976647,0.000044983306,0.0010957747,0.00028908154,0.004517076,0.0010682816,0.32932013,0.6594222,0.00008142108],"about_ca_topic_score_codex":0.00069598487,"about_ca_topic_score_gemma":0.00051831314,"teacher_disagreement_score":0.0046033366,"about_ca_system_score_codex":0.0012384475,"about_ca_system_score_gemma":0.0009878131,"threshold_uncertainty_score":0.015399635},"labels":[],"label_agreement":null},{"id":"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.089891605,0.004288212,0.48459646,0.01244172,0.0030182102,0.00005666586,0.0003811631,0.0004262246,0.40489972],"genre_scores_gemma":[0.92183113,0.0021894057,0.034718312,0.0028540385,0.0028234362,0.00006551795,0.0002649795,0.00023488603,0.035018276],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992415,0.00016570381,0.000025297082,0.00015297937,0.00026636018,0.00014831017],"domain_scores_gemma":[0.9981018,0.00075007934,0.00019678364,0.00021022938,0.0004429148,0.000298191],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013862171,0.0005702594,0.0006505613,0.0016876599,0.001451299,0.0018378035,0.00095949,0.0011046518,0.011014501],"category_scores_gemma":[0.0063427673,0.00019050248,0.00068347174,0.0010249629,0.0036011382,0.005133478,0.002699132,0.0027121878,0.0014464345],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008279552,0.0000050874273,0.00011226068,0.00002113127,0.0000035480557,0.000040768315,0.000032144697,0.0005207235,0.00042872623,0.9930696,0.001939685,0.0038180877],"study_design_scores_gemma":[0.000002982649,0.000009927194,0.00009865447,0.0000129895525,0.000002488337,0.000057063462,0.000022519294,0.0061764014,0.00033802504,0.98977166,0.0035002427,0.000006954577],"about_ca_topic_score_codex":0.0009888728,"about_ca_topic_score_gemma":0.0005633257,"teacher_disagreement_score":0.011014501,"about_ca_system_score_codex":0.00080924795,"about_ca_system_score_gemma":0.00066718506,"threshold_uncertainty_score":0.036847115},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24169257,0.004968062,0.4705269,0.0039847894,0.00082583376,0.0002705092,0.0025942493,0.00079066545,0.2743465],"genre_scores_gemma":[0.8097545,0.002048989,0.09702878,0.0005690608,0.0007006055,0.0003299621,0.0019980315,0.00020319437,0.08736686],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990706,0.00021692684,0.000059044905,0.00018978326,0.00030682047,0.00015688142],"domain_scores_gemma":[0.9993685,0.00029314356,0.00005957697,0.00008475941,0.00013464563,0.000059411974],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00077275204,0.0005613326,0.00091263716,0.00083122955,0.0010540652,0.0021085788,0.0008617891,0.00061228464,0.012923021],"category_scores_gemma":[0.0019107624,0.00039519073,0.00070269185,0.001046491,0.0014025385,0.0016859729,0.0022163074,0.0019654918,0.0018079937],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017382607,0.000019312965,0.0002607733,0.000072461735,0.000015551368,0.00010179398,0.00021149809,0.003611468,0.0006236199,0.98544955,0.0022675088,0.0073490366],"study_design_scores_gemma":[0.00003905636,0.000018980385,0.00026179932,0.000023207931,0.000011354748,0.00009940185,0.00008375497,0.031769294,0.0006620426,0.9560159,0.011000233,0.0000149543575],"about_ca_topic_score_codex":0.0019257179,"about_ca_topic_score_gemma":0.0034611053,"teacher_disagreement_score":0.012923021,"about_ca_system_score_codex":0.0020927049,"about_ca_system_score_gemma":0.00093868107,"threshold_uncertainty_score":0.043231845},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.097517684,0.0052070078,0.7661636,0.0028492215,0.0005914907,0.00010176137,0.00047011144,0.00020730076,0.12689188],"genre_scores_gemma":[0.84590226,0.0043573114,0.13012375,0.00077720196,0.0013063105,0.00022026485,0.00050553074,0.00021469018,0.016592758],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978375,0.0009357982,0.00011984924,0.00034850204,0.00052924006,0.0002291178],"domain_scores_gemma":[0.9964449,0.0019290637,0.00046173227,0.00031098493,0.0005736079,0.00027980463],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030780872,0.0010267782,0.0008079442,0.0029423565,0.0013769869,0.002807219,0.001266308,0.0011343381,0.005974984],"category_scores_gemma":[0.009715874,0.00037963258,0.00078794407,0.002982371,0.005979862,0.0063960887,0.002535666,0.0031585626,0.0009406584],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014133421,0.00001385012,0.0001631463,0.00002708907,0.000004749451,0.000034073066,0.00006368528,0.0019136467,0.00037919736,0.9931544,0.00073624315,0.003495793],"study_design_scores_gemma":[0.0000031019285,0.000017769164,0.0001500328,0.000013697385,0.0000032509452,0.000049361894,0.000050033716,0.02198935,0.00024514092,0.97589046,0.001572461,0.00001532065],"about_ca_topic_score_codex":0.0014096536,"about_ca_topic_score_gemma":0.0008673242,"teacher_disagreement_score":0.005974984,"about_ca_system_score_codex":0.0017940422,"about_ca_system_score_gemma":0.0009457885,"threshold_uncertainty_score":0.019988298},"labels":[],"label_agreement":null},{"id":"W3203646126","doi":"10.13001/ela.2021.4991","title":"Generalized Commutators and the Moore-Penrose Inverse","year":2021,"lang":"en","type":"article","venue":"Electronic Journal of Linear Algebra","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Division of Mathematical Sciences; Fields Institute for Research in Mathematical Sciences","keywords":"Mathematics; Commutator; Combinatorics; Inverse; Kernel (algebra); Conjecture; Rank (graph theory); Matrix (chemical analysis); Operator (biology); TRACE (psycholinguistics); Algebra over a field; Pure mathematics","score_opus":0.0066310965750864806,"score_gpt":0.23013447642621795,"score_spread":0.22350337985113147,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3203646126","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28798106,0.0027590222,0.5504666,0.0015096475,0.0007908968,0.000067562374,0.00029605223,0.0007160598,0.15541305],"genre_scores_gemma":[0.8938453,0.0012501173,0.06909445,0.0007695931,0.0006952051,0.00010494711,0.00023701655,0.00021789265,0.033785466],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992269,0.00017123937,0.000050005594,0.00020590016,0.00021980084,0.0001261322],"domain_scores_gemma":[0.99931,0.00014198478,0.00011590604,0.00016224051,0.00017611409,0.00009379762],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061940256,0.00062187394,0.00058066484,0.0008582571,0.0008668417,0.0016905713,0.0007379713,0.0009133366,0.0059123803],"category_scores_gemma":[0.0016127863,0.00027119467,0.00070156506,0.0006393343,0.0026108464,0.0033043944,0.0013072274,0.0014846022,0.001551169],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015366146,0.000010386293,0.000073943214,0.000026670608,0.000004774827,0.00010640068,0.00018237997,0.0008372035,0.0009972268,0.99305266,0.00059254485,0.0041003185],"study_design_scores_gemma":[0.000006844595,0.000033497923,0.00008527418,0.000012581312,0.0000035566704,0.0002175869,0.0000604278,0.010179544,0.0013156785,0.98246735,0.0055986024,0.000019025229],"about_ca_topic_score_codex":0.0007261366,"about_ca_topic_score_gemma":0.00052494975,"teacher_disagreement_score":0.0059123803,"about_ca_system_score_codex":0.0006118655,"about_ca_system_score_gemma":0.0004428293,"threshold_uncertainty_score":0.019778907},"labels":[],"label_agreement":null},{"id":"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.689751,0.00011303507,0.29232192,0.0001604089,0.000043681426,0.000048691363,0.00010615119,0.00011319926,0.017341973],"genre_scores_gemma":[0.97184944,0.00008177238,0.025420647,0.00003580802,0.000021881116,0.00003770938,0.00009335974,0.00003837243,0.0024209567],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99929523,0.00017222048,0.000038243652,0.00022409171,0.0001541325,0.000116022005],"domain_scores_gemma":[0.99807584,0.00071160647,0.00036074984,0.00034114058,0.00028144167,0.0002292147],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054951163,0.00038087304,0.00037167675,0.0011049985,0.0010346934,0.0012176103,0.0005225831,0.00053897494,0.003913641],"category_scores_gemma":[0.002875659,0.00031685922,0.00038507392,0.00080284604,0.0017853625,0.0031667887,0.0015018979,0.0007919804,0.0003464978],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011645996,0.000058081423,0.0019645686,0.00007787779,0.000022608852,0.00039244673,0.0005254052,0.013388816,0.023931336,0.9458455,0.00034209073,0.013334856],"study_design_scores_gemma":[0.000013723636,0.00009577276,0.0012689125,0.000023135779,0.000027121203,0.00051029434,0.0005583335,0.08712562,0.016179739,0.89109546,0.0030714464,0.000030335486],"about_ca_topic_score_codex":0.00031627555,"about_ca_topic_score_gemma":0.000551169,"teacher_disagreement_score":0.003913641,"about_ca_system_score_codex":0.0003912609,"about_ca_system_score_gemma":0.0002799258,"threshold_uncertainty_score":0.013092458},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44010708,0.00022645868,0.5032769,0.0006513864,0.00016915878,0.00012533543,0.00029019968,0.0006333922,0.054520115],"genre_scores_gemma":[0.88961756,0.00018202898,0.102835916,0.0002769735,0.00006220927,0.00016865977,0.00039967516,0.00021276959,0.0062442096],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992888,0.00018564382,0.00003881151,0.00020845998,0.00018288493,0.00009533924],"domain_scores_gemma":[0.998184,0.00073880795,0.00022578605,0.00038932904,0.0002252864,0.00023687146],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007620844,0.00051506015,0.00037083088,0.0015584581,0.0014546183,0.0012386981,0.0007512244,0.00083941955,0.005649144],"category_scores_gemma":[0.0027072113,0.00039076773,0.0005909782,0.0008436607,0.0017566276,0.0030487378,0.0016929802,0.0015316899,0.00066190184],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000042960688,0.000030535768,0.0005015938,0.000035793473,0.000006986058,0.00015156915,0.0002493944,0.0036263335,0.008925932,0.97653925,0.0008926813,0.008997033],"study_design_scores_gemma":[0.000021355112,0.000052493633,0.0006255281,0.000030181376,0.000018421359,0.0005367613,0.00034911823,0.051939383,0.011076659,0.9289201,0.0063944003,0.000035689085],"about_ca_topic_score_codex":0.00018816038,"about_ca_topic_score_gemma":0.00038580294,"teacher_disagreement_score":0.005649144,"about_ca_system_score_codex":0.00069868134,"about_ca_system_score_gemma":0.00037963712,"threshold_uncertainty_score":0.018898308},"labels":[],"label_agreement":null},{"id":"W340250899","doi":"10.13001/1081-3810.1173","title":"Schur complements of matrices with acyclic bipartite graphs","year":2005,"lang":"en","type":"article","venue":"Electronic Journal of Linear Algebra","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Schur complement; Combinatorics; Sign (mathematics); Bipartite graph; Invertible matrix; Factorization; Inverse; Matrix (chemical analysis); Discrete mathematics; Pure mathematics; Graph; Mathematical analysis; Algorithm; Geometry","score_opus":0.00782412159649532,"score_gpt":0.24721593812946457,"score_spread":0.23939181653296926,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W340250899","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17566341,0.00064790586,0.73319304,0.00054038723,0.0002478527,0.00033973897,0.0013683739,0.0009903628,0.08700897],"genre_scores_gemma":[0.79282606,0.00091194233,0.17396688,0.0004531867,0.0002677687,0.0006558716,0.0021018998,0.0002775773,0.028538862],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99847513,0.0005009922,0.00006412877,0.00021991739,0.0004740924,0.00026566393],"domain_scores_gemma":[0.99719185,0.0010982663,0.00044562202,0.00035075183,0.0006604597,0.00025306674],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009663698,0.000992806,0.0005431755,0.0022282954,0.0012050638,0.0023541152,0.00087470934,0.00082005514,0.0111813415],"category_scores_gemma":[0.0053435955,0.0005399555,0.0006253312,0.0020047764,0.0023126681,0.0022839557,0.0017343105,0.0009943272,0.0015618592],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009129934,0.00003277111,0.0002529735,0.00006878839,0.000013402592,0.00022733258,0.00013946762,0.018050672,0.0023349896,0.9567297,0.0025239373,0.019534776],"study_design_scores_gemma":[0.00001926061,0.00004122951,0.00021346375,0.000036325207,0.000010685001,0.00015624,0.00012495149,0.08717866,0.002544876,0.8989343,0.010712704,0.000027186925],"about_ca_topic_score_codex":0.0030229161,"about_ca_topic_score_gemma":0.0041870587,"teacher_disagreement_score":0.0111813415,"about_ca_system_score_codex":0.0010781474,"about_ca_system_score_gemma":0.0012953467,"threshold_uncertainty_score":0.03740537},"labels":[],"label_agreement":null},{"id":"W344607830","doi":"10.13001/1081-3810.1387","title":"Refined inertially and spectrally arbitrary zero-nonzero patterns","year":2010,"lang":"en","type":"article","venue":"Electronic Journal of Linear Algebra","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Zero (linguistics); Mathematics; Eigenvalues and eigenvectors; Inertia; Zero order; Matrix (chemical analysis); Order (exchange); Mathematical analysis; Pure mathematics; Physics; Applied mathematics; First order; Classical mechanics; Quantum mechanics","score_opus":0.004421461717682794,"score_gpt":0.21843429756039076,"score_spread":0.21401283584270797,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W344607830","genre_codex":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.74048305,0.00029412817,0.19138433,0.00026534192,0.0001479789,0.00004686523,0.00019555396,0.0003001945,0.06688258],"genre_scores_gemma":[0.9583674,0.00015837433,0.027877508,0.000081846316,0.00007670513,0.000035587887,0.0002479451,0.000101579615,0.013053149],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99945265,0.000088901616,0.00004077921,0.00009548181,0.0001818914,0.00014025257],"domain_scores_gemma":[0.99901855,0.00018993525,0.00016827892,0.00030981915,0.0001939727,0.000119373944],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040439935,0.0004171074,0.00034372884,0.0007075183,0.0006463345,0.0009446146,0.00051393005,0.00034456054,0.004875989],"category_scores_gemma":[0.00199815,0.00026244193,0.00043488352,0.00048487633,0.0018688489,0.0015757424,0.001094313,0.0007816907,0.0007621835],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017845906,0.00003248094,0.0016322111,0.00005486203,0.0000094611505,0.00042969544,0.0004528989,0.0053169997,0.018283881,0.9554241,0.001462917,0.01672198],"study_design_scores_gemma":[0.00004294263,0.000121259385,0.0024607137,0.00002698285,0.000021702926,0.0006922438,0.0003160282,0.05142303,0.018107204,0.9162135,0.010515323,0.00005911779],"about_ca_topic_score_codex":0.0006399128,"about_ca_topic_score_gemma":0.00080319645,"teacher_disagreement_score":0.004875989,"about_ca_system_score_codex":0.00028918264,"about_ca_system_score_gemma":0.0003307428,"threshold_uncertainty_score":0.016311824},"labels":[],"label_agreement":null},{"id":"W350056888","doi":"10.13001/1081-3810.1640","title":"Techniques for identifying inertially arbitrary patterns","year":2013,"lang":"en","type":"article","venue":"Electronic Journal of Linear Algebra","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Redeemer University; Discovery Centre; University of Victoria; University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Jacobian matrix and determinant; Mathematics; Nilpotent; Applied mathematics; Matrix (chemical analysis); Eigenvalues and eigenvectors; Algorithm; Algebra over a field; Pure mathematics; Physics","score_opus":0.012218735288437896,"score_gpt":0.26284107341778207,"score_spread":0.25062233812934415,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W350056888","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011228871,0.00012073226,0.9744441,0.00022782861,0.00016389406,0.000049129925,0.000035090718,0.000468496,0.013261863],"genre_scores_gemma":[0.2655813,0.000630334,0.7146508,0.0003600125,0.00027784504,0.00026407113,0.00023534863,0.00063958956,0.017360639],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978515,0.00050910027,0.0001900578,0.00040027493,0.0008618574,0.0001872185],"domain_scores_gemma":[0.9952714,0.0012384892,0.00052792183,0.0019203437,0.00090276,0.00013905698],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017174501,0.0006557735,0.00048477371,0.0021099015,0.0015769041,0.0017236032,0.0016011626,0.0007963148,0.010552421],"category_scores_gemma":[0.009056805,0.00050205644,0.0007053374,0.0015279846,0.00362461,0.005494267,0.003336601,0.0023335568,0.0035388947],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000053491236,0.000024913103,0.00061560137,0.00012550612,0.00001165222,0.00017453636,0.00087512675,0.0011607456,0.0119171515,0.88907766,0.002376007,0.09358756],"study_design_scores_gemma":[0.000026117628,0.00008529929,0.0006419788,0.00007231239,0.000020180349,0.00093051855,0.00050733564,0.024138998,0.032480977,0.8920538,0.048961442,0.00008109168],"about_ca_topic_score_codex":0.00033845936,"about_ca_topic_score_gemma":0.00053252536,"teacher_disagreement_score":0.010552421,"about_ca_system_score_codex":0.00042103673,"about_ca_system_score_gemma":0.0007564404,"threshold_uncertainty_score":0.035301387},"labels":[],"label_agreement":null},{"id":"W397639302","doi":"10.13001/1081-3810.1624","title":"On the Kemeny constant and stationary distribution vector for a Markov chain","year":2014,"lang":"en","type":"article","venue":"Electronic Journal of Linear Algebra","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Mathematics; Markov chain; Constant (computer programming); Stationary distribution; Distribution (mathematics); Chain (unit); Continuous-time Markov chain; Markov property; Applied mathematics; Combinatorics; Statistical physics; Pure mathematics; Mathematical analysis; Markov model; Statistics; Computer science; Physics","score_opus":0.005698658319957989,"score_gpt":0.2231411339679574,"score_spread":0.2174424756479994,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W397639302","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16905203,0.0032431623,0.79158556,0.0025656088,0.00020489108,0.00012555248,0.00070018444,0.0003188809,0.03220411],"genre_scores_gemma":[0.91624063,0.0033690054,0.063504264,0.00062504906,0.00051712245,0.0003028215,0.0005359478,0.00023170839,0.014673492],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980715,0.0005799303,0.00008148304,0.0004210405,0.00041899522,0.0004270669],"domain_scores_gemma":[0.97351223,0.020815937,0.0019866277,0.0008196093,0.0014328777,0.0014327499],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038426407,0.0012543334,0.0011597743,0.0031706763,0.0019722541,0.0023574189,0.0018330485,0.0015373447,0.00901924],"category_scores_gemma":[0.029631983,0.000585821,0.0008503837,0.002578324,0.0051004402,0.0062192227,0.002279786,0.0033786204,0.0015853732],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000968884,0.00003116676,0.00068165996,0.00007123034,0.00001972438,0.00012588204,0.00022868172,0.030104557,0.0011816657,0.95999753,0.0014046204,0.0060564177],"study_design_scores_gemma":[0.000022714805,0.00004836245,0.00054951204,0.00007406419,0.00001646966,0.00011314375,0.000111393456,0.21675158,0.00092863163,0.7793208,0.0019882515,0.000075114534],"about_ca_topic_score_codex":0.005050326,"about_ca_topic_score_gemma":0.0034864764,"teacher_disagreement_score":0.00901924,"about_ca_system_score_codex":0.003147098,"about_ca_system_score_gemma":0.002746824,"threshold_uncertainty_score":0.030172288},"labels":[],"label_agreement":null},{"id":"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.82153666,0.00094425486,0.1603473,0.00053197145,0.00004871325,0.00005652975,0.00033286604,0.0003020074,0.015899742],"genre_scores_gemma":[0.9765786,0.0003787028,0.019260928,0.000091899725,0.000037636375,0.000067609624,0.00023332138,0.00006232899,0.003288853],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999481,0.00014319658,0.000021268368,0.00016465143,0.00010675661,0.0000830659],"domain_scores_gemma":[0.9946374,0.0030507531,0.0008850908,0.00046306103,0.0004610345,0.0005025797],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000946681,0.00030580835,0.00042900376,0.002360432,0.0017082326,0.001306478,0.0007487797,0.0008929099,0.0029528614],"category_scores_gemma":[0.007213561,0.00047783382,0.0006123226,0.0008941666,0.0014700819,0.0022701384,0.00081520947,0.0007457354,0.0002533341],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016690411,0.000058709888,0.00778631,0.0001136468,0.000062105464,0.001307819,0.001351148,0.030356549,0.0065357974,0.934581,0.00302841,0.014651637],"study_design_scores_gemma":[0.00003192777,0.00007136095,0.007047276,0.00007268172,0.000046254154,0.0025401325,0.00068134087,0.17283158,0.0018775841,0.8082132,0.0065309084,0.000055697095],"about_ca_topic_score_codex":0.0010644287,"about_ca_topic_score_gemma":0.0010755453,"teacher_disagreement_score":0.0029528614,"about_ca_system_score_codex":0.0006393023,"about_ca_system_score_gemma":0.00028969426,"threshold_uncertainty_score":0.009878337},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9018912,0.0017043015,0.049077656,0.0029150809,0.00013564447,0.00004515417,0.00023592808,0.00024117793,0.04375386],"genre_scores_gemma":[0.9876338,0.0003993435,0.008268724,0.00023094635,0.00013364835,0.00006333756,0.00013437147,0.000032942426,0.0031028793],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99932003,0.00028879815,0.000026841491,0.000109479086,0.00015610264,0.00009886367],"domain_scores_gemma":[0.9976152,0.0014761994,0.00031929676,0.00014380486,0.00012889442,0.00031662683],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007863393,0.0008217143,0.0008611792,0.0021779486,0.002090004,0.002125474,0.0012591112,0.0017215902,0.0035357769],"category_scores_gemma":[0.005376955,0.0003975942,0.00034188252,0.0008989118,0.004656593,0.0033337115,0.0022328575,0.0014994079,0.00047431662],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006527413,0.00001208926,0.00037042718,0.00004348821,0.0000042109614,0.00011823328,0.00030051224,0.0023080362,0.0005706588,0.991198,0.001478829,0.0035302632],"study_design_scores_gemma":[0.000034539426,0.00003713333,0.00069162966,0.000024871646,0.000004970948,0.0002737258,0.00037916668,0.025546404,0.00047475297,0.9701375,0.002378527,0.000016854505],"about_ca_topic_score_codex":0.00075194525,"about_ca_topic_score_gemma":0.00044691397,"teacher_disagreement_score":0.0035357769,"about_ca_system_score_codex":0.00081768737,"about_ca_system_score_gemma":0.00019989317,"threshold_uncertainty_score":0.011828363},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39481914,0.0013042965,0.5730626,0.00086892676,0.00014601125,0.000098002645,0.0008975621,0.0019807334,0.026822757],"genre_scores_gemma":[0.87137365,0.00043800514,0.120613396,0.00012655505,0.00006589105,0.0000691759,0.000481627,0.00046775475,0.00636394],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990239,0.00015038211,0.000037643604,0.00036219423,0.00023954205,0.00018640685],"domain_scores_gemma":[0.9911538,0.0056102145,0.0006598909,0.0014143758,0.0005781301,0.00058367604],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018601622,0.00063728995,0.0007796539,0.004176816,0.0016337329,0.0018083019,0.0016918667,0.001409434,0.0063162735],"category_scores_gemma":[0.020313697,0.00039593832,0.00062114885,0.0027175392,0.0019916764,0.005615604,0.001453885,0.001818916,0.00158351],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005471632,0.00012447663,0.0060343794,0.00031865333,0.00010829952,0.00046557747,0.0008068429,0.17097588,0.013662877,0.72601056,0.00776122,0.07318411],"study_design_scores_gemma":[0.00002658385,0.00004906068,0.0021529512,0.000036844332,0.000039463903,0.00024110611,0.00018443949,0.28657645,0.007655423,0.69777524,0.0051837782,0.000078551486],"about_ca_topic_score_codex":0.004573986,"about_ca_topic_score_gemma":0.0072288243,"teacher_disagreement_score":0.0063162735,"about_ca_system_score_codex":0.0021985634,"about_ca_system_score_gemma":0.0011762091,"threshold_uncertainty_score":0.021130025},"labels":[],"label_agreement":null},{"id":"W4319725279","doi":"10.13001/ela.2023.7209","title":"Flat portions on the boundary of the numerical range of a 5 × 5 companion matrix","year":2023,"lang":"en","type":"article","venue":"Electronic Journal of Linear Algebra","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"York University; New York University Abu Dhabi","keywords":"Numerical range; Mathematics; Boundary (topology); Conjecture; Matrix (chemical analysis); Range (aeronautics); Complex matrix; Numerical analysis; Pure mathematics; Combinatorics; Mathematical analysis; Algebra over a field","score_opus":0.011616387272249422,"score_gpt":0.25954353528803936,"score_spread":0.24792714801578994,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4319725279","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9577543,0.00011433708,0.022943098,0.00011568089,0.000020766962,0.000017238233,0.00010421417,0.00010337201,0.018826952],"genre_scores_gemma":[0.9936777,0.0000395215,0.0042872783,0.000016349562,0.000012634939,0.000013429827,0.00015800731,0.000011887767,0.0017832664],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99941576,0.00010477722,0.00004474094,0.00010931804,0.00020628286,0.00011909851],"domain_scores_gemma":[0.9981086,0.00070545415,0.00033949036,0.0002602799,0.00022764695,0.00035858972],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035201214,0.00033275617,0.0003018202,0.0009343152,0.000959949,0.0010761233,0.0005276861,0.0004893281,0.007561391],"category_scores_gemma":[0.0030157936,0.00020531872,0.0002791018,0.00044356906,0.0015115854,0.0013775082,0.00091876026,0.00057069556,0.00056926644],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016833447,0.00021029823,0.022688055,0.00030857525,0.000058316564,0.0038968937,0.0014288425,0.026912848,0.113027066,0.7433141,0.0036547144,0.082816966],"study_design_scores_gemma":[0.00012329359,0.00079676666,0.032376565,0.00012793769,0.00007134488,0.006517574,0.001838453,0.16331404,0.09478829,0.6866644,0.013189261,0.00019210926],"about_ca_topic_score_codex":0.0003435272,"about_ca_topic_score_gemma":0.0003166687,"teacher_disagreement_score":0.007561391,"about_ca_system_score_codex":0.00025157555,"about_ca_system_score_gemma":0.00027729027,"threshold_uncertainty_score":0.025295377},"labels":[],"label_agreement":null},{"id":"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02008803,0.0060277,0.7932018,0.002810349,0.0027919246,0.000073172254,0.0004027446,0.00015367981,0.17445065],"genre_scores_gemma":[0.6760551,0.014603505,0.15070027,0.0034112178,0.0046129944,0.00031160068,0.0007400287,0.00045222248,0.14911312],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999315,0.00013849999,0.000033899603,0.00016834571,0.00023716812,0.00010696144],"domain_scores_gemma":[0.99871063,0.0005089099,0.00013109985,0.00007395362,0.00045142206,0.00012396408],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00097591424,0.0007289032,0.00059901207,0.0014203064,0.00073596055,0.0019536242,0.0006309297,0.0010204109,0.010620336],"category_scores_gemma":[0.0041150306,0.0003024585,0.0007615395,0.0009842437,0.0018438358,0.0031818922,0.0018472343,0.0026894212,0.0025285038],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002755284,0.000013311566,0.00021796102,0.000110872024,0.000013360786,0.0001961001,0.00012585343,0.0024979822,0.004638501,0.96209794,0.0051328028,0.024927739],"study_design_scores_gemma":[0.000009607376,0.000067177105,0.00058093574,0.00007839873,0.000018997389,0.0006587732,0.00008664313,0.035335135,0.0042070025,0.9131184,0.04579758,0.00004140138],"about_ca_topic_score_codex":0.00096769695,"about_ca_topic_score_gemma":0.00075062935,"teacher_disagreement_score":0.010620336,"about_ca_system_score_codex":0.0007307251,"about_ca_system_score_gemma":0.0008637194,"threshold_uncertainty_score":0.03552854},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6490448,0.0015233784,0.08858271,0.002708036,0.0008153987,0.00005892398,0.0002468146,0.0003606244,0.25665927],"genre_scores_gemma":[0.96874946,0.0007149587,0.010667631,0.00046619007,0.0005671223,0.000059890284,0.00025712606,0.000078524456,0.018439142],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99942064,0.00014487594,0.000030961543,0.000115752075,0.0001626765,0.0001251762],"domain_scores_gemma":[0.9993007,0.00020076073,0.00010178813,0.00013655197,0.00011603127,0.00014414567],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00079091894,0.0007038778,0.0005579205,0.0011977039,0.0014994299,0.0024801157,0.00061335845,0.0010958934,0.0064071137],"category_scores_gemma":[0.0022733915,0.0002156636,0.0005563192,0.00069343817,0.0031477339,0.003512181,0.0018708078,0.0015474256,0.0014011392],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022524047,0.0000124257995,0.0000968357,0.000025688603,0.0000019210695,0.00007307569,0.00014903233,0.00047367433,0.0010841535,0.99356514,0.00056824496,0.003927301],"study_design_scores_gemma":[0.000007652791,0.00003232832,0.00014882063,0.000008719216,0.0000013419588,0.000092706534,0.00007982884,0.0018347504,0.00044576122,0.99543977,0.001901181,0.0000072378857],"about_ca_topic_score_codex":0.0003380893,"about_ca_topic_score_gemma":0.0002796729,"teacher_disagreement_score":0.0064071137,"about_ca_system_score_codex":0.0008813882,"about_ca_system_score_gemma":0.0006041028,"threshold_uncertainty_score":0.02143395},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0066121756,0.00067625684,0.9848273,0.0003205015,0.00011075032,0.000020509973,0.00003261532,0.00034760297,0.007052268],"genre_scores_gemma":[0.45884237,0.0015338901,0.5299293,0.0003879262,0.00039329613,0.00033961638,0.00019590494,0.00092551426,0.0074522295],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9969914,0.0013020881,0.00011893068,0.0003946363,0.0009955654,0.00019732445],"domain_scores_gemma":[0.99037826,0.0063592023,0.00073735474,0.001356296,0.0008810487,0.00028782955],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037091468,0.0017634522,0.0011110198,0.001155746,0.00060920394,0.0024448482,0.0013345146,0.0010349344,0.0046993536],"category_scores_gemma":[0.017007282,0.00066934025,0.000763512,0.0008192226,0.00334645,0.0049415785,0.0037039837,0.0041840794,0.0012492161],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023504504,0.000079518075,0.0005677484,0.00027808506,0.000059430276,0.000098142475,0.00014801756,0.41609982,0.012284078,0.49830678,0.003591401,0.06825192],"study_design_scores_gemma":[0.000009221108,0.00005961944,0.00007181786,0.000044114204,0.000008130935,0.000042372496,0.00001708344,0.8484711,0.003946244,0.14449091,0.002816892,0.000022478813],"about_ca_topic_score_codex":0.0007448789,"about_ca_topic_score_gemma":0.0009908528,"teacher_disagreement_score":0.0046993536,"about_ca_system_score_codex":0.0011167842,"about_ca_system_score_gemma":0.0011104923,"threshold_uncertainty_score":0.019616127},"labels":[],"label_agreement":null},{"id":"W4388723858","doi":"10.13001/ela.2023.7971","title":"Eigenvalues for stochastic matrices with a prescribed stationary distribution","year":2023,"lang":"en","type":"article","venue":"Electronic Journal of Linear Algebra","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Eigenvalues and eigenvectors; Vertex (graph theory); Lambda; Sigma; Matrix (chemical analysis); Graph; Physics; Quantum mechanics","score_opus":0.009728455201395713,"score_gpt":0.2531222988154118,"score_spread":0.24339384361401611,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388723858","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24509342,0.0008408699,0.70643175,0.0012074745,0.0001096995,0.00007960786,0.0005526392,0.00067082106,0.04501377],"genre_scores_gemma":[0.9341353,0.0009841638,0.045885388,0.00023289892,0.00023828646,0.00032423684,0.0006299934,0.00036427853,0.017205423],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991013,0.0002272633,0.000038079786,0.00019923101,0.00024089763,0.00019320188],"domain_scores_gemma":[0.99586016,0.002549653,0.00056724186,0.00025879167,0.00043936487,0.00032485634],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010292655,0.0008795019,0.0006026352,0.0018194718,0.0007292503,0.0017718981,0.0008793825,0.0009311097,0.008840951],"category_scores_gemma":[0.0073455484,0.0004208638,0.00065377663,0.00081863074,0.0021869815,0.002048635,0.001266682,0.0014065264,0.0015966006],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000093204086,0.00003891695,0.00061555835,0.00010279295,0.000018050318,0.0002024954,0.00019417323,0.038662832,0.0063258065,0.9442822,0.0019435239,0.007520447],"study_design_scores_gemma":[0.000021925416,0.00004609699,0.00068558246,0.00005548154,0.000009094816,0.00013146496,0.00013985967,0.38199008,0.0032583012,0.61165124,0.0019695444,0.000041478845],"about_ca_topic_score_codex":0.00093713065,"about_ca_topic_score_gemma":0.0008600812,"teacher_disagreement_score":0.008840951,"about_ca_system_score_codex":0.0011125084,"about_ca_system_score_gemma":0.0007506311,"threshold_uncertainty_score":0.029575944},"labels":[],"label_agreement":null},{"id":"W4388857145","doi":"10.13001/ela.2023.8025","title":"Sparks of symmetric matrices and their graphs","year":2023,"lang":"en","type":"article","venue":"Electronic Journal of Linear Algebra","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"Natural Sciences and Engineering Research Council of Canada; American Institute of Mathematics; National Science Foundation","keywords":"Mathematics; Combinatorics; Diagonal; Vertex (graph theory); Graph; Skew-symmetric matrix; Null (SQL); Discrete mathematics; Symmetric matrix; Square matrix; Geometry; Physics; Computer science","score_opus":0.00785242508233393,"score_gpt":0.23013409278902844,"score_spread":0.2222816677066945,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388857145","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2906043,0.0012057768,0.6728896,0.0014835793,0.00021902629,0.00016961283,0.004153918,0.002081461,0.027192807],"genre_scores_gemma":[0.8756481,0.0007715971,0.106186785,0.00040933397,0.00032575714,0.00023738353,0.0040795924,0.00044827102,0.011893104],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99856913,0.0003347083,0.00007944569,0.0003845333,0.0003866551,0.00024557236],"domain_scores_gemma":[0.99411845,0.0026217967,0.0008866515,0.00082688837,0.0008825283,0.00066364685],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010662281,0.00061583566,0.00096282555,0.002151814,0.0010174694,0.0022629898,0.0009966646,0.0007315365,0.0062933243],"category_scores_gemma":[0.009837591,0.00041963172,0.00067146146,0.0017291534,0.0016758228,0.0036620346,0.0017890271,0.0010608122,0.0011657453],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005326875,0.00011028481,0.0021481265,0.00022515102,0.000060485527,0.00045903257,0.00071490434,0.051674157,0.0059214826,0.87837064,0.017489016,0.042294037],"study_design_scores_gemma":[0.000024360721,0.000046872003,0.0005204792,0.00001536278,0.000008145629,0.00022150809,0.00015572754,0.09453842,0.0009415427,0.89916664,0.0043412633,0.000019617015],"about_ca_topic_score_codex":0.0012535696,"about_ca_topic_score_gemma":0.0013586131,"teacher_disagreement_score":0.0062933243,"about_ca_system_score_codex":0.00080414995,"about_ca_system_score_gemma":0.00075337576,"threshold_uncertainty_score":0.021053255},"labels":[],"label_agreement":null},{"id":"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25270227,0.0005081703,0.5482428,0.0014442872,0.0013028055,0.00044702354,0.0016441738,0.0027116414,0.19099681],"genre_scores_gemma":[0.7497096,0.00040520367,0.18433475,0.00092106464,0.00021030194,0.0006655646,0.001376015,0.0010868127,0.06129063],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99900264,0.00016777546,0.00008270655,0.0002391619,0.00030292527,0.00020485165],"domain_scores_gemma":[0.998594,0.00035233886,0.00015207754,0.00034802285,0.00037708285,0.00017637973],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00062499364,0.0008524144,0.0005084167,0.0010750638,0.001894843,0.0017981551,0.0007253779,0.00094860455,0.025307553],"category_scores_gemma":[0.0032505859,0.00044304316,0.0006215397,0.00066842866,0.0020708297,0.0026454106,0.0015169913,0.0014835733,0.0050774543],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030269646,0.000115321585,0.0022065858,0.00021991813,0.000018262923,0.0010547442,0.00048046585,0.003210398,0.028184578,0.89863455,0.010571852,0.055000596],"study_design_scores_gemma":[0.000061508406,0.00025866638,0.0018734396,0.00011790646,0.000030763724,0.0014531797,0.00074278226,0.023966048,0.020754557,0.8601316,0.09047513,0.00013447272],"about_ca_topic_score_codex":0.0010314967,"about_ca_topic_score_gemma":0.002374679,"teacher_disagreement_score":0.025307553,"about_ca_system_score_codex":0.0008184251,"about_ca_system_score_gemma":0.0011608055,"threshold_uncertainty_score":0.08466226},"labels":[],"label_agreement":null},{"id":"W4392367436","doi":"10.13001/ela.2024.8491","title":"The numerical range of matrix products","year":2024,"lang":"en","type":"article","venue":"Electronic Journal of Linear Algebra","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Mathematics; Numerical range; Matrix (chemical analysis); Range (aeronautics); Pure mathematics; Algebra over a field; Chemistry","score_opus":0.006577779928596201,"score_gpt":0.25522844220933383,"score_spread":0.24865066228073762,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392367436","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16642329,0.0023023998,0.77963024,0.0027587893,0.0002077531,0.000035029127,0.00031679682,0.0005541202,0.047771513],"genre_scores_gemma":[0.9049476,0.0010098475,0.09015617,0.00031250398,0.00021901535,0.000090256166,0.00031067207,0.0002059579,0.0027480205],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9961824,0.0011379498,0.0002654151,0.0007251116,0.001466085,0.00022293821],"domain_scores_gemma":[0.9835317,0.010685194,0.0013684753,0.002353595,0.0015071025,0.00055387395],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035507726,0.0005620037,0.0007006537,0.0013032052,0.0007699974,0.0038078013,0.0016916953,0.0009890571,0.004921983],"category_scores_gemma":[0.03838103,0.0004606735,0.0005266502,0.0010158699,0.0045063067,0.009018357,0.0029948214,0.0025493647,0.0009989229],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001798766,0.000043848962,0.002591681,0.00020949615,0.00003354452,0.00024971395,0.0004611662,0.04898391,0.008212835,0.9071372,0.0012856992,0.030611165],"study_design_scores_gemma":[0.000019014931,0.00006899884,0.0007067883,0.00010130466,0.000013558187,0.00041412198,0.00018636191,0.15473373,0.0077483878,0.8313751,0.0045732404,0.000059374168],"about_ca_topic_score_codex":0.00040966214,"about_ca_topic_score_gemma":0.00025820328,"teacher_disagreement_score":0.004921983,"about_ca_system_score_codex":0.0006946659,"about_ca_system_score_gemma":0.0005614132,"threshold_uncertainty_score":0.018778503},"labels":[],"label_agreement":null},{"id":"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21635702,0.0022965285,0.6279334,0.0014014788,0.00062771083,0.00013617535,0.00080734096,0.00053677434,0.1499036],"genre_scores_gemma":[0.9244872,0.001679441,0.046193726,0.0006852762,0.0007222782,0.00016412033,0.000679776,0.00028214263,0.025106024],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989766,0.00016351049,0.00006641899,0.0002778072,0.00035441824,0.0001612819],"domain_scores_gemma":[0.9971449,0.0008725064,0.00048023107,0.00032144174,0.00087252684,0.00030837988],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00068474864,0.0008348126,0.0003562465,0.0031620266,0.00079066085,0.0030444723,0.0005915116,0.0008110327,0.008562114],"category_scores_gemma":[0.0037508581,0.0002977483,0.00037452276,0.0013744321,0.002127289,0.0030751694,0.0011410253,0.0016659208,0.0021241484],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005401757,0.000023575247,0.0003587308,0.000054285443,0.0000063651078,0.00021552759,0.0002070563,0.002007221,0.008613753,0.97098124,0.0020104111,0.015467833],"study_design_scores_gemma":[0.000013784229,0.00007240357,0.00042892643,0.000037446873,0.0000063638226,0.0011414799,0.00025626,0.023778636,0.007937527,0.9463077,0.01997809,0.000041425097],"about_ca_topic_score_codex":0.00025469225,"about_ca_topic_score_gemma":0.0001670115,"teacher_disagreement_score":0.008562114,"about_ca_system_score_codex":0.0005467833,"about_ca_system_score_gemma":0.0003992919,"threshold_uncertainty_score":0.028643131},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12994331,0.00015407811,0.8452607,0.00028492237,0.00013872897,0.000112456444,0.00013805034,0.0002702049,0.023697605],"genre_scores_gemma":[0.8650951,0.0002081403,0.12327478,0.00023430382,0.00017439402,0.00024789298,0.00022702619,0.00022448698,0.010313878],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99888855,0.0001598908,0.00012197387,0.00018439861,0.0004919449,0.00015338777],"domain_scores_gemma":[0.99595165,0.0010755326,0.0007560274,0.00092121563,0.0009309198,0.00036462123],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000944126,0.00047067725,0.0004312443,0.0011659003,0.0009486276,0.0012845473,0.00086957123,0.00064856827,0.008118379],"category_scores_gemma":[0.006317896,0.00033932622,0.00062175473,0.0006271973,0.0017370178,0.0027585824,0.0022914154,0.0012121011,0.0015551279],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000099585835,0.000048866474,0.0026683486,0.00011903563,0.000015459345,0.00055406225,0.00024576444,0.0084322505,0.04829185,0.90251654,0.0016100397,0.035398245],"study_design_scores_gemma":[0.000034481487,0.00022771808,0.0014018585,0.000036996058,0.000018168872,0.0011781612,0.00015705003,0.08994723,0.035446007,0.86222607,0.009281788,0.00004454557],"about_ca_topic_score_codex":0.00027765162,"about_ca_topic_score_gemma":0.0003993208,"teacher_disagreement_score":0.008118379,"about_ca_system_score_codex":0.0003615094,"about_ca_system_score_gemma":0.0005126357,"threshold_uncertainty_score":0.027158737},"labels":[],"label_agreement":null},{"id":"W4410619980","doi":"10.13001/ela.2025.9483","title":"A note on Lidskii's theorem for the directional derivatives of the eigenvalues of symmetric matrices","year":2025,"lang":"en","type":"article","venue":"Electronic Journal of Linear Algebra","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Eigenvalues and eigenvectors; Pure mathematics; Symmetric matrix; Mathematical analysis; Combinatorics; Physics","score_opus":0.007641676673642443,"score_gpt":0.26505283448327194,"score_spread":0.2574111578096295,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410619980","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03231828,0.0030630883,0.8520435,0.004444916,0.0025546825,0.0000901755,0.00038778875,0.00041388223,0.10468366],"genre_scores_gemma":[0.69329596,0.005149052,0.2488374,0.0058503672,0.0025929227,0.000281098,0.0003940462,0.00070181384,0.04289737],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989471,0.00023050891,0.00006761868,0.00024526293,0.0004058317,0.0001037036],"domain_scores_gemma":[0.9980234,0.0009904039,0.0001680494,0.00030947183,0.00035093297,0.0001577775],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027103685,0.0007658012,0.00079262553,0.0015261663,0.0015802807,0.0019817594,0.001643983,0.0010917182,0.0054152096],"category_scores_gemma":[0.0056417054,0.00041124725,0.0011589637,0.0011051918,0.0042890306,0.004545516,0.0029476408,0.0034705603,0.0014895579],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019555995,0.000011078122,0.00024737476,0.00004921227,0.0000069643456,0.00016912841,0.0002030021,0.0013416653,0.001731784,0.98288417,0.004008608,0.009327389],"study_design_scores_gemma":[0.000014524814,0.000050868945,0.00032837447,0.000032625063,0.000009348708,0.00026057457,0.00005675653,0.010145019,0.0018426104,0.9656961,0.021524467,0.000038719834],"about_ca_topic_score_codex":0.0010726888,"about_ca_topic_score_gemma":0.0007203556,"teacher_disagreement_score":0.0054152096,"about_ca_system_score_codex":0.0010055351,"about_ca_system_score_gemma":0.0006804298,"threshold_uncertainty_score":0.01811564},"labels":[],"label_agreement":null},{"id":"W4416916517","doi":"10.13001/ela.2025.9507","title":"Combinatorial considerations for the number of distinct eigenvalues of a matrix","year":2025,"lang":"","type":"article","venue":"Electronic Journal of Linear Algebra","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"North York General Hospital; Redeemer University; The Scarborough Hospital; University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Eigenvalues and eigenvectors; Digraph; Sequence (biology); Matrix (chemical analysis); Inverse; Binary number; Spectrum of a matrix; Spectrum (functional analysis)","score_opus":0.011783968537994724,"score_gpt":0.3009380608544846,"score_spread":0.28915409231648986,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416916517","genre_codex":"empirical","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6717922,0.0011187303,0.22960024,0.0024299277,0.00021807327,0.000095120085,0.00041774265,0.00021793148,0.09410998],"genre_scores_gemma":[0.9525878,0.0004043456,0.037692264,0.00018895172,0.00014586082,0.00016702879,0.00025292323,0.0001004553,0.008460435],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987972,0.00037439386,0.000096944466,0.0002583786,0.0003135488,0.00015959101],"domain_scores_gemma":[0.9920461,0.0050707855,0.0007910317,0.000773132,0.0005960916,0.0007228615],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013168462,0.0006179717,0.00058528996,0.0024748365,0.001962118,0.0033938114,0.0015085678,0.0012878365,0.008420634],"category_scores_gemma":[0.010024202,0.0007133098,0.0006123232,0.0014217244,0.0032684573,0.0045521515,0.0019269933,0.0015395258,0.00081516244],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000116314644,0.000050880106,0.0017119907,0.000074788266,0.0000115100665,0.00018600025,0.00018621075,0.0061061834,0.0039094165,0.97851634,0.0011752103,0.007955163],"study_design_scores_gemma":[0.000041710995,0.0000695559,0.0009369641,0.000048428257,0.000019603543,0.00044242872,0.00027935006,0.04823234,0.0026177021,0.94389933,0.0033805876,0.00003208247],"about_ca_topic_score_codex":0.00033075636,"about_ca_topic_score_gemma":0.0006788112,"teacher_disagreement_score":0.008420634,"about_ca_system_score_codex":0.00087892055,"about_ca_system_score_gemma":0.0004850816,"threshold_uncertainty_score":0.02816987},"labels":[],"label_agreement":null},{"id":"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15357089,0.0003361746,0.8289719,0.00049173256,0.00006211199,0.00008256879,0.0007145219,0.00019610657,0.015573973],"genre_scores_gemma":[0.8966551,0.001016425,0.08630906,0.00022736039,0.00018855563,0.00042856066,0.0020744372,0.00018316739,0.0129173985],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99827313,0.0005346895,0.00012185956,0.00039141614,0.00035711908,0.00032181342],"domain_scores_gemma":[0.9958954,0.0021878416,0.0007832474,0.00030529575,0.0005844404,0.0002438249],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016757741,0.0010571848,0.00083246565,0.0021156622,0.00075994787,0.0032177123,0.0009885348,0.0010361884,0.0038316662],"category_scores_gemma":[0.006506584,0.00061151193,0.0008611144,0.0014541341,0.0024019433,0.0027244242,0.001141134,0.0014692274,0.00072887476],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000045659377,0.000035110636,0.0005801336,0.000058483834,0.000023534789,0.00013308213,0.00009306628,0.11989223,0.0016906752,0.86888576,0.0009825948,0.0075796978],"study_design_scores_gemma":[0.000014913875,0.000045543802,0.00029922425,0.000040365274,0.000010093551,0.00008821885,0.00011192385,0.38276553,0.0015869199,0.61301446,0.0019881716,0.00003464836],"about_ca_topic_score_codex":0.0017205356,"about_ca_topic_score_gemma":0.0013305405,"teacher_disagreement_score":0.0038316662,"about_ca_system_score_codex":0.0011109186,"about_ca_system_score_gemma":0.00155017,"threshold_uncertainty_score":0.012818158},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.89867866,0.00043556065,0.056466725,0.0005397404,0.000119658616,0.00007956415,0.00024951628,0.00023454621,0.043196],"genre_scores_gemma":[0.97829974,0.00020989131,0.009655475,0.00011458967,0.00011472602,0.000049026756,0.0001956363,0.000036563215,0.011324402],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99971825,0.000045304536,0.00001541518,0.000047040037,0.000095297924,0.00007867513],"domain_scores_gemma":[0.9993843,0.00012478334,0.00014432115,0.000061711944,0.00013838218,0.00014652552],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019681799,0.00028557674,0.0002604314,0.0010412982,0.0009223841,0.0012773965,0.0004213457,0.00036414145,0.005312946],"category_scores_gemma":[0.00093684497,0.00020060477,0.00017886604,0.00053353846,0.0011194785,0.001475596,0.0010173178,0.0005190448,0.00084276835],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014761109,0.00006901628,0.0016060292,0.00011272837,0.000009806107,0.00068338634,0.0012184391,0.002130003,0.02254341,0.9467458,0.0018131436,0.022920577],"study_design_scores_gemma":[0.0000322527,0.00014194111,0.0010605395,0.00002857507,0.000007395213,0.00066165655,0.00040938947,0.010001865,0.0070116874,0.9725375,0.008080924,0.000026269265],"about_ca_topic_score_codex":0.0003199281,"about_ca_topic_score_gemma":0.00030876932,"teacher_disagreement_score":0.005312946,"about_ca_system_score_codex":0.00038369923,"about_ca_system_score_gemma":0.0003296011,"threshold_uncertainty_score":0.017773569},"labels":[],"label_agreement":null}]}