{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":68,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":68,"direct_label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline (scores rank; they never assert a category)","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"query_hash":"bc5971d76efd","filters":{"venue":"Journal of Algebraic Combinatorics"}},"results":[{"id":"W1977775383","doi":"10.1007/s10801-007-0079-y","title":"Monomial ideals, edge ideals of hypergraphs, and their graded Betti numbers","year":2007,"lang":"en","type":"article","venue":"Journal of Algebraic Combinatorics","topic":"Commutative Algebra and Its Applications","field":"Mathematics","cited_by":278,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Lakehead University","funders":"Natural Sciences and Engineering Research Council of Canada; Tulane University; Louisiana Board of Regents","keywords":"Mathematics; Betti number; Hypergraph; Combinatorics; Monomial; Square-free integer; Chordal graph; Simple (philosophy); Discrete mathematics; Monomial ideal; Simple graph; Graph; Polynomial ring; Polynomial","retraction":null,"screen_n_in":null,"score":{"opus":0.02883360094076585,"gpt":0.3046921309516603,"spread":0.2758585300108944,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001581713,0.0002421382,0.0006636956,0.0003325641,0.000132455,0.00003265138,0.0004002039,0.0001313792,0.00002560893],"category_scores_gemma":[0.000472975,0.0001948912,0.0002496237,0.0005700586,0.0001689212,0.0002036211,0.0001110549,0.0004184213,0.000002199128],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008683809,"about_ca_system_score_gemma":0.0001136202,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001531518,"about_ca_topic_score_gemma":0.00001293123,"domain_scores_codex":[0.9979411,0.00009096597,0.001174246,0.0001619954,0.000333336,0.0002983611],"domain_scores_gemma":[0.996076,0.001742335,0.001127885,0.0003492821,0.0004717415,0.0002327819],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00008679292,0.0005336427,0.005494469,0.0001094876,0.0002969399,0.00001361661,0.002545657,8.565186e-7,0.005194664,0.9750468,0.004932626,0.005744453],"study_design_scores_gemma":[0.001401488,0.0003345909,0.01435673,0.00007102158,0.0001068999,0.0001344175,0.001113975,0.00001370489,0.01017288,0.9698657,0.002215785,0.0002127843],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9932192,0.001238126,0.003189711,0.00051999,0.0003349243,0.0002131084,0.000007594306,0.00002158723,0.001255757],"genre_scores_gemma":[0.997811,0.0002514645,0.001644901,0.00006978812,0.0001103475,0.00000262014,0.000001292536,0.00003454361,0.00007403286],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.008862258,"threshold_uncertainty_score":0.7947432,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2140324247","doi":"10.1023/b:jaco.0000030703.39946.70","title":"On the Location of Roots of Independence Polynomials","year":2004,"lang":"en","type":"article","venue":"Journal of Algebraic Combinatorics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":89,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Fields Institute for Research in Mathematical Sciences; Dalhousie University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Independence (probability theory); Discrete mathematics; Independence number; Graph; Comparability","retraction":null,"screen_n_in":null,"score":{"opus":0.02929221787455317,"gpt":0.2965000700111645,"spread":0.2672078521366113,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001478689,0.0001973687,0.000624489,0.0002069927,0.00006184324,0.00001430396,0.0007033491,0.0001450918,0.0000208825],"category_scores_gemma":[0.006845845,0.0001379905,0.0001738595,0.0008114742,0.0001227956,0.0001895631,0.00008773748,0.0004705074,0.000004296342],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002262637,"about_ca_system_score_gemma":0.0004278038,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005388759,"about_ca_topic_score_gemma":0.000001311165,"domain_scores_codex":[0.9971399,0.0001102868,0.001320707,0.0001157037,0.001116235,0.0001971398],"domain_scores_gemma":[0.9932503,0.0021647,0.002509304,0.0005372899,0.00145408,0.00008431345],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0000598653,0.0007048114,0.00004237052,0.0002051496,0.00007450044,0.000006964299,0.0006074159,0.0002643151,0.00204553,0.9956279,0.0002262622,0.0001348625],"study_design_scores_gemma":[0.001283619,0.0007171023,0.0002399691,0.0005660412,0.00007390136,0.00004242928,0.0002747535,0.00001300934,0.04585776,0.9507972,0.00002072752,0.0001134896],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.983381,0.0002585708,0.01361397,0.0005830944,0.001233086,0.0002920115,0.00000179441,0.00001455451,0.0006219159],"genre_scores_gemma":[0.9974973,0.00003432213,0.002297768,0.00003159648,0.00006662694,0.000002844809,1.445845e-7,0.00003090828,0.00003849119],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.04483075,"threshold_uncertainty_score":0.8195611,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1509680213","doi":"10.1023/a:1008705614290","title":"Roots of Independence Polynomials of Well Covered Graphs","year":2000,"lang":"en","type":"article","venue":"Journal of Algebraic Combinatorics","topic":"Mathematical Dynamics and Fractals","field":"Mathematics","cited_by":84,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Dalhousie University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Cardinality (data modeling); Graph; Discrete mathematics; Independence (probability theory); Independence number","retraction":null,"screen_n_in":null,"score":{"opus":0.01690464497790049,"gpt":0.274882208049705,"spread":0.2579775630718045,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.001181549,0.0001845495,0.0008676876,0.0002109225,0.00003383591,0.00001762656,0.0004975099,0.0001771843,0.00125502],"category_scores_gemma":[0.0006578054,0.0001522582,0.0003511053,0.0004127572,0.0001016589,0.0001751567,0.00005059015,0.000347194,0.000009584352],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000462988,"about_ca_system_score_gemma":0.0001376756,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001099163,"about_ca_topic_score_gemma":0.000001918708,"domain_scores_codex":[0.9971784,0.00009144544,0.001526709,0.000118093,0.0008640579,0.0002212897],"domain_scores_gemma":[0.996675,0.0009176515,0.00144011,0.0003573459,0.0004578839,0.0001520432],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001531068,0.001533189,0.001054183,0.0005647586,0.0002378255,0.00003578966,0.0003536784,0.0000171102,0.002872564,0.9888272,0.002088139,0.002262461],"study_design_scores_gemma":[0.001121404,0.0004533109,0.001450193,0.0002513665,0.0001125102,0.00008108423,0.00006150833,0.0002655581,0.003411417,0.9922129,0.000427479,0.0001512646],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9874942,0.0002686319,0.0007246959,0.0001240392,0.0002718066,0.0001540093,0.00001255817,0.000008721897,0.01094139],"genre_scores_gemma":[0.9974915,0.0002178295,0.001588179,0.00002315771,0.00002784685,8.905575e-7,5.383396e-7,0.00002475781,0.0006252946],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.0103161,"threshold_uncertainty_score":0.999658,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2048667371","doi":"10.1007/s10801-010-0247-3","title":"Metric properties of the tropical Abel–Jacobi map","year":2010,"lang":"en","type":"article","venue":"Journal of Algebraic Combinatorics","topic":"Advanced Differential Equations and Dynamical Systems","field":"Mathematics","cited_by":79,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"Centre de Recherches Mathématiques; National Science Foundation","keywords":"Mathematics; Combinatorics; Jacobian matrix and determinant; Graph; Tropical geometry; Metric space; Discrete mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.02250336973288268,"gpt":0.263235203332836,"spread":0.2407318335999533,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000290582,0.0001247667,0.0003788587,0.0001312547,0.00008859437,0.00002549009,0.0004393636,0.0001093462,0.00003864572],"category_scores_gemma":[0.00141585,0.00006822558,0.0002527213,0.0004633204,0.00009840779,0.0001182514,0.0000906384,0.0005492402,0.000003378109],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005028947,"about_ca_system_score_gemma":0.00009597421,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004592258,"about_ca_topic_score_gemma":0.000005491087,"domain_scores_codex":[0.9983218,0.00008413273,0.0007611945,0.00008456495,0.0005873099,0.000160941],"domain_scores_gemma":[0.9981347,0.0002755308,0.0007601351,0.0003060739,0.0004300343,0.00009355386],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00003210274,0.0006512234,0.004237549,0.0001751356,0.0000894714,0.000003332367,0.0002124759,0.000007585396,0.02083961,0.972351,0.0005288724,0.0008716872],"study_design_scores_gemma":[0.001287301,0.0002593622,0.008450541,0.000158808,0.0001405168,0.00006899021,0.0001267579,0.0005768124,0.009598074,0.9775963,0.001558,0.0001785344],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9890358,0.0001982076,0.00756009,0.0004112267,0.002453034,0.0001543002,0.000001456538,0.00001097257,0.0001748459],"genre_scores_gemma":[0.9983723,0.000008594348,0.0010775,0.00001512191,0.0001307311,0.000002288641,9.781925e-8,0.00001627236,0.0003771118],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01124154,"threshold_uncertainty_score":0.2782159,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1500943703","doi":"10.1023/a:1015016625432","title":"A New Class of Wilf-Equivalent Permutations","year":2002,"lang":"en","type":"article","venue":"Journal of Algebraic Combinatorics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":68,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Victoria","funders":"University of Connecticut","keywords":"Mathematics; Combinatorics; Permutation (music); Equivalence (formal languages); Class (philosophy); Equivalence class (music); Discrete mathematics; Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.05572211260023779,"gpt":0.3042749397012872,"spread":0.2485528271010494,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050719,0.0002649337,0.0007719818,0.0003188651,0.00008875145,0.00003267695,0.0006057344,0.0001465101,0.0003601419],"category_scores_gemma":[0.002206664,0.0002397791,0.0003586463,0.0007188673,0.00006821321,0.0003482299,0.00010846,0.0004867444,0.00002175542],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002370158,"about_ca_system_score_gemma":0.000154154,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000186054,"about_ca_topic_score_gemma":7.794727e-7,"domain_scores_codex":[0.9969485,0.00009694561,0.001461158,0.0001569355,0.001016599,0.0003198373],"domain_scores_gemma":[0.9955876,0.001153295,0.001729015,0.000495413,0.0007439189,0.000290703],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001791355,0.0007837794,0.0001042676,0.0001832619,0.0001446898,0.00004024178,0.00176241,0.00002141319,0.0004176425,0.9757821,0.01942288,0.001319403],"study_design_scores_gemma":[0.00195528,0.0006028244,0.00006023054,0.0002006201,0.0001957006,0.0002035902,0.0002997005,0.0003072016,0.001431625,0.9913478,0.003173119,0.0002223452],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8029638,0.003514912,0.1627455,0.003315351,0.009030041,0.0009980376,0.00001359613,0.0001998545,0.0172189],"genre_scores_gemma":[0.9745512,0.0001772593,0.02321702,0.0000334822,0.0002472415,0.00000272664,3.544258e-7,0.00006458685,0.001706096],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1715874,"threshold_uncertainty_score":0.977791,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2049467095","doi":"10.1007/s10801-007-0104-1","title":"On Weyl-Heisenberg orbits of equiangular lines","year":2007,"lang":"en","type":"article","venue":"Journal of Algebraic Combinatorics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":47,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Dimension (graph theory); Prime (order theory); Heisenberg group; Modulo; Characterization (materials science); Fiducial marker; Combinatorics; Pure mathematics; Physics","retraction":null,"screen_n_in":null,"score":{"opus":0.00506895160961069,"gpt":0.2042556152827603,"spread":0.1991866636731496,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001022279,0.0001612582,0.0003710138,0.0003303754,0.00003403125,0.00001381423,0.0002686692,0.000119531,0.00003293254],"category_scores_gemma":[0.0001258039,0.000140759,0.0002004397,0.0004773104,0.00003355934,0.0001160631,0.00001840684,0.0003200133,0.0000113954],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006328595,"about_ca_system_score_gemma":0.00002479456,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001220261,"about_ca_topic_score_gemma":0.000001075434,"domain_scores_codex":[0.9985334,0.00003487282,0.0007168343,0.00007331913,0.0004022511,0.0002393612],"domain_scores_gemma":[0.9989123,0.0002597971,0.0002640228,0.0002061898,0.0002138248,0.000143897],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002224982,0.000504557,0.002203272,0.0005026648,0.0005093545,0.0004298687,0.001153959,0.003952964,0.02549235,0.9532638,0.007072189,0.004692575],"study_design_scores_gemma":[0.00552274,0.002887032,0.01211225,0.001341998,0.0002689463,0.000838453,0.001021333,0.001239884,0.2013088,0.747637,0.02468112,0.001140482],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9895099,0.001658664,0.001660345,0.0000312013,0.003081913,0.00006384424,0.000001641453,0.00003895216,0.003953506],"genre_scores_gemma":[0.9995026,0.00006506073,0.00006111526,0.00002253164,0.0001744238,4.17884e-7,4.877586e-7,0.00003033606,0.000143011],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2056267,"threshold_uncertainty_score":0.5739987,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1583867781","doi":"10.1023/a:1021804505786","title":"Symplectic Shifted Tableaux and Deformations of Weyl's Denominator Formula for sp(2n)","year":2002,"lang":"en","type":"article","venue":"Journal of Algebraic Combinatorics","topic":"Algebraic structures and combinatorial models","field":"Mathematics","cited_by":43,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Wilfrid Laurier University","funders":"Leverhulme Trust","keywords":"Mathematics; Sign (mathematics); Symplectic geometry; Pure mathematics; Combinatorics; Product (mathematics); Algebra over a field; Geometry; Mathematical analysis","retraction":null,"screen_n_in":null,"score":{"opus":0.0503204948607272,"gpt":0.2823279933471271,"spread":0.2320074984863999,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005927438,0.0002912897,0.0007761175,0.0003352711,0.0002124426,0.00006841568,0.0004112117,0.0002061608,0.00008858451],"category_scores_gemma":[0.001168487,0.000249288,0.0003037762,0.0004714821,0.00009234247,0.0004756477,0.00009862192,0.0003381261,0.000001680161],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001683718,"about_ca_system_score_gemma":0.0001006122,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004655872,"about_ca_topic_score_gemma":0.000002316736,"domain_scores_codex":[0.9975867,0.00006465248,0.001232026,0.0001836374,0.0005410481,0.0003919484],"domain_scores_gemma":[0.9964166,0.001032696,0.001234805,0.0003364141,0.0007504387,0.0002290247],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00005927512,0.0002738669,0.000370504,0.0003060105,0.0001859092,0.000004907412,0.001112722,0.000005718872,0.0001106399,0.9943293,0.002116722,0.001124423],"study_design_scores_gemma":[0.002827998,0.0008372413,0.0005014988,0.0001121467,0.0002807496,0.0001968732,0.0002822416,0.001230826,0.0008743762,0.9915682,0.001027918,0.0002599214],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9907092,0.001377561,0.005156325,0.0003784388,0.001423812,0.0004588669,0.00001083666,0.00002855541,0.000456401],"genre_scores_gemma":[0.9969088,0.0001730261,0.002455307,0.00004911619,0.0001551406,0.00001318853,0.000001245652,0.0000500388,0.0001941611],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.006199572,"threshold_uncertainty_score":0.9999959,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1979035508","doi":"10.1007/s10801-010-0215-y","title":"Associated primes of monomial ideals and odd holes in graphs","year":2010,"lang":"en","type":"article","venue":"Journal of Algebraic Combinatorics","topic":"Commutative Algebra and Its Applications","field":"Mathematics","cited_by":41,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Lakehead University","funders":"Natural Sciences and Engineering Research Council of Canada; Banff International Research Station for Mathematical Innovation and Discovery; Oklahoma State University","keywords":"Mathematics; Combinatorics; Simple graph; Monomial; Graph; Discrete mathematics; Algebraic number; Strongly regular graph; Monomial ideal; Line graph; Graph power; Polynomial ring","retraction":null,"screen_n_in":null,"score":{"opus":0.01964013166438251,"gpt":0.2998975935101756,"spread":0.2802574618457931,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000900678,0.000130935,0.0004519385,0.0002934579,0.00005233974,0.00002545034,0.0002602975,0.0001171651,0.00002345313],"category_scores_gemma":[0.001155776,0.000115395,0.000108695,0.0004177384,0.0001380161,0.0001609764,0.00007659828,0.000533761,8.582847e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003704204,"about_ca_system_score_gemma":0.0001271779,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001522245,"about_ca_topic_score_gemma":0.00005009467,"domain_scores_codex":[0.9986542,0.00008038867,0.0007546315,0.0000998898,0.0002542162,0.0001566154],"domain_scores_gemma":[0.9975275,0.001014605,0.0008370876,0.0002027789,0.0003244673,0.00009353917],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00002205627,0.0005454306,0.02476265,0.00003482213,0.00008126203,0.000005816568,0.000987391,4.590468e-7,0.00693959,0.9644534,0.00083298,0.001334173],"study_design_scores_gemma":[0.001149047,0.000166057,0.08217835,0.00004709171,0.00004887995,0.00002117554,0.0001647514,0.00002384026,0.003057321,0.9128209,0.0002159061,0.0001066569],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9983312,0.0002107241,0.0001156416,0.0004641076,0.0002186468,0.0001368349,0.000004568148,0.000009593221,0.000508663],"genre_scores_gemma":[0.9988874,0.00009318969,0.0009151191,0.00001870483,0.0000236199,0.000003195554,7.216732e-7,0.00001680138,0.00004126654],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.0574157,"threshold_uncertainty_score":0.4705671,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1985794989","doi":"10.1007/s10801-014-0513-x","title":"The antipode and primitive elements in the Hopf monoid of supercharacters","year":2014,"lang":"en","type":"article","venue":"Journal of Algebraic Combinatorics","topic":"Algebraic structures and combinatorial models","field":"Mathematics","cited_by":38,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"York University","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Monoid; Mathematics; Hopf algebra; Unipotent; Combinatorics; Field (mathematics); Algebra over a field; Discrete mathematics; Pure mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.01697141556324453,"gpt":0.2742403831456117,"spread":0.2572689675823672,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002282206,0.0001842385,0.0004210803,0.0001115502,0.0001549132,0.00006666689,0.0006290387,0.0000923279,0.000004222064],"category_scores_gemma":[0.001040762,0.0001019753,0.0001363191,0.0002857529,0.0001414128,0.0001679951,0.0001040912,0.0004792835,4.210137e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005855518,"about_ca_system_score_gemma":0.00007498809,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008810025,"about_ca_topic_score_gemma":0.000004333791,"domain_scores_codex":[0.9977239,0.0003448913,0.0008797069,0.0001279212,0.0006530625,0.0002705691],"domain_scores_gemma":[0.9966472,0.001978416,0.0007154252,0.0003318332,0.0002559124,0.00007120609],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00007377558,0.0001409968,0.00500339,0.00003930726,0.00007163786,0.000005796548,0.002078674,9.871675e-7,0.000157667,0.9898204,0.0003609346,0.002246413],"study_design_scores_gemma":[0.001410022,0.0004291805,0.01899542,0.0000683687,0.00006428458,0.00005221379,0.0009472673,0.00008584881,0.0003562971,0.9765956,0.0008774896,0.0001179676],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9972588,0.0003472044,0.0001554194,0.0009085101,0.000832753,0.0002008262,0.000001156235,0.000005001576,0.0002903583],"genre_scores_gemma":[0.9992424,0.0003328862,0.00015833,0.0001118636,0.0001097349,0.000003644978,3.34277e-7,0.0000184642,0.00002232123],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01399203,"threshold_uncertainty_score":0.4158431,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1968258943","doi":"10.1007/s10801-006-0044-1","title":"Bijective proofs of shifted tableau and alternating sign matrix identities","year":2006,"lang":"en","type":"article","venue":"Journal of Algebraic Combinatorics","topic":"Advanced Topics in Algebra","field":"Mathematics","cited_by":38,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Wilfrid Laurier University","funders":"Natural Sciences and Engineering Research Council of Canada; Leverhulme Trust","keywords":"Bijection; Mathematics; Sign (mathematics); Mathematical proof; Combinatorics; Matrix (chemical analysis); Algebra over a field; Pure mathematics; Geometry","retraction":null,"screen_n_in":null,"score":{"opus":0.01677550588749251,"gpt":0.302761941120996,"spread":0.2859864352335035,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006965282,0.0002072865,0.0005531181,0.0003136119,0.00009305367,0.00005454612,0.0002561635,0.0001058438,0.00003487432],"category_scores_gemma":[0.0009032427,0.0001896906,0.0001308866,0.000389752,0.0001200947,0.0004193079,0.0001282066,0.000411901,0.000001590156],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001567767,"about_ca_system_score_gemma":0.000101064,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001461654,"about_ca_topic_score_gemma":0.000004580915,"domain_scores_codex":[0.9978361,0.00009034593,0.001017221,0.000156651,0.0006428098,0.0002568996],"domain_scores_gemma":[0.9968559,0.0008311697,0.001437414,0.0002213182,0.000577938,0.00007625783],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00002920868,0.0002407993,0.002818465,0.0002288639,0.00009352312,0.00007426265,0.0003831274,0.00001313023,0.0007157166,0.9944307,0.0006147363,0.0003574179],"study_design_scores_gemma":[0.00115722,0.0002888018,0.001880559,0.000167065,0.00008818175,0.0002151306,0.0002887122,0.00006898821,0.007238327,0.9883038,0.000129465,0.0001737957],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9886307,0.001366834,0.007439248,0.0001368002,0.0006781262,0.0001913306,0.000004470296,0.00002973424,0.001522779],"genre_scores_gemma":[0.9821317,0.00007389491,0.01666117,0.00001145256,0.0002090521,0.000002825271,6.313803e-7,0.00004139304,0.0008678944],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.009221926,"threshold_uncertainty_score":0.773536,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2112181323","doi":"10.1007/s10801-006-0055-y","title":"Decomposition theorem for the cd-index of Gorenstein* posets","year":2007,"lang":"en","type":"article","venue":"Journal of Algebraic Combinatorics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":33,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Mathematics; Partially ordered set; Conjecture; Decomposition theorem; Intersection homology; Combinatorics; Intersection (aeronautics); Decomposition; Index (typography); Variety (cybernetics); Discrete mathematics; Cohomology; Pure mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.02462163538302128,"gpt":0.3396802741124961,"spread":0.3150586387294748,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003085244,0.0002545946,0.0006489112,0.0002255894,0.0001630914,0.00003235182,0.0007107728,0.0001645925,0.00001529617],"category_scores_gemma":[0.002152361,0.0001765437,0.000416134,0.000473065,0.0001301317,0.0002132861,0.00009553503,0.0004079366,0.00000182656],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000206285,"about_ca_system_score_gemma":0.000124066,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001321419,"about_ca_topic_score_gemma":0.000002751563,"domain_scores_codex":[0.997162,0.00007057108,0.00145279,0.0001428139,0.0007952114,0.0003766129],"domain_scores_gemma":[0.9896534,0.006618532,0.001944122,0.0004988593,0.001146637,0.000138414],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002196053,0.0004896263,0.0001327862,0.0001837838,0.0001819291,0.00001440115,0.0007622943,0.000017804,0.001115853,0.9927665,0.001073477,0.003041947],"study_design_scores_gemma":[0.00203723,0.0006720562,0.0004484915,0.0001581014,0.000214707,0.0001583869,0.0005772542,0.0002257486,0.01082026,0.9837548,0.0007511375,0.0001818754],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.4997396,0.0006510411,0.4925962,0.0005596965,0.004447684,0.0008347963,0.000007568999,0.00004778213,0.001115668],"genre_scores_gemma":[0.9880669,0.00004799208,0.01140461,0.00004386537,0.0002850041,0.000004714936,7.816121e-7,0.00005783005,0.00008832326],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4883273,"threshold_uncertainty_score":0.7199244,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2021366501","doi":"10.1007/s10801-006-0009-4","title":"Coloured peak algebras and Hopf algebras","year":2006,"lang":"en","type":"article","venue":"Journal of Algebraic Combinatorics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":28,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Fields Institute for Research in Mathematical Sciences; York University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Hopf algebra; Mathematics; Representation theory of Hopf algebras; Subalgebra; Abelian group; Quasitriangular Hopf algebra; Quantum group; Combinatorics; Pure mathematics; Equivalence (formal languages); Functor; Algebra over a field; Discrete mathematics; Division algebra","retraction":null,"screen_n_in":null,"score":{"opus":0.01678201789083237,"gpt":0.2732532977769923,"spread":0.2564712798861599,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001217461,0.0004871857,0.001076117,0.0004005077,0.0002638437,0.0001431953,0.000636136,0.0002859491,0.00006370621],"category_scores_gemma":[0.001770791,0.0004393986,0.0002950927,0.0007184728,0.0001891192,0.0005164503,0.0002327221,0.000768493,0.00001573049],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002869716,"about_ca_system_score_gemma":0.0002159809,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000009380998,"about_ca_topic_score_gemma":0.000006358262,"domain_scores_codex":[0.9961727,0.0001797579,0.001635624,0.0003199103,0.001104807,0.0005872506],"domain_scores_gemma":[0.9950756,0.001575944,0.001690537,0.0005605305,0.0007930422,0.0003043026],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00005697686,0.0006948169,0.0006818488,0.0001736605,0.0001115126,0.0001527496,0.0003152936,0.000004903687,0.0007519508,0.9839487,0.01271334,0.000394242],"study_design_scores_gemma":[0.002775694,0.000565273,0.00133184,0.0001480577,0.0002204028,0.0006270075,0.0002217697,0.00006650259,0.001425822,0.9876844,0.00448346,0.0004498296],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9876794,0.001487188,0.003858943,0.0008036176,0.002530076,0.0004063105,0.000004886419,0.000133045,0.003096593],"genre_scores_gemma":[0.9866145,0.000119596,0.01164407,0.00008418814,0.0005391855,0.000008304822,0.00000179297,0.000118601,0.0008698031],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.008229877,"threshold_uncertainty_score":0.9998058,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2027938286","doi":"10.1007/s10801-005-3019-8","title":"U-Turn Alternating Sign Matrices, Symplectic Shifted Tableaux and their Weighted Enumeration","year":2005,"lang":"en","type":"article","venue":"Journal of Algebraic Combinatorics","topic":"Algebraic structures and combinatorial models","field":"Mathematics","cited_by":27,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Wilfrid Laurier University","funders":"","keywords":"Bijection; Mathematics; Symplectic geometry; Sign (mathematics); Enumeration; Combinatorics; Generalization; Young tableau; Context (archaeology); Pure mathematics; Mathematical analysis","retraction":null,"screen_n_in":null,"score":{"opus":0.0173060876625417,"gpt":0.2633960249764978,"spread":0.2460899373139561,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008480079,0.0003768699,0.0006722466,0.0003237496,0.0002729101,0.0002116155,0.0004349839,0.0002102463,0.00008693533],"category_scores_gemma":[0.0005284821,0.0002932347,0.0001962555,0.0005626832,0.00005513878,0.0006206256,0.000122552,0.0006594684,0.000003974122],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002691621,"about_ca_system_score_gemma":0.0001800351,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001143469,"about_ca_topic_score_gemma":0.000005477067,"domain_scores_codex":[0.9974062,0.0001757113,0.001104314,0.0002691788,0.0006249092,0.0004197027],"domain_scores_gemma":[0.9968504,0.0008675558,0.001202013,0.0003098594,0.0005217806,0.0002484168],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00007961525,0.0002532992,0.0005305829,0.00009639885,0.0002536638,0.00002170638,0.001760979,0.00001884705,0.0005074352,0.9846469,0.001264947,0.01056558],"study_design_scores_gemma":[0.001947131,0.0003901823,0.0003217117,0.0001127942,0.000122716,0.0003360712,0.0002160175,0.002138713,0.002091402,0.9903254,0.001665435,0.0003324298],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.990362,0.002623143,0.004003465,0.0007502455,0.001559437,0.0002336133,0.0000027551,0.00006424402,0.0004011104],"genre_scores_gemma":[0.9962881,0.0003120256,0.002243819,0.0001350941,0.000833608,0.000004714979,0.000001681574,0.00006086524,0.0001201458],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01023315,"threshold_uncertainty_score":0.999952,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2069390698","doi":"10.1007/s10801-009-0191-2","title":"Bounds on permutation codes of distance four","year":2009,"lang":"en","type":"article","venue":"Journal of Algebraic Combinatorics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":25,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Hamming distance; Permutation (music); Bit-reversal permutation; Minimum distance; Partial permutation; Permutation graph; Hamming code; Discrete mathematics; Set (abstract data type); Hamming graph; Upper and lower bounds; Cyclic permutation; Hamming bound; Symmetric group; Block code; Algorithm; Decoding methods; Graph; Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.007109176898238282,"gpt":0.2014739093087451,"spread":0.1943647324105068,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003240521,0.0001048326,0.000251134,0.0001397323,0.00003521778,0.00002093969,0.0001581028,0.00005703555,0.000008978656],"category_scores_gemma":[0.00005082953,0.00009368948,0.0001166954,0.0002604639,0.00001996038,0.0001370089,0.000003287209,0.0001937037,0.000003246369],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006864798,"about_ca_system_score_gemma":0.00001890923,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":3.265449e-7,"about_ca_topic_score_gemma":3.360271e-7,"domain_scores_codex":[0.9990865,0.00003784271,0.0004196473,0.00005207824,0.0002828881,0.0001210293],"domain_scores_gemma":[0.9993964,0.00008402964,0.0001997435,0.0001229632,0.0001323892,0.00006441113],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001144529,0.0002604103,0.001213642,0.000158433,0.0001270503,0.00007285335,0.001259658,0.004620067,0.006478496,0.9761705,0.002574043,0.006950365],"study_design_scores_gemma":[0.002141758,0.002153396,0.03274024,0.0005293792,0.00009091273,0.0002416954,0.0004937663,0.00273276,0.01331752,0.9374582,0.007672091,0.0004282666],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9913456,0.0007743452,0.003352597,0.00008376155,0.001076628,0.00004856741,0.000002314737,0.00002801568,0.003288108],"genre_scores_gemma":[0.9997321,0.00006916079,0.00003742978,0.00002257316,0.00006291387,4.365333e-7,5.961328e-7,0.00001083865,0.00006391939],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.03871231,"threshold_uncertainty_score":0.3820546,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1992204596","doi":"10.1007/s10801-006-0020-9","title":"Classical symmetric functions in superspace","year":2006,"lang":"en","type":"article","venue":"Journal of Algebraic Combinatorics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":24,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Université Laval","funders":"Fondo Nacional de Desarrollo Científico y Tecnológico; Natural Sciences and Engineering Research Council of Canada","keywords":"Symmetric function; Ring of symmetric functions; Superspace; Multiplicative function; Symmetric closure; Symmetric group; Complete homogeneous symmetric polynomial; Symmetric space; Invariant (physics); Triple system","retraction":null,"screen_n_in":null,"score":{"opus":0.02060072849965508,"gpt":0.2813561582718396,"spread":0.2607554297721845,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007255512,0.0002639469,0.0006819239,0.0008053911,0.00008357039,0.00005509222,0.0004299293,0.0001912525,0.00003846775],"category_scores_gemma":[0.002232917,0.0002387392,0.0002552506,0.00196288,0.0000722898,0.0003535569,0.00009268834,0.0007823944,0.00002228668],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005732555,"about_ca_system_score_gemma":0.0001874254,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000075003,"about_ca_topic_score_gemma":0.00001048914,"domain_scores_codex":[0.9972696,0.0001290526,0.001169168,0.0001888408,0.000830762,0.000412548],"domain_scores_gemma":[0.9966229,0.001658078,0.0007247831,0.000376424,0.0004711272,0.000146698],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00002832037,0.001192263,0.001417567,0.00006375342,0.00002820527,0.0001463557,0.0001083254,0.00002587177,0.0001511446,0.9869581,0.009684254,0.0001958518],"study_design_scores_gemma":[0.002032185,0.0003177886,0.0009291684,0.00009413555,0.00006985036,0.0002532659,0.0002982653,0.0001508423,0.000261055,0.9915375,0.003816868,0.0002391231],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9661698,0.0007941304,0.01481669,0.002086511,0.004415859,0.0003530843,0.000003246507,0.00009855189,0.01126218],"genre_scores_gemma":[0.9931602,0.00002147292,0.004969661,0.00001824784,0.0003386236,0.00000551337,7.560709e-7,0.00005547489,0.001430007],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.02699049,"threshold_uncertainty_score":0.9735503,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1546574518","doi":"10.1023/a:1021856522624","title":"Lie Representations and an Algebra Containing Solomon's","year":2002,"lang":"en","type":"article","venue":"Journal of Algebraic Combinatorics","topic":"Algebraic structures and combinatorial models","field":"Mathematics","cited_by":22,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Mathematics; Hopf algebra; Quantum group; Universal enveloping algebra; Pure mathematics; Graded Lie algebra; Algebra over a field; Cellular algebra; Representation theory of Hopf algebras; Filtered algebra; Algebra representation","retraction":null,"screen_n_in":null,"score":{"opus":0.05396615234853254,"gpt":0.317109507567044,"spread":0.2631433552185115,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005882293,0.0002838923,0.0005999397,0.0002483931,0.0002596245,0.0001528175,0.0004375082,0.0001876429,0.0002362574],"category_scores_gemma":[0.000815062,0.0002510565,0.000180323,0.0003656099,0.0001166341,0.0006585587,0.0001235717,0.000561479,0.000005943741],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009644133,"about_ca_system_score_gemma":0.00005597276,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000009184182,"about_ca_topic_score_gemma":0.000002706649,"domain_scores_codex":[0.9976412,0.0001686195,0.0008910308,0.0002740667,0.0006543435,0.0003707385],"domain_scores_gemma":[0.997279,0.0006740639,0.0007940993,0.0004462645,0.0004312223,0.0003753768],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0000377785,0.0002782788,0.0008692394,0.00003034962,0.0001221799,0.00007726601,0.002422508,0.000003198277,0.00009284513,0.9918376,0.002534847,0.001693957],"study_design_scores_gemma":[0.001815945,0.0009514873,0.0008232833,0.00004873453,0.000135874,0.0003613421,0.0008720125,0.0003897747,0.0001759817,0.9934391,0.0007074662,0.0002789514],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9931303,0.001212854,0.0007893956,0.0007049544,0.001591993,0.0001844428,0.000001892905,0.00006342302,0.002320807],"genre_scores_gemma":[0.9975159,0.0002245337,0.001358807,0.0001427855,0.0004230029,0.000004492007,8.700607e-7,0.00005075115,0.0002788815],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.00438564,"threshold_uncertainty_score":0.9999942,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2964086002","doi":"10.1007/s10801-018-0812-8","title":"Construction and nonexistence of strong external difference families","year":2018,"lang":"en","type":"article","venue":"Journal of Algebraic Combinatorics","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Lambda; Algebraic number; Combinatorics; Algebraic combinatorics; Range (aeronautics); Scope (computer science); Discrete mathematics; Character (mathematics); Mathematical analysis; Geometry; Physics; Quantum mechanics; Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.01047765096276356,"gpt":0.2262110500473466,"spread":0.215733399084583,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004144271,0.0001019111,0.0002213,0.0002333938,0.00009546679,0.00006384675,0.0005449187,0.00004403627,0.000006507441],"category_scores_gemma":[0.00007371556,0.00008686214,0.0000803056,0.0004342307,0.0003401461,0.0002987223,0.0001518607,0.0001717455,8.814583e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001823209,"about_ca_system_score_gemma":0.00006446087,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003151211,"about_ca_topic_score_gemma":7.292404e-7,"domain_scores_codex":[0.99897,0.00006886501,0.0003727118,0.0001278648,0.0003201308,0.0001403777],"domain_scores_gemma":[0.9987438,0.0001500563,0.0004561169,0.0002201672,0.0003386347,0.00009118794],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00002530095,0.00005885108,0.00984696,0.00001760133,0.00002192875,0.000007200327,0.0006922196,5.344656e-7,0.0025218,0.948512,0.00001569115,0.03827998],"study_design_scores_gemma":[0.0008929759,0.001760643,0.0531665,0.0002062963,0.0000313546,0.0005631684,0.0003493885,0.0007221288,0.008712068,0.93314,0.0002622495,0.000193219],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7775412,0.0003464942,0.2203838,0.00007177187,0.0009488791,0.00002856213,4.722169e-7,0.00001255914,0.0006662079],"genre_scores_gemma":[0.9875693,0.0001226029,0.01219544,0.00002291983,0.00007193704,3.317173e-7,3.155169e-8,0.000003569384,0.00001386701],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2100281,"threshold_uncertainty_score":0.3542135,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2098684813","doi":"10.1007/s10801-009-0170-7","title":"Bounds for codes and designs in complex subspaces","year":2009,"lang":"en","type":"article","venue":"Journal of Algebraic Combinatorics","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada; Mitacs; University of Calgary","keywords":"Linear subspace; Mathematics; Association scheme; Grassmannian; Combinatorics; Dimension (graph theory); Code (set theory); Set (abstract data type); Discrete mathematics; Finite set; Upper and lower bounds; Pure mathematics; Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.03113389045910533,"gpt":0.2749133560179146,"spread":0.2437794655588093,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009427885,0.00011033,0.0002557687,0.0003077304,0.0001011581,0.0001638872,0.0005098471,0.00004923519,0.00000242688],"category_scores_gemma":[0.00009354771,0.00009810529,0.00009705913,0.0005300966,0.00004424965,0.0003859706,0.00004174999,0.0001577923,3.567318e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003425619,"about_ca_system_score_gemma":0.00005825909,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001051264,"about_ca_topic_score_gemma":0.000002504364,"domain_scores_codex":[0.9990644,0.00007377154,0.0003263706,0.0001315879,0.0001997001,0.0002041816],"domain_scores_gemma":[0.9990356,0.0003312942,0.0002259374,0.0001632294,0.0001427248,0.0001011886],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00004162084,0.0001673484,0.001831597,0.00001119122,0.00001443071,0.00001920775,0.0006522221,0.000007546593,0.000807485,0.9841676,0.001072467,0.01120732],"study_design_scores_gemma":[0.00110645,0.001180959,0.0285522,0.00003226593,0.00001059769,0.00008994596,0.00006166708,0.001197974,0.0003722455,0.9645137,0.002746843,0.0001351525],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7676545,0.001322783,0.2264866,0.00346417,0.0004627195,0.000156599,0.000001079994,0.00003524352,0.0004162438],"genre_scores_gemma":[0.9914283,0.0000876714,0.008168282,0.0002600434,0.00003582173,0.000001048317,2.74353e-7,0.000003954562,0.00001457158],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2237738,"threshold_uncertainty_score":0.4000618,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1974048717","doi":"10.1007/s10801-011-0336-y","title":"Double Catalan monoids","year":2011,"lang":"en","type":"article","venue":"Journal of Algebraic Combinatorics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":20,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada; Uppsala Universitet; Vetenskapsrådet; Royal Swedish Academy of Sciences","keywords":"Monoid; Mathematics; Catalan number; Combinatorics; Free monoid; Catalan; Syntactic monoid; Polyomino; Discrete mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.1301682762799771,"gpt":0.3158186725740347,"spread":0.1856503962940576,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008590412,0.0002906146,0.0006676652,0.0002652313,0.0001023068,0.00003528653,0.0007892347,0.000167244,0.0001344914],"category_scores_gemma":[0.0006375597,0.0002505905,0.0002716095,0.0005152549,0.00007935057,0.0004476265,0.0001545024,0.0005715594,0.00003596525],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002056658,"about_ca_system_score_gemma":0.000165443,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005960674,"about_ca_topic_score_gemma":0.000001306843,"domain_scores_codex":[0.997537,0.00006345545,0.001129279,0.0001753124,0.0007064266,0.0003885135],"domain_scores_gemma":[0.996935,0.0003808982,0.001198606,0.0005815128,0.0006296817,0.0002743183],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000115704,0.000789508,0.000414173,0.00009806786,0.0001114392,0.0001182864,0.002691682,5.403822e-7,0.0001523596,0.9922816,0.002903398,0.0003232643],"study_design_scores_gemma":[0.002451091,0.00052446,0.0001574486,0.00008278619,0.0001221058,0.0002710269,0.0002916279,0.00001271034,0.006901984,0.9873355,0.001580729,0.0002685052],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9585781,0.0004507134,0.01187385,0.0001440156,0.005870294,0.0003948105,0.000002541208,0.0001504862,0.02253523],"genre_scores_gemma":[0.9808528,0.00004896142,0.01800254,0.00003211381,0.0002175509,0.000005742715,5.002814e-7,0.00007745131,0.0007623269],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.02227475,"threshold_uncertainty_score":0.9999946,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2023856323","doi":"10.1007/s10801-006-8347-9","title":"Finite-dimensional crystals B2,s for quantum affine algebras of type D(1)n","year":2006,"lang":"en","type":"article","venue":"Journal of Algebraic Combinatorics","topic":"Algebraic structures and combinatorial models","field":"Mathematics","cited_by":19,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Division of Mathematical Sciences; Research Institute for Mathematical Sciences; University of British Columbia; National Science Foundation","keywords":"Quantum affine algebra; Mathematics; Affine transformation; Type (biology); Integer (computer science); Quantum; Pure mathematics; Basis (linear algebra); Quantum algebra; Combinatorics; Algebra over a field; Discrete mathematics; Filtered algebra; Cellular algebra; Algebra representation; Physics; Geometry; Quantum mechanics","retraction":null,"screen_n_in":null,"score":{"opus":0.02711960552905551,"gpt":0.2830992121388306,"spread":0.2559796066097751,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000925474,0.0003753972,0.001032713,0.0003448565,0.0001409089,0.00004520024,0.0005971069,0.0002785027,0.0001540172],"category_scores_gemma":[0.001534743,0.0003170998,0.0005262732,0.0006391114,0.0001162712,0.0002319522,0.0001256441,0.0003899976,0.000003014062],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001437041,"about_ca_system_score_gemma":0.000372232,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000018533,"about_ca_topic_score_gemma":0.00000305385,"domain_scores_codex":[0.9965391,0.00009759893,0.001676597,0.0002623281,0.0009685081,0.0004559393],"domain_scores_gemma":[0.9939616,0.002102157,0.001668574,0.0004509296,0.001652639,0.0001640629],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0003184652,0.0005491773,0.0003025674,0.0001670527,0.000162381,0.00001779395,0.00008772487,0.0002457857,0.001097394,0.980509,0.01639408,0.0001486052],"study_design_scores_gemma":[0.003014745,0.00120194,0.000369067,0.0001255449,0.0002122078,0.00007415238,0.00005429018,0.0007142457,0.002997981,0.9879547,0.002960169,0.0003209965],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9897761,0.001197625,0.00328242,0.0004369363,0.00437798,0.0004173236,0.00001690319,0.00004373796,0.0004509348],"genre_scores_gemma":[0.995962,0.00002645112,0.002769092,0.00005796265,0.0006159999,0.000005811409,0.000007577694,0.0000764994,0.0004785665],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01343391,"threshold_uncertainty_score":0.9999281,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2076974687","doi":"10.1007/s10801-013-0453-x","title":"Counting matrices over finite fields with support on skew Young diagrams and complements of Rothe diagrams","year":2013,"lang":"en","type":"article","venue":"Journal of Algebraic Combinatorics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":18,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université du Québec à Montréal","funders":"National Science Foundation","keywords":"Mathematics; Combinatorics; Permutation (music); Diagram; Rank (graph theory); Invertible matrix; Skew; Field (mathematics); Finite field; Matrix (chemical analysis); Discrete mathematics; Pure mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.01957695152479779,"gpt":0.2782855807528944,"spread":0.2587086292280967,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006956059,0.0003388014,0.0008107614,0.0002249484,0.0001164971,0.000109836,0.0004316489,0.0001420005,0.0001490197],"category_scores_gemma":[0.000845102,0.000251388,0.0001413414,0.0004301272,0.0001033952,0.0004586295,0.0001370525,0.0005131881,0.000007967028],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000108844,"about_ca_system_score_gemma":0.00008967238,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001661762,"about_ca_topic_score_gemma":0.000007727817,"domain_scores_codex":[0.9971233,0.00008623489,0.0011606,0.0002046526,0.001037695,0.0003875389],"domain_scores_gemma":[0.9951374,0.001862387,0.001784062,0.0004071017,0.0006200846,0.0001889506],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001703029,0.002241498,0.04588041,0.001389971,0.0006682084,0.0001145381,0.003493645,0.0000366778,0.0002069867,0.9363899,0.005572755,0.003835168],"study_design_scores_gemma":[0.002790564,0.002072464,0.003552803,0.0004772533,0.0001908931,0.00009923722,0.0003527726,0.0002694847,0.0006742253,0.9886876,0.0004773168,0.0003554256],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9895301,0.0001201983,0.007673401,0.0002157881,0.0008164852,0.000523973,0.000005225727,0.00003348144,0.001081292],"genre_scores_gemma":[0.9945155,0.0001357057,0.004900876,0.00008411752,0.0001118867,0.00001383431,0.000001525635,0.00006090953,0.0001756241],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.05229772,"threshold_uncertainty_score":0.9999939,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2090056566","doi":"10.1007/s10801-009-0211-2","title":"Symmetric functions, codes of partitions and the KP hierarchy","year":2009,"lang":"en","type":"article","venue":"Journal of Algebraic Combinatorics","topic":"Nonlinear Waves and Solitons","field":"Physics and Astronomy","cited_by":18,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Notation; Simple (philosophy); Hierarchy; Partition (number theory); Symmetric function; Action (physics); Combinatorics; Partition function (quantum field theory); Algebra over a field; Discrete mathematics; Pure mathematics; Arithmetic","retraction":null,"screen_n_in":null,"score":{"opus":0.005371772661714326,"gpt":0.2297882893910285,"spread":0.2244165167293142,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003023478,0.00007996503,0.0002427367,0.0001212461,0.0001227884,0.00003321255,0.0001214165,0.00002256007,0.00004338193],"category_scores_gemma":[0.00003868937,0.0000517226,0.0001507934,0.0003905567,0.00009780093,0.0000988223,0.00002117756,0.0002287943,0.000001900851],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001231916,"about_ca_system_score_gemma":0.00006812937,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000110582,"about_ca_topic_score_gemma":2.341224e-7,"domain_scores_codex":[0.9992101,0.00006679301,0.0003616028,0.00005842334,0.000185069,0.0001180242],"domain_scores_gemma":[0.9990734,0.0002487547,0.0002927117,0.000125713,0.0001826288,0.000076776],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00003776556,0.0002876382,0.004698693,0.00000519787,0.00009305999,0.000002051729,0.0001868088,0.00001458293,0.00004039447,0.9857176,0.001858443,0.007057768],"study_design_scores_gemma":[0.002621065,0.000385436,0.01973137,0.00003557749,0.0001569116,0.00002746272,0.0005902337,0.0002502858,0.00025714,0.9677982,0.008032585,0.0001137877],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9833372,0.001529202,0.002291528,0.003794999,0.0005182569,0.0001242064,0.00002231415,0.000006311544,0.008375987],"genre_scores_gemma":[0.9992335,0.00007271778,0.0001394517,0.0000486471,0.0002011186,6.786061e-7,0.000002152311,0.000004673363,0.0002970264],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01791945,"threshold_uncertainty_score":0.2109187,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2061614155","doi":"10.1007/s10801-011-0303-7","title":"A basis for the symplectic group branching algebra","year":2011,"lang":"en","type":"article","venue":"Journal of Algebraic Combinatorics","topic":"Algebraic structures and combinatorial models","field":"Mathematics","cited_by":17,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Mathematics; Monomial; Symplectic geometry; Combinatorics; Monomial basis; Irreducible representation; Basis (linear algebra); Symplectic representation; Scalar (mathematics); Symplectic group; Representation theory; Pure mathematics; Algebra over a field; Moment map; Geometry","retraction":null,"screen_n_in":null,"score":{"opus":0.0668727803777829,"gpt":0.2860132226348441,"spread":0.2191404422570612,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001477284,0.0003536595,0.0006616664,0.0002088332,0.0004346718,0.00009860116,0.001070873,0.000190895,0.0001486755],"category_scores_gemma":[0.001819037,0.0002344728,0.0006399472,0.0005308058,0.0001040202,0.0003516025,0.0001360639,0.0006067835,0.000003288282],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001821343,"about_ca_system_score_gemma":0.0001752597,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001791739,"about_ca_topic_score_gemma":0.000006044556,"domain_scores_codex":[0.9973239,0.0001328302,0.001075468,0.0002516176,0.0007022615,0.0005139224],"domain_scores_gemma":[0.9948383,0.002759793,0.001081388,0.0005719647,0.0005429621,0.0002055746],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001659309,0.0002507664,0.0002758642,0.00008073681,0.0003599285,0.00001300013,0.00213584,0.00000128705,0.00004998691,0.9925677,0.002193446,0.001905495],"study_design_scores_gemma":[0.001650954,0.0007667163,0.001255576,0.0000896781,0.0004275659,0.0001989007,0.0004409701,0.0001021967,0.0004199092,0.9930077,0.001355652,0.0002841804],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9103213,0.002859481,0.0707629,0.0008437667,0.01227988,0.001155923,0.000006559595,0.0001227374,0.001647459],"genre_scores_gemma":[0.9961863,0.0001028765,0.002712982,0.0002183644,0.0005648002,0.00002886909,4.119571e-7,0.00008067313,0.0001046811],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.08586504,"threshold_uncertainty_score":0.9561524,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2040990647","doi":"10.1007/s10801-014-0558-x","title":"Median eigenvalues of bipartite graphs","year":2014,"lang":"en","type":"article","venue":"Journal of Algebraic Combinatorics","topic":"Graph theory and applications","field":"Mathematics","cited_by":15,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; Univerza v Ljubljani; Javna Agencija za Raziskovalno Dejavnost RS","keywords":"Combinatorics; Mathematics; Bipartite graph; Lambda; Eigenvalues and eigenvectors; Graph; Discrete mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.02455091154721625,"gpt":0.290789159779188,"spread":0.2662382482319717,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001275911,0.0001172187,0.0003579499,0.0002351795,0.00007182131,0.00001401321,0.0003560107,0.00007460936,0.00005269505],"category_scores_gemma":[0.0007099864,0.00009675197,0.0002263865,0.0004774783,0.0001029052,0.0001108494,0.00003543889,0.000220996,0.000006837584],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001793074,"about_ca_system_score_gemma":0.00004512398,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001617729,"about_ca_topic_score_gemma":0.000001546885,"domain_scores_codex":[0.998597,0.0001245656,0.0006674755,0.00008526014,0.0003668103,0.0001588879],"domain_scores_gemma":[0.9977413,0.0007327387,0.00075697,0.0003025063,0.0003301485,0.0001362924],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001086198,0.0002491711,0.0009867768,0.00004945195,0.00005585979,0.000001649261,0.000352399,0.000001441357,0.0009739468,0.9947641,0.001703248,0.0008510599],"study_design_scores_gemma":[0.0004757392,0.0002249909,0.0008984094,0.0000529379,0.00008532873,0.00002806407,0.00009494095,0.00003127445,0.006231982,0.9879674,0.003815232,0.00009366606],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9943391,0.0001799003,0.002193414,0.0006099381,0.0004658899,0.00008918847,0.000002336078,0.00001970715,0.002100524],"genre_scores_gemma":[0.9978898,0.00006412866,0.001827921,0.00004072711,0.00006348917,0.000002435204,4.957258e-7,0.00001737047,0.00009369404],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.006796699,"threshold_uncertainty_score":0.3945431,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1973203145","doi":"10.1007/s10801-007-0113-0","title":"Schur positivity of skew Schur function differences and applications to ribbons and Schubert classes","year":2007,"lang":"en","type":"article","venue":"Journal of Algebraic Combinatorics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":13,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia; University of Toronto","funders":"","keywords":"Mathematics; Schubert polynomial; Schur algebra; Schur polynomial; Skew; Schur's lemma; Schur's theorem; Combinatorics; Schur decomposition; Schur product theorem; Conjecture; Symmetric function; Pure mathematics; Schur complement; Macdonald polynomials; Orthogonal polynomials; Computer science; Jacobi polynomials; Physics; Classical orthogonal polynomials","retraction":null,"screen_n_in":null,"score":{"opus":0.02653940955674833,"gpt":0.311838879041383,"spread":0.2852994694846346,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001136604,0.0002382975,0.0006315,0.0003558811,0.0001573614,0.00005419801,0.0002380793,0.0001466486,0.000006190061],"category_scores_gemma":[0.001134457,0.0002101334,0.00009191373,0.0006004229,0.0001257354,0.0003125767,0.0001590629,0.0003888653,0.000001791817],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001003078,"about_ca_system_score_gemma":0.00009567593,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003772024,"about_ca_topic_score_gemma":0.000007135304,"domain_scores_codex":[0.9979671,0.00006817832,0.0009165987,0.0002041932,0.0005634368,0.0002804564],"domain_scores_gemma":[0.996176,0.001721054,0.0008603566,0.000304828,0.000637544,0.0003002182],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00008291789,0.0005066706,0.004423444,0.0002552399,0.0001007541,0.000007096417,0.0003065981,4.129076e-7,0.001894597,0.9875742,0.0002056047,0.004642514],"study_design_scores_gemma":[0.0008578512,0.0007335334,0.01895557,0.0001891174,0.0001754756,0.0001110241,0.0002828267,0.000009835214,0.001380139,0.9764331,0.000667346,0.0002041589],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8554028,0.0005870641,0.1420784,0.000248388,0.0004848689,0.0003871389,0.000004281977,0.00003311111,0.0007739633],"genre_scores_gemma":[0.9865123,0.0001335114,0.01307132,0.00003667233,0.0001274331,0.000007746283,3.469656e-7,0.0000299676,0.0000807003],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1311095,"threshold_uncertainty_score":0.8568992,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2768324755","doi":"10.1007/s10801-018-0846-y","title":"On computing Schur functions and series thereof","year":2018,"lang":"en","type":"article","venue":"Journal of Algebraic Combinatorics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":13,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"Bulgarian National Science Fund; San José State University; Ames Research Center; National Aeronautics and Space Administration; National Science Foundation","keywords":"Mathematics; Combinatorics; Schur's theorem; Function (biology); Subtraction; Kappa; Series (stratigraphy); Symmetric function; Discrete mathematics; Arithmetic; Geometry","retraction":null,"screen_n_in":null,"score":{"opus":0.02440239921456401,"gpt":0.2991547505372829,"spread":0.2747523513227189,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007071287,0.0002305986,0.000473944,0.0002031909,0.0002760301,0.00007291981,0.0002801065,0.0001119742,0.00005982181],"category_scores_gemma":[0.002068479,0.0001916503,0.0001120658,0.0003894859,0.0001852403,0.0003001757,0.0001278873,0.0004452306,0.00003067914],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001189845,"about_ca_system_score_gemma":0.00008705446,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":7.400888e-7,"about_ca_topic_score_gemma":0.000001106113,"domain_scores_codex":[0.9982572,0.00009052158,0.0007049311,0.0001609281,0.000513827,0.0002725518],"domain_scores_gemma":[0.9969196,0.001122249,0.0007907749,0.0003348506,0.0006703152,0.0001622071],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00006630955,0.0002877168,0.0001031892,0.00006479672,0.00008292271,0.00001838806,0.0006806268,0.000001844632,0.0002077259,0.9930819,0.004545214,0.0008594222],"study_design_scores_gemma":[0.001068828,0.001635693,0.0001207649,0.000192204,0.00007193483,0.0002839896,0.0005292547,0.00008167829,0.000812364,0.9927355,0.002276419,0.0001913928],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9770596,0.0001155308,0.0118877,0.000395472,0.00352526,0.0001758795,0.000001886387,0.00007794135,0.006760715],"genre_scores_gemma":[0.9931864,0.00002399014,0.005407128,0.00006200912,0.0004509142,0.000001089188,2.138988e-7,0.00004772206,0.0008205524],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01612677,"threshold_uncertainty_score":0.781527,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2317351399","doi":"10.1007/s10801-017-0792-0","title":"Representation stability for the cohomology of arrangements associated to root systems","year":2017,"lang":"en","type":"article","venue":"Journal of Algebraic Combinatorics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":12,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Western University","funders":"","keywords":"Mathematics; Cohomology; Root (linguistics); Stability (learning theory); Representation (politics); Combinatorics; Pure mathematics; Algebra over a field; Discrete mathematics; Linguistics; Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.1317078663645798,"gpt":0.3943636421030537,"spread":0.2626557757384739,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.002489979,0.0001814809,0.0007466203,0.00009967212,0.0003406008,0.00008948792,0.001061391,0.000123092,0.000009244058],"category_scores_gemma":[0.02068353,0.000133793,0.0002401604,0.0001874801,0.0001026394,0.0002436446,0.0001818878,0.000245434,0.00000162579],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002661775,"about_ca_system_score_gemma":0.0001137736,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001456744,"about_ca_topic_score_gemma":0.00001017336,"domain_scores_codex":[0.9975669,0.0001632031,0.00116953,0.0001616518,0.0006748313,0.0002639174],"domain_scores_gemma":[0.9905602,0.003502433,0.003217988,0.0009856999,0.001621924,0.000111749],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0003327852,0.001334042,0.01045599,0.0004922459,0.0008132433,0.00001239526,0.002075354,0.0001098746,0.001121593,0.975951,0.006724642,0.0005768135],"study_design_scores_gemma":[0.002422882,0.000661558,0.004160826,0.0001547807,0.0002725923,0.00001379546,0.0005166737,0.0003016499,0.002209002,0.988747,0.0003902564,0.0001490003],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9373224,0.0001954889,0.05278679,0.0009429753,0.006831802,0.001440388,0.0000187847,0.00002318656,0.0004382359],"genre_scores_gemma":[0.9984134,0.0000128623,0.001202756,0.0000114066,0.0001550492,0.00003389001,7.376365e-7,0.00003343986,0.0001363858],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.06109112,"threshold_uncertainty_score":0.9875657,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1987918561","doi":"10.1007/s10801-011-0327-z","title":"On the cyclically fully commutative elements of Coxeter groups","year":2011,"lang":"en","type":"article","venue":"Journal of Algebraic Combinatorics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":12,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"University of Washington; National Science Foundation","keywords":"Coxeter group; Mathematics; Coxeter element; Longest element of a Coxeter group; Combinatorics; Artin group; Braid group; Coxeter complex; Weyl group; Commutative property; Discrete mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.07724707347414697,"gpt":0.3010872487660384,"spread":0.2238401752918914,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001556175,0.0002981178,0.000716639,0.0001850933,0.0001191365,0.00002225093,0.001034696,0.0001258088,0.000201579],"category_scores_gemma":[0.003350092,0.0001961176,0.000312862,0.0004462842,0.0001791869,0.0002023179,0.0001887052,0.0007232662,0.00002095793],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001585288,"about_ca_system_score_gemma":0.0001066278,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000015475,"about_ca_topic_score_gemma":9.698985e-7,"domain_scores_codex":[0.9966715,0.0002890095,0.001549082,0.0001510739,0.001012863,0.0003264938],"domain_scores_gemma":[0.9928658,0.003225375,0.00228646,0.0006471198,0.0008237071,0.0001515208],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001528941,0.001300677,0.0002009837,0.00007729215,0.0002260405,0.00003500383,0.003252058,7.738579e-7,0.0002191565,0.9918377,0.002480608,0.0002167571],"study_design_scores_gemma":[0.001455464,0.001599396,0.0002833331,0.0001998664,0.0001319871,0.00005155172,0.0005054839,0.00002871171,0.004301724,0.9910628,0.0001890825,0.0001905746],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9806476,0.00006839451,0.007794578,0.0003144435,0.001503422,0.0004435738,0.000005848201,0.00003212523,0.009189992],"genre_scores_gemma":[0.991843,0.0000242982,0.007762485,0.0001263149,0.00006225068,0.000008445391,3.819328e-7,0.00005505817,0.0001178077],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01119534,"threshold_uncertainty_score":0.7997445,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2152073783","doi":"10.1007/s10801-006-6924-6","title":"The isometries of the cut, metric and hypermetric cones","year":2006,"lang":"en","type":"article","venue":"Journal of Algebraic Combinatorics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":11,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McMaster University","funders":"Rijksuniversiteit Groningen; Deutsche Forschungsgemeinschaft","keywords":"Combinatorics; Mathematics; Cone (formal languages); Metric (unit); Facet (psychology); Symmetry (geometry); Geometry","retraction":null,"screen_n_in":null,"score":{"opus":0.002385214030316783,"gpt":0.1556970676505155,"spread":0.1533118536201987,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008046202,0.0001157793,0.0002631573,0.0004066647,0.0001475086,0.00004935611,0.0003328939,0.00006076859,0.000003387418],"category_scores_gemma":[0.0002663675,0.00006355901,0.0001405587,0.002458649,0.0001168518,0.0001096775,0.00003885544,0.0002378361,0.000001010305],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003609467,"about_ca_system_score_gemma":0.00002249856,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000738033,"about_ca_topic_score_gemma":0.000002996978,"domain_scores_codex":[0.9988477,0.00008484455,0.0005072726,0.00005269412,0.0003491012,0.0001584395],"domain_scores_gemma":[0.9986126,0.0007217251,0.0002643727,0.0001887047,0.0001705597,0.0000419787],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00003658884,0.0001684252,0.05866569,0.0002408872,0.0003946045,0.00001481572,0.0003053683,0.00081274,0.001904562,0.9223008,0.008314476,0.006841052],"study_design_scores_gemma":[0.002835554,0.0005607125,0.3315383,0.0001869301,0.0003692356,0.0007575264,0.001221954,0.0007956846,0.02618713,0.5616578,0.07334154,0.0005475713],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9705529,0.02553391,0.0001268662,0.0001036178,0.001965208,0.00007967362,0.000001874607,0.00001562927,0.001620338],"genre_scores_gemma":[0.9990014,0.0006832274,0.00000992025,0.000007021267,0.00006084656,0.000001012818,8.785288e-8,0.00001449483,0.0002219648],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.360643,"threshold_uncertainty_score":0.2591861,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2092583175","doi":"10.1007/s10801-013-0460-y","title":"Rationally smooth elements of Coxeter groups and triangle group avoidance","year":2013,"lang":"en","type":"article","venue":"Journal of Algebraic Combinatorics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":11,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; University of British Columbia; National Science Foundation","keywords":"Coxeter group; Mathematics; Artin group; Combinatorics; Coxeter complex; Coxeter element; Rank (graph theory); Longest element of a Coxeter group; Type (biology); Factorization; Group (periodic table); Pure mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.01942102286008823,"gpt":0.2703874517897542,"spread":0.2509664289296659,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009807665,0.0002553576,0.0007693241,0.000218109,0.00008325165,0.00005855146,0.000402747,0.0001242176,0.0001142019],"category_scores_gemma":[0.001730316,0.0002197009,0.0001806875,0.0003445991,0.00009914048,0.0006130689,0.0001348689,0.0003639971,0.00001032916],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001285593,"about_ca_system_score_gemma":0.00008899658,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002034021,"about_ca_topic_score_gemma":0.000001116636,"domain_scores_codex":[0.9970573,0.00013071,0.001546242,0.000171222,0.0008128961,0.0002815851],"domain_scores_gemma":[0.9955574,0.001248027,0.001876549,0.0003391193,0.0007913099,0.0001876221],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00004840183,0.0008036121,0.001165919,0.0003053522,0.0001490721,0.0000136872,0.0005936832,0.000001529055,0.002604152,0.9892718,0.003653756,0.001389105],"study_design_scores_gemma":[0.002951608,0.0006691682,0.001478277,0.0001706739,0.00008670016,0.00005481032,0.0001752438,0.0001207898,0.0009601253,0.9924127,0.0007118455,0.0002080871],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.984317,0.0004977584,0.01218199,0.0003336243,0.001334455,0.0005173999,0.000003970705,0.00002763666,0.0007861728],"genre_scores_gemma":[0.9763029,0.0001002954,0.02308627,0.0000616874,0.0001395776,0.0000141792,0.00000115223,0.00004864741,0.0002452447],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01090428,"threshold_uncertainty_score":0.8959144,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2051258063","doi":"10.1007/s10801-012-0395-8","title":"Nonexistence results for tight block designs","year":2012,"lang":"en","type":"article","venue":"Journal of Algebraic Combinatorics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":11,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Block (permutation group theory); Upper and lower bounds; Combinatorial design; Discrete mathematics; Polynomial; Block design; Mathematical analysis","retraction":null,"screen_n_in":null,"score":{"opus":0.02529612719062183,"gpt":0.2333272157236941,"spread":0.2080310885330723,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001049333,0.0001428556,0.0002695299,0.0001366969,0.00006848952,0.00002678961,0.0002473649,0.00009508253,0.00000474096],"category_scores_gemma":[0.000136911,0.0001241559,0.0001729727,0.0002463193,0.00002252069,0.0002407619,0.00001364032,0.0002134861,0.00001328554],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007583021,"about_ca_system_score_gemma":0.00002348938,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":3.82307e-7,"about_ca_topic_score_gemma":1.959325e-7,"domain_scores_codex":[0.9987911,0.0000434964,0.0005530111,0.00006317178,0.0002271664,0.0003220846],"domain_scores_gemma":[0.9990008,0.0002710698,0.0001988956,0.0001783116,0.0001476774,0.0002032569],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0005862626,0.0008798226,0.002983221,0.0008164244,0.0008347331,0.0000589908,0.006983929,0.002213673,0.01693719,0.8617265,0.1035583,0.002420935],"study_design_scores_gemma":[0.01660086,0.003083882,0.0111026,0.0009754724,0.000722738,0.002707848,0.001950627,0.004349407,0.07593239,0.3431849,0.536888,0.002501235],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9599159,0.005948909,0.008786567,0.0001635496,0.01211244,0.0003846682,0.00001891217,0.0001422504,0.01252683],"genre_scores_gemma":[0.998872,0.00005725292,0.0003942262,0.00001841755,0.0003676827,0.000004806554,9.116314e-7,0.00002624765,0.000258456],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.5185416,"threshold_uncertainty_score":0.506293,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4387244283","doi":"10.1007/s10801-023-01261-3","title":"Quantum state transfer between twins in weighted graphs","year":2023,"lang":"en","type":"article","venue":"Journal of Algebraic Combinatorics","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Brandon University; University of Manitoba","funders":"Canada Research Chairs; Canada Foundation for Innovation","keywords":"Combinatorics; Mathematics; Adjacency list; Transfer (computing); Adjacency matrix; Graph; Discrete mathematics; Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.01288659782116349,"gpt":0.2393976230755137,"spread":0.2265110252543502,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001179609,0.0002213498,0.0004776694,0.001024565,0.0001115235,0.00013251,0.001260903,0.00008874174,0.000003310507],"category_scores_gemma":[0.00005941742,0.0001860319,0.0002281677,0.003353424,0.0000447188,0.0003337501,0.000173124,0.0007688315,0.00001959773],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000688295,"about_ca_system_score_gemma":0.0001876625,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001550092,"about_ca_topic_score_gemma":0.000003040236,"domain_scores_codex":[0.9975501,0.0001720295,0.0007979977,0.0002678341,0.0007016308,0.0005104016],"domain_scores_gemma":[0.9986853,0.000370703,0.0001942283,0.0003503333,0.0001807937,0.0002186555],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00006616907,0.0009550068,0.0581004,0.0002153793,0.0004372152,0.003806169,0.0159431,0.004060103,0.0008691465,0.7282477,0.005472051,0.1818276],"study_design_scores_gemma":[0.001930766,0.0006999774,0.1059354,0.0001551755,0.00001748725,0.0001114135,0.00004633441,0.09753994,0.0005250215,0.7893056,0.003334824,0.0003981027],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9527928,0.0001951947,0.04288266,0.002168801,0.0016855,0.00009228938,0.000002949016,0.0001288804,0.00005098769],"genre_scores_gemma":[0.9988124,0.0001094086,0.0008349327,0.0000822791,0.00008988489,0.000001141023,0.000001279256,0.00002099802,0.00004760995],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1814294,"threshold_uncertainty_score":0.7586163,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2115663040","doi":"10.1007/s10801-009-0212-1","title":"Hard Lefschetz theorem for simple polytopes","year":2009,"lang":"en","type":"article","venue":"Journal of Algebraic Combinatorics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":9,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; Universities Space Research Association","keywords":"Mathematics; Polytope; Simple (philosophy); Combinatorics; Polynomial; h-vector; Discrete mathematics; Simplicial complex; Mathematical analysis","retraction":null,"screen_n_in":null,"score":{"opus":0.04040639090772842,"gpt":0.3269299633833677,"spread":0.2865235724756393,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001267334,0.0003374718,0.0008542062,0.000238493,0.0001710099,0.00008681589,0.0007366046,0.0001831476,0.00003482959],"category_scores_gemma":[0.003797453,0.0002852942,0.0004581052,0.0004162675,0.00005797364,0.0004101663,0.00006044926,0.0004547386,0.00000710998],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002234248,"about_ca_system_score_gemma":0.0001851779,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":3.619672e-7,"about_ca_topic_score_gemma":2.06463e-7,"domain_scores_codex":[0.9973081,0.00008320052,0.001214209,0.0002106397,0.0007012813,0.0004825976],"domain_scores_gemma":[0.995491,0.00161748,0.001268631,0.0005197749,0.0008553865,0.0002477017],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001020303,0.0005895089,0.00002459547,0.00008367986,0.00007768511,0.00001921245,0.0003625768,0.000005267165,0.001041202,0.9815505,0.01257548,0.003568231],"study_design_scores_gemma":[0.002286749,0.001241043,0.0001175718,0.00009000851,0.0001409821,0.0001165606,0.0001725837,0.00009113471,0.004749301,0.9775401,0.01314957,0.0003044195],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.801287,0.001142219,0.1814303,0.004210128,0.005447394,0.00145017,0.00001858847,0.0002764156,0.004737803],"genre_scores_gemma":[0.9621745,0.00005789784,0.03608981,0.0002966123,0.000538246,0.000007176938,0.000001565648,0.00007227243,0.0007619716],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1608874,"threshold_uncertainty_score":0.9999599,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1971196865","doi":"10.1007/s10801-012-0342-8","title":"Staircase skew Schur functions are Schur P-positive","year":2012,"lang":"en","type":"article","venue":"Journal of Algebraic Combinatorics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":9,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Université du Québec à Montréal","funders":"Natural Sciences and Engineering Research Council of Canada; San Francisco State University; National Science Foundation","keywords":"Mathematics; Skew; Eulerian path; Combinatorics; Conjecture; Schur's lemma; Schur's theorem; Schur product theorem; Schur decomposition; Schur polynomial; Schur complement; Pure mathematics; Macdonald polynomials; Discrete orthogonal polynomials; Orthogonal polynomials; Gegenbauer polynomials; Computer science; Classical orthogonal polynomials; Physics; Lagrangian","retraction":null,"screen_n_in":null,"score":{"opus":0.03912917681561471,"gpt":0.3128288116848784,"spread":0.2736996348692636,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001371859,0.0004289177,0.0008949652,0.0004081685,0.0003008709,0.00008317933,0.0005340402,0.0002125709,0.0001151503],"category_scores_gemma":[0.003560599,0.0003848947,0.0004051315,0.0009128283,0.0001064705,0.001377068,0.0001974774,0.001029369,0.0001026478],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005859201,"about_ca_system_score_gemma":0.0002135391,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001924859,"about_ca_topic_score_gemma":9.40475e-7,"domain_scores_codex":[0.9964329,0.0002172606,0.001300008,0.0002057487,0.001104857,0.0007392539],"domain_scores_gemma":[0.9940866,0.001485024,0.002001265,0.0006264244,0.001207576,0.0005931134],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00008068408,0.002348913,0.001770856,0.0002123966,0.000314206,0.0001163457,0.001200377,0.000005590415,0.0002135306,0.9813926,0.01163065,0.0007138485],"study_design_scores_gemma":[0.002063915,0.0004943334,0.001642253,0.0003299195,0.0003725137,0.000719932,0.001367921,0.00001604016,0.001349891,0.985453,0.005703922,0.0004863835],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9547182,0.00160978,0.02823148,0.0008204001,0.009930044,0.0005491428,0.00002386882,0.0001769736,0.003940114],"genre_scores_gemma":[0.9907309,0.00008904931,0.007217465,0.00008651057,0.0008706378,0.00001079142,0.000001808158,0.0001068019,0.0008860367],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.0360127,"threshold_uncertainty_score":0.9998603,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1969831346","doi":"10.1007/s10801-013-0479-0","title":"Finite polytopes have finite regular covers","year":2013,"lang":"en","type":"article","venue":"Journal of Algebraic Combinatorics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":9,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of New Brunswick","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Polytope; Mathematics; Combinatorics; Finite set; Mathematical analysis","retraction":null,"screen_n_in":null,"score":{"opus":0.005271517632017944,"gpt":0.175287453895859,"spread":0.170015936263841,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003796972,0.0002018402,0.0003641893,0.0002485059,0.00007102111,0.00009873028,0.0003413607,0.0001273934,0.0002071912],"category_scores_gemma":[0.0001932082,0.0001802554,0.0002161817,0.0002970129,0.000043828,0.0004382274,0.00002995712,0.0003981932,0.0001068651],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006517972,"about_ca_system_score_gemma":0.00003121027,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006773616,"about_ca_topic_score_gemma":7.529948e-7,"domain_scores_codex":[0.9986103,0.00006993057,0.0005797643,0.00009515101,0.0003555141,0.0002892991],"domain_scores_gemma":[0.9987301,0.0003970884,0.0002113253,0.0002539913,0.0002072171,0.000200316],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002323293,0.001169877,0.0450775,0.00130928,0.003641238,0.001122452,0.009908413,0.132467,0.02164331,0.5694121,0.1951507,0.01886577],"study_design_scores_gemma":[0.005812925,0.001344961,0.01892605,0.0007237439,0.0002916185,0.0006367263,0.002795401,0.02502502,0.0136683,0.7941114,0.1349012,0.00176265],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9823916,0.002660405,0.003313806,0.000254271,0.003874373,0.0002064494,0.000004722966,0.0001167288,0.007177661],"genre_scores_gemma":[0.9988408,0.0001666088,0.00005890555,0.00007841265,0.0001510963,0.000004391256,0.000001161758,0.00003832029,0.0006603169],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2246993,"threshold_uncertainty_score":0.7350603,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2087061385","doi":"10.1007/s10801-014-0575-9","title":"On the Erdős–Ko–Rado property for finite groups","year":2014,"lang":"en","type":"article","venue":"Journal of Algebraic Combinatorics","topic":"Finite Group Theory Research","field":"Mathematics","cited_by":8,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Ottawa","funders":"","keywords":"Mathematics; Combinatorics; Coset; Cardinality (data modeling); Abelian group; Property (philosophy); Order (exchange); Group (periodic table); Finite group; Transitive relation; Finite set; Nilpotent; Nilpotent group; Discrete mathematics; Mathematical analysis","retraction":null,"screen_n_in":null,"score":{"opus":0.06124486111080788,"gpt":0.3080051083125545,"spread":0.2467602472017466,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.005215233,0.0002398839,0.0004747923,0.0002242371,0.0002699815,0.0001182611,0.0009617608,0.0001345228,0.0001290883],"category_scores_gemma":[0.01428649,0.0001208283,0.0003310552,0.0004218882,0.0001209141,0.0001613502,0.000124423,0.0008000172,0.00004564537],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001571244,"about_ca_system_score_gemma":0.0001259022,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001133673,"about_ca_topic_score_gemma":0.000001217311,"domain_scores_codex":[0.9972698,0.0004473521,0.0007294483,0.0001862939,0.0009172931,0.0004498242],"domain_scores_gemma":[0.9854833,0.01249152,0.0005905004,0.000598094,0.0006586328,0.0001778978],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002238745,0.0003994689,0.00006469167,0.000109265,0.000086671,0.000008540906,0.0004183094,0.000006841088,0.0001138541,0.9656726,0.03130127,0.001594588],"study_design_scores_gemma":[0.001496508,0.001737087,0.00009553978,0.0001213505,0.00005330888,0.00004532264,0.0001290848,0.001294089,0.000492205,0.9759323,0.01842711,0.0001760874],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9349218,0.0001975055,0.03297044,0.01356562,0.002858083,0.001631541,0.0000142543,0.000101032,0.01373971],"genre_scores_gemma":[0.9958898,0.00002167834,0.0008953855,0.0004874277,0.0003367246,0.00002378225,9.791863e-7,0.00007238215,0.002271806],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.06096802,"threshold_uncertainty_score":0.9940166,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2018407410","doi":"10.1007/s10801-014-0541-6","title":"Double Macdonald polynomials as the stable limit of Macdonald superpolynomials","year":2014,"lang":"en","type":"article","venue":"Journal of Algebraic Combinatorics","topic":"Algebraic structures and combinatorial models","field":"Mathematics","cited_by":7,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Université Laval","funders":"Comisión Nacional de Investigación Científica y Tecnológica; Natural Sciences and Engineering Research Council of Canada; Fondo Nacional de Desarrollo Científico y Tecnológico; Fonds Québécois de la Recherche sur la Nature et les Technologies","keywords":"Mathematics; Macdonald polynomials; Schur polynomial; Koornwinder polynomials; Askey–Wilson polynomials; Combinatorics; Pure mathematics; Difference polynomials; Orthogonal polynomials","retraction":null,"screen_n_in":null,"score":{"opus":0.02792363368134064,"gpt":0.2861660537235788,"spread":0.2582424200422381,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002707576,0.0004617772,0.001283657,0.000273237,0.0002667535,0.0001282498,0.001485081,0.0002987513,0.0004369699],"category_scores_gemma":[0.001284886,0.0003168382,0.0006587146,0.0006127619,0.0002228227,0.0003473798,0.0002917397,0.0007790322,0.00001782736],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001870359,"about_ca_system_score_gemma":0.0004533505,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00009656055,"about_ca_topic_score_gemma":0.000006632515,"domain_scores_codex":[0.9954086,0.0003391869,0.001910853,0.0003060192,0.0014337,0.0006016498],"domain_scores_gemma":[0.9936866,0.002342715,0.001934998,0.0008940948,0.0008368298,0.0003047569],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0003993618,0.000298011,0.0004894441,0.0001044327,0.0003043124,0.000009812979,0.0005976357,0.00001960839,0.0008830714,0.9851471,0.01102768,0.0007195815],"study_design_scores_gemma":[0.003684748,0.0007892231,0.0003688372,0.000121608,0.0002925789,0.0001807757,0.0002185904,0.00005828323,0.01219336,0.9634014,0.01834346,0.0003471675],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9861664,0.001066937,0.0003481817,0.002559047,0.004119731,0.0004095644,0.00000597695,0.0000384156,0.00528573],"genre_scores_gemma":[0.9970385,0.0001645322,0.0004056969,0.0003908224,0.000803665,0.000009225349,0.000001362773,0.00008312194,0.001103087],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.02174567,"threshold_uncertainty_score":0.9999284,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2989256151","doi":"10.1007/s10801-019-00919-1","title":"Directed forests and the constancy of Kemeny’s constant","year":2019,"lang":"en","type":"article","venue":"Journal of Algebraic Combinatorics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":6,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Manitoba","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Markov chain; Constant (computer programming); Stochastic matrix; State (computer science); Algebraic combinatorics; Algebraic number; Stationary distribution; Matrix (chemical analysis); Tree (set theory); Distribution (mathematics); Generating function; Discrete mathematics; Statistics; Mathematical analysis; Algorithm","retraction":null,"screen_n_in":null,"score":{"opus":0.01285194812334357,"gpt":0.2662714524730327,"spread":0.2534195043496891,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001397951,0.0002306307,0.0009453365,0.0001527281,0.000066541,0.00003187017,0.0004278051,0.0001082952,0.00004951212],"category_scores_gemma":[0.002369206,0.0001490526,0.0001995471,0.000413849,0.0003359216,0.0001925957,0.0001484093,0.0004254963,0.000003971914],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009113575,"about_ca_system_score_gemma":0.0001789551,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002062847,"about_ca_topic_score_gemma":0.000002086766,"domain_scores_codex":[0.9974997,0.0001825165,0.00121571,0.000139604,0.0007098247,0.0002526216],"domain_scores_gemma":[0.9932525,0.003676161,0.001744746,0.00046058,0.0007515284,0.0001144689],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001980488,0.0002050405,0.001803465,0.0002323937,0.0001593792,0.0000133295,0.0007569013,0.000001740647,0.0001896664,0.9956119,0.0006239737,0.0002041655],"study_design_scores_gemma":[0.00683937,0.0003286432,0.0003111824,0.0002760362,0.0001519744,0.0001668538,0.0003993435,0.0001716039,0.0009286806,0.9899141,0.0003517416,0.0001605051],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9898268,0.001332697,0.001588524,0.0003934115,0.001992447,0.0006127334,0.000004162866,0.00004080253,0.004208416],"genre_scores_gemma":[0.996877,0.0001733041,0.002626801,0.00002814843,0.0000462325,0.000003390794,2.289953e-7,0.00003540345,0.0002094667],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.007050218,"threshold_uncertainty_score":0.607819,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W318684809","doi":"10.1007/s10801-015-0600-7","title":"The monodromy group of a truncated simplex","year":2015,"lang":"en","type":"article","venue":"Journal of Algebraic Combinatorics","topic":"Mathematics and Applications","field":"Mathematics","cited_by":6,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of New Brunswick","funders":"Natural Sciences and Engineering Research Council of Canada; Simons Foundation","keywords":"Monodromy; Mathematics; Simplex; Group (periodic table); Combinatorics; Product (mathematics); Symmetric group; Direct product; Pure mathematics; Geometry; Physics","retraction":null,"screen_n_in":null,"score":{"opus":0.08322172026828699,"gpt":0.3302394096718409,"spread":0.2470176894035539,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001424492,0.0001155926,0.0003271288,0.00007598265,0.000088612,0.00003809279,0.0004770857,0.00005973094,0.00001284983],"category_scores_gemma":[0.001046411,0.00007308098,0.0001491045,0.0003696575,0.00006668083,0.00007793041,0.00007119511,0.000214125,0.000004913942],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006796158,"about_ca_system_score_gemma":0.0001374281,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003385303,"about_ca_topic_score_gemma":0.000001959726,"domain_scores_codex":[0.9983552,0.0000608524,0.0008308971,0.00006909415,0.0005203177,0.0001637058],"domain_scores_gemma":[0.9969577,0.0008720683,0.001034807,0.0003560296,0.0006256311,0.0001538126],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0000191851,0.0004319591,0.00008508647,0.00005052296,0.00009019859,0.000004422657,0.0007770084,0.000001868613,0.000172243,0.9349933,0.06244568,0.0009285294],"study_design_scores_gemma":[0.0007844093,0.0002079502,0.00008123642,0.00003396437,0.0000668963,0.00005559756,0.000551088,0.00034063,0.000398588,0.9632537,0.03414401,0.00008194207],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9830908,0.0007221943,0.008186339,0.00195821,0.0006212062,0.0003777099,0.000005194435,0.00003296101,0.00500545],"genre_scores_gemma":[0.9959177,0.00005724076,0.003570872,0.00001849981,0.0000603487,0.000005503612,5.579359e-7,0.00002150606,0.0003477095],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.02830167,"threshold_uncertainty_score":0.2980156,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2048179325","doi":"10.1007/s10801-013-0446-9","title":"Cyclic symmetry of the scaled simplex","year":2013,"lang":"en","type":"article","venue":"Journal of Algebraic Combinatorics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":5,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of New Brunswick","funders":"Natural Sciences and Engineering Research Council of Canada; Université du Québec à Montréal","keywords":"Mathematics; Combinatorics; Hyperplane; Simplex; Partially ordered set; Order (exchange); Homogeneous space; Affine transformation; Geometry","retraction":null,"screen_n_in":null,"score":{"opus":0.02147146750284574,"gpt":0.2790689296287349,"spread":0.2575974621258891,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007259556,0.0002686524,0.0007692977,0.0001891897,0.000112889,0.00004376438,0.00111587,0.0001652921,0.0001348479],"category_scores_gemma":[0.003683469,0.0001778304,0.0004470294,0.0008803821,0.0001486635,0.0003506323,0.000274461,0.0006157762,0.00001959416],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001840905,"about_ca_system_score_gemma":0.0001608538,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004725506,"about_ca_topic_score_gemma":6.575522e-7,"domain_scores_codex":[0.9968403,0.0001733108,0.001455183,0.0001444231,0.001038937,0.0003478588],"domain_scores_gemma":[0.9943941,0.001608843,0.002083319,0.0007640436,0.0009744355,0.0001752395],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001354696,0.0006511993,0.0008777277,0.0002401359,0.000141474,0.000006601775,0.0004066413,0.000003751275,0.002067694,0.9862238,0.008205702,0.001161702],"study_design_scores_gemma":[0.001244083,0.0002004128,0.001370018,0.0001810417,0.0001151392,0.00009580567,0.0002377949,0.00004876568,0.007667191,0.9878309,0.0008281893,0.0001805976],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9924513,0.0002269836,0.001548177,0.0006827514,0.002624393,0.0004459608,0.000001820809,0.00003205813,0.001986602],"genre_scores_gemma":[0.9954985,0.00002863515,0.003803496,0.0000678467,0.0001548596,0.00000674294,1.49475e-7,0.00005548849,0.000384273],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.007377512,"threshold_uncertainty_score":0.7251712,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2886387515","doi":"10.1007/s10801-019-00900-y","title":"Construction of cospectral graphs","year":2019,"lang":"en","type":"preprint","venue":"Journal of Algebraic Combinatorics","topic":"Graph theory and applications","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Ministry of Education, India; University of Waterloo","keywords":"Combinatorics; Line graph; Cograph; Mathematics; Discrete mathematics; Pathwidth; Graph; Split graph; Symmetric graph; Comparability graph; Graph product; Voltage graph","retraction":null,"screen_n_in":null,"score":{"opus":0.02805952322355335,"gpt":0.2959501441155659,"spread":0.2678906208920125,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008487329,0.0002458658,0.0008025367,0.0003827839,0.00005279235,0.00002986231,0.000586223,0.0003173008,0.00006901376],"category_scores_gemma":[0.000278443,0.0002258626,0.0005859146,0.0003443983,0.0001555526,0.00008284199,0.0001899787,0.001115816,0.000005001847],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008932021,"about_ca_system_score_gemma":0.0002796308,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002763718,"about_ca_topic_score_gemma":5.730345e-7,"domain_scores_codex":[0.997884,0.0001196232,0.001135649,0.0001779106,0.0005000666,0.0001827188],"domain_scores_gemma":[0.9956186,0.0005088865,0.002541942,0.0005660474,0.000662532,0.0001019369],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00003149418,0.0003220231,0.0009144035,0.0003849045,0.0002447956,0.000004849489,0.0002154583,0.00001853237,0.0001943248,0.9959182,0.001504793,0.0002462188],"study_design_scores_gemma":[0.0006055163,0.0001738712,0.0004752343,0.0002794501,0.0002875392,0.0001295749,0.00014517,0.00002242648,0.002183338,0.9950438,0.0004656033,0.0001884406],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9896207,0.0005039477,0.00374246,0.0002949637,0.002933196,0.0003490309,0.0000242889,0.00002766631,0.002503753],"genre_scores_gemma":[0.9944931,0.0002591324,0.005004623,0.00001322574,0.0000814044,0.000004615962,0.000003549819,0.00003235646,0.0001080404],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.004872358,"threshold_uncertainty_score":0.921041,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2907423062","doi":"10.1007/s10801-020-00983-y","title":"A unified construction of semiring-homomorphic graph invariants","year":2021,"lang":"en","type":"article","venue":"Journal of Algebraic Combinatorics","topic":"Finite Group Theory Research","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Perimeter Institute","funders":"Max-Planck-Institut für Mathematik in den Naturwissenschaften","keywords":"Semiring; Matroid; Graph homomorphism; Multiplicative function; Homomorphism; Tensor product; Graph; Graph property","retraction":null,"screen_n_in":null,"score":{"opus":0.0541761223804199,"gpt":0.3104688157026954,"spread":0.2562926933222754,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001694324,0.0001664629,0.0005763092,0.0003929843,0.00007672098,0.00004246649,0.0003795282,0.0001533536,0.000234071],"category_scores_gemma":[0.002984192,0.0001576771,0.000241121,0.001204266,0.0001759587,0.0002160961,0.0001475308,0.0006522146,0.000008556603],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001117119,"about_ca_system_score_gemma":0.0005145128,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002624963,"about_ca_topic_score_gemma":0.000002652581,"domain_scores_codex":[0.9973769,0.0003659211,0.0009644213,0.0001542965,0.0008644481,0.00027407],"domain_scores_gemma":[0.9958464,0.001193524,0.0008814748,0.0004106116,0.001497723,0.0001702899],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001081564,0.000499724,0.002669388,0.000263058,0.0002288242,0.0003747995,0.0004926653,0.00000274318,0.006133713,0.9876402,0.001077205,0.0005095315],"study_design_scores_gemma":[0.001624546,0.0002948458,0.001054188,0.0002083613,0.00008612532,0.00131785,0.0006542595,0.00002489893,0.01735613,0.9770034,0.0002357802,0.0001396416],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9939755,0.0003867795,0.002329406,0.000510808,0.001013974,0.000107737,0.000004700678,0.00002844856,0.001642597],"genre_scores_gemma":[0.9947501,0.0001773129,0.00469983,0.00002640491,0.00007645403,0.000001343795,0.000001015584,0.00004359142,0.0002239611],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01122241,"threshold_uncertainty_score":0.6429887,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1980470481","doi":"10.1007/s10801-012-0399-4","title":"On the permutation groups of cyclic codes","year":2012,"lang":"en","type":"article","venue":"Journal of Algebraic Combinatorics","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Victoria","funders":"","keywords":"Mathematics; Cyclic permutation; Sylow theorems; Combinatorics; Partial permutation; Permutation (music); Permutation group; Finite field; Bit-reversal permutation; Prime (order theory); Discrete mathematics; BCH code; Permutation graph; Symmetric group; Group (periodic table); Finite group; Algorithm; Decoding methods","retraction":null,"screen_n_in":null,"score":{"opus":0.01277059063180696,"gpt":0.2277403524481567,"spread":0.2149697618163497,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001392659,0.00009139223,0.0001693732,0.0001712723,0.0001011172,0.00004228624,0.0007143533,0.00003999684,0.00001728795],"category_scores_gemma":[0.0002244311,0.00005900623,0.0001656378,0.000577792,0.00005412893,0.0004154224,0.00007404522,0.0002324093,0.000006352792],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003022722,"about_ca_system_score_gemma":0.00003386021,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":6.627316e-7,"about_ca_topic_score_gemma":1.065282e-7,"domain_scores_codex":[0.9988451,0.0001736097,0.0003309585,0.00006650386,0.0004120203,0.0001717972],"domain_scores_gemma":[0.9982243,0.0008093851,0.0004415511,0.0002758649,0.0001649622,0.00008399058],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001287358,0.0002033143,0.001394291,0.000006825913,0.00002943381,0.000001998646,0.001202371,0.000008294939,0.0003998227,0.994207,0.0005606474,0.001973079],"study_design_scores_gemma":[0.0003410951,0.0004697977,0.01553677,0.0000458644,0.0000227206,0.00006520571,0.0001466798,0.0001835839,0.003208904,0.9792314,0.0006505889,0.00009738829],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9622176,0.0004401933,0.03413862,0.0008901163,0.001218025,0.00005141718,3.912567e-7,0.00001505699,0.00102856],"genre_scores_gemma":[0.9993671,0.00003042712,0.0003281714,0.0001826428,0.0000717113,9.58575e-7,1.151555e-7,0.000005211006,0.00001368137],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.03714946,"threshold_uncertainty_score":0.2406204,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2075002921","doi":"10.1007/s10801-014-0555-0","title":"The higher spin generalization of the 6-vertex model with domain wall boundary conditions and Macdonald polynomials","year":2014,"lang":"en","type":"article","venue":"Journal of Algebraic Combinatorics","topic":"Algebraic structures and combinatorial models","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Concordia University; Université de Montréal","funders":"Ministero dell’Istruzione, dell’Università e della Ricerca; Agence Nationale de la Recherche; Centre de Recherches Mathématiques","keywords":"Mathematics; Partition function (quantum field theory); Combinatorics; Vertex model; Graph partition; Vertex (graph theory); Partition (number theory); Macdonald polynomials; Schur polynomial; Polynomial; Discrete mathematics; Orthogonal polynomials; Difference polynomials; Mathematical analysis; Graph; Physics; Quantum mechanics","retraction":null,"screen_n_in":null,"score":{"opus":0.01264675994801379,"gpt":0.2551281636147453,"spread":0.2424814036667315,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007437019,0.0002218211,0.0004247685,0.0000734038,0.0004535956,0.0001014445,0.0005088077,0.0001252649,0.00001789465],"category_scores_gemma":[0.0002026689,0.0001173655,0.0001643924,0.0002747306,0.0002775942,0.0001647631,0.0001165907,0.0003314699,4.02793e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009556935,"about_ca_system_score_gemma":0.0002259786,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000009045245,"about_ca_topic_score_gemma":0.000008542116,"domain_scores_codex":[0.997987,0.0002080509,0.000725365,0.0001500697,0.0006866829,0.0002428411],"domain_scores_gemma":[0.9974728,0.000562728,0.001026584,0.0004265472,0.0003977785,0.0001135449],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00006059235,0.00007262991,0.0004654755,0.00003370639,0.0001158574,0.000001178048,0.0002262852,0.0001270883,0.0002395902,0.9945054,0.004001381,0.0001507953],"study_design_scores_gemma":[0.001475173,0.0002467451,0.00242349,0.00008339823,0.0001388174,0.00005785415,0.00004406435,0.001549244,0.0003866456,0.9911227,0.002317663,0.000154228],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9913988,0.000496662,0.002764786,0.003110589,0.001384868,0.0002410391,0.000004446622,0.00001412969,0.0005847387],"genre_scores_gemma":[0.9983917,0.00008439894,0.0006347102,0.0002564723,0.000126588,0.000004980533,8.501422e-7,0.00003612052,0.0004641181],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.00699302,"threshold_uncertainty_score":0.4786026,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2287429944","doi":"10.1007/s10801-016-0667-9","title":"Geodesic growth of right-angled Coxeter groups based on trees","year":2016,"lang":"en","type":"article","venue":"Journal of Algebraic Combinatorics","topic":"Geometric and Algebraic Topology","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"Division of Mathematical Sciences; Université de Genève; Université de Fribourg; Schweizerischer Nationalfonds zur Förderung der Wissenschaftlichen Forschung; National Science Foundation","keywords":"Combinatorics; Coxeter group; Mathematics; Geodesic; Tree (set theory); Cardinality (data modeling); Geometry; Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.02012083046623277,"gpt":0.2591981139847355,"spread":0.2390772835185028,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001028834,0.000280816,0.0008087591,0.0008429011,0.00007069956,0.00001692971,0.0005702637,0.0001717129,0.0005749012],"category_scores_gemma":[0.002296091,0.000168785,0.0004090607,0.0007911778,0.0001703347,0.0001730029,0.00006204399,0.0003037961,0.00002341158],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001550091,"about_ca_system_score_gemma":0.0001724526,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003361725,"about_ca_topic_score_gemma":0.00000184308,"domain_scores_codex":[0.997313,0.0002038778,0.001081513,0.0002090747,0.0008043498,0.0003881726],"domain_scores_gemma":[0.9945714,0.002981628,0.001229429,0.0004160888,0.0005872015,0.0002141792],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0003001758,0.001712043,0.00846388,0.0001382675,0.0002414427,0.0001838715,0.0001867262,0.000001873579,0.001475655,0.9725733,0.01258527,0.002137445],"study_design_scores_gemma":[0.004984215,0.002155514,0.009679199,0.0002365403,0.0001664103,0.00009339771,0.00004405034,0.00003763146,0.00774008,0.9738997,0.0006811072,0.0002821149],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9835836,0.0001486595,0.01002715,0.002495817,0.001338575,0.0001726862,0.000008691475,0.00003780539,0.002187071],"genre_scores_gemma":[0.9979938,0.00003248033,0.001016304,0.0002140691,0.0001473776,0.000002830593,5.003757e-7,0.00003984701,0.000552794],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01441025,"threshold_uncertainty_score":0.6882852,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4404912034","doi":"10.1007/s10801-024-01377-0","title":"On matrix product factorization of graphs","year":2024,"lang":"en","type":"article","venue":"Journal of Algebraic Combinatorics","topic":"Graph theory and applications","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University; University of Lethbridge","funders":"","keywords":"Mathematics; Combinatorics; Factorization; Product (mathematics); Matrix (chemical analysis); Algorithm","retraction":null,"screen_n_in":null,"score":{"opus":0.02236570972651505,"gpt":0.3228266449933744,"spread":0.3004609352668594,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005924719,0.0001118958,0.0002361171,0.0003233362,0.00004822526,0.00003112342,0.0002081283,0.00005167273,0.00005052832],"category_scores_gemma":[0.0004026153,0.00008821064,0.0001855734,0.0007676801,0.00003870908,0.0001345239,0.00001920013,0.0002689301,0.000008150014],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000402228,"about_ca_system_score_gemma":0.00007713083,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":5.821484e-7,"about_ca_topic_score_gemma":1.543454e-7,"domain_scores_codex":[0.9988512,0.00005825026,0.0005217367,0.0001082261,0.0003518012,0.0001087883],"domain_scores_gemma":[0.9985747,0.0005854095,0.0003185663,0.0002224589,0.0002381213,0.00006076676],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001523412,0.0002600358,0.00007236646,0.0001726235,0.00007233227,0.00000721409,0.0003036152,0.000004872094,0.001671587,0.9934307,0.003469423,0.0005199759],"study_design_scores_gemma":[0.000191705,0.0002347342,0.0001609828,0.0001549417,0.00008025459,0.00003499632,0.00004457005,0.00002172888,0.006776094,0.9901909,0.002028925,0.0000801802],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9874951,0.0009605213,0.007657848,0.000755218,0.00163079,0.0002172661,0.000009096811,0.00005962492,0.001214594],"genre_scores_gemma":[0.9991144,0.00007160266,0.0004114381,0.000009202225,0.00006205071,0.000002516939,0.000001139773,0.00002103577,0.0003066171],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01161936,"threshold_uncertainty_score":0.3597126,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2964198259","doi":"10.1007/s10801-017-0738-6","title":"Decomposing inversion sets of permutations and applications to faces of the Littlewood–Richardson cone","year":2017,"lang":"en","type":"article","venue":"Journal of Algebraic Combinatorics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Royal Military College of Canada; Queen's University","funders":"","keywords":"Combinatorics; Mathematics; Disjoint sets; Permutation (music); Tuple; Inversion (geology); Alpha (finance); Discrete mathematics; Physics","retraction":null,"screen_n_in":null,"score":{"opus":0.03996779083937365,"gpt":0.3468956971321973,"spread":0.3069279062928237,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005094726,0.0001464687,0.00047611,0.0001363134,0.000318861,0.00004467364,0.0006879686,0.00008202759,0.000005332171],"category_scores_gemma":[0.001830216,0.0001122344,0.0001318146,0.0002252119,0.0001578453,0.0002375069,0.0002989602,0.0002321037,0.000001031405],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008200458,"about_ca_system_score_gemma":0.0001122165,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003915182,"about_ca_topic_score_gemma":0.000002099752,"domain_scores_codex":[0.998418,0.00006380803,0.0007582821,0.000114853,0.0005008771,0.0001441249],"domain_scores_gemma":[0.9958116,0.0007155075,0.002019984,0.0006209972,0.0007139013,0.0001180039],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00003200104,0.0005275249,0.002934813,0.0004889048,0.0001263799,0.000002530447,0.002696487,0.00002969662,0.00738694,0.9831041,0.0005912012,0.002079445],"study_design_scores_gemma":[0.0008490023,0.0002017723,0.00263725,0.0003265722,0.0001465672,0.00003123474,0.0005126277,0.0001050908,0.01429555,0.9802875,0.0004866381,0.0001202303],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9876572,0.0002049539,0.009782886,0.0008017804,0.0006366042,0.0004389306,0.00001020878,0.000009423775,0.0004579861],"genre_scores_gemma":[0.9932641,0.00005497812,0.006543003,0.00001706735,0.00004180735,0.000005833717,2.463428e-7,0.00002121278,0.0000517052],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.00690861,"threshold_uncertainty_score":0.4576784,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4399208985","doi":"10.1007/s10801-024-01340-z","title":"The Ariki–Koike algebras and Rogers–Ramanujan type partitions","year":2024,"lang":"lv","type":"article","venue":"Journal of Algebraic Combinatorics","topic":"Advanced Mathematical Identities","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Dalhousie University","funders":"Australian Research Council; Killam Trusts; University of Melbourne; Simons Foundation","keywords":"Mathematics; Type (biology); Combinatorics; Ramanujan's sum; Algebra over a field; Pure mathematics; Paleontology; Biology","retraction":null,"screen_n_in":null,"score":{"opus":0.02644910086577345,"gpt":0.3085221486590007,"spread":0.2820730477932272,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.001726994,0.0004543118,0.0007689886,0.0002778963,0.0006011871,0.001205207,0.0006157063,0.0002572939,0.0001779832],"category_scores_gemma":[0.003149661,0.0003242689,0.000383022,0.0009039276,0.0005432505,0.0007338803,0.0003106748,0.001380091,0.0001736491],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003035578,"about_ca_system_score_gemma":0.0004662318,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003873303,"about_ca_topic_score_gemma":0.00001162648,"domain_scores_codex":[0.9962164,0.0002089705,0.001602893,0.0003066148,0.001035725,0.0006294597],"domain_scores_gemma":[0.9930054,0.004569244,0.0007044088,0.0005718831,0.0007548214,0.0003942761],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00003121965,0.0002691568,0.00003973718,0.0008778113,0.0005759393,0.0002980526,0.001631276,0.000004581982,0.00006636736,0.9622135,0.03260608,0.001386298],"study_design_scores_gemma":[0.000455033,0.0005090689,0.00008519545,0.001077436,0.0007414672,0.0007158255,0.001649407,0.0005765158,0.0002350415,0.9499547,0.04367243,0.0003278314],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6551885,0.2546252,0.01063645,0.02637952,0.03436176,0.0017438,0.00007067302,0.0004773499,0.0165167],"genre_scores_gemma":[0.9691975,0.01293846,0.001625978,0.0001156052,0.0007603818,0.00001037264,0.000002214556,0.0001674671,0.01518202],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.314009,"threshold_uncertainty_score":0.999921,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4398169897","doi":"10.1007/s10801-024-01337-8","title":"The weak Lefschetz property and mixed multiplicities of monomial ideals","year":2024,"lang":"en","type":"article","venue":"Journal of Algebraic Combinatorics","topic":"Commutative Algebra and Its Applications","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Dalhousie University","funders":"","keywords":"Monomial; Mathematics; Square-free integer; Degree (music); Combinatorics; Zero (linguistics); Monomial ideal; Ideal (ethics); Reduction (mathematics); Pure mathematics; Discrete mathematics; Polynomial ring; Polynomial; Mathematical analysis; Geometry","retraction":null,"screen_n_in":null,"score":{"opus":0.03181888657867971,"gpt":0.304458685948584,"spread":0.2726397993699043,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009273178,0.0001459555,0.0003325857,0.0001188593,0.0001804118,0.0001167879,0.0003084209,0.00006436574,0.00001309055],"category_scores_gemma":[0.0005705286,0.00007728238,0.0001495014,0.0002709792,0.0001777841,0.0001828736,0.0001199971,0.0003550485,0.000003251972],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000627965,"about_ca_system_score_gemma":0.0001661019,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000009132797,"about_ca_topic_score_gemma":0.000007688982,"domain_scores_codex":[0.9986041,0.0001014598,0.0007186335,0.0001110037,0.0003003326,0.000164536],"domain_scores_gemma":[0.996765,0.00222909,0.0003574975,0.0002440825,0.0003195868,0.00008470126],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00003489856,0.0001134646,0.0002104249,0.0001652652,0.0002081736,0.000005504838,0.001447661,0.000001407677,0.001478861,0.9690294,0.01415589,0.01314909],"study_design_scores_gemma":[0.0005350093,0.0002736408,0.001280401,0.000161449,0.0001232118,0.00009597432,0.001229613,0.0005224612,0.003404193,0.958986,0.03325288,0.0001351961],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.987528,0.005275381,0.001439681,0.003099635,0.0006652126,0.0002694555,0.000006947399,0.00003166689,0.001684075],"genre_scores_gemma":[0.9975295,0.0006988029,0.0005459188,0.0000152645,0.00009771973,0.000009582847,3.537311e-7,0.0000254139,0.001077457],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01909699,"threshold_uncertainty_score":0.3151484,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3139516618","doi":"10.1007/s10801-021-01085-z","title":"Morse resolutions of powers of square-free monomial ideals of projective dimension one","year":2021,"lang":"en","type":"preprint","venue":"Journal of Algebraic Combinatorics","topic":"Commutative Algebra and Its Applications","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto; Dalhousie University; University of Manitoba","funders":"Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada; Simons Foundation","keywords":"Monomial; Mathematics; Square-free integer; Morse code; Square (algebra); Monomial ideal; Dimension (graph theory); Pure mathematics; Discrete Morse theory; Ideal (ethics); Projective test; Resolution (logic); Discrete mathematics; Morse theory; Mathematical analysis; Geometry; Polynomial ring; Polynomial; Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.05886297280153831,"gpt":0.3292173668743734,"spread":0.2703543940728351,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00130516,0.0003670911,0.001770374,0.0006634149,0.00008059906,0.0000222803,0.001052328,0.0003747734,0.00006649391],"category_scores_gemma":[0.002765505,0.0003621035,0.0007937259,0.0007710428,0.000279927,0.0001592348,0.001280252,0.00114676,6.45648e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003304601,"about_ca_system_score_gemma":0.00129385,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001185681,"about_ca_topic_score_gemma":0.00002204187,"domain_scores_codex":[0.9954506,0.0003657768,0.002617087,0.0003059729,0.001002613,0.0002579836],"domain_scores_gemma":[0.9878649,0.001565583,0.005565319,0.001389711,0.003467336,0.000147155],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0005650688,0.008723238,0.001851934,0.00374742,0.003871019,0.00003106351,0.01606956,0.0004240282,0.02046054,0.9347678,0.008549362,0.0009389146],"study_design_scores_gemma":[0.002129583,0.0009541396,0.005621555,0.001878938,0.001029768,0.00003236753,0.002626277,0.0001602445,0.02774304,0.9574019,0.00006592474,0.000356285],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9905313,0.00163943,0.004789868,0.0004998681,0.0006305754,0.0007641252,0.000122921,0.00001553749,0.001006438],"genre_scores_gemma":[0.9903038,0.0004416242,0.009029954,0.000009405805,0.00006693448,0.00001917669,0.00001310957,0.00005416615,0.00006181397],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.02263403,"threshold_uncertainty_score":0.9998831,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}