{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":79,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":79,"direct_label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline (scores rank; they never assert a category)","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"query_hash":"1469ad049f25","filters":{"venue":"Electronic Journal of Linear Algebra"}},"results":[{"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.010352681736522,"gpt":0.2487291321015651,"spread":0.238376450365043,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002653026,0.0001874811,0.0003760405,0.0004041253,0.0001369755,0.00006712272,0.00175737,0.00005657688,0.00002896331],"category_scores_gemma":[0.0002563855,0.0001163766,0.0002166898,0.001320531,0.00003359238,0.0003244606,0.00008055922,0.0007055778,0.00001843335],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006633291,"about_ca_system_score_gemma":0.0003340558,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002680037,"about_ca_topic_score_gemma":4.313323e-7,"domain_scores_codex":[0.9975665,0.0003642682,0.0006890356,0.0002100106,0.0006927821,0.000477363],"domain_scores_gemma":[0.9977286,0.0008174726,0.0006772495,0.0005005506,0.000193726,0.00008237748],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001027863,0.002529361,0.00007216207,0.00002329318,0.0003278427,0.0001396961,0.002126494,0.0005639308,0.0007058668,0.9375606,0.0009924645,0.05393047],"study_design_scores_gemma":[0.01276087,0.1215987,0.008503792,0.0004888721,0.0006691655,0.001839529,0.001927375,0.07491245,0.03835746,0.7333214,0.004006313,0.001614118],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9237232,0.003323916,0.06690916,0.004197154,0.0003490821,0.0004419587,0.000001475415,0.00003980091,0.001014281],"genre_scores_gemma":[0.9980533,0.0001166821,0.0009339358,0.0004929693,0.0002258728,0.0000015368,1.797918e-7,0.000008993197,0.000166527],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2042392,"threshold_uncertainty_score":0.4745698,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01113858363807788,"gpt":0.2710627895692351,"spread":0.2599242059311572,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001716932,0.0002155823,0.0003379969,0.0005410785,0.0002292023,0.0001504675,0.001116778,0.0000754741,0.00001011602],"category_scores_gemma":[0.0001759822,0.0001693601,0.0002407493,0.000781956,0.00003531939,0.0007642338,0.00006376403,0.0005641931,0.00001823852],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002535007,"about_ca_system_score_gemma":0.0006642427,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001054183,"about_ca_topic_score_gemma":0.00001001744,"domain_scores_codex":[0.9979672,0.0001359682,0.0005144302,0.000292032,0.0004069064,0.0006834487],"domain_scores_gemma":[0.99853,0.0002685546,0.0004976885,0.0003370658,0.0001893969,0.0001772894],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001210552,0.0001694797,0.000008531168,0.00002582373,0.0001079865,0.00002716076,0.0003821644,0.0111319,0.0008424298,0.9742926,0.0001141835,0.01277672],"study_design_scores_gemma":[0.004127432,0.003860907,0.00001517363,0.00009916298,0.00006656086,0.0005687652,0.00006303538,0.01141439,0.02586295,0.9504758,0.003080255,0.0003656134],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.358295,0.002015085,0.6373891,0.0009659471,0.0004642517,0.0003837496,0.000002723906,0.00009231225,0.0003918495],"genre_scores_gemma":[0.9408439,0.0001767024,0.05758709,0.0005171912,0.0007501636,0.000006282111,0.000001749761,0.0000273813,0.00008952473],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.582549,"threshold_uncertainty_score":0.6906304,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.0262747368548133,"gpt":0.3229007666529536,"spread":0.2966260297981403,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008181944,0.00009433736,0.0002640275,0.00008692993,0.00006153795,0.000007243042,0.0001611256,0.00004712706,0.00003113144],"category_scores_gemma":[0.00015513,0.00005937639,0.0001021063,0.00008891628,0.0001122445,0.000127608,0.00001205707,0.0001115818,8.742459e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002322263,"about_ca_system_score_gemma":0.0001419031,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":9.764931e-7,"about_ca_topic_score_gemma":0.00002696843,"domain_scores_codex":[0.9990504,0.00005862107,0.0004312949,0.00009503431,0.0001159894,0.0002486289],"domain_scores_gemma":[0.9987225,0.0005039587,0.0003905385,0.000163386,0.0001463096,0.00007331843],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001076954,0.0001214067,0.0001919492,0.00001627022,0.00009887463,7.068514e-7,0.0001113406,3.573662e-7,0.01825893,0.9773458,0.0001488889,0.003597792],"study_design_scores_gemma":[0.001080483,0.0007969387,0.00009939147,0.0000612056,0.00009044912,0.00005078833,0.0001172489,0.00002559228,0.01544352,0.9804503,0.001701079,0.00008304485],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9542826,0.000636618,0.04401349,0.0007111652,0.0000301685,0.0001686341,0.00002585049,0.00001025966,0.000121247],"genre_scores_gemma":[0.9948944,0.000249053,0.004624263,0.00002839709,0.0001168515,0.000005257122,0.000001216838,0.00001462128,0.00006587811],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.04061189,"threshold_uncertainty_score":0.2421299,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.009571181560378063,"gpt":0.2247349213410685,"spread":0.2151637397806904,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00107311,0.0001057512,0.0002557517,0.0001195843,0.00006399679,0.00001910675,0.0008082173,0.00004320148,0.0001063271],"category_scores_gemma":[0.00006208951,0.00006522374,0.0001943631,0.0003663472,0.00006098258,0.0002628189,0.00002783634,0.0004015425,0.000007802208],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003624886,"about_ca_system_score_gemma":0.0001210919,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005290186,"about_ca_topic_score_gemma":0.000002961128,"domain_scores_codex":[0.9986548,0.0001480967,0.0004365101,0.0000990878,0.0003761281,0.0002853388],"domain_scores_gemma":[0.9986735,0.0004825663,0.0004263461,0.0002406966,0.0001321005,0.00004479005],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.00006238474,0.0003287804,0.00002779659,0.00003344197,0.0001439898,0.00001266958,0.0008013612,0.0001643276,0.003095847,0.9700114,0.0003413151,0.02497676],"study_design_scores_gemma":[0.002114064,0.006695564,0.0003964622,0.0003111941,0.000145213,0.0007254306,0.0002044167,0.03744994,0.4845326,0.462545,0.004407417,0.0004726406],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8298272,0.005420911,0.1548039,0.005495072,0.0002456059,0.0001833303,0.000005448549,0.00002285792,0.003995667],"genre_scores_gemma":[0.9982907,0.0005258133,0.0008762544,0.00008492572,0.00009242367,5.192466e-7,1.019846e-7,0.000006001005,0.0001232178],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.5074663,"threshold_uncertainty_score":0.2659747,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.004609314179226482,"gpt":0.1954632527866797,"spread":0.1908539386074532,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006312357,0.0001778018,0.0002766642,0.0001350855,0.00007716516,0.00004294277,0.0002545164,0.00008145912,0.00007073084],"category_scores_gemma":[0.00001684046,0.0001568561,0.0002100311,0.0001424772,0.000009863057,0.0001708574,0.000007499185,0.0005783477,0.00002223566],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001005085,"about_ca_system_score_gemma":0.00007698493,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001186418,"about_ca_topic_score_gemma":0.000004676902,"domain_scores_codex":[0.9984638,0.00007467681,0.0005554035,0.00009996263,0.0002649287,0.0005412011],"domain_scores_gemma":[0.9994823,0.00002309204,0.0001517206,0.0001509187,0.00008428039,0.0001076359],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.000215467,0.0002483487,0.0003326811,0.0001058724,0.0009029341,0.0003089245,0.001148994,0.224121,0.6282273,0.03355511,0.001668922,0.1091645],"study_design_scores_gemma":[0.01679121,0.0232641,0.007814016,0.002084903,0.001501172,0.01931321,0.002892391,0.3306748,0.379374,0.151469,0.05815635,0.006664855],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8718038,0.003271146,0.1239167,0.0001366794,0.0004439437,0.00007424275,0.000001576704,0.000070674,0.0002813366],"genre_scores_gemma":[0.998083,0.000243344,0.0005123632,0.0001145047,0.0009467755,8.184757e-7,0.000002238483,0.00002739997,0.00006956883],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2488534,"threshold_uncertainty_score":0.6396407,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.007760726781642667,"gpt":0.2474558132472693,"spread":0.2396950864656266,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001189517,0.0001507249,0.0002523197,0.0001532175,0.0001600884,0.00009216288,0.000722996,0.0000449794,0.00008168888],"category_scores_gemma":[0.00003375565,0.0001168987,0.0001037097,0.0002224092,0.00003794075,0.0008431223,0.0001371147,0.0005058508,0.00003985708],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008389808,"about_ca_system_score_gemma":0.0002196104,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001799162,"about_ca_topic_score_gemma":0.000006496271,"domain_scores_codex":[0.9983855,0.00007868656,0.00046949,0.000174816,0.0003320605,0.0005593908],"domain_scores_gemma":[0.9991578,0.0000662301,0.0002898164,0.0002361674,0.00009866032,0.000151334],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00004106993,0.0001413731,0.0002525855,0.00001504056,0.0001513636,0.00002170534,0.0003689553,0.00008541795,0.0006863726,0.8437355,0.0006579196,0.1538427],"study_design_scores_gemma":[0.007354656,0.003668214,0.002061475,0.0001633643,0.0001290393,0.003725942,0.0001988493,0.07524752,0.01788938,0.3765613,0.5118309,0.001169282],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4396288,0.008160943,0.5444736,0.005518032,0.0003082155,0.0001894898,0.000002849958,0.0000723829,0.001645646],"genre_scores_gemma":[0.974844,0.0004016908,0.02331099,0.0005189441,0.0005328094,0.000001022628,9.440603e-7,0.00001230255,0.0003773136],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5352152,"threshold_uncertainty_score":0.476699,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.006131947615819681,"gpt":0.239668162957194,"spread":0.2335362153413743,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008325288,0.0001047988,0.0002062834,0.0001652859,0.00004799285,0.00002328806,0.000816392,0.00005362943,0.0000330515],"category_scores_gemma":[0.00003144168,0.00008937062,0.0001246903,0.0004241052,0.00002193626,0.0002658085,0.00007924003,0.0003871694,0.0000144209],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005185341,"about_ca_system_score_gemma":0.0004653403,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001254223,"about_ca_topic_score_gemma":0.00002185831,"domain_scores_codex":[0.9985297,0.00002784135,0.0005772805,0.0001310037,0.0003313004,0.0004029052],"domain_scores_gemma":[0.9989045,0.00008444172,0.0003767528,0.0003189848,0.0002230499,0.00009222246],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.00009441924,0.0009674614,0.004642663,0.00006398353,0.0003863865,0.0001397944,0.001359556,0.0002236308,0.1240938,0.764158,0.0007354666,0.1031348],"study_design_scores_gemma":[0.005338651,0.003339862,0.03430804,0.0002691392,0.0002011746,0.002846876,0.0002379644,0.02500522,0.7495871,0.07892952,0.09860589,0.001330577],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3188936,0.0005784763,0.6795733,0.0005182603,0.00007911358,0.00004773524,7.368942e-7,0.00001878397,0.0002900566],"genre_scores_gemma":[0.984918,0.0001032671,0.01444775,0.0002037714,0.0002033685,6.193529e-7,0.000001774374,0.00001100352,0.0001104338],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6852285,"threshold_uncertainty_score":0.3644428,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.007281889495071087,"gpt":0.2452739567139639,"spread":0.2379920672188928,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001435928,0.0001733901,0.0003925212,0.0002353763,0.00009268405,0.00006136099,0.0006466789,0.00008095821,0.0001108821],"category_scores_gemma":[0.0001043504,0.0001458493,0.0001644926,0.0003232647,0.00006739786,0.0005800717,0.0001220246,0.0004732575,0.00005575704],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007996901,"about_ca_system_score_gemma":0.0005093071,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001558863,"about_ca_topic_score_gemma":0.000005775665,"domain_scores_codex":[0.9980082,0.000187132,0.0006984829,0.0002259711,0.000415931,0.0004643012],"domain_scores_gemma":[0.9983803,0.0002812994,0.0005929045,0.0003726473,0.0002529631,0.0001199018],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001031269,0.0002004623,0.0007795915,0.0001036372,0.0002217433,0.00002494547,0.001222446,0.0002097044,0.008657823,0.9790584,0.0001145584,0.009303568],"study_design_scores_gemma":[0.0103939,0.01000195,0.003270319,0.0007386996,0.0003943004,0.002549805,0.001158862,0.2313596,0.05163269,0.6610736,0.02549512,0.001931114],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8223619,0.004666979,0.170794,0.001148315,0.0004647291,0.0002034734,0.000004252997,0.00003350647,0.0003228513],"genre_scores_gemma":[0.9899489,0.0003708848,0.008764385,0.00007998075,0.0001699518,0.000001076844,0.00000176255,0.00001443986,0.000648674],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3179848,"threshold_uncertainty_score":0.5947564,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01930317928901013,"gpt":0.3022171179784197,"spread":0.2829139386894095,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006832349,0.0002610949,0.0004940851,0.0001805598,0.0000805152,0.00003002504,0.0004608187,0.0001036606,0.0001472527],"category_scores_gemma":[0.0006138508,0.0002244577,0.0002498709,0.0001438311,0.00002959949,0.0002754639,0.00004197018,0.001038417,0.00005062479],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003271993,"about_ca_system_score_gemma":0.0003210049,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":2.914045e-7,"about_ca_topic_score_gemma":0.000005325106,"domain_scores_codex":[0.9975999,0.00007720864,0.0008923894,0.0001736048,0.0005536141,0.0007032789],"domain_scores_gemma":[0.9980118,0.0007108391,0.0007236549,0.0003091637,0.0001284738,0.0001161279],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002613953,0.0007621734,0.000142316,0.00008664832,0.0002692757,0.0001354057,0.0009422324,0.00009773506,0.001795414,0.988155,0.0009526722,0.00639974],"study_design_scores_gemma":[0.001616697,0.001902163,0.00005300031,0.0002347174,0.0000980202,0.0006359923,0.00009521958,0.0006415613,0.01816924,0.9746974,0.001538396,0.0003175662],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9747931,0.0002163565,0.02288605,0.0004939151,0.0002896142,0.000135558,0.000001850159,0.0000531521,0.001130376],"genre_scores_gemma":[0.9627195,0.00006667218,0.03526966,0.00025999,0.001385452,0.0000023926,6.333603e-7,0.00007362494,0.0002220432],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01637383,"threshold_uncertainty_score":0.9153119,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.0122187352884379,"gpt":0.2628410734177821,"spread":0.2506223381293441,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008571035,0.0001324334,0.0002295458,0.0001644048,0.00009807923,0.000148697,0.0009431377,0.00006119386,0.00005928189],"category_scores_gemma":[0.0000555901,0.0001070105,0.0001917577,0.0001675932,0.00001823577,0.0009802275,0.00008561289,0.0004054127,0.00002081531],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006068152,"about_ca_system_score_gemma":0.0002637779,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000766211,"about_ca_topic_score_gemma":0.000001884737,"domain_scores_codex":[0.9985827,0.00006794773,0.0004689747,0.0001581928,0.0002344259,0.0004877945],"domain_scores_gemma":[0.9990203,0.0001150284,0.0003142334,0.0002352436,0.0002223559,0.00009286292],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00006044231,0.0002920851,0.0002885087,0.0001252722,0.0002976707,0.00004124935,0.0007916482,0.00002156197,0.02944137,0.6642306,0.002314341,0.3020952],"study_design_scores_gemma":[0.001166032,0.001895066,0.0004249768,0.0001905711,0.00004677838,0.0007444241,0.00008168827,0.01594089,0.205101,0.7603397,0.01352709,0.0005418046],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06653594,0.0006333455,0.9310762,0.001096541,0.0002309303,0.0002050317,8.922771e-7,0.00006668989,0.0001544162],"genre_scores_gemma":[0.9088916,0.0001580113,0.08906771,0.0006169593,0.0009380502,0.00001871618,0.000001419149,0.00002225887,0.0002852403],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8423557,"threshold_uncertainty_score":0.4363762,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.004421461717682794,"gpt":0.2184342975603908,"spread":0.214012835842708,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001265605,0.0001839022,0.0002817541,0.0001640034,0.000126869,0.0001191865,0.0008809999,0.0000944189,0.00006210815],"category_scores_gemma":[0.00008894605,0.0001483566,0.00012696,0.0002129031,0.00004701839,0.000594506,0.0001191764,0.001519504,0.0000149413],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002928278,"about_ca_system_score_gemma":0.0004368302,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005237324,"about_ca_topic_score_gemma":0.00001892085,"domain_scores_codex":[0.9983249,0.00009277455,0.0004823843,0.0002272399,0.0003177197,0.0005550179],"domain_scores_gemma":[0.998985,0.0001027671,0.0003027501,0.0003393409,0.0001137938,0.0001563405],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001332538,0.0002391078,0.0007034578,0.00003477289,0.0001969779,0.0002752794,0.0006764567,0.00001851762,0.0567047,0.8764849,0.0005101897,0.06402235],"study_design_scores_gemma":[0.005507668,0.004592245,0.007712477,0.0001570254,0.0001363241,0.009681186,0.00006190035,0.01424376,0.1028605,0.7948639,0.05871465,0.001468404],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7749723,0.0005663537,0.22104,0.002293993,0.0005450424,0.00007149606,0.000001427877,0.00005110977,0.0004582256],"genre_scores_gemma":[0.9730105,0.0002138914,0.02515705,0.0006609035,0.0007003513,9.552131e-7,8.998883e-7,0.0000181057,0.0002373729],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1980381,"threshold_uncertainty_score":0.6601574,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Victoria","funders":"","keywords":"Mathematics; Positive-definite matrix; Combinatorics; Inequality; Pure mathematics; Eigenvalues and eigenvectors; Mathematical analysis; Physics","retraction":null,"screen_n_in":null,"score":{"opus":0.0381644346963784,"gpt":0.3446024513037973,"spread":0.3064380166074189,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001752004,0.0001510295,0.0004187267,0.00007949433,0.0001148123,0.00003129396,0.0002618476,0.00007612203,0.00005514748],"category_scores_gemma":[0.0009836119,0.0001157911,0.0002545122,0.0001332538,0.00004994391,0.0001134264,0.00003268861,0.000294566,0.00001181415],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007761195,"about_ca_system_score_gemma":0.0001362828,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004240372,"about_ca_topic_score_gemma":0.000007546407,"domain_scores_codex":[0.9983016,0.0001027875,0.0007887962,0.0001252892,0.0002435956,0.0004379401],"domain_scores_gemma":[0.9970079,0.001815238,0.000622272,0.0002042061,0.0002544066,0.00009598664],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00005270408,0.000150233,0.00002255872,0.0001295864,0.00007099441,7.762548e-7,0.0003060798,0.000001615293,0.000473245,0.9964425,0.0006543021,0.001695418],"study_design_scores_gemma":[0.000687742,0.0006517459,0.00002431299,0.00009230155,0.0001264937,0.0001152107,0.0001818755,0.00193098,0.003970052,0.9862662,0.005788591,0.0001645119],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.522395,0.0002923341,0.4746859,0.001188664,0.00007002442,0.0003245225,0.00002790263,0.00003201119,0.0009836169],"genre_scores_gemma":[0.9711416,0.00005788762,0.02771578,0.0001847576,0.0005344442,0.00001953938,0.000004694168,0.00003289706,0.0003084234],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4487466,"threshold_uncertainty_score":0.4721823,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.005698658319957989,"gpt":0.2231411339679574,"spread":0.2174424756479994,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001775336,0.00008140125,0.0001203052,0.00003550165,0.0001552493,0.00004878539,0.0002918636,0.00002577413,0.00001289309],"category_scores_gemma":[0.0002470209,0.00005155605,0.00006047437,0.0001054954,0.00004049266,0.0001329844,0.00002988214,0.0002165522,0.000002778566],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000552202,"about_ca_system_score_gemma":0.0001555712,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":4.926613e-7,"about_ca_topic_score_gemma":6.869317e-7,"domain_scores_codex":[0.9990973,0.0001445308,0.0002231552,0.0001058261,0.0001735326,0.0002556136],"domain_scores_gemma":[0.9987751,0.000746663,0.0001936152,0.000134608,0.0001005241,0.00004953726],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00005636076,0.00002559057,0.000004401948,0.0000049834,0.00002503872,0.000001055343,0.00006726495,0.00001692101,0.0001751761,0.9860992,0.0005025578,0.01302146],"study_design_scores_gemma":[0.001272853,0.002229642,0.0001802005,0.00005507159,0.00002291929,0.000167828,0.00004973873,0.11305,0.002515668,0.859569,0.02071414,0.0001729563],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06057825,0.0004004985,0.9334232,0.005220518,0.0001371523,0.0001356614,0.000008997733,0.00001212459,0.00008360687],"genre_scores_gemma":[0.9967794,0.00006184496,0.00246389,0.0003797914,0.0002160661,0.000004397973,0.000003616077,0.000005463193,0.0000854977],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9362012,"threshold_uncertainty_score":0.2102395,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01586762715091431,"gpt":0.2926576746754576,"spread":0.2767900475245433,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001019556,0.0001919298,0.0003971185,0.0002309972,0.0001344777,0.00002024278,0.0003439918,0.00008112581,0.0001729111],"category_scores_gemma":[0.00009608793,0.0001438585,0.0001847565,0.0004135931,0.000130701,0.0002198617,0.00001326268,0.0005935917,0.00001230882],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006277546,"about_ca_system_score_gemma":0.0002154432,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004756239,"about_ca_topic_score_gemma":0.00003035645,"domain_scores_codex":[0.9983739,0.000161359,0.0004934683,0.0001780298,0.0003532453,0.0004400364],"domain_scores_gemma":[0.9983747,0.0003249214,0.0005500627,0.0004086562,0.0002169637,0.0001246794],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0004289567,0.0007767447,0.001453963,0.0000170172,0.0002083095,0.00001233523,0.0002418847,0.0000143792,0.003547108,0.9924508,0.0001188532,0.0007296595],"study_design_scores_gemma":[0.001116544,0.002367933,0.001556213,0.00007920119,0.0001304401,0.000499459,0.0001898858,0.00007401551,0.01418439,0.9788792,0.0007403971,0.000182288],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9929118,0.0001720525,0.005549201,0.0003200229,0.00003707943,0.0001688143,0.000003611104,0.00002502442,0.0008123657],"genre_scores_gemma":[0.9984138,0.00009517515,0.001115602,0.0001033376,0.0001108014,0.00000494671,0.000001983999,0.000036559,0.0001177639],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01357156,"threshold_uncertainty_score":0.5866379,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01659689781592324,"gpt":0.2962628181128738,"spread":0.2796659202969506,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001228439,0.0001219735,0.0002929479,0.0001156652,0.0001038213,0.00001803549,0.0002549635,0.00005535162,0.00009012365],"category_scores_gemma":[0.0001080723,0.0001016481,0.0002469303,0.0001905108,0.00003800171,0.00007559583,0.00002166092,0.0003628562,0.00002208459],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005062134,"about_ca_system_score_gemma":0.0002183976,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":5.647977e-7,"about_ca_topic_score_gemma":0.000002213505,"domain_scores_codex":[0.9987402,0.00005307875,0.0004999797,0.000118395,0.0001673466,0.0004210289],"domain_scores_gemma":[0.9985402,0.0005782174,0.0004333734,0.0001938106,0.0001880447,0.00006639913],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0000614808,0.00009624209,0.0001223474,0.00003594483,0.0001339887,8.665516e-7,0.0001573842,0.0000204249,0.00358231,0.9946362,0.0005276132,0.0006251504],"study_design_scores_gemma":[0.001151545,0.0005939851,0.0000132057,0.000055107,0.00008325562,0.0001013732,0.0002077595,0.0005550155,0.004288479,0.9851782,0.007642882,0.0001292474],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9295084,0.0005639007,0.06785291,0.0003412135,0.0001324325,0.0004032469,0.000005182435,0.00002720042,0.001165465],"genre_scores_gemma":[0.9910227,0.00004074834,0.008362845,0.0001134154,0.0001795686,0.00000306841,0.000001790614,0.00002506984,0.000250771],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.06151428,"threshold_uncertainty_score":0.4145088,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01815009844258741,"gpt":0.2780404169671313,"spread":0.2598903185245439,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005491076,0.0001209107,0.0003028513,0.0001310426,0.00004694078,0.0000112935,0.0003186244,0.00006345115,0.0004924004],"category_scores_gemma":[0.0001769254,0.00009363944,0.0001908674,0.0002008502,0.00004021003,0.0001425027,0.00002561055,0.0003872795,0.00003774077],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003947832,"about_ca_system_score_gemma":0.000131921,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000981825,"about_ca_topic_score_gemma":0.00001771261,"domain_scores_codex":[0.9986601,0.00007929772,0.0006313962,0.00008995485,0.0002192135,0.0003200648],"domain_scores_gemma":[0.9986514,0.0002514158,0.0005341803,0.0002512166,0.0002361371,0.0000756336],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00004800779,0.0003533703,0.0005102596,0.00005061505,0.000225831,0.000002422452,0.0003233656,0.000006987188,0.03591779,0.9550518,0.002327782,0.00518182],"study_design_scores_gemma":[0.0007217648,0.0005013537,0.001097908,0.00005999771,0.00009648895,0.00008490652,0.0001564814,0.00009902474,0.04082387,0.9546504,0.001574462,0.0001333457],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9900103,0.0002697656,0.007892374,0.0009257695,0.00003921064,0.0001379906,0.000002313441,0.00001635173,0.0007059285],"genre_scores_gemma":[0.9971833,0.00006767827,0.002017646,0.00008137705,0.0001592737,0.000007252405,0.000001475815,0.0000227083,0.0004592928],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.007173,"threshold_uncertainty_score":0.5391439,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01343583303279578,"gpt":0.3008375346143684,"spread":0.2874017015815726,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009767237,0.0001340735,0.000511848,0.0001455693,0.00003524559,0.00001499776,0.0002658452,0.00007957246,0.0001269561],"category_scores_gemma":[0.0004291886,0.000100969,0.0002412645,0.000180886,0.00003198973,0.0001276422,0.00001686372,0.0003541636,0.000008143784],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007031663,"about_ca_system_score_gemma":0.0001912204,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001818367,"about_ca_topic_score_gemma":0.000001351639,"domain_scores_codex":[0.9983314,0.00006234651,0.0008265571,0.0000859063,0.0003350264,0.0003588029],"domain_scores_gemma":[0.9982829,0.0004238684,0.0008332952,0.0001595535,0.0002174912,0.0000828769],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001268943,0.000480654,0.0000281707,0.00005551311,0.0002030835,0.00001724334,0.0003613961,0.000006554269,0.008331208,0.9848144,0.0006901174,0.004884732],"study_design_scores_gemma":[0.0005974919,0.001277908,0.0002048702,0.000139695,0.0001346301,0.0001998857,0.0000723706,0.0006235952,0.01092316,0.9854234,0.0002622166,0.0001408086],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9616063,0.001938954,0.03072011,0.001304466,0.00008083975,0.0001776197,0.000008322833,0.00001651389,0.004146894],"genre_scores_gemma":[0.990979,0.000246417,0.008229159,0.00009610998,0.0002089834,3.215028e-7,8.044048e-7,0.00001510155,0.000224074],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.02937275,"threshold_uncertainty_score":0.4117395,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"","keywords":"Counterexample; Mathematics; Mathematical economics; Calculus (dental); Combinatorics","retraction":null,"screen_n_in":null,"score":{"opus":0.02277754956060874,"gpt":0.2932086477767483,"spread":0.2704310982161396,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001444727,0.0001001088,0.0002921229,0.0001139764,0.00003813376,0.000005444027,0.0001373134,0.00005043025,0.0001302905],"category_scores_gemma":[0.0006313422,0.00006449001,0.00007498745,0.00007141809,0.00005585945,0.0001147683,0.00002266325,0.0001416389,0.00001236526],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001155139,"about_ca_system_score_gemma":0.0001528147,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001606948,"about_ca_topic_score_gemma":0.0000153741,"domain_scores_codex":[0.998919,0.0000956021,0.0004505311,0.00007998516,0.0002211365,0.000233722],"domain_scores_gemma":[0.9988106,0.0004530097,0.0003378276,0.0001468221,0.0001657123,0.00008596884],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002378911,0.0001905657,0.0000947295,0.0001235396,0.0001489044,0.000007103537,0.001747986,9.639498e-7,0.02148949,0.9702623,0.001289581,0.004406888],"study_design_scores_gemma":[0.0009291223,0.001025264,0.00005209387,0.0003983077,0.00008131864,0.0002986643,0.0001338004,0.00001448345,0.009611971,0.9778841,0.009437115,0.0001337875],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9247687,0.0003851935,0.07390673,0.000476376,0.0000694285,0.00008925314,0.000002556711,0.00001062499,0.000291146],"genre_scores_gemma":[0.9932722,0.00007666618,0.005755926,0.00005283673,0.000117413,0.000001052784,1.14319e-7,0.00001915796,0.0007046498],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.06850348,"threshold_uncertainty_score":0.2629826,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.007173415064601761,"gpt":0.2352852694559391,"spread":0.2281118543913373,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005332267,0.0001421846,0.0002158954,0.0002828259,0.0001484831,0.0002303331,0.001051084,0.00005824794,0.00003518457],"category_scores_gemma":[0.0001422687,0.0001247303,0.0001302567,0.0009335973,0.00002062425,0.0009546574,0.0001079926,0.000436335,0.00002695138],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00015019,"about_ca_system_score_gemma":0.0004833869,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003214692,"about_ca_topic_score_gemma":0.000005738674,"domain_scores_codex":[0.9985384,0.00009483917,0.0002759651,0.0001801004,0.0003614606,0.0005491785],"domain_scores_gemma":[0.9989023,0.0001015736,0.0002172514,0.0002929685,0.0002678683,0.0002180514],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0000757607,0.0002391453,0.0003360178,0.000009692952,0.0001885228,0.0002476425,0.001220068,0.002401581,0.004313404,0.9729465,0.002641788,0.01537983],"study_design_scores_gemma":[0.002800272,0.003100259,0.0003117289,0.00009390344,0.0001117847,0.003269527,0.0007084116,0.01725493,0.01513531,0.09415843,0.8620024,0.001053009],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07486405,0.0005151348,0.9172498,0.006369705,0.0004774893,0.00009157487,0.000001715286,0.00005870818,0.0003718295],"genre_scores_gemma":[0.9821038,0.0001954721,0.01319982,0.0001838412,0.0007823027,7.439313e-7,0.000001059024,0.00001566702,0.003517293],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9072397,"threshold_uncertainty_score":0.5086354,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.005177168390815553,"gpt":0.2087259063269829,"spread":0.2035487379361674,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007878557,0.000171481,0.000294207,0.0002961385,0.00009773002,0.0001287234,0.0005313553,0.00005595379,0.00005525911],"category_scores_gemma":[0.00001667671,0.0001374152,0.0001221917,0.0004027473,0.00009253278,0.001077775,0.0001088547,0.0005154577,0.00008359997],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006015832,"about_ca_system_score_gemma":0.0003700599,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002244789,"about_ca_topic_score_gemma":0.00000603327,"domain_scores_codex":[0.998282,0.0001287914,0.000550103,0.0001553059,0.0004029946,0.0004808684],"domain_scores_gemma":[0.9987819,0.0002219757,0.0004033567,0.0001840577,0.0002463287,0.0001623731],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001780252,0.0001169767,0.001359341,0.00004162367,0.0002550726,0.00004959307,0.001689609,0.0004695417,0.0004059891,0.9874798,0.0007647499,0.007189671],"study_design_scores_gemma":[0.005744419,0.007443528,0.01738784,0.0002755321,0.0001096965,0.002687575,0.002056302,0.7029542,0.003776543,0.2396067,0.0168572,0.001100438],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7070327,0.002529258,0.2882726,0.001606338,0.0001954105,0.0001280094,0.000006852425,0.00003411638,0.0001947193],"genre_scores_gemma":[0.9964493,0.0008553092,0.001580189,0.001016358,0.00006677902,7.220092e-7,0.000007217604,0.000009728602,0.00001441203],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.7478731,"threshold_uncertainty_score":0.560363,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.005177168390815553,"gpt":0.2087259063269829,"spread":0.2035487379361674,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007878557,0.000171481,0.000294207,0.0002961385,0.00009773002,0.0001287234,0.0005313553,0.00005595379,0.00005525911],"category_scores_gemma":[0.00001667671,0.0001374152,0.0001221917,0.0004027473,0.00009253278,0.001077775,0.0001088547,0.0005154577,0.00008359997],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006015832,"about_ca_system_score_gemma":0.0003700599,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002244789,"about_ca_topic_score_gemma":0.00000603327,"domain_scores_codex":[0.998282,0.0001287914,0.000550103,0.0001553059,0.0004029946,0.0004808684],"domain_scores_gemma":[0.9987819,0.0002219757,0.0004033567,0.0001840577,0.0002463287,0.0001623731],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001780252,0.0001169767,0.001359341,0.00004162367,0.0002550726,0.00004959307,0.001689609,0.0004695417,0.0004059891,0.9874798,0.0007647499,0.007189671],"study_design_scores_gemma":[0.005744419,0.007443528,0.01738784,0.0002755321,0.0001096965,0.002687575,0.002056302,0.7029542,0.003776543,0.2396067,0.0168572,0.001100438],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7070327,0.002529258,0.2882726,0.001606338,0.0001954105,0.0001280094,0.000006852425,0.00003411638,0.0001947193],"genre_scores_gemma":[0.9964493,0.0008553092,0.001580189,0.001016358,0.00006677902,7.220092e-7,0.000007217604,0.000009728602,0.00001441203],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.7478731,"threshold_uncertainty_score":0.560363,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.006627293534976792,"gpt":0.2326664188329713,"spread":0.2260391252979945,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001141762,0.000120887,0.0002334436,0.0002384769,0.0001897496,0.00005558668,0.0006662053,0.00002370336,0.00001952933],"category_scores_gemma":[0.00002065316,0.0001061573,0.00008452441,0.0005615784,0.00003301767,0.000192656,0.0002368287,0.00105038,8.380387e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001222783,"about_ca_system_score_gemma":0.0002835517,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002551044,"about_ca_topic_score_gemma":0.00001628528,"domain_scores_codex":[0.9983116,0.0002255519,0.0003882888,0.0002050071,0.0003777109,0.0004918479],"domain_scores_gemma":[0.999378,0.0000922604,0.0002267366,0.0001828365,0.0000397362,0.00008049051],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0003020653,0.001056465,0.01782222,0.00005855321,0.0004239551,0.00068346,0.007252079,0.01849418,0.002692351,0.8093308,0.0007420226,0.1411418],"study_design_scores_gemma":[0.002831354,0.002966486,0.0177351,0.00004809789,0.00003093081,0.001791444,0.0002516329,0.7221125,0.001214161,0.2431349,0.007368057,0.0005153005],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9736632,0.003168843,0.02104374,0.00168304,0.0003088417,0.00006434191,9.853203e-7,0.00002549775,0.00004151387],"genre_scores_gemma":[0.9951009,0.00007784818,0.004560978,0.0001464669,0.00008108815,0.00000137045,5.129292e-7,0.000008111117,0.00002278119],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.7036183,"threshold_uncertainty_score":0.4563437,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01003402210757832,"gpt":0.2360596742359388,"spread":0.2260256521283605,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.001795611,0.0005058394,0.0007896764,0.0003500479,0.0001625022,0.0002218752,0.002458966,0.0002353913,0.00003344516],"category_scores_gemma":[0.000044998,0.0004086152,0.0006175171,0.0002274516,0.00006214046,0.0002011051,0.0005941829,0.004226366,0.00001885114],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002899687,"about_ca_system_score_gemma":0.002062262,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004666471,"about_ca_topic_score_gemma":0.00002523187,"domain_scores_codex":[0.9961461,0.0003446455,0.0009047913,0.0004744323,0.000770669,0.001359361],"domain_scores_gemma":[0.9980003,0.0001567268,0.0004709857,0.0007589215,0.0002826045,0.0003304385],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0003897919,0.001679027,0.001149619,0.001007765,0.004900538,0.0008261875,0.05605147,0.1224233,0.002939685,0.06564934,0.006015574,0.7369677],"study_design_scores_gemma":[0.00493053,0.004356159,0.00207025,0.001723671,0.0006811872,0.005767964,0.00008016804,0.4885588,0.01448587,0.4069556,0.06608012,0.004309752],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3777509,0.008321949,0.609058,0.002761,0.00171542,0.0002013798,0.00001211491,0.0001016018,0.00007761798],"genre_scores_gemma":[0.9803851,0.0004811559,0.01666116,0.0003745742,0.001870308,0.000003194025,0.000005961322,0.00005824365,0.0001603256],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.732658,"threshold_uncertainty_score":0.9998366,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01020139141648507,"gpt":0.2765194685385296,"spread":0.2663180771220445,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009303795,0.0001097002,0.0002871635,0.0001080891,0.0001646403,0.0001033703,0.001785457,0.00005123904,0.00005819129],"category_scores_gemma":[0.00008726345,0.00008939843,0.0001692391,0.00009354216,0.00004053491,0.0006015556,0.0001557254,0.0003937805,0.00002286868],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004389261,"about_ca_system_score_gemma":0.0005871283,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000154115,"about_ca_topic_score_gemma":0.00000426671,"domain_scores_codex":[0.998716,0.00006649914,0.0004247682,0.0001225675,0.0003192356,0.0003509541],"domain_scores_gemma":[0.9982716,0.00006059151,0.0008778937,0.0005387251,0.0001333185,0.000117827],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00006954193,0.0001025219,0.0003615247,0.00002261026,0.0001406089,0.00003884863,0.0004035348,0.0001043322,0.003854016,0.9364876,0.001186013,0.05722885],"study_design_scores_gemma":[0.006094642,0.003200389,0.005802321,0.0003410247,0.0001349921,0.0019882,0.00007467069,0.02520748,0.1103415,0.795984,0.05006003,0.0007706989],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1450927,0.002235154,0.8491562,0.001833038,0.0006185799,0.00008060703,9.02192e-7,0.0000204253,0.0009623448],"genre_scores_gemma":[0.9722765,0.0001376042,0.026238,0.00003237852,0.0005492421,1.723754e-7,2.156344e-7,0.000008603374,0.0007572671],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8271838,"threshold_uncertainty_score":0.3645562,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01171144416300346,"gpt":0.2535092736492695,"spread":0.241797829486266,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001342342,0.0001993967,0.0003278622,0.0001408197,0.0001372597,0.0001222984,0.001127833,0.00008402349,0.0001420911],"category_scores_gemma":[0.00005922053,0.0001449177,0.0002134297,0.0002861253,0.00002541383,0.001155309,0.00006910565,0.0006726559,0.00003122013],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001223816,"about_ca_system_score_gemma":0.0004496106,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001947386,"about_ca_topic_score_gemma":0.000003370729,"domain_scores_codex":[0.9979912,0.000213128,0.0004021498,0.0002325304,0.0004726915,0.0006882806],"domain_scores_gemma":[0.9988253,0.0001472219,0.0003702254,0.0003759543,0.000116632,0.0001646829],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0007162644,0.001073053,0.0006636108,0.00003857904,0.0004050094,0.00168815,0.002054937,0.0002129927,0.007982341,0.7362707,0.001425766,0.2474687],"study_design_scores_gemma":[0.008961115,0.030924,0.01485817,0.0007381423,0.0002217089,0.01400992,0.0004003451,0.01959254,0.1457389,0.714183,0.04744957,0.002922479],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2010077,0.000965872,0.7933674,0.00353875,0.0003738252,0.0001110423,0.000002170728,0.00007337924,0.0005597793],"genre_scores_gemma":[0.9943683,0.0001855704,0.003757101,0.0007226524,0.0003526903,5.440468e-7,6.143974e-7,0.00001090863,0.0006016528],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7933605,"threshold_uncertainty_score":0.5909573,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.005878386680850079,"gpt":0.2029667290773395,"spread":0.1970883423964894,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006682444,0.0001541872,0.0003023845,0.0001040496,0.00008510352,0.00001017307,0.000239071,0.00009395081,0.0001090034],"category_scores_gemma":[0.00003055895,0.0001347534,0.0002024451,0.0002048727,0.00005816448,0.0001618856,0.00001300881,0.0006210547,0.00005633263],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001215761,"about_ca_system_score_gemma":0.0001795318,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004525645,"about_ca_topic_score_gemma":0.000006005786,"domain_scores_codex":[0.9986546,0.00009624464,0.0004729827,0.00008707638,0.0002786294,0.0004104754],"domain_scores_gemma":[0.9994545,0.00005190877,0.0001208441,0.0001644397,0.0001015722,0.0001067159],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001549922,0.001105113,0.02227972,0.0005087892,0.004512384,0.001062319,0.01904082,0.01012329,0.0471822,0.8710644,0.01115922,0.0104118],"study_design_scores_gemma":[0.01341541,0.003844266,0.00616909,0.0003633144,0.0003873227,0.01044856,0.001370706,0.004743187,0.05551541,0.6942433,0.2071304,0.002369034],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9912157,0.003939435,0.002635381,0.0000683843,0.001079408,0.00006809474,8.688748e-7,0.00006407523,0.0009286512],"genre_scores_gemma":[0.9986552,0.0002642258,0.00007971512,0.00002895624,0.0008540067,0.000001771788,0.000001207129,0.00003306475,0.00008185428],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1959712,"threshold_uncertainty_score":0.5495083,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.004516494244874784,"gpt":0.2259360139146961,"spread":0.2214195196698213,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005065695,0.0001219088,0.0003771687,0.0000733249,0.00007399292,0.00002838678,0.0001906375,0.00001952603,0.0001081598],"category_scores_gemma":[0.000008020107,0.00007379711,0.0002006568,0.0002875917,0.0001369083,0.0000807812,0.0000589259,0.000403258,6.582819e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001953226,"about_ca_system_score_gemma":0.0002933228,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004076095,"about_ca_topic_score_gemma":0.00003138501,"domain_scores_codex":[0.9988813,0.0001329772,0.0003778339,0.0001114321,0.0002407947,0.0002557017],"domain_scores_gemma":[0.999027,0.0001287832,0.0003628663,0.0001961533,0.0002427814,0.00004242529],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0004731232,0.0003717714,0.05497157,0.00002968169,0.00239239,0.00002353434,0.001266178,0.0002055839,0.002107637,0.9047037,0.0007903058,0.03266446],"study_design_scores_gemma":[0.01392067,0.002337612,0.01536963,0.0005579733,0.002492017,0.0005598905,0.007852834,0.003946336,0.120825,0.8128994,0.01811512,0.001123544],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9792438,0.00423244,0.01513617,0.0004191294,0.00002545462,0.00008003444,0.000002468816,0.000007414275,0.0008531051],"genre_scores_gemma":[0.998733,0.0003675019,0.0005540237,0.0000377857,0.0001850354,0.000002365417,0.000003211808,0.00001299615,0.0001040993],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1187173,"threshold_uncertainty_score":0.3009359,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01551635736667626,"gpt":0.2892207172118638,"spread":0.2737043598451875,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001826785,0.0001410796,0.0002307719,0.00005044055,0.001043307,0.000500656,0.002525258,0.00005058702,0.000009230977],"category_scores_gemma":[0.0004054087,0.00009247145,0.0001836404,0.00007165242,0.0001076096,0.0007626091,0.0001286195,0.0003962727,0.0000165636],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007744661,"about_ca_system_score_gemma":0.0005275219,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002255901,"about_ca_topic_score_gemma":0.000005491728,"domain_scores_codex":[0.998437,0.00008326014,0.0004318806,0.0001768869,0.000272806,0.0005981925],"domain_scores_gemma":[0.9978591,0.0003017029,0.0008911837,0.0006081348,0.0002429951,0.00009693855],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002627083,0.00008508504,0.00003650152,0.00004681904,0.0002078611,0.0000485297,0.0004946025,0.00002837077,0.01115956,0.7585454,0.0001326007,0.2289519],"study_design_scores_gemma":[0.006252121,0.003898709,0.00232017,0.0003506262,0.0001971043,0.001784924,0.0001372659,0.05628112,0.1259955,0.6386066,0.1628771,0.001298688],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2074272,0.002137334,0.7830584,0.005000957,0.001427374,0.0003413723,0.000005040683,0.00004571843,0.000556583],"genre_scores_gemma":[0.9933719,0.0005701001,0.004383866,0.00009676145,0.0008673835,0.000007801378,5.231552e-7,0.0000122688,0.0006893704],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7859447,"threshold_uncertainty_score":0.8024382,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01892941563755844,"gpt":0.2898012331582674,"spread":0.270871817520709,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007979166,0.00009846834,0.0002757123,0.00007088191,0.00006704257,0.000007760435,0.0003087127,0.00004140588,0.0001241752],"category_scores_gemma":[0.0003101052,0.00006417163,0.0002446086,0.0004383125,0.00008542358,0.00005283793,0.00002349999,0.0003913539,0.00000297567],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002347889,"about_ca_system_score_gemma":0.0001821889,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001389409,"about_ca_topic_score_gemma":0.000009103544,"domain_scores_codex":[0.9987503,0.0001271327,0.0005420422,0.00008670409,0.00027638,0.0002174356],"domain_scores_gemma":[0.9978601,0.0009138762,0.0006622132,0.0003058834,0.0002226518,0.00003526977],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00004561168,0.0002205873,0.00009200459,0.00003780388,0.0001263415,0.000002568646,0.0001792296,0.000008508106,0.004167635,0.994462,0.0002981372,0.0003596463],"study_design_scores_gemma":[0.0002313902,0.0001725414,0.0001030401,0.00008017203,0.00008032749,0.00003503666,0.0002236392,0.00002190996,0.06648272,0.9314587,0.001051912,0.00005862738],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9906857,0.002042087,0.005609906,0.0007884076,0.00004625798,0.00008309006,0.000009188756,0.00000610806,0.0007292252],"genre_scores_gemma":[0.9985086,0.0004894457,0.0007329998,0.00003289392,0.00005166411,0.000002717049,9.561052e-7,0.00001363531,0.0001670782],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.06300323,"threshold_uncertainty_score":0.2616843,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"","keywords":"Mathematics; Lambda; Spectrum (functional analysis); Combinatorics; Graph; Order (exchange); Discrete mathematics; Physics; Quantum mechanics","retraction":null,"screen_n_in":null,"score":{"opus":0.01244917080900905,"gpt":0.2699552457101116,"spread":0.2575060749011026,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006833194,0.0001664196,0.000278763,0.00009802693,0.0001782023,0.00002435686,0.0004160053,0.00006477471,0.0001042267],"category_scores_gemma":[0.00009088177,0.0001270272,0.0002006202,0.000265041,0.0001579091,0.0001875936,0.00002463257,0.0004332058,0.00002544096],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000629049,"about_ca_system_score_gemma":0.0001285934,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":9.926745e-7,"about_ca_topic_score_gemma":0.00001438349,"domain_scores_codex":[0.9986067,0.00007701485,0.00047609,0.0001420639,0.0001944435,0.0005036425],"domain_scores_gemma":[0.9988845,0.0002007486,0.0004140032,0.0002981436,0.0001019576,0.0001006386],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00006282396,0.0001381241,0.00006123928,0.000008727087,0.00009912941,0.000002151623,0.000224463,1.601641e-7,0.006172225,0.9891168,0.003622383,0.0004917927],"study_design_scores_gemma":[0.0004234927,0.0004585652,0.00002778645,0.00002566908,0.0000390122,0.0001015456,0.00005360722,0.00004360674,0.04921446,0.9344197,0.01505939,0.0001331754],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9819734,0.001687338,0.0143501,0.001263334,0.0001530934,0.0001443403,0.00001606924,0.00004464408,0.0003677375],"genre_scores_gemma":[0.9976099,0.0002500498,0.0007739505,0.0001572037,0.0007171481,0.000004074475,0.000002350782,0.00003141264,0.0004539312],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.05469709,"threshold_uncertainty_score":0.5180017,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01404714153657207,"gpt":0.3182228234546401,"spread":0.3041756819180681,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000965377,0.0001984628,0.0004378539,0.00009825797,0.00007908214,0.00004064306,0.0003869011,0.0001160306,0.000809239],"category_scores_gemma":[0.0003986727,0.0001506646,0.0002057589,0.0001467746,0.00005930464,0.000145721,0.00005397155,0.0005449998,0.00009202206],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001060133,"about_ca_system_score_gemma":0.0001608623,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004845688,"about_ca_topic_score_gemma":0.00001701153,"domain_scores_codex":[0.9979538,0.00007407067,0.0007886019,0.0001445989,0.0004313932,0.0006075288],"domain_scores_gemma":[0.9985453,0.0002557524,0.0005265579,0.0002641872,0.0002530715,0.0001551299],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0004273791,0.001986787,0.00129941,0.0004330802,0.001575936,0.0001081989,0.001620827,0.000004862886,0.02786541,0.8787981,0.07870563,0.007174371],"study_design_scores_gemma":[0.002430312,0.002645689,0.0001561803,0.000286552,0.0003153024,0.0007192041,0.0001695458,0.01111313,0.009505082,0.9432567,0.02872061,0.0006817319],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9263514,0.0004743729,0.07076035,0.001121055,0.0001889019,0.0001419099,0.00001395547,0.00003406269,0.0009140007],"genre_scores_gemma":[0.9944295,0.0001228137,0.003586703,0.0001796434,0.0004649922,0.000001709083,0.000004225631,0.00005018548,0.001160221],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.06807812,"threshold_uncertainty_score":0.8860599,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.02393692691197507,"gpt":0.3078404321934674,"spread":0.2839035052814923,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.007095041,0.0006380115,0.003152287,0.0002812307,0.0001758356,0.0001612107,0.002270537,0.0002411376,0.00009836497],"category_scores_gemma":[0.0003734888,0.0004629903,0.00228552,0.000877332,0.0000411876,0.0004001919,0.0002000512,0.001697463,0.00005184419],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004556968,"about_ca_system_score_gemma":0.00534274,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":4.925809e-7,"about_ca_topic_score_gemma":8.824485e-7,"domain_scores_codex":[0.9943394,0.001321945,0.002097185,0.0005608078,0.0005796227,0.001101046],"domain_scores_gemma":[0.9956451,0.0008013333,0.002079823,0.000874599,0.0003732784,0.000225854],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.000003358322,0.0001490228,1.499302e-8,0.02541086,0.0007869786,0.00005250203,0.00008685427,0.000003405678,3.579572e-7,0.4158289,0.0006656746,0.5570121],"study_design_scores_gemma":[0.0002908218,0.0006819232,1.198119e-8,0.03767505,0.001366837,0.002077381,0.000005145509,0.0002301017,0.00001086832,0.06344102,0.8937484,0.0004724196],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"review","genre_gemma":"review","genre_scores_codex":[3.067798e-7,0.7879441,0.2102269,0.0002112986,0.0004767232,0.0009868331,0.000005633564,0.00005482546,0.00009340284],"genre_scores_gemma":[8.868081e-7,0.9773512,0.02062979,0.0002284721,0.001200898,0.00006088718,0.00001451947,0.0000709229,0.0004423757],"genre_candidate":"review","genre_consensus":"review","teacher_disagreement_score":0.8930827,"threshold_uncertainty_score":0.9997822,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.006020204244693108,"gpt":0.2303414827337315,"spread":0.2243212784890384,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001028189,0.0001302434,0.0002682271,0.0001672775,0.0000627366,0.00007524982,0.001038348,0.00005317263,0.0001155576],"category_scores_gemma":[0.00001381122,0.000103636,0.0001536357,0.000362842,0.00001724201,0.0006139259,0.00009964483,0.0005018474,0.0003722837],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007354165,"about_ca_system_score_gemma":0.0003262158,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002759985,"about_ca_topic_score_gemma":6.635173e-7,"domain_scores_codex":[0.9985598,0.00007058329,0.0003953378,0.0001620869,0.0003461036,0.0004661074],"domain_scores_gemma":[0.9990199,0.00008572893,0.0003674657,0.0003056339,0.0001266729,0.00009461899],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001270052,0.0003835914,0.001761746,0.00007640048,0.0002886417,0.00009396647,0.001050235,0.001426069,0.009670822,0.9460844,0.002030914,0.03700622],"study_design_scores_gemma":[0.01011148,0.007967032,0.003913139,0.000511144,0.000174944,0.005061192,0.0004548204,0.2910047,0.09498968,0.3916585,0.1920279,0.00212542],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7417164,0.002426708,0.2525235,0.0008289485,0.0009258044,0.0001374246,5.642543e-7,0.00004588076,0.001394781],"genre_scores_gemma":[0.9926441,0.0002432828,0.00595715,0.0001651218,0.000392827,4.907084e-7,5.06701e-7,0.00001089515,0.0005856042],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.5544259,"threshold_uncertainty_score":0.4785078,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Conjecture; Pure mathematics; Type (biology); Calculus (dental); Algebra over a field","retraction":null,"screen_n_in":null,"score":{"opus":0.03405532937974066,"gpt":0.314238939221805,"spread":0.2801836098420644,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003728623,0.00009894376,0.0003660382,0.000084277,0.00004686598,0.00000714615,0.0001932889,0.00005118675,0.0005639094],"category_scores_gemma":[0.000285465,0.00007843092,0.0001803199,0.0001402595,0.00005042149,0.00004979909,0.00001060043,0.0001930593,0.000002674544],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003196687,"about_ca_system_score_gemma":0.0001396883,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":8.761274e-7,"about_ca_topic_score_gemma":0.00001228947,"domain_scores_codex":[0.9987932,0.00002421759,0.0007027187,0.00007113802,0.0002079881,0.0002006884],"domain_scores_gemma":[0.9982454,0.0003564352,0.0008278775,0.0001748126,0.0003557086,0.00003975148],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00002945157,0.0004924147,0.000007997305,0.0002023263,0.0002523674,5.474889e-7,0.0009394242,0.00007271569,0.007146247,0.9715632,0.01736092,0.001932382],"study_design_scores_gemma":[0.002331674,0.001191966,0.000007375198,0.000158154,0.0003866952,0.0001053172,0.0001848257,0.006196103,0.1573162,0.8003375,0.03156523,0.0002189664],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5410991,0.00347606,0.4287623,0.004736971,0.0003790631,0.002541662,0.0001558562,0.00003815814,0.01881089],"genre_scores_gemma":[0.9809571,0.00004834373,0.01734583,0.00001943525,0.0008187132,0.00001024647,0.00000276558,0.00002366153,0.0007739074],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.439858,"threshold_uncertainty_score":0.6174413,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Manitoba","funders":"","keywords":"Mathematics; Combinatorics; Polytope; Bipartite graph; Directed graph; Matrix (chemical analysis); Discrete mathematics; Graph","retraction":null,"screen_n_in":null,"score":{"opus":0.008634904918265188,"gpt":0.2257691117752408,"spread":0.2171342068569757,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000806172,0.0001200201,0.00028411,0.0002240876,0.00002248137,0.00001064472,0.0001973237,0.00005589104,0.00003109208],"category_scores_gemma":[0.0001118223,0.0001098996,0.00009242057,0.000300175,0.00004109703,0.0001222904,0.00001101876,0.0002871584,0.00001946859],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001244527,"about_ca_system_score_gemma":0.0002982949,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003509564,"about_ca_topic_score_gemma":0.000002273819,"domain_scores_codex":[0.9987643,0.00007382793,0.0004741522,0.0000675044,0.0003151355,0.0003050273],"domain_scores_gemma":[0.9992789,0.0001116569,0.0001540904,0.00009723036,0.0002001029,0.0001579948],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00227203,0.0006423597,0.001823716,0.0004861442,0.002783126,0.0001408732,0.0122955,0.3499938,0.03011908,0.5822664,0.00837303,0.008803992],"study_design_scores_gemma":[0.03531226,0.02821459,0.003743652,0.002167328,0.001475021,0.005261508,0.0170322,0.03316931,0.1092676,0.742723,0.01707546,0.004558099],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9770015,0.001974228,0.01914182,0.00002855604,0.001377482,0.0001179814,0.000007450808,0.00003155651,0.0003194106],"genre_scores_gemma":[0.9995005,0.00001409112,0.0001102445,0.000008371766,0.000328554,0.000001613958,0.000001971876,0.00002181192,0.00001290258],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3168244,"threshold_uncertainty_score":0.4481574,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.003844046456734104,"gpt":0.1836140637354046,"spread":0.1797700172786705,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005108415,0.000107312,0.0001413127,0.00006626533,0.0001101702,0.00002759236,0.0002010309,0.00004669976,0.00007090086],"category_scores_gemma":[0.000009631304,0.00004881004,0.00006167958,0.0002061832,0.00005519355,0.0001698352,0.00000679393,0.000396859,0.00005001151],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006268332,"about_ca_system_score_gemma":0.000073396,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004075191,"about_ca_topic_score_gemma":0.00003033965,"domain_scores_codex":[0.9991839,0.00005800524,0.0002225063,0.00006103469,0.000191676,0.00028289],"domain_scores_gemma":[0.9995729,0.000034809,0.0001168709,0.0001239802,0.0001124664,0.00003895455],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.007472498,0.001006219,0.01890034,0.001029039,0.01014578,0.0002822868,0.05784021,0.2135734,0.1126584,0.3217539,0.112584,0.1427539],"study_design_scores_gemma":[0.007995327,0.01497283,0.00611132,0.0009656023,0.001194203,0.007394981,0.006319925,0.2506712,0.05135664,0.02359813,0.6271623,0.002257541],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9653332,0.00426404,0.02708676,0.0003016598,0.0003928961,0.0001391896,7.01174e-7,0.00006141069,0.002420148],"genre_scores_gemma":[0.9986608,0.00009595582,0.00007541841,0.00002940454,0.0007170992,0.000001741718,6.072256e-7,0.000023431,0.0003955266],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.5145783,"threshold_uncertainty_score":0.1990416,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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)","retraction":null,"screen_n_in":null,"score":{"opus":0.01172413002191858,"gpt":0.2574360131315458,"spread":0.2457118831096273,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004172304,0.000117546,0.0002877121,0.0001506683,0.0002627246,0.000007698808,0.0002383062,0.00002319882,0.0002329415],"category_scores_gemma":[0.00002873852,0.0000932498,0.0001876949,0.0003388767,0.0001025133,0.00006724412,0.00003227218,0.0006413151,6.589223e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001045738,"about_ca_system_score_gemma":0.0001948556,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003705738,"about_ca_topic_score_gemma":0.00001516798,"domain_scores_codex":[0.9987451,0.00009346483,0.0004462304,0.00009801563,0.0003078032,0.0003094006],"domain_scores_gemma":[0.9989449,0.000191126,0.0005260356,0.0001816233,0.00009404775,0.00006228264],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001038575,0.0001943389,0.0008399032,0.00001367926,0.0002298007,0.000003040974,0.0003099457,0.0001034127,0.001578844,0.9962025,0.000205866,0.0002147768],"study_design_scores_gemma":[0.000856692,0.0007357923,0.0001137445,0.00002034275,0.0001661963,0.0007941286,0.0008295128,0.00005039564,0.006714884,0.9889814,0.0006272244,0.0001097102],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9845831,0.0001854925,0.01418286,0.0001983898,0.00006525934,0.0001380873,0.000009627551,0.00001726278,0.0006199487],"genre_scores_gemma":[0.997692,0.00003349185,0.002083777,0.00002295748,0.00003723321,0.0000112298,0.000002255523,0.00002093584,0.00009613139],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01310892,"threshold_uncertainty_score":0.3802617,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"","keywords":"Mathematics; Column (typography); Combinatorics; Row and column spaces; Pure mathematics; Row; Geometry","retraction":null,"screen_n_in":null,"score":{"opus":0.004411372928628116,"gpt":0.2132674639566128,"spread":0.2088560910279847,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000805562,0.0001322911,0.000216884,0.0001226871,0.0001225583,0.00008619649,0.0003692793,0.00004048688,0.00003167598],"category_scores_gemma":[0.00007152366,0.00009482019,0.00005425361,0.0003223887,0.00005083159,0.000376898,0.00002676163,0.0004343171,0.00001268182],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005968538,"about_ca_system_score_gemma":0.0003014496,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001989972,"about_ca_topic_score_gemma":0.000005131058,"domain_scores_codex":[0.9987686,0.0001622339,0.0002362952,0.0001695023,0.0002853649,0.0003780142],"domain_scores_gemma":[0.9991446,0.0001925902,0.0002703704,0.0001698761,0.000117051,0.0001055358],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001130607,0.0001246288,0.0001484698,0.00001303185,0.0001369904,0.00008452467,0.0006685677,0.0002256149,0.0001516337,0.9923838,0.0002662172,0.0056834],"study_design_scores_gemma":[0.007615839,0.01829702,0.0006680175,0.0003676419,0.0001585852,0.005187397,0.0006600672,0.01178969,0.03736006,0.8818084,0.0348524,0.001234864],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5894926,0.004189568,0.4010375,0.001813947,0.0002639498,0.0002288597,0.000001825331,0.00004992987,0.002921805],"genre_scores_gemma":[0.9883641,0.0001791369,0.01081883,0.0001848759,0.0001056511,0.000001258906,1.860191e-7,0.00001104756,0.0003349295],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3988715,"threshold_uncertainty_score":0.3866655,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01069456974582181,"gpt":0.2414133596075434,"spread":0.2307187898617216,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001035497,0.0001110403,0.000187017,0.00006103126,0.00006345264,0.00003735908,0.0002573196,0.00004341036,0.00001332632],"category_scores_gemma":[0.00004401262,0.00007204124,0.0002158299,0.000135,0.00004227384,0.00009373766,0.00000817495,0.0003073257,0.000006569951],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006725268,"about_ca_system_score_gemma":0.0001202858,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002365619,"about_ca_topic_score_gemma":0.00001087634,"domain_scores_codex":[0.9989647,0.00005093747,0.0004150244,0.00007074525,0.0001639506,0.0003346629],"domain_scores_gemma":[0.9993747,0.0003153988,0.00007955359,0.0001217668,0.00006753472,0.00004096913],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0006233277,0.0001613244,0.0009367482,0.002834424,0.005869777,0.0001607138,0.005860955,0.01384856,0.1575688,0.4793502,0.00828818,0.324497],"study_design_scores_gemma":[0.002018496,0.004063659,0.0004642959,0.001942174,0.0007138969,0.001524436,0.001220438,0.212166,0.144388,0.3605101,0.2698282,0.001160232],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8155,0.04755835,0.1346877,0.0002981911,0.001270903,0.0002743352,0.00002499844,0.00009587649,0.0002896203],"genre_scores_gemma":[0.9989943,0.0004289288,0.00004769956,0.000008749616,0.0003693876,0.000006424974,0.000001599521,0.00002974107,0.0001131765],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3233368,"threshold_uncertainty_score":0.2937756,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01916548802401304,"gpt":0.2461088728421662,"spread":0.2269433848181532,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008344372,0.0001738771,0.0004528526,0.0001382844,0.00008847653,0.0000680466,0.001271236,0.00008414794,0.0000791233],"category_scores_gemma":[0.0002269461,0.0001567053,0.0002465521,0.0006058048,0.00004424861,0.0005844176,0.0002521474,0.0007345124,0.00002301261],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001378338,"about_ca_system_score_gemma":0.001012208,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001519391,"about_ca_topic_score_gemma":0.000007599469,"domain_scores_codex":[0.9975124,0.0002118296,0.0008761224,0.0002690326,0.0006033572,0.0005272359],"domain_scores_gemma":[0.9981108,0.0003176688,0.0006352332,0.0003216015,0.0004137567,0.0002009876],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"observational","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0003502677,0.002308273,0.3359883,0.0005553763,0.003710605,0.000376681,0.01123172,0.04138415,0.02739424,0.2709565,0.006430777,0.2993132],"study_design_scores_gemma":[0.01090478,0.02518673,0.2491524,0.0005094957,0.001055259,0.0008142991,0.0007284827,0.2547109,0.09846841,0.3154265,0.03968075,0.003362028],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1725159,0.0006520406,0.8223116,0.004127252,0.000132133,0.0001052949,0.000005366832,0.00004291653,0.0001075036],"genre_scores_gemma":[0.9690533,0.00005232673,0.03015012,0.00016052,0.00052662,7.921774e-7,0.000002267877,0.00001578182,0.00003826751],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7965374,"threshold_uncertainty_score":0.6390257,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.009089055789342236,"gpt":0.2390409106195781,"spread":0.2299518548302358,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006053651,0.0001066118,0.0001563344,0.0001033832,0.0002023477,0.00008309754,0.0004760099,0.00004409816,0.0000157271],"category_scores_gemma":[0.00003955953,0.00006853629,0.0000972991,0.0002736477,0.00005616609,0.0004140903,0.00009461741,0.000491833,0.00001105914],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006470746,"about_ca_system_score_gemma":0.0002309751,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000122806,"about_ca_topic_score_gemma":0.000008565221,"domain_scores_codex":[0.9989602,0.00008289286,0.0002634349,0.0001248315,0.0002349309,0.000333706],"domain_scores_gemma":[0.9993126,0.00009726475,0.0002034956,0.0002152677,0.0000741852,0.00009712062],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00007612353,0.0002153789,0.00009576749,0.00002831294,0.000230102,0.001228335,0.00309512,0.000265083,0.002289646,0.9547698,0.0001143654,0.03759195],"study_design_scores_gemma":[0.005500307,0.00347803,0.0003477337,0.0001725948,0.00014396,0.04999362,0.0006987216,0.007326797,0.03278183,0.885684,0.0131244,0.0007480094],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8004881,0.004216986,0.1917031,0.003248122,0.0001796027,0.00008655674,0.000001172232,0.00002581592,0.00005052633],"genre_scores_gemma":[0.9947856,0.0004526274,0.004286158,0.0001886189,0.0002136722,4.474774e-7,1.542214e-7,0.000006735081,0.00006596812],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1942975,"threshold_uncertainty_score":0.2794829,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"York University; New York University Abu Dhabi","keywords":"Mathematics; Pure mathematics; Nilpotent; Combinatorics","retraction":null,"screen_n_in":null,"score":{"opus":0.02636323170515554,"gpt":0.3236923029690093,"spread":0.2973290712638538,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001086264,0.0002035667,0.0003978697,0.0004428859,0.0001355479,0.00002236063,0.0003483534,0.0001065735,0.000291193],"category_scores_gemma":[0.001987029,0.0001689727,0.000225204,0.0007962644,0.00007498713,0.0001728816,0.00007350433,0.0009326444,0.0003174582],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002037237,"about_ca_system_score_gemma":0.0003824689,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":4.894993e-7,"about_ca_topic_score_gemma":0.000001737984,"domain_scores_codex":[0.9975672,0.00008904721,0.0006727638,0.0001851135,0.0007511707,0.0007346419],"domain_scores_gemma":[0.9977641,0.001186689,0.0004348598,0.0002889676,0.0002024714,0.0001229152],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001787648,0.0001623719,0.00004692256,0.00002762088,0.0001726633,0.00008983526,0.0001745117,0.0002895486,0.0008383158,0.9894125,0.007326593,0.001280277],"study_design_scores_gemma":[0.0009226534,0.0007456067,0.00006185634,0.00008106226,0.00003949493,0.0001225562,0.0000533558,0.0003267391,0.01719216,0.975604,0.004665832,0.0001846943],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9929942,0.0003429233,0.004267995,0.001202792,0.0006191533,0.000116093,0.000003689809,0.0001072195,0.0003459136],"genre_scores_gemma":[0.9935932,0.0001285444,0.003260995,0.0002779085,0.001043346,0.00000352317,0.000003899363,0.00006552869,0.001623033],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01635384,"threshold_uncertainty_score":0.6890507,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.0148308933049452,"gpt":0.2399943240081684,"spread":0.2251634307032233,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001338564,0.0001535707,0.0002646126,0.00003445231,0.00008426236,0.00002976311,0.00019894,0.00002377596,0.0004144574],"category_scores_gemma":[0.00002601329,0.0001020748,0.0001155473,0.0001261322,0.00002454771,0.0001032526,0.0000183643,0.00047821,0.00007263922],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002339144,"about_ca_system_score_gemma":0.0001653569,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001345562,"about_ca_topic_score_gemma":5.493754e-7,"domain_scores_codex":[0.9988244,0.00003546225,0.000282106,0.0001447244,0.0003032737,0.0004100012],"domain_scores_gemma":[0.9993339,0.000124882,0.0002005827,0.00007987521,0.00008894682,0.0001718829],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002290019,0.00009873954,0.0006497455,0.000006242701,0.0002425182,0.00001223767,0.0001898372,0.0007840513,0.0004552429,0.9939167,0.0003059034,0.003109745],"study_design_scores_gemma":[0.004467233,0.01683932,0.0003444477,0.000228962,0.000499623,0.00002655174,0.0009928895,0.1094318,0.04112176,0.8019931,0.02293184,0.001122473],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5403102,0.001201515,0.4519053,0.005829218,0.0003199008,0.0001347493,0.00002710737,0.00002201423,0.0002500407],"genre_scores_gemma":[0.9971668,0.00009431838,0.0006453886,0.0003630099,0.001682434,0.000001169769,0.000003584961,0.00002046375,0.00002287057],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4568566,"threshold_uncertainty_score":0.4538018,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.0769601161696527,"gpt":0.3615968840672221,"spread":0.2846367678975694,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001471747,0.0001272074,0.0003177944,0.0000769509,0.0001007289,0.00002117441,0.0001751093,0.00006934395,0.00009186142],"category_scores_gemma":[0.0004896697,0.000100083,0.0001738775,0.00009462456,0.00003523662,0.0003183148,0.00002041827,0.0002038999,0.00001337834],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000088054,"about_ca_system_score_gemma":0.0001285824,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001623847,"about_ca_topic_score_gemma":7.869547e-7,"domain_scores_codex":[0.9984012,0.00006305784,0.0007003086,0.00006873954,0.0002416425,0.0005250301],"domain_scores_gemma":[0.998299,0.0007828243,0.0004550064,0.0001614189,0.0001944856,0.0001072709],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001856077,0.0001525331,0.00003162062,0.0001085652,0.00007828321,9.451431e-8,0.0006984593,0.000001662465,0.0004447658,0.9966121,0.00156014,0.0002932266],"study_design_scores_gemma":[0.0004211139,0.000194326,0.000008048401,0.0000342597,0.00009455397,0.00003110975,0.0006694634,0.0001597494,0.005499872,0.9799156,0.0128464,0.0001255272],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4773458,0.00565041,0.512628,0.001951517,0.000438415,0.000697938,0.00003370969,0.00008060788,0.001173595],"genre_scores_gemma":[0.9748275,0.0002431376,0.02064103,0.0002046149,0.002868153,0.00003266482,0.000009101575,0.00004499431,0.001128809],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.4974817,"threshold_uncertainty_score":0.4081267,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.04031225265795369,"gpt":0.2748174595637456,"spread":0.2345052069057919,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002005396,0.0001064074,0.0003479953,0.00004253835,0.00003068252,0.000009811572,0.0001875273,0.00004376329,0.00008134757],"category_scores_gemma":[0.0002603655,0.00007502755,0.0001665166,0.0001165115,0.00002578637,0.0001075331,0.00002227508,0.0003177109,0.000006130408],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005565393,"about_ca_system_score_gemma":0.0001488564,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004908695,"about_ca_topic_score_gemma":0.000007052092,"domain_scores_codex":[0.9986824,0.00006401173,0.0006169555,0.00008454324,0.0002839662,0.0002680859],"domain_scores_gemma":[0.9991748,0.00006380948,0.0004401784,0.00009247503,0.0001367881,0.0000919965],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0008872005,0.0009086588,0.002070151,0.0009677707,0.000994782,0.00003500485,0.004461439,0.0009435934,0.2325035,0.7477937,0.0003675228,0.008066664],"study_design_scores_gemma":[0.006814142,0.008739012,0.0007809685,0.001131253,0.0006781136,0.0003250167,0.002465391,0.03937652,0.2875076,0.648816,0.002181217,0.001184682],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7531012,0.000471426,0.2457037,0.0005017438,0.00005200856,0.00009260736,0.000002357411,0.00001256759,0.00006239705],"genre_scores_gemma":[0.9980751,0.00005228518,0.001382463,0.00004532303,0.0003700301,0.000001000976,6.916962e-7,0.00001886061,0.00005418954],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2449739,"threshold_uncertainty_score":0.3059535,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01730565988439972,"gpt":0.2892703387843755,"spread":0.2719646788999758,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.001088781,0.0003555505,0.0006384969,0.0002818982,0.0001006755,0.00005243244,0.0006838714,0.0002421568,0.0002015765],"category_scores_gemma":[0.0001112083,0.0002563648,0.0003804135,0.0002023561,0.00007095784,0.00007930655,0.0001235138,0.00259689,0.00007400139],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001483774,"about_ca_system_score_gemma":0.001130764,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001218423,"about_ca_topic_score_gemma":0.000005849201,"domain_scores_codex":[0.9977012,0.0001392453,0.0007018602,0.0002914759,0.0006273708,0.0005388132],"domain_scores_gemma":[0.9970576,0.0007896185,0.001245416,0.0005138296,0.0002774354,0.0001161254],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0003379962,0.0003194836,0.0001325094,0.0001256232,0.0005372229,0.0000153909,0.0001175702,0.0008708696,0.00005384255,0.9953526,0.001716353,0.0004205512],"study_design_scores_gemma":[0.000659968,0.0007562721,0.00008545059,0.0003409609,0.00028294,0.0002227977,0.00002720385,0.0001116193,0.0005439297,0.9947692,0.001911496,0.0002881192],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9702973,0.001300331,0.02592585,0.0006135521,0.0002255243,0.0003853386,0.00002994761,0.00003986263,0.001182265],"genre_scores_gemma":[0.9950666,0.0003797883,0.003279692,0.000129975,0.0004695084,0.00001551362,0.00001643947,0.0000722412,0.0005701773],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.02476934,"threshold_uncertainty_score":0.9999889,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.005074375965425664,"gpt":0.2226241788874837,"spread":0.2175498029220581,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009759912,0.0001363381,0.0002267953,0.0001238255,0.0001085808,0.00005318003,0.0006151245,0.0000598299,0.00002692038],"category_scores_gemma":[0.0001112672,0.00008635002,0.0001075025,0.0002022361,0.00004909117,0.0007955092,0.0001682124,0.0002787535,0.00002298322],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007500115,"about_ca_system_score_gemma":0.0002722943,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004790254,"about_ca_topic_score_gemma":0.000003375263,"domain_scores_codex":[0.9986069,0.0001417588,0.0003241022,0.0001933248,0.0002981871,0.0004357357],"domain_scores_gemma":[0.9989166,0.0002437866,0.0002851896,0.0002165269,0.0001981165,0.0001397378],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0003612658,0.0002241076,0.0009389134,0.00003660848,0.0004658009,0.0002855399,0.0009039256,0.00003343834,0.01348709,0.8955585,0.0006128286,0.08709192],"study_design_scores_gemma":[0.01073589,0.009631678,0.01111166,0.0007781462,0.0003161613,0.009059041,0.000221594,0.0172545,0.2453652,0.6719216,0.02154276,0.002061848],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5977355,0.002381603,0.396055,0.003135551,0.0002279117,0.00009489746,0.000002500485,0.00004042076,0.0003266287],"genre_scores_gemma":[0.9890471,0.0007094077,0.009184613,0.0001401713,0.0003829097,5.41719e-7,2.139471e-7,0.00001040701,0.0005246997],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3913115,"threshold_uncertainty_score":0.3521252,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.00785242508233393,"gpt":0.2301340927890284,"spread":0.2222816677066945,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001436461,0.0001126005,0.0002629357,0.000628933,0.00006669155,0.0000374563,0.0006313352,0.00004734754,0.00001075139],"category_scores_gemma":[0.00007595959,0.0000801739,0.0001258038,0.001799193,0.00004245306,0.000305876,0.0001152344,0.0003263393,0.00001024485],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001967128,"about_ca_system_score_gemma":0.0001641792,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002933543,"about_ca_topic_score_gemma":7.935079e-7,"domain_scores_codex":[0.9987919,0.00009474772,0.0003852406,0.0001317266,0.0002214695,0.000374954],"domain_scores_gemma":[0.9989972,0.0002771791,0.0003429359,0.0001922187,0.0001108551,0.00007959063],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00003319111,0.00007034403,0.0003377476,0.00005116111,0.0001752649,0.00003066849,0.0006009506,0.00008867729,0.001591748,0.9223669,0.0003911722,0.07426217],"study_design_scores_gemma":[0.0013286,0.001700034,0.001812449,0.00009966132,0.00004666331,0.0008021188,0.000260921,0.03267924,0.02708903,0.9271798,0.00664553,0.0003559523],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9159669,0.01297809,0.06928753,0.0008134365,0.0003801244,0.00009503093,0.000002511503,0.00006984619,0.0004065284],"genre_scores_gemma":[0.9957037,0.00243537,0.001577089,0.0000412138,0.0001287621,5.615188e-7,4.445226e-7,0.0000084864,0.0001043946],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.07973678,"threshold_uncertainty_score":0.3269397,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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)","retraction":null,"screen_n_in":null,"score":{"opus":0.01178396853799472,"gpt":0.3009380608544846,"spread":0.2891540923164899,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003425178,0.0002592981,0.0007584525,0.0001726069,0.0003846698,0.00009161953,0.001085497,0.0001383858,0.0002011903],"category_scores_gemma":[0.001216066,0.0001897266,0.0006533898,0.0006458001,0.0003459463,0.0002961389,0.0001824289,0.0007180751,0.000004542311],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001113721,"about_ca_system_score_gemma":0.003502035,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001538561,"about_ca_topic_score_gemma":0.000004978064,"domain_scores_codex":[0.9965607,0.0004008798,0.001699625,0.0002372882,0.000501478,0.0006000591],"domain_scores_gemma":[0.9932148,0.003492618,0.001530767,0.0005290582,0.001153835,0.00007890653],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002799526,0.0003412351,0.0001609737,0.000138161,0.0007328706,0.000003729674,0.0005479184,0.0002260262,0.0003323148,0.9933494,0.0004984528,0.003388999],"study_design_scores_gemma":[0.002880893,0.0009617744,0.0001343115,0.0002517358,0.0005613741,0.0001785945,0.0001547,0.02987364,0.01851882,0.9431879,0.003102671,0.0001936047],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08834331,0.01722133,0.8820915,0.005023738,0.005618607,0.0009044532,0.00005353151,0.00001717101,0.0007263842],"genre_scores_gemma":[0.9935418,0.0005118177,0.004739612,0.00006858056,0.0006867115,0.000005892533,8.176881e-7,0.0000150168,0.0004297274],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9051985,"threshold_uncertainty_score":0.7736827,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Redeemer University","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Mathematics; Multiplicity (mathematics); Property (philosophy); Sign (mathematics); Pure mathematics; Mathematical analysis","retraction":null,"screen_n_in":null,"score":{"opus":0.01056734267213175,"gpt":0.2640629811688472,"spread":0.2534956384967154,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001150673,0.0001030575,0.0001505363,0.0002131373,0.000324153,0.0001283206,0.0006970115,0.00003982268,0.000001854542],"category_scores_gemma":[0.0002313881,0.00005849748,0.0001443695,0.0006688276,0.00001561414,0.0002634508,0.00007455196,0.0002936118,0.000002900863],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001393101,"about_ca_system_score_gemma":0.0007346069,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005585899,"about_ca_topic_score_gemma":0.00001552009,"domain_scores_codex":[0.9987683,0.00006721645,0.0003924227,0.0001524784,0.0002498884,0.0003697336],"domain_scores_gemma":[0.9986453,0.0004448425,0.0002292644,0.0001907715,0.0004432267,0.00004659012],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001465855,0.0002321669,0.0006459241,0.00004055061,0.0003351564,0.000003746106,0.0002022445,0.01066311,0.002046304,0.3661861,0.00383838,0.6156598],"study_design_scores_gemma":[0.002871674,0.001596791,0.005965448,0.00008497149,0.00007152731,0.00007063399,0.00007726863,0.8333451,0.02579501,0.04972259,0.08006442,0.0003345342],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03464128,0.0009542272,0.9608786,0.002718284,0.0004441193,0.0002276268,0.000001049214,0.00001345359,0.00012136],"genre_scores_gemma":[0.9920145,0.0001348602,0.006301102,0.000238551,0.0003216385,0.00001041535,0.000001662134,0.00000555849,0.0009717593],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9573731,"threshold_uncertainty_score":0.2493156,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}