{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":635,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":635,"direct_label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline (scores rank; they never assert a category)","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12","author_layer_release":"2026-06-26"},"query_hash":"92ea8d48ac1b","filters":{"venue":"Linear Algebra and its Applications"}},"results":[{"id":"W2062331061","doi":"10.1016/j.laa.2014.06.010","title":"Distance spectra of graphs: A survey","year":2014,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Graph theory and applications","field":"Mathematics","cited_by":299,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Distance matrix; Mathematics; Distance matrices in phylogeny; Eigenvalues and eigenvectors; Combinatorics; Resistance distance; Characteristic polynomial; Matrix (chemical analysis); Graph; Degree matrix; Adjacency matrix; Discrete mathematics; Polynomial; Line graph; Graph power; Mathematical analysis","authors":[{"name":"Mustapha Aouchiche","is_ca":true},{"name":"Pierre Hansen","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02885101857384469,"gpt":0.2921779012327856,"spread":0.2633268826589409,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001397239,0.001035271,0.001937282,0.007074636,0.001285238,0.004299067,0.002016588,0.001548915,0.003935435],"category_scores_gemma":[0.004642009,0.0008910971,0.0009685341,0.01090574,0.003029363,0.009552639,0.002583016,0.003008819,0.001222132],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001722193,"about_ca_system_score_gemma":0.001110465,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008932772,"about_ca_topic_score_gemma":0.0006967364,"domain_scores_codex":[0.9986198,0.000309474,0.0001055192,0.0004393269,0.0004324343,0.00009348386],"domain_scores_gemma":[0.9963014,0.002394361,0.0002521562,0.0003560934,0.0004708629,0.0002250091],"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.0000651865,0.0002035343,0.001826097,0.002165581,0.00008208391,0.00009741665,0.0004948837,0.003799551,0.001247048,0.716114,0.009480393,0.2644242],"study_design_scores_gemma":[0.00001561259,0.00007336511,0.001302379,0.0003586676,0.00003344981,0.0007514995,0.0003899031,0.008855128,0.0007523249,0.9204647,0.06695273,0.00005019932],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"review","genre_gemma":"review","genre_scores_codex":[0.04905026,0.6081448,0.2704739,0.006576986,0.001197091,0.00008390876,0.0009019339,0.0004317352,0.06313941],"genre_scores_gemma":[0.3673087,0.4847443,0.1273601,0.002466898,0.006705242,0.0001735856,0.00158188,0.0003116435,0.009347705],"genre_candidate":"review","genre_consensus":"review","teacher_disagreement_score":0.007074636,"threshold_uncertainty_score":0.0131653,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1974200742","doi":"10.1016/j.laa.2005.08.025","title":"Riemannian geometry and matrix geometric means","year":2005,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Mathematical Inequalities and Applications","field":"Mathematics","cited_by":259,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Guelph","funders":"","keywords":"Mathematics; Positive-definite matrix; Geometric mean; Geodesic; Weighted geometric mean; Metric (unit); Matrix (chemical analysis); Geometric analysis; Pure mathematics; Combinatorics; Geometry; Mathematical analysis","authors":[{"name":"Rajendra Bhatia","is_ca":false},{"name":"John Holbrook","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04168788145956998,"gpt":0.3341769787668663,"spread":0.2924890973072963,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000975205,0.001132761,0.001206383,0.002557424,0.001163378,0.003241363,0.00098518,0.001902637,0.006331753],"category_scores_gemma":[0.003432363,0.0004648677,0.0007604634,0.002362476,0.00412903,0.004660637,0.001569246,0.003502192,0.0009031404],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001504813,"about_ca_system_score_gemma":0.0006543005,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002103554,"about_ca_topic_score_gemma":0.001970221,"domain_scores_codex":[0.9994233,0.000228419,0.00002783902,0.0001314619,0.0001411258,0.00004775988],"domain_scores_gemma":[0.9980019,0.00104147,0.0003743386,0.0001431017,0.0003047034,0.0001345255],"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.000005296913,0.000004977266,0.00007219217,0.00002327934,0.000006427806,0.0000202452,0.00007447193,0.0006721476,0.0001431398,0.995293,0.001150121,0.002534667],"study_design_scores_gemma":[0.000002758085,0.000006370673,0.0001600226,0.000007393219,0.000003955814,0.00003349752,0.00002669825,0.002464158,0.00004421394,0.9929069,0.004337089,0.000006861806],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1963059,0.08126328,0.5143373,0.03679474,0.002958735,0.00005273132,0.001207543,0.0003474878,0.1667323],"genre_scores_gemma":[0.867965,0.02951881,0.05106424,0.002593006,0.005978643,0.0001593574,0.0006783059,0.000148833,0.04189379],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006331753,"threshold_uncertainty_score":0.02118176,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2031324894","doi":"10.1016/j.laa.2013.02.030","title":"Two Laplacians for the distance matrix of a graph","year":2013,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Graph theory and applications","field":"Mathematics","cited_by":252,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Algebraic connectivity; Resistance distance; Mathematics; Laplacian matrix; Distance matrix; Combinatorics; Laplace operator; Eigenvalues and eigenvectors; Connectivity; Graph; Discrete mathematics; Line graph; Mathematical analysis; Graph power; Physics","authors":[{"name":"Mustapha Aouchiche","is_ca":true},{"name":"Pierre Hansen","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02218523395327058,"gpt":0.3144036897424108,"spread":0.2922184557891402,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009666018,0.0009492094,0.0006570228,0.003520368,0.0009526409,0.002853622,0.001711734,0.002372893,0.01147221],"category_scores_gemma":[0.004617556,0.0003131948,0.0009256958,0.001522322,0.002625006,0.003796356,0.00154603,0.003078977,0.001967136],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001154948,"about_ca_system_score_gemma":0.0006411279,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008660982,"about_ca_topic_score_gemma":0.001012274,"domain_scores_codex":[0.9989734,0.0003080707,0.00005633352,0.0002783569,0.0002829022,0.0001009581],"domain_scores_gemma":[0.9976543,0.0009913616,0.000297955,0.0002246426,0.00046609,0.0003657688],"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.00002730559,0.00003201924,0.000155516,0.00005165138,0.00001112176,0.00008422778,0.0002717263,0.001469988,0.002312043,0.9793601,0.003323952,0.01290052],"study_design_scores_gemma":[0.00001028732,0.00002627986,0.0003485849,0.00002060899,0.00000876629,0.0003033776,0.0001776751,0.02051905,0.0006594414,0.9699724,0.007901069,0.00005250638],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.092861,0.002758989,0.8432184,0.007369868,0.002242291,0.0001111032,0.001023879,0.0005354827,0.04987887],"genre_scores_gemma":[0.7005479,0.002763599,0.2151362,0.002355644,0.002230606,0.00034381,0.001173581,0.0005733624,0.07487538],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01147221,"threshold_uncertainty_score":0.0383783,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2056415888","doi":"10.1016/j.laa.2007.05.036","title":"The minimum rank of symmetric matrices described by a graph: A survey","year":2007,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Graph theory and applications","field":"Mathematics","cited_by":244,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Regina","funders":"","keywords":"Mathematics; Combinatorics; Rank (graph theory); Graph; Simple graph; Discrete mathematics","authors":[{"name":"Shaun Fallat","is_ca":true},{"name":"Leslie Hogben","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03118969790938455,"gpt":0.3016897495124434,"spread":0.2705000516030588,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001750522,0.001344611,0.002640265,0.004517484,0.0009307395,0.004460299,0.002380486,0.002106996,0.003472058],"category_scores_gemma":[0.007803333,0.001158278,0.00118939,0.007267204,0.002521747,0.008386716,0.001463609,0.002383281,0.00108753],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001032569,"about_ca_system_score_gemma":0.001143436,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007733075,"about_ca_topic_score_gemma":0.0009233174,"domain_scores_codex":[0.9976993,0.0006482405,0.0001795439,0.0007285479,0.0005741833,0.0001701031],"domain_scores_gemma":[0.9924949,0.005222043,0.0006889732,0.0006837316,0.0006390793,0.0002711849],"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.0002368918,0.0002802469,0.004033891,0.004052335,0.0002491498,0.0001998359,0.0004971267,0.02651401,0.003117089,0.6439624,0.01848635,0.2983707],"study_design_scores_gemma":[0.00003124863,0.0001332458,0.001194557,0.0002205913,0.00006843192,0.0006240977,0.0002684123,0.03346081,0.001362225,0.942946,0.0196199,0.00007059093],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"review","genre_scores_codex":[0.1515607,0.2718756,0.5042764,0.008635337,0.00121189,0.0001231652,0.002975381,0.0007499256,0.05859154],"genre_scores_gemma":[0.6203633,0.1896487,0.1687053,0.001500795,0.007493878,0.0001796317,0.003792815,0.000407042,0.007908598],"genre_candidate":"review","genre_consensus":null,"teacher_disagreement_score":0.004517484,"threshold_uncertainty_score":0.01161522,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2099618798","doi":"10.1016/j.laa.2010.03.008","title":"Zero forcing parameters and minimum rank problems","year":2010,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Graph theory and applications","field":"Mathematics","cited_by":198,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Victoria; University of Regina","funders":"","keywords":"Mathematics; Combinatorics; Positive-definite matrix; Vertex (graph theory); Rank (graph theory); Hermitian matrix; Zero (linguistics); Semidefinite programming; Graph; Discrete mathematics; Eigenvalues and eigenvectors; Pure mathematics; Physics; Mathematical optimization","authors":[{"name":"Francesco Barioli","is_ca":false},{"name":"Wayne Barrett","is_ca":false},{"name":"Shaun Fallat","is_ca":true},{"name":"H. Tracy Hall","is_ca":false},{"name":"Leslie Hogben","is_ca":false},{"name":"Bryan L. Shader","is_ca":false},{"name":"P. van den Driessche","is_ca":true},{"name":"Hein van der Holst","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02579778177367733,"gpt":0.2811280914133138,"spread":0.2553303096396365,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001864509,0.0009880634,0.001742486,0.002124073,0.002576011,0.004837387,0.002202957,0.002753727,0.01310887],"category_scores_gemma":[0.01031881,0.0008295217,0.0007582841,0.001849474,0.006135713,0.009340695,0.003761659,0.006207178,0.00150876],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001302126,"about_ca_system_score_gemma":0.001071254,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006385418,"about_ca_topic_score_gemma":0.0007164631,"domain_scores_codex":[0.9985499,0.0005722637,0.00005953771,0.0002835941,0.0003362432,0.0001984189],"domain_scores_gemma":[0.9911135,0.005918724,0.0009021114,0.0008765922,0.0004560234,0.0007330452],"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.0000437071,0.0000185034,0.0000839935,0.00003703001,0.000005425741,0.00002202406,0.00008472471,0.001558093,0.0003759149,0.993002,0.001323633,0.003444983],"study_design_scores_gemma":[0.000009822497,0.000004328843,0.0000317764,0.000005673132,0.000001989207,0.00001651416,0.00002706686,0.002134419,0.0001200182,0.9970975,0.000544292,0.000006700642],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3806006,0.004241692,0.4384217,0.01447915,0.000814404,0.0001000247,0.0008323903,0.000873633,0.1596364],"genre_scores_gemma":[0.9261565,0.001463923,0.0385244,0.001006574,0.001159476,0.0001913571,0.0006066678,0.0003171431,0.03057398],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01310887,"threshold_uncertainty_score":0.04385358,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1966104103","doi":"10.1016/j.laa.2006.01.007","title":"Algorithms for model reduction of large dynamical systems","year":2006,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Model Reduction and Neural Networks","field":"Physics and Astronomy","cited_by":191,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Calgary","funders":"Agence Nationale pour la Gestion des Déchets Radioactifs; Deutscher Akademischer Austauschdienst; University of Calgary","keywords":"Observability; Controllability; Mathematics; Reduction (mathematics); Model order reduction; Dynamical systems theory; Heuristic; Linear system; Algorithm; Matrix (chemical analysis); Gramian matrix; LTI system theory; Rank (graph theory); Low-rank approximation; Linear dynamical system; Mathematical optimization; Applied mathematics; Combinatorics","authors":[{"name":"Thilo Penzl","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01533384924865086,"gpt":0.2759695880064222,"spread":0.2606357387577714,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001490443,0.001363282,0.00182515,0.001325891,0.0008624208,0.001669442,0.001949577,0.001073483,0.006011163],"category_scores_gemma":[0.007363176,0.0007690331,0.001863905,0.00134179,0.001446126,0.00293456,0.002989953,0.003414805,0.001805398],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001174841,"about_ca_system_score_gemma":0.001100454,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002804687,"about_ca_topic_score_gemma":0.003830787,"domain_scores_codex":[0.9988778,0.0004904986,0.00006040729,0.0002120284,0.000284385,0.000074913],"domain_scores_gemma":[0.9966108,0.002433829,0.0001342445,0.0004737007,0.0002691357,0.000078233],"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.0001156816,0.0001387713,0.0004551312,0.0003767306,0.0001554274,0.00007985444,0.0001783474,0.3810763,0.001388758,0.4243652,0.01074888,0.1809209],"study_design_scores_gemma":[0.00001777823,0.00001018266,0.00004729169,0.00001006964,0.00001240766,0.00001551976,0.0000124182,0.5737149,0.0003706322,0.4237022,0.002078051,0.000008505903],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002339592,0.0004235268,0.9942746,0.0002423768,0.00004673252,0.00003019985,0.00009733515,0.0005562768,0.001989448],"genre_scores_gemma":[0.2748525,0.001354476,0.7113601,0.0003505255,0.000371693,0.0005974374,0.001270012,0.0009156103,0.00892767],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006011163,"threshold_uncertainty_score":0.02010936,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2060910570","doi":"10.1016/j.laa.2004.09.022","title":"A pathway to matrix-variate gamma and normal densities","year":2004,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Statistical Mechanics and Entropy","field":"Physics and Astronomy","cited_by":175,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Random variate; Mathematics; Multivariate normal distribution; Cauchy distribution; Matrix (chemical analysis); Random matrix; Gaussian; Applied mathematics; Mathematical analysis; Random variable; Statistics; Multivariate statistics; Physics","authors":[{"name":"A. M. Mathai","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.007306171058247457,"gpt":0.246914233950507,"spread":0.2396080628922596,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00209686,0.0007931277,0.0009965645,0.002548571,0.001831719,0.004395158,0.00215482,0.002149994,0.01481808],"category_scores_gemma":[0.01119234,0.0007263709,0.001376529,0.001982057,0.003739413,0.008585274,0.004395436,0.004280319,0.00331865],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001868414,"about_ca_system_score_gemma":0.002150692,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002356928,"about_ca_topic_score_gemma":0.001668914,"domain_scores_codex":[0.9986616,0.0006548473,0.00006690241,0.0001412512,0.000371152,0.0001041198],"domain_scores_gemma":[0.9962834,0.001578207,0.0002207515,0.0006022239,0.0009365889,0.00037887],"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.000002860834,0.000006302632,0.0000223927,0.000005678033,0.000001269526,0.00001130981,0.00003123568,0.0003466655,0.00004364521,0.9969239,0.0006457127,0.001958983],"study_design_scores_gemma":[0.00000157759,0.000002466181,0.00001156244,0.000004689456,6.471465e-7,0.00002019854,0.000008173496,0.003062208,0.00003365738,0.9949575,0.001893517,0.000003863428],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02415614,0.002218118,0.8571701,0.008484392,0.00100125,0.00008246759,0.0004570668,0.0004984334,0.105932],"genre_scores_gemma":[0.4619272,0.005859371,0.430351,0.003425975,0.003368893,0.0003582801,0.0005600352,0.001042069,0.09310717],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01481808,"threshold_uncertainty_score":0.04957139,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2034647728","doi":"10.1016/s0024-3795(01)00313-5","title":"Discrete nodal domain theorems","year":2001,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Point processes and geometric inequalities","field":"Mathematics","cited_by":152,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; NODAL; Domain (mathematical analysis); Modified nodal analysis; Pure mathematics; Discrete mathematics; Algebra over a field; Mathematical analysis","authors":[{"name":"E. BrianDavies","is_ca":false},{"name":"GrahamM.L. Gladwell","is_ca":true},{"name":"Josef Leydold","is_ca":false},{"name":"Peter F. Stadler","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03323453719590688,"gpt":0.3172663566254125,"spread":0.2840318194295056,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009264112,0.0007412827,0.0008342369,0.001808693,0.001085296,0.002048267,0.001090276,0.0008764259,0.01317718],"category_scores_gemma":[0.002150278,0.0003570105,0.0006983738,0.001262277,0.003036265,0.004587937,0.002576985,0.003934702,0.001451073],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001293858,"about_ca_system_score_gemma":0.0004393625,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008299031,"about_ca_topic_score_gemma":0.0006880384,"domain_scores_codex":[0.9996153,0.0001052669,0.00001445585,0.0001049946,0.0001092428,0.00005065315],"domain_scores_gemma":[0.9992654,0.000380654,0.0000506288,0.00008500232,0.0001367588,0.00008159102],"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.000003850594,0.00000304171,0.00002433307,0.00001025601,0.000001909898,0.000006787339,0.00003354686,0.0002261095,0.0001237946,0.9976835,0.0006049962,0.001277741],"study_design_scores_gemma":[0.000005209341,0.000003752816,0.00006603533,0.000006164878,0.000003948631,0.00002223919,0.00003630996,0.002481401,0.0002208824,0.9911162,0.00603489,0.000003030883],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07575212,0.005490063,0.4902439,0.005677732,0.0006658649,0.00005627753,0.0007387855,0.0002633155,0.4211119],"genre_scores_gemma":[0.7984293,0.0051522,0.05354385,0.001232128,0.001033864,0.0002189528,0.0007327906,0.0002173011,0.1394396],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01317718,"threshold_uncertainty_score":0.04408211,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2050482406","doi":"10.1016/s0024-3795(03)00420-8","title":"The spectral theorem in quaternions","year":2003,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Algebraic and Geometric Analysis","field":"Mathematics","cited_by":139,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Regina","funders":"","keywords":"Quaternion; Mathematics; Exposition (narrative); Pure mathematics; Algebra over a field; Spectral theorem; Geometry; Operator theory","authors":[{"name":"Douglas Farenick","is_ca":true},{"name":"Barbara A.F. Pidkowich","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02278660166197068,"gpt":0.2924544386110342,"spread":0.2696678369490635,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001006325,0.0006602571,0.0006869675,0.002614304,0.001166804,0.003045156,0.0007827466,0.001222865,0.005676999],"category_scores_gemma":[0.002707505,0.0004076873,0.0006422116,0.002078533,0.00384007,0.005694702,0.001682137,0.002340985,0.001262456],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008640515,"about_ca_system_score_gemma":0.0004869994,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001020791,"about_ca_topic_score_gemma":0.0005377933,"domain_scores_codex":[0.9995294,0.000182614,0.00002444448,0.00009119504,0.000126821,0.00004569388],"domain_scores_gemma":[0.9990966,0.0004388595,0.0001031008,0.00008683728,0.0001923425,0.00008217152],"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.000005982936,0.000004079253,0.00003946107,0.00002052658,0.000002534427,0.00001363214,0.00008679742,0.0004497013,0.0002362456,0.9934952,0.001037863,0.004608093],"study_design_scores_gemma":[0.000002498035,0.000003453843,0.00004473752,0.000006930534,0.000001268561,0.00002210564,0.00002564111,0.001454321,0.00009312663,0.99534,0.003002264,0.000003808979],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.1736408,0.02461972,0.5132545,0.01216373,0.004489276,0.00004356898,0.0003886378,0.0005177414,0.270882],"genre_scores_gemma":[0.9107703,0.008823657,0.03817224,0.001655853,0.005601273,0.00007409708,0.0002740945,0.0001631076,0.03446543],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.005676999,"threshold_uncertainty_score":0.01899141,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2081729430","doi":"10.1016/s0024-3795(02)00352-x","title":"Ranks of tensors, secant varieties of Segre varieties and fat points","year":2002,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":127,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Queen's University","funders":"","keywords":"Mathematics; Pure mathematics; Projective variety; Variety (cybernetics); Product (mathematics); Algebraic variety; Algebraic geometry; Lemma (botany); Projective space; Projective test; Algebraic number; Algebra over a field; Mathematical analysis; Geometry","authors":[{"name":"Maria Virginia Catalisano","is_ca":false},{"name":"Anthony V. Geramita","is_ca":true},{"name":"Alessandro Gimigliano","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03566932599326967,"gpt":0.2769585882640512,"spread":0.2412892622707816,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002339284,0.001886472,0.001532736,0.008175721,0.002776488,0.006397168,0.00140394,0.001352146,0.007907026],"category_scores_gemma":[0.004596125,0.0009783002,0.0009852856,0.004964136,0.006160117,0.008908327,0.002946164,0.00366277,0.001063013],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002043494,"about_ca_system_score_gemma":0.0008851468,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001479612,"about_ca_topic_score_gemma":0.001834703,"domain_scores_codex":[0.9988635,0.0003259508,0.0000882631,0.0002208625,0.0003115346,0.0001900052],"domain_scores_gemma":[0.9970433,0.001014412,0.0006255301,0.0002215977,0.0004465834,0.0006486377],"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.00002763818,0.00001627174,0.0002066267,0.00003199377,0.000006638801,0.00003333136,0.0003084954,0.000471701,0.0003439356,0.9936721,0.000743647,0.004137708],"study_design_scores_gemma":[0.000006822409,0.00001845099,0.0003196639,0.00002008921,0.00001287952,0.00008878269,0.0001790834,0.002292583,0.0003323937,0.994121,0.002588195,0.0000200009],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.577485,0.01620387,0.2051216,0.006346912,0.002031262,0.00009765744,0.0007951107,0.0008816252,0.1910371],"genre_scores_gemma":[0.9357245,0.005239248,0.02401652,0.0004235357,0.002303191,0.00007342224,0.0003540103,0.0001964044,0.03166905],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.008175721,"threshold_uncertainty_score":0.02645165,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2137496495","doi":"10.1016/j.laa.2010.02.002","title":"On the normalized Laplacian energy and general Randić index <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.gif\" overflow=\"scroll\"><mml:mrow><mml:msub><mml:mrow><mml:mi>R</mml:mi></mml:mrow><mml:mrow><mml:mo>-</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msub></mml:mrow></mml:math> of graphs","year":2010,"lang":"lv","type":"article","venue":"Linear Algebra and its Applications","topic":"Graph theory and applications","field":"Mathematics","cited_by":120,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Regina","funders":"","keywords":"Adjacency matrix; Combinatorics; Energy (signal processing); Laplacian matrix; Upper and lower bounds; Laplace operator; Mathematics; Edit distance; Algorithm; Eigenvalues and eigenvectors; Discrete mathematics; Graph; Physics; Statistics; Mathematical analysis","authors":[{"name":"Michael Cavers","is_ca":true},{"name":"Shaun Fallat","is_ca":true},{"name":"Steve Kirkland","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01442548016866956,"gpt":0.2381827723223012,"spread":0.2237572921536317,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001230348,0.0006944977,0.0007203563,0.004324228,0.001331303,0.002296698,0.001689124,0.001279939,0.01534231],"category_scores_gemma":[0.006194443,0.0003079177,0.0005230513,0.001986908,0.002753943,0.005041604,0.001657246,0.001664229,0.002439781],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001678671,"about_ca_system_score_gemma":0.0005977543,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001623016,"about_ca_topic_score_gemma":0.002139543,"domain_scores_codex":[0.9995468,0.0001331802,0.00001816326,0.0001126169,0.0001310364,0.00005822158],"domain_scores_gemma":[0.9979774,0.0008452044,0.0002467724,0.0002904757,0.000383886,0.0002562095],"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.00001245968,0.000008946779,0.0001519954,0.00003232862,0.000005014655,0.00002363323,0.00004135761,0.002680515,0.0002318783,0.9866697,0.004201678,0.005940634],"study_design_scores_gemma":[0.000002536695,0.00000541158,0.0002376519,0.00001931062,0.000003470977,0.00006804842,0.00002974037,0.01783766,0.0001264128,0.9785573,0.003099561,0.00001302812],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.201694,0.01308667,0.3429768,0.008780532,0.00193066,0.00007700796,0.001174251,0.0007913716,0.4294888],"genre_scores_gemma":[0.8695818,0.00575112,0.03908621,0.001366217,0.001970832,0.0001373765,0.0009018113,0.0009324076,0.0802723],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01534231,"threshold_uncertainty_score":0.05132508,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2136122855","doi":"10.1016/j.laa.2004.05.011","title":"On distance matrices and Laplacians","year":2004,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Graph theory and applications","field":"Mathematics","cited_by":114,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Regina","funders":"","keywords":"Mathematics; Distance matrix; Combinatorics; Distance matrices in phylogeny; Matrix (chemical analysis); Resistance distance; Laplacian matrix; Inverse; Grid; Tree (set theory); Graph; Geometry; Line graph; Graph power","authors":[{"name":"R.B. Bapat","is_ca":false},{"name":"Steve Kirkland","is_ca":true},{"name":"Michael Neumann","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01686434030436172,"gpt":0.283984919567014,"spread":0.2671205792626523,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009864363,0.001036957,0.00109201,0.003731004,0.001509866,0.002662472,0.001440415,0.001696586,0.008395565],"category_scores_gemma":[0.005616637,0.0004758657,0.0006402486,0.004923947,0.003482206,0.007091619,0.002304232,0.002984541,0.001356171],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00126047,"about_ca_system_score_gemma":0.0004478406,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001519641,"about_ca_topic_score_gemma":0.001331499,"domain_scores_codex":[0.9992961,0.0002635763,0.00003376323,0.0001591174,0.0001885832,0.00005896234],"domain_scores_gemma":[0.9970415,0.001772247,0.000305421,0.0001967151,0.0004437941,0.0002402573],"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.000008272875,0.00001380008,0.00008913606,0.00004323397,0.000004909979,0.00002571868,0.0001688448,0.001100155,0.0002687311,0.9862345,0.002402372,0.009640293],"study_design_scores_gemma":[0.000001882925,0.000003836276,0.00006903214,0.000009313199,0.000002401285,0.00003348593,0.00004632955,0.002405709,0.00004823708,0.9939948,0.003379423,0.000005504754],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1612478,0.04425231,0.5809661,0.02028626,0.004097133,0.00006808841,0.0008493623,0.0003606792,0.1878723],"genre_scores_gemma":[0.7928272,0.02677277,0.07015085,0.003499297,0.007788294,0.0001945323,0.0009254016,0.0003018627,0.0975398],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008395565,"threshold_uncertainty_score":0.02808595,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2075924802","doi":"10.1016/s0024-3795(02)00345-2","title":"Upper and lower bounds for ranks of matrix expressions using generalized inverses","year":2002,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":108,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Schur complement; Inverse; Matrix (chemical analysis); Complement (music); Combinatorics; Generalized inverse; Moore–Penrose pseudoinverse; Rank (graph theory); Upper and lower bounds; Expression (computer science); Pure mathematics; Mathematical analysis; Geometry; Eigenvalues and eigenvectors","authors":[{"name":"Yongge Tian","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02723798894730929,"gpt":0.2822941735064546,"spread":0.2550561845591453,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01029103,0.004408669,0.002996253,0.007587485,0.002479065,0.0101066,0.005256542,0.003259906,0.01535911],"category_scores_gemma":[0.06453818,0.001795075,0.002877031,0.005212601,0.007321471,0.01776413,0.008425928,0.01002072,0.006363972],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002227349,"about_ca_system_score_gemma":0.002219475,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007763145,"about_ca_topic_score_gemma":0.0016953,"domain_scores_codex":[0.9832864,0.004854688,0.0008579204,0.00210638,0.006415519,0.002479095],"domain_scores_gemma":[0.9309817,0.04706066,0.003321214,0.009150415,0.007127451,0.002358523],"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.000451103,0.0002958031,0.0009926241,0.0005848875,0.0001097055,0.0002304429,0.0006755394,0.03685272,0.005745725,0.8434626,0.009195023,0.1014038],"study_design_scores_gemma":[0.00003129193,0.0001339696,0.0004478566,0.0001569737,0.00009372985,0.0002853657,0.0001559697,0.1356726,0.006239814,0.8500007,0.006645977,0.0001358362],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03021468,0.004595113,0.927488,0.001882341,0.0005977682,0.0001492816,0.0005141065,0.001660736,0.03289787],"genre_scores_gemma":[0.5373285,0.006919373,0.4179072,0.001362737,0.004179215,0.0005806457,0.001375916,0.002233287,0.02811303],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01535911,"threshold_uncertainty_score":0.05442482,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2139454542","doi":"10.1016/s0024-3795(99)00281-5","title":"Principal pivot transforms: properties and applications","year":2000,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":92,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Regina","funders":"","keywords":"Principal (computer security); Mathematics; Principal component analysis; Transformation (genetics); Matrix (chemical analysis); Transformation matrix; Algebra over a field; Algorithm; Mathematical optimization; Applied mathematics; Computer science; Pure mathematics; Statistics","authors":[{"name":"Michael J. Tsatsomeros","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01592799521258953,"gpt":0.2277478120045485,"spread":0.211819816791959,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001483142,0.0006812694,0.0008598476,0.001654823,0.000976363,0.003062737,0.0008716294,0.0009054668,0.005268494],"category_scores_gemma":[0.0106083,0.0005121122,0.0005798828,0.00316476,0.003449061,0.004238151,0.001771876,0.001969038,0.002169436],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003419019,"about_ca_system_score_gemma":0.0007583982,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003437179,"about_ca_topic_score_gemma":0.0003550966,"domain_scores_codex":[0.9991407,0.0002066324,0.00004076244,0.0002048173,0.0003021194,0.0001048238],"domain_scores_gemma":[0.9944818,0.002631627,0.0006491356,0.00110736,0.000807545,0.000322481],"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.0002537341,0.00008646189,0.0009087952,0.00007104413,0.00001359236,0.0001665288,0.0002523689,0.004371502,0.007488201,0.912492,0.002386954,0.07150875],"study_design_scores_gemma":[0.00004621833,0.0001286235,0.0005144429,0.00002778062,0.00002551472,0.0009206214,0.0001640781,0.07187493,0.01620209,0.9036736,0.006377306,0.00004478665],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09965061,0.001351885,0.8758356,0.0004226272,0.0002023674,0.00004707583,0.0001607222,0.000610257,0.02171894],"genre_scores_gemma":[0.8107091,0.002689754,0.1669777,0.0002418754,0.0007724931,0.00009830444,0.0004131803,0.000647901,0.01744976],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005268494,"threshold_uncertainty_score":0.01762486,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2081492879","doi":"10.1016/j.laa.2006.03.019","title":"Higher-rank numerical ranges and compression problems","year":2006,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Quantum Information and Cryptography","field":"Computer Science","cited_by":92,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Guelph; Perimeter Institute; University of Waterloo; University of Toronto","funders":"","keywords":"Mathematics; Rank (graph theory); Numerical range; Hermitian matrix; Projection (relational algebra); Compression (physics); Range (aeronautics); Numerical analysis; Applied mathematics; Algorithm; Pure mathematics; Mathematical analysis; Combinatorics","authors":[{"name":"Man-Duen Choi","is_ca":true},{"name":"David W. Kribs","is_ca":true},{"name":"Karol Życzkowski","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01009308424078874,"gpt":0.2281358348457588,"spread":0.21804275060497,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002023973,0.0008917056,0.001228197,0.002639192,0.001564006,0.005119771,0.002032706,0.002085945,0.01722273],"category_scores_gemma":[0.01633102,0.0005791959,0.0007033683,0.004478103,0.005144009,0.01223551,0.004080422,0.005044466,0.002238456],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001156711,"about_ca_system_score_gemma":0.0006787828,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003498273,"about_ca_topic_score_gemma":0.0002768027,"domain_scores_codex":[0.9970516,0.0008947135,0.0001458795,0.0003774558,0.001176608,0.0003538254],"domain_scores_gemma":[0.989391,0.007333803,0.0009751628,0.001256117,0.0006184746,0.0004254389],"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.00005794167,0.00002942878,0.0001568345,0.00006939989,0.000005469025,0.00007053144,0.0001228327,0.00323436,0.0003256446,0.978298,0.002572208,0.01505739],"study_design_scores_gemma":[0.00001047682,0.000009565589,0.00006841322,0.00001609908,0.00000321498,0.0001236169,0.000036684,0.006188069,0.0004218805,0.9911582,0.001951326,0.00001242831],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2469782,0.009860634,0.5117325,0.01380947,0.0006872945,0.0001444212,0.001104458,0.000959221,0.2147238],"genre_scores_gemma":[0.9015849,0.004044327,0.05056845,0.001263032,0.001963272,0.0001712918,0.0008233913,0.0002890734,0.03929221],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01722273,"threshold_uncertainty_score":0.05761576,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1988353915","doi":"10.1016/j.laa.2004.06.019","title":"Computation of minimal rank and path cover number for certain graphs","year":2004,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Graph theory and applications","field":"Mathematics","cited_by":92,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Regina","funders":"","keywords":"Combinatorics; Mathematics; Rank (graph theory); Cover (algebra); Disjoint sets; Vertex (graph theory); Path (computing); Vertex cover; Discrete mathematics; Graph; Computer science","authors":[{"name":"Francesco Barioli","is_ca":true},{"name":"Shaun Fallat","is_ca":true},{"name":"Leslie Hogben","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02397068020351504,"gpt":0.3067599322323091,"spread":0.282789252028794,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004197571,0.0004158752,0.0006576048,0.002032542,0.0006976494,0.001681729,0.0009391659,0.0005918626,0.005866372],"category_scores_gemma":[0.003762571,0.0002316226,0.0004582738,0.00139627,0.001077408,0.002654665,0.000616869,0.0007453709,0.0004470671],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008661362,"about_ca_system_score_gemma":0.0006372526,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008776627,"about_ca_topic_score_gemma":0.001630197,"domain_scores_codex":[0.9996369,0.00005797864,0.00001490475,0.0001038428,0.0001069608,0.00007939234],"domain_scores_gemma":[0.9977308,0.00126858,0.0003168928,0.0002222063,0.0002038467,0.0002577485],"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.001210786,0.0003908416,0.01962134,0.0006635844,0.0001114627,0.0006755673,0.000928421,0.08537611,0.03521013,0.7452415,0.009656864,0.1009134],"study_design_scores_gemma":[0.00007801652,0.0001972144,0.007940371,0.00003654877,0.00008069264,0.0007001331,0.0004122289,0.3203405,0.02360174,0.6424918,0.004044199,0.00007648107],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8901355,0.0001913356,0.09566198,0.0003848026,0.00002117354,0.00003686102,0.001154229,0.0005511196,0.01186292],"genre_scores_gemma":[0.967512,0.00008357806,0.02866595,0.00002440595,0.00004660897,0.00002270472,0.001088995,0.00007833453,0.002477487],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.005866372,"threshold_uncertainty_score":0.01962501,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2600111037","doi":"10.1016/j.laa.2017.03.014","title":"Two finite-time convergent Zhang neural network models for time-varying complex matrix Drazin inverse","year":2017,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Neural Networks and Applications","field":"Computer Science","cited_by":91,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McMaster University","funders":"Science and Technology Commission of Shanghai Municipality; Fudan University","keywords":"Drazin inverse; Mathematics; Inverse; Matrix (chemical analysis); Convergence (economics); Zhàng; Moore–Penrose pseudoinverse; Function (biology); Artificial neural network; Applied mathematics; Pure mathematics; Geometry; Computer science; Artificial intelligence","authors":[{"name":"Sanzheng Qiao","is_ca":true},{"name":"Xuezhong Wang","is_ca":false},{"name":"Yimin Wei","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03959575472427649,"gpt":0.2991370148100499,"spread":0.2595412600857734,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008498402,0.0007767743,0.0009761978,0.0002938238,0.0003573349,0.001170074,0.001663371,0.001556006,0.002305722],"category_scores_gemma":[0.001835424,0.0003672354,0.0006787087,0.000356849,0.0009831819,0.001329109,0.001064277,0.001225867,0.0003193463],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009017006,"about_ca_system_score_gemma":0.0006899965,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004548391,"about_ca_topic_score_gemma":0.004337834,"domain_scores_codex":[0.9997674,0.00007484412,0.000009455757,0.00006448399,0.00005103779,0.0000329231],"domain_scores_gemma":[0.9994918,0.0001919367,0.00008470328,0.00004240388,0.0001347819,0.00005439399],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001690301,0.00006014011,0.000611308,0.0001149049,0.0000680659,0.0001560832,0.0001694355,0.8135803,0.005798519,0.1641538,0.0009295024,0.01418887],"study_design_scores_gemma":[0.000004778293,0.00001305961,0.00004602974,0.000002675685,0.00000590632,0.00001204755,0.000005021534,0.9948971,0.0002304914,0.004609902,0.00016582,0.000007129582],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07131694,0.000630638,0.9157963,0.0005728414,0.0001298517,0.00003621987,0.00009135769,0.0001978121,0.01122807],"genre_scores_gemma":[0.9283894,0.000363223,0.05040392,0.0001547481,0.00004936905,0.00007529597,0.0001079888,0.00006465927,0.02039143],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004548391,"threshold_uncertainty_score":0.009043872,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2147228817","doi":"10.1016/s0024-3795(02)00260-4","title":"Two numerical methods for optimizing matrix stability","year":2002,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":89,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"","keywords":"Mathematics; Eigenvalues and eigenvectors; Lipschitz continuity; Matrix (chemical analysis); Function (biology); Matrix function; Exponential stability; Dynamical systems theory; Mathematical analysis; Pure mathematics; Combinatorics; Applied mathematics; Symmetric matrix; Physics","authors":[{"name":"James V. Burke","is_ca":false},{"name":"Adrian S. Lewis","is_ca":true},{"name":"Michael L. Overton","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03626934322608164,"gpt":0.3461622929148682,"spread":0.3098929496887866,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002324517,0.001101213,0.001053326,0.00122936,0.0008062887,0.001253232,0.001405094,0.00192504,0.003853943],"category_scores_gemma":[0.009768385,0.0005001673,0.000776536,0.001090744,0.001493811,0.001834454,0.001903528,0.001806484,0.0007860332],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009154332,"about_ca_system_score_gemma":0.001236453,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001626345,"about_ca_topic_score_gemma":0.002525341,"domain_scores_codex":[0.9988093,0.0004321059,0.00006077973,0.0001354084,0.0005007174,0.00006170155],"domain_scores_gemma":[0.9969249,0.001496151,0.0002717233,0.0004112505,0.0007362021,0.000159742],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000280946,0.0002395763,0.0006709986,0.0003300216,0.00008777461,0.00005875138,0.0002327402,0.4429901,0.01286669,0.2091063,0.004747774,0.3283883],"study_design_scores_gemma":[0.00003169871,0.00005552976,0.0001225427,0.00001556319,0.0000127768,0.0000257971,0.00001155971,0.9733387,0.003071524,0.02029298,0.002999678,0.00002159259],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002390123,0.0002154974,0.9952652,0.0001662377,0.0001359216,0.00003117699,0.00001607228,0.000146995,0.001632825],"genre_scores_gemma":[0.1179168,0.0003716532,0.8722101,0.0001886437,0.0002551007,0.0003130731,0.00007221811,0.0003382465,0.008334131],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003853943,"threshold_uncertainty_score":0.01289272,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2076585714","doi":"10.1016/j.laa.2011.04.022","title":"Perfect state transfer in cubelike graphs","year":2011,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":88,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Transfer (computing); Discrete mathematics; State (computer science); Trivially perfect graph; Graph; Code (set theory); Set (abstract data type); Algorithm; Chordal graph; Computer science; 1-planar graph","authors":[{"name":"Wang-Chi Cheung","is_ca":true},{"name":"Chris Godsil","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01454557259863487,"gpt":0.2229674530085283,"spread":0.2084218804098935,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008805928,0.0003492443,0.0009652439,0.001080925,0.001969012,0.002478806,0.001373954,0.001630425,0.01004967],"category_scores_gemma":[0.003124379,0.0004088906,0.0008098176,0.001302639,0.003090663,0.005015041,0.001990371,0.002146305,0.0008610279],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001271466,"about_ca_system_score_gemma":0.001118346,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002099995,"about_ca_topic_score_gemma":0.001727439,"domain_scores_codex":[0.9994216,0.0001742141,0.00002095325,0.00007662596,0.0001584567,0.0001481018],"domain_scores_gemma":[0.998259,0.0009056379,0.0001774306,0.000311323,0.0001387032,0.0002078412],"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.00002870167,0.00001834482,0.00005742768,0.00001437835,0.000002597245,0.00002407193,0.00006569633,0.00190653,0.0003994194,0.9947601,0.0008076115,0.001915032],"study_design_scores_gemma":[0.000008762737,0.00001022718,0.0000547469,0.00000421811,0.000001709305,0.00001697614,0.00003446442,0.009558775,0.0003414683,0.9895929,0.0003694822,0.000006149125],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6450171,0.0007202086,0.2116844,0.003865386,0.0004542108,0.0001643591,0.0006385081,0.0009782588,0.1364775],"genre_scores_gemma":[0.9686517,0.0003030628,0.01557075,0.0005781499,0.0001462246,0.0001076555,0.0002894384,0.000126376,0.01422665],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01004967,"threshold_uncertainty_score":0.03361952,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2108587835","doi":"10.1016/j.laa.2006.01.029","title":"On the diameters of commuting graphs","year":2006,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Advanced Topics in Algebra","field":"Mathematics","cited_by":87,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; School of Mathematics, Institute for Research in Fundamental Sciences","keywords":"Mathematics; Combinatorics; Graph; Invertible matrix; Idempotence; Conjecture; Algebraically closed field; Nilpotent; Discrete mathematics; Pure mathematics","authors":[{"name":"Saieed Akbari","is_ca":false},{"name":"Abdolmajid Mohammadian","is_ca":false},{"name":"Heydar Radjavi","is_ca":true},{"name":"P. Raja","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03077650466669636,"gpt":0.297366897332938,"spread":0.2665903926662416,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002932066,0.001115532,0.001589853,0.003616821,0.002314,0.00351949,0.00217139,0.001497653,0.008189458],"category_scores_gemma":[0.01256153,0.001210313,0.0009462485,0.00237357,0.005561867,0.01062233,0.003185657,0.003192483,0.0008874206],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002252012,"about_ca_system_score_gemma":0.0006408329,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001435124,"about_ca_topic_score_gemma":0.001094052,"domain_scores_codex":[0.9985032,0.0005425938,0.00008345057,0.0003450541,0.0002855527,0.0002402268],"domain_scores_gemma":[0.9780343,0.01648889,0.001646231,0.0007785452,0.0009847273,0.002067246],"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.00004144071,0.00001002429,0.0003184063,0.0000301243,0.000004544993,0.00003302624,0.0003230656,0.0007539861,0.0006012447,0.9944449,0.0009404453,0.002498731],"study_design_scores_gemma":[0.00001912976,0.00001872267,0.0004849446,0.00002169282,0.00001138983,0.0001010721,0.0001987211,0.006230704,0.0004489044,0.9893571,0.003092546,0.00001507734],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.667289,0.00551329,0.2047985,0.005587514,0.0008556878,0.00007987926,0.0008392693,0.000545132,0.1144918],"genre_scores_gemma":[0.9373957,0.003905515,0.03387262,0.0007311539,0.001961845,0.0002158004,0.0006242611,0.0003796912,0.02091347],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.008189458,"threshold_uncertainty_score":0.0273965,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2081655555","doi":"10.1016/j.laa.2008.08.020","title":"Graphs with integral spectrum","year":2008,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Quantum Information and Cryptography","field":"Computer Science","cited_by":86,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto; University of Waterloo","funders":"University of Waterloo; Tel Aviv University; Israel Science Foundation","keywords":"Mathematics; Spectrum (functional analysis); Indifference graph; Combinatorics; Quantum graph; Upper and lower bounds; Chordal graph; Metric dimension; Discrete mathematics; 1-planar graph; Graph; Quantum mechanics; Mathematical analysis","authors":[{"name":"Omran Ahmadi","is_ca":true},{"name":"Noga Alon","is_ca":false},{"name":"Ian F. Blake","is_ca":true},{"name":"Igor E. Shparlinski","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01069681153796435,"gpt":0.2131324528181155,"spread":0.2024356412801511,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006251834,0.0008341777,0.001206458,0.003996907,0.002711154,0.003811373,0.001217439,0.001538649,0.01578015],"category_scores_gemma":[0.002355752,0.0005307412,0.000853784,0.002422485,0.003604401,0.005820743,0.002612076,0.0034423,0.001980761],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001358002,"about_ca_system_score_gemma":0.0006686663,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007994995,"about_ca_topic_score_gemma":0.0006743119,"domain_scores_codex":[0.9992523,0.0001431144,0.00002559367,0.0001948865,0.0002277981,0.0001563033],"domain_scores_gemma":[0.9984189,0.0005426598,0.0002252945,0.0002160487,0.000269933,0.0003270858],"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.000008476695,0.000007583127,0.00002888814,0.000009331748,0.000001795149,0.00001573484,0.00005834891,0.0001166157,0.0001602638,0.9972861,0.000756512,0.001550392],"study_design_scores_gemma":[0.000004354577,0.00000237924,0.0000512482,0.000004173056,0.000003078336,0.00004328218,0.0000303703,0.0006789352,0.0001069106,0.9976938,0.001377872,0.000003500569],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.372357,0.001603338,0.1783447,0.008192457,0.000922233,0.0001340903,0.0009310969,0.001047689,0.4364673],"genre_scores_gemma":[0.9152288,0.0009392148,0.01887852,0.001262096,0.0007951451,0.0001072906,0.0005411296,0.0003274501,0.06192038],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01578015,"threshold_uncertainty_score":0.05278987,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2126210866","doi":"10.1016/j.laa.2012.06.038","title":"On the geometric interpretation of the nonnegative rank","year":2012,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":84,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Rank (graph theory); Combinatorics; Euclidean geometry; Polytope; Dimension (graph theory); Interpretation (philosophy); Matrix (chemical analysis); Euclidean distance; Nonnegative matrix; Discrete mathematics; Eigenvalues and eigenvectors; Symmetric matrix; Geometry; Computer science","authors":[{"name":"Nicolas Gillis","is_ca":true},{"name":"François Glineur","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01457578188609575,"gpt":0.2460309477375614,"spread":0.2314551658514656,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004523937,0.0009434938,0.001068209,0.003238526,0.00161823,0.005656815,0.001576016,0.001410574,0.005892543],"category_scores_gemma":[0.0183588,0.0006104236,0.001016304,0.00328522,0.01013008,0.0103059,0.004185425,0.003123396,0.0008353505],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00116514,"about_ca_system_score_gemma":0.001347269,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001365731,"about_ca_topic_score_gemma":0.001040572,"domain_scores_codex":[0.9964477,0.001813271,0.0002336689,0.0005839114,0.0007151354,0.0002064228],"domain_scores_gemma":[0.9899955,0.005608906,0.001178925,0.0014687,0.001168947,0.00057912],"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.00001586088,0.000007819061,0.0001839866,0.00003114825,0.000005609827,0.0000517817,0.0001260318,0.00109948,0.0003378804,0.9903701,0.000964786,0.006805493],"study_design_scores_gemma":[0.000004690128,0.00001111552,0.000136139,0.0000147539,0.000005111645,0.00009106893,0.00005320775,0.007794332,0.0001438117,0.9891449,0.002585253,0.00001580545],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06733917,0.003507691,0.8860738,0.0093113,0.0006474544,0.00005048137,0.0005337296,0.0003251432,0.03221118],"genre_scores_gemma":[0.8055342,0.003912165,0.1688888,0.001968654,0.002683147,0.000135067,0.0005864363,0.0002672236,0.01602426],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005892543,"threshold_uncertainty_score":0.02392513,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2024123880","doi":"10.1016/s0024-3795(02)00356-7","title":"Graded polynomial identities of matrices","year":2002,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Advanced Topics in Algebra","field":"Mathematics","cited_by":81,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Mathematics; Tensor product; Graded ring; Diagonal; Exterior algebra; Algebra over a field; Differential graded algebra; Combinatorics; Pure mathematics; Filtered algebra; Division algebra; Geometry","authors":[{"name":"Yuri Bahturin","is_ca":true},{"name":"Vesselin Drensky","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04806700094760862,"gpt":0.3087262959551968,"spread":0.2606592950075882,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016004,0.001191912,0.001129153,0.002738262,0.002514856,0.004989847,0.00177564,0.001255419,0.008681015],"category_scores_gemma":[0.003677555,0.0007651286,0.000953218,0.00283414,0.004769676,0.008121059,0.003047347,0.003625385,0.00200029],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002559997,"about_ca_system_score_gemma":0.001146811,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002811867,"about_ca_topic_score_gemma":0.002528569,"domain_scores_codex":[0.9988223,0.0002947818,0.00006493126,0.0002506798,0.0003730904,0.0001943699],"domain_scores_gemma":[0.9987295,0.0003776352,0.0001591873,0.0001634647,0.0003090636,0.0002610906],"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.000007549075,0.000007303276,0.00004530802,0.00001201779,0.000002314446,0.00001678092,0.0001331513,0.0001286365,0.0002091456,0.9968494,0.0006850901,0.001903433],"study_design_scores_gemma":[0.000005022814,0.000003831274,0.00006399729,0.000003980967,0.000003054896,0.0000273584,0.00002642667,0.0005965061,0.0001617961,0.9970878,0.002014925,0.000005328468],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.2290423,0.005558946,0.314397,0.006257853,0.002342291,0.000118197,0.0008345196,0.0005699092,0.440879],"genre_scores_gemma":[0.8727338,0.003033232,0.03518972,0.001017915,0.002397881,0.0001105379,0.0005852267,0.0002039933,0.08472776],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008681015,"threshold_uncertainty_score":0.02904093,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2026427480","doi":"10.1016/s0024-3795(02)00324-5","title":"Some results on graph spectra","year":2002,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Graph theory and applications","field":"Mathematics","cited_by":80,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Wilfrid Laurier University","funders":"","keywords":"Eigenvalues and eigenvectors; Mathematics; Graph; Combinatorics; Spectrum of a matrix; Matrix differential equation; Complement (music); Discrete mathematics; Mathematical analysis; Chemistry","authors":[{"name":"Elias M. Hagos","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.042263211883094,"gpt":0.2846238917333784,"spread":0.2423606798502844,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010235,0.001748216,0.001957314,0.007031214,0.003706087,0.003611707,0.00205931,0.001653542,0.02021173],"category_scores_gemma":[0.00306932,0.0009245626,0.002054517,0.01057047,0.003806504,0.009353796,0.003388664,0.005687449,0.003558944],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001696006,"about_ca_system_score_gemma":0.0006548392,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001282403,"about_ca_topic_score_gemma":0.001300218,"domain_scores_codex":[0.9991174,0.0001993909,0.00004467809,0.0002470562,0.0002742466,0.0001171724],"domain_scores_gemma":[0.9981394,0.0009796651,0.0001528373,0.000213017,0.0002359217,0.000279188],"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.00002465907,0.00003904298,0.00009113598,0.0001632205,0.00001776229,0.00006976612,0.0002636657,0.0005432779,0.0006278963,0.9782783,0.007832448,0.01204896],"study_design_scores_gemma":[0.000007050595,0.00000755098,0.0001458962,0.00002035051,0.00001730005,0.00006915368,0.00006897861,0.0008713304,0.0002185185,0.9900163,0.008546429,0.00001118132],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.1149593,0.03146987,0.2752233,0.02011816,0.005181443,0.0001324781,0.001966925,0.001300506,0.5496481],"genre_scores_gemma":[0.7225776,0.03225862,0.07200035,0.009622599,0.01202605,0.0003774165,0.0024181,0.001329068,0.1473903],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02021173,"threshold_uncertainty_score":0.06761497,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2139136228","doi":"10.1016/s0024-3795(00)00026-4","title":"Spectrally arbitrary patterns","year":2000,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":79,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Victoria","funders":"","keywords":"Mathematics; Sign (mathematics); Combinatorics; Monic polynomial; Conjecture; Tridiagonal matrix; Matrix (chemical analysis); Order (exchange); Nilpotent; Polynomial; Mathematical analysis; Physics; Eigenvalues and eigenvectors","authors":[{"name":"JohnH. Drew","is_ca":true},{"name":"Charles R. Johnson","is_ca":true},{"name":"D.D. Olesky","is_ca":true},{"name":"Peter Vandendriessche","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.007600462144641165,"gpt":0.2275437875955632,"spread":0.219943325450922,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004440264,0.0005715505,0.0006737813,0.001318934,0.001833698,0.002443923,0.0009218064,0.001213602,0.0236508],"category_scores_gemma":[0.003300151,0.0004100511,0.0005394634,0.001065774,0.002150745,0.004218864,0.002423474,0.001834581,0.005028266],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004537353,"about_ca_system_score_gemma":0.0004137572,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002831293,"about_ca_topic_score_gemma":0.0003616626,"domain_scores_codex":[0.9992036,0.0001575786,0.00003970283,0.0002225016,0.0002309671,0.0001456623],"domain_scores_gemma":[0.9988397,0.0002180368,0.0001185284,0.0004110789,0.0002605674,0.0001522446],"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.00003495829,0.00001789695,0.0001471706,0.00002472681,0.000004412368,0.00005814773,0.00009367367,0.0002446358,0.001881463,0.9846426,0.003317043,0.009533439],"study_design_scores_gemma":[0.000007568824,0.000009971827,0.0001673293,0.000008802977,0.000003630824,0.0002334832,0.00009534537,0.002564857,0.001323986,0.9868488,0.008726885,0.000009283975],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.2228098,0.0008658268,0.3622729,0.003976957,0.001867791,0.000126762,0.0008356881,0.001302994,0.4059412],"genre_scores_gemma":[0.8117189,0.0006137383,0.05284498,0.001732426,0.0008150854,0.0001696335,0.0008389608,0.0006563191,0.13061],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.0236508,"threshold_uncertainty_score":0.0791198,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W301566927","doi":"10.1016/j.laa.2015.04.015","title":"Optimization on the Hierarchical Tucker manifold – Applications to tensor completion","year":2015,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":77,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Tensor (intrinsic definition); Subspace topology; Mathematics; Conjugate gradient method; Overfitting; Mathematical optimization; Manifold (fluid mechanics); Algorithm; Scalability; Optimization problem; Gradient descent; Computer science; Theoretical computer science; Artificial intelligence; Artificial neural network","authors":[{"name":"Curt Da Silva","is_ca":true},{"name":"Felix J. Herrmann","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.08230579605464176,"gpt":0.3296400954964969,"spread":0.2473342994418551,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001624257,0.001053885,0.001306757,0.001190441,0.0008307893,0.001498352,0.001109265,0.000995606,0.004734032],"category_scores_gemma":[0.004376039,0.000486957,0.0008640445,0.001516898,0.002624858,0.003669138,0.002152817,0.002201714,0.0006844459],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001349965,"about_ca_system_score_gemma":0.001353776,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0045626,"about_ca_topic_score_gemma":0.004467697,"domain_scores_codex":[0.9993491,0.0002938895,0.00003026553,0.000125754,0.0001375783,0.00006344238],"domain_scores_gemma":[0.9985641,0.000460572,0.0002328116,0.0002111294,0.0002971686,0.000234253],"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.0000210354,0.00003023239,0.0001515132,0.00005515452,0.00001757218,0.00002092625,0.00006656357,0.03004912,0.0007944936,0.9527558,0.002685935,0.01335164],"study_design_scores_gemma":[0.000005428348,0.0000191027,0.0001613714,0.00001150194,0.000005956947,0.0000191165,0.00003638859,0.1954955,0.0003229545,0.8011987,0.002708802,0.00001529034],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.03330522,0.001964052,0.9443321,0.001746819,0.0002249938,0.00003667232,0.0001475702,0.0002445734,0.017998],"genre_scores_gemma":[0.6086631,0.004238339,0.3471636,0.0006922733,0.001037549,0.0001482055,0.0003994935,0.0006428465,0.0370145],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.004734032,"threshold_uncertainty_score":0.01583695,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2042309759","doi":"10.1016/s0024-3795(01)00312-3","title":"On graphs with equal algebraic and vertex connectivity","year":2002,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Graph theory and applications","field":"Mathematics","cited_by":76,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Regina","funders":"","keywords":"Combinatorics; Mathematics; Algebraic connectivity; Vertex (graph theory); Upper and lower bounds; Algebraic number; Connectivity; Inverse; Graph; Laplacian matrix; Laplace operator; Discrete mathematics","authors":[{"name":"Stephen Kirkland","is_ca":true},{"name":"Jason J. Molitierno","is_ca":false},{"name":"Michael Neumann","is_ca":false},{"name":"Bryan L. Shader","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03212277417922123,"gpt":0.2675024210694715,"spread":0.2353796468902502,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001114386,0.001448155,0.001687422,0.005671923,0.00328176,0.004749055,0.002176389,0.002121995,0.009126465],"category_scores_gemma":[0.009047129,0.0007580359,0.001124138,0.005364421,0.006059859,0.01208623,0.003586512,0.003348424,0.0009016439],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001654658,"about_ca_system_score_gemma":0.0007525338,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001952692,"about_ca_topic_score_gemma":0.00207393,"domain_scores_codex":[0.9984134,0.0004864094,0.0000722945,0.0004232619,0.0003261001,0.000278546],"domain_scores_gemma":[0.9911163,0.005395578,0.001260702,0.0006140051,0.0007465767,0.0008669325],"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.00002432109,0.00001506997,0.00012618,0.00003673211,0.00000445776,0.00003384873,0.0001563349,0.0008713537,0.0002211606,0.9933462,0.0007447996,0.004419518],"study_design_scores_gemma":[0.000007389398,0.00000769815,0.0001105214,0.00001343711,0.000008529889,0.0000674918,0.0000851307,0.002610126,0.0001363981,0.9958012,0.001144383,0.000007570955],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5198303,0.002749604,0.3146151,0.00635011,0.0007111227,0.0001546871,0.001332644,0.0005191879,0.1537373],"genre_scores_gemma":[0.9328319,0.003088997,0.03674803,0.0009988596,0.001211627,0.0002070348,0.001148769,0.0002140072,0.02355075],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.009126465,"threshold_uncertainty_score":0.03053105,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2058586197","doi":"10.1016/j.laa.2015.03.024","title":"Perfect state transfer on distance-regular graphs and association schemes","year":2015,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":73,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University; University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Fonds Wetenschappelijk Onderzoek; Coordenação de Aperfeiçoamento de Pessoal de Nível Superior","keywords":"Mathematics; Transfer (computing); Association scheme; Representation (politics); Discrete mathematics; State (computer science); Simple (philosophy); Graph; Combinatorics; Algorithm; Computer science","authors":[{"name":"Gabriel Coutinho","is_ca":true},{"name":"Chris Godsil","is_ca":true},{"name":"Krystal Guo","is_ca":true},{"name":"Frédéric Vanhove","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0104980829201604,"gpt":0.2296571553207347,"spread":0.2191590724005743,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002065005,0.0004995498,0.001143488,0.001613039,0.002863791,0.003758128,0.001832766,0.00216171,0.00767574],"category_scores_gemma":[0.00733402,0.0005429731,0.0009688096,0.002132518,0.005342615,0.009326885,0.004147939,0.003063376,0.0008225497],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002165109,"about_ca_system_score_gemma":0.001374342,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009953646,"about_ca_topic_score_gemma":0.0006627912,"domain_scores_codex":[0.9981235,0.0006044132,0.00009198335,0.0003397705,0.0004533667,0.0003869952],"domain_scores_gemma":[0.9947738,0.002446451,0.0006214353,0.001315591,0.0003213837,0.0005214653],"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.00001695047,0.00001099132,0.00004270381,0.000008144049,0.000001780496,0.00001158568,0.00006698733,0.0009266926,0.0001538467,0.9974176,0.0002506635,0.001092249],"study_design_scores_gemma":[0.000007508765,0.000005899016,0.00004251154,0.000003456475,0.00000205011,0.00001561088,0.00002179295,0.005943167,0.00018862,0.9934005,0.000362803,0.000006103128],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5608304,0.0007348699,0.3454739,0.004237214,0.0003682493,0.0001487383,0.0005333891,0.0006308859,0.08704241],"genre_scores_gemma":[0.9667853,0.0003261296,0.01897644,0.0003524001,0.0001988157,0.00007785906,0.0001852965,0.00008678727,0.013011],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.00767574,"threshold_uncertainty_score":0.02567792,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2149623001","doi":"10.1016/s0024-3795(01)00472-4","title":"Efficient matrix preconditioners for black box linear algebra","year":2002,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":72,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Calgary","funders":"","keywords":"Preconditioner; Linear algebra; Algebra over a field; Mathematics; Toeplitz matrix; Numerical linear algebra; Computation; Matrix (chemical analysis); Algebraic number; Linear system; Pure mathematics; Algorithm; Mathematical analysis; Geometry","authors":[{"name":"Chen Li","is_ca":false},{"name":"Wayne Eberly","is_ca":true},{"name":"Erich Kaltofen","is_ca":false},{"name":"B. David Saunders","is_ca":false},{"name":"William J. Turner","is_ca":false},{"name":"Gilles Villard","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01530175664444624,"gpt":0.2593083641973076,"spread":0.2440066075528613,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009483795,0.0009522352,0.001266144,0.0005533,0.0009956544,0.00122669,0.001324259,0.001004723,0.01657108],"category_scores_gemma":[0.003670656,0.0005458042,0.000544405,0.001084539,0.0009612317,0.00235414,0.001957894,0.002695058,0.004367729],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004917193,"about_ca_system_score_gemma":0.001297141,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001842663,"about_ca_topic_score_gemma":0.004684907,"domain_scores_codex":[0.9991302,0.0002306662,0.00003522773,0.00007713554,0.0004158633,0.0001108407],"domain_scores_gemma":[0.9987876,0.0004839831,0.00008938876,0.0003300057,0.0002344512,0.00007464793],"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.0009993637,0.0002490805,0.0003506938,0.0003249632,0.00009709352,0.0001588074,0.0002890476,0.1994828,0.0221632,0.3845066,0.04054424,0.3508342],"study_design_scores_gemma":[0.0001454933,0.00006279612,0.00009709695,0.00002555283,0.00001621777,0.00003350308,0.00004128931,0.7428606,0.01108369,0.2306002,0.01501077,0.000022891],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.008324414,0.0001543962,0.982685,0.0002892444,0.0001708456,0.00005582555,0.0001497668,0.001782776,0.006387827],"genre_scores_gemma":[0.1673327,0.0003416124,0.807866,0.0002539311,0.0002493001,0.0003779765,0.0005025718,0.001162892,0.02191294],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01657108,"threshold_uncertainty_score":0.05543578,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2147535338","doi":"10.1016/j.laa.2012.01.019","title":"Skew-adjacency matrices of graphs","year":2012,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Graph theory and applications","field":"Mathematics","cited_by":72,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Queen's University; University of Regina; University of Calgary","funders":"Banff International Research Station for Mathematical Innovation and Discovery; Consejo Nacional de Ciencia y Tecnología, Paraguay; National Science Foundation","keywords":"Adjacency list; Skew; Adjacency matrix; Mathematics; Combinatorics; Graph energy; Discrete mathematics; Graph; Line graph; Voltage graph; Computer science","authors":[{"name":"Michael Cavers","is_ca":true},{"name":"Sebastian M. Cioabă","is_ca":false},{"name":"Shaun Fallat","is_ca":true},{"name":"David A. Gregory","is_ca":true},{"name":"Willem H. Haemers","is_ca":false},{"name":"Steve Kirkland","is_ca":false},{"name":"Judith J. McDonald","is_ca":false},{"name":"Michael J. Tsatsomeros","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03238476641123778,"gpt":0.3083849609204666,"spread":0.2760001945092288,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008156683,0.0007978589,0.0006208529,0.002688196,0.0009557792,0.002178026,0.0009596911,0.0008114951,0.008034343],"category_scores_gemma":[0.003993458,0.0004600999,0.0004732445,0.00245501,0.001632137,0.003325138,0.0009800027,0.00116841,0.001175772],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006141154,"about_ca_system_score_gemma":0.000705695,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007635403,"about_ca_topic_score_gemma":0.001067783,"domain_scores_codex":[0.9992749,0.0002531431,0.00004672006,0.000152401,0.0001830632,0.0000897401],"domain_scores_gemma":[0.9973499,0.001030232,0.0005538351,0.0002352796,0.0005117724,0.0003191242],"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.00002394523,0.00002985069,0.0002868085,0.00004092159,0.000008345922,0.00005861474,0.0003105984,0.003577823,0.001684007,0.9774339,0.001898477,0.01464684],"study_design_scores_gemma":[0.000003116659,0.000008524581,0.0001469218,0.000006544337,0.000002602269,0.00005293152,0.00005585204,0.00808823,0.0003476873,0.9894119,0.001865243,0.00001039345],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3455026,0.002713841,0.5894633,0.001789869,0.0007489129,0.0001098027,0.001297699,0.0007060756,0.05766792],"genre_scores_gemma":[0.9045616,0.002536356,0.07024318,0.0006212902,0.001100896,0.0001881762,0.0008745911,0.0002278948,0.01964603],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008034343,"threshold_uncertainty_score":0.02687758,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2126719431","doi":"10.1016/j.laa.2006.10.020","title":"Large matchings from eigenvalues","year":2006,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Graph theory and applications","field":"Mathematics","cited_by":69,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Queen's University","funders":"","keywords":"Mathematics; Combinatorics; Spectral radius; Eigenvalues and eigenvectors; Upper and lower bounds; Vertex (graph theory); Graph; Degree (music); Order (exchange); Discrete mathematics; Mathematical analysis","authors":[{"name":"Sebastian M. Cioabă","is_ca":false},{"name":"David A. Gregory","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01713236139613076,"gpt":0.2810271631251643,"spread":0.2638948017290335,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001254051,0.0007814394,0.00163921,0.004063679,0.001981545,0.003915253,0.001565379,0.002778768,0.015244],"category_scores_gemma":[0.01357043,0.0009244397,0.0008608199,0.002382115,0.002969835,0.008375311,0.003464637,0.003770085,0.001982797],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001331687,"about_ca_system_score_gemma":0.0006028544,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006402346,"about_ca_topic_score_gemma":0.0006733169,"domain_scores_codex":[0.9988105,0.0003119397,0.00004908139,0.0002932664,0.0003829825,0.0001521353],"domain_scores_gemma":[0.9928994,0.003919767,0.0009295231,0.0008546072,0.0006714708,0.0007252321],"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.00004104249,0.00002239404,0.0001263317,0.00003857968,0.0000082424,0.00004993668,0.0001148667,0.0012744,0.000741361,0.9895209,0.002849933,0.005211982],"study_design_scores_gemma":[0.000008542623,0.000004026266,0.00008308583,0.000006683788,0.000003097561,0.00003939122,0.00002981694,0.006135176,0.000171825,0.9926488,0.0008634259,0.000006101348],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3929066,0.002683474,0.4240384,0.007938071,0.001171093,0.0001906124,0.001046364,0.001978282,0.1680472],"genre_scores_gemma":[0.9224612,0.0008571125,0.03013314,0.001238291,0.001278308,0.0001814467,0.0005774617,0.0006893213,0.04258363],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.015244,"threshold_uncertainty_score":0.0509963,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2123196525","doi":"10.1016/s0024-3795(00)00086-0","title":"The spread of the spectrum of a graph","year":2001,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Graph theory and applications","field":"Mathematics","cited_by":66,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Regina; Queen's University","funders":"","keywords":"Mathematics; Adjacency matrix; Graph energy; Combinatorics; Eigenvalues and eigenvectors; Graph; Spectrum (functional analysis); Adjacency list; Upper and lower bounds; Discrete mathematics; Line graph; Voltage graph; Mathematical analysis; Physics","authors":[{"name":"DavidA. Gregory","is_ca":true},{"name":"Daniel Hershkowitz","is_ca":false},{"name":"StephenJ. Kirkland","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02039042805831651,"gpt":0.2779599707815474,"spread":0.2575695427232309,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001511565,0.0005691967,0.001064686,0.004658629,0.001226308,0.003286902,0.001563781,0.001580066,0.005586507],"category_scores_gemma":[0.01139345,0.0005705449,0.0005849896,0.002307448,0.00496229,0.006934178,0.002383739,0.002402099,0.0006959441],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009452624,"about_ca_system_score_gemma":0.0005009035,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008291688,"about_ca_topic_score_gemma":0.0003773851,"domain_scores_codex":[0.998768,0.0004044558,0.00004146904,0.0003301324,0.0003233447,0.0001325066],"domain_scores_gemma":[0.9912649,0.005354499,0.0007429332,0.0009410222,0.0008092172,0.0008874118],"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.00006894663,0.0000209801,0.0003822955,0.00003739345,0.00001391336,0.0000751808,0.0003803293,0.003937951,0.002546119,0.981673,0.0007863451,0.01007763],"study_design_scores_gemma":[0.00001158167,0.00001748235,0.0003224766,0.00001999115,0.000008239094,0.0001088389,0.0001382351,0.01496545,0.0004634522,0.9828137,0.001115721,0.00001487336],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5309796,0.00316145,0.4160367,0.004072967,0.0003178184,0.00005343902,0.000503713,0.0006111437,0.04426325],"genre_scores_gemma":[0.9731684,0.001310557,0.01905216,0.0002920405,0.0005720156,0.00006548039,0.000170147,0.0001442758,0.005224952],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.005586507,"threshold_uncertainty_score":0.01868874,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2080022619","doi":"10.1016/s0024-3795(01)00297-x","title":"Rank equalities for idempotent and involutary matrices","year":2001,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":65,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University; Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Idempotent matrix; Idempotence; Rank (graph theory); Hermitian matrix; Scalar (mathematics); Combinatorics; Algebra over a field; Commutator; Pure mathematics; Geometry","authors":[{"name":"Yongge Tian","is_ca":true},{"name":"George P. H. Styan","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02096573759637562,"gpt":0.2691860662872015,"spread":0.2482203286908259,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002671788,0.001091761,0.0009862512,0.003154435,0.002373712,0.006098779,0.001409864,0.001366076,0.01721658],"category_scores_gemma":[0.0136745,0.0008285405,0.0008732657,0.002837581,0.004231714,0.01160786,0.003124808,0.00343451,0.002496164],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001026739,"about_ca_system_score_gemma":0.0007689394,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006305246,"about_ca_topic_score_gemma":0.001039226,"domain_scores_codex":[0.9971828,0.0006207182,0.0001801547,0.0004852526,0.001021012,0.0005099699],"domain_scores_gemma":[0.9894628,0.006210179,0.001235358,0.001176382,0.001071516,0.0008438849],"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.0001213205,0.00004936065,0.0004065909,0.00005949121,0.00001036132,0.0001366775,0.0004284667,0.001136537,0.00115621,0.9774296,0.003124527,0.01594085],"study_design_scores_gemma":[0.00001300979,0.00001833796,0.0001551378,0.000009960673,0.00000707191,0.0001356928,0.00007982278,0.002935433,0.0008150695,0.9943293,0.001483092,0.0000180173],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3531513,0.003495956,0.4684169,0.003547658,0.000824745,0.0001211184,0.00107347,0.0009031213,0.1684658],"genre_scores_gemma":[0.922586,0.001499419,0.03747592,0.0006271526,0.001074904,0.0001108161,0.0006881391,0.0003298254,0.03560779],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01721658,"threshold_uncertainty_score":0.05759525,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2011612721","doi":"10.1016/j.laa.2009.06.015","title":"A survey of automated conjectures in spectral graph theory","year":2009,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Graph theory and applications","field":"Mathematics","cited_by":63,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Mathematics; Graph; Eigenvalues and eigenvectors; Spectral graph theory; Graph theory; Voltage graph; Combinatorics; Line graph","authors":[{"name":"Mustapha Aouchiche","is_ca":true},{"name":"Pierre Hansen","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02818967378203269,"gpt":0.3161277883203332,"spread":0.2879381145383005,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007400383,0.001594993,0.003072158,0.007546573,0.003546406,0.00829074,0.003700067,0.004062195,0.01345415],"category_scores_gemma":[0.02562884,0.001707765,0.001936222,0.01187465,0.01107731,0.02786558,0.004565056,0.007904177,0.003616161],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003194446,"about_ca_system_score_gemma":0.0028836,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001562911,"about_ca_topic_score_gemma":0.001258784,"domain_scores_codex":[0.9944263,0.002063114,0.0003972597,0.001203917,0.00162793,0.0002814515],"domain_scores_gemma":[0.9702504,0.02304628,0.0007161573,0.003334717,0.002249089,0.0004034344],"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.00004889905,0.0001642541,0.001204474,0.001264928,0.00004554582,0.00008778265,0.0003730051,0.002791714,0.0002219558,0.8968869,0.01670036,0.08021025],"study_design_scores_gemma":[0.00001733044,0.00002332206,0.0003274746,0.0002584294,0.00001639207,0.0001228948,0.0001174503,0.005317643,0.000225709,0.9719242,0.02162175,0.00002732829],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04429018,0.2136303,0.5299026,0.05110632,0.004046966,0.0002177664,0.001408267,0.001489102,0.1539085],"genre_scores_gemma":[0.4764176,0.2334465,0.2198211,0.0104415,0.02867549,0.0005461091,0.005352145,0.0009893677,0.02431018],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01345415,"threshold_uncertainty_score":0.0450086,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2039538606","doi":"10.1016/j.laa.2005.03.035","title":"Canonical forms for symmetric/skew-symmetric real matrix pairs under strict equivalence and congruence","year":2005,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":60,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Calgary","funders":"","keywords":"Mathematics; Skew-symmetric matrix; Hamiltonian matrix; Symmetric matrix; Linear subspace; Canonical form; Pure mathematics; Congruence (geometry); Combinatorics; Skew; Mathematical proof; Hermitian matrix; Algebra over a field; Square matrix; Eigenvalues and eigenvectors; Geometry","authors":[{"name":"Peter Lancaster","is_ca":true},{"name":"Leiba Rodman","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01754409141837518,"gpt":0.2878598051876947,"spread":0.2703157137693195,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00318337,0.001147316,0.001047906,0.002749596,0.00353963,0.00801365,0.001198575,0.001653947,0.01092132],"category_scores_gemma":[0.006594125,0.000919371,0.001384671,0.002220849,0.005881099,0.01049577,0.004089705,0.003399366,0.002662638],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00112245,"about_ca_system_score_gemma":0.001699288,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005439941,"about_ca_topic_score_gemma":0.0006484208,"domain_scores_codex":[0.9961705,0.0008330179,0.0002950975,0.0008196364,0.001152921,0.0007288662],"domain_scores_gemma":[0.9963792,0.0008359918,0.0004715504,0.0004513503,0.001146346,0.0007155712],"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.00002808774,0.00002388212,0.00009291997,0.00001057466,0.000003958372,0.00005650444,0.0002648985,0.00009471786,0.0004641306,0.994843,0.0008240924,0.00329326],"study_design_scores_gemma":[0.00001755319,0.00001842727,0.00008443544,0.000007421696,0.000006360912,0.0001240873,0.0001745959,0.0009662641,0.0008430759,0.9953787,0.002364099,0.00001498103],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.3290351,0.0008634474,0.5079154,0.003652803,0.002277855,0.0004221967,0.0008466471,0.001089676,0.1538968],"genre_scores_gemma":[0.9099423,0.0008602446,0.05071943,0.0008183733,0.001179299,0.0004185075,0.0007024457,0.0005749405,0.03478449],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01092132,"threshold_uncertainty_score":0.0365355,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2143176167","doi":"10.1016/j.laa.2015.10.018","title":"Hermitian adjacency spectrum and switching equivalence of mixed graphs","year":2015,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Graph theory and applications","field":"Mathematics","cited_by":60,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"Javna Agencija za Raziskovalno Dejavnost RS; Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Mathematics; Hermitian matrix; Combinatorics; Mixed graph; Adjacency matrix; Two-graph; Rank (graph theory); Spectrum (functional analysis); Discrete mathematics; Graph; Pure mathematics; Line graph; Physics; Voltage graph","authors":[{"name":"Bojan Mohar","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.05578229098441052,"gpt":0.3101216922915193,"spread":0.2543394013071087,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009647199,0.0005553724,0.0006308462,0.002602289,0.001483412,0.00268512,0.001220288,0.001123885,0.009775786],"category_scores_gemma":[0.003002353,0.0004643659,0.0006563903,0.001212205,0.003114256,0.004554944,0.001553562,0.001986373,0.000599309],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008206075,"about_ca_system_score_gemma":0.000519595,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007467844,"about_ca_topic_score_gemma":0.0006738558,"domain_scores_codex":[0.9991227,0.000261734,0.00004141175,0.0002150891,0.0002121801,0.0001468967],"domain_scores_gemma":[0.9976783,0.000992181,0.000359932,0.0002266053,0.0003088142,0.0004341746],"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.00001566421,0.00002034233,0.0001138026,0.00001050867,0.000004049147,0.0000322807,0.000132731,0.0004521517,0.0007305829,0.9956422,0.0003225145,0.002523205],"study_design_scores_gemma":[0.000006845213,0.000008668011,0.0001421989,0.000003943439,0.000002184057,0.0000349916,0.00005874679,0.004590788,0.0002017006,0.9945478,0.0003959972,0.000006202942],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6698411,0.0006477145,0.2407825,0.001650048,0.0003473484,0.00007742878,0.0003820118,0.0002857812,0.08598613],"genre_scores_gemma":[0.9762712,0.0002906967,0.01297525,0.0003656615,0.0003141793,0.00006711809,0.0002303463,0.00007389901,0.009411679],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.009775786,"threshold_uncertainty_score":0.03270328,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2152162758","doi":"10.1016/s0024-3795(02)00323-3","title":"The complement of the path is determined by its spectrum","year":2002,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Graph theory and applications","field":"Mathematics","cited_by":60,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Manitoba","funders":"","keywords":"Mathematics; Adjacency matrix; Complement (music); Spectrum (functional analysis); Combinatorics; Path (computing); Graph; Adjacency list; Discrete mathematics; Computer science; Physics","authors":[{"name":"Michael Doob","is_ca":true},{"name":"Willem H. Haemers","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03118045448873361,"gpt":0.275558406971572,"spread":0.2443779524828384,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006788481,0.001058109,0.001185999,0.003900299,0.002767783,0.005688445,0.001501583,0.001714565,0.01253858],"category_scores_gemma":[0.002846204,0.0005223717,0.001033989,0.001389067,0.004850362,0.007393143,0.002566952,0.002723466,0.002522258],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001274297,"about_ca_system_score_gemma":0.001258427,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001603442,"about_ca_topic_score_gemma":0.000816267,"domain_scores_codex":[0.9985959,0.0001609118,0.0000448401,0.0005177428,0.0003722936,0.0003082737],"domain_scores_gemma":[0.9973928,0.00100177,0.0002793791,0.0002167688,0.0006733437,0.0004359461],"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.0001239312,0.00005986539,0.0004070725,0.00004611574,0.00001738072,0.0001726945,0.0002388321,0.0004330359,0.005238432,0.9814626,0.001156342,0.0106436],"study_design_scores_gemma":[0.00002359363,0.00004324033,0.0006485746,0.00004062843,0.00002182066,0.0004066896,0.000283849,0.004871399,0.00368781,0.9856403,0.004292429,0.00003966593],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5414863,0.0006095247,0.2990543,0.001732851,0.001247785,0.0001305127,0.001274274,0.001130824,0.1533337],"genre_scores_gemma":[0.9097914,0.0007483061,0.05066009,0.0003913947,0.000539082,0.0002142223,0.0008684365,0.0006430839,0.03614393],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01253858,"threshold_uncertainty_score":0.04194576,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2064891073","doi":"10.1016/j.laa.2003.08.012","title":"The simplest proof of Burnside's theorem on matrix algebras","year":2003,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Advanced Topics in Algebra","field":"Mathematics","cited_by":55,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Mathematics; Algebraically closed field; Invariant subspace; Pure mathematics; Invariant (physics); Simple (philosophy); Elementary proof; Algebra over a field; Matrix (chemical analysis); Subspace topology; Discrete mathematics; Linear subspace; Mathematical analysis; Mathematical physics","authors":[{"name":"Victor Lomonosov","is_ca":false},{"name":"Peter Rosenthal","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02937311205438796,"gpt":0.3314041468443836,"spread":0.3020310347899957,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001403369,0.00122412,0.0009928808,0.00174552,0.001987463,0.002417744,0.001760535,0.001442305,0.01420796],"category_scores_gemma":[0.003675461,0.0004487259,0.001171397,0.001269675,0.003254404,0.006642969,0.00372943,0.004340181,0.002765979],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001121135,"about_ca_system_score_gemma":0.001022696,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005574612,"about_ca_topic_score_gemma":0.0005384445,"domain_scores_codex":[0.9993099,0.000121001,0.00003548925,0.0001317231,0.000298653,0.0001031977],"domain_scores_gemma":[0.9988809,0.0003787283,0.00007157152,0.0002313916,0.0003090686,0.0001282466],"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.0000367905,0.00002433746,0.00008132029,0.0001404038,0.00001559526,0.00006141246,0.0001442592,0.0002224226,0.001331745,0.9754826,0.008791838,0.01366732],"study_design_scores_gemma":[0.00001380421,0.00001208505,0.00008142266,0.00002212876,0.00001131107,0.0001129701,0.00002534565,0.000609827,0.001222077,0.9841354,0.01374035,0.00001333119],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0627822,0.006042907,0.5175859,0.02151594,0.007500332,0.0001515769,0.0007732151,0.001544091,0.3821039],"genre_scores_gemma":[0.7225066,0.005322861,0.1380892,0.009430224,0.005309606,0.0002762346,0.0006334414,0.0007989989,0.1176328],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01420796,"threshold_uncertainty_score":0.04753035,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2015740796","doi":"10.1016/s0024-3795(02)00307-5","title":"Symmetry property and construction of wavelets with a general dilation matrix","year":2002,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Image and Signal Denoising Methods","field":"Computer Science","cited_by":54,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"","keywords":"Mathematics; Dilation (metric space); Pure mathematics; Lattice (music); Wavelet; Symmetry (geometry); Matrix (chemical analysis); Mathematical analysis; Combinatorics; Geometry; Computer science; Artificial intelligence","authors":[{"name":"Bin Han","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01578237352030831,"gpt":0.2490227104282769,"spread":0.2332403369079686,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008185414,0.0004853827,0.0006210018,0.0008753889,0.0006220639,0.0009678888,0.0007559652,0.0008865974,0.002608892],"category_scores_gemma":[0.001399273,0.0004043205,0.001039796,0.0006723265,0.001243601,0.001515159,0.001165367,0.001513657,0.0007811643],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000355415,"about_ca_system_score_gemma":0.0005219837,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002397001,"about_ca_topic_score_gemma":0.0001780739,"domain_scores_codex":[0.9995837,0.0001024746,0.00002678201,0.00009666551,0.000132915,0.00005758372],"domain_scores_gemma":[0.9995462,0.0001063697,0.00008510767,0.0001022335,0.00008994331,0.00007008749],"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.00005539668,0.00002358471,0.0001492917,0.00004242395,0.000009919081,0.0001399122,0.0001184557,0.002122921,0.02278299,0.9545574,0.0009709888,0.01902673],"study_design_scores_gemma":[0.00005540591,0.0001584802,0.0005791952,0.00001621817,0.00002784321,0.0008499385,0.00008957846,0.08789189,0.01753544,0.8820551,0.01068399,0.00005696713],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06911968,0.0003452595,0.917474,0.0004535471,0.0002731545,0.00005904187,0.00008722561,0.0001444163,0.01204363],"genre_scores_gemma":[0.5505576,0.0008218212,0.4312718,0.0004035728,0.0005700871,0.0001598704,0.0002619184,0.0003533754,0.01559987],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002608892,"threshold_uncertainty_score":0.00872761,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1994621692","doi":"10.1016/s0024-3795(03)00476-2","title":"Max-algebra and pairwise comparison matrices","year":2003,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Multi-Criteria Decision Making","field":"Decision Sciences","cited_by":54,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Victoria","funders":"University of Victoria","keywords":"Mathematics; Eigenvalues and eigenvectors; Transitive relation; Reciprocal; Ranking (information retrieval); Matrix (chemical analysis); Pairwise comparison; Linear algebra; Measure (data warehouse); Combinatorics; Generalized eigenvector; Symmetric matrix; Statistics; Computer science; Geometry","authors":[{"name":"L. Elsner","is_ca":false},{"name":"P. van den Driessche","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1147421302884672,"gpt":0.4074115333315407,"spread":0.2926694030430735,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009579922,0.001381863,0.002418865,0.002521364,0.001490763,0.003172654,0.00238284,0.001188767,0.008920721],"category_scores_gemma":[0.02471311,0.0007648217,0.001744472,0.00599313,0.003346806,0.007497902,0.002466988,0.003067415,0.001533182],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001592493,"about_ca_system_score_gemma":0.001801847,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001311582,"about_ca_topic_score_gemma":0.001142686,"domain_scores_codex":[0.9898038,0.007012182,0.0004047608,0.001021898,0.001499281,0.0002581302],"domain_scores_gemma":[0.9784546,0.01657582,0.001545322,0.001255476,0.001743819,0.0004249827],"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.00006061533,0.00007807487,0.0001676064,0.0002048966,0.00007149067,0.00004247125,0.000151951,0.02250281,0.0003814146,0.9214889,0.00269742,0.05215234],"study_design_scores_gemma":[0.00000621694,0.00002715797,0.00007274216,0.00001870237,0.00001039735,0.00003049908,0.00002040695,0.03270214,0.0001678458,0.9651856,0.001742896,0.00001530357],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.005815665,0.002089661,0.9840052,0.0005484243,0.0001385535,0.00004319079,0.0001921956,0.0001240404,0.007043186],"genre_scores_gemma":[0.3505339,0.004386831,0.6290144,0.0006647274,0.001120821,0.0007388061,0.0007630598,0.0002058338,0.01257165],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009579922,"threshold_uncertainty_score":0.05066413,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2075893026","doi":"10.1016/j.laa.2005.03.021","title":"Approximate and exact completion problems for Euclidean distance matrices using semidefinite programming","year":2005,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":51,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Euclidean distance matrix; Euclidean distance; Semidefinite programming; Distance matrix; Matrix norm; Matrix (chemical analysis); Euclidean geometry; Matrix completion; Large margin nearest neighbor; Diagonal; Mathematical optimization; Combinatorics; Applied mathematics; k-nearest neighbors algorithm; Computer science; Eigenvalues and eigenvectors; Geometry; Artificial intelligence","authors":[{"name":"Suliman Al‐Homidan","is_ca":true},{"name":"Henry Wolkowicz","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.07301771218730009,"gpt":0.3652212376610858,"spread":0.2922035254737858,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005051052,0.001759894,0.002840591,0.001215694,0.0009445053,0.004093579,0.003581364,0.002703696,0.006610396],"category_scores_gemma":[0.02723219,0.001254632,0.001259112,0.002445058,0.003862022,0.01005806,0.003895986,0.005825934,0.001056175],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001842211,"about_ca_system_score_gemma":0.002551598,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0032211,"about_ca_topic_score_gemma":0.003390144,"domain_scores_codex":[0.9958848,0.001664474,0.0001900256,0.0008009885,0.001189866,0.0002696647],"domain_scores_gemma":[0.9859638,0.009049001,0.000969444,0.001935333,0.001485686,0.0005967442],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0003050146,0.0003161046,0.0004586043,0.000458715,0.00008734547,0.00009588176,0.0002418785,0.5199913,0.001253732,0.3861409,0.00825537,0.08239514],"study_design_scores_gemma":[0.00002721637,0.00004480583,0.00008138015,0.00001765734,0.000006996063,0.00003869218,0.00005378648,0.7496986,0.0004567275,0.2486266,0.0009263483,0.0000212026],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.009857042,0.0003275872,0.9870184,0.0004272984,0.00006647123,0.0000497398,0.0001986401,0.0001366849,0.001918183],"genre_scores_gemma":[0.3749588,0.001261363,0.6112893,0.0003610254,0.0004198663,0.000404018,0.001404867,0.0004310025,0.009469747],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006610396,"threshold_uncertainty_score":0.02671283,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2038304857","doi":"10.1016/j.laa.2012.04.033","title":"Sparse nonnegative matrix underapproximation and its application to hyperspectral image analysis","year":2012,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Remote-Sensing Image Classification","field":"Engineering","cited_by":51,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Hyperspectral imaging; Non-negative matrix factorization; Interpretability; Principal component analysis; Dimensionality reduction; Pattern recognition (psychology); Matrix decomposition; Constraint (computer-aided design); Artificial intelligence; Matrix (chemical analysis); Mathematics; Sparse matrix; Image (mathematics); Curse of dimensionality; Sparse PCA; Computer science; Feature extraction; Nonnegative matrix; Symmetric matrix; Eigenvalues and eigenvectors","authors":[{"name":"Nicolas Gillis","is_ca":true},{"name":"Robert J. Plemmons","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01359840595848155,"gpt":0.2617552126817133,"spread":0.2481568067232318,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002400697,0.0009536162,0.001209312,0.0008798048,0.0004423066,0.00140049,0.001293532,0.001158093,0.002151311],"category_scores_gemma":[0.01583369,0.0004372346,0.0008996899,0.001416762,0.001562441,0.002131957,0.002486674,0.002178374,0.0006086119],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005446268,"about_ca_system_score_gemma":0.0007946342,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002343518,"about_ca_topic_score_gemma":0.001811058,"domain_scores_codex":[0.9981837,0.0009042979,0.00007424976,0.0002017536,0.0005456941,0.00009031771],"domain_scores_gemma":[0.9927924,0.004674664,0.0005695139,0.0007905946,0.0009864119,0.0001864312],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0003848105,0.0001696945,0.001314035,0.0003210409,0.0001203044,0.0002309026,0.0002672426,0.5653924,0.01344196,0.2131564,0.006962919,0.1982382],"study_design_scores_gemma":[0.000003473379,0.00001820667,0.00006654459,0.000006471123,0.000005290374,0.00004094598,0.000009843637,0.9682026,0.0008588542,0.03005366,0.0007248407,0.000009221219],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.005344073,0.0002062203,0.993374,0.000217526,0.00004061257,0.000009829067,0.00003798642,0.000114839,0.000654792],"genre_scores_gemma":[0.3669375,0.001693631,0.623145,0.0003925621,0.0005088326,0.0001508358,0.0005726668,0.000264202,0.006334834],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002400697,"threshold_uncertainty_score":0.01269627,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2963458156","doi":"10.1016/j.laa.2012.11.016","title":"Fischer type determinantal inequalities for accretive–dissipative matrices","year":2012,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":50,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Dissipative system; Type (biology); Matrix (chemical analysis); Pure mathematics; Combinatorics; Mathematical analysis; Algebra over a field; Physics; Chemistry; Thermodynamics","authors":[{"name":"Minghua Lin","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02759485612494702,"gpt":0.3009326329486045,"spread":0.2733377768236575,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001901386,0.001339607,0.0008114587,0.002058544,0.001150797,0.002352071,0.001460067,0.001302269,0.01037089],"category_scores_gemma":[0.006090751,0.00052131,0.0009611492,0.001441317,0.003566294,0.003836084,0.002500342,0.003447604,0.0008945935],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002182111,"about_ca_system_score_gemma":0.0009153382,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002424629,"about_ca_topic_score_gemma":0.004327418,"domain_scores_codex":[0.9991216,0.0002657931,0.0000449446,0.0001611085,0.0002576634,0.0001489557],"domain_scores_gemma":[0.9968287,0.00201201,0.0002613032,0.0001632121,0.0004619656,0.0002726924],"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.0000187073,0.000008658713,0.0001253324,0.00003213352,0.000008444392,0.00003748719,0.00009228326,0.004530069,0.0008094287,0.990877,0.0007916713,0.002668871],"study_design_scores_gemma":[0.000006938891,0.00001297123,0.0001862503,0.00001304154,0.000006573602,0.00003900895,0.00004698037,0.03467036,0.0004650751,0.9629082,0.001623139,0.00002134043],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1031577,0.002166523,0.7792738,0.003185036,0.0004433163,0.00006815822,0.0007109832,0.000160054,0.1108346],"genre_scores_gemma":[0.9009354,0.001870172,0.05827208,0.000978742,0.0004480732,0.0001393172,0.0004831982,0.0001067724,0.03676625],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01037089,"threshold_uncertainty_score":0.03469408,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2147881902","doi":"10.1016/j.laa.2008.10.007","title":"Coefficients of ergodicity and the scrambling index","year":2008,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Random Matrices and Applications","field":"Mathematics","cited_by":49,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Regina","funders":"","keywords":"Digraph; Scrambling; Mathematics; Combinatorics; Upper and lower bounds; Eigenvalues and eigenvectors; Vertex (graph theory); Majorization; Integer (computer science); Multipartite; Discrete mathematics; Ergodicity; Mathematical analysis; Algorithm","authors":[{"name":"Mahmud Akelbek","is_ca":true},{"name":"Steve Kirkland","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03481283323268161,"gpt":0.295501362935932,"spread":0.2606885297032504,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001700463,0.001260959,0.00128155,0.003892784,0.0009442902,0.002938241,0.001128805,0.001054243,0.01095622],"category_scores_gemma":[0.01144522,0.0005199802,0.0006122292,0.001905299,0.003031221,0.004051608,0.001778865,0.00231993,0.001912327],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001061224,"about_ca_system_score_gemma":0.0009988424,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006109815,"about_ca_topic_score_gemma":0.0005406693,"domain_scores_codex":[0.9990509,0.000236314,0.00004979684,0.000125023,0.0003121785,0.0002258068],"domain_scores_gemma":[0.9940447,0.003166772,0.0008532914,0.000500348,0.0008164924,0.000618435],"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.00005254416,0.00002704208,0.0003284154,0.00006030598,0.00001270028,0.0001592451,0.0001467827,0.005139268,0.002513857,0.9834113,0.001364137,0.006784414],"study_design_scores_gemma":[0.00002918644,0.00004092931,0.001104049,0.00009360702,0.00003097927,0.0006175431,0.00009296984,0.06901161,0.005619023,0.9181561,0.00509674,0.0001073028],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5424743,0.003526364,0.2872055,0.002974048,0.001164587,0.0001134368,0.0006689192,0.0007115432,0.1611613],"genre_scores_gemma":[0.9620985,0.001945674,0.01169648,0.0002051582,0.0009550169,0.0001144145,0.0002737336,0.0003586452,0.02235239],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01095622,"threshold_uncertainty_score":0.03665221,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2098334461","doi":"10.1016/j.laa.2004.06.003","title":"Spectrally and inertially arbitrary sign patterns","year":2004,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Mathematics and Applications","field":"Mathematics","cited_by":49,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Redeemer University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Sign (mathematics); Mathematics; Class (philosophy); Order (exchange); Inertia; Spectrum (functional analysis); Mathematical analysis; Physics; Computer science; Classical mechanics; Artificial intelligence","authors":[{"name":"Michael Cavers","is_ca":true},{"name":"Kevin N. Vander Meulen","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02739573953427547,"gpt":0.2888283380878651,"spread":0.2614325985535896,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00073094,0.0006424608,0.0007083677,0.001511808,0.002340174,0.002993031,0.0008389402,0.001436193,0.01367351],"category_scores_gemma":[0.003453514,0.0004651164,0.0007102584,0.001149131,0.00447523,0.005728334,0.002687134,0.002410352,0.002493312],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004748857,"about_ca_system_score_gemma":0.0006662828,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003253425,"about_ca_topic_score_gemma":0.0004651581,"domain_scores_codex":[0.9991441,0.0001430108,0.00005403904,0.0001886364,0.0002323945,0.0002377512],"domain_scores_gemma":[0.9987028,0.0001803825,0.0002126155,0.0003026247,0.0003479056,0.0002536799],"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.00002619793,0.00001243655,0.0001085845,0.000007332799,0.000001406227,0.00004417055,0.00009900024,0.00007896263,0.0009384049,0.9942822,0.0008259129,0.003575293],"study_design_scores_gemma":[0.000009424924,0.00001485863,0.0001846253,0.000006051034,0.0000031756,0.0001590307,0.0001335362,0.001028797,0.0009239969,0.9942719,0.00325275,0.00001183098],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.4924238,0.000565285,0.2402262,0.003684654,0.002538987,0.00007199023,0.0003702193,0.0006077543,0.2595111],"genre_scores_gemma":[0.901175,0.0004686209,0.02743182,0.001091522,0.0007779867,0.00008701545,0.0003943703,0.0003880252,0.06818558],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01367351,"threshold_uncertainty_score":0.04574245,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2087638833","doi":"10.1016/j.laa.2011.11.015","title":"Bipartiteness and the least eigenvalue of signless Laplacian of graphs","year":2012,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Graph theory and applications","field":"Mathematics","cited_by":49,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Regina","funders":"","keywords":"Mathematics; Combinatorics; Algebraic connectivity; Social connectedness; Vertex (graph theory); Eigenvalues and eigenvectors; Simple graph; Graph; Discrete mathematics; Laplace operator; Laplacian matrix; Algebraic number; Mathematical analysis; Physics","authors":[{"name":"Shaun Fallat","is_ca":true},{"name":"Yi-Zheng Fan","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03119739482223361,"gpt":0.2938382310710607,"spread":0.2626408362488271,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00119234,0.0007588324,0.0008854729,0.002365867,0.001139043,0.002514407,0.001227534,0.001715513,0.005453605],"category_scores_gemma":[0.008150658,0.0005048364,0.0004727089,0.001321132,0.003902572,0.003609815,0.001315798,0.001895806,0.0006473174],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006607594,"about_ca_system_score_gemma":0.0006282931,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000851005,"about_ca_topic_score_gemma":0.000979131,"domain_scores_codex":[0.9991155,0.0003578408,0.00003661552,0.0001776363,0.0002014158,0.000110998],"domain_scores_gemma":[0.9941553,0.003345064,0.0008156433,0.0002821242,0.0006369012,0.0007649976],"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.00009462634,0.00007602962,0.0008723279,0.00008486006,0.00002071398,0.0001358434,0.0004390867,0.004140307,0.005323169,0.9783108,0.002529092,0.007973122],"study_design_scores_gemma":[0.00001386268,0.00001624309,0.0004505539,0.00001049207,0.000005732951,0.00009270637,0.00009974173,0.01491364,0.0004729088,0.9834366,0.0004667682,0.00002069518],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7130401,0.001411397,0.236618,0.004766176,0.0004544273,0.00004392593,0.0003294629,0.0003472972,0.04298926],"genre_scores_gemma":[0.9776676,0.0005614812,0.01284731,0.0004251867,0.0006397685,0.00005534837,0.0002106759,0.00009627533,0.007496409],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.005453605,"threshold_uncertainty_score":0.01824415,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2044994579","doi":"10.1016/j.laa.2010.01.027","title":"Bounds and conjectures for the signless Laplacian index of graphs","year":2010,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Graph theory and applications","field":"Mathematics","cited_by":48,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Mathematics; Combinatorics; Independence number; Vertex (graph theory); Algebraic number; Clique number; Upper and lower bounds; Spectral radius; Graph; Laplace operator; Domination analysis; Discrete mathematics; Eigenvalues and eigenvectors","authors":[{"name":"Pierre Hansen","is_ca":true},{"name":"Claire Lucas","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01986102366113922,"gpt":0.3019934772289365,"spread":0.2821324535677973,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006247361,0.001896847,0.003052189,0.007068141,0.002997558,0.008271559,0.006318578,0.004186478,0.01354155],"category_scores_gemma":[0.04085436,0.001232636,0.00158617,0.005490139,0.01163249,0.02169033,0.00542087,0.01209629,0.001886988],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003662577,"about_ca_system_score_gemma":0.001120299,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001293584,"about_ca_topic_score_gemma":0.001331763,"domain_scores_codex":[0.996316,0.001113499,0.0001735848,0.0008253299,0.00106231,0.0005092312],"domain_scores_gemma":[0.9606271,0.02913995,0.001971425,0.003306837,0.002228334,0.00272639],"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.0001224806,0.00008411648,0.0005780373,0.0001349741,0.00001825103,0.00006343901,0.000314405,0.002952821,0.0007775594,0.983731,0.005238867,0.005984095],"study_design_scores_gemma":[0.000009966349,0.000006921994,0.0001107279,0.00001698162,0.000006261563,0.00002103158,0.00003491757,0.006060197,0.000126798,0.9930646,0.0005300519,0.00001157959],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.3877392,0.0137847,0.3189315,0.0480301,0.003307209,0.00011464,0.001515685,0.00170911,0.2248679],"genre_scores_gemma":[0.9382489,0.003826474,0.03079775,0.003221147,0.005377089,0.0002598761,0.001036294,0.0005376855,0.01669485],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01354155,"threshold_uncertainty_score":0.04530102,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2091452762","doi":"10.1016/j.laa.2009.05.027","title":"Eigenvalues and colorings of digraphs","year":2009,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":48,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"","keywords":"Mathematics; Eigenvalues and eigenvectors; Combinatorics; Algebra over a field; Pure mathematics","authors":[{"name":"Bojan Mohar","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01563529270880379,"gpt":0.2878938864303953,"spread":0.2722585937215916,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006850329,0.0005812933,0.0006092698,0.003317215,0.00168314,0.003274646,0.0009769715,0.0009365821,0.009677658],"category_scores_gemma":[0.004855569,0.0007112565,0.0005612174,0.001585442,0.002072892,0.002332201,0.0009982616,0.001337017,0.001021188],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001273924,"about_ca_system_score_gemma":0.0005741644,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001126238,"about_ca_topic_score_gemma":0.00149673,"domain_scores_codex":[0.9993005,0.0001933962,0.00003415469,0.0001437806,0.000187892,0.0001402486],"domain_scores_gemma":[0.9965141,0.001841492,0.0003639077,0.0002589223,0.0004437028,0.0005779182],"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.00003640377,0.00003706057,0.0003687539,0.00003529606,0.000007686254,0.00007937555,0.0003341906,0.003073809,0.001896403,0.9851373,0.002221474,0.006772131],"study_design_scores_gemma":[0.0000120265,0.000006215356,0.0002751842,0.00001034249,0.000003340773,0.0000639611,0.0001217347,0.01156401,0.0003661776,0.9864002,0.001163846,0.00001289292],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6049039,0.000818991,0.2907253,0.001908312,0.0005488026,0.00009791683,0.0007275132,0.0007817603,0.09948756],"genre_scores_gemma":[0.9437154,0.0005465874,0.02974958,0.0002486871,0.0002809587,0.0001298828,0.0002968686,0.0002156954,0.02481642],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.009677658,"threshold_uncertainty_score":0.03237498,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2105432417","doi":"10.1016/j.laa.2009.01.015","title":"On a matrix decomposition of Hartwig and Spindelböck","year":2009,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":47,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"","keywords":"Corollary; Multilinear algebra; Mathematics; Multilinear map; Square matrix; Matrix (chemical analysis); Algebra over a field; Complex matrix; Linear algebra; Square (algebra); Pure mathematics; Decomposition; Combinatorics; Symmetric matrix; Jordan algebra; Eigenvalues and eigenvectors; Algebra representation","authors":[{"name":"Oskar Maria Baksalary","is_ca":false},{"name":"George P. H. Styan","is_ca":true},{"name":"Götz Trenkler","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.007704871102420895,"gpt":0.2784824719703337,"spread":0.2707776008679127,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000844663,0.0008937066,0.001068289,0.001489524,0.0009760109,0.001486098,0.0009060812,0.0006764902,0.009376423],"category_scores_gemma":[0.002488961,0.0003579117,0.0008044335,0.001831134,0.001460201,0.002512694,0.001759101,0.001878216,0.002482854],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005211878,"about_ca_system_score_gemma":0.0006016128,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001347932,"about_ca_topic_score_gemma":0.001466222,"domain_scores_codex":[0.999536,0.0001742611,0.00001604477,0.00007878813,0.0001379303,0.0000569287],"domain_scores_gemma":[0.9994835,0.000165663,0.00003977877,0.00008842695,0.000135975,0.00008662618],"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.00004503467,0.00003146833,0.00009127556,0.00004944605,0.00001244003,0.00005031369,0.0001298058,0.003867186,0.001102464,0.9716105,0.007716995,0.01529306],"study_design_scores_gemma":[0.00000958345,0.0000149704,0.0001055146,0.0000183182,0.000007566413,0.00004031668,0.00004249005,0.0287958,0.0004407414,0.9623591,0.008146757,0.00001904002],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08125433,0.005141567,0.8301627,0.00348333,0.002840659,0.0001044727,0.0005906686,0.000407337,0.07601492],"genre_scores_gemma":[0.5907491,0.004536014,0.2927665,0.002802831,0.002410959,0.0002160812,0.001049197,0.0008847754,0.1045845],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009376423,"threshold_uncertainty_score":0.0313673,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2104089751","doi":"10.1016/j.laa.2012.12.026","title":"Stability of linear gyroscopic systems: A review","year":2013,"lang":"en","type":"review","venue":"Linear Algebra and its Applications","topic":"Elasticity and Wave Propagation","field":"Engineering","cited_by":47,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Calgary","funders":"Alexander von Humboldt-Stiftung","keywords":"Controllability; Mathematical proof; Mathematics; Algebraic number; Perturbation (astronomy); Section (typography); Gyroscope; Linear system; Invariant (physics); Applied mathematics; Calculus (dental); Mathematical analysis; Computer science; Geometry; Physics; Mathematical physics","authors":[{"name":"Peter Lancaster","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04272817626277543,"gpt":0.2930933825567797,"spread":0.2503652062940043,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004999018,0.001149964,0.001659404,0.002857512,0.0003450117,0.001129745,0.0008058958,0.0009396623,0.003340242],"category_scores_gemma":[0.001039656,0.0004739282,0.0005283623,0.003570804,0.0006746497,0.001866591,0.000873856,0.0008095028,0.001507913],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004601508,"about_ca_system_score_gemma":0.001096061,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00101481,"about_ca_topic_score_gemma":0.001349464,"domain_scores_codex":[0.9998099,0.00002252791,0.00003169361,0.00004747921,0.00007288506,0.00001540673],"domain_scores_gemma":[0.9994357,0.0003013194,0.00007981732,0.00001791504,0.0001385321,0.00002666131],"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.00006326681,0.0000698712,0.0003292549,0.01930482,0.00009854998,0.0001035351,0.00007667647,0.002538705,0.002149771,0.008407766,0.01810263,0.9487553],"study_design_scores_gemma":[0.00003219733,0.000233993,0.001942412,0.006011585,0.0003054887,0.001324339,0.0001955603,0.003133645,0.002194653,0.01910495,0.9654093,0.0001119798],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"review","genre_gemma":"review","genre_scores_codex":[0.0002627412,0.9974102,0.001074785,0.0001139427,0.0001317927,0.000003726496,0.00002029444,0.0000121765,0.00097034],"genre_scores_gemma":[0.002645806,0.9957579,0.0006137597,0.00007584751,0.0003260744,0.000006406812,0.00003978712,0.000003248285,0.0005312587],"genre_candidate":"review","genre_consensus":"review","teacher_disagreement_score":0.003340242,"threshold_uncertainty_score":0.0111742,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}