{"meta":{"query_hash":"a5cad2b17e9c","filters":{"venue":"Annals of Combinatorics"},"cohort_total":55,"direct_labels_cover":0,"predictions_cover":55,"exported":55,"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/a5cad2b17e9c","api":"https://metacan.xera.ac/api/v1/cohort?venue=Annals+of+Combinatorics"},"results":[{"id":"W1527725279","doi":"10.1007/s00026-016-0307-z","title":"Symmetries on the Lattice of k-Bounded Partitions","year":2016,"lang":"en","type":"article","venue":"Annals of Combinatorics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Fields Institute for Research in Mathematical Sciences; York University; Université du Québec à Montréal; Google (Canada)","funders":"","keywords":"Bijection; Mathematics; Dihedral group; Homogeneous space; Combinatorics; Bounded function; Lattice (music); Affine transformation; Partition (number theory); Order (exchange); Discrete mathematics; Pure mathematics; Group (periodic table); Geometry; Mathematical analysis","score_opus":0.22230289959942331,"score_gpt":0.3878673954534723,"score_spread":0.165564495854049,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1527725279","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.9420578,0.00023600846,0.008195334,0.015492391,0.001327658,0.0008302663,0.00007183879,0.00017602033,0.03161271],"genre_scores_gemma":[0.9983929,0.00012799697,0.0006363074,0.00014776785,0.000031317613,0.000025150266,4.7150758e-7,0.00003162441,0.0006064559],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998323,0.00012225076,0.0005882034,0.00015516572,0.00054811046,0.00026323108],"domain_scores_gemma":[0.9914274,0.006303609,0.0005378733,0.0008167886,0.0008488212,0.00006549275],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00071566604,0.00017746375,0.0004034386,0.000111528185,0.000097583616,0.000011236252,0.00044708658,0.00009070875,0.00005630276],"category_scores_gemma":[0.007765153,0.000100821104,0.00015587159,0.00054395985,0.00025151184,0.0001309244,0.000096283366,0.000114410104,0.000027653952],"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.000022355205,0.00046190445,0.00006634508,0.00009510705,0.00005965908,9.822622e-7,0.0001586746,3.9534848e-7,0.000309184,0.9915303,0.0070659793,0.00022908817],"study_design_scores_gemma":[0.0003404491,0.00026761048,0.000055401324,0.00021291774,0.000028504624,0.0000010560718,0.00008988191,0.0000033642802,0.10753034,0.8886998,0.0026566691,0.00011397334],"about_ca_topic_score_codex":0.0000020976877,"about_ca_topic_score_gemma":7.360532e-7,"teacher_disagreement_score":0.10722116,"about_ca_system_score_codex":0.000022549906,"about_ca_system_score_gemma":0.000055225166,"threshold_uncertainty_score":0.92961746},"labels":[],"label_agreement":null},{"id":"W1774627331","doi":"10.1007/s00026-016-0313-1","title":"On Linear Configurations in Subsets of Compact Abelian Groups, and Invariant Measurable Hypergraphs","year":2016,"lang":"en","type":"article","venue":"Annals of Combinatorics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Agence Nationale de la Recherche","keywords":"Mathematics; Abelian group; Combinatorics; Finitary; Coprime integers; Lemma (botany); Hypergraph; Invariant (physics); Discrete mathematics","score_opus":0.08315348678708288,"score_gpt":0.3303523111892179,"score_spread":0.24719882440213498,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1774627331","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.9939933,0.00023783083,0.000091729475,0.0007150644,0.00015450692,0.00016032647,0.00003793037,0.000016006628,0.0045933137],"genre_scores_gemma":[0.99941355,0.00034676443,0.00007320286,0.00007688091,0.000008028212,0.0000023656382,0.0000014355629,0.000014950539,0.00006279337],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99887687,0.00011287937,0.00041772236,0.00014847325,0.00025681953,0.00018724309],"domain_scores_gemma":[0.9982493,0.0009121104,0.00021632547,0.0003342383,0.00021608255,0.00007193639],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005720934,0.00013769456,0.00036323606,0.00021575809,0.00006319644,0.0000060140655,0.00017175094,0.00009877376,0.000027670301],"category_scores_gemma":[0.0006574379,0.00009155537,0.00007324253,0.00027614538,0.00015658732,0.000096834345,0.00002911149,0.00009982408,0.0000011447027],"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.000053698568,0.00020095694,0.003753223,0.00006993373,0.00003840787,0.0000029277103,0.00034046438,0.0000017293668,0.0018348906,0.9922782,0.0011890151,0.00023653521],"study_design_scores_gemma":[0.0007477337,0.00022092053,0.010089484,0.00018951522,0.000011916609,0.0000028207578,0.000042230986,0.000021439397,0.022211235,0.9661392,0.00020399695,0.000119491546],"about_ca_topic_score_codex":0.000028169296,"about_ca_topic_score_gemma":0.000009919199,"teacher_disagreement_score":0.026139002,"about_ca_system_score_codex":0.0000077300865,"about_ca_system_score_gemma":0.000027994312,"threshold_uncertainty_score":0.37335196},"labels":[],"label_agreement":null},{"id":"W1801981974","doi":"10.1007/s00026-017-0350-4","title":"Generalized Polarization Modules","year":2017,"lang":"en","type":"article","venue":"Annals of Combinatorics","topic":"Advanced Algebra and Geometry","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Vector space; Polarization (electrochemistry); Direct product; Homogeneous; Operator (biology); Operator theory; Space (punctuation)","score_opus":0.11797032345961282,"score_gpt":0.3901266822152116,"score_spread":0.27215635875559874,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1801981974","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.9861115,0.000214209,0.0077031744,0.0007230144,0.00034288765,0.000095003685,0.000008018142,0.000044180524,0.004757962],"genre_scores_gemma":[0.9970051,0.000112942005,0.0014107209,0.000076813696,0.00003960282,0.0000029525763,0.000004133662,0.000017060725,0.0013306917],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992671,0.000022678976,0.00021578581,0.00011989283,0.00021140071,0.00016311792],"domain_scores_gemma":[0.9986149,0.00008219241,0.0003497174,0.00064582814,0.00025226787,0.000055100812],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020309069,0.00009784728,0.00021696971,0.00006633366,0.00021368515,0.000036211295,0.00033501282,0.00007349369,0.000027297669],"category_scores_gemma":[0.0009948065,0.000092359514,0.0000776141,0.00007980305,0.000059925434,0.00024618328,0.00009085636,0.00007206325,0.00001056707],"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.000007811977,0.000109284934,0.0038297789,0.000043460343,0.000021584177,0.0000017753339,0.000035772267,0.0000025134266,0.00042658532,0.9923094,0.001834443,0.0013776066],"study_design_scores_gemma":[0.00031340992,0.000041456868,0.0077400715,0.000019771622,0.000009664797,7.179386e-7,0.000009975479,0.00008110939,0.024206689,0.96605504,0.0014186708,0.000103415965],"about_ca_topic_score_codex":0.0000053680933,"about_ca_topic_score_gemma":0.0000011439952,"teacher_disagreement_score":0.026254337,"about_ca_system_score_codex":0.000004757797,"about_ca_system_score_gemma":0.000013605879,"threshold_uncertainty_score":0.37663117},"labels":[],"label_agreement":null},{"id":"W1849270272","doi":"10.1007/s00026-015-0285-6","title":"The Erdős-Ko-Rado Property for Some 2-Transitive Groups","year":2015,"lang":"en","type":"article","venue":"Annals of Combinatorics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Mathematics; Combinatorics; Transitive relation; Coset; Sigma; Group (periodic table); Algebraic number; Degree (music); Discrete mathematics; Physics","score_opus":0.15447487980376223,"score_gpt":0.36156757787513977,"score_spread":0.20709269807137753,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1849270272","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.92992276,0.006787196,0.006263051,0.013556406,0.0069804676,0.0036015394,0.00018119303,0.00034936232,0.032358017],"genre_scores_gemma":[0.9978258,0.00018315116,0.00025641898,0.00034339502,0.00011136139,0.00003855993,0.0000032425426,0.00003341466,0.001204631],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99868965,0.00010890381,0.00034923677,0.00016942393,0.00035641552,0.0003263722],"domain_scores_gemma":[0.99778223,0.0008422882,0.00018815248,0.0004472273,0.00061845494,0.00012166288],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012371483,0.00016981637,0.00029314554,0.000046422498,0.00029365672,0.000031552696,0.00042132082,0.000091996866,0.0000022751742],"category_scores_gemma":[0.00094981166,0.00008810661,0.00018373295,0.00015811951,0.0001963673,0.00015102801,0.00008564661,0.00014917308,0.0000018217028],"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.000121579345,0.00010052627,0.00005469735,0.00006829746,0.00007960023,0.0000017547126,0.0014481104,0.0000011356808,0.000017112505,0.9658839,0.030883582,0.0013397014],"study_design_scores_gemma":[0.0005834555,0.00032110765,0.00007017737,0.000023807546,0.000029854864,0.0000037503398,0.00043726806,0.00008460325,0.003881973,0.96222216,0.032194633,0.0001471854],"about_ca_topic_score_codex":0.0000056128115,"about_ca_topic_score_gemma":0.0000017647199,"teacher_disagreement_score":0.06790306,"about_ca_system_score_codex":0.000015105794,"about_ca_system_score_gemma":0.00006798267,"threshold_uncertainty_score":0.35928833},"labels":[],"label_agreement":null},{"id":"W1927422331","doi":"10.1007/s00026-016-0321-1","title":"A Generating Tree Approach to k-Nonnesting Partitions and Permutations","year":2016,"lang":"en","type":"article","venue":"Annals of Combinatorics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Capilano University; Simon Fraser University","funders":"","keywords":"Mathematics; Enumeration; Combinatorics; Permutation (music); Partition (number theory); Bounded function; Discrete mathematics; Tree (set theory); Generating function; Young tableau; Lattice (music)","score_opus":0.15311908451500703,"score_gpt":0.3703183694863432,"score_spread":0.2171992849713362,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1927422331","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.72042966,0.00011342299,0.26500013,0.0017556611,0.0003109171,0.0005606934,0.00002170238,0.00018969904,0.011618068],"genre_scores_gemma":[0.955568,0.000024652381,0.043801278,0.000085595086,0.000060888884,0.000077170975,0.0000013517857,0.000039347986,0.00034172478],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99858093,0.00006852005,0.0004965898,0.00024833798,0.00030149153,0.0003041571],"domain_scores_gemma":[0.99766666,0.0011113876,0.00023682405,0.00038708345,0.00042401667,0.00017405942],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041834617,0.00018254301,0.00034009677,0.00013036297,0.00016564992,0.000026500984,0.00018707766,0.00007515577,0.0000052342966],"category_scores_gemma":[0.0033018433,0.00014299575,0.00006771497,0.0004015151,0.000069307236,0.00019822839,0.00012081718,0.00008986121,0.0000074041122],"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.0000044241096,0.00028925718,0.00015794141,0.000103559294,0.000023136523,0.000001182637,0.00074671925,0.000024315423,0.0019775562,0.9938333,0.0012450211,0.0015935987],"study_design_scores_gemma":[0.000407347,0.00012378543,0.00009750105,0.00013446528,0.000025039624,0.000010092082,0.00019993885,0.0004269222,0.0049638366,0.9930396,0.00036643608,0.0002050275],"about_ca_topic_score_codex":0.0000023558327,"about_ca_topic_score_gemma":0.0000013815204,"teacher_disagreement_score":0.2351383,"about_ca_system_score_codex":0.00002230846,"about_ca_system_score_gemma":0.000044534678,"threshold_uncertainty_score":0.5831197},"labels":[],"label_agreement":null},{"id":"W1964363507","doi":"10.1007/s00026-009-0027-8","title":"Weighing Matrices and String Sorting","year":2009,"lang":"en","type":"article","venue":"Annals of Combinatorics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University","funders":"","keywords":"Sorting; String (physics); Mathematics; Algorithm; Combinatorics","score_opus":0.019427009807834895,"score_gpt":0.24735247166784396,"score_spread":0.22792546186000906,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1964363507","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.9886003,0.0040376224,0.00028434978,0.000053665473,0.0002568633,0.000048311576,9.562953e-7,0.00012539836,0.00659254],"genre_scores_gemma":[0.99945635,0.00043518693,0.000025037905,0.000026116028,0.000026183858,9.0742174e-7,5.789482e-7,0.000008769874,0.000020855405],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99942726,0.000015610207,0.00021379106,0.00007482125,0.00010374541,0.00016480249],"domain_scores_gemma":[0.9997028,0.000047263205,0.000052877273,0.0001080511,0.00003875504,0.000050229937],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025194898,0.00008837076,0.00015603536,0.00008453304,0.000045762266,0.000023218481,0.00008783073,0.000048147765,0.000002315722],"category_scores_gemma":[0.000020493277,0.00009123017,0.000037297457,0.00020179091,0.000011069198,0.00014548676,0.0000105876225,0.00008571421,0.0000018383923],"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.000006308672,0.000038241025,0.0035584678,0.00021949624,0.000041755866,0.000007964113,0.00063836464,0.00078890135,0.0027249719,0.97520775,0.000594675,0.016173104],"study_design_scores_gemma":[0.0005488194,0.00025846128,0.0152765205,0.0003316387,0.000028545921,0.0000141266655,0.0005290365,0.0057335054,0.06448268,0.9078358,0.004406564,0.00055432174],"about_ca_topic_score_codex":0.000002221507,"about_ca_topic_score_gemma":1.3218943e-7,"teacher_disagreement_score":0.06737197,"about_ca_system_score_codex":0.0000032815901,"about_ca_system_score_gemma":0.0000027907806,"threshold_uncertainty_score":0.37202585},"labels":[],"label_agreement":null},{"id":"W1966330756","doi":"10.1007/s00026-009-0014-0","title":"Jagged Partitions and Lattice Paths","year":2009,"lang":"en","type":"article","venue":"Annals of Combinatorics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"","keywords":"Bijection, injection and surjection; Bijection; Combinatorics; Mathematics; Lattice (music); Partition (number theory); Equivalence (formal languages); Discrete mathematics; Physics","score_opus":0.11749693799462814,"score_gpt":0.38557310855160654,"score_spread":0.2680761705569784,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1966330756","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.9616513,0.0009240889,0.0059659146,0.004111577,0.00075509667,0.000632233,0.000020208334,0.00034278366,0.02559678],"genre_scores_gemma":[0.9950467,0.00021480514,0.004166123,0.0002445903,0.00003985793,0.000008490976,0.0000022114623,0.000022727374,0.0002545005],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998626,0.00006363369,0.00047508313,0.00019565539,0.00034196873,0.0002976374],"domain_scores_gemma":[0.9979757,0.0006459831,0.0002833705,0.0004708411,0.0004838123,0.00014030024],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040725069,0.00018982499,0.0004027624,0.000092819915,0.00010372957,0.000025247045,0.00020657806,0.00011077672,0.000014577341],"category_scores_gemma":[0.0016901066,0.00018830685,0.000073210016,0.0004384392,0.0000719205,0.00021103087,0.00005583569,0.00017681855,0.00000893589],"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.000010149905,0.00046730327,0.00006313069,0.00007731511,0.000019471563,0.000005378646,0.00030413808,0.0000010870691,0.00015384144,0.9942767,0.0036661357,0.0009553303],"study_design_scores_gemma":[0.0004482027,0.00032165542,0.00038177575,0.000073007235,0.0000342575,0.000007206969,0.00007623334,0.000055224922,0.005713458,0.99043137,0.0022661504,0.00019146505],"about_ca_topic_score_codex":0.0000012839799,"about_ca_topic_score_gemma":3.9035118e-7,"teacher_disagreement_score":0.033395376,"about_ca_system_score_codex":0.000012832644,"about_ca_system_score_gemma":0.00003656509,"threshold_uncertainty_score":0.767893},"labels":[],"label_agreement":null},{"id":"W1967512075","doi":"10.1007/s00026-012-0163-4","title":"Cops and Robber Game with a Fast Robber on Expander Graphs and Random Graphs","year":2012,"lang":"en","type":"article","venue":"Annals of Combinatorics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Combinatorics; Mathematics; Cartesian product; Vertex (graph theory); Graph; Discrete mathematics; Random graph; Upper and lower bounds","score_opus":0.05001114505301214,"score_gpt":0.3106557785154308,"score_spread":0.2606446334624187,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1967512075","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.9927917,0.0016670281,0.00012710156,0.00014997725,0.00024903606,0.00027470017,0.000008090084,0.000047333557,0.004685022],"genre_scores_gemma":[0.9985079,0.0006517688,0.000191702,0.00031458604,0.000021419843,0.000014822593,0.0000022397144,0.000039387312,0.0002561836],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986252,0.00009737916,0.0003030728,0.00022345035,0.00034616955,0.00040469435],"domain_scores_gemma":[0.99846494,0.00058253686,0.0002006285,0.00037580254,0.0001682931,0.00020777312],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005521647,0.00027733977,0.00048506437,0.00018246667,0.0001503996,0.00003076818,0.00013327562,0.00014101747,0.000025137724],"category_scores_gemma":[0.00011951649,0.00019289272,0.00009333462,0.00026105857,0.00028570284,0.00020062028,0.00009332409,0.00022121666,8.7320734e-7],"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.0003074967,0.00022739252,0.02015107,0.00011429381,0.00015780202,0.0000030666286,0.0018865777,0.0000010031226,0.00002918952,0.97437686,0.0021087455,0.0006365191],"study_design_scores_gemma":[0.0025349893,0.00036219982,0.010090042,0.0000943631,0.00008100367,0.000031062,0.00026549178,0.000007340676,0.0015462678,0.9835808,0.0011119787,0.00029441493],"about_ca_topic_score_codex":0.0000062793843,"about_ca_topic_score_gemma":0.0000018382158,"teacher_disagreement_score":0.0100610275,"about_ca_system_score_codex":0.0000045772035,"about_ca_system_score_gemma":0.000012070413,"threshold_uncertainty_score":0.7865937},"labels":[],"label_agreement":null},{"id":"W1969959148","doi":"10.1007/s00026-011-0095-4","title":"Enumerative Properties of NC (B) (p,q)","year":2011,"lang":"en","type":"article","venue":"Annals of Combinatorics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Combinatorics; Partially ordered set; Generating function; Type (biology); Rank (graph theory); Möbius function; Lattice (music); Discrete mathematics; Physics","score_opus":0.40833692106214176,"score_gpt":0.3648739633036224,"score_spread":0.04346295775851938,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1969959148","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.9687753,0.000641462,0.0033617185,0.000088327215,0.00078885903,0.0005516223,0.0000099187255,0.00011456313,0.025668228],"genre_scores_gemma":[0.99560785,0.000077745,0.003922346,0.000024198289,0.00002024922,0.000020108699,5.226694e-7,0.000039517003,0.00028744037],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998312,0.00008855531,0.0007281321,0.00017616544,0.0004299025,0.00026525237],"domain_scores_gemma":[0.9975445,0.00021641562,0.00064516644,0.0005793596,0.00093454943,0.00007997527],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042731117,0.00021405546,0.0005954369,0.000120387434,0.000047072495,0.000004669295,0.0004112786,0.00011742245,0.000036849007],"category_scores_gemma":[0.0012465882,0.00018548078,0.0001516752,0.000368468,0.0001840564,0.00021067995,0.00013083967,0.00015582432,0.000009169266],"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.00005470355,0.0008480672,0.0002164061,0.00044727902,0.00008454623,0.0000026441985,0.004402807,4.4007479e-7,0.0016129152,0.99155957,0.00059946516,0.00017115047],"study_design_scores_gemma":[0.00023177992,0.00023536857,0.00004205102,0.00012383568,0.000021054397,0.000001582698,0.00021403843,0.000012690643,0.37468192,0.62418807,0.00012760586,0.00011998658],"about_ca_topic_score_codex":0.000015304184,"about_ca_topic_score_gemma":9.3561727e-7,"teacher_disagreement_score":0.37306902,"about_ca_system_score_codex":0.000013624304,"about_ca_system_score_gemma":0.00006929376,"threshold_uncertainty_score":0.7563687},"labels":[],"label_agreement":null},{"id":"W1973793988","doi":"10.1007/s00026-015-0251-3","title":"The Highly Connected Matroids in Minor-Closed Classes","year":2015,"lang":"en","type":"article","venue":"Annals of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":37,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Matroid; Mathematics; Minor (academic); Combinatorics; Characterization (materials science); Class (philosophy); Graphic matroid; State (computer science); Discrete mathematics; Computer science; Algorithm; Physics","score_opus":0.0879982621014941,"score_gpt":0.35005088756509617,"score_spread":0.2620526254636021,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1973793988","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.95372856,0.0041199387,0.016152868,0.011909014,0.0012685086,0.0005424529,0.0000051660177,0.00022342865,0.01205005],"genre_scores_gemma":[0.99871427,0.00017693212,0.0004968353,0.00014114215,0.000013435427,0.0000143685265,0.0000010448732,0.000010340146,0.00043164447],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99812496,0.00027847965,0.00032038684,0.00023948165,0.00059177977,0.00044492926],"domain_scores_gemma":[0.9974425,0.0008103545,0.0001294027,0.00078240637,0.0006743418,0.00016100454],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013203862,0.00012724027,0.0002090872,0.00018176904,0.00008589208,0.000084913736,0.0015962631,0.000066036904,0.0000011056339],"category_scores_gemma":[0.00077526044,0.000097515695,0.00006141514,0.0014167023,0.00016400211,0.00038712745,0.00034242187,0.00021822704,0.000023449378],"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.0000356005,0.000113242575,0.0022076291,0.00000805714,0.000010784703,0.00001583524,0.00021446991,0.000031923042,0.00016435854,0.99092054,0.003887141,0.0023904236],"study_design_scores_gemma":[0.000672376,0.00031516017,0.004082463,0.000015311687,0.0000011562935,0.0000037711663,0.000111611684,0.0016309961,0.011231133,0.9671897,0.014603547,0.00014271884],"about_ca_topic_score_codex":0.0000239782,"about_ca_topic_score_gemma":0.000011890398,"teacher_disagreement_score":0.04498568,"about_ca_system_score_codex":0.000029443001,"about_ca_system_score_gemma":0.00018131016,"threshold_uncertainty_score":0.39765745},"labels":[],"label_agreement":null},{"id":"W1987306902","doi":"10.1007/s00026-005-0255-5","title":"Bounding the Roots of Ideal and Open Set Polynomials","year":2005,"lang":"en","type":"article","venue":"Annals of Combinatorics","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick; Fields Institute for Research in Mathematical Sciences; University of Waterloo; University of Toronto; Dalhousie University","funders":"","keywords":"Mathematics; Ideal (ethics); Combinatorics; Cardinality (data modeling); Transitive relation; Moduli; Preorder; Discrete mathematics; Polynomial; Mathematical analysis","score_opus":0.06116245509014671,"score_gpt":0.3312704087362235,"score_spread":0.27010795364607676,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1987306902","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.9730148,0.0011862844,0.009172791,0.012945114,0.0004072008,0.00025075636,0.0000052857663,0.000029683286,0.002988093],"genre_scores_gemma":[0.9987776,0.00007459197,0.00056664983,0.00042842122,0.00004058009,0.0000030489944,8.350722e-7,0.000004128948,0.00010409905],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99912244,0.00006859084,0.00029492695,0.000156665,0.00019387995,0.00016351679],"domain_scores_gemma":[0.9990972,0.00022005285,0.00022595395,0.00028719148,0.000111132475,0.000058437767],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006856913,0.00008510364,0.00020526593,0.00006165746,0.00010238393,0.00012155636,0.0010385313,0.00003439677,0.000003025619],"category_scores_gemma":[0.00006556401,0.00006485608,0.000041937492,0.00029198427,0.00006323514,0.0004973857,0.00063741946,0.00006699846,0.0000030927645],"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.000012484985,0.000088169014,0.00090079784,0.00001982099,0.000028233464,0.0000010473972,0.0009627305,0.000084270534,0.0007206272,0.9161661,0.0074690976,0.07354657],"study_design_scores_gemma":[0.0014344554,0.00053591584,0.067130886,0.00010906581,0.00001920671,0.00002331024,0.00010884922,0.020573448,0.07445455,0.78718656,0.04798352,0.0004402019],"about_ca_topic_score_codex":0.000107209766,"about_ca_topic_score_gemma":0.000007311212,"teacher_disagreement_score":0.12897956,"about_ca_system_score_codex":0.0000078512,"about_ca_system_score_gemma":0.00007590165,"threshold_uncertainty_score":0.2644754},"labels":[],"label_agreement":null},{"id":"W1987443014","doi":"10.1007/s00026-011-0075-8","title":"2-Cell Embeddings with Prescribed Face Lengths and Genus","year":2010,"lang":"en","type":"article","venue":"Annals of Combinatorics","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Combinatorics; Mathematics; Integer (computer science); Graph; Embedding; Euler characteristic; Sequence (biology); Genus; Degree (music); Discrete mathematics; Physics","score_opus":0.014079248861447784,"score_gpt":0.2432337552056802,"score_spread":0.2291545063442324,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1987443014","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.97405696,0.00042749458,0.018556971,0.0006601373,0.0003071859,0.00011066717,0.0000019993763,0.000099824814,0.005778733],"genre_scores_gemma":[0.99787384,0.000065066146,0.0017140188,0.00016736808,0.0000121964285,0.0000042764273,4.5363137e-7,0.000008251212,0.00015452919],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991439,0.000032660242,0.00014217095,0.0002432817,0.00021831796,0.00021965812],"domain_scores_gemma":[0.9990088,0.00012408388,0.00010790842,0.0004751658,0.00017216413,0.000111900044],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033284383,0.00012566776,0.00015886631,0.0000998678,0.00009146603,0.00007944561,0.0005761062,0.00006661007,0.000005176618],"category_scores_gemma":[0.000032263255,0.00010863768,0.0000469198,0.00040380206,0.00010302396,0.00032599448,0.00017006382,0.00021385019,0.000003664137],"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.000020729787,0.00017409828,0.0017018392,0.000036263857,0.000017676037,0.000007113048,0.0010872623,0.0000035242367,0.002176023,0.9881462,0.0015372869,0.005091968],"study_design_scores_gemma":[0.0017540858,0.0017439497,0.0074588116,0.00006771256,0.000032545464,0.000046619378,0.00015408715,0.0029948484,0.20398797,0.6975076,0.083361246,0.000890523],"about_ca_topic_score_codex":0.0000070365027,"about_ca_topic_score_gemma":0.0000011312144,"teacher_disagreement_score":0.29063863,"about_ca_system_score_codex":0.0000012484726,"about_ca_system_score_gemma":0.0000287505,"threshold_uncertainty_score":0.4430116},"labels":[],"label_agreement":null},{"id":"W1990285456","doi":"10.1007/pl00001293","title":"Cellular Structures Determined by Polygons and Trees","year":2001,"lang":"en","type":"article","venue":"Annals of Combinatorics","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Polytope; Combinatorics; Moduli space; Polyhedron; Integer (computer science); Space (punctuation); Enumeration; Pure mathematics; Computer science","score_opus":0.03134408109571775,"score_gpt":0.2736930031292617,"score_spread":0.24234892203354397,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1990285456","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.93921983,0.005291149,0.049956515,0.0033825336,0.00019309737,0.00007129478,0.000024918636,0.00008394787,0.0017767091],"genre_scores_gemma":[0.9981349,0.0007717537,0.00031654802,0.000245138,0.000010510052,0.0000013447486,0.000006871864,0.0000029788685,0.0005099585],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99908763,0.000039243132,0.00019738333,0.00023374398,0.000227357,0.00021465331],"domain_scores_gemma":[0.99919724,0.00011940315,0.00009864001,0.00037827677,0.00008734706,0.000119080665],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014576403,0.00010830811,0.00021738604,0.00016604592,0.000071040646,0.00006031241,0.00059810333,0.00006182608,0.000022914948],"category_scores_gemma":[0.000104624785,0.00008514064,0.00005468777,0.0010727812,0.00007088904,0.00023193737,0.00022078847,0.00006828157,0.0000036428657],"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.000015420806,0.0003995462,0.015098237,0.000017901519,0.00012212772,0.00007210285,0.00015252603,0.000010187152,0.004210637,0.8439094,0.029204391,0.106787555],"study_design_scores_gemma":[0.0007009763,0.0008716768,0.028890744,0.000009802115,0.000042785436,0.000024946365,0.00004261494,0.0029551177,0.050249353,0.7966191,0.11903318,0.0005596947],"about_ca_topic_score_codex":0.0000773735,"about_ca_topic_score_gemma":0.0000023027794,"teacher_disagreement_score":0.10622786,"about_ca_system_score_codex":0.0000028012626,"about_ca_system_score_gemma":0.000009984263,"threshold_uncertainty_score":0.34719342},"labels":[],"label_agreement":null},{"id":"W1993054401","doi":"10.1007/s00026-009-0008-y","title":"Enumeration of Decomposable Combinatorial Structures with Restricted Patterns","year":2009,"lang":"en","type":"article","venue":"Annals of Combinatorics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Enumeration; Mathematics; Combinatorics; Combinatorial analysis; Class (philosophy); Enumerative combinatorics; Focus (optics); Gravitational singularity; Discrete mathematics; Computer science","score_opus":0.01984716435851521,"score_gpt":0.27020818073847463,"score_spread":0.25036101637995944,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1993054401","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.95737666,0.00022838087,0.039776318,0.0006789339,0.00059028395,0.00016915407,0.000008192569,0.00010712164,0.0010649319],"genre_scores_gemma":[0.9986843,0.000058853155,0.0010275547,0.00016825888,0.000029188697,0.0000017835662,0.000008477907,0.0000069411053,0.000014666401],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99868685,0.00007925461,0.0003505973,0.00022487168,0.0004314149,0.00022699418],"domain_scores_gemma":[0.9985759,0.00011097529,0.00031654278,0.000547013,0.00037539715,0.00007414031],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019328823,0.00014974375,0.0002929339,0.00014227883,0.00006207514,0.000049620696,0.0006918331,0.000079936246,0.000006473217],"category_scores_gemma":[0.000043141463,0.00012651322,0.000062886866,0.0005828922,0.000035590427,0.00041056576,0.00006330846,0.000111296045,0.0000011860171],"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.000036309884,0.00023990133,0.0015723046,0.000021634845,0.000021300932,0.000006369536,0.00019412198,0.00007086064,0.0012858541,0.99167055,0.0007007823,0.00417999],"study_design_scores_gemma":[0.0010161018,0.0014516765,0.04416514,0.000059920974,0.000009904683,0.000008170855,0.000022627535,0.0021377592,0.15152124,0.7989935,0.0003860578,0.00022788673],"about_ca_topic_score_codex":0.00003097885,"about_ca_topic_score_gemma":6.661933e-7,"teacher_disagreement_score":0.19267704,"about_ca_system_score_codex":0.000009362951,"about_ca_system_score_gemma":0.00007222716,"threshold_uncertainty_score":0.5159059},"labels":[],"label_agreement":null},{"id":"W2003363424","doi":"10.1007/s00026-006-0298-2","title":"A Simple Recurrence for Covers of the Sphere With Branch Points of Arbitrary Ramification","year":2006,"lang":"en","type":"article","venue":"Annals of Combinatorics","topic":"Algebraic Geometry and Number Theory","field":"Mathematics","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Combinatorics; Permutation (music); Combinatorial proof; Riemann–Hurwitz formula; Simple (philosophy); Eulerian path; Generating function; Bijection; Riemann surface; Series (stratigraphy); Algebraic number; Discrete mathematics; Pure mathematics; Mathematical analysis; Geometric function theory; Lagrangian","score_opus":0.04163829066549527,"score_gpt":0.30342413453798517,"score_spread":0.2617858438724899,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2003363424","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.99227804,0.00017531226,0.0037665982,0.00019604887,0.00008698161,0.0003455647,0.00004615049,0.000010798772,0.0030945113],"genre_scores_gemma":[0.99937105,0.00001601894,0.00036111308,0.000035750432,0.000011279225,0.000008900331,0.000007241235,0.000012665192,0.00017600045],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99907804,0.000059506718,0.00036368333,0.000111222405,0.00025408564,0.0001334401],"domain_scores_gemma":[0.9980771,0.0006131445,0.0005319421,0.00037785282,0.00037930493,0.000020673351],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045443058,0.000098141034,0.00026037803,0.00003495649,0.00003921345,0.0000033403887,0.0002495768,0.000065315435,0.000017132632],"category_scores_gemma":[0.0002976707,0.00007171627,0.00010940148,0.00041633093,0.00013078828,0.0000792211,0.000027795044,0.000075271135,5.655284e-7],"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.00014445164,0.00048398203,0.0057678865,0.00050436426,0.000043429463,1.3845592e-7,0.0001621695,0.0000111039835,0.00044819585,0.9875356,0.0045779753,0.00032070265],"study_design_scores_gemma":[0.00044187452,0.00015967134,0.004447226,0.00008989768,0.000027660406,0.0000010055558,0.00008650398,0.000020163106,0.13482356,0.8592506,0.0005815572,0.00007028196],"about_ca_topic_score_codex":0.000021619882,"about_ca_topic_score_gemma":0.0000031019626,"teacher_disagreement_score":0.13437538,"about_ca_system_score_codex":0.0000060411353,"about_ca_system_score_gemma":0.00006676473,"threshold_uncertainty_score":0.2924505},"labels":[],"label_agreement":null},{"id":"W2004668118","doi":"10.1007/pl00012581","title":"On PBIBD Designs Based on Triangular Schemes","year":2002,"lang":"en","type":"article","venue":"Annals of Combinatorics","topic":"Optimal Experimental Design Methods","field":"Decision Sciences","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Greo","funders":"","keywords":"Mathematics; Combinatorics; Block (permutation group theory); Discrete mathematics; Arithmetic","score_opus":0.5328576690974302,"score_gpt":0.4930455767340003,"score_spread":0.03981209236342986,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2004668118","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.52276,0.003821494,0.097097635,0.0098667685,0.0040691346,0.0018280386,0.000066177956,0.00037711882,0.36011365],"genre_scores_gemma":[0.9906202,0.000034772966,0.005213769,0.001989102,0.000025849593,0.000013220682,0.0000011280268,0.000025567631,0.0020763783],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9955289,0.00072637916,0.0006904277,0.0004945603,0.0022045635,0.0003552205],"domain_scores_gemma":[0.9940051,0.0039463947,0.0003401295,0.0010419638,0.00046267666,0.00020372844],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0035376358,0.0002369685,0.00048572652,0.00055168435,0.0001177139,0.00011223368,0.00094403484,0.00014197316,0.001468021],"category_scores_gemma":[0.006495645,0.00018948926,0.00027874947,0.0015373572,0.00012366829,0.00019930299,0.000062603445,0.00020237698,0.00066997565],"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.0005956019,0.003968942,0.0009860999,0.00001760987,0.000054584958,0.00007413603,0.0003825362,0.0018951624,0.008210969,0.70391226,0.23563905,0.04426306],"study_design_scores_gemma":[0.0019280667,0.004017746,0.0006680474,0.000068255205,0.000011682839,0.0000017153399,0.000113507114,0.038831208,0.5033148,0.41681007,0.033736825,0.00049806596],"about_ca_topic_score_codex":0.0000033124918,"about_ca_topic_score_gemma":5.921248e-8,"teacher_disagreement_score":0.49510384,"about_ca_system_score_codex":0.000027885546,"about_ca_system_score_gemma":0.00003169611,"threshold_uncertainty_score":0.9994448},"labels":[],"label_agreement":null},{"id":"W2009700041","doi":"10.1007/s00026-011-0094-5","title":"Cores of Geometric Graphs","year":2011,"lang":"en","type":"article","venue":"Annals of Combinatorics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":29,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Combinatorics; Mathematics; Indifference graph; Chordal graph; Clique-sum; Metric dimension; Cograph; 1-planar graph; Pathwidth; Block graph; Discrete mathematics; Graph; Line graph","score_opus":0.06872167980822945,"score_gpt":0.23859015168705247,"score_spread":0.16986847187882304,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2009700041","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.96381617,0.0021581259,0.00023924201,0.0000025950694,0.0005630653,0.000065465996,0.000007480659,0.000068123605,0.03307974],"genre_scores_gemma":[0.99958575,0.00032354146,0.000016299717,0.000006582466,0.0000048502034,0.0000034557152,0.0000011993025,0.000014162695,0.000044153283],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993671,0.000021545413,0.0002620896,0.00006315668,0.00014134734,0.00014477049],"domain_scores_gemma":[0.99947816,0.000049261896,0.00007048381,0.00022433703,0.0001286733,0.000049079765],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022681018,0.00008866805,0.0002148212,0.00032945818,0.000013694371,0.0000022116485,0.00019041728,0.00006325978,0.00003683874],"category_scores_gemma":[0.000030583848,0.00008715184,0.000100921236,0.0009170694,0.000045944318,0.00006757365,0.000015508425,0.00006410275,0.0000075491907],"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.00001662471,0.00016611151,0.01792907,0.00034360253,0.00012615466,0.0000038671205,0.00055411254,0.000058572266,0.00076027034,0.9755416,0.003301011,0.0011990403],"study_design_scores_gemma":[0.00034314318,0.00033327448,0.0429075,0.000072179704,0.000023676977,0.0000037400637,0.00017399694,0.000120775956,0.3198238,0.6339347,0.0020093753,0.0002538453],"about_ca_topic_score_codex":0.00001707056,"about_ca_topic_score_gemma":3.8460604e-7,"teacher_disagreement_score":0.34160686,"about_ca_system_score_codex":0.0000019907777,"about_ca_system_score_gemma":0.000004771601,"threshold_uncertainty_score":0.3553949},"labels":[],"label_agreement":null},{"id":"W2014451575","doi":"10.1007/s00026-011-0102-9","title":"The Moduli Space of Curves, Double Hurwitz Numbers, and Faber’s Intersection Number Conjecture","year":2011,"lang":"en","type":"article","venue":"Annals of Combinatorics","topic":"Algebraic Geometry and Number Theory","field":"Mathematics","cited_by":21,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Moduli space; Conjecture; Combinatorics; Intersection (aeronautics); Genus; Ramification; Locus (genetics); Dimension (graph theory); Pure mathematics; Hyperelliptic curve","score_opus":0.10114526162773277,"score_gpt":0.32709189444050935,"score_spread":0.22594663281277658,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2014451575","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.9376476,0.0019180648,0.0007067203,0.0007197548,0.0006771924,0.00034276533,0.0000091130905,0.000055434022,0.0579234],"genre_scores_gemma":[0.99695754,0.0010564212,0.00015169954,0.00007874124,0.000020518293,0.00000793768,0.000002146656,0.000022489745,0.0017025169],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988357,0.00010476826,0.00038585567,0.00017295498,0.00026774887,0.00023300381],"domain_scores_gemma":[0.998407,0.00041992136,0.000379059,0.0004298941,0.00028604435,0.00007808004],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00086636614,0.00017264689,0.0003340601,0.000043359236,0.000109108914,0.000010555931,0.00024785055,0.00012789237,0.00012375701],"category_scores_gemma":[0.00024019081,0.00013015565,0.00010976416,0.00031919582,0.0002344258,0.00014230845,0.00011086793,0.00021543338,0.000008882149],"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.00015631969,0.00022620056,0.0032092796,0.00040038084,0.00014117903,0.0000021686965,0.0015501961,1.01039795e-7,0.000041227664,0.97694063,0.0170882,0.00024413808],"study_design_scores_gemma":[0.00057537097,0.00015531896,0.00090029114,0.00017671114,0.000053096363,0.000023211554,0.0006900616,0.000004564547,0.03756967,0.95695114,0.0027457906,0.00015477574],"about_ca_topic_score_codex":0.00015287695,"about_ca_topic_score_gemma":0.000014936419,"teacher_disagreement_score":0.05930997,"about_ca_system_score_codex":0.000009582359,"about_ca_system_score_gemma":0.000029515873,"threshold_uncertainty_score":0.5307593},"labels":[],"label_agreement":null},{"id":"W2015046561","doi":"10.1007/s00026-006-0300-z","title":"A Symmetric Function Resolution of the Number of Permutations With Respect to Block-Stable Elements","year":2006,"lang":"en","type":"article","venue":"Annals of Combinatorics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Combinatorics; Partition (number theory); Block (permutation group theory); Resolution (logic); Discrete mathematics","score_opus":0.019864034384045538,"score_gpt":0.2686542668971128,"score_spread":0.24879023251306726,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2015046561","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.9598592,0.00016027829,0.033378962,0.0005162829,0.00019750824,0.00018836049,0.000009599,0.000029630046,0.0056601865],"genre_scores_gemma":[0.99880093,0.000007649275,0.00080430513,0.000071186114,0.000009775351,0.0000062384565,0.000001563074,0.0000058471,0.00029252502],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988878,0.00006971149,0.00031505805,0.00014747416,0.0004248978,0.0001550621],"domain_scores_gemma":[0.99865824,0.000098224824,0.00034967173,0.00044757596,0.00041849542,0.0000277934],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040294082,0.00007918162,0.00015193106,0.0001479317,0.00006801031,0.0000152264365,0.00041155168,0.000032215,0.0000050675053],"category_scores_gemma":[0.00007225114,0.00005812716,0.000059265516,0.0020614674,0.00003829282,0.00016908618,0.00011394325,0.00005446192,0.000003228959],"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.000025526106,0.00030047353,0.011755498,0.000030437353,0.00002271024,5.315981e-7,0.00011873712,0.00067927345,0.0010383418,0.98265886,0.0028242404,0.00054538256],"study_design_scores_gemma":[0.0011090543,0.0008612096,0.29942942,0.0002211634,0.000054785327,0.000012522357,0.00014361012,0.007101293,0.102008216,0.58425474,0.004479904,0.0003240656],"about_ca_topic_score_codex":0.00016995422,"about_ca_topic_score_gemma":0.0000057568122,"teacher_disagreement_score":0.3984041,"about_ca_system_score_codex":0.000016375025,"about_ca_system_score_gemma":0.000059931615,"threshold_uncertainty_score":0.23703568},"labels":[],"label_agreement":null},{"id":"W2023752037","doi":"10.1007/s00026-013-0191-8","title":"On the Orthogonal Tableaux of Koike and Terada","year":2013,"lang":"fi","type":"article","venue":"Annals of Combinatorics","topic":"Molecular spectroscopy and chirality","field":"Chemistry","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"","keywords":"Bijection, injection and surjection; Combinatorics; Young tableau; Mathematics; Symmetric group; Bijection","score_opus":0.028343189879481347,"score_gpt":0.27360302431836536,"score_spread":0.24525983443888402,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2023752037","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.9489731,0.0019554899,0.000016033358,0.003459324,0.00016824472,0.00015236814,0.000049096005,0.000010022171,0.04521631],"genre_scores_gemma":[0.9962991,0.00077156944,0.000014512958,0.00062313495,0.000032765238,0.000010812035,0.000008735946,0.000021319807,0.002218037],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9983712,0.000087545,0.00048789397,0.00025729093,0.0004652882,0.00033078232],"domain_scores_gemma":[0.9982289,0.0002958821,0.00038878163,0.0006462347,0.0003232627,0.00011693012],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00029418172,0.0002515764,0.00040644273,0.00003514821,0.00010299337,0.000042541797,0.00036889352,0.0001938694,0.0012731112],"category_scores_gemma":[0.00019563973,0.00018854934,0.00016676233,0.00020828555,0.00023663578,0.0000847694,0.00013929482,0.00038104987,0.000023043856],"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.00006312409,0.00079070433,0.0038501027,0.0006239618,0.00021884988,0.0000063671564,0.00032252187,0.000002866869,0.030123191,0.9513324,0.011764736,0.0009011776],"study_design_scores_gemma":[0.0005115447,0.00040244064,0.006231475,0.00025592252,0.00005538392,0.000004469494,0.00013496903,0.00013824298,0.7204073,0.26351935,0.0080525065,0.00028640026],"about_ca_topic_score_codex":0.00018176534,"about_ca_topic_score_gemma":0.000002407501,"teacher_disagreement_score":0.69028413,"about_ca_system_score_codex":0.000010976152,"about_ca_system_score_gemma":0.00008093856,"threshold_uncertainty_score":0.99963987},"labels":[],"label_agreement":null},{"id":"W2025031873","doi":"10.1007/pl00001274","title":"The Number of Ramified Coverings of the Sphere by the Torus and Surfaces of Higher Genera","year":2000,"lang":"en","type":"article","venue":"Annals of Combinatorics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":137,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Ramification; Mathematics; Torus; Conjecture; Combinatorics; Pure mathematics; Action (physics); Discrete mathematics; Geometry","score_opus":0.03859772107404698,"score_gpt":0.3310167604778971,"score_spread":0.2924190394038501,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2025031873","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.99068743,0.001394837,0.000025396637,0.00050694327,0.00040258275,0.00033548768,0.000028059656,0.000013954473,0.006605283],"genre_scores_gemma":[0.9955889,0.0008267917,0.00025845465,0.00004275448,0.000017096778,0.000008021736,5.742695e-7,0.00003305249,0.0032243675],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981102,0.0001466597,0.0007677712,0.00014388116,0.000599609,0.00023191531],"domain_scores_gemma":[0.9962734,0.0016002993,0.0008261018,0.00085460243,0.00040426655,0.000041318468],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005911617,0.00020130476,0.0005169723,0.0000112313355,0.00011561708,0.000014036098,0.00071334926,0.00011664883,0.00007020958],"category_scores_gemma":[0.00036283443,0.000109899505,0.00015477363,0.00034757814,0.00045901764,0.0000887312,0.00015903621,0.00017406841,0.000001357286],"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.00007637816,0.0004173576,0.0009246205,0.0004075805,0.00016619776,3.4610255e-7,0.00072063075,0.00003221413,0.0022086622,0.97936106,0.01444333,0.0012416164],"study_design_scores_gemma":[0.0005348929,0.00009121704,0.00054513745,0.0001081503,0.00005883565,0.000002437989,0.00015361505,0.0000541312,0.09207614,0.8924199,0.013828579,0.00012698503],"about_ca_topic_score_codex":0.000042251504,"about_ca_topic_score_gemma":0.0000021375558,"teacher_disagreement_score":0.08986747,"about_ca_system_score_codex":0.000011662614,"about_ca_system_score_gemma":0.000047379377,"threshold_uncertainty_score":0.44815716},"labels":[],"label_agreement":null},{"id":"W2037416325","doi":"10.1007/s00026-013-0202-9","title":"Solving Non-Homogeneous Nested Recursions Using Trees","year":2013,"lang":"en","type":"article","venue":"Annals of Combinatorics","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Recursion (computer science); Tree (set theory); Binary tree; Double recursion; Homogeneous; Interpretation (philosophy); Mathematics; Term (time); Combinatorics; Generalization; Set (abstract data type); Discrete mathematics; Algorithm; Computer science; Mathematical analysis; Physics","score_opus":0.05390717657397869,"score_gpt":0.3014080344625421,"score_spread":0.2475008578885634,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2037416325","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.6474295,0.0009997489,0.3469496,0.0010807079,0.0014157905,0.00034135574,0.0000072413272,0.00016476904,0.0016112583],"genre_scores_gemma":[0.9884163,0.00012312109,0.011098705,0.00019578305,0.00003755519,0.0000061693677,0.0000042825236,0.000012079269,0.00010601726],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99875194,0.000047299636,0.00029442774,0.00026792337,0.00032488635,0.000313512],"domain_scores_gemma":[0.9984302,0.0001176688,0.00018468675,0.00070636783,0.00041650797,0.00014456832],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017682306,0.00014395516,0.0002231109,0.00012649733,0.00017807444,0.00012206125,0.0009015128,0.00008129809,0.00001978893],"category_scores_gemma":[0.00006465039,0.00012865334,0.00008278473,0.00052726996,0.000037820482,0.00082797685,0.00048454455,0.00011342077,0.000032648433],"study_design_candidate":"simulation_or_modeling","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.000026362492,0.0029098594,0.01033389,0.00022265832,0.00023837996,0.00017272295,0.0034667607,0.0033303571,0.052488137,0.47268224,0.13894449,0.31518415],"study_design_scores_gemma":[0.00065122027,0.00044611786,0.016306791,0.00028606423,0.00001659598,0.00005192243,0.00009408804,0.7788288,0.038139697,0.15746938,0.0069970815,0.0007122586],"about_ca_topic_score_codex":0.00023189733,"about_ca_topic_score_gemma":0.0000012489791,"teacher_disagreement_score":0.77549845,"about_ca_system_score_codex":0.000012116407,"about_ca_system_score_gemma":0.0000697985,"threshold_uncertainty_score":0.52463305},"labels":[],"label_agreement":null},{"id":"W2048713524","doi":"10.1007/s00026-014-0249-2","title":"Structure and Enumeration of (3+1)-Free Posets","year":2014,"lang":"en","type":"article","venue":"Annals of Combinatorics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Partially ordered set; Enumeration; Bipartite graph; Star product; Conjecture; Disjoint sets; Automorphism group","score_opus":0.04944323101980587,"score_gpt":0.3336929998910024,"score_spread":0.2842497688711965,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2048713524","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.9893041,0.00024149485,0.007220144,0.00036004718,0.0005160853,0.0002561025,0.000023988745,0.000052654075,0.0020253356],"genre_scores_gemma":[0.99479026,0.00004427112,0.0049869744,0.00004891717,0.000036355133,0.0000028587203,0.0000029878936,0.000027922222,0.000059470505],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987035,0.000080631544,0.0005010927,0.0001584293,0.00037689274,0.00017945681],"domain_scores_gemma":[0.9976663,0.00067789166,0.00048212166,0.00064929697,0.00045179063,0.00007259841],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037072808,0.00016602484,0.00045033163,0.0000949094,0.000044586297,0.0000107461055,0.0002954371,0.00012832877,0.00001121171],"category_scores_gemma":[0.0025940866,0.00015772284,0.00006183053,0.00021844816,0.00008562958,0.00013974308,0.00014096846,0.00012735334,6.45689e-7],"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.00001370943,0.00012790695,0.00031431895,0.0003711784,0.000027003247,3.6709093e-7,0.00032477945,0.0000025328147,0.0017857741,0.99482226,0.0014622941,0.0007478466],"study_design_scores_gemma":[0.000547155,0.00024362143,0.00022545118,0.00006241848,0.000024020475,0.0000030717904,0.0000248606,0.00022526862,0.094766684,0.9032792,0.00047192365,0.00012631695],"about_ca_topic_score_codex":0.000003387128,"about_ca_topic_score_gemma":0.000001265324,"teacher_disagreement_score":0.09298091,"about_ca_system_score_codex":0.000007820204,"about_ca_system_score_gemma":0.000022639413,"threshold_uncertainty_score":0.64317507},"labels":[],"label_agreement":null},{"id":"W2052053714","doi":"10.1007/s00026-014-0223-z","title":"Modular Decomposition of the Orlik-Terao Algebra","year":2014,"lang":"en","type":"article","venue":"Annals of Combinatorics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor; Western University","funders":"","keywords":"Subvariety; Mathematics; Algebraically closed field; Hyperplane; Combinatorics; Subalgebra; Complete intersection; Algebra over a field; Pure mathematics","score_opus":0.05902803664066356,"score_gpt":0.3601776052366566,"score_spread":0.301149568595993,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2052053714","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.9707124,0.00011404297,0.02131382,0.0006216901,0.0012069859,0.0004172207,0.0000072286807,0.00007645153,0.0055301394],"genre_scores_gemma":[0.99712497,0.000027079524,0.002501147,0.00009540796,0.000047269412,0.000011240422,0.0000015630052,0.000041186304,0.00015012699],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980979,0.00017758324,0.0006851453,0.00018501743,0.0005898984,0.0002644327],"domain_scores_gemma":[0.99690425,0.0007744599,0.0007095853,0.00096984336,0.00057030114,0.00007152812],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006550769,0.0002061756,0.00050524954,0.000083284576,0.000087684384,0.000012615054,0.00062926183,0.00012561546,0.000015231717],"category_scores_gemma":[0.0012538584,0.00016043597,0.00023185693,0.00045351317,0.00011745105,0.00014272761,0.0001936371,0.00018319303,0.000006414793],"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.000012534151,0.00040763992,0.00021461614,0.0002729429,0.000039624032,4.017281e-7,0.00022362349,0.000028069293,0.0022763663,0.9951819,0.0009392819,0.00040300522],"study_design_scores_gemma":[0.000404983,0.00015947617,0.00036124713,0.00014273616,0.000033694218,0.00000303813,0.000021340682,0.00057690195,0.11998096,0.877078,0.0010952516,0.0001423506],"about_ca_topic_score_codex":0.000004118493,"about_ca_topic_score_gemma":6.3050976e-7,"teacher_disagreement_score":0.11810388,"about_ca_system_score_codex":0.00002119097,"about_ca_system_score_gemma":0.000035175377,"threshold_uncertainty_score":0.6542389},"labels":[],"label_agreement":null},{"id":"W2053104190","doi":"10.1007/s000260300005","title":"Posets of Matrices and Permutations with Forbidden Subsequences","year":2003,"lang":"en","type":"article","venue":"Annals of Combinatorics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Combinatorics; Mathematics; Partially ordered set; Enumeration; Permutation (music); Subsequence; Longest common subsequence problem; Rank (graph theory); Discrete mathematics","score_opus":0.10261899135627353,"score_gpt":0.3681253956720894,"score_spread":0.26550640431581585,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2053104190","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.988199,0.00083237677,0.0034771955,0.00013206425,0.00014694262,0.00030435916,0.0000117407535,0.0000423818,0.0068539283],"genre_scores_gemma":[0.99198675,0.0002306715,0.007597671,0.000013560971,0.0000066070656,0.000011977167,0.0000011745665,0.000026581361,0.00012500929],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99871624,0.00006989955,0.0004480767,0.00016227843,0.0003926861,0.00021085366],"domain_scores_gemma":[0.99764234,0.0007859331,0.0006364491,0.00032037505,0.00053456676,0.000080338636],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037405448,0.00016912393,0.00042144122,0.00012919988,0.00006352805,0.000014173878,0.00018013317,0.00007559538,0.000011792963],"category_scores_gemma":[0.0010670559,0.00014085381,0.00005460694,0.00046692992,0.00016083322,0.00020499322,0.00003158592,0.00009826387,0.0000011761974],"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.00001237689,0.00022907792,0.001195706,0.00035061105,0.00004973788,0.0000037359973,0.0005973027,0.0000042615193,0.00018192275,0.9971103,0.00016746638,0.000097510354],"study_design_scores_gemma":[0.00043314934,0.00036565092,0.00019305151,0.00010857203,0.00004904733,0.000017617347,0.00049148407,0.000013224855,0.029654462,0.96827734,0.00024299654,0.00015338504],"about_ca_topic_score_codex":0.0000062105187,"about_ca_topic_score_gemma":0.000002502628,"teacher_disagreement_score":0.02947254,"about_ca_system_score_codex":0.00000940682,"about_ca_system_score_gemma":0.0000782127,"threshold_uncertainty_score":0.57438517},"labels":[],"label_agreement":null},{"id":"W2069058448","doi":"10.1007/s00026-011-0092-7","title":"Cyclic (v; r, s; λ) Difference Families with Two Base Blocks and v ≤ 50","year":2011,"lang":"en","type":"article","venue":"Annals of Combinatorics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Binary Golay code; Base (topology); Block (permutation group theory); Binary number; Autocorrelation; Difference set; Complementary sequences; Zero (linguistics); Block design","score_opus":0.03562129341861205,"score_gpt":0.22366915148860836,"score_spread":0.1880478580699963,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2069058448","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.9848805,0.0010941644,0.00035362574,0.000009757333,0.00016156722,0.000076133314,0.000004043798,0.00009497376,0.013325221],"genre_scores_gemma":[0.99947417,0.00032351335,0.000039353527,0.00002430868,0.000008365741,0.0000090707645,0.0000010615996,0.000017380322,0.0001028024],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994182,0.000024990662,0.00015777287,0.00010670293,0.00011664295,0.00017568062],"domain_scores_gemma":[0.9995575,0.00004361771,0.00003791508,0.0002222575,0.000059276415,0.000079444384],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012334988,0.00013335554,0.0001994913,0.00008716445,0.000035264286,0.000009308764,0.000121718935,0.000045198365,0.00001177118],"category_scores_gemma":[0.0000091188085,0.000111384725,0.00003039152,0.00017715846,0.000073957795,0.00006974122,0.000020118287,0.00009333958,0.0000030329315],"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.00016148268,0.0004499905,0.1265109,0.0007919947,0.00038554784,0.000052710868,0.007482126,0.0001420123,0.0072914017,0.8469612,0.0012352951,0.008535315],"study_design_scores_gemma":[0.0030707193,0.0015181735,0.15806143,0.00059301883,0.0001271437,0.000075433854,0.0020604741,0.002093501,0.29543006,0.5309013,0.004495181,0.0015735589],"about_ca_topic_score_codex":0.000040370855,"about_ca_topic_score_gemma":0.00000494482,"teacher_disagreement_score":0.31605992,"about_ca_system_score_codex":0.000002479053,"about_ca_system_score_gemma":0.0000054244465,"threshold_uncertainty_score":0.45421374},"labels":[],"label_agreement":null},{"id":"W2078935483","doi":"10.1007/s000260200006","title":"Enumeration of Rooted Cubic Planar Maps","year":2002,"lang":"en","type":"article","venue":"Annals of Combinatorics","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Enumeration; Combinatorics; Mathematics; Planar; Planar graph; Discrete mathematics; Computer science; Graph; Computer graphics (images)","score_opus":0.05856235887585335,"score_gpt":0.26827064313871196,"score_spread":0.20970828426285862,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2078935483","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.43063334,0.00502476,0.5162236,0.012586452,0.0008891002,0.00070681574,0.000052811665,0.00044478232,0.03343834],"genre_scores_gemma":[0.998757,0.0001315722,0.0007325241,0.00008019078,0.000008165517,0.000004967129,0.000007938747,0.0000041832864,0.0002734348],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9992882,0.00002531696,0.00023136732,0.00013030074,0.0002104241,0.000114377384],"domain_scores_gemma":[0.9991603,0.00004859197,0.00014592311,0.00044221227,0.00016049472,0.00004251018],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000117332325,0.000065679786,0.00012959755,0.0000791793,0.00004306697,0.000018033938,0.0004404023,0.000042806332,0.000015255189],"category_scores_gemma":[0.000021759912,0.00006804832,0.00005443069,0.00048636188,0.000024283952,0.00018162242,0.000045263954,0.000051825144,0.000032569336],"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":[7.644409e-7,0.00027411492,0.00028171708,0.000023089837,0.000012824998,0.0000015571437,0.0002844565,0.000020955777,0.004029445,0.9721068,0.016519373,0.006444879],"study_design_scores_gemma":[0.00073299505,0.00035602658,0.005151231,0.000052155294,0.000017023984,0.000011411107,0.000023901674,0.10938247,0.40871602,0.39845216,0.0767006,0.00040398922],"about_ca_topic_score_codex":0.000016591974,"about_ca_topic_score_gemma":7.91475e-7,"teacher_disagreement_score":0.57365465,"about_ca_system_score_codex":0.0000041508106,"about_ca_system_score_gemma":0.000011689545,"threshold_uncertainty_score":0.277493},"labels":[],"label_agreement":null},{"id":"W2079613279","doi":"10.1007/s00026-007-0306-1","title":"Multiplicity Free Expansions of Schur P-Functions","year":2007,"lang":"en","type":"article","venue":"Annals of Combinatorics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Multiplicity (mathematics); Mathematics; Symmetric group; Character (mathematics); Pure mathematics; Schur polynomial; Young tableau; Schur product theorem; Irreducible representation; Combinatorics; Symmetric function; Schur complement; Mathematical analysis; Macdonald polynomials; Schur decomposition; Physics; Geometry","score_opus":0.12291010467886175,"score_gpt":0.3901782875329132,"score_spread":0.26726818285405146,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2079613279","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.9312248,0.00019380561,0.046401933,0.0002867069,0.0012118907,0.00048713686,0.000033933495,0.00017117731,0.019988582],"genre_scores_gemma":[0.9927247,0.0000523582,0.0064072907,0.0000480761,0.000050396044,0.000010041134,0.0000028766174,0.000049300223,0.00065491966],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99762547,0.000050867984,0.0009980919,0.00023166064,0.0006801379,0.0004137981],"domain_scores_gemma":[0.9949102,0.0019107867,0.0006907744,0.0012353609,0.0010765173,0.00017636672],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001058394,0.00024113765,0.000601226,0.00024513502,0.00011010775,0.0000075318862,0.00060638523,0.00019536799,0.000044713404],"category_scores_gemma":[0.0057877777,0.0002410747,0.00023616492,0.0008055582,0.00015551715,0.00018296132,0.0002587482,0.0002656187,0.00001898385],"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.00004553582,0.0011759725,0.00037178575,0.00020233769,0.000063352185,0.0000052958876,0.00044108895,0.0000060991583,0.0022392848,0.9904959,0.0045777704,0.00037554957],"study_design_scores_gemma":[0.0007700589,0.00027130643,0.00031599205,0.00010032794,0.00003809699,0.000005140074,0.00040594593,0.000027890355,0.10056708,0.8960593,0.0012459812,0.00019290643],"about_ca_topic_score_codex":0.00002881185,"about_ca_topic_score_gemma":0.0000074575914,"teacher_disagreement_score":0.0983278,"about_ca_system_score_codex":0.00003019223,"about_ca_system_score_gemma":0.00008452567,"threshold_uncertainty_score":0.98307407},"labels":[],"label_agreement":null},{"id":"W2083140175","doi":"10.1007/s00026-005-0248-4","title":"Collinear Points in Permutations","year":2005,"lang":"en","type":"article","venue":"Annals of Combinatorics","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Combinatorics; Mathematics; Conjecture; Transversal (combinatorics); Prime (order theory); Upper and lower bounds; Intersection (aeronautics); Discrete geometry; Discrete mathematics","score_opus":0.03988005282922381,"score_gpt":0.3060809598074195,"score_spread":0.2662009069781957,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2083140175","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.90115404,0.0006153995,0.07049071,0.012851582,0.00037901485,0.00017375364,0.0000041445787,0.00013897778,0.0141923595],"genre_scores_gemma":[0.9976654,0.00005727579,0.0017283104,0.0004518188,0.000013542412,0.000004068643,7.168175e-7,0.0000034887378,0.00007539421],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99931824,0.00005355109,0.00018967078,0.00013019158,0.0001558989,0.00015247385],"domain_scores_gemma":[0.9993878,0.0001072406,0.000060908744,0.00027574136,0.00012146771,0.000046811427],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037378847,0.000063953376,0.000108872046,0.00018746771,0.000041093732,0.000025277506,0.00044637755,0.00003444271,0.000010308442],"category_scores_gemma":[0.000056321787,0.00006765362,0.000060583905,0.0008693828,0.000029636185,0.00028114027,0.000072556955,0.00008873252,0.000022019887],"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.0000032182102,0.00017707693,0.0014541753,0.0000045431534,0.0000043087935,0.0000022338675,0.00051678316,0.000098398785,0.000031847,0.9929337,0.0007451606,0.004028573],"study_design_scores_gemma":[0.00038164813,0.00013510497,0.0068220976,0.000023339733,0.0000019436184,0.0000029324856,0.000029875802,0.00906107,0.0066390783,0.95685625,0.019897943,0.00014874116],"about_ca_topic_score_codex":0.0000051573684,"about_ca_topic_score_gemma":0.000004208348,"teacher_disagreement_score":0.09651133,"about_ca_system_score_codex":0.000006321331,"about_ca_system_score_gemma":0.00003507138,"threshold_uncertainty_score":0.27588347},"labels":[],"label_agreement":null},{"id":"W2085879054","doi":"10.1007/s00026-012-0139-4","title":"Euler’s Pentagonal Number Theorem and the Rogers-Fine Identity","year":2012,"lang":"en","type":"article","venue":"Annals of Combinatorics","topic":"Analytic Number Theory Research","field":"Mathematics","cited_by":22,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Mathematics; Identity (music); Combinatorics; Euler's formula; Pure mathematics; Discrete mathematics; Mathematical analysis; Physics","score_opus":0.11591599875706804,"score_gpt":0.4068576232975202,"score_spread":0.29094162454045214,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2085879054","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.93916196,0.0010444205,0.0011181028,0.0026256642,0.00041237942,0.00035292344,0.000011316772,0.00004927601,0.05522395],"genre_scores_gemma":[0.9977313,0.00016469482,0.000094221905,0.00013305897,0.00009254667,0.000011219255,0.0000021392589,0.000026849744,0.0017439408],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979892,0.00034596812,0.00036802463,0.00014356892,0.0007044522,0.00044878022],"domain_scores_gemma":[0.9969575,0.0018979663,0.00019982358,0.00047219414,0.00030298834,0.00016956162],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004137513,0.00016332112,0.00037666544,0.000049987022,0.00013649948,0.000044461252,0.00041838194,0.0000813664,0.00050485367],"category_scores_gemma":[0.0013501134,0.000110305795,0.0001539829,0.00031390417,0.0005416883,0.00041093407,0.00031122117,0.00026011924,0.00010077982],"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.000085678344,0.00026012427,0.019809486,0.00006745466,0.00011674908,0.0000015774981,0.00060186075,6.680754e-8,0.000010052803,0.97090334,0.007959485,0.00018411745],"study_design_scores_gemma":[0.0010174391,0.000021123815,0.0018525796,0.000020272828,0.000052262534,0.000022317343,0.00026287074,0.000040965566,0.001125798,0.99411404,0.0013467707,0.00012353636],"about_ca_topic_score_codex":0.000026159201,"about_ca_topic_score_gemma":0.0000033699791,"teacher_disagreement_score":0.058569364,"about_ca_system_score_codex":0.000016548469,"about_ca_system_score_gemma":0.00003413182,"threshold_uncertainty_score":0.5527793},"labels":[],"label_agreement":null},{"id":"W2108209903","doi":"10.1007/s00026-008-0333-6","title":"Non-Holonomicity of Sequences Defined via Elementary Functions","year":2008,"lang":"en","type":"article","venue":"Annals of Combinatorics","topic":"Mathematics and Applications","field":"Mathematics","cited_by":20,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Mathematics; Sequence (biology); Logarithm; Riemann hypothesis; Elementary function; Riemann zeta function; Bounded function; Integer (computer science); Holonomic; Elementary proof; Function (biology); Combinatorics; Digamma function; Pure mathematics; Discrete mathematics; Arithmetic zeta function; Prime zeta function; Mathematical analysis","score_opus":0.1311582204646849,"score_gpt":0.34721702424579337,"score_spread":0.21605880378110848,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2108209903","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.98685163,0.000053613847,0.003891446,0.0004513889,0.000071478455,0.0002094695,0.000023497973,0.000024595027,0.008422876],"genre_scores_gemma":[0.996753,0.00012889625,0.0025183025,0.00006897074,0.0000136255385,0.000023417324,0.000008150286,0.000012612963,0.00047303247],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990724,0.000014686602,0.00045911988,0.00011729436,0.00019639263,0.00014010518],"domain_scores_gemma":[0.9987927,0.00021785146,0.00033261374,0.0003597422,0.00024166358,0.000055432174],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002243881,0.00010313435,0.0002769831,0.00007280669,0.000096973214,0.0000030619783,0.00020308964,0.000051037874,0.00009170441],"category_scores_gemma":[0.00008246043,0.00009849983,0.00010935582,0.0002418189,0.000100891666,0.0000586757,0.000051438998,0.00007297653,0.000022404598],"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.000026056696,0.0024336735,0.007377654,0.00047765984,0.00020473648,0.000004755681,0.0012901387,0.000016462407,0.0046136193,0.8444599,0.1387368,0.00035853664],"study_design_scores_gemma":[0.0002724117,0.00020173074,0.0009834713,0.00003161353,0.000034224046,0.000012050825,0.0001327415,0.00025374012,0.049670216,0.94575197,0.002513895,0.00014193788],"about_ca_topic_score_codex":0.00007985904,"about_ca_topic_score_gemma":0.0000031139873,"teacher_disagreement_score":0.1362229,"about_ca_system_score_codex":0.000008832394,"about_ca_system_score_gemma":0.00005891114,"threshold_uncertainty_score":0.40167066},"labels":[],"label_agreement":null},{"id":"W2123948060","doi":"10.1007/s00026-013-0177-6","title":"Multiplicity Free Schur, Skew Schur, and Quasisymmetric Schur Functions","year":2013,"lang":"en","type":"article","venue":"Annals of Combinatorics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Mathematics; Multiplicity (mathematics); Schur's theorem; Schur's lemma; Schur polynomial; Combinatorics; Skew; Schur algebra; Schur product theorem; Schur complement; Schur decomposition; Discrete mathematics; Pure mathematics; Macdonald polynomials; Orthogonal polynomials; Mathematical analysis; Computer science; Discrete orthogonal polynomials; Gegenbauer polynomials; Classical orthogonal polynomials","score_opus":0.09868087161366132,"score_gpt":0.3444571678942561,"score_spread":0.2457762962805948,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2123948060","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.9654479,0.0015400914,0.010499267,0.0018070493,0.0014841604,0.0014912589,0.00003452044,0.0004160041,0.017279757],"genre_scores_gemma":[0.98814213,0.00046388604,0.008699775,0.00019243111,0.00009642662,0.00013120839,0.000005111841,0.00009674641,0.0021722524],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99690026,0.00013750183,0.0009773205,0.0004931391,0.0008372241,0.0006545565],"domain_scores_gemma":[0.9943462,0.0018343217,0.0006517753,0.0014877147,0.001300163,0.00037985286],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00064152,0.00046696127,0.00085846515,0.00050336745,0.0002842891,0.000107096894,0.00075377966,0.0003159726,0.00018517216],"category_scores_gemma":[0.007781231,0.0004566024,0.0002168581,0.001488676,0.00021206729,0.0006888844,0.0005364157,0.00050315727,0.0002873814],"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.000017079708,0.0010089375,0.0008260188,0.0003787838,0.00012038107,0.0000038760663,0.00020491546,0.0000019552494,0.00033110066,0.9695029,0.025418324,0.00218572],"study_design_scores_gemma":[0.0013596581,0.00040429222,0.00094672234,0.00012271774,0.000070003865,0.000014254447,0.00025163766,0.0002496422,0.005098887,0.9879611,0.0030643055,0.00045673855],"about_ca_topic_score_codex":0.000113016176,"about_ca_topic_score_gemma":0.0000035202413,"teacher_disagreement_score":0.022694271,"about_ca_system_score_codex":0.000053227526,"about_ca_system_score_gemma":0.00008579093,"threshold_uncertainty_score":0.9997886},"labels":[],"label_agreement":null},{"id":"W2129157321","doi":"10.1007/s00026-008-0354-1","title":"Equality of Schur’s Q-functions and Their Skew Analogues","year":2008,"lang":"en","type":"article","venue":"Annals of Combinatorics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Mathematics; Skew; Schur polynomial; Schur's theorem; Combinatorics; Schur product theorem; Schur complement; Pure mathematics; Schur decomposition; Algebra over a field; Macdonald polynomials; Orthogonal polynomials; Eigenvalues and eigenvectors; Physics; Classical orthogonal polynomials","score_opus":0.20468442641266224,"score_gpt":0.3693505572050558,"score_spread":0.16466613079239353,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2129157321","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.982933,0.0007717204,0.009898765,0.00024828067,0.00044947746,0.00027227492,0.00004216208,0.000097895085,0.0052864426],"genre_scores_gemma":[0.99757755,0.00049820944,0.0013998079,0.00002798325,0.000030417106,0.000010043609,0.0000046001073,0.000031450465,0.00041992278],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984021,0.00010965154,0.00072085287,0.00021123889,0.00029487046,0.00026127527],"domain_scores_gemma":[0.99700564,0.0010477763,0.0005525592,0.00061282335,0.00066500285,0.00011620702],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000546665,0.00022852496,0.0006764089,0.00014424066,0.00012676427,0.0000063575994,0.0002581935,0.00013462034,0.000013484849],"category_scores_gemma":[0.001320162,0.00019896228,0.00015152842,0.00047632487,0.00029519206,0.00018376643,0.00014764738,0.0001848472,0.000003883198],"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.000018631577,0.00059092604,0.0008059892,0.000328467,0.00008266774,0.000002051232,0.0008759429,0.0000012216168,0.00039372014,0.99453,0.002093018,0.00027734236],"study_design_scores_gemma":[0.00042293002,0.00025972608,0.00045316332,0.0000764862,0.000022805996,0.000014063152,0.000264463,0.0000381794,0.022846855,0.9742307,0.0011900451,0.00018054908],"about_ca_topic_score_codex":0.00001316993,"about_ca_topic_score_gemma":0.0000023195612,"teacher_disagreement_score":0.022453135,"about_ca_system_score_codex":0.000014985223,"about_ca_system_score_gemma":0.00007229292,"threshold_uncertainty_score":0.8113447},"labels":[],"label_agreement":null},{"id":"W2162642412","doi":"10.1007/s00026-018-0386-0","title":"Structure Constants for Immaculate Functions","year":2018,"lang":"en","type":"preprint","venue":"Annals of Combinatorics","topic":"Algebraic structures and combinatorial models","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Counterexample; Conjecture; Mathematics; Structure constants; Combinatorics; Constant (computer programming); Pure mathematics; Computer science","score_opus":0.14499042224046604,"score_gpt":0.3904841412765162,"score_spread":0.24549371903605016,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2162642412","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.9784968,0.0007683685,0.0029838674,0.00050512323,0.011503113,0.0015789202,0.00080724707,0.00017523486,0.003181326],"genre_scores_gemma":[0.99766755,0.00010912905,0.00049532356,0.00015515686,0.00046950544,0.00006431234,0.00009931719,0.000102280785,0.00083744177],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99737483,0.00007714238,0.0008523205,0.00060747954,0.00057981076,0.00050842046],"domain_scores_gemma":[0.99551827,0.0004895112,0.00094051653,0.0011487154,0.0017246744,0.00017833634],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00033197567,0.0005410431,0.0010156425,0.00018740633,0.00019487285,0.00007238871,0.0007356677,0.00084697024,0.00018139459],"category_scores_gemma":[0.0007801302,0.00051167526,0.0005527818,0.00022624028,0.00021278276,0.000075198775,0.00059755374,0.0005510587,0.000006615631],"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.00013045021,0.00012656927,0.00008621051,0.000650489,0.00042450294,0.0000020344723,0.00023853924,0.000017066366,0.000030874642,0.9644505,0.03360758,0.00023522419],"study_design_scores_gemma":[0.0007115266,0.00033082682,0.00004987903,0.00020323294,0.00019526517,0.000005380976,0.0000624187,0.00011346382,0.00520452,0.98888946,0.0037500148,0.0004840367],"about_ca_topic_score_codex":0.000027621374,"about_ca_topic_score_gemma":0.0000027621172,"teacher_disagreement_score":0.029857567,"about_ca_system_score_codex":0.000044294848,"about_ca_system_score_gemma":0.00040990935,"threshold_uncertainty_score":0.9997335},"labels":[],"label_agreement":null},{"id":"W2270530270","doi":"10.1007/s00026-016-0303-3","title":"The Pieri Rule for Dual Immaculate Quasi-Symmetric Functions","year":2016,"lang":"en","type":"article","venue":"Annals of Combinatorics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Fields Institute for Research in Mathematical Sciences; University of Toronto; York University","funders":"","keywords":"Multiplicity (mathematics); Symmetric function; Basis (linear algebra); Dual (grammatical number); Lift (data mining)","score_opus":0.09971775421731881,"score_gpt":0.3650536561550194,"score_spread":0.26533590193770057,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2270530270","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.67781824,0.0028535663,0.2486451,0.021379901,0.014264233,0.0048790593,0.00028541882,0.0009799425,0.028894529],"genre_scores_gemma":[0.9898201,0.0003848478,0.0013682416,0.0000615138,0.000151028,0.00017198893,0.0000026093176,0.00008918384,0.00795049],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99787974,0.00007985454,0.0007211412,0.00026417873,0.00052261684,0.00053244754],"domain_scores_gemma":[0.9919783,0.005557772,0.0005442732,0.00082957314,0.0009501686,0.00013993439],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008264792,0.00026159151,0.00044417553,0.00014998125,0.00037595685,0.00003918464,0.0004421603,0.00014113734,0.000017566881],"category_scores_gemma":[0.006274951,0.00015757278,0.00029017797,0.00067532517,0.00015759928,0.00020349727,0.00013671457,0.00012153489,0.000060356113],"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.00006586068,0.0005257182,0.000030051036,0.00007750457,0.00009644695,0.000001920453,0.00007275219,4.28522e-7,0.00028387716,0.98338705,0.009825566,0.005632836],"study_design_scores_gemma":[0.0009852923,0.00062379614,0.000026742147,0.00006312832,0.00005011581,0.0000092680475,0.00009232373,0.000033439883,0.00909601,0.9499709,0.03882876,0.00022020149],"about_ca_topic_score_codex":0.0000031601162,"about_ca_topic_score_gemma":9.870103e-7,"teacher_disagreement_score":0.31200185,"about_ca_system_score_codex":0.00005064999,"about_ca_system_score_gemma":0.00010216075,"threshold_uncertainty_score":0.7512156},"labels":[],"label_agreement":null},{"id":"W2301470204","doi":"10.1007/s00026-016-0316-y","title":"Pairwise Balanced Designs Covered by Bounded Flats","year":2016,"lang":"en","type":"article","venue":"Annals of Combinatorics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Mathematics; Bounded function; Pairwise comparison; Combinatorics; Divisibility rule; Dimension (graph theory); Upper and lower bounds; Constant (computer programming); Point (geometry); Discrete mathematics; Geometry; Mathematical analysis; Statistics; Computer science","score_opus":0.0342408080177925,"score_gpt":0.24268675503997775,"score_spread":0.20844594702218525,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2301470204","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.9787466,0.0019901013,0.0066552674,0.00023000424,0.0014360992,0.00022018272,0.000072047056,0.00036035484,0.01028937],"genre_scores_gemma":[0.9987951,0.0003247116,0.000009217707,0.000047348705,0.000019104913,0.000012494438,0.0000040982395,0.000028566898,0.00075935293],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9990903,0.00005625578,0.00026590217,0.00012429628,0.0001883094,0.00027490308],"domain_scores_gemma":[0.9993219,0.000117784475,0.0000614933,0.0003011496,0.000096188945,0.000101503174],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026580947,0.00014952882,0.00024690974,0.00005846854,0.00003830556,0.000014480927,0.00020644769,0.000103665465,0.00004134621],"category_scores_gemma":[0.00004677267,0.00011844186,0.000093868264,0.00020781918,0.00004738946,0.00015072557,0.000016269647,0.000060177612,0.000050328574],"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.00011221947,0.0002809108,0.00469646,0.00035163024,0.0003446202,0.000014976785,0.0003965877,0.00008991039,0.19598557,0.42791057,0.3645778,0.0052387537],"study_design_scores_gemma":[0.0015387662,0.00026257074,0.0011016583,0.00020808795,0.000017879449,0.000004488154,0.00004162767,0.00022424737,0.53040797,0.39343983,0.07222617,0.00052671303],"about_ca_topic_score_codex":0.0000030047554,"about_ca_topic_score_gemma":3.8466266e-7,"teacher_disagreement_score":0.3344224,"about_ca_system_score_codex":0.000016584801,"about_ca_system_score_gemma":0.00001264991,"threshold_uncertainty_score":0.48299187},"labels":[],"label_agreement":null},{"id":"W2416971272","doi":"10.1007/s00026-016-0320-2","title":"Increasing Tableaux, Narayana Numbers and an Instance of the Cyclic Sieving Phenomenon","year":2016,"lang":"en","type":"article","venue":"Annals of Combinatorics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":18,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg; University of British Columbia","funders":"","keywords":"Bijection; Young tableau; Mathematics; Combinatorics; Set (abstract data type); Hook; Phenomenon; Computer science; Physics","score_opus":0.08599639696818732,"score_gpt":0.3640545911969639,"score_spread":0.27805819422877653,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2416971272","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.9933596,0.0003249743,0.0014320948,0.00034471962,0.00039342412,0.000290013,0.0000099663,0.00005110154,0.003794074],"genre_scores_gemma":[0.997627,0.00023787476,0.001841396,0.000047470476,0.00003731208,0.000007701287,3.313016e-7,0.000048920214,0.00015195848],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980754,0.00020278271,0.000652483,0.00024621282,0.00048856187,0.00033455904],"domain_scores_gemma":[0.99660146,0.0013120824,0.00076765177,0.00083473034,0.0003696245,0.00011442158],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000895352,0.0002313491,0.0005273872,0.00007956899,0.00011500525,0.00001606909,0.0005034172,0.00011275473,0.000008722546],"category_scores_gemma":[0.0021912016,0.00015280457,0.000092758135,0.00044996195,0.00024250905,0.00041367928,0.00022271695,0.00013579194,0.0000012959676],"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.000041195693,0.0003229303,0.0031985336,0.00030419667,0.000044550427,0.0000011806029,0.0008810973,0.0000018305498,0.007432134,0.986091,0.00016124257,0.0015200978],"study_design_scores_gemma":[0.000645438,0.00015142205,0.00047936628,0.00050039036,0.00003140484,0.000007167491,0.00023279364,0.000022544595,0.025051778,0.9721625,0.00051463017,0.00020056522],"about_ca_topic_score_codex":0.000020700274,"about_ca_topic_score_gemma":0.000006574721,"teacher_disagreement_score":0.017619643,"about_ca_system_score_codex":0.00004450315,"about_ca_system_score_gemma":0.00006289924,"threshold_uncertainty_score":0.62311894},"labels":[],"label_agreement":null},{"id":"W2548453003","doi":"10.1007/s00026-018-0399-8","title":"Jacobi-Trudi Determinants over Finite Fields","year":2018,"lang":"en","type":"article","venue":"Annals of Combinatorics","topic":"Random Matrices and Applications","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Homomorphism; Zero (linguistics); Finite field; Probability density function; Symmetric function; Probability measure; Field (mathematics); Ring (chemistry); Free probability","score_opus":0.10706229307269852,"score_gpt":0.4013147023097788,"score_spread":0.2942524092370803,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2548453003","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.9780579,0.0001529037,0.0024443176,0.00057964027,0.00031377474,0.00021755716,0.0000137142,0.00005851217,0.018161645],"genre_scores_gemma":[0.99772125,0.00016014806,0.00032704492,0.00021981778,0.00010056206,0.000014745395,0.0000011534765,0.000016576609,0.0014387004],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990998,0.00002487781,0.00031930525,0.00014312306,0.00020676492,0.00020613268],"domain_scores_gemma":[0.9985689,0.0004722104,0.00020710765,0.00041471943,0.00027112736,0.000065964865],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024687662,0.00011181183,0.00023868207,0.0000647401,0.00009373101,0.00001876075,0.00024919017,0.00010012839,0.00012684175],"category_scores_gemma":[0.00026400766,0.00009997016,0.00010171555,0.0002978763,0.00007050889,0.000086342145,0.00006789126,0.00008565463,0.000052416588],"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.00006660951,0.000653683,0.0052662357,0.00021431418,0.00006809052,0.0000057440307,0.00073787663,0.0000014161816,0.00012758064,0.82945675,0.15811771,0.005283966],"study_design_scores_gemma":[0.000673256,0.00022053864,0.002052017,0.00004056739,0.000028303408,0.0000021176002,0.000027258262,0.00046010502,0.013424755,0.9437309,0.03916486,0.00017532805],"about_ca_topic_score_codex":0.00001814509,"about_ca_topic_score_gemma":0.00000873416,"teacher_disagreement_score":0.118952855,"about_ca_system_score_codex":0.0000047627227,"about_ca_system_score_gemma":0.000024180865,"threshold_uncertainty_score":0.40766647},"labels":[],"label_agreement":null},{"id":"W2890957687","doi":"10.1007/s00026-020-00500-9","title":"Combinatorial Interpretations of Lucas Analogues of Binomial Coefficients and Catalan Numbers","year":2020,"lang":"en","type":"article","venue":"Annals of Combinatorics","topic":"Advanced Mathematical Theories and Applications","field":"Physics and Astronomy","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Catalan number; Binomial coefficient; Fibonacci number; Unimodality; Natural number; Quotient; Sequence (biology); Lucas number; Integer sequence; Integer (computer science)","score_opus":0.03722687948889762,"score_gpt":0.31405885879235124,"score_spread":0.2768319793034536,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2890957687","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.9528937,0.00007491928,0.037591256,0.0005252876,0.00014779589,0.00024867483,0.0002659289,0.000014564967,0.008237919],"genre_scores_gemma":[0.9996986,0.000008010058,0.00019375113,0.000020710464,0.00002595706,0.0000060807824,0.000029642533,0.000008103637,0.000009180744],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993175,0.000018208057,0.00033361668,0.00011032904,0.00012068993,0.000099645506],"domain_scores_gemma":[0.9991854,0.00015526131,0.00024645677,0.00013599511,0.00019531886,0.00008159593],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000066300665,0.000086131484,0.00028141562,0.000026514455,0.00003316453,0.0000050556077,0.00013250372,0.000024764122,0.00002244873],"category_scores_gemma":[0.00004517364,0.000083684805,0.00007421741,0.0002452516,0.00016778166,0.000058485406,0.00006933296,0.0000633947,0.0000015954414],"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.000020193613,0.00022894634,0.002065154,0.000062446554,0.000044051147,6.615973e-8,0.00073540944,0.000029058565,0.00048393276,0.9956345,0.00018156909,0.00051468145],"study_design_scores_gemma":[0.00062360335,0.00022638834,0.00032580583,0.00003923349,0.000037865604,1.1918966e-7,0.0006850723,0.00054430956,0.04352461,0.9528538,0.0010207422,0.00011843798],"about_ca_topic_score_codex":0.000029571536,"about_ca_topic_score_gemma":1.2319576e-7,"teacher_disagreement_score":0.04680491,"about_ca_system_score_codex":0.0000018877585,"about_ca_system_score_gemma":0.000029948427,"threshold_uncertainty_score":0.3412567},"labels":[],"label_agreement":null},{"id":"W2950502640","doi":"10.1007/s00026-011-0119-0","title":"Words and Polynomial Invariants of Finite Groups in Non-Commutative Variables","year":2011,"lang":"en","type":"article","venue":"Annals of Combinatorics","topic":"Finite Group Theory Research","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal; York University","funders":"","keywords":"Commutative property; Polynomial; Mathematics; Polynomial ring; Algebra over a field; Pure mathematics; Computer science; Mathematical analysis","score_opus":0.16412395927445902,"score_gpt":0.35839393991028834,"score_spread":0.19426998063582931,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2950502640","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.98186237,0.00013364856,0.00070338,0.00005883928,0.00011302851,0.00026035437,0.000026786978,0.0000138951655,0.016827725],"genre_scores_gemma":[0.99847704,0.00012807854,0.0011970504,0.000032056043,0.000010831868,0.00001269036,0.0000028214438,0.000027946156,0.00011151109],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983674,0.00025420485,0.0005561776,0.00018787505,0.00031243352,0.00032187958],"domain_scores_gemma":[0.99713165,0.0018584325,0.00027862244,0.00039951556,0.00024193937,0.00008985664],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017435239,0.00016676215,0.0005097787,0.00034980013,0.000034917502,0.000010095821,0.00037844403,0.00014384947,0.00007440686],"category_scores_gemma":[0.0014654502,0.00016415441,0.000059596987,0.0006182842,0.00023426698,0.00019824802,0.00026077684,0.0002713908,0.00000448408],"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.000479597,0.0013050972,0.0153789185,0.00047682834,0.00011154741,0.000028438872,0.021332348,0.0000014463172,0.0004757834,0.95886123,0.00085963996,0.0006891062],"study_design_scores_gemma":[0.0010728895,0.00048730258,0.012061369,0.00015648323,0.000013946041,0.000002505252,0.0009354198,0.00024952716,0.014140919,0.97068805,0.000025579226,0.00016600268],"about_ca_topic_score_codex":0.00017259145,"about_ca_topic_score_gemma":0.00001611425,"teacher_disagreement_score":0.020396927,"about_ca_system_score_codex":0.0000138789155,"about_ca_system_score_gemma":0.00006853543,"threshold_uncertainty_score":0.66940224},"labels":[],"label_agreement":null},{"id":"W2963227754","doi":"10.1007/s00026-017-0341-5","title":"On the Convergence of Monotone Hurwitz Generating Functions","year":2017,"lang":"en","type":"article","venue":"Annals of Combinatorics","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal; University of Waterloo","funders":"","keywords":"Monotone polygon; Mathematics; Hurwitz polynomial; Hurwitz matrix; Routh–Hurwitz stability criterion; Combinatorics; Algebraic number; Discrete mathematics; Genus; Pure mathematics; Polynomial; Mathematical analysis; Geometry","score_opus":0.06432653068586572,"score_gpt":0.3003179496197319,"score_spread":0.2359914189338662,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963227754","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.8864531,0.00009083305,0.10336257,0.0048275865,0.0015610991,0.00010410535,0.0000022133866,0.00002526802,0.0035732116],"genre_scores_gemma":[0.99908584,0.00002137895,0.0002481427,0.0002826479,0.00003568981,0.0000046918008,4.5131637e-7,0.0000030990989,0.0003180321],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992997,0.000035820045,0.00019487223,0.00013581777,0.00021626451,0.000117515745],"domain_scores_gemma":[0.99859655,0.00018088263,0.00031945997,0.00066058926,0.0002040595,0.000038471564],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002839203,0.0000712947,0.00011816142,0.00003717214,0.00032464997,0.000060893424,0.00087607617,0.000027535838,0.000009793162],"category_scores_gemma":[0.0002776538,0.00005321099,0.00006370379,0.000109969464,0.00007636371,0.00021674039,0.00019016107,0.00007346312,0.000019082805],"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.000003621136,0.00006874242,0.0001692292,0.000005161205,0.000012526315,8.698771e-7,0.0001476253,0.00033963774,0.0006098852,0.9897181,0.00298713,0.0059375092],"study_design_scores_gemma":[0.00025669072,0.0003953972,0.0060565826,0.000046098994,0.000005373292,0.0000021114374,0.000022667427,0.11504872,0.075042546,0.80163926,0.0013300745,0.00015449307],"about_ca_topic_score_codex":0.00006871199,"about_ca_topic_score_gemma":9.975895e-7,"teacher_disagreement_score":0.18807882,"about_ca_system_score_codex":0.000003997553,"about_ca_system_score_gemma":0.000056309498,"threshold_uncertainty_score":0.24969779},"labels":[],"label_agreement":null},{"id":"W2964331347","doi":"10.1007/s00026-018-0404-2","title":"Combinatorial Aspects of the Quantized Universal Enveloping Algebra of $$\\mathfrak {sl}_{n+1}$$ sl n + 1","year":2018,"lang":"en","type":"article","venue":"Annals of Combinatorics","topic":"Advanced Topics in Algebra","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Hopf algebra; Universal enveloping algebra; Formalism (music); Algebra over a field; Algebraic structure; Lie algebra; Pure mathematics; Algebraic number; Constructive; Triangular matrix; R-matrix; Combinatorics; Physics; Computer science","score_opus":0.08288234115192465,"score_gpt":0.35190584508186223,"score_spread":0.26902350392993757,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2964331347","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.9664542,0.00021836234,0.0019766975,0.0006096491,0.0036065849,0.0005034823,0.000024657324,0.00007705811,0.026529314],"genre_scores_gemma":[0.9982891,0.00007966017,0.0012629995,0.00005866482,0.00013615271,0.00000381858,0.0000019705133,0.000049319333,0.00011831849],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973411,0.0001934405,0.00093806715,0.00028792233,0.0008450972,0.00039435655],"domain_scores_gemma":[0.9954068,0.00094071333,0.0012230531,0.0010873342,0.0012533395,0.00008874379],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00069677905,0.00028091096,0.0007846857,0.00016861629,0.00013006711,0.0000104130795,0.001016691,0.00022846936,0.00005855522],"category_scores_gemma":[0.0019383711,0.0002403895,0.00029678285,0.00089640747,0.00068942516,0.0001869629,0.0004224579,0.00029963575,0.0000066790917],"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.00006851495,0.00040057968,0.00058418664,0.0002680097,0.0001225455,0.0000023351438,0.0007030058,8.290405e-7,0.0015735351,0.9952228,0.0009096618,0.00014401329],"study_design_scores_gemma":[0.0010408746,0.00029480297,0.00048613566,0.00019743798,0.000044120938,0.000002410484,0.00014135885,0.000028164468,0.23425917,0.76180166,0.0015303787,0.0001734534],"about_ca_topic_score_codex":0.000024841791,"about_ca_topic_score_gemma":0.0000051065495,"teacher_disagreement_score":0.2334211,"about_ca_system_score_codex":0.000045185916,"about_ca_system_score_gemma":0.00025668327,"threshold_uncertainty_score":0.98028},"labels":[],"label_agreement":null},{"id":"W3037073401","doi":"10.1007/s00026-021-00528-5","title":"On Conjectures Concerning the Smallest Part and Missing Parts of Integer Partitions","year":2021,"lang":"en","type":"article","venue":"Annals of Combinatorics","topic":"Advanced Mathematical Identities","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Mathematics; Conjecture; Combinatorics; Integer (computer science); Interval (graph theory); Discrete mathematics; Computer science","score_opus":0.18747693735937845,"score_gpt":0.3792750838047882,"score_spread":0.19179814644540974,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3037073401","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.9460434,0.0037695908,0.008960118,0.005348968,0.00052117766,0.0003659724,0.000040069397,0.00007875914,0.03487198],"genre_scores_gemma":[0.99850166,0.00021399993,0.00035437485,0.00018402589,0.000017956365,0.000008600125,0.0000022886,0.000015247399,0.00070182537],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990103,0.000086253,0.00037381757,0.00012697453,0.0002425648,0.00016006792],"domain_scores_gemma":[0.9967271,0.0023215148,0.00023856643,0.00030592427,0.00035509176,0.000051790084],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028882487,0.000114334485,0.00030673866,0.00003099366,0.00009966906,0.000026682728,0.00010654848,0.000053154992,0.00008985622],"category_scores_gemma":[0.002758689,0.000085472035,0.0000765734,0.00013743271,0.00024556142,0.00005801489,0.000082303486,0.00014197652,0.0000020779864],"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.000006194096,0.00013038644,0.00010813568,0.00019311358,0.000043858272,0.0000064200844,0.0006487547,0.00002635173,0.000117682655,0.9937828,0.004839633,0.00009663444],"study_design_scores_gemma":[0.00015443651,0.00006214383,0.00007137184,0.00031808714,0.000031854852,0.0000068839176,0.0005674474,0.000045654393,0.03876743,0.9586537,0.001238662,0.00008233578],"about_ca_topic_score_codex":0.0000027626354,"about_ca_topic_score_gemma":0.0000048052098,"teacher_disagreement_score":0.052458316,"about_ca_system_score_codex":0.000006111236,"about_ca_system_score_gemma":0.000044619745,"threshold_uncertainty_score":0.34854484},"labels":[],"label_agreement":null},{"id":"W3122484752","doi":"10.1007/s00026-015-0279-4","title":"New Steps in Walks with Small Steps in the Quarter Plane: Series Expressions for the Generating Functions","year":2015,"lang":"en","type":"article","venue":"Annals of Combinatorics","topic":"Mathematics and Applications","field":"Mathematics","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Mathematics; Transcendental function; Series (stratigraphy); Transcendental number; Quarter (Canadian coin); Transcendental equation; Algebraic number; Plane (geometry); Combinatorics; Pure mathematics; Mathematical analysis; Geometry; Differential equation","score_opus":0.21837541721257075,"score_gpt":0.35031530430843416,"score_spread":0.1319398870958634,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3122484752","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.7918894,0.0012466181,0.14934151,0.033629175,0.00049092364,0.00531122,0.00010743835,0.00012500318,0.017858706],"genre_scores_gemma":[0.98723114,0.000037456637,0.009926618,0.00027606488,0.00007131391,0.00047850588,0.000012545032,0.00002959186,0.0019367628],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99903077,0.00006104256,0.00035682844,0.00012932652,0.0002309126,0.00019112707],"domain_scores_gemma":[0.9980731,0.0010403944,0.0001783388,0.00047996448,0.00016874813,0.00005944531],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007358153,0.00012784102,0.00020210778,0.00005816393,0.000121721554,0.000051033196,0.00032344772,0.00006010629,0.0000085968995],"category_scores_gemma":[0.00026208008,0.000070461385,0.000046408102,0.00030683557,0.000032997898,0.00007638646,0.00003703273,0.00015718454,0.0000037039708],"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.000047138652,0.00048661025,0.00042787526,0.00010333631,0.000035335306,0.0000021335384,0.010184188,0.00019183721,0.00007357224,0.83148,0.15646854,0.0004994203],"study_design_scores_gemma":[0.0013385834,0.00046740336,0.0002645667,0.00018514528,0.00004901399,0.00001797641,0.021425057,0.0016452405,0.0007103283,0.92958724,0.04405543,0.00025401707],"about_ca_topic_score_codex":0.00008015197,"about_ca_topic_score_gemma":0.00030493745,"teacher_disagreement_score":0.19534174,"about_ca_system_score_codex":0.00001001996,"about_ca_system_score_gemma":0.00012088087,"threshold_uncertainty_score":0.2873332},"labels":[],"label_agreement":null},{"id":"W3217522557","doi":"10.1007/s00026-021-00565-0","title":"Orthosymplectic Cauchy Identities","year":2022,"lang":"en","type":"preprint","venue":"Annals of Combinatorics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Symplectic geometry; Bijection; Identity (music); Cauchy distribution; Pure mathematics; Mathematical proof; Algebra over a field; Discrete mathematics; Mathematical analysis; Physics; Geometry","score_opus":0.22839654500683038,"score_gpt":0.43561466838163254,"score_spread":0.20721812337480217,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3217522557","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.8763019,0.0061712903,0.011196643,0.0014758551,0.028234567,0.003985568,0.0004901528,0.0015419757,0.07060207],"genre_scores_gemma":[0.9899283,0.0009945771,0.0029119402,0.00013209086,0.00021010544,0.00035195166,0.00006173033,0.000277812,0.0051314575],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99541926,0.00031446648,0.0014422266,0.0006816459,0.0015110984,0.00063128077],"domain_scores_gemma":[0.9935065,0.0014599125,0.0017636982,0.0022000917,0.0008976267,0.00017220879],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013021599,0.0006457806,0.0014853582,0.00044790778,0.00022941372,0.00008268553,0.001510398,0.00041121125,0.0004574842],"category_scores_gemma":[0.0030550205,0.0007385547,0.00061866845,0.0006421372,0.00014919526,0.00017023883,0.0030111792,0.0014715941,0.000014507175],"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.00002168297,0.0007516449,0.00029449447,0.0023542515,0.0002622071,0.00003740962,0.00074750656,0.000092448696,0.00000846602,0.9748482,0.020483933,0.00009772123],"study_design_scores_gemma":[0.00036814756,0.00023368913,0.000042533324,0.00021627547,0.00015570407,0.000010173523,0.00023159898,0.00007369514,0.0015477281,0.9912566,0.005224712,0.00063912023],"about_ca_topic_score_codex":0.00003835603,"about_ca_topic_score_gemma":0.0000047114586,"teacher_disagreement_score":0.11362646,"about_ca_system_score_codex":0.00017102256,"about_ca_system_score_gemma":0.00035377886,"threshold_uncertainty_score":0.99950653},"labels":[],"label_agreement":null},{"id":"W4307818955","doi":"10.1007/s00026-022-00612-4","title":"Asymptotics, Turán Inequalities, and the Distribution of the BG-Rank and 2-Quotient Rank of Partitions","year":2022,"lang":"en","type":"article","venue":"Annals of Combinatorics","topic":"Advanced Mathematical Identities","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"Pacific Institute for the Mathematical Sciences","keywords":"Mathematics; Quotient; Combinatorics; Equidistributed sequence; Rank (graph theory); Modulo; Order (exchange); Congruence (geometry); Distribution (mathematics); Congruence relation; Mathematical analysis; Geometry","score_opus":0.06769995959202396,"score_gpt":0.32208528999058267,"score_spread":0.2543853303985587,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4307818955","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.99240553,0.0015397796,0.0017407305,0.0021419101,0.00025307553,0.0005283564,0.00035739728,0.000019597506,0.0010136433],"genre_scores_gemma":[0.9991712,0.0002990538,0.00007359649,0.00003905923,0.0000072026937,0.000028909584,0.000008128939,0.00001093614,0.00036189985],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985431,0.00022374849,0.00054448127,0.00010108916,0.00044583596,0.00014174446],"domain_scores_gemma":[0.9975384,0.0013777933,0.00044450522,0.0003555513,0.00025137345,0.000032415457],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00085069623,0.000105249754,0.00036089274,0.000031662286,0.00018185451,0.000009682365,0.00020776414,0.000032165746,0.000020563753],"category_scores_gemma":[0.0013658573,0.00007005638,0.00009963066,0.0002291771,0.0005906611,0.000076201046,0.00035222163,0.00015238149,1.5950616e-7],"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.00003138677,0.00021289237,0.00029866528,0.00042942003,0.00004485222,2.3130643e-7,0.0013605832,0.000031859232,0.000020162022,0.99589646,0.0016482477,0.000025255433],"study_design_scores_gemma":[0.00072142074,0.0000946203,0.00061793486,0.00006205904,0.000084441206,0.0000035843736,0.0014595389,0.00015518987,0.0030732772,0.99308205,0.0005754401,0.00007045642],"about_ca_topic_score_codex":0.000023644889,"about_ca_topic_score_gemma":0.000002523087,"teacher_disagreement_score":0.0067657037,"about_ca_system_score_codex":0.000015867314,"about_ca_system_score_gemma":0.00003299059,"threshold_uncertainty_score":0.28568164},"labels":[],"label_agreement":null},{"id":"W4313532189","doi":"10.1007/s00026-022-00632-0","title":"On Antipodes of Immaculate Functions","year":2022,"lang":"en","type":"article","venue":"Annals of Combinatorics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Mathematics; Combinatorics; Basis (linear algebra); Noncommutative geometry; Algebraic number; Symmetric function; Integer (computer science); Pure mathematics; Geometry; Mathematical analysis","score_opus":0.1193662415266335,"score_gpt":0.37469372083097435,"score_spread":0.25532747930434085,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4313532189","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.983137,0.00014387109,0.0012090986,0.00028899024,0.0011172575,0.0003164619,0.00004649793,0.00008630435,0.013654504],"genre_scores_gemma":[0.9984139,0.000029253571,0.00032142957,0.000070136164,0.000015663541,0.000032642056,0.0000050338754,0.000042261945,0.0010696795],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99813503,0.000116903924,0.00058615755,0.00018832572,0.000732204,0.00024140015],"domain_scores_gemma":[0.99745065,0.0009547574,0.00056561414,0.0006279357,0.0003339862,0.00006703051],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052349846,0.00017559167,0.00046499236,0.00019769881,0.00017055562,0.00000577909,0.000389734,0.000049983166,0.00018739895],"category_scores_gemma":[0.0009293115,0.00018354986,0.00019268155,0.00064681895,0.00007113097,0.00007833142,0.00023653543,0.00025581763,0.000012087265],"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.00007624441,0.0011509359,0.000060373794,0.00013393023,0.0000682201,0.0000053145855,0.00030852103,0.00022658349,0.00046008997,0.9925896,0.004748646,0.00017153219],"study_design_scores_gemma":[0.00051730656,0.0009423327,0.00002982297,0.000034111068,0.00003091469,0.0000065768977,0.00031707194,0.00009036529,0.017187322,0.97896546,0.0017208684,0.00015785742],"about_ca_topic_score_codex":0.000006380345,"about_ca_topic_score_gemma":1.4965636e-7,"teacher_disagreement_score":0.016727231,"about_ca_system_score_codex":0.0000330069,"about_ca_system_score_gemma":0.000070299175,"threshold_uncertainty_score":0.74849457},"labels":[],"label_agreement":null},{"id":"W4378652164","doi":"10.1007/s00026-023-00648-0","title":"Folding Rotationally Symmetric Tableaux via Webs","year":2023,"lang":"en","type":"article","venue":"Annals of Combinatorics","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Folding (DSP implementation); Young tableau; Symmetric group; Engineering","score_opus":0.05881549500033758,"score_gpt":0.31459645918067025,"score_spread":0.2557809641803327,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4378652164","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.08124344,0.0015944568,0.896248,0.0048129954,0.003465012,0.0003995479,0.000031958516,0.0009230853,0.01128153],"genre_scores_gemma":[0.99399805,0.0003878836,0.0047689877,0.00027385252,0.000046623558,0.000011389663,0.00001969323,0.0000132694095,0.0004802524],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985661,0.00004221689,0.0002778569,0.000264324,0.00055477215,0.00029474407],"domain_scores_gemma":[0.998588,0.00031682776,0.00015508836,0.00049465883,0.00034639615,0.00009900536],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005033991,0.00011468323,0.00018308974,0.00041916978,0.00013166245,0.000078179706,0.0009032334,0.000059395818,0.000010080575],"category_scores_gemma":[0.00018355675,0.000109836044,0.00007427811,0.003020913,0.000019957048,0.0006480077,0.00048753727,0.000101836784,0.00012751638],"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.000003525848,0.0001229055,0.000984834,0.000037267055,0.00002494322,0.00002147913,0.00010779279,0.00032280135,0.00029291608,0.9170917,0.03934693,0.041642904],"study_design_scores_gemma":[0.00043121527,0.00021348627,0.017650347,0.00005990696,0.0000055930927,0.0000065527224,0.000017946883,0.24860707,0.008053684,0.69629014,0.028345749,0.00031830682],"about_ca_topic_score_codex":0.000019343835,"about_ca_topic_score_gemma":2.7723556e-7,"teacher_disagreement_score":0.9127546,"about_ca_system_score_codex":0.000010919321,"about_ca_system_score_gemma":0.000069305686,"threshold_uncertainty_score":0.4478984},"labels":[],"label_agreement":null},{"id":"W4380486389","doi":"10.1007/s00026-023-00654-2","title":"Asymptotics of Multivariate Sequences IV: Generating Functions with Poles on a Hyperplane Arrangement","year":2023,"lang":"en","type":"article","venue":"Annals of Combinatorics","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Mathematics; Hyperplane; Quotient; Multivariate statistics; Saddle point; Combinatorics; Function (biology); Analytic function; Saddle; Generating function; Discrete mathematics; Pure mathematics; Geometry; Mathematical optimization","score_opus":0.04950070409048338,"score_gpt":0.287967013732991,"score_spread":0.23846630964250762,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4380486389","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.9293774,0.00008621042,0.06706725,0.0016535625,0.000555035,0.00014685905,0.000010863763,0.00014186444,0.00096097996],"genre_scores_gemma":[0.9980625,0.00002738683,0.0015875944,0.00012083407,0.000030650215,0.000005629709,0.0000070679953,0.000005940236,0.00015238978],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99902964,0.00004614401,0.00023669722,0.00018306362,0.00032218455,0.0001822763],"domain_scores_gemma":[0.99919766,0.00016138349,0.00018159144,0.00022713754,0.00017979702,0.000052457246],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023357975,0.00010373122,0.00017084114,0.00015606763,0.000088042325,0.000028389146,0.00028702198,0.00003100432,0.0000016635324],"category_scores_gemma":[0.00003494471,0.0000844694,0.000044097098,0.0007493341,0.00003870317,0.00014143498,0.000081901926,0.000066155095,0.000011807934],"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.000051772124,0.00048046984,0.0016578673,0.00008439986,0.00015726528,0.000021911068,0.0015133766,0.055054765,0.0062120794,0.8853099,0.0027596864,0.046696555],"study_design_scores_gemma":[0.0022283515,0.005106613,0.031837568,0.00048262547,0.000048000657,0.000015058736,0.00038385796,0.72279114,0.08948329,0.14344496,0.0033064424,0.0008720871],"about_ca_topic_score_codex":0.00005337046,"about_ca_topic_score_gemma":0.000003867414,"teacher_disagreement_score":0.7418649,"about_ca_system_score_codex":0.000008544268,"about_ca_system_score_gemma":0.00006865538,"threshold_uncertainty_score":0.3444562},"labels":[],"label_agreement":null},{"id":"W4404872160","doi":"10.1007/s00026-024-00731-0","title":"Elementary Symmetric Partitions","year":2024,"lang":"en","type":"article","venue":"Annals of Combinatorics","topic":"Advanced Mathematical Identities","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Mathematics; Combinatorics; Symmetric group","score_opus":0.1624617524429855,"score_gpt":0.4211803246057107,"score_spread":0.2587185721627252,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404872160","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.4322245,0.020884002,0.060941957,0.009579096,0.004650554,0.0015536716,0.00020572334,0.002184691,0.4677758],"genre_scores_gemma":[0.9934769,0.00044548314,0.0018483334,0.000075641896,0.000045470708,0.000026153368,0.0000056221234,0.000032993394,0.0040433644],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988881,0.00002908322,0.0003828176,0.00014605811,0.00033142953,0.00022252623],"domain_scores_gemma":[0.99856853,0.0008701422,0.00006670865,0.00027292344,0.00015191376,0.000069784954],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003138352,0.000117027,0.00022742907,0.00023519967,0.00004649908,0.00003913359,0.0001653892,0.00004758063,0.00017024073],"category_scores_gemma":[0.0005453456,0.0001088878,0.00013017181,0.00074313505,0.000064930806,0.00024369605,0.00007439837,0.00012794389,0.000089828696],"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.0000013831545,0.0001668532,0.000025785046,0.0005444999,0.000055436572,0.000012197348,0.00010394982,0.0000011261794,0.000033215354,0.9506581,0.048000302,0.0003971535],"study_design_scores_gemma":[0.00006710191,0.00007002827,0.000033047316,0.0001477556,0.00003833775,0.0000041209314,0.00010168911,0.00011717373,0.00685465,0.9821391,0.0103175705,0.00010938855],"about_ca_topic_score_codex":0.0000043143696,"about_ca_topic_score_gemma":0.0000015569518,"teacher_disagreement_score":0.5612524,"about_ca_system_score_codex":0.00001914143,"about_ca_system_score_gemma":0.00003207177,"threshold_uncertainty_score":0.44403157},"labels":[],"label_agreement":null},{"id":"W4405621965","doi":"10.1007/s00026-024-00739-6","title":"Completing the Asymptotic Classification of Mostly Symmetric Short Step Walks in an Orthant","year":2024,"lang":"en","type":"article","venue":"Annals of Combinatorics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Orthant; Mathematics; Saddle point; Combinatorics; Symmetric function; Saddle; Symmetric group; Lattice (music); Symmetric closure; Symmetric matrix; Ring of symmetric functions; Eigenvalues and eigenvectors; Geometry; Physics; Quantum mechanics","score_opus":0.21272621515601234,"score_gpt":0.41715148297066323,"score_spread":0.2044252678146509,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405621965","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.9878711,0.00082701875,0.0060748397,0.0006763024,0.00096499384,0.0006915313,0.0000139553695,0.00013466488,0.0027455701],"genre_scores_gemma":[0.9985492,0.00008847665,0.0011495784,0.00002283305,0.00003956721,0.000030715823,0.000006805699,0.00006152857,0.000051242972],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972581,0.00021965161,0.0011123962,0.00030925116,0.0007438088,0.00035674952],"domain_scores_gemma":[0.99596083,0.002310772,0.00031494934,0.0008142554,0.0005167369,0.00008247063],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017276081,0.00024965685,0.00057763193,0.00042027998,0.000063900094,0.00004757859,0.00062029954,0.00014533452,0.000009285885],"category_scores_gemma":[0.0012004565,0.00019766182,0.00015036472,0.0019954345,0.00011721712,0.0002655986,0.0001314109,0.00037876214,0.0000045998886],"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.000013296124,0.00051573315,0.0011680631,0.0007070706,0.00004478709,0.0000074522413,0.0006140742,0.000024093375,0.0005999523,0.99363,0.0002584236,0.0024170447],"study_design_scores_gemma":[0.00021624091,0.0002999392,0.003069816,0.00032106045,0.00005607417,0.0000060681286,0.00053056615,0.017784085,0.0036292942,0.9734192,0.0004473533,0.00022029642],"about_ca_topic_score_codex":0.000008521145,"about_ca_topic_score_gemma":0.000008388231,"teacher_disagreement_score":0.020210804,"about_ca_system_score_codex":0.00006767996,"about_ca_system_score_gemma":0.00010916989,"threshold_uncertainty_score":0.80604154},"labels":[],"label_agreement":null},{"id":"W4409178989","doi":"10.1007/s00026-025-00754-1","title":"Genus Polynomials of Cubic Graphs with Non-real Roots","year":2025,"lang":"en","type":"article","venue":"Annals of Combinatorics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; Javna Agencija za Raziskovalno Dejavnost RS","keywords":"Mathematics; Combinatorics; Genus; Cubic graph; Cubic function; Discrete mathematics; Graph; Line graph; Botany; Geometry; Biology; Voltage graph","score_opus":0.048627368638799684,"score_gpt":0.35966253405599863,"score_spread":0.31103516541719894,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409178989","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.96507066,0.00032638857,0.0045724073,0.00026097937,0.0008192632,0.00064664806,0.000018380499,0.00009949182,0.028185796],"genre_scores_gemma":[0.99618137,0.00021009396,0.0027875686,0.000045651075,0.000020578304,0.000029261691,0.0000027095243,0.000048977385,0.0006737715],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977477,0.000076129254,0.0009279428,0.0002851103,0.0005542415,0.00040882733],"domain_scores_gemma":[0.99636096,0.00097265834,0.0007697816,0.00093461823,0.000856739,0.000105233],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005383762,0.00032323712,0.0009800444,0.00035349064,0.00007603513,0.000015772479,0.00059112575,0.00018624816,0.000012252462],"category_scores_gemma":[0.00057784154,0.00028801308,0.00020536994,0.0011573423,0.00018680857,0.00015953521,0.00016409028,0.00021286221,0.0000039422134],"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.000105651954,0.00078227895,0.0011671326,0.0008285835,0.00021207228,0.0000066161947,0.0002454938,0.000012674148,0.0010053419,0.9916791,0.0034626839,0.0004924212],"study_design_scores_gemma":[0.0011469433,0.00040218604,0.0006940625,0.00036788953,0.000106199506,0.0000023701514,0.000109917164,0.000041722647,0.0913222,0.9051304,0.00044271594,0.00023341393],"about_ca_topic_score_codex":0.000036562164,"about_ca_topic_score_gemma":0.0000057595435,"teacher_disagreement_score":0.090316854,"about_ca_system_score_codex":0.000033459106,"about_ca_system_score_gemma":0.00021912671,"threshold_uncertainty_score":0.9999572},"labels":[],"label_agreement":null},{"id":"W4409640511","doi":"10.1007/s00026-025-00757-y","title":"Moments of Colored Permutation Statistics on Conjugacy Classes","year":2025,"lang":"en","type":"article","venue":"Annals of Combinatorics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Combinatorics Foundation; National Science Foundation","keywords":"Mathematics; Conjugacy class; Colored; Combinatorics; Permutation (music); Permutation group; Symmetric group; Statistics","score_opus":0.09899481768272177,"score_gpt":0.4287406175346076,"score_spread":0.32974579985188585,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409640511","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.8829811,0.00029657639,0.0701665,0.0008997762,0.0030877313,0.0015798975,0.000262013,0.00020746885,0.040518906],"genre_scores_gemma":[0.9941553,0.00011926787,0.0046694437,0.000104456965,0.0000137566785,0.000024660167,0.0000133160975,0.00003100172,0.000868823],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980073,0.000100660625,0.0008665936,0.0002108822,0.000554805,0.00025975893],"domain_scores_gemma":[0.9954758,0.0021405967,0.0006949621,0.0005300403,0.001094953,0.00006364185],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038373366,0.00022689291,0.0006267718,0.0002606722,0.000064400694,0.000014952262,0.00034303335,0.00013458909,0.00002725349],"category_scores_gemma":[0.0030292785,0.000230309,0.000100443336,0.00061302533,0.00012743252,0.00011575063,0.00009444554,0.00016979265,0.0000063508596],"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.0000898238,0.0010244398,0.00022794862,0.00072174316,0.00011358434,0.0000029727635,0.0002584021,0.000026139907,0.00034898482,0.9847537,0.011925147,0.00050707115],"study_design_scores_gemma":[0.0009599466,0.000491084,0.00031948168,0.00025820016,0.000059345795,4.472741e-7,0.00018291216,0.00025005228,0.048677176,0.9477369,0.0009099015,0.00015456068],"about_ca_topic_score_codex":0.0000039471893,"about_ca_topic_score_gemma":6.561208e-7,"teacher_disagreement_score":0.111174144,"about_ca_system_score_codex":0.00005274213,"about_ca_system_score_gemma":0.0001481301,"threshold_uncertainty_score":0.9391728},"labels":[],"label_agreement":null},{"id":"W4410732952","doi":"10.1007/s00026-025-00762-1","title":"Chromatic Quasisymmetric Functions of the Path Graph","year":2025,"lang":"en","type":"article","venue":"Annals of Combinatorics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","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":"Natural Sciences and Engineering Research Council of Canada; Santa Clara University","keywords":"Mathematics; Combinatorics; Chromatic scale; Graph; Discrete mathematics","score_opus":0.05973793336828847,"score_gpt":0.3486723837833799,"score_spread":0.2889344504150914,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410732952","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.87475497,0.0026151803,0.05490685,0.0021480457,0.0067309667,0.001819257,0.00005106453,0.0002465313,0.056727134],"genre_scores_gemma":[0.99733526,0.0001407184,0.0009806781,0.00007584417,0.000016290027,0.000028407485,0.0000010252094,0.000024413137,0.0013973812],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979844,0.0001366247,0.00086512946,0.00019059902,0.0005489794,0.00027422933],"domain_scores_gemma":[0.99595946,0.0015162532,0.000688112,0.0011017813,0.00068141415,0.000052975956],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005897174,0.00021698674,0.00058499834,0.00035948123,0.00013199188,0.000012131424,0.0006808521,0.0001344192,0.0000169155],"category_scores_gemma":[0.0033993758,0.00016599333,0.00034086485,0.0033049514,0.00016175366,0.00010636054,0.00022687508,0.00022595657,0.000006074032],"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.000008779691,0.0007512816,0.00068383344,0.0007299806,0.000114706396,4.7110757e-7,0.00014476564,0.000008219768,0.00014001862,0.98595256,0.011015221,0.00045016335],"study_design_scores_gemma":[0.00045972268,0.000110644134,0.0009015018,0.0003240335,0.000106274274,0.0000012105777,0.00017517127,0.00007074952,0.01377554,0.9830843,0.00085939304,0.00013145535],"about_ca_topic_score_codex":0.000008065037,"about_ca_topic_score_gemma":0.0000013113488,"teacher_disagreement_score":0.12258027,"about_ca_system_score_codex":0.00003256309,"about_ca_system_score_gemma":0.000118234406,"threshold_uncertainty_score":0.67690116},"labels":[],"label_agreement":null},{"id":"W4414468632","doi":"10.1007/s00026-025-00782-x","title":"Enumeration of Max-Pooling Responses with Generalized Permutohedra","year":2025,"lang":"en","type":"article","venue":"Annals of Combinatorics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"H2020 European Research Council; Division of Computing and Communication Foundations; Natural Sciences and Engineering Research Council of Canada; Division of Mathematical Sciences; Deutsche Forschungsgemeinschaft; Simons Foundation","keywords":"Enumeration; Polytope; Minkowski addition; Generating function; Catalan number; Minkowski space","score_opus":0.019094318878115798,"score_gpt":0.26378201397117046,"score_spread":0.24468769509305466,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414468632","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.9904789,0.0016056563,0.0024798654,0.000068171554,0.0003029028,0.00009945754,0.0000064620012,0.0000649958,0.0048936433],"genre_scores_gemma":[0.999335,0.00016135549,0.000058952333,0.000028426311,0.000009118953,0.000008617947,0.0000035641144,0.000011586142,0.00038339559],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99934983,0.000066695175,0.0002582976,0.00007873178,0.00012707849,0.0001193719],"domain_scores_gemma":[0.9994567,0.00008592149,0.000058335412,0.00020623571,0.00016830662,0.000024472312],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027425453,0.00009642392,0.00022456775,0.00016097468,0.000032522366,0.000009884479,0.000110077664,0.0000599392,0.000006985714],"category_scores_gemma":[0.0000364493,0.00008893148,0.0000554317,0.00038990402,0.000032426935,0.0000792895,0.000011168433,0.00006521492,0.0000011704026],"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.00024737098,0.00008962515,0.0040329597,0.0005860239,0.00021718683,0.0000047857106,0.0005818661,0.007139889,0.02355717,0.9613687,0.0013437981,0.00083062775],"study_design_scores_gemma":[0.0013861593,0.00030407793,0.0064549455,0.00051531923,0.00006786599,0.0000058794913,0.00030627623,0.0057667317,0.84603506,0.12928766,0.009506956,0.0003630516],"about_ca_topic_score_codex":0.000010224548,"about_ca_topic_score_gemma":0.000001227279,"teacher_disagreement_score":0.832081,"about_ca_system_score_codex":0.0000062774957,"about_ca_system_score_gemma":0.000025401763,"threshold_uncertainty_score":0.36265206},"labels":[],"label_agreement":null}]}