{"meta":{"query_hash":"d0bd18469ffd","filters":{"venue":"Special Matrices"},"cohort_total":27,"direct_labels_cover":0,"predictions_cover":27,"exported":27,"export_cap":100000,"truncated":false,"label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"permalink":"https://metacan.xera.ac/q/d0bd18469ffd","api":"https://metacan.xera.ac/api/v1/cohort?venue=Special+Matrices"},"results":[{"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.018544019809179087,"score_gpt":0.2380240143071797,"score_spread":0.21947999449800062,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1202646857","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9173351,0.0029182502,0.044019446,0.002388212,0.0022878896,0.00040861772,0.00004252631,0.00040141112,0.03019855],"genre_scores_gemma":[0.99199194,0.000063539715,0.0040309117,0.00050553936,0.003192657,0.000008129154,0.0000074181994,0.000014143842,0.00018571567],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99868083,0.00007676925,0.00024889674,0.0004097467,0.00027754254,0.0003062295],"domain_scores_gemma":[0.9991501,0.0001736684,0.00015212942,0.00022213833,0.00008412786,0.00021782462],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022562654,0.00020969516,0.00024068201,0.0001850588,0.0001610739,0.0004315651,0.0005598957,0.000060669194,0.000038228576],"category_scores_gemma":[0.000030615993,0.00016876541,0.00006473161,0.00048898126,0.000075324846,0.00080281304,0.00036692363,0.00011716424,0.00012822873],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016648117,0.00022698598,0.0038844694,0.000059644583,0.00013068954,0.00009478931,0.012450196,0.00009004066,0.0007163146,0.34532395,0.05751674,0.57933974],"study_design_scores_gemma":[0.0052625365,0.0015013843,0.23622912,0.00017048857,0.00008865635,0.00027442328,0.0014547798,0.037143253,0.0050545526,0.48187482,0.22831768,0.0026283031],"about_ca_topic_score_codex":0.00022676463,"about_ca_topic_score_gemma":0.000051845698,"teacher_disagreement_score":0.5767114,"about_ca_system_score_codex":0.00005068536,"about_ca_system_score_gemma":0.00008269354,"threshold_uncertainty_score":0.68820536},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.015074638710474587,"score_gpt":0.21627885911335382,"score_spread":0.20120422040287922,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1491211998","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.61565435,0.010279977,0.00020560775,0.000024320496,0.003173692,0.00023517465,0.000033285367,0.0002723196,0.3701213],"genre_scores_gemma":[0.9964622,0.00033673443,0.00040431906,0.000008222004,0.0022244174,0.000010456168,0.0000055158557,0.00003439084,0.0005137281],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9988346,0.00004533795,0.00036555016,0.00016306608,0.00033158195,0.00025986112],"domain_scores_gemma":[0.9993399,0.00008413106,0.00009624456,0.0002294278,0.00011664594,0.00013365805],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025641327,0.00018219976,0.00031882344,0.00044351764,0.000044147437,0.00005948066,0.00027986075,0.00010567948,0.00019942327],"category_scores_gemma":[0.00006602344,0.00016635572,0.00008360503,0.0016413315,0.000049256952,0.00020067414,0.000036822355,0.00011192682,0.00027575306],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00072195986,0.00063695846,0.07318945,0.004611275,0.0012050157,0.0002545174,0.008695281,0.015762512,0.0038222426,0.384726,0.41731519,0.08905959],"study_design_scores_gemma":[0.0037732038,0.0005672468,0.013910705,0.000283834,0.00035333214,0.000091482696,0.005171079,0.0018049126,0.008988489,0.049496762,0.91343385,0.0021250756],"about_ca_topic_score_codex":0.00008516115,"about_ca_topic_score_gemma":0.00003273562,"teacher_disagreement_score":0.4961187,"about_ca_system_score_codex":0.00004103419,"about_ca_system_score_gemma":0.00002803975,"threshold_uncertainty_score":0.67837894},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.006287737367324349,"score_gpt":0.24450905541138118,"score_spread":0.23822131804405683,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1982968438","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0072474154,0.00045063198,0.9072229,0.0007424235,0.00019497563,0.0002298394,0.0000034963657,0.00009589227,0.0838124],"genre_scores_gemma":[0.9892735,0.00020204468,0.0091646565,0.00028333266,0.0008930613,0.000025307858,0.000001797006,0.0000049228647,0.00015139654],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9994652,0.00004882448,0.00017292972,0.000080810285,0.00013940754,0.00009278816],"domain_scores_gemma":[0.99930274,0.00027765488,0.00011787774,0.00021810037,0.000049895385,0.00003372238],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005063433,0.000049912112,0.00006832022,0.00007291576,0.0002158894,0.00013206709,0.00044320407,0.000019774794,0.000020744557],"category_scores_gemma":[0.000021024178,0.000033429704,0.00003401164,0.00034601227,0.00011178548,0.00017555724,0.000088763474,0.000038136895,0.00003584146],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000029917103,0.000004483373,0.00013928756,0.0000075208072,0.0000025932077,1.3801526e-8,0.00015612731,0.0000012696581,0.000023067065,0.90261805,0.0007378689,0.096306704],"study_design_scores_gemma":[0.00014248987,0.000028949735,0.008048455,0.0000035222488,0.0000051297675,0.0000026689254,0.00019314815,0.0028796312,0.00016419454,0.36836448,0.6200834,0.00008391074],"about_ca_topic_score_codex":0.000004548895,"about_ca_topic_score_gemma":0.000003219829,"teacher_disagreement_score":0.98202604,"about_ca_system_score_codex":0.0000025237794,"about_ca_system_score_gemma":0.000008442013,"threshold_uncertainty_score":0.16604686},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Graph; Discrete mathematics; Cubic graph; Line graph; Voltage graph; Butterfly graph; Upper and lower bounds; Mathematical analysis","score_opus":0.02862864413862354,"score_gpt":0.2698224245484369,"score_spread":0.24119378040981337,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2067092314","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.54397106,0.00009447642,0.3942839,0.0026956883,0.00031427355,0.00035383189,0.0000038771345,0.00016088157,0.058121998],"genre_scores_gemma":[0.99636817,0.000018939885,0.0028398752,0.00008080487,0.00046777428,0.0000081614935,6.9668397e-7,0.000008744688,0.00020683784],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99884033,0.00021331193,0.00013611212,0.00026391464,0.00029849485,0.0002478325],"domain_scores_gemma":[0.99736947,0.0021101332,0.000073519914,0.00034346545,0.000024143417,0.000079247664],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009226498,0.00010069141,0.00011014884,0.00014701037,0.0004888835,0.00019986444,0.0005963692,0.00004577041,0.000014065092],"category_scores_gemma":[0.00041375376,0.00007295325,0.00004062862,0.00059740286,0.00010369426,0.00035868192,0.00018213355,0.00027681136,0.00006279933],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000071142977,0.0000041760113,0.009441303,0.000006375914,0.000006713026,9.759726e-7,0.00042599748,0.000046698206,0.000019686358,0.9813029,0.0008125827,0.007925449],"study_design_scores_gemma":[0.00014444411,0.00006475819,0.018607747,0.000017873603,0.000004163958,0.0000017369559,0.00006667361,0.00047766193,0.00016728585,0.9727492,0.0075724707,0.00012598404],"about_ca_topic_score_codex":0.000024193523,"about_ca_topic_score_gemma":0.000022203061,"teacher_disagreement_score":0.45239708,"about_ca_system_score_codex":0.000021403834,"about_ca_system_score_gemma":0.000012146964,"threshold_uncertainty_score":0.37601462},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada; 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","score_opus":0.009672768240546798,"score_gpt":0.23120133655520478,"score_spread":0.22152856831465798,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2124912997","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.83580774,0.001968652,0.09400214,0.0003313696,0.0018708896,0.0002796258,0.0000110249,0.00027327755,0.06545529],"genre_scores_gemma":[0.96503943,0.00029712907,0.031959377,0.00007411929,0.0023837963,0.0000039982892,7.2385626e-7,0.000009960441,0.00023148382],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989058,0.000107023836,0.00026321592,0.00027100832,0.00025588777,0.0001970986],"domain_scores_gemma":[0.9990963,0.0003168188,0.00022163433,0.00024326082,0.000047998394,0.000073998184],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005025554,0.0001267765,0.00020803987,0.0001681709,0.00011928469,0.00014601702,0.0005973421,0.00004397158,0.000062194704],"category_scores_gemma":[0.00010451122,0.000109784436,0.000052914995,0.00034512256,0.000079643374,0.000499751,0.00025112004,0.000073555864,0.00003126947],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001598728,0.00005877872,0.0050605396,0.00019515,0.000029179342,0.000009846281,0.0018159071,0.000049576232,0.0010907553,0.5987276,0.0008084489,0.3921382],"study_design_scores_gemma":[0.0025313601,0.0012514231,0.024135236,0.00032983598,0.00013427426,0.00007550385,0.0011243118,0.06072486,0.07436605,0.72006387,0.113180645,0.0020826505],"about_ca_topic_score_codex":0.000061867315,"about_ca_topic_score_gemma":0.0000052653686,"teacher_disagreement_score":0.39005557,"about_ca_system_score_codex":0.000008221651,"about_ca_system_score_gemma":0.000018306962,"threshold_uncertainty_score":0.44768792},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.024008734125993973,"score_gpt":0.258861157228126,"score_spread":0.23485242310213206,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2325676038","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18345623,0.0077571124,0.2114194,0.0047247056,0.021312492,0.0010317201,0.000049846472,0.0019214833,0.568327],"genre_scores_gemma":[0.8863471,0.00027165815,0.08135498,0.0008063762,0.026882749,0.000031296608,0.00002104673,0.00004527002,0.004239514],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99855024,0.00009678546,0.00023909456,0.0003344655,0.00046814114,0.00031125854],"domain_scores_gemma":[0.9991129,0.000094217125,0.0001292753,0.00033689567,0.00008854904,0.00023818774],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0004768596,0.000158117,0.00018883495,0.00017880919,0.00013147519,0.00035094318,0.0011142917,0.000058516507,0.00023547246],"category_scores_gemma":[0.00003677043,0.00013953322,0.00010051763,0.0006388562,0.000045123572,0.00085539307,0.0002933813,0.00012407155,0.0014649425],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034067252,0.00015954174,0.0018648626,0.000029578017,0.0000302793,0.000076001365,0.0012598754,0.00009661093,0.00004468983,0.8638264,0.06448864,0.06808943],"study_design_scores_gemma":[0.0014894508,0.00028620788,0.004225204,0.00003357735,0.00003486631,0.00014833713,0.0004799369,0.0077103064,0.0009803633,0.21989276,0.7638456,0.00087334466],"about_ca_topic_score_codex":0.000044817512,"about_ca_topic_score_gemma":0.000007827281,"teacher_disagreement_score":0.7028909,"about_ca_system_score_codex":0.000052701984,"about_ca_system_score_gemma":0.000096446274,"threshold_uncertainty_score":0.9993125},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.06550052626739573,"score_gpt":0.3441745277099986,"score_spread":0.2786740014426029,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2344140520","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.888719,0.00009844322,0.0023675435,0.006250653,0.00022378695,0.00065620034,0.00012913893,0.00009208073,0.10146312],"genre_scores_gemma":[0.99619424,0.00005056822,0.0012622926,0.00004582377,0.0012515509,0.000026835922,8.592357e-7,0.000015034533,0.0011527693],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990025,0.00005961778,0.00032205577,0.00016058784,0.00029306515,0.00016217012],"domain_scores_gemma":[0.9975789,0.0016797575,0.00024460861,0.00038088197,0.00007673878,0.000039122482],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00040700423,0.000111207424,0.00023523715,0.00005338656,0.00012543635,0.000025768772,0.00032422892,0.000044776316,0.001266786],"category_scores_gemma":[0.00024568112,0.00005258781,0.0001491749,0.00025918774,0.00010195372,0.000049032948,0.00005197493,0.000054680328,0.00018618249],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000053102223,0.00006202128,0.00032574296,0.00003760615,0.0000239112,5.5721404e-7,0.000084626896,5.3720584e-7,0.0011550012,0.94569135,0.050088942,0.0024766256],"study_design_scores_gemma":[0.00083601434,0.000058201,0.003942688,0.00005823443,0.0000830224,0.0000031267577,0.00014548542,0.000012644527,0.0023727233,0.91082996,0.081475586,0.00018230267],"about_ca_topic_score_codex":0.000041118652,"about_ca_topic_score_gemma":0.000010628626,"teacher_disagreement_score":0.10747523,"about_ca_system_score_codex":0.000025487847,"about_ca_system_score_gemma":0.000017139388,"threshold_uncertainty_score":0.9996462},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.08173479407217125,"score_gpt":0.42425546235479406,"score_spread":0.3425206682826228,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2467994838","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026080336,0.00007351415,0.9661864,0.0009378354,0.00020552316,0.00020717958,0.000088645545,0.000067417895,0.0061531523],"genre_scores_gemma":[0.17357327,0.00014273365,0.816409,0.00006259793,0.0016432321,0.000032042142,0.0000016563314,0.00003154219,0.008103908],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990655,0.0000848807,0.00023119753,0.00025186758,0.00015592153,0.00021064402],"domain_scores_gemma":[0.9984297,0.0011326933,0.0001157023,0.00017593266,0.000054207692,0.00009172807],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025159027,0.00011890805,0.00029989364,0.00012299097,0.00008570045,0.000025452406,0.00009199283,0.000056215064,0.00043684695],"category_scores_gemma":[0.00079090014,0.00007003908,0.00006739718,0.0002814572,0.000062997125,0.00013132587,0.0000672101,0.000053116,0.000024330622],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000056553206,0.000058026453,0.00073073944,0.000051978917,0.0002262948,0.00001157546,0.00025481833,6.6390976e-7,0.00096830406,0.8961245,0.0012518791,0.10026467],"study_design_scores_gemma":[0.00045239148,0.00003575761,0.0033841615,0.000023054816,0.0004273008,0.0000010046965,0.000056953148,0.0001598721,0.00034141907,0.98672414,0.008205896,0.00018802947],"about_ca_topic_score_codex":0.000017862061,"about_ca_topic_score_gemma":0.00006377775,"teacher_disagreement_score":0.14977738,"about_ca_system_score_codex":0.000020325135,"about_ca_system_score_gemma":0.0000109883895,"threshold_uncertainty_score":0.47831678},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.005134327060679731,"score_gpt":0.17215868667192666,"score_spread":0.16702435961124693,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2529571702","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9889924,0.0009707896,0.00078073837,0.00007739632,0.0015724291,0.0008120411,0.00019403118,0.00064101565,0.0059591713],"genre_scores_gemma":[0.99583715,0.0010896962,0.000052432333,0.000030196165,0.0026017937,0.00015347237,0.000018593939,0.00017857784,0.000038097613],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9958596,0.00022304131,0.0010660585,0.00082955585,0.0008905693,0.0011311453],"domain_scores_gemma":[0.9976773,0.0004151921,0.00044205098,0.0009338448,0.0001815064,0.0003500866],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004284996,0.0008850829,0.001174502,0.0006629284,0.00024481877,0.00014954412,0.000789463,0.0004623211,0.000038156482],"category_scores_gemma":[0.0000840696,0.00066547026,0.00039128764,0.0011409735,0.00040678793,0.00061567716,0.00015826256,0.0004461798,0.0005146534],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00032795902,0.00014872158,0.002454139,0.00046424344,0.0003108611,0.000053231037,0.00090797193,0.00009365181,0.95701903,0.004248481,0.0009861556,0.032985546],"study_design_scores_gemma":[0.001730243,0.00038616848,0.02016909,0.0006804398,0.0002093665,0.000051209347,0.0005163089,0.000110666646,0.9685511,0.0049098115,0.0015478452,0.0011377274],"about_ca_topic_score_codex":0.000024498226,"about_ca_topic_score_gemma":0.00040019106,"teacher_disagreement_score":0.03184782,"about_ca_system_score_codex":0.00020560616,"about_ca_system_score_gemma":0.00010965343,"threshold_uncertainty_score":0.99957967},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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)","score_opus":0.006837211532872308,"score_gpt":0.21052993587872315,"score_spread":0.20369272434585084,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2762977785","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9373728,0.001542309,0.0025193738,0.000019166497,0.0038211788,0.00043651336,0.000095263604,0.00013212644,0.05406126],"genre_scores_gemma":[0.9940965,0.00011293656,0.0033440883,0.000003866445,0.0023027528,0.000014326927,0.0000047552144,0.000024266172,0.00009647263],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9990488,0.000025491954,0.00042249542,0.0001367266,0.00017643966,0.00019001035],"domain_scores_gemma":[0.9992733,0.00013859938,0.00017564662,0.00016834839,0.00020418114,0.000039922175],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022600121,0.00013411428,0.00030154415,0.00043874866,0.000055605527,0.000018899778,0.00018014775,0.00010323975,0.00019424362],"category_scores_gemma":[0.00006187766,0.00012643955,0.0001051143,0.001196202,0.00012661723,0.00014332519,0.000017321607,0.000053530883,0.000027092656],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00063771725,0.00022860774,0.02450273,0.005748584,0.00086273334,0.0000048273787,0.0022828267,0.00077702524,0.0257799,0.7860856,0.03273911,0.12035033],"study_design_scores_gemma":[0.0054161437,0.0022021774,0.02185904,0.0006689922,0.0008515389,0.000088777735,0.00559543,0.005815549,0.2654973,0.093634635,0.59617585,0.0021945997],"about_ca_topic_score_codex":0.000040725037,"about_ca_topic_score_gemma":0.00003004946,"teacher_disagreement_score":0.692451,"about_ca_system_score_codex":0.000018716137,"about_ca_system_score_gemma":0.000016729076,"threshold_uncertainty_score":0.5156055},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.01422740743193453,"score_gpt":0.2618586584246281,"score_spread":0.24763125099269354,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2775700832","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25325474,0.001384901,0.14959764,0.096465945,0.024818191,0.0022552223,0.00013007919,0.0007615038,0.47133178],"genre_scores_gemma":[0.9780263,0.00004402889,0.0043535633,0.001514168,0.0120413,0.00002461372,0.0000016012128,0.000013158372,0.003981306],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99911386,0.00004103883,0.00012112085,0.00025434216,0.00024115593,0.00022849083],"domain_scores_gemma":[0.9987273,0.00006638575,0.000108473825,0.0009827913,0.00003483683,0.0000801656],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00031182397,0.00011074191,0.000115528586,0.000043431995,0.00085513503,0.0010193794,0.0024958,0.000035520643,0.00022234414],"category_scores_gemma":[0.000052641164,0.00006983192,0.000060669547,0.00009375068,0.000050056005,0.00033761776,0.00054124056,0.0001095914,0.00079490594],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024064006,0.00004872609,0.00035798407,0.000022596194,0.000026174504,0.00007403376,0.0035797814,0.000045161592,0.00010351658,0.79403275,0.07868466,0.12300053],"study_design_scores_gemma":[0.00019294675,0.0000648796,0.007607577,0.000013996552,0.000007642442,0.000026689228,0.00007261333,0.00052809296,0.00031937432,0.024615528,0.96634877,0.00020191725],"about_ca_topic_score_codex":0.00008444595,"about_ca_topic_score_gemma":0.000087086984,"teacher_disagreement_score":0.8876641,"about_ca_system_score_codex":0.000019016321,"about_ca_system_score_gemma":0.000032826312,"threshold_uncertainty_score":0.9999831},"labels":[],"label_agreement":null},{"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.01315331725089142,"score_gpt":0.24107352153313494,"score_spread":0.22792020428224352,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2898444729","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.66429436,0.005219093,0.30590707,0.007630467,0.0035280734,0.00015384305,0.000009780213,0.000444483,0.012812821],"genre_scores_gemma":[0.67003053,0.00045386105,0.32054958,0.0007206796,0.007908028,0.000004267925,0.0000052852256,0.000025692654,0.00030210763],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99902695,0.000037650847,0.00014428585,0.0003627168,0.00019273035,0.00023566722],"domain_scores_gemma":[0.9994717,0.000080604856,0.00006010344,0.00025944048,0.000037396523,0.00009074922],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000109700304,0.00011466083,0.00014294196,0.000094223185,0.00022043867,0.00033248338,0.00030148283,0.000045168206,0.000031462747],"category_scores_gemma":[0.000025222129,0.000103217135,0.00005155641,0.00050485454,0.00003412099,0.00014353389,0.00028275818,0.00014281645,0.000016612004],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008549525,0.00011787824,0.0029027087,0.000094811636,0.000049924503,0.00049417303,0.0028771874,0.00061672326,0.0022067747,0.31897265,0.0032390342,0.6684196],"study_design_scores_gemma":[0.0018674135,0.00037032377,0.08422118,0.00032739653,0.00006062654,0.001291497,0.00051063247,0.113153994,0.008770919,0.4885045,0.2988375,0.0020840294],"about_ca_topic_score_codex":0.000018951565,"about_ca_topic_score_gemma":0.000010235024,"teacher_disagreement_score":0.6663356,"about_ca_system_score_codex":0.000008413938,"about_ca_system_score_gemma":0.00004314789,"threshold_uncertainty_score":0.42090726},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.055796252488866674,"score_gpt":0.3084285747196465,"score_spread":0.25263232223077986,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2948867122","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.970311,0.0006367697,0.0040319343,0.0004913632,0.0004932096,0.00089847203,0.00031025126,0.00014286114,0.022684138],"genre_scores_gemma":[0.992051,0.0002745732,0.0068493825,0.000025234516,0.00067630666,0.00004229955,0.000021020624,0.000026585305,0.000033572982],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99879104,0.00005733351,0.00042453717,0.0003682198,0.00019954727,0.000159352],"domain_scores_gemma":[0.9988027,0.00024493743,0.0004153016,0.0003950135,0.000059388087,0.00008264323],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002573781,0.0002083768,0.00046383607,0.000122023346,0.00009272663,0.00004771404,0.00030670493,0.00018124693,0.00010304911],"category_scores_gemma":[0.00011379658,0.00019903855,0.00018113702,0.00021819658,0.000112359514,0.0000383712,0.00040255772,0.00032523007,0.000009737206],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030082221,0.000059972346,0.0006285688,0.0010377059,0.00007030003,0.0000037003474,0.0006884085,0.0000028483219,0.00035005328,0.9940238,0.0014619255,0.0016426446],"study_design_scores_gemma":[0.00012164349,0.00001547283,0.0015277987,0.00009208096,0.00014488115,0.0000030210742,0.00012211422,0.000022201593,0.0005659686,0.9957407,0.0014603097,0.00018377502],"about_ca_topic_score_codex":0.00003904702,"about_ca_topic_score_gemma":0.000014229036,"teacher_disagreement_score":0.022650566,"about_ca_system_score_codex":0.000013690962,"about_ca_system_score_gemma":0.00003825396,"threshold_uncertainty_score":0.81165564},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.009055364507476205,"score_gpt":0.22970060009011656,"score_spread":0.22064523558264035,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2964243499","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2674354,0.00032064595,0.6618831,0.0010781962,0.0036319979,0.0004107563,0.00003505536,0.00046255093,0.064742275],"genre_scores_gemma":[0.9554613,0.00014108108,0.038514048,0.00012378028,0.0051653436,0.000007285915,0.000012627549,0.000015543625,0.0005589825],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9989871,0.000094631905,0.00028743292,0.00022803564,0.00022967598,0.00017316299],"domain_scores_gemma":[0.9991482,0.00014997016,0.00021337204,0.0003477968,0.0000791171,0.0000615247],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032066536,0.000108875734,0.00019729133,0.00018312101,0.00011125526,0.0001015945,0.00073073,0.000047065343,0.00017006286],"category_scores_gemma":[0.000050196275,0.00009494354,0.000069247326,0.0006819751,0.000045636185,0.00044051904,0.00015244143,0.00006914433,0.00016437721],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009576928,0.00012760588,0.0012174301,0.00008345567,0.000014242808,0.000002190261,0.00046533754,0.00006693416,0.0024940872,0.92607117,0.0008997367,0.06854823],"study_design_scores_gemma":[0.0019991887,0.00072516483,0.052032948,0.00018432018,0.00009251752,0.000049352915,0.00020169737,0.13024235,0.03539608,0.1516918,0.6257953,0.0015892643],"about_ca_topic_score_codex":0.000013351175,"about_ca_topic_score_gemma":0.0000030014787,"teacher_disagreement_score":0.7743794,"about_ca_system_score_codex":0.0000090924605,"about_ca_system_score_gemma":0.000024791903,"threshold_uncertainty_score":0.38716853},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University; University of Waterloo","funders":"","keywords":"Mathematics; Abelian group; Pure mathematics; Algebra over a field","score_opus":0.0098922211831459,"score_gpt":0.2621349386192329,"score_spread":0.252242717436087,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2975313719","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9415993,0.0006104593,0.04028825,0.000018370956,0.0020829688,0.00040594558,0.000028916536,0.00012797375,0.014837832],"genre_scores_gemma":[0.9896234,0.000032397216,0.00954756,0.000014173078,0.00054910034,0.00003136768,0.000011727996,0.000015160277,0.00017505854],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99944335,0.00004026631,0.0001785125,0.0001169348,0.00006676092,0.00015418432],"domain_scores_gemma":[0.99942935,0.000424258,0.00002458888,0.0000802447,0.000016442835,0.00002510835],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020318347,0.000095829426,0.00016454876,0.00017176809,0.000025677542,0.000032059237,0.000121870224,0.00005219473,0.00008662567],"category_scores_gemma":[0.000017575936,0.00009127356,0.000049869985,0.00025472217,0.000014081933,0.00007459864,0.000011905491,0.00006629694,0.0000776373],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017837269,0.00010899352,0.0467292,0.001736666,0.00013740861,0.0000061284313,0.006385405,0.26590186,0.0064373217,0.452448,0.0012127293,0.21871793],"study_design_scores_gemma":[0.0026312487,0.00023350786,0.18202958,0.00024113449,0.00003816372,0.00000649008,0.002483466,0.3107895,0.0016039296,0.42507908,0.0736698,0.0011941124],"about_ca_topic_score_codex":0.00000960394,"about_ca_topic_score_gemma":0.00002019585,"teacher_disagreement_score":0.21752381,"about_ca_system_score_codex":0.000019016205,"about_ca_system_score_gemma":0.0000059515924,"threshold_uncertainty_score":0.37220278},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Signed graph; Laplacian matrix; Mathematics; Laplace operator; Combinatorics; Eigenvalues and eigenvectors; Algebraic connectivity; Upper and lower bounds; Discrete mathematics; Graph; Mathematical analysis; Physics","score_opus":0.027309227176107575,"score_gpt":0.2958247948631122,"score_spread":0.26851556768700463,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2994336805","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94168335,0.0010343643,0.0004184837,0.00011786413,0.0008786334,0.0012234518,0.00048797246,0.00011943835,0.054036457],"genre_scores_gemma":[0.99079645,0.0004096491,0.0071205115,0.000013475848,0.00086418254,0.00006346414,0.00006285339,0.000057914913,0.0006115274],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997691,0.00013738373,0.001011964,0.0004413282,0.0004570885,0.00026124087],"domain_scores_gemma":[0.99652946,0.00066554814,0.001551789,0.00092516624,0.00025634345,0.000071690774],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00044911398,0.00036048304,0.0009387858,0.0006198115,0.000064459084,0.00003364988,0.0008915035,0.00042106243,0.00068678695],"category_scores_gemma":[0.00011042114,0.00032523266,0.00045270458,0.00075344805,0.00017146194,0.00008254977,0.0004289867,0.0003723194,0.00006028956],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001286302,0.0003977004,0.0013367006,0.002675503,0.0002452947,0.0000022384454,0.00090950745,0.00001772207,0.0015315586,0.98663855,0.0050971652,0.0010194384],"study_design_scores_gemma":[0.00034232892,0.00006991837,0.00070250453,0.00028468456,0.00035163254,0.0000014525056,0.00026590592,0.000032714368,0.008111074,0.9869268,0.0025584567,0.0003525093],"about_ca_topic_score_codex":0.000082141996,"about_ca_topic_score_gemma":0.00004290748,"teacher_disagreement_score":0.05342493,"about_ca_system_score_codex":0.000022985134,"about_ca_system_score_gemma":0.00011490705,"threshold_uncertainty_score":0.99991995},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.029023872947341624,"score_gpt":0.288474923220522,"score_spread":0.2594510502731804,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2996622318","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9491748,0.000021449096,0.00005287594,0.0001969549,0.00004549669,0.0006592448,0.000026590254,0.00002367846,0.049798917],"genre_scores_gemma":[0.9954011,0.000023908493,0.0038914823,0.00005060062,0.00019327195,0.00009454892,0.0000045554375,0.000008982764,0.00033158157],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99921435,0.00009551667,0.00025147814,0.00013604453,0.0001532201,0.00014939305],"domain_scores_gemma":[0.99915886,0.0003554732,0.00013160678,0.00030070034,0.000031629857,0.00002172118],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000464231,0.000083854255,0.00014921495,0.000110454326,0.00007928083,0.00001793037,0.00027460948,0.000048353242,0.0004478822],"category_scores_gemma":[0.000034894896,0.00006037796,0.0000857008,0.00064373954,0.000062721156,0.00009440087,0.00003294289,0.00011987994,0.00013269931],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018621155,0.00030992055,0.008258304,0.00009426742,0.000011907374,6.5162664e-7,0.0019376763,0.000047609265,0.0008947967,0.98535264,0.0028837027,0.00018988401],"study_design_scores_gemma":[0.00028963303,0.000034744542,0.0046504447,0.000024653746,0.000026406155,0.0000016179749,0.0011715819,0.000028217259,0.0006211217,0.98531985,0.007741964,0.00008973286],"about_ca_topic_score_codex":0.00007638744,"about_ca_topic_score_gemma":0.0005680763,"teacher_disagreement_score":0.049467336,"about_ca_system_score_codex":0.000009214777,"about_ca_system_score_gemma":0.00001810559,"threshold_uncertainty_score":0.4903996},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.025360225250276272,"score_gpt":0.24885324596245484,"score_spread":0.22349302071217858,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3110225681","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0044200025,0.019462336,0.08821159,0.027518556,0.2818692,0.03412639,0.012070077,0.0027444977,0.5295774],"genre_scores_gemma":[0.12320942,0.016248107,0.14923894,0.014926549,0.21776626,0.01103306,0.00931369,0.001724976,0.456539],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9937837,0.0006449063,0.0015481256,0.0013720896,0.0016340717,0.0010170958],"domain_scores_gemma":[0.99630815,0.0002350963,0.0012418354,0.0015622262,0.00030846096,0.000344224],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0010474543,0.00077129866,0.0012675042,0.00096189656,0.0003294766,0.0006718586,0.005378928,0.00057822117,0.00015921044],"category_scores_gemma":[0.00020760011,0.00063549174,0.0005120033,0.0045516253,0.00012885002,0.00070684234,0.0008535652,0.0012430425,0.00089135196],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000041004136,0.00029140557,0.00044948762,0.00034125833,0.00009581319,0.00008922177,0.0025466238,0.00027244506,0.000047587062,0.0053391014,0.9896848,0.0008012375],"study_design_scores_gemma":[0.00089843717,0.00028225928,0.0029857026,0.0003596718,0.00013864387,0.000014982222,0.00054897723,0.0029843235,0.000027383228,0.002062078,0.98882955,0.00086798635],"about_ca_topic_score_codex":0.0038687505,"about_ca_topic_score_gemma":0.006696831,"teacher_disagreement_score":0.11878941,"about_ca_system_score_codex":0.00025526792,"about_ca_system_score_gemma":0.0005856754,"threshold_uncertainty_score":0.9998866},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.010987940630807078,"score_gpt":0.26684363093154295,"score_spread":0.25585569030073585,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3130990978","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7529531,0.005821152,0.16133067,0.0051211985,0.008547572,0.0031540107,0.0007120405,0.0006520393,0.061708193],"genre_scores_gemma":[0.7826008,0.00085881294,0.19721441,0.0006639696,0.015978862,0.00013929495,0.00019405584,0.000065911256,0.00228385],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99853855,0.00009432674,0.00034898636,0.00042411432,0.00030911824,0.00028491774],"domain_scores_gemma":[0.99897987,0.00011741771,0.00020462798,0.00046549525,0.00013601553,0.00009654965],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032159008,0.00016362833,0.00026941713,0.00011868621,0.00014852118,0.00014436095,0.00078115903,0.000072087365,0.0003044619],"category_scores_gemma":[0.000017087963,0.00014580955,0.00013013705,0.00046651272,0.000039880873,0.00048442755,0.00015155012,0.00009303874,0.000009640198],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020977677,0.001044568,0.0013414968,0.00084424706,0.00017832403,0.00020627955,0.0037000575,0.00032241805,0.007806263,0.72164714,0.015080703,0.24761873],"study_design_scores_gemma":[0.0054996377,0.0026045523,0.0049522757,0.00018222422,0.0002796377,0.00022053742,0.0022343027,0.011945066,0.39095128,0.22103591,0.3580302,0.0020643596],"about_ca_topic_score_codex":0.00003445269,"about_ca_topic_score_gemma":0.00003934642,"teacher_disagreement_score":0.50061125,"about_ca_system_score_codex":0.000028989429,"about_ca_system_score_gemma":0.00013059952,"threshold_uncertainty_score":0.59459406},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"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","score_opus":0.019173717969474775,"score_gpt":0.23007974273332416,"score_spread":0.21090602476384937,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3169276539","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98369515,0.00018073723,0.004619969,0.00030181694,0.004624675,0.00012709494,0.0000053474714,0.00005409548,0.0063911304],"genre_scores_gemma":[0.9985539,0.000032523116,0.000197616,0.000101982434,0.0009908756,0.0000071860636,4.9190305e-7,0.0000039452116,0.000111509995],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99902874,0.00011491736,0.00020600186,0.00022209215,0.0002632815,0.00016498243],"domain_scores_gemma":[0.9992151,0.00009760372,0.00012952733,0.0004282578,0.00009777721,0.000031689793],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015721508,0.000099344616,0.00015438303,0.000043083106,0.00013616726,0.000109727574,0.00073142257,0.000056622226,0.00011042169],"category_scores_gemma":[0.00014828278,0.00007044039,0.00011939095,0.0005819878,0.00008863193,0.00021843986,0.00032876583,0.00013170669,0.0000116016445],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000112833855,0.00016347355,0.0010975883,0.00014190738,0.00004618111,0.000023057044,0.0032090049,0.000025529798,0.073005155,0.9097897,0.00015666874,0.012228905],"study_design_scores_gemma":[0.0018102216,0.0002796206,0.030199353,0.00045728602,0.000075714655,0.00002119898,0.00016263779,0.0011063578,0.7269381,0.2116044,0.026517551,0.00082754146],"about_ca_topic_score_codex":0.000010199906,"about_ca_topic_score_gemma":0.000010698968,"teacher_disagreement_score":0.69818527,"about_ca_system_score_codex":0.000012655859,"about_ca_system_score_gemma":0.000110826055,"threshold_uncertainty_score":0.28724757},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.02073033612705072,"score_gpt":0.26729986961542895,"score_spread":0.24656953348837823,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4200032008","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8324591,0.00022917842,0.00030878655,0.0011903015,0.0001424128,0.00024436958,0.0000421987,0.00007783742,0.16530584],"genre_scores_gemma":[0.9854759,0.00003083331,0.0023959584,0.000334987,0.0013852754,0.00007273042,0.000009151412,0.000032841413,0.010262303],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992504,0.000078292316,0.00013607864,0.00018844454,0.00017092917,0.00017586135],"domain_scores_gemma":[0.9991247,0.0003220449,0.0000905894,0.00034551646,0.00007065443,0.000046460143],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00018432402,0.00011390192,0.00013892994,0.00004210631,0.00030656852,0.0000841494,0.00022432316,0.000046654437,0.0023302683],"category_scores_gemma":[0.000022972461,0.00007228845,0.00007404267,0.0005519416,0.00009782474,0.00007164134,0.000039399292,0.00013187405,0.00010170954],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013066213,0.000057875346,0.00018288472,0.000033232627,0.000034773562,0.000013901772,0.0005276546,8.508911e-7,0.00040357394,0.9848006,0.013319205,0.0006124248],"study_design_scores_gemma":[0.00018366182,0.000021191456,0.000674646,0.000010854323,0.000055254568,0.000022426457,0.0015396118,0.000001709365,0.0055573387,0.82148755,0.17030229,0.00014349949],"about_ca_topic_score_codex":0.000002223149,"about_ca_topic_score_gemma":0.0005496821,"teacher_disagreement_score":0.16331303,"about_ca_system_score_codex":0.000008606035,"about_ca_system_score_gemma":0.000045043904,"threshold_uncertainty_score":0.9985817},"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,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"York University; New York University Abu Dhabi","keywords":"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","score_opus":0.013972957080190647,"score_gpt":0.23441146371163982,"score_spread":0.22043850663144918,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4200582650","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8752076,0.011445314,0.03174267,0.0045684236,0.0037007516,0.0008688442,0.00010385109,0.00053615624,0.07182636],"genre_scores_gemma":[0.9556164,0.0033881743,0.03259326,0.0015426376,0.00456163,0.000031525615,0.0000429133,0.000064209,0.0021592642],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99811596,0.00016053277,0.00035278502,0.00048480672,0.00055001164,0.00033589365],"domain_scores_gemma":[0.9985917,0.00042564716,0.00019302378,0.0005310886,0.00013091294,0.00012762174],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030163885,0.00022344594,0.00038283755,0.00013561564,0.00012530663,0.00012585071,0.0008727093,0.00007401164,0.00031467277],"category_scores_gemma":[0.000051016847,0.0001618888,0.00011210484,0.0007748438,0.00011013865,0.00051782915,0.00025408075,0.00020353304,0.00015540946],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001744564,0.0005790317,0.00023333624,0.00039753536,0.000079082085,0.00022957657,0.00031638893,0.000055862456,0.0012829308,0.97353464,0.0033317548,0.019785386],"study_design_scores_gemma":[0.005921817,0.003687441,0.014152566,0.004097158,0.00025669267,0.00059765973,0.00071558735,0.009112679,0.21987617,0.62886655,0.109221384,0.0034943204],"about_ca_topic_score_codex":0.000009734566,"about_ca_topic_score_gemma":0.0000041219864,"teacher_disagreement_score":0.34466812,"about_ca_system_score_codex":0.00002470456,"about_ca_system_score_gemma":0.00009277252,"threshold_uncertainty_score":0.6601634},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.011534552550661714,"score_gpt":0.22789823440937074,"score_spread":0.21636368185870902,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4304184215","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.84581256,0.037800003,0.019363496,0.007637682,0.009670277,0.0019300389,0.0008485882,0.00044630465,0.07649104],"genre_scores_gemma":[0.99395,0.0005224364,0.0035971503,0.00013637541,0.0013712196,0.0000372974,0.000005998455,0.000012203294,0.00036733926],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982159,0.0003037745,0.00030228947,0.00030851204,0.0005824706,0.00028701412],"domain_scores_gemma":[0.99821603,0.0011081559,0.00025453564,0.00029142777,0.000047654758,0.00008221196],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010188634,0.00013841968,0.00021195596,0.00025174412,0.0009975522,0.0001974685,0.001113163,0.00002322272,0.00013792625],"category_scores_gemma":[0.000049064256,0.00010847148,0.00012245815,0.0013281864,0.00012777677,0.000297633,0.0009048917,0.00020835223,0.000014230246],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000066704015,0.00009304495,0.0009408525,0.00002519262,0.00004019018,0.00002146073,0.00026917408,0.00003352197,0.00013984674,0.91279465,0.002220155,0.08335523],"study_design_scores_gemma":[0.0027136824,0.0014735475,0.056840617,0.000025214038,0.00014200974,0.0007107488,0.0010759456,0.014076758,0.0009857556,0.48128727,0.43939522,0.0012732451],"about_ca_topic_score_codex":0.00006286659,"about_ca_topic_score_gemma":0.00000810524,"teacher_disagreement_score":0.43717507,"about_ca_system_score_codex":0.000041050134,"about_ca_system_score_gemma":0.000074007105,"threshold_uncertainty_score":0.76724654},"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,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"York University; New York University Abu Dhabi","keywords":"Constructive; Mathematics; Unitary state; Unitary matrix; Matrix (chemical analysis); Algebra over a field; Applied mathematics; Combinatorics; Pure mathematics; Computer science","score_opus":0.009904842993394078,"score_gpt":0.24198341567023854,"score_spread":0.23207857267684445,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387110205","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24512063,0.0026322817,0.49091128,0.0095625855,0.022898385,0.0019190669,0.00024237903,0.007952224,0.21876119],"genre_scores_gemma":[0.9525737,0.000423151,0.007262409,0.00121388,0.015636126,0.00010891589,0.000046718455,0.00010186533,0.022633234],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983751,0.000069163514,0.00022757583,0.00044334613,0.00045840073,0.00042641567],"domain_scores_gemma":[0.9989048,0.00040307295,0.00011393314,0.0004209498,0.000034957407,0.00012225955],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00036659147,0.00018803285,0.00019373307,0.0003245844,0.00024068306,0.00031090458,0.0011444461,0.00007228472,0.00031642968],"category_scores_gemma":[0.00007941452,0.00016472647,0.00008995206,0.001683297,0.00003928351,0.0004138132,0.00024543225,0.00015258956,0.0049995473],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000035061257,0.00010092582,0.000022158394,0.000044653338,0.000026972437,0.00009304155,0.00051360746,0.0010301437,0.00018997092,0.68584627,0.22794452,0.08415267],"study_design_scores_gemma":[0.0017266723,0.0008493429,0.0012080631,0.00013846642,0.00005127552,0.000043049833,0.00029627027,0.04979269,0.0020438137,0.7393237,0.20269014,0.0018365212],"about_ca_topic_score_codex":0.000013446796,"about_ca_topic_score_gemma":0.000002491597,"teacher_disagreement_score":0.7074531,"about_ca_system_score_codex":0.000030371177,"about_ca_system_score_gemma":0.000034051456,"threshold_uncertainty_score":0.99577516},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University","funders":"Austrian Science Fund; U.S. Department of Defense","keywords":"Mathematics; Conjecture; Combinatorics","score_opus":0.013745096507448965,"score_gpt":0.23347397089837096,"score_spread":0.219728874390922,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388579442","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7275676,0.0008578883,0.026518654,0.0020361433,0.006169325,0.0004168265,0.000043506232,0.0019904186,0.23439965],"genre_scores_gemma":[0.9960413,0.00012023571,0.002124646,0.000053564905,0.0013437521,0.0000060719767,0.0000024615908,0.000008553881,0.0002994232],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991189,0.000047221693,0.00017197977,0.00021747818,0.00023248102,0.0002119445],"domain_scores_gemma":[0.99937654,0.0001268421,0.000079630365,0.00033211856,0.000036559493,0.000048321275],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030467604,0.00008766152,0.00013339505,0.00027866944,0.000092952985,0.000056192588,0.0007550438,0.0000400774,0.00010840351],"category_scores_gemma":[0.000023010274,0.00008208235,0.0001157456,0.0017272588,0.000047317193,0.00026068452,0.00021324944,0.00006835422,0.000242928],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012631302,0.00003495396,0.0011436174,0.00003437279,0.000018732233,0.00002087773,0.0009848259,0.000029259969,0.0004929837,0.91054106,0.015096312,0.071590394],"study_design_scores_gemma":[0.00092081225,0.00048627742,0.03596377,0.00008704461,0.00004004648,0.000018197581,0.0008918938,0.0019391959,0.0152542135,0.5255711,0.41796178,0.00086563005],"about_ca_topic_score_codex":0.0000116458905,"about_ca_topic_score_gemma":0.000009658944,"teacher_disagreement_score":0.40286547,"about_ca_system_score_codex":0.000006569002,"about_ca_system_score_gemma":0.00002678729,"threshold_uncertainty_score":0.3347221},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Physics; Mathematics; Crystallography; Chemistry","score_opus":0.006289512490943663,"score_gpt":0.23359241545729714,"score_spread":0.22730290296635347,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390668661","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.82993436,0.0030386755,0.12749715,0.0046169404,0.00079727144,0.00040457764,0.00020652401,0.00035237402,0.033152107],"genre_scores_gemma":[0.997056,0.000088769804,0.0020582292,0.00005803107,0.0004449776,0.000007176054,0.000009720526,0.0000059356544,0.0002711435],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.99937123,0.0000194316,0.00013610531,0.00023504603,0.00013213375,0.00010602959],"domain_scores_gemma":[0.99963266,0.000090868394,0.000037597954,0.0001658916,0.000033024597,0.000039979015],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00006569667,0.00007749424,0.00010451842,0.00011052895,0.000050115905,0.00015034125,0.00023115115,0.000031064414,0.00003096577],"category_scores_gemma":[0.000006142391,0.00006738434,0.00004189277,0.00038651796,0.000030120085,0.00024632155,0.00014492875,0.000058864924,0.000038983508],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012974953,0.000109269604,0.0014937167,0.00014947227,0.000092149894,0.00012237483,0.0042265314,0.0000049067185,0.019013986,0.6788472,0.0035191355,0.29240826],"study_design_scores_gemma":[0.0011762896,0.00074838626,0.69444233,0.0008379575,0.00024184614,0.00022832882,0.00055432395,0.039759606,0.13955238,0.039487857,0.08145768,0.0015130126],"about_ca_topic_score_codex":0.0001085238,"about_ca_topic_score_gemma":0.000026576514,"teacher_disagreement_score":0.69294864,"about_ca_system_score_codex":0.000013858115,"about_ca_system_score_gemma":0.000027839267,"threshold_uncertainty_score":0.27478534},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.02226218370481003,"score_gpt":0.3084088217681156,"score_spread":0.2861466380633056,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392134068","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36920553,0.018180616,0.018427517,0.012464817,0.07949996,0.0048241075,0.00014702181,0.0015614262,0.495689],"genre_scores_gemma":[0.94723946,0.00057289284,0.019240793,0.00009918093,0.014938238,0.0000911472,8.3847954e-7,0.0002061635,0.017611286],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99881107,0.00006224873,0.0003645469,0.00015238285,0.00039550208,0.00021424964],"domain_scores_gemma":[0.99741596,0.0018364196,0.0001436832,0.00051864336,0.000055112778,0.000030152964],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003265035,0.00013790847,0.00018902187,0.000049184877,0.00017354675,0.000117044874,0.0005927228,0.000059226062,0.0001064465],"category_scores_gemma":[0.00072536874,0.00006723562,0.00017293438,0.00054321403,0.00014229066,0.00010622909,0.00014351174,0.00018508629,0.00008084981],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007705137,0.000027511753,0.00003490883,0.00016309845,0.00003680232,0.0000026599596,0.00048782575,7.619331e-7,0.00034000448,0.97908986,0.013491685,0.0063171852],"study_design_scores_gemma":[0.000074522184,0.000022919918,0.000062285944,0.00009420615,0.00005108,0.0000045272145,0.00014980939,0.000039011993,0.0038203008,0.90320003,0.09239075,0.000090551715],"about_ca_topic_score_codex":0.000005646641,"about_ca_topic_score_gemma":0.000020232772,"teacher_disagreement_score":0.5780339,"about_ca_system_score_codex":0.000044469587,"about_ca_system_score_gemma":0.00005740229,"threshold_uncertainty_score":0.2741789},"labels":[],"label_agreement":null}]}