{"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.80837446,0.00097480154,0.1480319,0.0014080541,0.000102264916,0.00007014495,0.00048375857,0.0002407482,0.040313825],"genre_scores_gemma":[0.9894391,0.00017981864,0.0085601695,0.000084642976,0.000092009905,0.000023798675,0.00011928812,0.000015003139,0.0014862043],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99787307,0.00055307767,0.00014365533,0.0003452418,0.0007103595,0.00037447776],"domain_scores_gemma":[0.9898868,0.00504498,0.0016513444,0.00091370876,0.0013908672,0.0011121727],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021439225,0.0005124772,0.0005474581,0.0017051129,0.000922617,0.0030384173,0.00077353563,0.00058455265,0.00512024],"category_scores_gemma":[0.009901971,0.00044321743,0.00048520396,0.0009903564,0.0032901932,0.004648548,0.0016266739,0.0017152531,0.00045567632],"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.0001821655,0.000047314774,0.0011905801,0.000090427864,0.000021636475,0.00020284622,0.00032628953,0.005307812,0.006987048,0.974743,0.0013152643,0.009585717],"study_design_scores_gemma":[0.00003472385,0.00011215999,0.0009533322,0.000022843298,0.000013548915,0.00036951905,0.00016552082,0.0329796,0.0061687003,0.9565517,0.0025810983,0.00004716344],"about_ca_topic_score_codex":0.00080721936,"about_ca_topic_score_gemma":0.0006576731,"teacher_disagreement_score":0.00512024,"about_ca_system_score_codex":0.0009840496,"about_ca_system_score_gemma":0.0007835519,"threshold_uncertainty_score":0.017128944},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43349782,0.00073965517,0.47311467,0.0006251512,0.00086812733,0.00017459507,0.00026672543,0.00054190756,0.09017134],"genre_scores_gemma":[0.85222507,0.00026809864,0.1310331,0.00026575083,0.00014863675,0.00009082578,0.0002704901,0.00008502878,0.015613034],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995485,0.00008099585,0.000025226835,0.00007864744,0.00018866271,0.00007794177],"domain_scores_gemma":[0.99934477,0.00015055743,0.00012108699,0.00012285235,0.00015273641,0.00010804677],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035342126,0.00056801905,0.0003819202,0.0009638154,0.0005991651,0.0010285528,0.00046259278,0.0005912971,0.005559307],"category_scores_gemma":[0.0013535513,0.00032377648,0.000529258,0.0006221828,0.0009376116,0.0011869051,0.00063980033,0.0011056715,0.0010776771],"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.0001105303,0.00006971325,0.00070454035,0.00007289517,0.000012439606,0.00026229635,0.00018022157,0.006705821,0.023742255,0.9318458,0.002195477,0.03409803],"study_design_scores_gemma":[0.00012839165,0.0004831103,0.0012268504,0.000059035017,0.000026680393,0.0011786225,0.00021697616,0.09423678,0.06452701,0.7884707,0.049317252,0.0001286542],"about_ca_topic_score_codex":0.00027332947,"about_ca_topic_score_gemma":0.00034276908,"teacher_disagreement_score":0.005559307,"about_ca_system_score_codex":0.00047701533,"about_ca_system_score_gemma":0.00047948005,"threshold_uncertainty_score":0.018597722},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26688582,0.0047456976,0.52771133,0.0050496426,0.0016881188,0.00012599539,0.00025516635,0.00047037218,0.19306783],"genre_scores_gemma":[0.9564714,0.0013562142,0.032153014,0.00047420542,0.0010334076,0.000100482146,0.0000701243,0.00006638703,0.008274834],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991704,0.00027139447,0.00004533774,0.00015813309,0.00025397306,0.00010074333],"domain_scores_gemma":[0.9969014,0.0014117777,0.00039873956,0.00055846927,0.00047436828,0.00025532013],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012463975,0.00047753693,0.00048329044,0.0018877642,0.001170617,0.0016567695,0.00061043346,0.0008940541,0.0062505966],"category_scores_gemma":[0.006407569,0.00029715363,0.00047453394,0.001095621,0.00460803,0.003302934,0.0014394494,0.0014041989,0.000556447],"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.0000072422627,0.000008004164,0.00011231771,0.0000169295,0.0000024047115,0.000050334835,0.000057970243,0.0023032047,0.00060567434,0.99216616,0.00072698254,0.003942725],"study_design_scores_gemma":[0.0000045924016,0.000016293656,0.00014442299,0.000014043289,0.0000016686388,0.00009763112,0.000042023752,0.020355571,0.00042620202,0.97426796,0.004620876,0.000008680399],"about_ca_topic_score_codex":0.00045777936,"about_ca_topic_score_gemma":0.00022258225,"teacher_disagreement_score":0.0062505966,"about_ca_system_score_codex":0.0009084992,"about_ca_system_score_gemma":0.0003989371,"threshold_uncertainty_score":0.020910323},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.83346784,0.00027996444,0.13560033,0.0005131636,0.00006037525,0.000042988468,0.00019742266,0.00020871944,0.02962917],"genre_scores_gemma":[0.985036,0.00014016268,0.012793274,0.00007620562,0.00005758071,0.000033644876,0.00011460392,0.000047114387,0.0017015212],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992161,0.0001819068,0.00004784105,0.00017365698,0.00021831042,0.00016206782],"domain_scores_gemma":[0.9885435,0.008333103,0.0012106913,0.00065659545,0.0005310577,0.0007251202],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011133399,0.00042349176,0.00046420973,0.0020440044,0.0011120712,0.0017995199,0.0006901224,0.0007460635,0.004692959],"category_scores_gemma":[0.0084366705,0.00035948842,0.00039051933,0.0010474385,0.0035502817,0.0029650792,0.0013546196,0.0010962423,0.0003753461],"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.00011244816,0.000031037613,0.0019944957,0.00005927857,0.0000092593045,0.00016674992,0.00030943612,0.011130421,0.006858617,0.96975595,0.00079793745,0.00877456],"study_design_scores_gemma":[0.000018149487,0.00006388278,0.001300628,0.00002802407,0.000010147207,0.0003239922,0.00014560932,0.03938442,0.004045307,0.9527772,0.0018724792,0.000030071978],"about_ca_topic_score_codex":0.0006982264,"about_ca_topic_score_gemma":0.0009002519,"teacher_disagreement_score":0.004692959,"about_ca_system_score_codex":0.001203306,"about_ca_system_score_gemma":0.00040792546,"threshold_uncertainty_score":0.015699565},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.57710236,0.00021096953,0.39283103,0.00024507203,0.00013808665,0.000050948718,0.00016660971,0.00031340143,0.028941507],"genre_scores_gemma":[0.9465374,0.00010168914,0.047102638,0.00004370956,0.000034792145,0.000030315066,0.000091696216,0.00004617332,0.00601167],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99954826,0.000105458996,0.000017925351,0.0000603208,0.0002079904,0.000060004895],"domain_scores_gemma":[0.9989004,0.00037950312,0.0001762724,0.00011800806,0.00029896884,0.00012676607],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041568137,0.00035515716,0.00019980893,0.00076267245,0.0003021657,0.00070873596,0.00031813025,0.00036235285,0.0061910474],"category_scores_gemma":[0.0031123548,0.00016603056,0.00016787685,0.00030917113,0.0010254297,0.00071117847,0.0005850306,0.0005084271,0.0006166436],"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.00022972414,0.00010407949,0.0019421674,0.00011711104,0.000015589405,0.000717258,0.00048264815,0.021276567,0.049935177,0.86092937,0.0036383476,0.060612004],"study_design_scores_gemma":[0.00004490341,0.00012508799,0.0021305606,0.000046850142,0.0000076142346,0.0010985725,0.00028171396,0.249826,0.02078082,0.71731234,0.008279465,0.00006598724],"about_ca_topic_score_codex":0.00037038623,"about_ca_topic_score_gemma":0.00052203995,"teacher_disagreement_score":0.0061910474,"about_ca_system_score_codex":0.00027069612,"about_ca_system_score_gemma":0.00023841823,"threshold_uncertainty_score":0.020711124},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20867237,0.00034447206,0.7479189,0.00040990952,0.00024768978,0.00017103384,0.0005970166,0.0008858421,0.040752817],"genre_scores_gemma":[0.8778623,0.00022240126,0.10108832,0.00029403705,0.0002095522,0.00010264314,0.00083528267,0.00014998046,0.019235505],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99939704,0.00011456907,0.000027463475,0.00016735742,0.00020589848,0.00008767835],"domain_scores_gemma":[0.99859315,0.00032566773,0.00025661022,0.00028950188,0.0003941497,0.0001409072],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037567937,0.00055890065,0.00049041567,0.0009793969,0.0005420695,0.001141234,0.00048259643,0.0005321606,0.011855696],"category_scores_gemma":[0.0037152676,0.00020526197,0.00031080807,0.0006900589,0.00096357346,0.001242421,0.0008752475,0.0008901835,0.0018162116],"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.0004150556,0.00013766397,0.0022457237,0.00022276831,0.00006574258,0.0007742244,0.00046684782,0.06516811,0.032263976,0.73191494,0.015810419,0.15051445],"study_design_scores_gemma":[0.000044660217,0.00021920021,0.0017364747,0.000028973789,0.000015343097,0.0008463338,0.00019170268,0.34306437,0.013382698,0.61990637,0.020506337,0.00005755585],"about_ca_topic_score_codex":0.000729835,"about_ca_topic_score_gemma":0.0006206086,"teacher_disagreement_score":0.011855696,"about_ca_system_score_codex":0.00032377648,"about_ca_system_score_gemma":0.0003693452,"threshold_uncertainty_score":0.03966123},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8544962,0.0011957256,0.10524716,0.0045926613,0.00035032764,0.000075880365,0.0014739656,0.00039261408,0.03217544],"genre_scores_gemma":[0.98901397,0.00036564088,0.008194721,0.00022884452,0.00040397636,0.00009348144,0.00036895645,0.000064943735,0.0012654788],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99456245,0.0019376469,0.00034626975,0.0010318757,0.0014303699,0.00069135195],"domain_scores_gemma":[0.93046725,0.049682353,0.004892187,0.007876719,0.0032811624,0.003800428],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0054556383,0.0006192927,0.0019179874,0.0027748991,0.0027846883,0.0040443474,0.0017617432,0.0015749076,0.0054462724],"category_scores_gemma":[0.042962275,0.00084924034,0.001005789,0.0013106732,0.00630176,0.006118421,0.0037721258,0.003094291,0.0005132403],"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.0003149461,0.00006778056,0.0048451303,0.00015702112,0.00005028192,0.00026827678,0.00039465586,0.013414915,0.0049328366,0.9647978,0.004460409,0.0062959376],"study_design_scores_gemma":[0.00006416046,0.00009464349,0.0026903593,0.00008013322,0.00002256279,0.00056615326,0.00019342528,0.14929512,0.0030351973,0.8403114,0.0035794345,0.00006735729],"about_ca_topic_score_codex":0.00054774206,"about_ca_topic_score_gemma":0.00030787045,"teacher_disagreement_score":0.0054556383,"about_ca_system_score_codex":0.0011316723,"about_ca_system_score_gemma":0.000725278,"threshold_uncertainty_score":0.028852522},"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":"commentary","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"commentary","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013134517,0.33793092,0.35869458,0.20083003,0.024200257,0.00008618826,0.00057660404,0.0006198826,0.063927054],"genre_scores_gemma":[0.4039149,0.18896167,0.19600499,0.032817442,0.060371745,0.00043390327,0.0006769986,0.00057281216,0.1162456],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9970682,0.0012870764,0.0001773311,0.0007620238,0.0005989864,0.000106420324],"domain_scores_gemma":[0.99389863,0.0036492557,0.00026083924,0.00041693318,0.0014275367,0.00034665328],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0054111304,0.00067598297,0.0009252434,0.0016227955,0.0011877624,0.0025411572,0.00046190407,0.0013647733,0.0040154466],"category_scores_gemma":[0.0113705555,0.00036542641,0.0005502255,0.002271671,0.0039263223,0.0027545004,0.002269694,0.005414937,0.0018001932],"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.000100548314,0.000031020885,0.0026250782,0.0004935142,0.00012057355,0.0002879781,0.001020083,0.0025477025,0.0008675006,0.71121657,0.11830818,0.16238123],"study_design_scores_gemma":[0.000022000435,0.00005796121,0.0027585663,0.00038693077,0.00004297915,0.00041472598,0.00032645464,0.009802157,0.0009351005,0.5064588,0.47871897,0.0000753899],"about_ca_topic_score_codex":0.0025347543,"about_ca_topic_score_gemma":0.0014547436,"teacher_disagreement_score":0.0054111304,"about_ca_system_score_codex":0.0022469522,"about_ca_system_score_gemma":0.0018435303,"threshold_uncertainty_score":0.028617144},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9609241,0.0001613197,0.025946,0.0001335413,0.000024129384,0.00002192618,0.000107733584,0.00009522791,0.012585998],"genre_scores_gemma":[0.98617655,0.00007210274,0.010823032,0.0000433281,0.000015081577,0.000023762497,0.00014576798,0.000013393789,0.00268693],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997706,0.00004329879,0.00001151087,0.00005358581,0.00006677402,0.00005418464],"domain_scores_gemma":[0.99945575,0.00021219459,0.00008724759,0.00010995133,0.00006683618,0.000068105284],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021895864,0.00016355295,0.00021335107,0.0005589752,0.0010596077,0.00047237417,0.00037547402,0.00034348117,0.0025421195],"category_scores_gemma":[0.0007571952,0.00019108664,0.00021179204,0.00036061739,0.0007446429,0.000589753,0.00055224757,0.00039488776,0.00019687448],"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.00031099253,0.000098205135,0.0071013123,0.00013106593,0.00003092789,0.001078789,0.0013196905,0.009094639,0.062543504,0.8552277,0.0022157289,0.060847506],"study_design_scores_gemma":[0.00015949797,0.00061329454,0.011215526,0.00010743005,0.000045579378,0.0053764004,0.0010222341,0.10340411,0.06774148,0.7621,0.04808597,0.00012849309],"about_ca_topic_score_codex":0.00043771186,"about_ca_topic_score_gemma":0.00046495683,"teacher_disagreement_score":0.0025421195,"about_ca_system_score_codex":0.00053043896,"about_ca_system_score_gemma":0.0002933161,"threshold_uncertainty_score":0.008504212},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.75198174,0.0005384818,0.187416,0.0004928858,0.00029698905,0.00010923782,0.00021046225,0.00040414126,0.058550082],"genre_scores_gemma":[0.9480606,0.00017417438,0.046442088,0.00007746704,0.000031757074,0.00003929494,0.00011570394,0.00005077225,0.0050082034],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996679,0.00009768541,0.000016621974,0.000036969333,0.000108691245,0.00007226339],"domain_scores_gemma":[0.99946743,0.00019787622,0.00008675534,0.00011408299,0.00007363104,0.00006020478],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035714576,0.00033840406,0.00038434155,0.0011904219,0.00076855836,0.00093239034,0.00043129854,0.00047200447,0.003691283],"category_scores_gemma":[0.0012149891,0.0002996869,0.00046529248,0.0005413701,0.00096719,0.0006622485,0.0006127832,0.000913811,0.00052820495],"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.0001539988,0.00006322365,0.0011901332,0.00014967084,0.000024581086,0.00090932683,0.0005752987,0.0087974,0.054357193,0.89861,0.002261751,0.03290737],"study_design_scores_gemma":[0.000098719276,0.00047229958,0.002081523,0.00011548983,0.000041664374,0.0019695382,0.0007796795,0.10628185,0.19002071,0.6616143,0.036358412,0.00016585033],"about_ca_topic_score_codex":0.00032195242,"about_ca_topic_score_gemma":0.0004150775,"teacher_disagreement_score":0.003691283,"about_ca_system_score_codex":0.000445793,"about_ca_system_score_gemma":0.0005347976,"threshold_uncertainty_score":0.012348592},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.78522015,0.00083554717,0.090955414,0.024781778,0.0012668343,0.000054289492,0.00075352687,0.0010870488,0.09504551],"genre_scores_gemma":[0.99096346,0.0001369739,0.004434407,0.00074863713,0.00032485742,0.000032669024,0.0002021085,0.00005122384,0.003105559],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997764,0.0005990164,0.000094158146,0.0005196687,0.0006004726,0.00042269196],"domain_scores_gemma":[0.98871595,0.0075691557,0.0009845437,0.001381717,0.00065863424,0.0006900252],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002047021,0.00044429905,0.0010109787,0.0013983054,0.0021230683,0.003059602,0.0013728733,0.002658861,0.010778643],"category_scores_gemma":[0.012289593,0.00042139008,0.0005616658,0.0012334138,0.0051318225,0.0038622553,0.0034139275,0.0030164274,0.0008708328],"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.00032631448,0.00006743436,0.0012432452,0.00007724114,0.00001982525,0.0006374196,0.00035413672,0.0044965157,0.0015677682,0.973696,0.011555252,0.0059587224],"study_design_scores_gemma":[0.00013230139,0.000080020014,0.0006905252,0.00003806339,0.000016605067,0.0007403437,0.00030905163,0.032570407,0.002458616,0.9532831,0.009639976,0.000041053358],"about_ca_topic_score_codex":0.00041092903,"about_ca_topic_score_gemma":0.00037759996,"teacher_disagreement_score":0.010778643,"about_ca_system_score_codex":0.00087083736,"about_ca_system_score_gemma":0.00049612555,"threshold_uncertainty_score":0.036058128},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4343992,0.00011678208,0.55254835,0.0009226781,0.000053234115,0.00008320647,0.00012797119,0.00030260405,0.011445971],"genre_scores_gemma":[0.9684045,0.000034799104,0.029954797,0.00008893894,0.000019892046,0.00004221971,0.00005361027,0.000026382402,0.0013749094],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99878496,0.0005315001,0.000028694529,0.00022233222,0.0002790461,0.0001534143],"domain_scores_gemma":[0.99680376,0.0016962216,0.00027076708,0.00077082677,0.0002438379,0.00021451659],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014542214,0.00018079816,0.00045664574,0.0007300802,0.0006892531,0.00091308466,0.0010474061,0.000837076,0.002863995],"category_scores_gemma":[0.0064478368,0.0002276351,0.00039157583,0.00052078377,0.0030400353,0.002306264,0.0015194417,0.0009650711,0.00016845908],"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.000066402485,0.000041400494,0.0005992963,0.000017748605,0.00000775968,0.000043497625,0.000058770685,0.030424152,0.0020669347,0.9614629,0.0003565865,0.0048545524],"study_design_scores_gemma":[0.000018454648,0.000033773835,0.00035885005,0.0000054343723,0.000004052116,0.000049194707,0.00003872008,0.33688354,0.0022198833,0.65972656,0.00064979104,0.000011783297],"about_ca_topic_score_codex":0.0008994168,"about_ca_topic_score_gemma":0.0008320022,"teacher_disagreement_score":0.002863995,"about_ca_system_score_codex":0.0011559064,"about_ca_system_score_gemma":0.0007815198,"threshold_uncertainty_score":0.009581029},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8061809,0.00019762953,0.17835549,0.0003172121,0.00006229385,0.000026774473,0.00020996924,0.00016554317,0.014484217],"genre_scores_gemma":[0.98551834,0.00009068599,0.012711551,0.00003575688,0.00004346011,0.000025783862,0.00009605262,0.000036405552,0.0014418458],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992224,0.0002075632,0.00003544184,0.0001412381,0.00023032125,0.00016296453],"domain_scores_gemma":[0.99194443,0.0043825377,0.0011801968,0.00075171125,0.00082381343,0.00091722386],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00092116155,0.00040529916,0.00047708946,0.0018078983,0.0010178544,0.0012308242,0.00067752536,0.0005388527,0.003105605],"category_scores_gemma":[0.006574475,0.00023066963,0.0003454361,0.00058794324,0.002583036,0.0015293465,0.0009897923,0.0007326336,0.00029589955],"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.00020110876,0.00006204609,0.0036519575,0.00009833484,0.000019378278,0.00021570799,0.00031846468,0.025187185,0.032967504,0.92496943,0.0013491042,0.010959756],"study_design_scores_gemma":[0.000027298285,0.00015229899,0.002891449,0.00005375528,0.000014144373,0.00037235246,0.00025293598,0.13412353,0.019302798,0.8401876,0.0025703497,0.000051385152],"about_ca_topic_score_codex":0.00046764355,"about_ca_topic_score_gemma":0.00072264456,"teacher_disagreement_score":0.003105605,"about_ca_system_score_codex":0.00062382274,"about_ca_system_score_gemma":0.00050243683,"threshold_uncertainty_score":0.010389328},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3016396,0.0005917957,0.6371285,0.0005272289,0.00028871692,0.000084147956,0.00036204117,0.0004537708,0.058924265],"genre_scores_gemma":[0.9747011,0.00022922704,0.015857756,0.00014731375,0.00025594424,0.000041748728,0.00018613646,0.00008085657,0.008499937],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990283,0.00022365316,0.000047178193,0.0001781463,0.00034610956,0.00017669624],"domain_scores_gemma":[0.996786,0.000832559,0.0005587589,0.00050901953,0.00081551704,0.00049817265],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007682684,0.0006030575,0.00045298875,0.001928396,0.0006728576,0.0019461763,0.0004397851,0.00055303157,0.008820564],"category_scores_gemma":[0.0046363105,0.00022517468,0.0004370046,0.0010132949,0.0015169767,0.0028368428,0.0018116098,0.0013348083,0.0010777459],"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.000086076136,0.000049175604,0.00086522993,0.00005928678,0.000013095829,0.0002747869,0.0004712579,0.0048810258,0.006675005,0.97011524,0.0020487998,0.014461],"study_design_scores_gemma":[0.000011549155,0.00010159472,0.0005349927,0.000020410807,0.000006268719,0.00053192145,0.00024870198,0.048416402,0.0049629947,0.9384282,0.0067102,0.000026826428],"about_ca_topic_score_codex":0.0002497711,"about_ca_topic_score_gemma":0.00018186372,"teacher_disagreement_score":0.008820564,"about_ca_system_score_codex":0.00043431658,"about_ca_system_score_gemma":0.00031044648,"threshold_uncertainty_score":0.029507697},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.042458363,0.00020527458,0.949178,0.0005531681,0.000045831963,0.000087764165,0.00010875654,0.00013021816,0.0072327773],"genre_scores_gemma":[0.5082088,0.000271052,0.48515943,0.0001840402,0.00015325776,0.00037500146,0.00029042774,0.00010112162,0.005256801],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985875,0.0007523043,0.00005491065,0.00012283314,0.00037553563,0.000106968815],"domain_scores_gemma":[0.9853322,0.012986676,0.000320212,0.00057019433,0.00061964296,0.00017108343],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002976729,0.0004277994,0.00079356425,0.0017439887,0.0006877705,0.0012203424,0.0014235827,0.0007944926,0.0061151106],"category_scores_gemma":[0.014004246,0.00028470572,0.0007253292,0.00091359724,0.0024007484,0.002529637,0.0019771312,0.0013249833,0.00047338547],"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.00008432266,0.00006745046,0.0009144906,0.00012794895,0.000025403486,0.00007724249,0.00013917034,0.14712618,0.0006017078,0.81730366,0.0010828627,0.03244956],"study_design_scores_gemma":[0.000016975297,0.000017485843,0.00007129894,0.00001417606,0.0000029002863,0.000020915046,0.00003731633,0.640078,0.0003147623,0.35854787,0.0008724174,0.000005904988],"about_ca_topic_score_codex":0.0009779363,"about_ca_topic_score_gemma":0.0012022698,"teacher_disagreement_score":0.0061151106,"about_ca_system_score_codex":0.0011129461,"about_ca_system_score_gemma":0.0010069894,"threshold_uncertainty_score":0.020457089},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8461805,0.0002452252,0.13936383,0.00021540321,0.00007387812,0.00003767665,0.00012662685,0.00023219273,0.013524695],"genre_scores_gemma":[0.99141496,0.00010882259,0.006698298,0.000038411294,0.000068097295,0.00003860947,0.000093109935,0.000043574284,0.0014961261],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99902916,0.00018495068,0.000060270046,0.00017579396,0.00034223156,0.0002075769],"domain_scores_gemma":[0.995261,0.0018520271,0.0011096633,0.0005199895,0.00033557968,0.0009217487],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008578271,0.00085277105,0.00080265244,0.002857474,0.000894,0.0017588607,0.0009482747,0.0009254735,0.0046360753],"category_scores_gemma":[0.0053039524,0.0004961629,0.0007921095,0.00080169854,0.0025150916,0.0022580535,0.0016071291,0.00090888195,0.00042117282],"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.00041961094,0.00013210381,0.0026825548,0.00021088922,0.0000827194,0.00073109736,0.0006100781,0.039630223,0.05740034,0.87801296,0.0016002525,0.018487155],"study_design_scores_gemma":[0.00006127851,0.00021092601,0.0032047834,0.000048182614,0.000034046407,0.0005066781,0.00028418392,0.16518794,0.011177854,0.81731147,0.001885985,0.00008666678],"about_ca_topic_score_codex":0.00025421142,"about_ca_topic_score_gemma":0.00026051037,"teacher_disagreement_score":0.0046360753,"about_ca_system_score_codex":0.0005637105,"about_ca_system_score_gemma":0.00024336229,"threshold_uncertainty_score":0.015509248},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.76725876,0.00022045971,0.20669004,0.0010815861,0.000061950006,0.00008620476,0.00029762092,0.0003242279,0.023979172],"genre_scores_gemma":[0.97075427,0.000084806445,0.025589464,0.00009836715,0.00003900469,0.000075236014,0.00018100961,0.00009318234,0.0030846957],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99853766,0.0005187436,0.000057111476,0.00032471248,0.00025282506,0.00030893346],"domain_scores_gemma":[0.99427754,0.003411184,0.00066128344,0.00068392925,0.00032248214,0.00064358214],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015400288,0.00093163113,0.001130906,0.001113531,0.0018544799,0.0022744592,0.0013683192,0.0018717411,0.0045121075],"category_scores_gemma":[0.008709992,0.0009710052,0.00071415014,0.00076000975,0.0026361747,0.0033262703,0.00217059,0.0017552193,0.0005256748],"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.0008348976,0.00020887317,0.0018399436,0.00020394938,0.00009212949,0.0008910412,0.00092700735,0.14424445,0.01848492,0.8130595,0.005246608,0.013966758],"study_design_scores_gemma":[0.000068164816,0.00011296548,0.0005581873,0.000032323875,0.000023248913,0.00041463636,0.00036242115,0.22056982,0.0069724596,0.76871973,0.002128034,0.000037905873],"about_ca_topic_score_codex":0.00053659006,"about_ca_topic_score_gemma":0.000622261,"teacher_disagreement_score":0.0045121075,"about_ca_system_score_codex":0.0013316293,"about_ca_system_score_gemma":0.000579644,"threshold_uncertainty_score":0.015094459},"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":"editorial","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007796327,0.0064958297,0.015102534,0.10055922,0.81836724,0.000090540154,0.0013664436,0.001088703,0.05614986],"genre_scores_gemma":[0.05196972,0.01539628,0.019429902,0.08201441,0.2513894,0.00046080374,0.00357383,0.0030705533,0.5726951],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99606186,0.0010486544,0.00029262927,0.0006786182,0.0015998004,0.00031854218],"domain_scores_gemma":[0.9924136,0.0025924945,0.00028086634,0.0007132781,0.0036141109,0.00038565477],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027891276,0.0020765155,0.002415588,0.0032598686,0.0025841985,0.0025368398,0.0033188583,0.0040938123,0.09387609],"category_scores_gemma":[0.020997176,0.0009030531,0.0017876449,0.0022592484,0.0029773533,0.0033376398,0.0020420942,0.0063853674,0.03221577],"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.000038846825,0.000013339711,0.000037787,0.000116114636,0.0000121705025,0.000110139554,0.000030216135,0.00024019943,0.00012133632,0.009080498,0.98498917,0.005210226],"study_design_scores_gemma":[0.000044603144,0.000060671726,0.0008847786,0.00025747484,0.000056261622,0.0004520561,0.00007761898,0.004669471,0.001572645,0.053903356,0.9379081,0.00011297749],"about_ca_topic_score_codex":0.012064607,"about_ca_topic_score_gemma":0.014698862,"teacher_disagreement_score":0.09387609,"about_ca_system_score_codex":0.006197305,"about_ca_system_score_gemma":0.0017530691,"threshold_uncertainty_score":0.3140468},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22678395,0.0010927349,0.5790387,0.0059342114,0.0018368408,0.00015727956,0.0012857778,0.0013898318,0.18248075],"genre_scores_gemma":[0.89392966,0.0005455083,0.0762612,0.0014324836,0.0008512987,0.00014270423,0.000501051,0.00032341495,0.026012681],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99919015,0.00013123873,0.000035463483,0.00016572232,0.00031587828,0.00016150955],"domain_scores_gemma":[0.9965305,0.001995376,0.0002482251,0.0004978652,0.00044921873,0.0002789111],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015663272,0.0008757568,0.0008207643,0.0010880755,0.0007164658,0.0015719966,0.0010682101,0.00079988805,0.024754073],"category_scores_gemma":[0.0053269095,0.0004346734,0.00085554726,0.0007555611,0.002812229,0.0030148134,0.0028107585,0.0032543577,0.0029550777],"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.0001655797,0.000081762635,0.0004289708,0.00021347913,0.000027520213,0.0003871799,0.00021344025,0.0065605845,0.006236443,0.9515093,0.014438159,0.019737598],"study_design_scores_gemma":[0.000056272744,0.000097002376,0.00056654064,0.00003060926,0.000011042761,0.00015280406,0.00006406197,0.020483932,0.004405372,0.96251553,0.011584967,0.000031919273],"about_ca_topic_score_codex":0.00056175067,"about_ca_topic_score_gemma":0.0007053528,"teacher_disagreement_score":0.024754073,"about_ca_system_score_codex":0.0008674452,"about_ca_system_score_gemma":0.00072567695,"threshold_uncertainty_score":0.08281064},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9418,0.00023071532,0.04313032,0.00039636396,0.000039103117,0.000041012554,0.0002817694,0.00009073947,0.013990018],"genre_scores_gemma":[0.9921185,0.00008792548,0.0055456553,0.000044297973,0.000088409375,0.00002971638,0.000169528,0.00001416791,0.0019017486],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99935085,0.0001711987,0.000043408465,0.000118105876,0.0002039525,0.00011255349],"domain_scores_gemma":[0.99342304,0.0028117027,0.0016458136,0.0003974186,0.00081147527,0.00091067376],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00085062365,0.00025053933,0.0004150223,0.0020928404,0.00057468866,0.0015691394,0.0005322983,0.00048427153,0.003439756],"category_scores_gemma":[0.0045490493,0.0002257439,0.00022779404,0.0012813946,0.0017934846,0.0025448992,0.00064049335,0.0008757176,0.00031280663],"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.0002608816,0.000068609465,0.0025786809,0.00006312842,0.00001264752,0.00046979607,0.00030531696,0.007523762,0.007911774,0.96997863,0.0009398028,0.009886928],"study_design_scores_gemma":[0.00007615197,0.00021913821,0.0032073536,0.00003800349,0.000017190916,0.0013114368,0.00018960654,0.045382652,0.00506291,0.940522,0.003918348,0.000055082695],"about_ca_topic_score_codex":0.00030732146,"about_ca_topic_score_gemma":0.0002430321,"teacher_disagreement_score":0.003439756,"about_ca_system_score_codex":0.0008514496,"about_ca_system_score_gemma":0.00043624354,"threshold_uncertainty_score":0.0115071535},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97189707,0.00010839749,0.016524974,0.00047883854,0.00004109552,0.000012037758,0.00007204466,0.00006624955,0.010799225],"genre_scores_gemma":[0.9951265,0.000051175983,0.0025903087,0.0000771545,0.000042856456,0.000010567107,0.00007041249,0.000014570889,0.0020164843],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99977833,0.000051131603,0.000008001997,0.000052716066,0.00005595516,0.000053894084],"domain_scores_gemma":[0.9988986,0.00043333598,0.00026178415,0.00009245033,0.00011735636,0.00019642999],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022954587,0.00036577738,0.0003471364,0.0013026256,0.00067329674,0.0012147201,0.0005134573,0.000927784,0.0040157153],"category_scores_gemma":[0.0015130622,0.00019863671,0.00030180032,0.00053944724,0.0019335559,0.0012277149,0.00072949985,0.0006054132,0.00027948577],"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.00025881975,0.00008201296,0.0038438716,0.00015946016,0.0000412168,0.00075203925,0.0006122126,0.013027581,0.033684224,0.9330496,0.0031247388,0.011364251],"study_design_scores_gemma":[0.000028781615,0.000053969237,0.0021999227,0.000021708976,0.000010748783,0.00035352889,0.00032699367,0.027181325,0.0039904844,0.9637975,0.002015077,0.0000199273],"about_ca_topic_score_codex":0.0003984576,"about_ca_topic_score_gemma":0.00050891197,"teacher_disagreement_score":0.0040157153,"about_ca_system_score_codex":0.00031300887,"about_ca_system_score_gemma":0.00017283899,"threshold_uncertainty_score":0.013433874},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5574601,0.000592945,0.37588146,0.00046198978,0.00006861009,0.00008724662,0.00025932508,0.0004640324,0.064724326],"genre_scores_gemma":[0.95181626,0.00030969962,0.039182853,0.000091162576,0.00008508249,0.00006653003,0.0001848453,0.00010327709,0.008160347],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99924517,0.00022972938,0.00003860045,0.000104118895,0.00027094534,0.00011147426],"domain_scores_gemma":[0.9969796,0.0015303238,0.00046409568,0.00029506552,0.00047703367,0.00025385033],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00091684604,0.0005171135,0.00030920323,0.0019346497,0.00061339996,0.0014109449,0.0004770624,0.0005703861,0.0075201914],"category_scores_gemma":[0.008477989,0.00023076555,0.00034539527,0.00091357506,0.0017601354,0.0018477576,0.00089802576,0.00076007243,0.0014092133],"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.00008016559,0.000025457324,0.00073096756,0.000046871304,0.000006236783,0.00020912653,0.0003431085,0.010416461,0.0044460054,0.9612518,0.0013397634,0.021104028],"study_design_scores_gemma":[0.000031560616,0.00009925995,0.0009829876,0.00005397267,0.000007671902,0.0010068567,0.0003163143,0.12518415,0.008360157,0.85457516,0.009324184,0.0000578091],"about_ca_topic_score_codex":0.00045963377,"about_ca_topic_score_gemma":0.0002792873,"teacher_disagreement_score":0.0075201914,"about_ca_system_score_codex":0.00053072727,"about_ca_system_score_gemma":0.0002040988,"threshold_uncertainty_score":0.02515757},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1431247,0.00023017911,0.81541145,0.00060832314,0.00020465115,0.00009758041,0.00030299427,0.00026859643,0.03975158],"genre_scores_gemma":[0.890845,0.00026764025,0.09922609,0.0003528023,0.00016661196,0.00016408725,0.0002928856,0.00011572714,0.008569124],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99861443,0.00040929904,0.00008470927,0.00019078773,0.00043705368,0.00026364333],"domain_scores_gemma":[0.9964619,0.0009455,0.00045847512,0.00060937385,0.0010088305,0.0005158802],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017042082,0.00068156753,0.00047182856,0.0010387136,0.0007574167,0.0018277715,0.00045171392,0.0005456715,0.0062213982],"category_scores_gemma":[0.0054866956,0.00035575338,0.000540277,0.0006492946,0.0026651323,0.0018842653,0.0018324543,0.0016229593,0.0012374057],"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.000059378428,0.000022810742,0.00048273723,0.000048350896,0.000009797091,0.00025410278,0.00030427263,0.0053288066,0.0066407654,0.97437626,0.0025561482,0.009916632],"study_design_scores_gemma":[0.000017916052,0.000058716643,0.00055456563,0.000034768127,0.0000099968665,0.00057900423,0.0002521635,0.06043815,0.007234921,0.92379284,0.0069919885,0.000035003275],"about_ca_topic_score_codex":0.00041397856,"about_ca_topic_score_gemma":0.00041052772,"teacher_disagreement_score":0.0062213982,"about_ca_system_score_codex":0.00036660474,"about_ca_system_score_gemma":0.00061344117,"threshold_uncertainty_score":0.02081263},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2280988,0.00023173721,0.7453833,0.00043768302,0.000111187146,0.00006862582,0.00020901777,0.0005686636,0.024890965],"genre_scores_gemma":[0.8859376,0.00018994989,0.10908218,0.00020809774,0.00013356617,0.00006696309,0.00027693374,0.00015018652,0.0039545433],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972133,0.0013039793,0.00014595603,0.0003083637,0.000761873,0.0002664703],"domain_scores_gemma":[0.98281395,0.012100067,0.0013133948,0.0016263883,0.0015682682,0.0005779271],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027504417,0.0005575869,0.00074207707,0.0011621818,0.0006909503,0.0019514691,0.0007213245,0.00067777693,0.0073282225],"category_scores_gemma":[0.016848428,0.0003256413,0.0007104761,0.00082675065,0.00369209,0.0022473221,0.001492359,0.0016275351,0.0012481563],"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.0001284351,0.000025028168,0.00055154576,0.000055262484,0.0000119448105,0.00021050673,0.00016363041,0.02872536,0.0031601693,0.95145977,0.00088188815,0.014626458],"study_design_scores_gemma":[0.000014471784,0.000046628964,0.00019282193,0.000028590504,0.000004376375,0.0001557535,0.00006146436,0.11892835,0.0045770756,0.87445503,0.001513727,0.000021696933],"about_ca_topic_score_codex":0.00050956383,"about_ca_topic_score_gemma":0.0004612931,"teacher_disagreement_score":0.0073282225,"about_ca_system_score_codex":0.00043991508,"about_ca_system_score_gemma":0.00054229714,"threshold_uncertainty_score":0.02451533},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9201103,0.0002180229,0.037349053,0.0005724752,0.00022405133,0.000064005704,0.00021461943,0.0004053561,0.0408421],"genre_scores_gemma":[0.9770199,0.00010159349,0.01097954,0.0002538497,0.0001854963,0.00009740631,0.0003820799,0.00015095939,0.010829124],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99941874,0.000117999734,0.000025499234,0.00010710484,0.00016438888,0.00016626257],"domain_scores_gemma":[0.9990049,0.00031034512,0.00024964724,0.00016465024,0.00010453376,0.00016596312],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052156125,0.0006771526,0.00045602437,0.0011626757,0.0011016799,0.0011556944,0.00065619213,0.0007287029,0.015364686],"category_scores_gemma":[0.0032152266,0.0002793193,0.0005325376,0.0005847714,0.001225257,0.0014673426,0.0011132361,0.0010278788,0.001338182],"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.0011479518,0.00017256512,0.005570545,0.00016561433,0.000056993267,0.0009241984,0.0006144429,0.005389982,0.038386382,0.90016353,0.008284864,0.039122876],"study_design_scores_gemma":[0.0002639541,0.0011010156,0.012446646,0.00013456523,0.00008810423,0.0019498547,0.0009623294,0.07003369,0.066344075,0.8175538,0.028899549,0.00022241432],"about_ca_topic_score_codex":0.00030380642,"about_ca_topic_score_gemma":0.00029661387,"teacher_disagreement_score":0.015364686,"about_ca_system_score_codex":0.0005097191,"about_ca_system_score_gemma":0.00036651723,"threshold_uncertainty_score":0.051399946},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47528565,0.0005318965,0.43920198,0.0007784178,0.00037433658,0.00023726665,0.00078100996,0.0013581481,0.08145134],"genre_scores_gemma":[0.92719656,0.00019383273,0.052203245,0.00031987924,0.00024182879,0.00013870037,0.00082624983,0.0004133452,0.018466312],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99700385,0.0003594329,0.00023710799,0.00072902744,0.0009889285,0.0006815623],"domain_scores_gemma":[0.99249494,0.0020957852,0.0012143294,0.0016297991,0.0016014418,0.00096374075],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014642321,0.0008827611,0.00081593095,0.0022487585,0.0015281484,0.002940076,0.0012640643,0.0010598212,0.015410952],"category_scores_gemma":[0.011037088,0.00081168837,0.0016490472,0.0011393364,0.004102512,0.0051189596,0.0029417565,0.002002708,0.0019323585],"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.00034278943,0.00009082985,0.004030407,0.0002051927,0.000057078665,0.0008679292,0.0011819111,0.004560444,0.013524392,0.94299805,0.004097761,0.02804316],"study_design_scores_gemma":[0.00009891156,0.0002032363,0.005517888,0.00012066481,0.00008469895,0.001153012,0.00083090604,0.04458876,0.008523213,0.9202285,0.018540593,0.0001094804],"about_ca_topic_score_codex":0.0022517487,"about_ca_topic_score_gemma":0.0015391199,"teacher_disagreement_score":0.015410952,"about_ca_system_score_codex":0.001085085,"about_ca_system_score_gemma":0.00062603067,"threshold_uncertainty_score":0.0515548},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6370281,0.0035171069,0.22576821,0.0020530692,0.00039313172,0.00007897349,0.0017630093,0.00044262002,0.12895581],"genre_scores_gemma":[0.97478944,0.0009479082,0.011804611,0.00013767094,0.00026803676,0.00010303773,0.0007534847,0.00009146056,0.011104306],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988807,0.0002503889,0.000039640374,0.00025874915,0.00035047607,0.00022009778],"domain_scores_gemma":[0.9966625,0.0016254866,0.00039019046,0.00015160417,0.00045348998,0.00071681646],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009689863,0.00058631535,0.0008885281,0.0015770235,0.0010487095,0.0029080205,0.00083069346,0.00057682197,0.009484557],"category_scores_gemma":[0.0036892705,0.0004291467,0.0004110791,0.0005665743,0.0020890287,0.0027384353,0.0016419502,0.0015316884,0.0012272156],"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.00018545536,0.000034702065,0.0014004138,0.0001063587,0.000022358954,0.00013481488,0.00020060671,0.010757132,0.0034240421,0.96801007,0.004248029,0.011475932],"study_design_scores_gemma":[0.000053983415,0.00018352795,0.0063440567,0.000099438905,0.000026793856,0.00058741204,0.00041780967,0.15121934,0.003650965,0.81665283,0.020686526,0.00007738182],"about_ca_topic_score_codex":0.0020425334,"about_ca_topic_score_gemma":0.00081683183,"teacher_disagreement_score":0.009484557,"about_ca_system_score_codex":0.0013789875,"about_ca_system_score_gemma":0.00044659412,"threshold_uncertainty_score":0.031728983},"labels":[],"label_agreement":null}]}