{"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"},"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001097003,0.0001146608,0.000142942,0.00009422319,0.0002204387,0.0003324834,0.0003014828,0.00004516821,0.00003146275],"category_scores_gemma":[0.00002522213,0.0001032171,0.00005155641,0.0005048545,0.00003412099,0.0001435339,0.0002827582,0.0001428165,0.000016612],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000008413938,"about_ca_system_score_gemma":0.00004314789,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001895156,"about_ca_topic_score_gemma":0.00001023502,"domain_scores_codex":[0.999027,0.00003765085,0.0001442858,0.0003627168,0.0001927304,0.0002356672],"domain_scores_gemma":[0.9994717,0.00008060486,0.00006010344,0.0002594405,0.00003739652,0.00009074922],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000008549525,0.0001178782,0.002902709,0.00009481164,0.0000499245,0.000494173,0.002877187,0.0006167233,0.002206775,0.3189726,0.003239034,0.6684196],"study_design_scores_gemma":[0.001867414,0.0003703238,0.08422118,0.0003273965,0.00006062654,0.001291497,0.0005106325,0.113154,0.008770919,0.4885045,0.2988375,0.002084029],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6642944,0.005219093,0.3059071,0.007630467,0.003528073,0.0001538431,0.000009780213,0.000444483,0.01281282],"genre_scores_gemma":[0.6700305,0.0004538611,0.3205496,0.0007206796,0.007908028,0.000004267925,0.000005285226,0.00002569265,0.0003021076],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.6663356,"threshold_uncertainty_score":0.4209073,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002564133,0.0001821998,0.0003188234,0.0004435176,0.00004414744,0.00005948066,0.0002798607,0.0001056795,0.0001994233],"category_scores_gemma":[0.00006602344,0.0001663557,0.00008360503,0.001641331,0.00004925695,0.0002006741,0.00003682236,0.0001119268,0.0002757531],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004103419,"about_ca_system_score_gemma":0.00002803975,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008516115,"about_ca_topic_score_gemma":0.00003273562,"domain_scores_codex":[0.9988346,0.00004533795,0.0003655502,0.0001630661,0.0003315819,0.0002598611],"domain_scores_gemma":[0.9993399,0.00008413106,0.00009624456,0.0002294278,0.0001166459,0.000133658],"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.0007219599,0.0006369585,0.07318945,0.004611275,0.001205016,0.0002545174,0.008695281,0.01576251,0.003822243,0.384726,0.4173152,0.08905959],"study_design_scores_gemma":[0.003773204,0.0005672468,0.01391071,0.000283834,0.0003533321,0.0000914827,0.005171079,0.001804913,0.008988489,0.04949676,0.9134338,0.002125076],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6156543,0.01027998,0.0002056078,0.0000243205,0.003173692,0.0002351747,0.00003328537,0.0002723196,0.3701213],"genre_scores_gemma":[0.9964622,0.0003367344,0.0004043191,0.000008222004,0.002224417,0.00001045617,0.000005515856,0.00003439084,0.0005137281],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4961187,"threshold_uncertainty_score":0.6783789,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009226498,0.0001006914,0.0001101488,0.0001470104,0.0004888835,0.0001998644,0.0005963692,0.00004577041,0.00001406509],"category_scores_gemma":[0.0004137538,0.00007295325,0.00004062862,0.0005974029,0.0001036943,0.0003586819,0.0001821335,0.0002768114,0.00006279933],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002140383,"about_ca_system_score_gemma":0.00001214696,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002419352,"about_ca_topic_score_gemma":0.00002220306,"domain_scores_codex":[0.9988403,0.0002133119,0.0001361121,0.0002639146,0.0002984949,0.0002478325],"domain_scores_gemma":[0.9973695,0.002110133,0.00007351991,0.0003434654,0.00002414342,0.00007924766],"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.000007114298,0.000004176011,0.009441303,0.000006375914,0.000006713026,9.759726e-7,0.0004259975,0.00004669821,0.00001968636,0.9813029,0.0008125827,0.007925449],"study_design_scores_gemma":[0.0001444441,0.00006475819,0.01860775,0.0000178736,0.000004163958,0.000001736956,0.00006667361,0.0004776619,0.0001672858,0.9727492,0.007572471,0.000125984],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5439711,0.00009447642,0.3942839,0.002695688,0.0003142736,0.0003538319,0.000003877135,0.0001608816,0.058122],"genre_scores_gemma":[0.9963682,0.00001893989,0.002839875,0.00008080487,0.0004677743,0.000008161493,6.96684e-7,0.000008744688,0.0002068378],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4523971,"threshold_uncertainty_score":0.3760146,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005063433,0.00004991211,0.00006832022,0.00007291576,0.0002158894,0.0001320671,0.0004432041,0.00001977479,0.00002074456],"category_scores_gemma":[0.00002102418,0.0000334297,0.00003401164,0.0003460123,0.0001117855,0.0001755572,0.00008876347,0.0000381369,0.00003584146],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000002523779,"about_ca_system_score_gemma":0.000008442013,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004548895,"about_ca_topic_score_gemma":0.000003219829,"domain_scores_codex":[0.9994652,0.00004882448,0.0001729297,0.00008081028,0.0001394075,0.00009278816],"domain_scores_gemma":[0.9993027,0.0002776549,0.0001178777,0.0002181004,0.00004989539,0.00003372238],"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.00000299171,0.000004483373,0.0001392876,0.000007520807,0.000002593208,1.380153e-8,0.0001561273,0.000001269658,0.00002306706,0.9026181,0.0007378689,0.0963067],"study_design_scores_gemma":[0.0001424899,0.00002894973,0.008048455,0.000003522249,0.000005129767,0.000002668925,0.0001931482,0.002879631,0.0001641945,0.3683645,0.6200834,0.00008391074],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.007247415,0.000450632,0.9072229,0.0007424235,0.0001949756,0.0002298394,0.000003496366,0.00009589227,0.0838124],"genre_scores_gemma":[0.9892735,0.0002020447,0.009164657,0.0002833327,0.0008930613,0.00002530786,0.000001797006,0.000004922865,0.0001513965],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.982026,"threshold_uncertainty_score":0.1660469,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000464231,0.00008385425,0.0001492149,0.0001104543,0.00007928083,0.00001793037,0.0002746095,0.00004835324,0.0004478822],"category_scores_gemma":[0.0000348949,0.00006037796,0.0000857008,0.0006437395,0.00006272116,0.00009440087,0.00003294289,0.0001198799,0.0001326993],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000009214777,"about_ca_system_score_gemma":0.00001810559,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007638744,"about_ca_topic_score_gemma":0.0005680763,"domain_scores_codex":[0.9992144,0.00009551667,0.0002514781,0.0001360445,0.0001532201,0.000149393],"domain_scores_gemma":[0.9991589,0.0003554732,0.0001316068,0.0003007003,0.00003162986,0.00002172118],"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.00001862115,0.0003099205,0.008258304,0.00009426742,0.00001190737,6.516266e-7,0.001937676,0.00004760926,0.0008947967,0.9853526,0.002883703,0.000189884],"study_design_scores_gemma":[0.000289633,0.00003474454,0.004650445,0.00002465375,0.00002640615,0.000001617975,0.001171582,0.00002821726,0.0006211217,0.9853199,0.007741964,0.00008973286],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9491748,0.0000214491,0.00005287594,0.0001969549,0.00004549669,0.0006592448,0.00002659025,0.00002367846,0.04979892],"genre_scores_gemma":[0.9954011,0.00002390849,0.003891482,0.00005060062,0.0001932719,0.00009454892,0.000004555437,0.000008982764,0.0003315816],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.04946734,"threshold_uncertainty_score":0.4903996,"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)","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002260012,0.0001341143,0.0003015441,0.0004387487,0.00005560553,0.00001889978,0.0001801477,0.0001032397,0.0001942436],"category_scores_gemma":[0.00006187766,0.0001264396,0.0001051143,0.001196202,0.0001266172,0.0001433252,0.00001732161,0.00005353088,0.00002709266],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001871614,"about_ca_system_score_gemma":0.00001672908,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004072504,"about_ca_topic_score_gemma":0.00003004946,"domain_scores_codex":[0.9990488,0.00002549195,0.0004224954,0.0001367266,0.0001764397,0.0001900104],"domain_scores_gemma":[0.9992733,0.0001385994,0.0001756466,0.0001683484,0.0002041811,0.00003992218],"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.0006377173,0.0002286077,0.02450273,0.005748584,0.0008627333,0.000004827379,0.002282827,0.0007770252,0.0257799,0.7860856,0.03273911,0.1203503],"study_design_scores_gemma":[0.005416144,0.002202177,0.02185904,0.0006689922,0.0008515389,0.00008877774,0.00559543,0.005815549,0.2654973,0.09363464,0.5961758,0.0021946],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9373728,0.001542309,0.002519374,0.0000191665,0.003821179,0.0004365134,0.0000952636,0.0001321264,0.05406126],"genre_scores_gemma":[0.9940965,0.0001129366,0.003344088,0.000003866445,0.002302753,0.00001432693,0.000004755214,0.00002426617,0.00009647263],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.692451,"threshold_uncertainty_score":0.5156055,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003265035,0.0001379085,0.0001890219,0.00004918488,0.0001735468,0.0001170449,0.0005927228,0.00005922606,0.0001064465],"category_scores_gemma":[0.0007253687,0.00006723562,0.0001729344,0.000543214,0.0001422907,0.0001062291,0.0001435117,0.0001850863,0.00008084981],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004446959,"about_ca_system_score_gemma":0.00005740229,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005646641,"about_ca_topic_score_gemma":0.00002023277,"domain_scores_codex":[0.9988111,0.00006224873,0.0003645469,0.0001523829,0.0003955021,0.0002142496],"domain_scores_gemma":[0.997416,0.00183642,0.0001436832,0.0005186434,0.00005511278,0.00003015296],"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.000007705137,0.00002751175,0.00003490883,0.0001630984,0.00003680232,0.00000265996,0.0004878257,7.619331e-7,0.0003400045,0.9790899,0.01349168,0.006317185],"study_design_scores_gemma":[0.00007452218,0.00002291992,0.00006228594,0.00009420615,0.00005108,0.000004527215,0.0001498094,0.00003901199,0.003820301,0.9032,0.09239075,0.00009055172],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.3692055,0.01818062,0.01842752,0.01246482,0.07949996,0.004824108,0.0001470218,0.001561426,0.495689],"genre_scores_gemma":[0.9472395,0.0005728928,0.01924079,0.00009918093,0.01493824,0.0000911472,8.384795e-7,0.0002061635,0.01761129],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5780339,"threshold_uncertainty_score":0.2741789,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0004768596,0.000158117,0.000188835,0.0001788092,0.0001314752,0.0003509432,0.001114292,0.00005851651,0.0002354725],"category_scores_gemma":[0.00003677043,0.0001395332,0.0001005176,0.0006388562,0.00004512357,0.0008553931,0.0002933813,0.0001240716,0.001464942],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005270198,"about_ca_system_score_gemma":0.00009644627,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004481751,"about_ca_topic_score_gemma":0.000007827281,"domain_scores_codex":[0.9985502,0.00009678546,0.0002390946,0.0003344655,0.0004681411,0.0003112585],"domain_scores_gemma":[0.9991129,0.00009421712,0.0001292753,0.0003368957,0.00008854904,0.0002381877],"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.00003406725,0.0001595417,0.001864863,0.00002957802,0.0000302793,0.00007600136,0.001259875,0.00009661093,0.00004468983,0.8638264,0.06448864,0.06808943],"study_design_scores_gemma":[0.001489451,0.0002862079,0.004225204,0.00003357735,0.00003486631,0.0001483371,0.0004799369,0.007710306,0.0009803633,0.2198928,0.7638456,0.0008733447],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.1834562,0.007757112,0.2114194,0.004724706,0.02131249,0.00103172,0.00004984647,0.001921483,0.568327],"genre_scores_gemma":[0.8863471,0.0002716582,0.08135498,0.0008063762,0.02688275,0.00003129661,0.00002104673,0.00004527002,0.004239514],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7028909,"threshold_uncertainty_score":0.9993125,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002031835,0.00009582943,0.0001645488,0.0001717681,0.00002567754,0.00003205924,0.0001218702,0.00005219473,0.00008662567],"category_scores_gemma":[0.00001757594,0.00009127356,0.00004986998,0.0002547222,0.00001408193,0.00007459864,0.00001190549,0.00006629694,0.0000776373],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000190162,"about_ca_system_score_gemma":0.000005951592,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000960394,"about_ca_topic_score_gemma":0.00002019585,"domain_scores_codex":[0.9994434,0.00004026631,0.0001785125,0.0001169348,0.00006676092,0.0001541843],"domain_scores_gemma":[0.9994293,0.000424258,0.00002458888,0.0000802447,0.00001644283,0.00002510835],"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.0001783727,0.0001089935,0.0467292,0.001736666,0.0001374086,0.000006128431,0.006385405,0.2659019,0.006437322,0.452448,0.001212729,0.2187179],"study_design_scores_gemma":[0.002631249,0.0002335079,0.1820296,0.0002411345,0.00003816372,0.00000649008,0.002483466,0.3107895,0.00160393,0.4250791,0.0736698,0.001194112],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9415993,0.0006104593,0.04028825,0.00001837096,0.002082969,0.0004059456,0.00002891654,0.0001279737,0.01483783],"genre_scores_gemma":[0.9896234,0.00003239722,0.00954756,0.00001417308,0.0005491003,0.00003136768,0.000011728,0.00001516028,0.0001750585],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2175238,"threshold_uncertainty_score":0.3722028,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000304676,0.00008766152,0.000133395,0.0002786694,0.00009295299,0.00005619259,0.0007550438,0.0000400774,0.0001084035],"category_scores_gemma":[0.00002301027,0.00008208235,0.0001157456,0.001727259,0.00004731719,0.0002606845,0.0002132494,0.00006835422,0.000242928],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000006569002,"about_ca_system_score_gemma":0.00002678729,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001164589,"about_ca_topic_score_gemma":0.000009658944,"domain_scores_codex":[0.9991189,0.00004722169,0.0001719798,0.0002174782,0.000232481,0.0002119445],"domain_scores_gemma":[0.9993765,0.0001268421,0.00007963036,0.0003321186,0.00003655949,0.00004832128],"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.0000126313,0.00003495396,0.001143617,0.00003437279,0.00001873223,0.00002087773,0.0009848259,0.00002925997,0.0004929837,0.9105411,0.01509631,0.07159039],"study_design_scores_gemma":[0.0009208123,0.0004862774,0.03596377,0.00008704461,0.00004004648,0.00001819758,0.0008918938,0.001939196,0.01525421,0.5255711,0.4179618,0.00086563],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7275676,0.0008578883,0.02651865,0.002036143,0.006169325,0.0004168265,0.00004350623,0.001990419,0.2343996],"genre_scores_gemma":[0.9960413,0.0001202357,0.002124646,0.00005356491,0.001343752,0.000006071977,0.000002461591,0.000008553881,0.0002994232],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4028655,"threshold_uncertainty_score":0.3347221,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003016389,0.0002234459,0.0003828375,0.0001356156,0.0001253066,0.0001258507,0.0008727093,0.00007401164,0.0003146728],"category_scores_gemma":[0.00005101685,0.0001618888,0.0001121048,0.0007748438,0.0001101387,0.0005178291,0.0002540807,0.000203533,0.0001554095],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002470456,"about_ca_system_score_gemma":0.00009277252,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000009734566,"about_ca_topic_score_gemma":0.000004121986,"domain_scores_codex":[0.998116,0.0001605328,0.000352785,0.0004848067,0.0005500116,0.0003358937],"domain_scores_gemma":[0.9985917,0.0004256472,0.0001930238,0.0005310886,0.0001309129,0.0001276217],"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.0001744564,0.0005790317,0.0002333362,0.0003975354,0.00007908208,0.0002295766,0.0003163889,0.00005586246,0.001282931,0.9735346,0.003331755,0.01978539],"study_design_scores_gemma":[0.005921817,0.003687441,0.01415257,0.004097158,0.0002566927,0.0005976597,0.0007155873,0.009112679,0.2198762,0.6288666,0.1092214,0.00349432],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8752076,0.01144531,0.03174267,0.004568424,0.003700752,0.0008688442,0.0001038511,0.0005361562,0.07182636],"genre_scores_gemma":[0.9556164,0.003388174,0.03259326,0.001542638,0.00456163,0.00003152561,0.0000429133,0.000064209,0.002159264],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3446681,"threshold_uncertainty_score":0.6601634,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.001047454,0.0007712987,0.001267504,0.0009618966,0.0003294766,0.0006718586,0.005378928,0.0005782212,0.0001592104],"category_scores_gemma":[0.0002076001,0.0006354917,0.0005120033,0.004551625,0.00012885,0.0007068423,0.0008535652,0.001243043,0.000891352],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002552679,"about_ca_system_score_gemma":0.0005856754,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003868751,"about_ca_topic_score_gemma":0.006696831,"domain_scores_codex":[0.9937837,0.0006449063,0.001548126,0.00137209,0.001634072,0.001017096],"domain_scores_gemma":[0.9963081,0.0002350963,0.001241835,0.001562226,0.000308461,0.000344224],"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.00004100414,0.0002914056,0.0004494876,0.0003412583,0.00009581319,0.00008922177,0.002546624,0.0002724451,0.00004758706,0.005339101,0.9896848,0.0008012375],"study_design_scores_gemma":[0.0008984372,0.0002822593,0.002985703,0.0003596718,0.0001386439,0.00001498222,0.0005489772,0.002984324,0.00002738323,0.002062078,0.9888296,0.0008679864],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","genre_codex":"other","genre_gemma":"other","genre_scores_codex":[0.004420002,0.01946234,0.08821159,0.02751856,0.2818692,0.03412639,0.01207008,0.002744498,0.5295774],"genre_scores_gemma":[0.1232094,0.01624811,0.1492389,0.01492655,0.2177663,0.01103306,0.00931369,0.001724976,0.456539],"genre_candidate":"other","genre_consensus":"other","teacher_disagreement_score":0.1187894,"threshold_uncertainty_score":0.9998866,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0004070042,0.0001112074,0.0002352372,0.00005338656,0.0001254363,0.00002576877,0.0003242289,0.00004477632,0.001266786],"category_scores_gemma":[0.0002456811,0.00005258781,0.0001491749,0.0002591877,0.0001019537,0.00004903295,0.00005197493,0.00005468033,0.0001861825],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002548785,"about_ca_system_score_gemma":0.00001713939,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004111865,"about_ca_topic_score_gemma":0.00001062863,"domain_scores_codex":[0.9990025,0.00005961778,0.0003220558,0.0001605878,0.0002930652,0.0001621701],"domain_scores_gemma":[0.9975789,0.001679757,0.0002446086,0.000380882,0.00007673878,0.00003912248],"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.00005310222,0.00006202128,0.000325743,0.00003760615,0.0000239112,5.57214e-7,0.0000846269,5.372058e-7,0.001155001,0.9456913,0.05008894,0.002476626],"study_design_scores_gemma":[0.0008360143,0.000058201,0.003942688,0.00005823443,0.0000830224,0.000003126758,0.0001454854,0.00001264453,0.002372723,0.91083,0.08147559,0.0001823027],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.888719,0.00009844322,0.002367544,0.006250653,0.0002237869,0.0006562003,0.0001291389,0.00009208073,0.1014631],"genre_scores_gemma":[0.9961942,0.00005056822,0.001262293,0.00004582377,0.001251551,0.00002683592,8.592357e-7,0.00001503453,0.001152769],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1074752,"threshold_uncertainty_score":0.9996462,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005025554,0.0001267765,0.0002080399,0.0001681709,0.0001192847,0.000146017,0.0005973421,0.00004397158,0.0000621947],"category_scores_gemma":[0.0001045112,0.0001097844,0.00005291499,0.0003451226,0.00007964337,0.000499751,0.00025112,0.00007355586,0.00003126947],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000008221651,"about_ca_system_score_gemma":0.00001830696,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006186731,"about_ca_topic_score_gemma":0.000005265369,"domain_scores_codex":[0.9989058,0.0001070238,0.0002632159,0.0002710083,0.0002558878,0.0001970986],"domain_scores_gemma":[0.9990963,0.0003168188,0.0002216343,0.0002432608,0.00004799839,0.00007399818],"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.00001598728,0.00005877872,0.00506054,0.00019515,0.00002917934,0.000009846281,0.001815907,0.00004957623,0.001090755,0.5987276,0.0008084489,0.3921382],"study_design_scores_gemma":[0.00253136,0.001251423,0.02413524,0.000329836,0.0001342743,0.00007550385,0.001124312,0.06072486,0.07436605,0.7200639,0.1131806,0.002082651],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8358077,0.001968652,0.09400214,0.0003313696,0.00187089,0.0002796258,0.0000110249,0.0002732775,0.06545529],"genre_scores_gemma":[0.9650394,0.0002971291,0.03195938,0.00007411929,0.002383796,0.000003998289,7.238563e-7,0.000009960441,0.0002314838],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3900556,"threshold_uncertainty_score":0.4476879,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000311824,0.0001107419,0.0001155286,0.000043432,0.000855135,0.001019379,0.0024958,0.00003552064,0.0002223441],"category_scores_gemma":[0.00005264116,0.00006983192,0.00006066955,0.00009375068,0.00005005601,0.0003376178,0.0005412406,0.0001095914,0.0007949059],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001901632,"about_ca_system_score_gemma":0.00003282631,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008444595,"about_ca_topic_score_gemma":0.00008708698,"domain_scores_codex":[0.9991139,0.00004103883,0.0001211209,0.0002543422,0.0002411559,0.0002284908],"domain_scores_gemma":[0.9987273,0.00006638575,0.0001084738,0.0009827913,0.00003483683,0.0000801656],"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.00002406401,0.00004872609,0.0003579841,0.00002259619,0.0000261745,0.00007403376,0.003579781,0.00004516159,0.0001035166,0.7940328,0.07868466,0.1230005],"study_design_scores_gemma":[0.0001929468,0.0000648796,0.007607577,0.00001399655,0.000007642442,0.00002668923,0.00007261333,0.000528093,0.0003193743,0.02461553,0.9663488,0.0002019173],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.2532547,0.001384901,0.1495976,0.09646595,0.02481819,0.002255222,0.0001300792,0.0007615038,0.4713318],"genre_scores_gemma":[0.9780263,0.00004402889,0.004353563,0.001514168,0.0120413,0.00002461372,0.000001601213,0.00001315837,0.003981306],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8876641,"threshold_uncertainty_score":0.9999831,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002256265,0.0002096952,0.000240682,0.0001850588,0.0001610739,0.0004315651,0.0005598957,0.00006066919,0.00003822858],"category_scores_gemma":[0.00003061599,0.0001687654,0.00006473161,0.0004889813,0.00007532485,0.000802813,0.0003669236,0.0001171642,0.0001282287],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005068536,"about_ca_system_score_gemma":0.00008269354,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002267646,"about_ca_topic_score_gemma":0.0000518457,"domain_scores_codex":[0.9986808,0.00007676925,0.0002488967,0.0004097467,0.0002775425,0.0003062295],"domain_scores_gemma":[0.9991501,0.0001736684,0.0001521294,0.0002221383,0.00008412786,0.0002178246],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001664812,0.000226986,0.003884469,0.00005964458,0.0001306895,0.00009478931,0.0124502,0.00009004066,0.0007163146,0.345324,0.05751674,0.5793397],"study_design_scores_gemma":[0.005262536,0.001501384,0.2362291,0.0001704886,0.00008865635,0.0002744233,0.00145478,0.03714325,0.005054553,0.4818748,0.2283177,0.002628303],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9173351,0.00291825,0.04401945,0.002388212,0.00228789,0.0004086177,0.00004252631,0.0004014111,0.03019855],"genre_scores_gemma":[0.9919919,0.00006353972,0.004030912,0.0005055394,0.003192657,0.000008129154,0.000007418199,0.00001414384,0.0001857157],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.5767114,"threshold_uncertainty_score":0.6882054,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003215901,0.0001636283,0.0002694171,0.0001186862,0.0001485212,0.000144361,0.000781159,0.00007208736,0.0003044619],"category_scores_gemma":[0.00001708796,0.0001458096,0.0001301371,0.0004665127,0.00003988087,0.0004844276,0.0001515501,0.00009303874,0.000009640198],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002898943,"about_ca_system_score_gemma":0.0001305995,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003445269,"about_ca_topic_score_gemma":0.00003934642,"domain_scores_codex":[0.9985386,0.00009432674,0.0003489864,0.0004241143,0.0003091182,0.0002849177],"domain_scores_gemma":[0.9989799,0.0001174177,0.000204628,0.0004654952,0.0001360155,0.00009654965],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0002097768,0.001044568,0.001341497,0.0008442471,0.000178324,0.0002062796,0.003700058,0.0003224181,0.007806263,0.7216471,0.0150807,0.2476187],"study_design_scores_gemma":[0.005499638,0.002604552,0.004952276,0.0001822242,0.0002796377,0.0002205374,0.002234303,0.01194507,0.3909513,0.2210359,0.3580302,0.00206436],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7529531,0.005821152,0.1613307,0.005121198,0.008547572,0.003154011,0.0007120405,0.0006520393,0.06170819],"genre_scores_gemma":[0.7826008,0.0008588129,0.1972144,0.0006639696,0.01597886,0.0001392949,0.0001940558,0.00006591126,0.00228385],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.5006112,"threshold_uncertainty_score":0.5945941,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001018863,0.0001384197,0.000211956,0.0002517441,0.0009975522,0.0001974685,0.001113163,0.00002322272,0.0001379263],"category_scores_gemma":[0.00004906426,0.0001084715,0.0001224582,0.001328186,0.0001277768,0.000297633,0.0009048917,0.0002083522,0.00001423025],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004105013,"about_ca_system_score_gemma":0.0000740071,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006286659,"about_ca_topic_score_gemma":0.00000810524,"domain_scores_codex":[0.9982159,0.0003037745,0.0003022895,0.000308512,0.0005824706,0.0002870141],"domain_scores_gemma":[0.998216,0.001108156,0.0002545356,0.0002914278,0.00004765476,0.00008221196],"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.00006670401,0.00009304495,0.0009408525,0.00002519262,0.00004019018,0.00002146073,0.0002691741,0.00003352197,0.0001398467,0.9127946,0.002220155,0.08335523],"study_design_scores_gemma":[0.002713682,0.001473548,0.05684062,0.00002521404,0.0001420097,0.0007107488,0.001075946,0.01407676,0.0009857556,0.4812873,0.4393952,0.001273245],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8458126,0.0378,0.0193635,0.007637682,0.009670277,0.001930039,0.0008485882,0.0004463046,0.07649104],"genre_scores_gemma":[0.99395,0.0005224364,0.00359715,0.0001363754,0.00137122,0.0000372974,0.000005998455,0.00001220329,0.0003673393],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4371751,"threshold_uncertainty_score":0.7672465,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002515903,0.0001189081,0.0002998936,0.000122991,0.00008570045,0.00002545241,0.00009199283,0.00005621506,0.000436847],"category_scores_gemma":[0.0007909001,0.00007003908,0.00006739718,0.0002814572,0.00006299713,0.0001313259,0.0000672101,0.000053116,0.00002433062],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002032513,"about_ca_system_score_gemma":0.00001098839,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001786206,"about_ca_topic_score_gemma":0.00006377775,"domain_scores_codex":[0.9990655,0.0000848807,0.0002311975,0.0002518676,0.0001559215,0.000210644],"domain_scores_gemma":[0.9984297,0.001132693,0.0001157023,0.0001759327,0.00005420769,0.00009172807],"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.00005655321,0.00005802645,0.0007307394,0.00005197892,0.0002262948,0.00001157546,0.0002548183,6.639098e-7,0.0009683041,0.8961245,0.001251879,0.1002647],"study_design_scores_gemma":[0.0004523915,0.00003575761,0.003384162,0.00002305482,0.0004273008,0.000001004697,0.00005695315,0.0001598721,0.0003414191,0.9867241,0.008205896,0.0001880295],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02608034,0.00007351415,0.9661864,0.0009378354,0.0002055232,0.0002071796,0.00008864555,0.0000674179,0.006153152],"genre_scores_gemma":[0.1735733,0.0001427337,0.816409,0.00006259793,0.001643232,0.00003204214,0.000001656331,0.00003154219,0.008103908],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.1497774,"threshold_uncertainty_score":0.4783168,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00006569667,0.00007749424,0.0001045184,0.0001105289,0.0000501159,0.0001503412,0.0002311511,0.00003106441,0.00003096577],"category_scores_gemma":[0.000006142391,0.00006738434,0.00004189277,0.000386518,0.00003012009,0.0002463215,0.0001449288,0.00005886492,0.00003898351],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001385812,"about_ca_system_score_gemma":0.00002783927,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001085238,"about_ca_topic_score_gemma":0.00002657651,"domain_scores_codex":[0.9993712,0.0000194316,0.0001361053,0.000235046,0.0001321337,0.0001060296],"domain_scores_gemma":[0.9996327,0.00009086839,0.00003759795,0.0001658916,0.0000330246,0.00003997902],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","study_design_scores_codex":[0.00001297495,0.0001092696,0.001493717,0.0001494723,0.00009214989,0.0001223748,0.004226531,0.000004906718,0.01901399,0.6788472,0.003519136,0.2924083],"study_design_scores_gemma":[0.00117629,0.0007483863,0.6944423,0.0008379575,0.0002418461,0.0002283288,0.000554324,0.03975961,0.1395524,0.03948786,0.08145768,0.001513013],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8299344,0.003038676,0.1274972,0.00461694,0.0007972714,0.0004045776,0.000206524,0.000352374,0.03315211],"genre_scores_gemma":[0.997056,0.0000887698,0.002058229,0.00005803107,0.0004449776,0.000007176054,0.000009720526,0.000005935654,0.0002711435],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.6929486,"threshold_uncertainty_score":0.2747853,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004284996,0.0008850829,0.001174502,0.0006629284,0.0002448188,0.0001495441,0.000789463,0.0004623211,0.00003815648],"category_scores_gemma":[0.0000840696,0.0006654703,0.0003912876,0.001140974,0.0004067879,0.0006156772,0.0001582626,0.0004461798,0.0005146534],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002056062,"about_ca_system_score_gemma":0.0001096534,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002449823,"about_ca_topic_score_gemma":0.0004001911,"domain_scores_codex":[0.9958596,0.0002230413,0.001066059,0.0008295559,0.0008905693,0.001131145],"domain_scores_gemma":[0.9976773,0.0004151921,0.000442051,0.0009338448,0.0001815064,0.0003500866],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.000327959,0.0001487216,0.002454139,0.0004642434,0.0003108611,0.00005323104,0.0009079719,0.00009365181,0.957019,0.004248481,0.0009861556,0.03298555],"study_design_scores_gemma":[0.001730243,0.0003861685,0.02016909,0.0006804398,0.0002093665,0.00005120935,0.0005163089,0.0001106666,0.9685511,0.004909812,0.001547845,0.001137727],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9889924,0.0009707896,0.0007807384,0.00007739632,0.001572429,0.0008120411,0.0001940312,0.0006410156,0.005959171],"genre_scores_gemma":[0.9958372,0.001089696,0.00005243233,0.00003019616,0.002601794,0.0001534724,0.00001859394,0.0001785778,0.00003809761],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.03184782,"threshold_uncertainty_score":0.9995797,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000449114,0.000360483,0.0009387858,0.0006198115,0.00006445908,0.00003364988,0.0008915035,0.0004210624,0.000686787],"category_scores_gemma":[0.0001104211,0.0003252327,0.0004527046,0.0007534481,0.0001714619,0.00008254977,0.0004289867,0.0003723194,0.00006028956],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002298513,"about_ca_system_score_gemma":0.0001149071,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000082142,"about_ca_topic_score_gemma":0.00004290748,"domain_scores_codex":[0.997691,0.0001373837,0.001011964,0.0004413282,0.0004570885,0.0002612409],"domain_scores_gemma":[0.9965295,0.0006655481,0.001551789,0.0009251662,0.0002563435,0.00007169077],"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.0001286302,0.0003977004,0.001336701,0.002675503,0.0002452947,0.000002238445,0.0009095074,0.00001772207,0.001531559,0.9866385,0.005097165,0.001019438],"study_design_scores_gemma":[0.0003423289,0.00006991837,0.0007025045,0.0002846846,0.0003516325,0.000001452506,0.0002659059,0.00003271437,0.008111074,0.9869268,0.002558457,0.0003525093],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9416834,0.001034364,0.0004184837,0.0001178641,0.0008786334,0.001223452,0.0004879725,0.0001194384,0.05403646],"genre_scores_gemma":[0.9907964,0.0004096491,0.007120511,0.00001347585,0.0008641825,0.00006346414,0.00006285339,0.00005791491,0.0006115274],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.05342493,"threshold_uncertainty_score":0.99992,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001572151,0.00009934462,0.000154383,0.00004308311,0.0001361673,0.0001097276,0.0007314226,0.00005662223,0.0001104217],"category_scores_gemma":[0.0001482828,0.00007044039,0.0001193909,0.0005819878,0.00008863193,0.0002184399,0.0003287658,0.0001317067,0.00001160164],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001265586,"about_ca_system_score_gemma":0.0001108261,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001019991,"about_ca_topic_score_gemma":0.00001069897,"domain_scores_codex":[0.9990287,0.0001149174,0.0002060019,0.0002220921,0.0002632815,0.0001649824],"domain_scores_gemma":[0.9992151,0.00009760372,0.0001295273,0.0004282578,0.00009777721,0.00003168979],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0001128339,0.0001634736,0.001097588,0.0001419074,0.00004618111,0.00002305704,0.003209005,0.0000255298,0.07300515,0.9097897,0.0001566687,0.01222891],"study_design_scores_gemma":[0.001810222,0.0002796206,0.03019935,0.000457286,0.00007571466,0.00002119898,0.0001626378,0.001106358,0.7269381,0.2116044,0.02651755,0.0008275415],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9836951,0.0001807372,0.004619969,0.0003018169,0.004624675,0.0001270949,0.000005347471,0.00005409548,0.00639113],"genre_scores_gemma":[0.9985539,0.00003252312,0.000197616,0.0001019824,0.0009908756,0.000007186064,4.919031e-7,0.000003945212,0.00011151],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.6981853,"threshold_uncertainty_score":0.2872476,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000184324,0.0001139019,0.0001389299,0.00004210631,0.0003065685,0.0000841494,0.0002243232,0.00004665444,0.002330268],"category_scores_gemma":[0.00002297246,0.00007228845,0.00007404267,0.0005519416,0.00009782474,0.00007164134,0.00003939929,0.0001318741,0.0001017095],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000008606035,"about_ca_system_score_gemma":0.0000450439,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002223149,"about_ca_topic_score_gemma":0.0005496821,"domain_scores_codex":[0.9992504,0.00007829232,0.0001360786,0.0001884445,0.0001709292,0.0001758614],"domain_scores_gemma":[0.9991247,0.0003220449,0.0000905894,0.0003455165,0.00007065443,0.00004646014],"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.00001306621,0.00005787535,0.0001828847,0.00003323263,0.00003477356,0.00001390177,0.0005276546,8.508911e-7,0.0004035739,0.9848006,0.0133192,0.0006124248],"study_design_scores_gemma":[0.0001836618,0.00002119146,0.000674646,0.00001085432,0.00005525457,0.00002242646,0.001539612,0.000001709365,0.005557339,0.8214875,0.1703023,0.0001434995],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8324591,0.0002291784,0.0003087865,0.001190301,0.0001424128,0.0002443696,0.0000421987,0.00007783742,0.1653058],"genre_scores_gemma":[0.9854759,0.00003083331,0.002395958,0.000334987,0.001385275,0.00007273042,0.000009151412,0.00003284141,0.0102623],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.163313,"threshold_uncertainty_score":0.9985817,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002573781,0.0002083768,0.0004638361,0.0001220233,0.00009272663,0.00004771404,0.0003067049,0.0001812469,0.0001030491],"category_scores_gemma":[0.0001137966,0.0001990385,0.000181137,0.0002181966,0.0001123595,0.0000383712,0.0004025577,0.0003252301,0.000009737206],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001369096,"about_ca_system_score_gemma":0.00003825396,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003904702,"about_ca_topic_score_gemma":0.00001422904,"domain_scores_codex":[0.998791,0.00005733351,0.0004245372,0.0003682198,0.0001995473,0.000159352],"domain_scores_gemma":[0.9988027,0.0002449374,0.0004153016,0.0003950135,0.00005938809,0.00008264323],"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.00003008222,0.00005997235,0.0006285688,0.001037706,0.00007030003,0.000003700347,0.0006884085,0.000002848322,0.0003500533,0.9940238,0.001461925,0.001642645],"study_design_scores_gemma":[0.0001216435,0.00001547283,0.001527799,0.00009208096,0.0001448812,0.000003021074,0.0001221142,0.00002220159,0.0005659686,0.9957407,0.00146031,0.000183775],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.970311,0.0006367697,0.004031934,0.0004913632,0.0004932096,0.000898472,0.0003102513,0.0001428611,0.02268414],"genre_scores_gemma":[0.992051,0.0002745732,0.006849383,0.00002523452,0.0006763067,0.00004229955,0.00002102062,0.00002658531,0.00003357298],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.02265057,"threshold_uncertainty_score":0.8116556,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003206654,0.0001088757,0.0001972913,0.000183121,0.0001112553,0.0001015945,0.00073073,0.00004706534,0.0001700629],"category_scores_gemma":[0.00005019627,0.00009494354,0.00006924733,0.0006819751,0.00004563618,0.000440519,0.0001524414,0.00006914433,0.0001643772],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00000909246,"about_ca_system_score_gemma":0.0000247919,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001335117,"about_ca_topic_score_gemma":0.000003001479,"domain_scores_codex":[0.9989871,0.00009463191,0.0002874329,0.0002280356,0.000229676,0.000173163],"domain_scores_gemma":[0.9991482,0.0001499702,0.000213372,0.0003477968,0.0000791171,0.0000615247],"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.000009576928,0.0001276059,0.00121743,0.00008345567,0.00001424281,0.000002190261,0.0004653375,0.00006693416,0.002494087,0.9260712,0.0008997367,0.06854823],"study_design_scores_gemma":[0.001999189,0.0007251648,0.05203295,0.0001843202,0.00009251752,0.00004935292,0.0002016974,0.1302423,0.03539608,0.1516918,0.6257953,0.001589264],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2674354,0.000320646,0.6618831,0.001078196,0.003631998,0.0004107563,0.00003505536,0.0004625509,0.06474227],"genre_scores_gemma":[0.9554613,0.0001410811,0.03851405,0.0001237803,0.005165344,0.000007285915,0.00001262755,0.00001554362,0.0005589825],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7743794,"threshold_uncertainty_score":0.3871685,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0003665915,0.0001880328,0.0001937331,0.0003245844,0.0002406831,0.0003109046,0.001144446,0.00007228472,0.0003164297],"category_scores_gemma":[0.00007941452,0.0001647265,0.00008995206,0.001683297,0.00003928351,0.0004138132,0.0002454323,0.0001525896,0.004999547],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003037118,"about_ca_system_score_gemma":0.00003405146,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000134468,"about_ca_topic_score_gemma":0.000002491597,"domain_scores_codex":[0.9983751,0.00006916351,0.0002275758,0.0004433461,0.0004584007,0.0004264157],"domain_scores_gemma":[0.9989048,0.0004030729,0.0001139331,0.0004209498,0.00003495741,0.0001222595],"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.00003506126,0.0001009258,0.00002215839,0.00004465334,0.00002697244,0.00009304155,0.0005136075,0.001030144,0.0001899709,0.6858463,0.2279445,0.08415267],"study_design_scores_gemma":[0.001726672,0.0008493429,0.001208063,0.0001384664,0.00005127552,0.00004304983,0.0002962703,0.04979269,0.002043814,0.7393237,0.2026901,0.001836521],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2451206,0.002632282,0.4909113,0.009562586,0.02289839,0.001919067,0.000242379,0.007952224,0.2187612],"genre_scores_gemma":[0.9525737,0.000423151,0.007262409,0.00121388,0.01563613,0.0001089159,0.00004671845,0.0001018653,0.02263323],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7074531,"threshold_uncertainty_score":0.9957752,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}