{"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7632006,0.0006599934,0.08795826,0.0021119749,0.0005220634,0.00009182315,0.0007630785,0.00031638274,0.14437583],"genre_scores_gemma":[0.9696121,0.00035804056,0.012241384,0.00028294665,0.00027853262,0.00008060712,0.00049275794,0.00011316987,0.016540302],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985629,0.000400495,0.00008388813,0.00016747291,0.0004330949,0.0003521752],"domain_scores_gemma":[0.9980361,0.00067064737,0.00033978958,0.00033665213,0.00021752133,0.00039928517],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00096644845,0.0005768918,0.0010207001,0.0014138543,0.0021937098,0.0047873184,0.0013576606,0.0011460099,0.007713911],"category_scores_gemma":[0.002531558,0.00054293225,0.001052536,0.0012543997,0.00495478,0.0041584093,0.0022779559,0.0021915743,0.0013555939],"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.00004563358,0.000015878597,0.00013095334,0.000013086314,0.0000039773568,0.000069123285,0.000146739,0.0008015193,0.00051865866,0.996083,0.0005644733,0.0016069378],"study_design_scores_gemma":[0.000021854112,0.000009786131,0.0001058073,0.0000059405147,0.0000022725233,0.000053715015,0.000088166955,0.002238735,0.00016121907,0.99658185,0.0007225165,0.0000081225635],"about_ca_topic_score_codex":0.0023616774,"about_ca_topic_score_gemma":0.0021856274,"teacher_disagreement_score":0.007713911,"about_ca_system_score_codex":0.0015674871,"about_ca_system_score_gemma":0.0010953074,"threshold_uncertainty_score":0.025805593},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.754436,0.004066377,0.15321057,0.0041239304,0.00024455079,0.000064213426,0.0006935493,0.00026526477,0.08289549],"genre_scores_gemma":[0.9704264,0.0015295125,0.010403259,0.00040897535,0.0005257742,0.0001356426,0.0004987037,0.000088234185,0.015983572],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990087,0.00037992166,0.0000688847,0.00021555094,0.00017919479,0.00014783071],"domain_scores_gemma":[0.9956115,0.0024423765,0.0006170809,0.0002716289,0.00034190164,0.000715595],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014799548,0.0010455806,0.00107399,0.0048760865,0.0033080885,0.0057243463,0.001677974,0.001802516,0.0062819077],"category_scores_gemma":[0.006037662,0.00085110444,0.0009490612,0.004178861,0.005631226,0.012557236,0.0041997447,0.0024364672,0.000485416],"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.000018475968,0.000016057465,0.00035805927,0.000021110041,0.0000051346883,0.000074427626,0.00036823744,0.00061387743,0.0002841348,0.9966522,0.00030155783,0.0012869284],"study_design_scores_gemma":[0.0000062112676,0.000007671274,0.000249741,0.0000107638625,0.0000053960566,0.000071679024,0.00022595639,0.0017109796,0.00007556633,0.99712,0.0005096052,0.000006346271],"about_ca_topic_score_codex":0.0018973796,"about_ca_topic_score_gemma":0.002034574,"teacher_disagreement_score":0.0062819077,"about_ca_system_score_codex":0.002135011,"about_ca_system_score_gemma":0.00074393925,"threshold_uncertainty_score":0.021015108},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24289852,0.0015050941,0.11284528,0.0051964093,0.0012836208,0.00008569146,0.0008031844,0.0006823054,0.63469994],"genre_scores_gemma":[0.81501836,0.0013954785,0.01493287,0.0012564817,0.0011771027,0.00008522749,0.00077911926,0.0003437191,0.16501181],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994591,0.00010875242,0.000020825615,0.0001321517,0.00016900817,0.00011007623],"domain_scores_gemma":[0.9995753,0.000049809052,0.000050997438,0.00008820261,0.00011886764,0.0001167107],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050763803,0.0008819733,0.0006743377,0.002041081,0.0016866085,0.0035425622,0.0007035499,0.0008394979,0.0168894],"category_scores_gemma":[0.0008327366,0.0005095753,0.0006487234,0.0014279826,0.003006692,0.006777056,0.0034047961,0.0034221204,0.0031853362],"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.00000922492,0.000007703226,0.0000635369,0.000009893911,0.0000039389734,0.000023395816,0.000076870114,0.00006806101,0.00037553682,0.99555737,0.001336256,0.0024681904],"study_design_scores_gemma":[0.0000072189364,0.0000068039903,0.00021546842,0.0000074224145,0.000008541305,0.00014547157,0.00008610015,0.0004585619,0.00040995394,0.9872922,0.011354811,0.0000075511807],"about_ca_topic_score_codex":0.00040120538,"about_ca_topic_score_gemma":0.00040369466,"teacher_disagreement_score":0.0168894,"about_ca_system_score_codex":0.00093815173,"about_ca_system_score_gemma":0.0005217303,"threshold_uncertainty_score":0.056500673},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.66763574,0.0020917046,0.13776994,0.00707595,0.0005457849,0.0001321785,0.0012915396,0.0005646776,0.18289243],"genre_scores_gemma":[0.95855945,0.0014782337,0.01631917,0.00084659626,0.0005440475,0.00021073839,0.0006314153,0.00016101848,0.021249315],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985434,0.00030263964,0.00013829963,0.00043871632,0.00030331805,0.0002736466],"domain_scores_gemma":[0.9950846,0.002686683,0.00072049315,0.00064256764,0.0003394532,0.00052609894],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015257233,0.000869357,0.0020387804,0.0027846883,0.0035159497,0.005002135,0.0015104925,0.001995121,0.0075593838],"category_scores_gemma":[0.0056460565,0.0007861108,0.0016115698,0.002516828,0.004592442,0.011387726,0.003967417,0.003702119,0.0011835159],"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.00005085455,0.000019509336,0.0002065936,0.000031650052,0.000010905343,0.00007592424,0.00028893666,0.0003224668,0.00047865615,0.9949891,0.0008926252,0.0026327143],"study_design_scores_gemma":[0.000026210933,0.000010629921,0.0001429431,0.000011369469,0.000014686129,0.00012978441,0.00009434133,0.0012042263,0.00032590298,0.99552757,0.0024997478,0.000012522074],"about_ca_topic_score_codex":0.00063570816,"about_ca_topic_score_gemma":0.0005157529,"teacher_disagreement_score":0.0075593838,"about_ca_system_score_codex":0.0014263578,"about_ca_system_score_gemma":0.00083978276,"threshold_uncertainty_score":0.025288701},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.040932808,0.00069294963,0.89148545,0.0012421705,0.0002937986,0.00007294258,0.00021221199,0.00030353467,0.06476416],"genre_scores_gemma":[0.5338862,0.0019639272,0.37979117,0.0008270587,0.0010022864,0.000300702,0.00085294456,0.00068948837,0.08068636],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991903,0.0003472257,0.000040887302,0.00010399876,0.000207082,0.00011051053],"domain_scores_gemma":[0.99757403,0.001463897,0.00013720526,0.00037613628,0.0003281332,0.000120618526],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010335826,0.00064297346,0.00089828804,0.0021130736,0.0021403786,0.0032477968,0.0022484355,0.0016509035,0.011165452],"category_scores_gemma":[0.004926712,0.0007133839,0.0013936695,0.0030416227,0.0026288982,0.0050649294,0.0017868427,0.0036198806,0.0021904255],"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.0000048767924,0.0000097772545,0.000047834135,0.00001143211,0.000001525369,0.000026950465,0.000104131796,0.0012878125,0.00013028535,0.9930682,0.00064699224,0.0046600434],"study_design_scores_gemma":[0.0000023298471,0.000003255463,0.000020536621,0.0000056767244,0.0000024103858,0.00003413634,0.000025796844,0.008274538,0.000086236105,0.9891207,0.0024208948,0.000003359911],"about_ca_topic_score_codex":0.0015197347,"about_ca_topic_score_gemma":0.00256279,"teacher_disagreement_score":0.011165452,"about_ca_system_score_codex":0.0013548551,"about_ca_system_score_gemma":0.00089036627,"threshold_uncertainty_score":0.037352145},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12559046,0.0052197655,0.6798354,0.01244036,0.0019331082,0.00011425865,0.0006871163,0.0013900623,0.17278953],"genre_scores_gemma":[0.72264147,0.003901147,0.14905271,0.0026116336,0.0021158722,0.00020064354,0.00074849534,0.0005855776,0.11814237],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99869895,0.00039358143,0.00007579071,0.00027313075,0.0003959315,0.0001624462],"domain_scores_gemma":[0.9962452,0.002313748,0.00025134368,0.00058197835,0.00039149908,0.00021619459],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010912779,0.00080359867,0.0011666056,0.0023929623,0.0022913837,0.0051001427,0.0012972375,0.0019938366,0.015115864],"category_scores_gemma":[0.008441774,0.00068414916,0.00072771916,0.005529902,0.0031383275,0.009069661,0.002057314,0.0036296248,0.002437375],"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.00002778772,0.000027582468,0.000108518005,0.000025558511,0.000005615075,0.000021136055,0.000063332656,0.002780441,0.00041815938,0.96721387,0.0040169097,0.025291163],"study_design_scores_gemma":[0.000004143574,0.0000054145676,0.00003005339,0.000006296536,0.000003852767,0.000022695574,0.00001770102,0.0059294533,0.000262186,0.9893773,0.0043351655,0.0000057739494],"about_ca_topic_score_codex":0.0015202109,"about_ca_topic_score_gemma":0.0017905044,"teacher_disagreement_score":0.015115864,"about_ca_system_score_codex":0.0021179486,"about_ca_system_score_gemma":0.0013684285,"threshold_uncertainty_score":0.050567567},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49204415,0.0037428136,0.20011215,0.008872657,0.0013120843,0.00012680033,0.0008862915,0.00055780576,0.2923452],"genre_scores_gemma":[0.9157596,0.0015287166,0.032248028,0.0008661397,0.00063352,0.00013710596,0.0005345002,0.00019214363,0.04810018],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99922514,0.00024670232,0.000037700916,0.00013598196,0.00018878758,0.00016557015],"domain_scores_gemma":[0.9976561,0.0012162413,0.00024946,0.00029793935,0.00024360648,0.00033664785],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010561775,0.00051934447,0.001013572,0.0025523868,0.0039027226,0.0049373624,0.0011966417,0.0018429541,0.011589406],"category_scores_gemma":[0.0045752972,0.0008047022,0.0008835256,0.0025653911,0.005192705,0.0067788144,0.0027085235,0.0038659663,0.0013561905],"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.000019819305,0.0000072541266,0.0000684928,0.000008292108,0.0000021273709,0.000025450869,0.00013719629,0.00030067388,0.000090332076,0.99719304,0.00078108895,0.0013662135],"study_design_scores_gemma":[0.000005882034,0.000001890082,0.000032038475,0.00000352113,0.0000019887214,0.000026609487,0.000046173438,0.00051368866,0.000035230634,0.99789834,0.001431631,0.00000302683],"about_ca_topic_score_codex":0.0015347777,"about_ca_topic_score_gemma":0.0021618055,"teacher_disagreement_score":0.011589406,"about_ca_system_score_codex":0.0014931046,"about_ca_system_score_gemma":0.00073923403,"threshold_uncertainty_score":0.038770437},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45147198,0.00089189457,0.4657266,0.00489874,0.00023304185,0.00029801665,0.0005493946,0.00053655304,0.07539386],"genre_scores_gemma":[0.9054988,0.00055896735,0.050658423,0.0005270534,0.0002445968,0.00040437974,0.00028481247,0.00022027561,0.04160263],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974427,0.0012884516,0.00008024297,0.00040955754,0.00032797144,0.00045112852],"domain_scores_gemma":[0.98982483,0.0069134682,0.00079181703,0.0006913679,0.00040567445,0.0013727912],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025909117,0.0018332362,0.0032158575,0.001963037,0.0023833932,0.0038450544,0.003390391,0.004329643,0.010227873],"category_scores_gemma":[0.012318846,0.0013131353,0.0017574471,0.001516181,0.0047916435,0.008419575,0.0038775876,0.003837003,0.0007335728],"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.00021384026,0.00011405684,0.00024416688,0.00007831704,0.000043742453,0.00024262795,0.00023868895,0.07680094,0.0010254735,0.91424924,0.0031928846,0.0035559463],"study_design_scores_gemma":[0.00006689093,0.000055530996,0.0001327802,0.000017691165,0.00002388552,0.00007519078,0.00009465376,0.32371756,0.00025524304,0.67443097,0.0010974051,0.000032244978],"about_ca_topic_score_codex":0.004086701,"about_ca_topic_score_gemma":0.004049083,"teacher_disagreement_score":0.010227873,"about_ca_system_score_codex":0.0021525885,"about_ca_system_score_gemma":0.0016042687,"threshold_uncertainty_score":0.03421557},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.77996993,0.00066820334,0.07599482,0.003662659,0.00023203332,0.00020982043,0.0047071064,0.0011634795,0.13339198],"genre_scores_gemma":[0.9545555,0.0003134529,0.021963898,0.00065898115,0.00024181303,0.0002639639,0.0032946798,0.00043959173,0.018268077],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977018,0.00043520585,0.00016773208,0.0005088271,0.000539995,0.000646498],"domain_scores_gemma":[0.98040867,0.011857131,0.0017412696,0.002303481,0.0020657352,0.0016236106],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019867178,0.0006963149,0.00096916227,0.0032020023,0.0055623422,0.0064546247,0.0029500802,0.0017757931,0.012268115],"category_scores_gemma":[0.012335165,0.0006271421,0.0010701051,0.0033835017,0.003596378,0.005571209,0.0030295814,0.002831241,0.0016420253],"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.00056195125,0.00018563397,0.0065697413,0.00015125131,0.00003752551,0.00042781627,0.0011902574,0.0027142423,0.0062595806,0.952941,0.012535654,0.016425405],"study_design_scores_gemma":[0.000096381904,0.00004047821,0.0025994144,0.0000557971,0.00006729003,0.00064593076,0.00033469513,0.013649462,0.0046165427,0.96909124,0.008745545,0.000057341338],"about_ca_topic_score_codex":0.005061638,"about_ca_topic_score_gemma":0.006292928,"teacher_disagreement_score":0.012268115,"about_ca_system_score_codex":0.0027176451,"about_ca_system_score_gemma":0.002557048,"threshold_uncertainty_score":0.041040957},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.84206545,0.0010656195,0.10319429,0.004467141,0.00016585273,0.000096856435,0.0008427329,0.00028728682,0.047814768],"genre_scores_gemma":[0.9676068,0.00066887157,0.017442368,0.0003427419,0.0005245206,0.0000960769,0.00059104146,0.00010653808,0.012620969],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991959,0.00022082288,0.000038389993,0.00021443791,0.00020195705,0.00012844826],"domain_scores_gemma":[0.9954275,0.0022850481,0.00070089346,0.0003916014,0.00038360766,0.0008113009],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006770377,0.0005586508,0.0010608808,0.0019969798,0.002521945,0.005177728,0.001575425,0.0015509718,0.008309741],"category_scores_gemma":[0.0056228354,0.0009430552,0.00080838933,0.002198397,0.0033561827,0.0066778227,0.0022993675,0.0031165532,0.00076268264],"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.00012581586,0.000047575304,0.0010980852,0.000070600865,0.000016070644,0.00012476463,0.0006547577,0.0021118913,0.001512757,0.9830111,0.0029479812,0.008278516],"study_design_scores_gemma":[0.00002505835,0.0000118444395,0.00061845954,0.0000115954135,0.000010569129,0.00014068403,0.00018219449,0.006760025,0.00031684866,0.9896114,0.0023033686,0.0000079645415],"about_ca_topic_score_codex":0.0012707035,"about_ca_topic_score_gemma":0.0015443689,"teacher_disagreement_score":0.008309741,"about_ca_system_score_codex":0.0013094322,"about_ca_system_score_gemma":0.0004334414,"threshold_uncertainty_score":0.027798891},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28515923,0.0038417699,0.5864887,0.005863846,0.00047937498,0.00007648669,0.0005690151,0.0010963609,0.11642518],"genre_scores_gemma":[0.9456314,0.0010617027,0.037965734,0.00023316307,0.00052527175,0.000052835578,0.00031187668,0.0002638249,0.013954203],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970253,0.0007274964,0.00008502281,0.0004858628,0.0010997708,0.0005765968],"domain_scores_gemma":[0.981861,0.014014558,0.00094462687,0.0012788214,0.0009932627,0.0009077598],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024277337,0.0009395504,0.0017219401,0.0025875533,0.0016423019,0.004578332,0.0028346071,0.0013286765,0.009493467],"category_scores_gemma":[0.026638063,0.00076226704,0.0006709743,0.0018040953,0.005339681,0.012672704,0.005063694,0.0057210713,0.0015284618],"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.0000886679,0.00003413621,0.000805492,0.00007968783,0.000010478199,0.00007516425,0.0002452948,0.00986741,0.0010594528,0.9744834,0.0024568941,0.010793883],"study_design_scores_gemma":[0.000008165054,0.000009166674,0.00016410697,0.000018157925,0.0000073403426,0.000056072844,0.000055140532,0.03789509,0.00084392575,0.9592555,0.0016773043,0.000010013674],"about_ca_topic_score_codex":0.0011728901,"about_ca_topic_score_gemma":0.0013998642,"teacher_disagreement_score":0.009493467,"about_ca_system_score_codex":0.0022661681,"about_ca_system_score_gemma":0.0011156969,"threshold_uncertainty_score":0.031758845},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.73753643,0.0006590713,0.115365006,0.0015512902,0.0004873569,0.000097009106,0.0005914958,0.0008094001,0.14290287],"genre_scores_gemma":[0.9280964,0.0006459127,0.029531695,0.00039255552,0.00019905597,0.00015548307,0.0004293094,0.00041436966,0.04013511],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994425,0.00012029862,0.000033016404,0.000084366075,0.00015636018,0.00016348287],"domain_scores_gemma":[0.9987293,0.00046433593,0.00016964022,0.00025536394,0.00015954107,0.00022185028],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042158918,0.0009877064,0.0008027656,0.0015106839,0.0016081126,0.0029193887,0.0011484387,0.0019268106,0.009795061],"category_scores_gemma":[0.0023390162,0.00073510193,0.0006212824,0.0010108651,0.002151464,0.004205188,0.0034607847,0.002470005,0.0023859276],"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.00021007165,0.00006998539,0.00082134764,0.00007357841,0.000012634362,0.00030808526,0.00053698395,0.0046737073,0.0064761047,0.9661423,0.0032026898,0.017472448],"study_design_scores_gemma":[0.000041587216,0.000052685402,0.00054552284,0.00003363977,0.000019003282,0.0002935598,0.0003179082,0.015943166,0.0038995566,0.97139806,0.007424096,0.000031208045],"about_ca_topic_score_codex":0.00051469484,"about_ca_topic_score_gemma":0.0008635613,"teacher_disagreement_score":0.009795061,"about_ca_system_score_codex":0.0008742178,"about_ca_system_score_gemma":0.00034842416,"threshold_uncertainty_score":0.032767773},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.733309,0.0017248987,0.22253859,0.00062321563,0.000104432336,0.00006317058,0.00076613744,0.00026142268,0.040609162],"genre_scores_gemma":[0.95174426,0.0011910441,0.03660497,0.000082136045,0.000097514974,0.00006354038,0.0007025599,0.00007186731,0.009442255],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99955493,0.000089487636,0.00003276987,0.00011479104,0.00012422766,0.00008377342],"domain_scores_gemma":[0.99777514,0.00092523947,0.00048252073,0.0003223158,0.00026478685,0.00022996309],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028379678,0.0003622677,0.0007945736,0.0019093868,0.0015385016,0.005016295,0.00091307424,0.00081864896,0.0037806018],"category_scores_gemma":[0.0038578256,0.0007373695,0.00058821565,0.0025556206,0.0026172542,0.0030928203,0.0014409751,0.0011917839,0.0007131698],"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.000050417544,0.000012676438,0.0013943345,0.000037755162,0.000008328011,0.00011896862,0.00048744303,0.009256741,0.0013135069,0.9763199,0.0010275164,0.009972455],"study_design_scores_gemma":[0.000020835278,0.00001607071,0.0011037204,0.000019163921,0.000018260636,0.00019709342,0.0004333472,0.031295482,0.0012283891,0.9571679,0.008480735,0.000019070758],"about_ca_topic_score_codex":0.004569778,"about_ca_topic_score_gemma":0.0039891168,"teacher_disagreement_score":0.005016295,"about_ca_system_score_codex":0.0010551729,"about_ca_system_score_gemma":0.00063088856,"threshold_uncertainty_score":0.01264739},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.52296674,0.00043036428,0.41413304,0.0009874157,0.00012612002,0.00019677803,0.0019310171,0.0016072806,0.05762131],"genre_scores_gemma":[0.7470226,0.00044401054,0.22000502,0.00028408165,0.00010965481,0.00028091474,0.0052788365,0.0005323824,0.026042484],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989793,0.00026359028,0.000113946066,0.0002142694,0.00027578647,0.00015308031],"domain_scores_gemma":[0.99547833,0.002730809,0.00028373467,0.0009137997,0.00034807652,0.00024526496],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054216536,0.0006864772,0.0008624594,0.0012336217,0.001024057,0.0032068945,0.001997473,0.0010389987,0.010801612],"category_scores_gemma":[0.0039733737,0.0008915667,0.0011449624,0.0025784469,0.0012518544,0.0046119313,0.0021358451,0.0021004584,0.0018023932],"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.0005278861,0.0005081441,0.003422539,0.00051956193,0.00007741768,0.0010338647,0.0012998269,0.013148322,0.023500053,0.771322,0.007790561,0.17684984],"study_design_scores_gemma":[0.0000527541,0.000056991576,0.0005690481,0.000042947104,0.000046301702,0.000699786,0.0002795329,0.033268113,0.0060693054,0.9530187,0.0058744745,0.00002198707],"about_ca_topic_score_codex":0.00039863543,"about_ca_topic_score_gemma":0.00087105687,"teacher_disagreement_score":0.010801612,"about_ca_system_score_codex":0.0005788537,"about_ca_system_score_gemma":0.00060813216,"threshold_uncertainty_score":0.036135018},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7421541,0.0037958478,0.0798836,0.002622333,0.000854286,0.000115370975,0.0005611967,0.000756744,0.16925646],"genre_scores_gemma":[0.9621272,0.00087519997,0.009689849,0.00022853338,0.0005252717,0.00006046846,0.0005030106,0.00016780256,0.025822636],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999519,0.00008116302,0.000036572957,0.00007762139,0.00015348809,0.00013220387],"domain_scores_gemma":[0.99928564,0.000248694,0.00012484827,0.00008931316,0.00010770521,0.00014379517],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045760025,0.00071336894,0.0014368425,0.0027035102,0.002498119,0.0035999597,0.0013261548,0.0018851588,0.00718008],"category_scores_gemma":[0.0033118497,0.00047691097,0.001062197,0.00182321,0.0020103785,0.003432475,0.0016473571,0.0015842762,0.0013392032],"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.000060455146,0.000014285066,0.00055436697,0.00006392282,0.000014310645,0.0006584891,0.0004196287,0.0021322719,0.0017587714,0.9841622,0.002851648,0.007309487],"study_design_scores_gemma":[0.000017937653,0.000022363703,0.00067169213,0.00002356156,0.000027480792,0.00068250473,0.0001670938,0.013141547,0.0007923387,0.97785985,0.0065646986,0.000028888006],"about_ca_topic_score_codex":0.0025337408,"about_ca_topic_score_gemma":0.0024752757,"teacher_disagreement_score":0.00718008,"about_ca_system_score_codex":0.0017947434,"about_ca_system_score_gemma":0.0005318082,"threshold_uncertainty_score":0.024019718},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0046892744,0.00019021315,0.99075186,0.0001416544,0.000034931225,0.00018130959,0.00009142678,0.000099966084,0.003819453],"genre_scores_gemma":[0.15712352,0.00062482094,0.8360068,0.00040012607,0.00010199648,0.0014228543,0.00028347614,0.000100453195,0.0039358926],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9691377,0.023859058,0.0009272642,0.0023930806,0.002934615,0.0007483542],"domain_scores_gemma":[0.9121131,0.072314665,0.0029854581,0.009510282,0.0024093562,0.0006671067],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.028453123,0.0016314284,0.0024377052,0.0020536713,0.00093820546,0.0025143714,0.0022630126,0.0018978185,0.0109873675],"category_scores_gemma":[0.06899877,0.001330128,0.0014791377,0.0024019114,0.004905159,0.0036138971,0.0037968536,0.0027948802,0.0013748208],"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.0006985486,0.00011175902,0.0005803567,0.00037269198,0.00008151224,0.00004863328,0.00016919732,0.09123621,0.0014676087,0.77160275,0.0014629345,0.1321678],"study_design_scores_gemma":[0.00021874341,0.0003376121,0.0001732044,0.000113738075,0.000052650335,0.000039995863,0.000028331197,0.19539928,0.0013225316,0.7980708,0.0042146086,0.000028580811],"about_ca_topic_score_codex":0.0009049898,"about_ca_topic_score_gemma":0.0008981062,"teacher_disagreement_score":0.028453123,"about_ca_system_score_codex":0.0019694206,"about_ca_system_score_gemma":0.0029139551,"threshold_uncertainty_score":0.15047634},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.59970284,0.001411739,0.19104369,0.0029130494,0.0003832298,0.00017514844,0.0007988491,0.0005309739,0.20304047],"genre_scores_gemma":[0.9505972,0.00073349656,0.020682238,0.0005046717,0.0004943557,0.00013150317,0.0009273645,0.00020628088,0.025723014],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991849,0.0002448179,0.00003413706,0.00018559408,0.00021505076,0.00013549133],"domain_scores_gemma":[0.9975713,0.0012071169,0.00032104112,0.00030293813,0.0002816959,0.0003158366],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005901604,0.0008079881,0.0014154575,0.0028119602,0.0017086888,0.0040906873,0.0012270894,0.001130773,0.010039223],"category_scores_gemma":[0.0041711135,0.00082353957,0.001028761,0.0016406798,0.0031379084,0.0054320954,0.0029000319,0.002842799,0.00096243725],"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.000031562373,0.000023583147,0.0002527815,0.000026908461,0.000006430853,0.000034621007,0.00017419904,0.0010398894,0.00033773456,0.992458,0.0013857784,0.004228478],"study_design_scores_gemma":[0.000015530046,0.000010853721,0.00017788527,0.000009806174,0.000008117054,0.00006345551,0.0000946455,0.005034733,0.00022218066,0.99189353,0.0024643696,0.0000049410833],"about_ca_topic_score_codex":0.0009851275,"about_ca_topic_score_gemma":0.0012223469,"teacher_disagreement_score":0.010039223,"about_ca_system_score_codex":0.001166918,"about_ca_system_score_gemma":0.0005313936,"threshold_uncertainty_score":0.033584476},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.84331113,0.0037947746,0.014438397,0.0068131755,0.00014079592,0.00001815344,0.00032747554,0.00015885539,0.13099724],"genre_scores_gemma":[0.990329,0.00071637455,0.001386839,0.00014258816,0.00021170963,0.000011304684,0.000207958,0.000012299321,0.006981892],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993243,0.00012008117,0.000029051886,0.00011656383,0.0002362101,0.00017377106],"domain_scores_gemma":[0.998569,0.00074811286,0.00018077159,0.00017556995,0.0001420868,0.0001843196],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013095664,0.0007231358,0.0011408156,0.0041203233,0.0033146965,0.005006537,0.0012417608,0.0018548083,0.006341442],"category_scores_gemma":[0.0037279304,0.00047566518,0.0005832943,0.0033655008,0.0056936713,0.007759883,0.0033078368,0.002761269,0.00065269525],"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.000043598673,0.000018589897,0.00045011952,0.000025272013,0.0000050196813,0.000084271065,0.00030692862,0.00082017627,0.00020001011,0.9929153,0.0009305473,0.004200167],"study_design_scores_gemma":[0.000013540779,0.0000074735012,0.00039543642,0.000012077728,0.000005727275,0.00007142982,0.00015696505,0.001828014,0.00024305546,0.99533397,0.0019229753,0.000009321604],"about_ca_topic_score_codex":0.0018120005,"about_ca_topic_score_gemma":0.0011626685,"teacher_disagreement_score":0.006341442,"about_ca_system_score_codex":0.0022513438,"about_ca_system_score_gemma":0.0008136088,"threshold_uncertainty_score":0.021214187},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19844262,0.0010149146,0.7221344,0.001422284,0.0005421249,0.000106074105,0.0004885259,0.000843498,0.07500549],"genre_scores_gemma":[0.8195525,0.000607147,0.14296679,0.0004640685,0.00078798144,0.00017018028,0.0005654145,0.0004949354,0.03439102],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99801695,0.0005745951,0.00013644577,0.0004816165,0.00044815324,0.00034221789],"domain_scores_gemma":[0.9958689,0.002152322,0.0003072879,0.00064106565,0.0004669161,0.00056351995],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020332558,0.000930402,0.0014595921,0.0024696023,0.0018995663,0.004089258,0.0022210334,0.001445649,0.011655873],"category_scores_gemma":[0.00582044,0.0006847555,0.0016051487,0.0020141667,0.0030440572,0.009055778,0.0028443187,0.0037327395,0.0023275046],"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.00009819926,0.000031059928,0.00012993156,0.000037795628,0.00001399264,0.00006901858,0.00015268054,0.0012131664,0.00303336,0.98181677,0.001137292,0.012266798],"study_design_scores_gemma":[0.000023822055,0.000044247972,0.00018245443,0.00001556573,0.000028104301,0.00021184994,0.00008552772,0.010953788,0.0052925856,0.97862124,0.004509705,0.000031164716],"about_ca_topic_score_codex":0.00041712046,"about_ca_topic_score_gemma":0.0003804189,"teacher_disagreement_score":0.011655873,"about_ca_system_score_codex":0.0013237938,"about_ca_system_score_gemma":0.0009532143,"threshold_uncertainty_score":0.038992763},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2658709,0.0057245176,0.20952275,0.007998995,0.002684845,0.00014488728,0.0014447521,0.0004946007,0.5061138],"genre_scores_gemma":[0.83785486,0.0025358405,0.051546555,0.0016136171,0.0010437841,0.0001353361,0.000583777,0.00047667662,0.10420963],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999446,0.00015054095,0.000031131272,0.000076122844,0.00017375725,0.00012248712],"domain_scores_gemma":[0.9992774,0.00035600454,0.000042489417,0.00013067544,0.00010906717,0.000084230276],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009468253,0.000723868,0.0014301573,0.0014530421,0.0026193894,0.0039709,0.0010000693,0.0011262026,0.011187628],"category_scores_gemma":[0.0023735352,0.00058072375,0.0010067429,0.0020180466,0.003259178,0.0061312946,0.0021739108,0.0031951063,0.0017111534],"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.000012616913,0.0000054112325,0.000027551776,0.00000578125,0.0000013536753,0.000014055092,0.00007011292,0.00030900212,0.00009588968,0.9966673,0.0008515679,0.0019393741],"study_design_scores_gemma":[0.000006615757,0.000004703661,0.00003499765,0.0000069837142,0.0000024568528,0.000015913616,0.000029443783,0.00116654,0.00012232493,0.99474156,0.0038603928,0.00000803576],"about_ca_topic_score_codex":0.0024300017,"about_ca_topic_score_gemma":0.003250538,"teacher_disagreement_score":0.011187628,"about_ca_system_score_codex":0.0016386994,"about_ca_system_score_gemma":0.0011490914,"threshold_uncertainty_score":0.037426412},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9818379,0.00067292905,0.003923594,0.00041376628,0.00007445794,0.000008933056,0.00014712826,0.00007933712,0.012841962],"genre_scores_gemma":[0.9958121,0.00038475118,0.0010278986,0.000026839873,0.00011240785,0.0000129060545,0.00020454531,0.000017663395,0.00240074],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992411,0.00018359408,0.000051734045,0.00013512421,0.00019957343,0.00018893379],"domain_scores_gemma":[0.9958598,0.0020650432,0.00065165263,0.00041296525,0.00018864854,0.0008219267],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010777843,0.0007469751,0.00086542126,0.0037008754,0.0020307659,0.00393972,0.0012319132,0.0015336418,0.006410417],"category_scores_gemma":[0.004876672,0.00054032746,0.0009080474,0.001409622,0.0034751992,0.004076285,0.0018380474,0.0011310374,0.00028521675],"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.0011119302,0.000099447694,0.023026451,0.00035512945,0.00024272744,0.0012123005,0.0022048764,0.017185902,0.014205409,0.9055284,0.004194966,0.030632516],"study_design_scores_gemma":[0.00010036709,0.00020531198,0.02949562,0.00013711635,0.00023632731,0.0031950772,0.0014906867,0.042476427,0.010004104,0.90305984,0.009477862,0.00012135644],"about_ca_topic_score_codex":0.00061052805,"about_ca_topic_score_gemma":0.0005200328,"teacher_disagreement_score":0.006410417,"about_ca_system_score_codex":0.0012145535,"about_ca_system_score_gemma":0.00032686646,"threshold_uncertainty_score":0.021444976},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.073734276,0.0003598223,0.9171809,0.00031798816,0.00007633484,0.00008528022,0.00014345198,0.0013046344,0.0067972527],"genre_scores_gemma":[0.3035109,0.00028401177,0.687946,0.00018738619,0.00011007569,0.00012631391,0.00045502113,0.00066338317,0.006716947],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99845946,0.00035121376,0.00013805293,0.00032619789,0.00044873758,0.00027636575],"domain_scores_gemma":[0.9929322,0.005444408,0.00024851572,0.0009020592,0.00032632428,0.000146481],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014882456,0.0007168534,0.0015657367,0.000951391,0.0012598814,0.0018406695,0.0023445317,0.0012831117,0.0051696734],"category_scores_gemma":[0.009240247,0.0007922352,0.0016023741,0.0019180933,0.0019797357,0.00538632,0.003129925,0.0028112677,0.0012117473],"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.00047625313,0.0005245519,0.0027007232,0.0008689798,0.0001332888,0.00056012423,0.0015020124,0.1583951,0.016361075,0.42040426,0.009814143,0.38825944],"study_design_scores_gemma":[0.00009607668,0.00007905562,0.00017911031,0.00004678547,0.000060904702,0.00014886426,0.00018247198,0.53406906,0.009014813,0.45107913,0.0050182934,0.000025505346],"about_ca_topic_score_codex":0.0022739538,"about_ca_topic_score_gemma":0.006992562,"teacher_disagreement_score":0.0051696734,"about_ca_system_score_codex":0.0009035945,"about_ca_system_score_gemma":0.001320889,"threshold_uncertainty_score":0.017294228},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6525868,0.0010116444,0.1835438,0.0027390919,0.00034274653,0.00014555742,0.001828528,0.00073901756,0.15706281],"genre_scores_gemma":[0.9027713,0.0007115294,0.047465183,0.00057475036,0.00025509536,0.00017946676,0.0027855893,0.00030992995,0.04494721],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99858934,0.00034047794,0.00012747178,0.00029092171,0.00028303138,0.0003687024],"domain_scores_gemma":[0.99667645,0.0019997188,0.00036655233,0.00033463666,0.0002811146,0.00034159888],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00087517,0.0010872383,0.0012599275,0.0029888975,0.0036558285,0.0075760474,0.0022685402,0.0016886065,0.018066598],"category_scores_gemma":[0.0034171364,0.0012214052,0.0017356633,0.004150808,0.0037024072,0.00805227,0.0042407815,0.0036015986,0.0023334979],"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.00013873479,0.00010868483,0.0012508647,0.00009506819,0.000019420775,0.000280669,0.0013356268,0.0026091973,0.001972216,0.9716096,0.0029342445,0.01764574],"study_design_scores_gemma":[0.000018354218,0.000015889525,0.00041453945,0.000019491456,0.000013870409,0.00019542559,0.00023311931,0.00261833,0.0007486804,0.9923922,0.0033096222,0.00002051662],"about_ca_topic_score_codex":0.0017632531,"about_ca_topic_score_gemma":0.002743456,"teacher_disagreement_score":0.018066598,"about_ca_system_score_codex":0.0013302523,"about_ca_system_score_gemma":0.0009303364,"threshold_uncertainty_score":0.060438752},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.51523477,0.0019726483,0.1297403,0.0031582138,0.0009322277,0.00010543033,0.00051291205,0.00038221807,0.34796128],"genre_scores_gemma":[0.91949904,0.0010538192,0.019535072,0.0006731963,0.00092913315,0.000070677605,0.0003810697,0.00014787595,0.057710256],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995383,0.00008026323,0.000023208362,0.00008584355,0.00014673284,0.0001257585],"domain_scores_gemma":[0.9996057,0.000054397595,0.00007116693,0.000045123823,0.000103935985,0.00011974749],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00067488605,0.00077007775,0.00091977976,0.001796167,0.0012716013,0.0023109105,0.00094441616,0.0006072434,0.008514434],"category_scores_gemma":[0.00077578524,0.00028692055,0.00089283416,0.00094146666,0.0020742796,0.003533436,0.0015341649,0.0018323924,0.0017718897],"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.000030325657,0.000017819477,0.000096729615,0.000015737742,0.000005417433,0.000040050643,0.00010026808,0.00022201489,0.0008524042,0.9944522,0.00064410653,0.0035229144],"study_design_scores_gemma":[0.0000186658,0.000019194324,0.00024992577,0.0000076200918,0.0000108060685,0.00009342179,0.000063156906,0.0019227854,0.00047284953,0.9938443,0.003285944,0.000011240391],"about_ca_topic_score_codex":0.00080776337,"about_ca_topic_score_gemma":0.00072502234,"teacher_disagreement_score":0.008514434,"about_ca_system_score_codex":0.0011013808,"about_ca_system_score_gemma":0.00087138644,"threshold_uncertainty_score":0.02848363},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4260357,0.001263695,0.4086795,0.0036662996,0.00077126734,0.0002305399,0.0013729128,0.00078937516,0.15719071],"genre_scores_gemma":[0.8822414,0.0012434508,0.059713513,0.00070626097,0.0011889274,0.00050546613,0.0020213749,0.000267629,0.052112028],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975673,0.00081844546,0.00019606775,0.00052212627,0.0005007171,0.0003952855],"domain_scores_gemma":[0.9944072,0.003170815,0.00079941907,0.00053646404,0.00041461296,0.0006715048],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00171354,0.0015847583,0.0013217712,0.0029779987,0.0040524784,0.0076716626,0.0017619644,0.0019433969,0.014249969],"category_scores_gemma":[0.0051863045,0.0013033145,0.0026048138,0.0031811995,0.0051865554,0.010362786,0.0038405694,0.0038965938,0.0021339334],"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.000055149903,0.00003297167,0.00020798773,0.00002278792,0.000008255411,0.00018296165,0.0004651279,0.0008049722,0.0005728973,0.99372524,0.000812475,0.0031093175],"study_design_scores_gemma":[0.0000123269965,0.000015209837,0.00007023661,0.000008172549,0.000008399566,0.00017363066,0.00014301701,0.0015780407,0.00031221999,0.995726,0.0019415108,0.000011229394],"about_ca_topic_score_codex":0.00094466086,"about_ca_topic_score_gemma":0.0012432004,"teacher_disagreement_score":0.014249969,"about_ca_system_score_codex":0.0011456121,"about_ca_system_score_gemma":0.0012047212,"threshold_uncertainty_score":0.04767096},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.76975167,0.00031201303,0.13367814,0.0010067458,0.00015852418,0.00011948917,0.0010573415,0.0007381912,0.09317788],"genre_scores_gemma":[0.96335274,0.0001233007,0.02194142,0.00020891191,0.00005410823,0.00010701013,0.000465625,0.0001132192,0.013633693],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99901235,0.00030723182,0.000042383534,0.00015031356,0.00019591089,0.00029174748],"domain_scores_gemma":[0.9978295,0.0011424362,0.00018633428,0.0003278487,0.0002822163,0.00023165492],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00083710277,0.00031458578,0.0005084855,0.0009117085,0.0016843267,0.0014999255,0.00083372864,0.00070553937,0.010656477],"category_scores_gemma":[0.0025436166,0.00035680918,0.0003982237,0.00081285794,0.0011763161,0.0012028877,0.0012783775,0.000901704,0.0013870609],"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.000577514,0.000095604075,0.001338259,0.000062971754,0.000018486775,0.00033969758,0.00042049892,0.0023709547,0.015148655,0.9529933,0.004452403,0.022181742],"study_design_scores_gemma":[0.00026483688,0.00031115132,0.0015701252,0.0000634041,0.000051108535,0.001016258,0.00046676546,0.022843951,0.025346424,0.91837597,0.029598458,0.0000915649],"about_ca_topic_score_codex":0.0007605876,"about_ca_topic_score_gemma":0.00086490606,"teacher_disagreement_score":0.010656477,"about_ca_system_score_codex":0.00096282555,"about_ca_system_score_gemma":0.00079420535,"threshold_uncertainty_score":0.03564948},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5628834,0.00097231957,0.24076127,0.0013445357,0.00016811867,0.00018920946,0.002400931,0.0011163577,0.19016382],"genre_scores_gemma":[0.83196133,0.0010770736,0.11724873,0.00023846058,0.00006887295,0.0001709783,0.0031530082,0.00026307398,0.04581854],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996196,0.000059919046,0.000024269542,0.00006566627,0.00012090448,0.000109510336],"domain_scores_gemma":[0.9988883,0.0005817321,0.00008352679,0.00014266389,0.00021119535,0.00009260875],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016155998,0.00045183342,0.00067641767,0.0011228117,0.0012187735,0.0027471504,0.0011677492,0.00090538006,0.011770697],"category_scores_gemma":[0.0022989188,0.00042735637,0.0005104323,0.002801032,0.00071656867,0.0018244444,0.0017334166,0.0014750508,0.0017422813],"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.0001964679,0.0001521105,0.0016010512,0.00047190825,0.0000292854,0.0002094314,0.00066938007,0.024068657,0.008158032,0.8054497,0.012305128,0.14668891],"study_design_scores_gemma":[0.000059512455,0.000042648655,0.0009563725,0.000081526625,0.000044171655,0.0002498093,0.00044553328,0.077747494,0.0061995606,0.8878155,0.026328586,0.000029298379],"about_ca_topic_score_codex":0.004389149,"about_ca_topic_score_gemma":0.007563911,"teacher_disagreement_score":0.011770697,"about_ca_system_score_codex":0.0014144072,"about_ca_system_score_gemma":0.0010699277,"threshold_uncertainty_score":0.039376915},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5540152,0.0013985058,0.19220366,0.002643884,0.000986726,0.00009503148,0.00030763226,0.00068345707,0.24766594],"genre_scores_gemma":[0.92400956,0.00065177964,0.0223106,0.00048513952,0.000888665,0.00010501438,0.0002127926,0.00024514802,0.05109139],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99898416,0.00023692122,0.00004418643,0.00014629781,0.00036742628,0.00022103965],"domain_scores_gemma":[0.99795353,0.00094478694,0.00020153193,0.0001813285,0.00034701938,0.0003717525],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014065726,0.0014765349,0.0011353835,0.0047580055,0.00270302,0.003935439,0.0016403346,0.0015031656,0.010588287],"category_scores_gemma":[0.005151555,0.0007605963,0.0010685668,0.0026337174,0.0039605107,0.0049409056,0.0031082858,0.0038405145,0.0019436242],"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.000038238,0.00001913829,0.00013566558,0.000017766793,0.0000039021616,0.0001438403,0.00020053476,0.00047790684,0.0007184091,0.99337465,0.00081645104,0.0040533966],"study_design_scores_gemma":[0.0000136458075,0.000013564922,0.00017467984,0.00001143927,0.000007473871,0.00018690649,0.00006614676,0.0037174781,0.0005517208,0.99353194,0.001708796,0.000016142514],"about_ca_topic_score_codex":0.00090357073,"about_ca_topic_score_gemma":0.00148771,"teacher_disagreement_score":0.010588287,"about_ca_system_score_codex":0.0020813588,"about_ca_system_score_gemma":0.00077931,"threshold_uncertainty_score":0.03542137},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41804692,0.0036901266,0.23181942,0.006896686,0.0018032655,0.00017575538,0.00066433434,0.00066574995,0.33623776],"genre_scores_gemma":[0.89908135,0.0021836697,0.026422046,0.00073293544,0.0013523826,0.00018052974,0.0003880112,0.00028192173,0.06937722],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99853003,0.00043429868,0.00008129285,0.00022979363,0.0004544428,0.0002701265],"domain_scores_gemma":[0.99734795,0.0013083579,0.0003969834,0.00041466215,0.00029143784,0.00024063201],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009884038,0.0009908534,0.0014468589,0.003534603,0.0036695735,0.005628092,0.0010319493,0.002082277,0.011668156],"category_scores_gemma":[0.0050465846,0.00089736027,0.0010649688,0.005580727,0.0047348225,0.0062401295,0.0046550217,0.0050195064,0.0029073486],"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.000025734396,0.0000079521815,0.00009038376,0.000015272564,0.0000032768107,0.000054844157,0.00014060992,0.00035814932,0.00017965958,0.9940509,0.00096412696,0.0041090515],"study_design_scores_gemma":[0.000007655842,0.0000070855476,0.00003998979,0.000008482418,0.0000040002433,0.00006825887,0.00004634205,0.00085026823,0.00017800745,0.9958127,0.0029717041,0.0000054639263],"about_ca_topic_score_codex":0.00064813445,"about_ca_topic_score_gemma":0.0006380663,"teacher_disagreement_score":0.011668156,"about_ca_system_score_codex":0.0015252343,"about_ca_system_score_gemma":0.0008496435,"threshold_uncertainty_score":0.03903383},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17677745,0.003864915,0.13520856,0.009942863,0.001407092,0.000039786093,0.0003124585,0.00023729308,0.6722096],"genre_scores_gemma":[0.9138581,0.001890978,0.021361822,0.0011175608,0.0009324773,0.000044160777,0.00017282192,0.00009573633,0.060526155],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995702,0.00010561621,0.000026064252,0.00010006086,0.00012067699,0.00007732281],"domain_scores_gemma":[0.9992255,0.00037461036,0.0000684919,0.00012228609,0.00010674622,0.00010232188],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00085890834,0.00042899148,0.0006612927,0.0017252498,0.0014501737,0.0024020073,0.0005588178,0.0007737395,0.007674847],"category_scores_gemma":[0.002626875,0.00033702463,0.0005754988,0.0008902925,0.0036554919,0.0052701784,0.0022187128,0.002384583,0.0011452079],"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.0000055854384,0.0000025621239,0.000052756866,0.0000061564983,0.0000010858132,0.000013540675,0.00003530742,0.00008850605,0.00008675976,0.9972247,0.00064808445,0.0018350305],"study_design_scores_gemma":[0.0000048788334,0.000003344378,0.00014735424,0.000004320145,0.0000022227744,0.00006368265,0.000035578672,0.0003085667,0.00013899876,0.9935122,0.0057742735,0.000004497049],"about_ca_topic_score_codex":0.00071090506,"about_ca_topic_score_gemma":0.0005200097,"teacher_disagreement_score":0.007674847,"about_ca_system_score_codex":0.0008979808,"about_ca_system_score_gemma":0.00043823122,"threshold_uncertainty_score":0.02567488},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6952579,0.00084642565,0.25710708,0.0009715448,0.0005598583,0.000049776238,0.00014321433,0.00025804664,0.044806078],"genre_scores_gemma":[0.9621612,0.00044024357,0.024242388,0.00026586012,0.00039670695,0.00008174419,0.00017362871,0.00015628216,0.012081959],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99740005,0.00054838427,0.00023091065,0.0006313694,0.00061273953,0.00057659793],"domain_scores_gemma":[0.99145496,0.004262159,0.0009451618,0.0010026218,0.0011032786,0.001231775],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029701907,0.0012145211,0.0016464752,0.004379346,0.0036317534,0.005491227,0.0018819763,0.0018833159,0.004338706],"category_scores_gemma":[0.008055915,0.0011724075,0.001790409,0.0021493123,0.0073498115,0.010033183,0.0045965794,0.0041923407,0.00058364077],"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.00003006546,0.00001534996,0.00030620242,0.000017070279,0.0000058126516,0.00015388134,0.0003648932,0.00026311952,0.0006809137,0.99630535,0.000106314554,0.0017509956],"study_design_scores_gemma":[0.000012944439,0.000024415407,0.0002739665,0.00001475355,0.000011086885,0.00014438259,0.00014622377,0.0019180058,0.00066690333,0.995815,0.0009578306,0.000014487492],"about_ca_topic_score_codex":0.00058782194,"about_ca_topic_score_gemma":0.00073271425,"teacher_disagreement_score":0.005491227,"about_ca_system_score_codex":0.0017474323,"about_ca_system_score_gemma":0.0010219106,"threshold_uncertainty_score":0.01570803},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7237487,0.0025716866,0.14742617,0.002837254,0.0006669271,0.000068519934,0.0004569828,0.00027960783,0.121944174],"genre_scores_gemma":[0.9688657,0.0007639921,0.006906917,0.00025496937,0.0007115514,0.000043507735,0.0001914439,0.00005855058,0.022203319],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993469,0.00015440295,0.000034538145,0.00010093462,0.0002172123,0.00014606009],"domain_scores_gemma":[0.99771595,0.00088422146,0.0003669231,0.00027707638,0.00033370964,0.00042215796],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013342472,0.0010943516,0.0008931746,0.0030845774,0.0023118143,0.0034611216,0.0010730287,0.0010850339,0.008251824],"category_scores_gemma":[0.0048190304,0.00044485595,0.00093569997,0.0017036744,0.0039395927,0.005586782,0.0021351296,0.0022424175,0.0010068355],"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.000038615213,0.00001207301,0.00021301984,0.00001230918,0.0000033984095,0.00006315558,0.000113688395,0.00041310964,0.00038650326,0.99416083,0.00069370976,0.0038894836],"study_design_scores_gemma":[0.000010561517,0.000014107905,0.00019968451,0.000006418151,0.000006896343,0.00014669698,0.000055782097,0.0028629429,0.0003584097,0.9949397,0.0013840168,0.000014763245],"about_ca_topic_score_codex":0.0015031799,"about_ca_topic_score_gemma":0.0016245632,"teacher_disagreement_score":0.008251824,"about_ca_system_score_codex":0.0015687997,"about_ca_system_score_gemma":0.00095595,"threshold_uncertainty_score":0.027605057},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5280251,0.0021275564,0.1924954,0.003670983,0.0014463823,0.00009264467,0.00035409225,0.00031013353,0.2714778],"genre_scores_gemma":[0.95112246,0.00075299793,0.015906556,0.00081355503,0.00088969804,0.000084568106,0.00021037752,0.00014566311,0.030074155],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99844956,0.0005140795,0.00009652012,0.00027124392,0.00035457668,0.00031404226],"domain_scores_gemma":[0.99708575,0.0012698465,0.00032799543,0.00024111588,0.0006061935,0.00046913332],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027559823,0.0010965974,0.0011763704,0.003536923,0.0031402868,0.0045165434,0.0014370484,0.0015727646,0.011497923],"category_scores_gemma":[0.007063324,0.0006831654,0.0011932009,0.0026675735,0.006730454,0.0069288863,0.0030593462,0.0035614837,0.0020363398],"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.000027947326,0.00001107974,0.000081906386,0.0000085263955,0.0000030696401,0.000047602425,0.00012663836,0.0001041672,0.00021676606,0.9963736,0.00043238117,0.0025663453],"study_design_scores_gemma":[0.000014243477,0.000012635905,0.00014327487,0.000007111487,0.000004036591,0.00009988167,0.00007076648,0.0009606805,0.00029067014,0.99682045,0.0015633146,0.000012882373],"about_ca_topic_score_codex":0.0013025375,"about_ca_topic_score_gemma":0.00092431775,"teacher_disagreement_score":0.011497923,"about_ca_system_score_codex":0.0018254911,"about_ca_system_score_gemma":0.0010489962,"threshold_uncertainty_score":0.038464367},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32407233,0.008134574,0.29981324,0.015452394,0.0018927588,0.000111019486,0.0018281593,0.0010404064,0.34765506],"genre_scores_gemma":[0.9174713,0.0027553076,0.023673747,0.0012432451,0.0017621578,0.00016327047,0.0010156588,0.00039481078,0.05152045],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986028,0.00035406608,0.00006632313,0.00031908203,0.00045208394,0.00020560718],"domain_scores_gemma":[0.9977506,0.0010623798,0.00027454353,0.00033749148,0.00035277446,0.00022227275],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001713023,0.0018164571,0.0010418806,0.0042232852,0.0028376658,0.0069147074,0.0019604324,0.0027186403,0.015346812],"category_scores_gemma":[0.0062977537,0.00091005646,0.0010817111,0.0033888766,0.004875066,0.01315533,0.0032726293,0.0064001908,0.003084375],"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.000009756662,0.000009771095,0.000092776136,0.000019485737,0.0000027688461,0.000018171504,0.00010851327,0.0002057575,0.00010325624,0.99579865,0.0011349401,0.0024961506],"study_design_scores_gemma":[0.0000055461887,0.0000029424925,0.000055968707,0.000007481848,0.0000039843526,0.000029567364,0.000027591554,0.00073632656,0.00011010633,0.99639624,0.0026172607,0.000007012611],"about_ca_topic_score_codex":0.0010494681,"about_ca_topic_score_gemma":0.00088185613,"teacher_disagreement_score":0.015346812,"about_ca_system_score_codex":0.0031761292,"about_ca_system_score_gemma":0.0011329197,"threshold_uncertainty_score":0.051340222},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15334566,0.0013637283,0.28113547,0.0037459135,0.0018148663,0.00009829885,0.00048002045,0.0005930254,0.55742306],"genre_scores_gemma":[0.84481394,0.0014672726,0.050295316,0.0020715198,0.0012509775,0.0001547745,0.0005164556,0.0006593301,0.098770365],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987967,0.0002524945,0.00007600835,0.00022890561,0.0004148536,0.0002310616],"domain_scores_gemma":[0.99905294,0.00026958453,0.00008370836,0.00020051618,0.00022941329,0.0001638958],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017551291,0.00075600296,0.0010537063,0.002127287,0.0029336112,0.005600532,0.0012295241,0.0014445371,0.008422522],"category_scores_gemma":[0.0029790732,0.0007313734,0.0011330643,0.0013380903,0.0040623904,0.0070075,0.0025529673,0.0054470454,0.0029689486],"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.000009912808,0.0000064872042,0.000039603616,0.0000073460183,0.0000018003307,0.000028578212,0.00005163951,0.0000596641,0.00023152735,0.99649847,0.00075277046,0.0023120288],"study_design_scores_gemma":[0.0000057187535,0.000004602525,0.00004574857,0.0000049246487,0.0000028059774,0.000069639595,0.000032045686,0.0006240697,0.00042007584,0.99458706,0.004195366,0.000007934186],"about_ca_topic_score_codex":0.0007268628,"about_ca_topic_score_gemma":0.0007028195,"teacher_disagreement_score":0.008422522,"about_ca_system_score_codex":0.0014716834,"about_ca_system_score_gemma":0.0007701761,"threshold_uncertainty_score":0.028176129},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5633338,0.0007550783,0.35646972,0.0008302998,0.00012493563,0.0001423359,0.0013158228,0.00091128045,0.07611672],"genre_scores_gemma":[0.9390022,0.00047008655,0.040902756,0.00029025425,0.000091888556,0.0002192873,0.0010178924,0.0002045238,0.01780098],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975668,0.0007361061,0.000107902386,0.000455009,0.00054600945,0.000588224],"domain_scores_gemma":[0.9945803,0.0028505553,0.0005470055,0.00085480296,0.0005975462,0.00056970754],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010437529,0.0010878656,0.0012588815,0.0021411781,0.0019424177,0.002748282,0.0011786518,0.0014087342,0.011658356],"category_scores_gemma":[0.006099536,0.0010983151,0.00072406844,0.0023266366,0.0012096092,0.003003546,0.0025245983,0.0014781675,0.0020776698],"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.00055294303,0.00009968249,0.00170156,0.0001774548,0.000053635256,0.0006144391,0.00044870618,0.01372423,0.012370757,0.9317608,0.004637501,0.033858392],"study_design_scores_gemma":[0.00009505781,0.0001375543,0.00082566513,0.00008304986,0.00006178289,0.0005249398,0.000271026,0.05207719,0.005811297,0.9308794,0.009194229,0.000038781585],"about_ca_topic_score_codex":0.0013082518,"about_ca_topic_score_gemma":0.0013809227,"teacher_disagreement_score":0.011658356,"about_ca_system_score_codex":0.0010464775,"about_ca_system_score_gemma":0.000655483,"threshold_uncertainty_score":0.039001048},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.60526717,0.0016150333,0.07691783,0.0036244662,0.00041611158,0.00006650386,0.0005749143,0.00057761784,0.3109403],"genre_scores_gemma":[0.9558859,0.0006675414,0.018052738,0.00043163306,0.00022233828,0.00006509331,0.0002109184,0.00009867179,0.024365213],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994455,0.000119063334,0.00003183853,0.00009701729,0.00016023617,0.00014629615],"domain_scores_gemma":[0.9988034,0.000631108,0.000112874826,0.00022845091,0.000090433,0.0001336953],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005778342,0.00045245254,0.0008830227,0.0011440875,0.0026185527,0.0032678763,0.0011227684,0.0015046964,0.006979731],"category_scores_gemma":[0.002826349,0.00040596735,0.0007805772,0.0023647028,0.003579163,0.0038678143,0.0022196611,0.0022856134,0.0007938902],"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.000019819518,0.0000070522574,0.00009517507,0.000012879501,0.0000022312124,0.000091811606,0.0001079995,0.0003973091,0.00032661145,0.9961953,0.0007403108,0.0020034842],"study_design_scores_gemma":[0.0000104418905,0.000005384393,0.00008775374,0.000005331822,0.000004313516,0.00014300909,0.000040159237,0.001538942,0.00027125265,0.99479103,0.0030932783,0.00000910249],"about_ca_topic_score_codex":0.0015189592,"about_ca_topic_score_gemma":0.0020875956,"teacher_disagreement_score":0.006979731,"about_ca_system_score_codex":0.0011037923,"about_ca_system_score_gemma":0.0007454033,"threshold_uncertainty_score":0.023349524},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49357784,0.004027402,0.24316798,0.011100762,0.0034620557,0.00021704346,0.0012251926,0.001757891,0.24146391],"genre_scores_gemma":[0.90151733,0.0016186698,0.01767839,0.0013428217,0.0020755015,0.00014302396,0.0004151363,0.000571112,0.074637964],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975357,0.000680704,0.00013504032,0.00034722988,0.0008393765,0.0004617949],"domain_scores_gemma":[0.99496764,0.0015848866,0.00079334766,0.000733805,0.0009601804,0.0009601246],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00244524,0.0015398705,0.0019840214,0.006056698,0.0027855306,0.0059110126,0.0017873072,0.0025539242,0.013584534],"category_scores_gemma":[0.009057232,0.0009505697,0.0010604439,0.0034614212,0.0048269103,0.0067699533,0.004054178,0.0040120194,0.0033855028],"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.000017894756,0.00002624673,0.00018042633,0.00002386296,0.000005658466,0.000047318874,0.00011627168,0.00037315566,0.0002844244,0.9946355,0.0012923419,0.0029969309],"study_design_scores_gemma":[0.000011528828,0.0000108496015,0.000161766,0.000017601978,0.000009503862,0.00016692409,0.000051818388,0.0032428761,0.0003251955,0.9936905,0.0022893269,0.000022106246],"about_ca_topic_score_codex":0.0007990341,"about_ca_topic_score_gemma":0.001107485,"teacher_disagreement_score":0.013584534,"about_ca_system_score_codex":0.0017405214,"about_ca_system_score_gemma":0.0019856573,"threshold_uncertainty_score":0.045444787},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25026336,0.0048969765,0.08419046,0.007371571,0.0015233264,0.00007753763,0.00053673727,0.00024556954,0.6508945],"genre_scores_gemma":[0.91951275,0.0020575745,0.023430621,0.00093605486,0.0017126183,0.00010279987,0.00040056318,0.0001439491,0.051703073],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993118,0.00023269794,0.00003522728,0.000097942815,0.00020361473,0.00011876357],"domain_scores_gemma":[0.99826044,0.00080196594,0.00024455172,0.00014539124,0.00034738556,0.0002002616],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009422676,0.0008690846,0.00080810825,0.003531992,0.002357606,0.0054769493,0.0013257874,0.0013313517,0.015517709],"category_scores_gemma":[0.004146649,0.0006241178,0.0007480476,0.0025467216,0.004006895,0.0056825005,0.0018958651,0.0035092616,0.0014281683],"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.000008467731,0.0000069293496,0.000037419795,0.000013214779,8.9635296e-7,0.000040269122,0.000088436966,0.00015084176,0.0001318577,0.9977719,0.00058886077,0.0011608375],"study_design_scores_gemma":[0.0000104332985,0.000005608063,0.00011011613,0.000014698499,0.0000031984723,0.00008898947,0.00008738885,0.0009617405,0.00010581659,0.9937697,0.0048323325,0.000010050154],"about_ca_topic_score_codex":0.0015266547,"about_ca_topic_score_gemma":0.002071912,"teacher_disagreement_score":0.015517709,"about_ca_system_score_codex":0.0024229425,"about_ca_system_score_gemma":0.0007686686,"threshold_uncertainty_score":0.05191189},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.83843774,0.0022000377,0.1070477,0.0028842674,0.00039103822,0.00006276183,0.00036743225,0.00035564,0.04825348],"genre_scores_gemma":[0.98223984,0.0005889949,0.0069159362,0.00019419673,0.0005723685,0.00004526667,0.0002587538,0.000068516085,0.009116235],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99840885,0.00038835863,0.000101069505,0.0003341577,0.0003213885,0.0004462578],"domain_scores_gemma":[0.9955848,0.0025550518,0.00072418305,0.0003634144,0.00030364498,0.00046895363],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002063251,0.0009473577,0.001550881,0.003970035,0.0030628971,0.005713441,0.0021185805,0.0012693554,0.0063778413],"category_scores_gemma":[0.0047157006,0.000811221,0.0013973975,0.0037741691,0.009132392,0.012448898,0.0030736204,0.0033823492,0.0007941505],"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.000054207878,0.000033755547,0.00031462536,0.000022183882,0.0000072019284,0.00005863802,0.00062072434,0.00060650485,0.00027773352,0.9950912,0.00028427015,0.0026289576],"study_design_scores_gemma":[0.000017958368,0.000013433211,0.00019368477,0.0000057793873,0.000011602216,0.00003206727,0.0001521154,0.0012631159,0.00024283183,0.9974329,0.0006245865,0.000009961803],"about_ca_topic_score_codex":0.0019155827,"about_ca_topic_score_gemma":0.0020819036,"teacher_disagreement_score":0.0063778413,"about_ca_system_score_codex":0.0025333322,"about_ca_system_score_gemma":0.0011071175,"threshold_uncertainty_score":0.021336019},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.51594114,0.0025037758,0.3497065,0.0040105386,0.00035793465,0.00009774495,0.00034141468,0.00050643756,0.1265344],"genre_scores_gemma":[0.9519405,0.0017882037,0.022304205,0.0006336233,0.00061727926,0.00014450992,0.00036496474,0.00028820965,0.021918407],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981804,0.0008034046,0.00006690902,0.00019665768,0.00045278025,0.00029987944],"domain_scores_gemma":[0.969815,0.024251917,0.00093772274,0.001245556,0.002478405,0.0012714313],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004672688,0.0011996478,0.001590742,0.004028506,0.0020172296,0.0034545066,0.0022992666,0.0015864763,0.009105029],"category_scores_gemma":[0.032628514,0.0008063071,0.0012344839,0.0019428753,0.0053843535,0.007827464,0.004050289,0.0043984256,0.001015242],"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.0000405451,0.000020977128,0.00039005675,0.00003507046,0.000007983796,0.00005622128,0.00023030334,0.003095607,0.00043468003,0.99063873,0.0008039024,0.0042459127],"study_design_scores_gemma":[0.000014785016,0.00001979928,0.0002840933,0.00002214939,0.000008682433,0.00007968691,0.000065081935,0.03422346,0.000360279,0.96414113,0.00076538225,0.000015528616],"about_ca_topic_score_codex":0.0016239934,"about_ca_topic_score_gemma":0.00143019,"teacher_disagreement_score":0.009105029,"about_ca_system_score_codex":0.0022064184,"about_ca_system_score_gemma":0.0010921546,"threshold_uncertainty_score":0.030459344},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.76268214,0.0009969999,0.043717586,0.0024085674,0.0004077162,0.00005789101,0.0003142961,0.0002341143,0.18918073],"genre_scores_gemma":[0.97932327,0.00027318043,0.004758353,0.00025984706,0.00025903896,0.000026536645,0.00014694147,0.00005775654,0.01489511],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993562,0.00016040946,0.000034259585,0.00009987567,0.00018384037,0.00016534064],"domain_scores_gemma":[0.9994431,0.00014379548,0.00010605999,0.00007062936,0.00008245848,0.0001539937],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006390041,0.00065460056,0.00084078085,0.0022430292,0.0024319165,0.0037140204,0.0013748287,0.0009966025,0.010204541],"category_scores_gemma":[0.0014186625,0.0004368059,0.0007191471,0.0012876623,0.0039575514,0.003662029,0.0016341568,0.0015460515,0.00083195185],"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.000018694189,0.000019863644,0.00012469682,0.000012616255,0.0000030117246,0.000074465264,0.000099964775,0.0010085725,0.00066032656,0.9960167,0.0004049099,0.001556146],"study_design_scores_gemma":[0.000008703837,0.000010762666,0.0002391504,0.0000069051734,0.0000030849997,0.00008070876,0.00007906713,0.005050917,0.00020892176,0.99343574,0.00086271344,0.000013211226],"about_ca_topic_score_codex":0.0030406497,"about_ca_topic_score_gemma":0.003711805,"teacher_disagreement_score":0.010204541,"about_ca_system_score_codex":0.0018368703,"about_ca_system_score_gemma":0.000891156,"threshold_uncertainty_score":0.034137607},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44737032,0.009274157,0.21063443,0.07122395,0.0057051973,0.00012887095,0.0013312835,0.00079233485,0.2535394],"genre_scores_gemma":[0.9372627,0.0034592012,0.029219529,0.0041541955,0.0053812605,0.00017627049,0.0014074902,0.0003455696,0.01859381],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9946525,0.0021251966,0.00028796648,0.0011067212,0.0010456031,0.00078200403],"domain_scores_gemma":[0.9446622,0.044765264,0.0022351195,0.0045564375,0.0019865502,0.0017943511],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01081947,0.0014790897,0.0031538892,0.0029832076,0.0052737137,0.009332743,0.0041697277,0.006035896,0.011708846],"category_scores_gemma":[0.0464395,0.0015221788,0.0023903353,0.0038154472,0.018513203,0.03044306,0.006273617,0.0147688445,0.0020223479],"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.00013417478,0.000042830434,0.00047590077,0.00010157934,0.0000089986615,0.00009667704,0.0005611194,0.0012442579,0.00022167065,0.9889732,0.0037057905,0.0044337916],"study_design_scores_gemma":[0.000010809663,0.000005127858,0.000093992196,0.000019910398,0.0000038574403,0.000031057734,0.00008181906,0.0010994807,0.000060428574,0.9977652,0.00082109025,0.0000072711605],"about_ca_topic_score_codex":0.00153431,"about_ca_topic_score_gemma":0.0012825907,"teacher_disagreement_score":0.011708846,"about_ca_system_score_codex":0.002997535,"about_ca_system_score_gemma":0.0014988675,"threshold_uncertainty_score":0.057219505},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33513758,0.0027358087,0.51426667,0.0025654286,0.0010897057,0.00015370378,0.0003115066,0.0008129712,0.14292666],"genre_scores_gemma":[0.8557107,0.002905901,0.07136051,0.0010818086,0.0013159849,0.00029717412,0.000443722,0.0009158725,0.06596841],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996412,0.00010799083,0.000021579162,0.00006518804,0.000104975894,0.000059096492],"domain_scores_gemma":[0.99824214,0.0006718435,0.00023417325,0.00019841622,0.00025625227,0.00039715445],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010634713,0.0012588396,0.0010280027,0.003547956,0.001372127,0.003400524,0.0020011913,0.0022181703,0.011281988],"category_scores_gemma":[0.005095944,0.0006375433,0.0013208614,0.0016533022,0.0030535199,0.00540295,0.0016399785,0.0028718929,0.0020311552],"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.0000127522235,0.000019948167,0.00008779086,0.000027288232,0.0000042340944,0.0000670216,0.00009695707,0.001730741,0.000598427,0.9925787,0.00080380694,0.0039722817],"study_design_scores_gemma":[0.000010731522,0.000011203269,0.000121197656,0.000019633531,0.0000071532018,0.00014900429,0.000069740934,0.027574826,0.00040725857,0.9699772,0.0016362012,0.000015823041],"about_ca_topic_score_codex":0.0006562377,"about_ca_topic_score_gemma":0.0009255467,"teacher_disagreement_score":0.011281988,"about_ca_system_score_codex":0.0010905239,"about_ca_system_score_gemma":0.000557104,"threshold_uncertainty_score":0.03774202},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16481611,0.0011772095,0.11541544,0.003945652,0.0022672357,0.0000660276,0.0006003107,0.00033408147,0.711378],"genre_scores_gemma":[0.6885265,0.0017708059,0.037316862,0.0014281606,0.002226944,0.00012463357,0.0009339437,0.0005602954,0.2671118],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99930143,0.00015020528,0.00003483939,0.000114384195,0.00028664514,0.00011257282],"domain_scores_gemma":[0.99922705,0.00018897507,0.00007363431,0.000113424256,0.00021850986,0.00017845893],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007752037,0.0009648651,0.0009392988,0.0024257277,0.0022098667,0.0035015997,0.0011662097,0.0012350625,0.017329222],"category_scores_gemma":[0.0019300441,0.00046886274,0.00074859883,0.0015497553,0.0024325554,0.006031475,0.0027816154,0.004658542,0.0039023536],"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.000010529939,0.000016223008,0.0000584694,0.000011552198,0.0000019486436,0.000054977332,0.000084984575,0.000080660764,0.0002829501,0.9942814,0.0016444378,0.003471751],"study_design_scores_gemma":[0.000005777089,0.000004500583,0.00013836045,0.000006987485,0.0000037241962,0.00016630796,0.000045942386,0.0009737655,0.00031635162,0.99235475,0.0059776795,0.0000057997436],"about_ca_topic_score_codex":0.00072535337,"about_ca_topic_score_gemma":0.0011089197,"teacher_disagreement_score":0.017329222,"about_ca_system_score_codex":0.0012496344,"about_ca_system_score_gemma":0.0007893674,"threshold_uncertainty_score":0.057972014},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7807797,0.0038690171,0.1484399,0.005303772,0.00018916836,0.000044846445,0.0008921695,0.0005204122,0.0599611],"genre_scores_gemma":[0.9893356,0.00086364103,0.0047657075,0.00031149838,0.000380865,0.000064504,0.0003662331,0.00009720725,0.0038147846],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99780124,0.000942475,0.00006816805,0.00030110445,0.00044636108,0.00044061634],"domain_scores_gemma":[0.97959787,0.013718742,0.001968004,0.0013555959,0.0015269321,0.0018328062],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0041565537,0.00081706344,0.0014920521,0.005389003,0.0018911517,0.0055338,0.0024636362,0.0014450592,0.008943448],"category_scores_gemma":[0.025750803,0.0007189473,0.000747428,0.0027408716,0.007856116,0.007936208,0.0031754451,0.0032323417,0.0008119878],"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.000057715893,0.000018743058,0.0013063244,0.000037148013,0.000009098183,0.000031817315,0.00021669867,0.0024036241,0.000340896,0.9912026,0.0010054477,0.0033698534],"study_design_scores_gemma":[0.000014845757,0.000016153876,0.0015318261,0.000025980476,0.000007211168,0.00006987621,0.00008936996,0.018346103,0.00020602145,0.9788619,0.0008098531,0.000020877214],"about_ca_topic_score_codex":0.0028184084,"about_ca_topic_score_gemma":0.0019203869,"teacher_disagreement_score":0.008943448,"about_ca_system_score_codex":0.0027200307,"about_ca_system_score_gemma":0.0010899412,"threshold_uncertainty_score":0.02991879},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34193075,0.0025662312,0.24679005,0.0053924313,0.0021852003,0.000086145825,0.0005085986,0.0004074761,0.40013313],"genre_scores_gemma":[0.8807989,0.0024916225,0.028145328,0.0016006231,0.0019649116,0.00012979873,0.0005619782,0.000428775,0.08387805],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99861836,0.0004465992,0.00006969577,0.00020798326,0.00036512053,0.00029224632],"domain_scores_gemma":[0.9965064,0.0019412232,0.00029808457,0.00033442935,0.00050789467,0.00041202785],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024633808,0.0016797371,0.0014972728,0.004159247,0.00358635,0.0049556005,0.0022353767,0.002206264,0.0120875845],"category_scores_gemma":[0.0075526685,0.0010502912,0.0018427506,0.0023781904,0.007017805,0.008873355,0.0041402997,0.0067960448,0.0020278553],"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.000016442544,0.00000721779,0.00005285961,0.000006779529,0.0000017760605,0.000016241545,0.00006560298,0.00018849302,0.00007314494,0.9979602,0.00040908396,0.0012020454],"study_design_scores_gemma":[0.0000074688915,0.00000853941,0.00005729523,0.000008820695,0.000004018109,0.0000266318,0.000038901704,0.0013608111,0.000099055454,0.9967636,0.0016185263,0.000006393741],"about_ca_topic_score_codex":0.001674338,"about_ca_topic_score_gemma":0.0013672586,"teacher_disagreement_score":0.0120875845,"about_ca_system_score_codex":0.0025834339,"about_ca_system_score_gemma":0.0009961283,"threshold_uncertainty_score":0.040436983},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42021886,0.00064411905,0.47326377,0.0012007591,0.0011976106,0.00019381671,0.00079143944,0.0042438214,0.09824581],"genre_scores_gemma":[0.84083736,0.00064923795,0.119769156,0.00051497895,0.00023465409,0.00015580788,0.00067195966,0.0013200142,0.035846896],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994772,0.00011762709,0.000039227147,0.00010398369,0.0001683939,0.00009360054],"domain_scores_gemma":[0.99910164,0.0003482371,0.000061119295,0.0003366579,0.0000862982,0.000066011],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041634386,0.0006847108,0.00086941343,0.0010412679,0.0010511776,0.0022007853,0.0007818882,0.00095597596,0.016359515],"category_scores_gemma":[0.0020181283,0.00051027857,0.0007691141,0.0013094142,0.0011792441,0.0028282716,0.0016649003,0.0013933145,0.0040078084],"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.00014555365,0.00009290025,0.0003188597,0.00008066458,0.00001684485,0.00026609554,0.0002483052,0.011809923,0.010629174,0.90065473,0.0070773163,0.068659626],"study_design_scores_gemma":[0.000033429464,0.000059381317,0.00013671706,0.000032091244,0.000015643796,0.00018405277,0.00012130285,0.039301943,0.007721252,0.94223523,0.010132668,0.000026274543],"about_ca_topic_score_codex":0.00048565504,"about_ca_topic_score_gemma":0.00088591164,"teacher_disagreement_score":0.016359515,"about_ca_system_score_codex":0.00068775873,"about_ca_system_score_gemma":0.0003897948,"threshold_uncertainty_score":0.05472803},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6543535,0.0008883586,0.20020373,0.0022363607,0.0004296428,0.000082038925,0.00039938337,0.0010619123,0.14034513],"genre_scores_gemma":[0.9606553,0.00046917485,0.010951578,0.00026318975,0.0005109916,0.00009860555,0.000332406,0.0003313764,0.026387399],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992162,0.00024166839,0.000024737283,0.00009741554,0.00022787957,0.00019205733],"domain_scores_gemma":[0.99698985,0.0014565369,0.00044285302,0.00023705853,0.00033941914,0.0005342737],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012411139,0.0012415448,0.0010255215,0.003968323,0.0016179727,0.0038394004,0.0018303161,0.0018397657,0.013538523],"category_scores_gemma":[0.007945692,0.0006826343,0.000932122,0.0017261304,0.0031016602,0.0033856153,0.0022591904,0.0030805364,0.0018247389],"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.000054345353,0.00004262293,0.00055694743,0.0000386386,0.000006350383,0.00012720101,0.00022953442,0.00240846,0.0013147651,0.98665255,0.0016820056,0.0068866205],"study_design_scores_gemma":[0.000022438633,0.000025993722,0.0008043995,0.000035025074,0.000009223439,0.00024985394,0.00011770679,0.02647879,0.00086660247,0.9697953,0.0015713715,0.000023350049],"about_ca_topic_score_codex":0.0010976378,"about_ca_topic_score_gemma":0.0007296692,"teacher_disagreement_score":0.013538523,"about_ca_system_score_codex":0.0020378926,"about_ca_system_score_gemma":0.0007192807,"threshold_uncertainty_score":0.045290828},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13557054,0.0007196484,0.05727096,0.0021826918,0.0011295808,0.00011176132,0.00068666314,0.00037649763,0.80195165],"genre_scores_gemma":[0.7019929,0.0008676572,0.015009278,0.00084129424,0.00085903716,0.00013254545,0.00087041495,0.0004559848,0.27897084],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99928564,0.0001280829,0.00003318549,0.00013666926,0.00023140477,0.0001849232],"domain_scores_gemma":[0.9993456,0.00015877286,0.0000544948,0.0001570968,0.00016111684,0.00012295933],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005944037,0.0009740897,0.0010044359,0.0019631577,0.0031059242,0.004641141,0.0010815813,0.001200345,0.031385902],"category_scores_gemma":[0.0014128985,0.0006206618,0.0009910937,0.0014012927,0.0032991578,0.006134291,0.0027065973,0.0035576578,0.0066524628],"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.000007849637,0.000008430784,0.000026892585,0.0000064134233,0.0000013005861,0.000015482277,0.00006433035,0.000040222978,0.00014457249,0.99702114,0.0013512786,0.001312055],"study_design_scores_gemma":[0.000007004319,0.0000050819094,0.0000972965,0.0000069425705,0.0000044669996,0.00007588762,0.00006695571,0.0003456112,0.00030163207,0.9912776,0.007806506,0.0000050588733],"about_ca_topic_score_codex":0.0007396198,"about_ca_topic_score_gemma":0.0009278662,"teacher_disagreement_score":0.031385902,"about_ca_system_score_codex":0.0015156232,"about_ca_system_score_gemma":0.00084554584,"threshold_uncertainty_score":0.104996264},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7903144,0.0010415309,0.108898744,0.0010569408,0.00042528487,0.000054764932,0.00048626112,0.0004533818,0.097268745],"genre_scores_gemma":[0.94592655,0.001058385,0.017851138,0.00051208376,0.0006050341,0.000070046735,0.0015629451,0.00034880554,0.03206489],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99939024,0.00013416365,0.00003496155,0.00010421209,0.00020941393,0.00012706261],"domain_scores_gemma":[0.99807006,0.0008166002,0.00021581266,0.0002479118,0.0003020145,0.00034765503],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006026013,0.0007024532,0.001033948,0.0018704535,0.0014089396,0.0025102657,0.0013033517,0.0014705047,0.012108368],"category_scores_gemma":[0.0031301007,0.00035684387,0.00079604087,0.0014670695,0.002087255,0.003986446,0.001606024,0.0025976992,0.0019267052],"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.0001020953,0.00010030418,0.0016798,0.00014454662,0.000013014804,0.00023441722,0.00038740237,0.003376458,0.0033961737,0.9680942,0.00505168,0.017419977],"study_design_scores_gemma":[0.000019493864,0.00005093503,0.0014580402,0.00005311671,0.000012354677,0.00034757287,0.0001915983,0.026781615,0.0008200531,0.96538335,0.0048636026,0.00001823623],"about_ca_topic_score_codex":0.0007584467,"about_ca_topic_score_gemma":0.00096099725,"teacher_disagreement_score":0.012108368,"about_ca_system_score_codex":0.00049307337,"about_ca_system_score_gemma":0.0004104311,"threshold_uncertainty_score":0.040506482},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.86357975,0.0008201264,0.03655385,0.0026597907,0.0004456682,0.000058647653,0.00044132196,0.00039923823,0.095041655],"genre_scores_gemma":[0.9852378,0.0004146435,0.0036115355,0.00013380063,0.00021696808,0.000024209674,0.00014348142,0.00011265037,0.010104971],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99943,0.00010967685,0.000015105404,0.00009887776,0.00015395701,0.00019237488],"domain_scores_gemma":[0.99787104,0.0010242764,0.0003897013,0.00015819559,0.00021084954,0.00034584364],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00055802206,0.000799127,0.00062498264,0.0031395736,0.0015121894,0.0025548209,0.0017316953,0.001093093,0.008004709],"category_scores_gemma":[0.0049192766,0.00058395736,0.00066472247,0.0018827583,0.0033886558,0.002907281,0.0018798144,0.0027528678,0.0010163491],"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.0002533043,0.00008146162,0.002227891,0.00017187482,0.000019718505,0.0003957363,0.0011210394,0.0092744855,0.0040506236,0.95436513,0.0049806917,0.023058094],"study_design_scores_gemma":[0.00003723049,0.0000372835,0.002321224,0.000060552084,0.000026429743,0.00040379394,0.00046323225,0.027844522,0.0019040279,0.9628606,0.0039923345,0.000048773847],"about_ca_topic_score_codex":0.0031128281,"about_ca_topic_score_gemma":0.005636061,"teacher_disagreement_score":0.008004709,"about_ca_system_score_codex":0.0020493718,"about_ca_system_score_gemma":0.0010045068,"threshold_uncertainty_score":0.0267784},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6667421,0.0009910684,0.2987095,0.0024035352,0.00054085115,0.000080169964,0.0007340642,0.00062643184,0.029172294],"genre_scores_gemma":[0.9815341,0.00041592703,0.0091477595,0.00027293968,0.0007451839,0.00008137465,0.0003484705,0.00022083883,0.007233317],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99797565,0.0007501921,0.00007256148,0.00029278724,0.00043652946,0.0004722866],"domain_scores_gemma":[0.98173606,0.011311632,0.0021856513,0.0017778967,0.0011934116,0.0017953165],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003914881,0.001027709,0.002180379,0.004462184,0.0016211538,0.0044517997,0.0028300835,0.0019692716,0.007016362],"category_scores_gemma":[0.021045813,0.0014143424,0.001320523,0.0027471413,0.006503382,0.0059337295,0.0027217255,0.0031004867,0.00075764884],"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.00007826605,0.00003665392,0.00073081185,0.000024125822,0.000014391685,0.00007785422,0.00016418032,0.007784502,0.0010156716,0.98639023,0.001040179,0.0026430695],"study_design_scores_gemma":[0.000017125443,0.00001534383,0.0008480492,0.00001829979,0.000009001044,0.00006950418,0.000051518986,0.054734737,0.0003549913,0.94340277,0.0004378907,0.000040915475],"about_ca_topic_score_codex":0.0019190301,"about_ca_topic_score_gemma":0.0022457798,"teacher_disagreement_score":0.007016362,"about_ca_system_score_codex":0.003055107,"about_ca_system_score_gemma":0.0015166309,"threshold_uncertainty_score":0.02347207},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8030742,0.00021269917,0.13914889,0.0009399462,0.00023087925,0.00007870636,0.00064204546,0.00043173577,0.055240814],"genre_scores_gemma":[0.98066896,0.00013394952,0.010516476,0.0001746368,0.00008226672,0.000050224462,0.00033422708,0.00011010719,0.00792906],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992632,0.00017633692,0.00002813094,0.00015541953,0.00017292956,0.00020393443],"domain_scores_gemma":[0.99795014,0.0007327976,0.0002537265,0.00030302745,0.00046157543,0.00029869212],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00079967466,0.00047411435,0.0003052092,0.0013172677,0.0010119939,0.0015406515,0.00076247664,0.00062527275,0.009830876],"category_scores_gemma":[0.0024214792,0.0002574609,0.0006790749,0.00087401824,0.0016509434,0.002665396,0.0008134325,0.0009351056,0.0007964161],"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.000121776284,0.000029231298,0.0005611732,0.000033711603,0.0000067159704,0.00009349155,0.00014466948,0.002531101,0.0037798905,0.9785674,0.0021468385,0.0119839525],"study_design_scores_gemma":[0.000050969003,0.00010857015,0.0015710754,0.000020687194,0.000017853641,0.0003411841,0.0002100226,0.039421223,0.005445388,0.9444244,0.008348025,0.000040651576],"about_ca_topic_score_codex":0.0027365463,"about_ca_topic_score_gemma":0.0020822682,"teacher_disagreement_score":0.009830876,"about_ca_system_score_codex":0.002115955,"about_ca_system_score_gemma":0.000802126,"threshold_uncertainty_score":0.03288752},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18820807,0.0003240105,0.7549643,0.0010273491,0.00018324217,0.00027355237,0.00095570524,0.0016459029,0.05241793],"genre_scores_gemma":[0.7411445,0.00033364075,0.22331363,0.0007145303,0.00023095659,0.00049747044,0.0012865722,0.00062213733,0.03185656],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9969091,0.0013641146,0.0002601268,0.00042857893,0.00045582635,0.0005822262],"domain_scores_gemma":[0.99401134,0.003335174,0.00031023755,0.0013352743,0.00064485706,0.00036308327],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018307293,0.0011121681,0.0014362069,0.0011328381,0.0015820798,0.0038399838,0.0019823604,0.0019345825,0.014848017],"category_scores_gemma":[0.008577298,0.00078773504,0.00135493,0.0019610978,0.0013452191,0.0048916037,0.0034166411,0.0018543792,0.004299253],"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.0008060339,0.00028442277,0.0010315644,0.00033738275,0.00007703323,0.0005634585,0.0006212435,0.022933748,0.013797863,0.8275416,0.009656863,0.12234875],"study_design_scores_gemma":[0.000061648636,0.000104256695,0.00021756996,0.00006211746,0.000045655535,0.0003632138,0.00016084318,0.07780883,0.0055212756,0.9101753,0.0054365164,0.00004266068],"about_ca_topic_score_codex":0.00042023635,"about_ca_topic_score_gemma":0.00065508636,"teacher_disagreement_score":0.014848017,"about_ca_system_score_codex":0.00078380096,"about_ca_system_score_gemma":0.0012346602,"threshold_uncertainty_score":0.04967159},"labels":[],"label_agreement":null}]}