{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":27,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":27,"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":"d0bd18469ffd","filters":{"venue":"Special Matrices"}},"results":[{"id":"W2898444729","doi":"10.1515/spma-2020-0132","title":"Graph isomorphism and Gaussian boson sampling","year":2021,"lang":"en","type":"article","venue":"Special Matrices","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":49,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Xanadu Quantum Technologies (Canada)","funders":"Oak Ridge National Laboratory; U.S. Department of Energy","keywords":"Graph isomorphism; Gaussian; Isospectral; Mathematics; Isomorphism (crystallography); Quantum graph; Discrete mathematics; Graph homomorphism; Graph; Combinatorics; Line graph; Voltage graph; Quantum mechanics; Pure mathematics; Physics","authors":[{"name":"Kamil Brádler","is_ca":false},{"name":"Shmuel Friedland","is_ca":false},{"name":"Josh Izaac","is_ca":true},{"name":"Nathan Killoran","is_ca":true},{"name":"Daiqin Su","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01315331725089142,"gpt":0.2410735215331349,"spread":0.2279202042822435,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001454221,0.0001807982,0.0004566457,0.0007300802,0.0006892531,0.0009130847,0.001047406,0.000837076,0.002863995],"category_scores_gemma":[0.006447837,0.0002276351,0.0003915758,0.0005207838,0.003040035,0.002306264,0.001519442,0.0009650711,0.0001684591],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001155906,"about_ca_system_score_gemma":0.0007815198,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008994168,"about_ca_topic_score_gemma":0.0008320022,"domain_scores_codex":[0.998785,0.0005315001,0.00002869453,0.0002223322,0.0002790461,0.0001534143],"domain_scores_gemma":[0.9968038,0.001696222,0.0002707671,0.0007708268,0.0002438379,0.0002145166],"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.00006640248,0.00004140049,0.0005992963,0.00001774861,0.00000775968,0.00004349762,0.00005877069,0.03042415,0.002066935,0.9614629,0.0003565865,0.004854552],"study_design_scores_gemma":[0.00001845465,0.00003377383,0.0003588501,0.000005434372,0.000004052116,0.00004919471,0.00003872008,0.3368835,0.002219883,0.6597266,0.000649791,0.0000117833],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4343992,0.0001167821,0.5525483,0.0009226781,0.00005323411,0.00008320647,0.0001279712,0.0003026041,0.01144597],"genre_scores_gemma":[0.9684045,0.0000347991,0.0299548,0.00008893894,0.00001989205,0.00004221971,0.00005361027,0.0000263824,0.001374909],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002863995,"threshold_uncertainty_score":0.009581029,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1491211998","doi":"10.1515/spma-2015-0022","title":"Symmetric Hadamard matrices of order 116and 172 exist","year":2015,"lang":"en","type":"article","venue":"Special Matrices","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":17,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Wilfrid Laurier University; University of Waterloo","funders":"","keywords":"Mathematics; Hadamard transform; Order (exchange); Complex Hadamard matrix; Hadamard's inequality; Hadamard matrix; Pure mathematics; Combinatorics; Algebra over a field; Mathematical analysis; Business","authors":[{"name":"Olivia Di Matteo","is_ca":true},{"name":"Dragomir Ž. Ðoković","is_ca":true},{"name":"Ilias Kotsireas","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01507463871047459,"gpt":0.2162788591133538,"spread":0.2012042204028792,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003534213,0.0005680191,0.0003819202,0.0009638154,0.0005991651,0.001028553,0.0004625928,0.0005912971,0.005559307],"category_scores_gemma":[0.001353551,0.0003237765,0.000529258,0.0006221828,0.0009376116,0.001186905,0.0006398003,0.001105672,0.001077677],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004770153,"about_ca_system_score_gemma":0.00047948,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002733295,"about_ca_topic_score_gemma":0.0003427691,"domain_scores_codex":[0.9995485,0.00008099585,0.00002522683,0.00007864744,0.0001886627,0.00007794177],"domain_scores_gemma":[0.9993448,0.0001505574,0.000121087,0.0001228523,0.0001527364,0.0001080468],"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.0001105303,0.00006971325,0.0007045403,0.00007289517,0.00001243961,0.0002622964,0.0001802216,0.006705821,0.02374225,0.9318458,0.002195477,0.03409803],"study_design_scores_gemma":[0.0001283916,0.0004831103,0.00122685,0.00005903502,0.00002668039,0.001178622,0.0002169762,0.09423678,0.06452701,0.7884707,0.04931725,0.0001286542],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4334978,0.0007396552,0.4731147,0.0006251512,0.0008681273,0.0001745951,0.0002667254,0.0005419076,0.09017134],"genre_scores_gemma":[0.8522251,0.0002680986,0.1310331,0.0002657508,0.0001486368,0.00009082578,0.0002704901,0.00008502878,0.01561303],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005559307,"threshold_uncertainty_score":0.01859772,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2067092314","doi":"10.2478/spma-2014-0004","title":"On the Relationships between Zero Forcing Numbers and Certain Graph Coverings","year":2014,"lang":"en","type":"article","venue":"Special Matrices","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Regina","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Graph; Discrete mathematics; Cubic graph; Line graph; Voltage graph; Butterfly graph; Upper and lower bounds; Mathematical analysis","authors":[{"name":"Fatemeh Alinaghipour","is_ca":true},{"name":"Shaun Fallat","is_ca":true},{"name":"Karen Meagher","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02862864413862354,"gpt":0.2698224245484369,"spread":0.2411937804098134,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00111334,0.0004234918,0.0004642097,0.002044004,0.001112071,0.00179952,0.0006901224,0.0007460635,0.004692959],"category_scores_gemma":[0.008436671,0.0003594884,0.0003905193,0.001047438,0.003550282,0.002965079,0.00135462,0.001096242,0.0003753461],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001203306,"about_ca_system_score_gemma":0.0004079255,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006982264,"about_ca_topic_score_gemma":0.0009002519,"domain_scores_codex":[0.9992161,0.0001819068,0.00004784105,0.000173657,0.0002183104,0.0001620678],"domain_scores_gemma":[0.9885435,0.008333103,0.001210691,0.0006565955,0.0005310577,0.0007251202],"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.0001124482,0.00003103761,0.001994496,0.00005927857,0.000009259305,0.0001667499,0.0003094361,0.01113042,0.006858617,0.9697559,0.0007979374,0.00877456],"study_design_scores_gemma":[0.00001814949,0.00006388278,0.001300628,0.00002802407,0.00001014721,0.0003239922,0.0001456093,0.03938442,0.004045307,0.9527772,0.001872479,0.00003007198],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8334678,0.0002799644,0.1356003,0.0005131636,0.00006037525,0.00004298847,0.0001974227,0.0002087194,0.02962917],"genre_scores_gemma":[0.985036,0.0001401627,0.01279327,0.00007620562,0.00005758071,0.00003364488,0.0001146039,0.00004711439,0.001701521],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.004692959,"threshold_uncertainty_score":0.01569957,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1982968438","doi":"10.2478/spma-2014-0007","title":"The theory and applications of complex matrix scalings","year":2014,"lang":"en","type":"article","venue":"Special Matrices","topic":"Quantum Information and Cryptography","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Guelph","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Invertible matrix; Diagonal; Conjecture; Positive-definite matrix; Diagonal matrix; Matrix (chemical analysis); Combinatorics; Pure mathematics; Scaling; Quantum mechanics; Physics","authors":[{"name":"Rajesh Pereira","is_ca":true},{"name":"Joanna Boneng","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.006287737367324349,"gpt":0.2445090554113812,"spread":0.2382213180440568,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001246397,0.0004775369,0.0004832904,0.001887764,0.001170617,0.00165677,0.0006104335,0.0008940541,0.006250597],"category_scores_gemma":[0.006407569,0.0002971536,0.0004745339,0.001095621,0.00460803,0.003302934,0.001439449,0.001404199,0.000556447],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009084992,"about_ca_system_score_gemma":0.0003989371,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004577794,"about_ca_topic_score_gemma":0.0002225823,"domain_scores_codex":[0.9991704,0.0002713945,0.00004533774,0.0001581331,0.0002539731,0.0001007433],"domain_scores_gemma":[0.9969014,0.001411778,0.0003987396,0.0005584693,0.0004743683,0.0002553201],"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.000007242263,0.000008004164,0.0001123177,0.0000169295,0.000002404711,0.00005033483,0.00005797024,0.002303205,0.0006056743,0.9921662,0.0007269825,0.003942725],"study_design_scores_gemma":[0.000004592402,0.00001629366,0.000144423,0.00001404329,0.000001668639,0.00009763112,0.00004202375,0.02035557,0.000426202,0.974268,0.004620876,0.000008680399],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2668858,0.004745698,0.5277113,0.005049643,0.001688119,0.0001259954,0.0002551663,0.0004703722,0.1930678],"genre_scores_gemma":[0.9564714,0.001356214,0.03215301,0.0004742054,0.001033408,0.0001004821,0.0000701243,0.00006638703,0.008274834],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006250597,"threshold_uncertainty_score":0.02091032,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2996622318","doi":"10.1515/spma-2019-0022","title":"Achievable multiplicity partitions in the inverse eigenvalue problem of a graph","year":2019,"lang":"en","type":"article","venue":"Special Matrices","topic":"Graph theory and applications","field":"Mathematics","cited_by":8,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Brandon University; University of Regina","funders":"Palestine Polytechnic University; Canada Research Chairs; Deutscher Akademischer Austauschdienst; Natural Sciences and Engineering Research Council of Canada; European Commission; Universität Konstanz; Bundesministerium für Bildung und Forschung; University of Regina","keywords":"Mathematics; Combinatorics; Multiplicity (mathematics); Indifference graph; Partition (number theory); Diagonal; Discrete mathematics; Eigenvalues and eigenvectors; Chordal graph; Cograph; Graph; 1-planar graph","authors":[{"name":"Mohammad Adm","is_ca":false},{"name":"Shaun Fallat","is_ca":true},{"name":"Karen Meagher","is_ca":true},{"name":"Shahla Nasserasr","is_ca":true},{"name":"Sarah Plosker","is_ca":true},{"name":"Boting Yang","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02902387294734162,"gpt":0.288474923220522,"spread":0.2594510502731804,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001540029,0.0009316311,0.001130906,0.001113531,0.00185448,0.002274459,0.001368319,0.001871741,0.004512107],"category_scores_gemma":[0.008709992,0.0009710052,0.0007141501,0.0007600097,0.002636175,0.00332627,0.00217059,0.001755219,0.0005256748],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001331629,"about_ca_system_score_gemma":0.000579644,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005365901,"about_ca_topic_score_gemma":0.000622261,"domain_scores_codex":[0.9985377,0.0005187436,0.00005711148,0.0003247125,0.0002528251,0.0003089335],"domain_scores_gemma":[0.9942775,0.003411184,0.0006612834,0.0006839292,0.0003224821,0.0006435821],"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.0008348976,0.0002088732,0.001839944,0.0002039494,0.00009212949,0.0008910412,0.0009270073,0.1442444,0.01848492,0.8130595,0.005246608,0.01396676],"study_design_scores_gemma":[0.00006816482,0.0001129655,0.0005581873,0.00003232387,0.00002324891,0.0004146364,0.0003624212,0.2205698,0.00697246,0.7687197,0.002128034,0.00003790587],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7672588,0.0002204597,0.20669,0.001081586,0.00006195001,0.00008620476,0.0002976209,0.0003242279,0.02397917],"genre_scores_gemma":[0.9707543,0.00008480644,0.02558946,0.00009836715,0.00003900469,0.00007523601,0.0001810096,0.00009318234,0.003084696],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.004512107,"threshold_uncertainty_score":0.01509446,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2762977785","doi":"10.1515/spma-2018-0002","title":"Construction of symmetric Hadamard matrices of order 4v for v = 47, 73, 113","year":2018,"lang":"en","type":"article","venue":"Special Matrices","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":8,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Hadamard transform; Complex Hadamard matrix; Hadamard's inequality; Hadamard's maximal determinant problem; Hadamard product; Cover (algebra)","authors":[],"retraction":null,"screen_n_in":null,"score":{"opus":0.006837211532872308,"gpt":0.2105299358787232,"spread":0.2036927243458508,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003571458,0.0003384041,0.0003843415,0.001190422,0.0007685584,0.0009323903,0.0004312985,0.0004720045,0.003691283],"category_scores_gemma":[0.001214989,0.0002996869,0.0004652925,0.0005413701,0.00096719,0.0006622485,0.0006127832,0.000913811,0.000528205],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000445793,"about_ca_system_score_gemma":0.0005347976,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003219524,"about_ca_topic_score_gemma":0.0004150775,"domain_scores_codex":[0.9996679,0.00009768541,0.00001662197,0.00003696933,0.0001086912,0.00007226339],"domain_scores_gemma":[0.9994674,0.0001978762,0.00008675534,0.000114083,0.00007363104,0.00006020478],"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.0001539988,0.00006322365,0.001190133,0.0001496708,0.00002458109,0.0009093268,0.0005752987,0.0087974,0.05435719,0.89861,0.002261751,0.03290737],"study_design_scores_gemma":[0.00009871928,0.0004722996,0.002081523,0.0001154898,0.00004166437,0.001969538,0.0007796795,0.1062818,0.1900207,0.6616143,0.03635841,0.0001658503],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7519817,0.0005384818,0.187416,0.0004928858,0.000296989,0.0001092378,0.0002104623,0.0004041413,0.05855008],"genre_scores_gemma":[0.9480606,0.0001741744,0.04644209,0.00007746704,0.00003175707,0.00003929494,0.0001157039,0.00005077225,0.005008203],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.003691283,"threshold_uncertainty_score":0.01234859,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4392134068","doi":"10.1515/spma-2023-0113","title":"The diameter of the Birkhoff polytope","year":2024,"lang":"en","type":"article","venue":"Special Matrices","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":8,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Université TÉLUQ; Université Laval","funders":"Fonds de recherche du Québec – Nature et technologies; Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Polytope; Combinatorics; Birkhoff polytope; Mathematical economics; Regular polygon; Geometry; Convex set","authors":[{"name":"Ludovick Bouthat","is_ca":true},{"name":"Javad Mashreghi","is_ca":true},{"name":"Frédéric Morneau-Guérin","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02226218370481003,"gpt":0.3084088217681156,"spread":0.2861466380633056,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009689863,0.0005863153,0.0008885281,0.001577024,0.001048709,0.002908021,0.0008306935,0.000576822,0.009484557],"category_scores_gemma":[0.00368927,0.0004291467,0.0004110791,0.0005665743,0.002089029,0.002738435,0.00164195,0.001531688,0.001227216],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001378987,"about_ca_system_score_gemma":0.0004465941,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002042533,"about_ca_topic_score_gemma":0.0008168318,"domain_scores_codex":[0.9988807,0.0002503889,0.00003964037,0.0002587491,0.0003504761,0.0002200978],"domain_scores_gemma":[0.9966625,0.001625487,0.0003901905,0.0001516042,0.00045349,0.0007168165],"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.0001854554,0.00003470207,0.001400414,0.0001063587,0.00002235895,0.0001348149,0.0002006067,0.01075713,0.003424042,0.9680101,0.004248029,0.01147593],"study_design_scores_gemma":[0.00005398341,0.000183528,0.006344057,0.0000994389,0.00002679386,0.000587412,0.0004178097,0.1512193,0.003650965,0.8166528,0.02068653,0.00007738182],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6370281,0.003517107,0.2257682,0.002053069,0.0003931317,0.00007897349,0.001763009,0.00044262,0.1289558],"genre_scores_gemma":[0.9747894,0.0009479082,0.01180461,0.0001376709,0.0002680368,0.0001030377,0.0007534847,0.00009146056,0.01110431],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.009484557,"threshold_uncertainty_score":0.03172898,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2325676038","doi":"10.1515/spma-2016-0003","title":"Pentadiagonal Companion Matrices","year":2015,"lang":"en","type":"article","venue":"Special Matrices","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Redeemer University","funders":"","keywords":"Transpose; Mathematics; Factorization; Matrix (chemical analysis); Sparse matrix; Permutation matrix; Permutation (music); Matrix decomposition; Combinatorics; Algorithm","authors":[{"name":"Brydon Eastman","is_ca":true},{"name":"Kevin N. Vander Meulen","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02400873412599397,"gpt":0.258861157228126,"spread":0.2348524231021321,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003756794,0.0005589006,0.0004904157,0.0009793969,0.0005420695,0.001141234,0.0004825964,0.0005321606,0.0118557],"category_scores_gemma":[0.003715268,0.000205262,0.0003108081,0.0006900589,0.0009635735,0.001242421,0.0008752475,0.0008901835,0.001816212],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003237765,"about_ca_system_score_gemma":0.0003693452,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000729835,"about_ca_topic_score_gemma":0.0006206086,"domain_scores_codex":[0.999397,0.0001145691,0.00002746347,0.0001673574,0.0002058985,0.00008767835],"domain_scores_gemma":[0.9985932,0.0003256677,0.0002566102,0.0002895019,0.0003941497,0.0001409072],"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.0004150556,0.000137664,0.002245724,0.0002227683,0.00006574258,0.0007742244,0.0004668478,0.06516811,0.03226398,0.7319149,0.01581042,0.1505145],"study_design_scores_gemma":[0.00004466022,0.0002192002,0.001736475,0.00002897379,0.0000153431,0.0008463338,0.0001917027,0.3430644,0.0133827,0.6199064,0.02050634,0.00005755585],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2086724,0.0003444721,0.7479189,0.0004099095,0.0002476898,0.0001710338,0.0005970166,0.0008858421,0.04075282],"genre_scores_gemma":[0.8778623,0.0002224013,0.1010883,0.000294037,0.0002095522,0.0001026431,0.0008352827,0.0001499805,0.0192355],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.0118557,"threshold_uncertainty_score":0.03966123,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2975313719","doi":"10.1515/spma-2019-0012","title":"Computational methods for difference families in finite abelian groups","year":2019,"lang":"en","type":"article","venue":"Special Matrices","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Wilfrid Laurier University; University of Waterloo","funders":"","keywords":"Mathematics; Abelian group; Pure mathematics; Algebra over a field","authors":[{"name":"Dragomir Ž. Ðoković","is_ca":true},{"name":"Ilias Kotsireas","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0098922211831459,"gpt":0.2621349386192329,"spread":0.252242717436087,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002976729,0.0004277994,0.0007935642,0.001743989,0.0006877705,0.001220342,0.001423583,0.0007944926,0.006115111],"category_scores_gemma":[0.01400425,0.0002847057,0.0007253292,0.0009135972,0.002400748,0.002529637,0.001977131,0.001324983,0.0004733855],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001112946,"about_ca_system_score_gemma":0.001006989,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009779363,"about_ca_topic_score_gemma":0.00120227,"domain_scores_codex":[0.9985875,0.0007523043,0.00005491065,0.0001228331,0.0003755356,0.0001069688],"domain_scores_gemma":[0.9853322,0.01298668,0.000320212,0.0005701943,0.000619643,0.0001710834],"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.00008432266,0.00006745046,0.0009144906,0.000127949,0.00002540349,0.00007724249,0.0001391703,0.1471262,0.0006017078,0.8173037,0.001082863,0.03244956],"study_design_scores_gemma":[0.0000169753,0.00001748584,0.00007129894,0.00001417606,0.000002900286,0.00002091505,0.00003731633,0.640078,0.0003147623,0.3585479,0.0008724174,0.000005904988],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04245836,0.0002052746,0.949178,0.0005531681,0.00004583196,0.00008776417,0.0001087565,0.0001302182,0.007232777],"genre_scores_gemma":[0.5082088,0.000271052,0.4851594,0.0001840402,0.0001532578,0.0003750015,0.0002904277,0.0001011216,0.005256801],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006115111,"threshold_uncertainty_score":0.02045709,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4388579442","doi":"10.1515/spma-2023-0105","title":"Legendre pairs of lengths<i>ℓ</i>≡ 0 (mod 5)","year":2023,"lang":"en","type":"article","venue":"Special Matrices","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Wilfrid Laurier University","funders":"Austrian Science Fund; U.S. Department of Defense","keywords":"Mathematics; Conjecture; Combinatorics","authors":[{"name":"Ilias Kotsireas","is_ca":true},{"name":"Christoph Koutschan","is_ca":false},{"name":"Dursun A. Bulutoglu","is_ca":false},{"name":"David M. Arquette","is_ca":false},{"name":"Jonathan Turner","is_ca":false},{"name":"Kenneth J. Ryan","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01374509650744896,"gpt":0.233473970898371,"spread":0.219728874390922,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005215612,0.0006771526,0.0004560244,0.001162676,0.00110168,0.001155694,0.0006561921,0.0007287029,0.01536469],"category_scores_gemma":[0.003215227,0.0002793193,0.0005325376,0.0005847714,0.001225257,0.001467343,0.001113236,0.001027879,0.001338182],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005097191,"about_ca_system_score_gemma":0.0003665172,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003038064,"about_ca_topic_score_gemma":0.0002966139,"domain_scores_codex":[0.9994187,0.0001179997,0.00002549923,0.0001071048,0.0001643889,0.0001662626],"domain_scores_gemma":[0.9990049,0.0003103451,0.0002496472,0.0001646502,0.0001045338,0.0001659631],"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.001147952,0.0001725651,0.005570545,0.0001656143,0.00005699327,0.0009241984,0.0006144429,0.005389982,0.03838638,0.9001635,0.008284864,0.03912288],"study_design_scores_gemma":[0.0002639541,0.001101016,0.01244665,0.0001345652,0.00008810423,0.001949855,0.0009623294,0.07003369,0.06634407,0.8175538,0.02889955,0.0002224143],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"other","genre_scores_codex":[0.9201103,0.0002180229,0.03734905,0.0005724752,0.0002240513,0.0000640057,0.0002146194,0.0004053561,0.0408421],"genre_scores_gemma":[0.9770199,0.0001015935,0.01097954,0.0002538497,0.0001854963,0.00009740631,0.0003820799,0.0001509594,0.01082912],"genre_candidate":"other","genre_consensus":null,"teacher_disagreement_score":0.01536469,"threshold_uncertainty_score":0.05139995,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4200582650","doi":"10.1515/spma-2021-0151","title":"On some reciprocal matrices with elliptical components of their Kippenhahn curves","year":2021,"lang":"en","type":"article","venue":"Special Matrices","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"York University; New York University Abu Dhabi","keywords":"Reciprocal; Mathematics; Tridiagonal matrix; Corollary; Ellipse; Rank (graph theory); Diagonal; Matrix (chemical analysis); Pure mathematics; Diagonally dominant matrix; Range (aeronautics); Numerical range; Combinatorics; Geometry; Eigenvalues and eigenvectors; Invertible matrix","authors":[{"name":"Muyan Jiang","is_ca":false},{"name":"Ilya M. Spitkovsky","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01397295708019065,"gpt":0.2344114637116398,"spread":0.2204385066314492,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000916846,0.0005171135,0.0003092032,0.00193465,0.0006134,0.001410945,0.0004770624,0.0005703861,0.007520191],"category_scores_gemma":[0.008477989,0.0002307656,0.0003453953,0.0009135751,0.001760135,0.001847758,0.0008980258,0.0007600724,0.001409213],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005307273,"about_ca_system_score_gemma":0.0002040988,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004596338,"about_ca_topic_score_gemma":0.0002792873,"domain_scores_codex":[0.9992452,0.0002297294,0.00003860045,0.0001041189,0.0002709453,0.0001114743],"domain_scores_gemma":[0.9969796,0.001530324,0.0004640957,0.0002950655,0.0004770337,0.0002538503],"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.00008016559,0.00002545732,0.0007309676,0.0000468713,0.000006236783,0.0002091265,0.0003431085,0.01041646,0.004446005,0.9612518,0.001339763,0.02110403],"study_design_scores_gemma":[0.00003156062,0.00009925995,0.0009829876,0.00005397267,0.000007671902,0.001006857,0.0003163143,0.1251841,0.008360157,0.8545752,0.009324184,0.0000578091],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5574601,0.000592945,0.3758815,0.0004619898,0.00006861009,0.00008724662,0.0002593251,0.0004640324,0.06472433],"genre_scores_gemma":[0.9518163,0.0003096996,0.03918285,0.00009116258,0.00008508249,0.00006653003,0.0001848453,0.0001032771,0.008160347],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.007520191,"threshold_uncertainty_score":0.02515757,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3110225681","doi":"10.1515/spma-2020-0117","title":"Corrigendum to “Achievable Multiplicity partitions in the Inverse Eigenvalue Problem of a graph” [Spec. Matrices 2019; 7:276-290.]","year":2020,"lang":"en","type":"erratum","venue":"Special Matrices","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Brandon University; University of Regina","funders":"","keywords":"Spec#; Multiplicity (mathematics); Mathematics; Lemma (botany); Inverse; Eigenvalues and eigenvectors; Combinatorics; Graph; Discrete mathematics; Computer science; Mathematical analysis; Physics; Geometry","authors":[{"name":"Mohammad Adm","is_ca":false},{"name":"Shaun Fallat","is_ca":true},{"name":"Karen Meagher","is_ca":true},{"name":"Shahla Nasserasr","is_ca":true},{"name":"Sarah Plosker","is_ca":true},{"name":"Boting Yang","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02536022525027627,"gpt":0.2488532459624548,"spread":0.2234930207121786,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002789128,0.002076515,0.002415588,0.003259869,0.002584198,0.00253684,0.003318858,0.004093812,0.09387609],"category_scores_gemma":[0.02099718,0.0009030531,0.001787645,0.002259248,0.002977353,0.00333764,0.002042094,0.006385367,0.03221577],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.006197305,"about_ca_system_score_gemma":0.001753069,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01206461,"about_ca_topic_score_gemma":0.01469886,"domain_scores_codex":[0.9960619,0.001048654,0.0002926293,0.0006786182,0.0015998,0.0003185422],"domain_scores_gemma":[0.9924136,0.002592494,0.0002808663,0.0007132781,0.003614111,0.0003856548],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00003884683,0.00001333971,0.000037787,0.0001161146,0.0000121705,0.0001101396,0.00003021614,0.0002401994,0.0001213363,0.009080498,0.9849892,0.005210226],"study_design_scores_gemma":[0.00004460314,0.00006067173,0.0008847786,0.0002574748,0.00005626162,0.0004520561,0.00007761898,0.004669471,0.001572645,0.05390336,0.9379081,0.0001129775],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","genre_codex":"editorial","genre_gemma":"other","genre_scores_codex":[0.0007796327,0.00649583,0.01510253,0.1005592,0.8183672,0.00009054015,0.001366444,0.001088703,0.05614986],"genre_scores_gemma":[0.05196972,0.01539628,0.0194299,0.08201441,0.2513894,0.0004608037,0.00357383,0.003070553,0.5726951],"genre_candidate":"other","genre_consensus":null,"teacher_disagreement_score":0.09387609,"threshold_uncertainty_score":0.3140468,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2344140520","doi":"10.1515/spma-2016-0014","title":"On the cardinality of complex matrix scalings","year":2016,"lang":"en","type":"article","venue":"Special Matrices","topic":"Random Matrices and Applications","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Guelph","funders":"","keywords":"Cardinality (data modeling); Upper and lower bounds; Mathematics; Conjecture; Combinatorics; Matrix (chemical analysis); Discrete mathematics; Computer science; Mathematical analysis","authors":[{"name":"George Hutchinson","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.06550052626739573,"gpt":0.3441745277099986,"spread":0.2786740014426029,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005455638,0.0006192927,0.001917987,0.002774899,0.002784688,0.004044347,0.001761743,0.001574908,0.005446272],"category_scores_gemma":[0.04296228,0.0008492403,0.001005789,0.001310673,0.00630176,0.006118421,0.003772126,0.003094291,0.0005132403],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001131672,"about_ca_system_score_gemma":0.000725278,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005477421,"about_ca_topic_score_gemma":0.0003078704,"domain_scores_codex":[0.9945624,0.001937647,0.0003462697,0.001031876,0.00143037,0.0006913519],"domain_scores_gemma":[0.9304672,0.04968235,0.004892187,0.007876719,0.003281162,0.003800428],"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.0003149461,0.00006778056,0.00484513,0.0001570211,0.00005028192,0.0002682768,0.0003946559,0.01341491,0.004932837,0.9647978,0.004460409,0.006295938],"study_design_scores_gemma":[0.00006416046,0.00009464349,0.002690359,0.00008013322,0.00002256279,0.0005661533,0.0001934253,0.1492951,0.003035197,0.8403114,0.003579434,0.00006735729],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8544962,0.001195726,0.1052472,0.004592661,0.0003503276,0.00007588037,0.001473966,0.0003926141,0.03217544],"genre_scores_gemma":[0.989014,0.0003656409,0.008194721,0.0002288445,0.0004039764,0.00009348144,0.0003689564,0.00006494374,0.001265479],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.005455638,"threshold_uncertainty_score":0.02885252,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2124912997","doi":"10.2478/spma-2014-0008","title":"Inverses and eigenvalues of diamondalternating sign matrices","year":2014,"lang":"en","type":"article","venue":"Special Matrices","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada; University of Victoria","keywords":"Eigenvalues and eigenvectors; Mathematics; Sign (mathematics); Inverse; Diamond; Binomial theorem; Matrix (chemical analysis); Combinatorics; Binomial coefficient; Polynomial; Binomial (polynomial); Characteristic polynomial; Pure mathematics; Mathematical analysis; Geometry; Physics; Statistics; Quantum mechanics","authors":[{"name":"Minerva Catral","is_ca":false},{"name":"Minghua Lin","is_ca":true},{"name":"D.D. Olesky","is_ca":true},{"name":"P. van den Driessche","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.009672768240546798,"gpt":0.2312013365552048,"spread":0.221528568314658,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004156814,0.0003551572,0.0001998089,0.0007626725,0.0003021657,0.000708736,0.0003181302,0.0003623528,0.006191047],"category_scores_gemma":[0.003112355,0.0001660306,0.0001678768,0.0003091711,0.00102543,0.0007111785,0.0005850306,0.0005084271,0.0006166436],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002706961,"about_ca_system_score_gemma":0.0002384182,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003703862,"about_ca_topic_score_gemma":0.0005220399,"domain_scores_codex":[0.9995483,0.000105459,0.00001792535,0.0000603208,0.0002079904,0.0000600049],"domain_scores_gemma":[0.9989004,0.0003795031,0.0001762724,0.0001180081,0.0002989688,0.0001267661],"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.0002297241,0.0001040795,0.001942167,0.000117111,0.0000155894,0.000717258,0.0004826481,0.02127657,0.04993518,0.8609294,0.003638348,0.060612],"study_design_scores_gemma":[0.00004490341,0.000125088,0.002130561,0.00004685014,0.000007614235,0.001098573,0.000281714,0.249826,0.02078082,0.7173123,0.008279465,0.00006598724],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5771024,0.0002109695,0.392831,0.000245072,0.0001380866,0.00005094872,0.0001666097,0.0003134014,0.02894151],"genre_scores_gemma":[0.9465374,0.0001016891,0.04710264,0.00004370956,0.00003479215,0.00003031507,0.00009169622,0.00004617332,0.00601167],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.006191047,"threshold_uncertainty_score":0.02071112,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2775700832","doi":"10.1515/spma-2017-0022","title":"A counterexample to the Drury permanent conjecture","year":2017,"lang":"en","type":"article","venue":"Special Matrices","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Guelph","funders":"","keywords":"Counterexample; Conjecture; Mathematics; Positive-definite matrix; Matrix (chemical analysis); Combinatorics; Semidefinite programming; Pure mathematics; Discrete mathematics; Mathematical optimization","authors":[{"name":"George Hutchinson","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01422740743193453,"gpt":0.2618586584246281,"spread":0.2476312509926935,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002047021,0.000444299,0.001010979,0.001398305,0.002123068,0.003059602,0.001372873,0.002658861,0.01077864],"category_scores_gemma":[0.01228959,0.0004213901,0.0005616658,0.001233414,0.005131823,0.003862255,0.003413928,0.003016427,0.0008708328],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008708374,"about_ca_system_score_gemma":0.0004961255,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000410929,"about_ca_topic_score_gemma":0.0003776,"domain_scores_codex":[0.997764,0.0005990164,0.00009415815,0.0005196687,0.0006004726,0.000422692],"domain_scores_gemma":[0.9887159,0.007569156,0.0009845437,0.001381717,0.0006586342,0.0006900252],"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.0003263145,0.00006743436,0.001243245,0.00007724114,0.00001982525,0.0006374196,0.0003541367,0.004496516,0.001567768,0.973696,0.01155525,0.005958722],"study_design_scores_gemma":[0.0001323014,0.00008002001,0.0006905252,0.00003806339,0.00001660507,0.0007403437,0.0003090516,0.03257041,0.002458616,0.9532831,0.009639976,0.00004105336],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7852201,0.0008355472,0.09095541,0.02478178,0.001266834,0.00005428949,0.0007535269,0.001087049,0.09504551],"genre_scores_gemma":[0.9909635,0.0001369739,0.004434407,0.0007486371,0.0003248574,0.00003266902,0.0002021085,0.00005122384,0.003105559],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01077864,"threshold_uncertainty_score":0.03605813,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1202646857","doi":"10.1515/spma-2015-0007","title":"Completely positive matrices over Boolean algebras and their CP-rank","year":2015,"lang":"en","type":"article","venue":"Special Matrices","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Guelph","funders":"","keywords":"Mathematics; Rank (graph theory); Boolean algebras canonically defined; Stone's representation theorem for Boolean algebras; Boolean algebra; Combinatorics; Two-element Boolean algebra; Algebra over a field; Pure mathematics; Discrete mathematics; Algebra representation","authors":[{"name":"Preeti Mohindru","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01854401980917909,"gpt":0.2380240143071797,"spread":0.2194799944980006,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002143922,0.0005124772,0.0005474581,0.001705113,0.000922617,0.003038417,0.0007735356,0.0005845526,0.00512024],"category_scores_gemma":[0.009901971,0.0004432174,0.000485204,0.0009903564,0.003290193,0.004648548,0.001626674,0.001715253,0.0004556763],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009840496,"about_ca_system_score_gemma":0.0007835519,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008072194,"about_ca_topic_score_gemma":0.0006576731,"domain_scores_codex":[0.9978731,0.0005530777,0.0001436553,0.0003452418,0.0007103595,0.0003744778],"domain_scores_gemma":[0.9898868,0.00504498,0.001651344,0.0009137088,0.001390867,0.001112173],"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.0001821655,0.00004731477,0.00119058,0.00009042786,0.00002163648,0.0002028462,0.0003262895,0.005307812,0.006987048,0.974743,0.001315264,0.009585717],"study_design_scores_gemma":[0.00003472385,0.00011216,0.0009533322,0.0000228433,0.00001354892,0.0003695191,0.0001655208,0.0329796,0.0061687,0.9565517,0.002581098,0.00004716344],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8083745,0.0009748015,0.1480319,0.001408054,0.0001022649,0.00007014495,0.0004837586,0.0002407482,0.04031383],"genre_scores_gemma":[0.9894391,0.0001798186,0.008560169,0.00008464298,0.0000920099,0.00002379868,0.0001192881,0.00001500314,0.001486204],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.00512024,"threshold_uncertainty_score":0.01712894,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3130990978","doi":"10.1515/spma-2020-0126","title":"An elementary proof of Chollet’s permanent conjecture for 4 × 4 real matrices","year":2021,"lang":"en","type":"article","venue":"Special Matrices","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Lakehead University","funders":"","keywords":"Elementary proof; Mathematics; Statement (logic); Conjecture; Simple (philosophy); Algebra over a field; Linear algebra; Positive-definite matrix; Combinatorics; Pure mathematics; Discrete mathematics; Eigenvalues and eigenvectors","authors":[{"name":"George Hutchinson","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01098794063080708,"gpt":0.266843630931543,"spread":0.2558556903007358,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001566327,0.0008757568,0.0008207643,0.001088075,0.0007164658,0.001571997,0.00106821,0.000799888,0.02475407],"category_scores_gemma":[0.005326909,0.0004346734,0.0008555473,0.0007555611,0.002812229,0.003014813,0.002810759,0.003254358,0.002955078],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008674452,"about_ca_system_score_gemma":0.0007256769,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005617507,"about_ca_topic_score_gemma":0.0007053528,"domain_scores_codex":[0.9991902,0.0001312387,0.00003546348,0.0001657223,0.0003158783,0.0001615096],"domain_scores_gemma":[0.9965305,0.001995376,0.0002482251,0.0004978652,0.0004492187,0.0002789111],"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.0001655797,0.00008176264,0.0004289708,0.0002134791,0.00002752021,0.0003871799,0.0002134402,0.006560585,0.006236443,0.9515093,0.01443816,0.0197376],"study_design_scores_gemma":[0.00005627274,0.00009700238,0.0005665406,0.00003060926,0.00001104276,0.0001528041,0.00006406197,0.02048393,0.004405372,0.9625155,0.01158497,0.00003191927],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2267839,0.001092735,0.5790387,0.005934211,0.001836841,0.0001572796,0.001285778,0.001389832,0.1824808],"genre_scores_gemma":[0.8939297,0.0005455083,0.0762612,0.001432484,0.0008512987,0.0001427042,0.000501051,0.0003234149,0.02601268],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02475407,"threshold_uncertainty_score":0.08281064,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4304184215","doi":"10.1515/spma-2022-0173","title":"The complete positivity of symmetric tridiagonal and pentadiagonal matrices","year":2022,"lang":"en","type":"article","venue":"Special Matrices","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Brandon University; University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Tridiagonal matrix; Mathematics; Rank (graph theory); Tridiagonal matrix algorithm; Mathematical proof; Simple (philosophy); Matrix (chemical analysis); Combinatorics; Decomposition; Pure mathematics; Algebra over a field; Discrete mathematics; Eigenvalues and eigenvectors","authors":[{"name":"Lei Cao","is_ca":false},{"name":"Darian McLaren","is_ca":true},{"name":"Sarah Plosker","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01153455255066171,"gpt":0.2278982344093707,"spread":0.216363681858709,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001704208,0.0006815675,0.0004718286,0.001038714,0.0007574167,0.001827772,0.0004517139,0.0005456715,0.006221398],"category_scores_gemma":[0.005486696,0.0003557534,0.000540277,0.0006492946,0.002665132,0.001884265,0.001832454,0.001622959,0.001237406],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003666047,"about_ca_system_score_gemma":0.0006134412,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004139786,"about_ca_topic_score_gemma":0.0004105277,"domain_scores_codex":[0.9986144,0.000409299,0.00008470927,0.0001907877,0.0004370537,0.0002636433],"domain_scores_gemma":[0.9964619,0.0009455,0.0004584751,0.0006093738,0.00100883,0.0005158802],"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.00005937843,0.00002281074,0.0004827372,0.0000483509,0.000009797091,0.0002541028,0.0003042726,0.005328807,0.006640765,0.9743763,0.002556148,0.009916632],"study_design_scores_gemma":[0.00001791605,0.00005871664,0.0005545656,0.00003476813,0.000009996867,0.0005790042,0.0002521635,0.06043815,0.007234921,0.9237928,0.006991989,0.00003500328],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1431247,0.0002301791,0.8154114,0.0006083231,0.0002046512,0.00009758041,0.0003029943,0.0002685964,0.03975158],"genre_scores_gemma":[0.890845,0.0002676403,0.09922609,0.0003528023,0.000166612,0.0001640873,0.0002928856,0.0001157271,0.008569124],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006221398,"threshold_uncertainty_score":0.02081263,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2467994838","doi":"10.1515/spma-2016-0027","title":"Professor Haruo Yanai and multivariate analysis","year":2016,"lang":"en","type":"article","venue":"Special Matrices","topic":"Advanced Statistical Methods and Models","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Victoria","funders":"","keywords":"Multivariate statistics; Mathematics; Canonical correlation; Multivariate analysis; Principal component analysis; Econometrics; Statistics; Calculus (dental); Medicine","authors":[{"name":"Yoshio Takane","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.08173479407217125,"gpt":0.4242554623547941,"spread":0.3425206682826228,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00541113,0.000675983,0.0009252434,0.001622795,0.001187762,0.002541157,0.0004619041,0.001364773,0.004015447],"category_scores_gemma":[0.01137056,0.0003654264,0.0005502255,0.002271671,0.003926322,0.0027545,0.002269694,0.005414937,0.001800193],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002246952,"about_ca_system_score_gemma":0.00184353,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002534754,"about_ca_topic_score_gemma":0.001454744,"domain_scores_codex":[0.9970682,0.001287076,0.0001773311,0.0007620238,0.0005989864,0.0001064203],"domain_scores_gemma":[0.9938986,0.003649256,0.0002608392,0.0004169332,0.001427537,0.0003466533],"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.0001005483,0.00003102089,0.002625078,0.0004935142,0.0001205736,0.0002879781,0.001020083,0.002547703,0.0008675006,0.7112166,0.1183082,0.1623812],"study_design_scores_gemma":[0.00002200043,0.00005796121,0.002758566,0.0003869308,0.00004297915,0.000414726,0.0003264546,0.009802157,0.0009351005,0.5064588,0.478719,0.0000753899],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"commentary","genre_scores_codex":[0.01313452,0.3379309,0.3586946,0.20083,0.02420026,0.00008618826,0.000576604,0.0006198826,0.06392705],"genre_scores_gemma":[0.4039149,0.1889617,0.196005,0.03281744,0.06037175,0.0004339033,0.0006769986,0.0005728122,0.1162456],"genre_candidate":"commentary","genre_consensus":null,"teacher_disagreement_score":0.00541113,"threshold_uncertainty_score":0.02861714,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4390668661","doi":"10.1515/spma-2023-0107","title":"Refined inertias of positive and hollow positive patterns","year":2024,"lang":"en","type":"article","venue":"Special Matrices","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Physics; Mathematics; Crystallography; Chemistry","authors":[{"name":"Adam H. Berliner","is_ca":false},{"name":"Minerva Catral","is_ca":false},{"name":"D.D. Olesky","is_ca":true},{"name":"P. van den Driessche","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.006289512490943663,"gpt":0.2335924154572971,"spread":0.2273029029663535,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001464232,0.0008827611,0.000815931,0.002248758,0.001528148,0.002940076,0.001264064,0.001059821,0.01541095],"category_scores_gemma":[0.01103709,0.0008116884,0.001649047,0.001139336,0.004102512,0.00511896,0.002941757,0.002002708,0.001932358],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001085085,"about_ca_system_score_gemma":0.0006260307,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002251749,"about_ca_topic_score_gemma":0.00153912,"domain_scores_codex":[0.9970039,0.0003594329,0.000237108,0.0007290274,0.0009889285,0.0006815623],"domain_scores_gemma":[0.9924949,0.002095785,0.001214329,0.001629799,0.001601442,0.0009637407],"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.0003427894,0.00009082985,0.004030407,0.0002051927,0.00005707867,0.0008679292,0.001181911,0.004560444,0.01352439,0.9429981,0.004097761,0.02804316],"study_design_scores_gemma":[0.00009891156,0.0002032363,0.005517888,0.0001206648,0.00008469895,0.001153012,0.000830906,0.04458876,0.008523213,0.9202285,0.01854059,0.0001094804],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.4752856,0.0005318965,0.439202,0.0007784178,0.0003743366,0.0002372666,0.00078101,0.001358148,0.08145134],"genre_scores_gemma":[0.9271966,0.0001938327,0.05220325,0.0003198792,0.0002418288,0.0001387004,0.0008262498,0.0004133452,0.01846631],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01541095,"threshold_uncertainty_score":0.0515548,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2529571702","doi":"10.1515/spma-2016-0029","title":"A class of cyclic (v; k<sub>1</sub>, k<sub>2</sub>, k<sub>3</sub>; λ) differencefamilies with v ≡ 3 (mod 4) a prime","year":2016,"lang":"en","type":"article","venue":"Special Matrices","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Wilfrid Laurier University; University of Waterloo","funders":"","keywords":"Mathematics; Prime (order theory); Mod; Hadamard transform; Skew; Class (philosophy); Combinatorics; Order (exchange); Discrete mathematics; Mathematical analysis; Computer science","authors":[{"name":"Dragomir Ž. Ðoković","is_ca":true},{"name":"Ilias Kotsireas","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.005134327060679731,"gpt":0.1721586866719267,"spread":0.1670243596112469,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002189586,0.0001635529,0.0002133511,0.0005589752,0.001059608,0.0004723742,0.000375474,0.0003434812,0.002542119],"category_scores_gemma":[0.0007571952,0.0001910866,0.000211792,0.0003606174,0.0007446429,0.000589753,0.0005522476,0.0003948878,0.0001968745],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000530439,"about_ca_system_score_gemma":0.0002933161,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004377119,"about_ca_topic_score_gemma":0.0004649568,"domain_scores_codex":[0.9997706,0.00004329879,0.00001151087,0.00005358581,0.00006677402,0.00005418464],"domain_scores_gemma":[0.9994557,0.0002121946,0.00008724759,0.0001099513,0.00006683618,0.00006810528],"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.0003109925,0.00009820514,0.007101312,0.0001310659,0.00003092789,0.001078789,0.00131969,0.009094639,0.0625435,0.8552277,0.002215729,0.06084751],"study_design_scores_gemma":[0.000159498,0.0006132945,0.01121553,0.0001074301,0.00004557938,0.0053764,0.001022234,0.1034041,0.06774148,0.7621,0.04808597,0.0001284931],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9609241,0.0001613197,0.025946,0.0001335413,0.00002412938,0.00002192618,0.0001077336,0.00009522791,0.012586],"genre_scores_gemma":[0.9861766,0.00007210274,0.01082303,0.0000433281,0.00001508158,0.0000237625,0.000145768,0.00001339379,0.00268693],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.002542119,"threshold_uncertainty_score":0.008504212,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2994336805","doi":"10.1515/spma-2019-0026","title":"Inertias of Laplacian matrices of weighted signed graphs","year":2019,"lang":"en","type":"preprint","venue":"Special Matrices","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Signed graph; Laplacian matrix; Mathematics; Laplace operator; Combinatorics; Eigenvalues and eigenvectors; Algebraic connectivity; Upper and lower bounds; Discrete mathematics; Graph; Mathematical analysis; Physics","authors":[{"name":"Keivan Hassani Monfared","is_ca":true},{"name":"Gary MacGillivray","is_ca":true},{"name":"D.D. Olesky","is_ca":true},{"name":"P. van den Driessche","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02730922717610757,"gpt":0.2958247948631122,"spread":0.2685155676870046,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008578271,0.000852771,0.0008026524,0.002857474,0.000894,0.001758861,0.0009482747,0.0009254735,0.004636075],"category_scores_gemma":[0.005303952,0.0004961629,0.0007921095,0.0008016985,0.002515092,0.002258054,0.001607129,0.0009088819,0.0004211728],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005637105,"about_ca_system_score_gemma":0.0002433623,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002542114,"about_ca_topic_score_gemma":0.0002605104,"domain_scores_codex":[0.9990292,0.0001849507,0.00006027005,0.000175794,0.0003422316,0.0002075769],"domain_scores_gemma":[0.995261,0.001852027,0.001109663,0.0005199895,0.0003355797,0.0009217487],"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.0004196109,0.0001321038,0.002682555,0.0002108892,0.0000827194,0.0007310974,0.0006100781,0.03963022,0.05740034,0.878013,0.001600252,0.01848716],"study_design_scores_gemma":[0.00006127851,0.000210926,0.003204783,0.00004818261,0.00003404641,0.0005066781,0.0002841839,0.1651879,0.01117785,0.8173115,0.001885985,0.00008666678],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8461805,0.0002452252,0.1393638,0.0002154032,0.00007387812,0.00003767665,0.0001266269,0.0002321927,0.0135247],"genre_scores_gemma":[0.991415,0.0001088226,0.006698298,0.00003841129,0.0000680973,0.00003860947,0.00009310993,0.00004357428,0.001496126],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.004636075,"threshold_uncertainty_score":0.01550925,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3169276539","doi":"10.1515/spma-2021-0154","title":"Combinatorial properties of the enhanced principal rank characteristic sequence over finite fields","year":2021,"lang":"en","type":"article","venue":"Special Matrices","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Sequence (biology); Finite field; Rank (graph theory); Principal (computer security); Mathematics; Combinatorics; Field (mathematics); Electron paramagnetic resonance; Pure mathematics; Discrete mathematics; Physics; Computer science; Quantum mechanics; Genetics; Biology","authors":[{"name":"Peter J. Dukes","is_ca":true},{"name":"Xavier Martínez-Rivera","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01917371796947477,"gpt":0.2300797427333242,"spread":0.2109060247638494,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008506236,0.0002505393,0.0004150223,0.00209284,0.0005746887,0.001569139,0.0005322983,0.0004842715,0.003439756],"category_scores_gemma":[0.004549049,0.0002257439,0.000227794,0.001281395,0.001793485,0.002544899,0.0006404934,0.0008757176,0.0003128066],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008514496,"about_ca_system_score_gemma":0.0004362435,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003073215,"about_ca_topic_score_gemma":0.0002430321,"domain_scores_codex":[0.9993508,0.0001711987,0.00004340846,0.0001181059,0.0002039525,0.0001125535],"domain_scores_gemma":[0.993423,0.002811703,0.001645814,0.0003974186,0.0008114753,0.0009106738],"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.0002608816,0.00006860946,0.002578681,0.00006312842,0.00001264752,0.0004697961,0.000305317,0.007523762,0.007911774,0.9699786,0.0009398028,0.009886928],"study_design_scores_gemma":[0.00007615197,0.0002191382,0.003207354,0.00003800349,0.00001719092,0.001311437,0.0001896065,0.04538265,0.00506291,0.940522,0.003918348,0.0000550827],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9418,0.0002307153,0.04313032,0.000396364,0.00003910312,0.00004101255,0.0002817694,0.00009073947,0.01399002],"genre_scores_gemma":[0.9921185,0.00008792548,0.005545655,0.00004429797,0.00008840938,0.00002971638,0.000169528,0.00001416791,0.001901749],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.003439756,"threshold_uncertainty_score":0.01150715,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4200032008","doi":"10.1515/spma-2021-0152","title":"Graphs with the second signless Laplacian eigenvalue ≤ 4","year":2021,"lang":"en","type":"article","venue":"Special Matrices","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"","keywords":"Knapsack problem; Combinatorics; Mathematics; Eigenvalues and eigenvectors; Simple (philosophy); Laplace operator; Discrete mathematics; Class (philosophy); Laplacian matrix; Graph; Computer science; Mathematical optimization; Physics","authors":[{"name":"S.W. Drury","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02073033612705072,"gpt":0.267299869615429,"spread":0.2465695334883782,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002295459,0.0003657774,0.0003471364,0.001302626,0.0006732967,0.00121472,0.0005134573,0.000927784,0.004015715],"category_scores_gemma":[0.001513062,0.0001986367,0.0003018003,0.0005394472,0.001933556,0.001227715,0.0007294999,0.0006054132,0.0002794858],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003130089,"about_ca_system_score_gemma":0.000172839,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003984576,"about_ca_topic_score_gemma":0.000508912,"domain_scores_codex":[0.9997783,0.0000511316,0.000008001997,0.00005271607,0.00005595516,0.00005389408],"domain_scores_gemma":[0.9988986,0.000433336,0.0002617842,0.00009245033,0.0001173564,0.00019643],"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.0002588198,0.00008201296,0.003843872,0.0001594602,0.0000412168,0.0007520393,0.0006122126,0.01302758,0.03368422,0.9330496,0.003124739,0.01136425],"study_design_scores_gemma":[0.00002878161,0.00005396924,0.002199923,0.00002170898,0.00001074878,0.0003535289,0.0003269937,0.02718133,0.003990484,0.9637975,0.002015077,0.0000199273],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9718971,0.0001083975,0.01652497,0.0004788385,0.00004109552,0.00001203776,0.00007204466,0.00006624955,0.01079923],"genre_scores_gemma":[0.9951265,0.00005117598,0.002590309,0.0000771545,0.00004285646,0.00001056711,0.00007041249,0.00001457089,0.002016484],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.004015715,"threshold_uncertainty_score":0.01343387,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2948867122","doi":"10.1515/spma-2020-0106","title":"Maximum nullity and zero forcing of circulant graphs","year":2020,"lang":"en","type":"preprint","venue":"Special Matrices","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Redeemer University; McMaster University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Circulant matrix; Bipartite graph; Mathematics; Zero (linguistics); Combinatorics; Upper and lower bounds; Circulant graph; Graph; Forcing (mathematics); Rank (graph theory); Torus; Discrete mathematics; Line graph; Voltage graph; Mathematical analysis; Geometry","authors":[{"name":"Linh Duong","is_ca":false},{"name":"Brenda K. Kroschel","is_ca":false},{"name":"Michael C. Riddell","is_ca":true},{"name":"Kevin N. Vander Meulen","is_ca":true},{"name":"Adam Van Tuyl","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.05579625248886667,"gpt":0.3084285747196465,"spread":0.2526323222307799,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009211616,0.0004052992,0.0004770895,0.001807898,0.001017854,0.001230824,0.0006775254,0.0005388527,0.003105605],"category_scores_gemma":[0.006574475,0.0002306696,0.0003454361,0.0005879432,0.002583036,0.001529346,0.0009897923,0.0007326336,0.0002958995],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006238227,"about_ca_system_score_gemma":0.0005024368,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004676435,"about_ca_topic_score_gemma":0.0007226446,"domain_scores_codex":[0.9992224,0.0002075632,0.00003544184,0.0001412381,0.0002303213,0.0001629645],"domain_scores_gemma":[0.9919444,0.004382538,0.001180197,0.0007517113,0.0008238134,0.0009172239],"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.0002011088,0.00006204609,0.003651957,0.00009833484,0.00001937828,0.000215708,0.0003184647,0.02518719,0.0329675,0.9249694,0.001349104,0.01095976],"study_design_scores_gemma":[0.00002729829,0.000152299,0.002891449,0.00005375528,0.00001414437,0.0003723525,0.000252936,0.1341235,0.0193028,0.8401876,0.00257035,0.00005138515],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8061809,0.0001976295,0.1783555,0.0003172121,0.00006229385,0.00002677447,0.0002099692,0.0001655432,0.01448422],"genre_scores_gemma":[0.9855183,0.00009068599,0.01271155,0.00003575688,0.00004346011,0.00002578386,0.00009605262,0.00003640555,0.001441846],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.003105605,"threshold_uncertainty_score":0.01038933,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2964243499","doi":"10.2478/spma-2014-0010","title":"Bilinear characterizations of companion matrices","year":2014,"lang":"en","type":"article","venue":"Special Matrices","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Victoria","funders":"","keywords":"Bilinear interpolation; Mathematics; Bilinear form; Type (biology); Bilinear map; Pure mathematics; Algebra over a field; Statistics; Geology","authors":[{"name":"Minghua Lin","is_ca":true},{"name":"Hȧrald K. Wimmer","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.009055364507476205,"gpt":0.2297006000901166,"spread":0.2206452355826403,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007682684,0.0006030575,0.0004529888,0.001928396,0.0006728576,0.001946176,0.0004397851,0.0005530316,0.008820564],"category_scores_gemma":[0.004636311,0.0002251747,0.0004370046,0.001013295,0.001516977,0.002836843,0.00181161,0.001334808,0.001077746],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004343166,"about_ca_system_score_gemma":0.0003104465,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002497711,"about_ca_topic_score_gemma":0.0001818637,"domain_scores_codex":[0.9990283,0.0002236532,0.00004717819,0.0001781463,0.0003461096,0.0001766962],"domain_scores_gemma":[0.996786,0.000832559,0.0005587589,0.0005090195,0.000815517,0.0004981727],"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.00008607614,0.0000491756,0.0008652299,0.00005928678,0.00001309583,0.0002747869,0.0004712579,0.004881026,0.006675005,0.9701152,0.0020488,0.014461],"study_design_scores_gemma":[0.00001154915,0.0001015947,0.0005349927,0.00002041081,0.000006268719,0.0005319215,0.000248702,0.0484164,0.004962995,0.9384282,0.0067102,0.00002682643],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3016396,0.0005917957,0.6371285,0.0005272289,0.0002887169,0.00008414796,0.0003620412,0.0004537708,0.05892427],"genre_scores_gemma":[0.9747011,0.000229227,0.01585776,0.0001473138,0.0002559442,0.00004174873,0.0001861365,0.00008085657,0.008499937],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008820564,"threshold_uncertainty_score":0.0295077,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4387110205","doi":"10.1515/spma-2023-0103","title":"On 3-by-3 row stochastic matrices","year":2023,"lang":"en","type":"article","venue":"Special Matrices","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"York University; New York University Abu Dhabi","keywords":"Constructive; Mathematics; Unitary state; Unitary matrix; Matrix (chemical analysis); Algebra over a field; Applied mathematics; Combinatorics; Pure mathematics; Computer science","authors":[{"name":"Nhi Pham","is_ca":false},{"name":"Ilya M. Spitkovsky","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.009904842993394078,"gpt":0.2419834156702385,"spread":0.2320785726768445,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002750442,0.0005575869,0.0007420771,0.001162182,0.0006909503,0.001951469,0.0007213245,0.0006777769,0.007328223],"category_scores_gemma":[0.01684843,0.0003256413,0.0007104761,0.0008267506,0.00369209,0.002247322,0.001492359,0.001627535,0.001248156],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004399151,"about_ca_system_score_gemma":0.0005422971,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005095638,"about_ca_topic_score_gemma":0.0004612931,"domain_scores_codex":[0.9972133,0.001303979,0.000145956,0.0003083637,0.000761873,0.0002664703],"domain_scores_gemma":[0.982814,0.01210007,0.001313395,0.001626388,0.001568268,0.0005779271],"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.0001284351,0.00002502817,0.0005515458,0.00005526248,0.00001194481,0.0002105067,0.0001636304,0.02872536,0.003160169,0.9514598,0.0008818881,0.01462646],"study_design_scores_gemma":[0.00001447178,0.00004662896,0.0001928219,0.0000285905,0.000004376375,0.0001557535,0.00006146436,0.1189284,0.004577076,0.874455,0.001513727,0.00002169693],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2280988,0.0002317372,0.7453833,0.000437683,0.0001111871,0.00006862582,0.0002090178,0.0005686636,0.02489096],"genre_scores_gemma":[0.8859376,0.0001899499,0.1090822,0.0002080977,0.0001335662,0.00006696309,0.0002769337,0.0001501865,0.003954543],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007328223,"threshold_uncertainty_score":0.02451533,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}