{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":110,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":110,"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":"dd7739934530","filters":{"venue":"Advances in Applied Mathematics"}},"results":[{"id":"W2100552771","doi":"10.1016/s0196-8858(03)00078-2","title":"Homogeneous multivariate polynomials with the half-plane property","year":2003,"lang":"en","type":"article","venue":"Advances in Applied Mathematics","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":98,"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":"Matroid; Homogeneous polynomial; Polynomial; Graphic matroid; Property (philosophy); Matroid partitioning; Matching (statistics); Class (philosophy); Set (abstract data type)","retraction":null,"screen_n_in":null,"score":{"opus":0.01027692145734738,"gpt":0.2299357953178658,"spread":0.2196588738605185,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000298113,0.0001700013,0.0002062964,0.0000505558,0.0001153945,0.00008335011,0.000544341,0.00003547716,0.000006763851],"category_scores_gemma":[0.00003416899,0.00008324475,0.00002285175,0.0003221996,0.00007091634,0.0001796991,0.00007364275,0.0001215195,0.00004555344],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003270388,"about_ca_system_score_gemma":0.00005627595,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008675336,"about_ca_topic_score_gemma":0.00004581373,"domain_scores_codex":[0.9989643,0.0000291186,0.0002462586,0.0002742932,0.00021038,0.000275683],"domain_scores_gemma":[0.999037,0.0003211319,0.0001469402,0.0004307798,0.00001835553,0.0000458353],"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.00001539517,0.0002214329,0.00002840079,0.00008295198,0.00001445461,0.00002011794,0.002195858,0.003951342,0.001748909,0.8857329,0.000106138,0.1058821],"study_design_scores_gemma":[0.005664037,0.0004743685,0.0003353278,0.0003202311,0.0000664126,0.0006076593,0.001604378,0.09489312,0.07239399,0.6298667,0.1913676,0.002406172],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01442889,0.0004739586,0.9450783,0.0005584063,0.0001797684,0.0007233253,0.000001476807,0.0001576431,0.03839826],"genre_scores_gemma":[0.6929348,0.00002649545,0.3064786,0.0002001319,0.00002946182,0.00008076234,0.00000100354,0.00001301578,0.0002357091],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6785059,"threshold_uncertainty_score":0.3394622,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2015106956","doi":"10.1016/j.aam.2004.11.006","title":"Wilf-equivalence for singleton classes","year":2006,"lang":"en","type":"article","venue":"Advances in Applied Mathematics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":93,"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":"Brandeis University","keywords":"Mathematics; Combinatorics; Bijection; Permutation (music); Singleton; Permutation matrix; Discrete mathematics; Physics","retraction":null,"screen_n_in":null,"score":{"opus":0.02687452171482039,"gpt":0.3261446530526297,"spread":0.2992701313378093,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005796907,0.0004879943,0.0008179432,0.0001949429,0.0001462634,0.00006018207,0.0005909386,0.0001942181,0.00002019717],"category_scores_gemma":[0.0009355815,0.0004712201,0.0001414446,0.0004915816,0.0001809838,0.0003346481,0.0001286101,0.0002543928,0.00003028047],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002216736,"about_ca_system_score_gemma":0.00005462854,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001760666,"about_ca_topic_score_gemma":0.0000371923,"domain_scores_codex":[0.9969904,0.00001799791,0.00119202,0.0005316652,0.0005221936,0.0007457367],"domain_scores_gemma":[0.9945118,0.003866246,0.0006201121,0.0008188198,0.0001058373,0.00007720161],"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.00002818034,0.0006872533,0.00005108174,0.001700948,0.000007718404,0.000003954337,0.0002214966,0.0002870664,0.001605926,0.9929934,0.0003868447,0.002026117],"study_design_scores_gemma":[0.001248035,0.00006905013,0.000006475037,0.0002561317,0.00004587093,0.00001047068,0.0003619773,0.001161622,0.007758861,0.97965,0.008902874,0.0005286227],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02904007,0.000865897,0.8781489,0.0001084754,0.0008153688,0.002970779,0.00002823159,0.0006707883,0.08735152],"genre_scores_gemma":[0.2663276,0.0000773327,0.7321035,0.00003820142,0.0002733747,0.0006083522,0.000009885221,0.0001339511,0.0004278336],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.2372875,"threshold_uncertainty_score":0.999774,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2154871611","doi":"10.1016/j.aam.2011.04.004","title":"A new combinatorial identity for unicellular maps, via a direct bijective approach","year":2011,"lang":"en","type":"article","venue":"Advances in Applied Mathematics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":84,"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":"","keywords":"Bijection; Mathematics; Combinatorics; Bipartite graph; Genus; Identity (music); Graph; Discrete mathematics; Botany","retraction":null,"screen_n_in":null,"score":{"opus":0.04158816758432483,"gpt":0.3043618415888434,"spread":0.2627736740045186,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001053888,0.0006702273,0.001263064,0.0002950442,0.0001684967,0.00005546532,0.001056144,0.0003170589,0.00005248859],"category_scores_gemma":[0.001032154,0.0006580334,0.0002219098,0.0008769617,0.0001548605,0.0007187932,0.0002915027,0.0004288492,0.00005181264],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002981296,"about_ca_system_score_gemma":0.0001194838,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001014147,"about_ca_topic_score_gemma":0.00002493196,"domain_scores_codex":[0.9963679,0.00005015889,0.001283083,0.0007661258,0.000695582,0.0008371382],"domain_scores_gemma":[0.9958601,0.001762782,0.000816071,0.001187932,0.0001432576,0.0002298357],"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.0001443517,0.001320617,0.00001737458,0.001374696,0.00006148496,0.000005589367,0.004234137,0.00001648059,0.0002417612,0.9902445,0.0001890118,0.002150006],"study_design_scores_gemma":[0.003020436,0.000127422,0.000002508578,0.0001378968,0.0001471424,0.00001247549,0.001063616,0.0008721994,0.005876127,0.986778,0.001246544,0.0007156247],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001664898,0.0004129663,0.9042025,0.000006214127,0.001214231,0.003113124,0.00002107958,0.0004034845,0.08896154],"genre_scores_gemma":[0.1076169,0.00007347659,0.8907737,0.00001937838,0.0002800568,0.0007950597,0.00001544666,0.0001995813,0.0002264291],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.105952,"threshold_uncertainty_score":0.9995871,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2044750531","doi":"10.1016/s0196-8858(02)00504-3","title":"When does Zeilberger's algorithm succeed?","year":2003,"lang":"en","type":"article","venue":"Advances in Applied Mathematics","topic":"Mathematical functions and polynomials","field":"Mathematics","cited_by":63,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Ministère des Ressources Naturelles et de la Faune","keywords":"Mathematics; Hypergeometric function; Order (exchange); Term (time); Algorithm; Rational function; Function (biology); Combinatorics; Discrete mathematics; Pure mathematics; Finance; Business","retraction":null,"screen_n_in":null,"score":{"opus":0.01707435351452438,"gpt":0.2903438337929929,"spread":0.2732694802784685,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.001002654,0.0004043368,0.0007447746,0.0001889561,0.0001284122,0.00006313217,0.0003322685,0.0001803621,0.001466124],"category_scores_gemma":[0.0009227064,0.0002902236,0.0001301959,0.000340835,0.0001344736,0.0002083138,0.00006702392,0.0003017233,0.0002084727],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008449979,"about_ca_system_score_gemma":0.00004414273,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003234431,"about_ca_topic_score_gemma":0.00003638045,"domain_scores_codex":[0.9974825,0.00004750696,0.001016581,0.0004244548,0.0004274681,0.000601457],"domain_scores_gemma":[0.9964978,0.002223656,0.0003004416,0.0007789369,0.00004769819,0.0001514621],"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.000004882897,0.0004827761,0.00004631809,0.0004628602,0.00001942165,0.00000539467,0.0008427021,0.000009292209,0.0001238207,0.988335,0.001464262,0.008203235],"study_design_scores_gemma":[0.000515435,0.00002162772,0.00000170682,0.00009706448,0.00003608369,0.00001650428,0.000821957,0.0004334096,0.003525504,0.9120112,0.08213358,0.0003858896],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"methods","genre_scores_codex":[0.005991337,0.0006895353,0.474061,0.0001927478,0.0008762347,0.001476498,0.00003895261,0.0003972588,0.5162764],"genre_scores_gemma":[0.02564857,0.0002024705,0.9711452,0.0001525243,0.0001032423,0.0003126927,0.00000614173,0.00009766967,0.002331516],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5139449,"threshold_uncertainty_score":0.999955,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2143645603","doi":"10.1016/j.aam.2005.05.007","title":"On the Stanley–Wilf limit of 4231-avoiding permutations and a conjecture of Arratia","year":2005,"lang":"en","type":"article","venue":"Advances in Applied Mathematics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":51,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"York University","funders":"","keywords":"Conjecture; Permutation (music); Mathematics; Combinatorics; Limit (mathematics); Class (philosophy); Parity of a permutation; Sequence (biology); Discrete mathematics; Cyclic permutation; Symmetric group; Computer science; Physics; Mathematical analysis","retraction":null,"screen_n_in":null,"score":{"opus":0.009003227470727602,"gpt":0.2391318660253993,"spread":0.2301286385546717,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003359244,0.00009836169,0.0001877589,0.00005945491,0.00005479978,0.0000191259,0.0003445163,0.00003167321,0.000008379304],"category_scores_gemma":[0.00009330753,0.00006632658,0.00002297356,0.0002078904,0.0001020546,0.0001310511,0.00007782849,0.0001172882,0.000002720909],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001291625,"about_ca_system_score_gemma":0.00001570923,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":4.627827e-7,"about_ca_topic_score_gemma":0.000007164873,"domain_scores_codex":[0.9992785,0.00001788383,0.0002825765,0.000140486,0.0001653807,0.0001151481],"domain_scores_gemma":[0.9980897,0.001347423,0.000191992,0.0003357059,0.00001639816,0.00001878885],"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.00000209233,0.00006452653,0.000009910782,0.00008117905,0.000004167603,3.235901e-7,0.005061795,0.001507447,0.002037597,0.9813505,0.00001721057,0.009863228],"study_design_scores_gemma":[0.0002729848,0.00005319044,0.00003852738,0.0001561539,0.000007393072,0.000005887761,0.002022298,0.05580134,0.02407164,0.9170743,0.0003690395,0.0001272409],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3368505,0.001061142,0.6471567,0.0005927067,0.00005351634,0.0004131109,0.000008514287,0.00005785964,0.01380606],"genre_scores_gemma":[0.8897727,0.00008601089,0.1099918,0.0001041013,0.00001055166,0.00001732106,4.653282e-7,0.000006095617,0.00001090348],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5529222,"threshold_uncertainty_score":0.270472,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2098464356","doi":"10.1016/j.aam.2008.03.005","title":"A connection between palindromic and factor complexity using return words","year":2008,"lang":"en","type":"article","venue":"Advances in Applied Mathematics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":48,"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":"Palindrome; Mathematics; Combinatorics; Word (group theory); Connection (principal bundle); Function (biology); Set (abstract data type); Word length; Factor (programming language); Discrete mathematics; Geometry; Linguistics","retraction":null,"screen_n_in":null,"score":{"opus":0.0587870870588243,"gpt":0.291506953157473,"spread":0.2327198660986487,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001723863,0.0001429317,0.0002769011,0.00008473865,0.0001243751,0.00003488203,0.0003026169,0.00005875323,0.000005665586],"category_scores_gemma":[0.00002600464,0.000131486,0.00002338594,0.0002413335,0.0001454414,0.0002953865,0.0001553204,0.0001334605,0.000006018549],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004469734,"about_ca_system_score_gemma":0.00001812193,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004030897,"about_ca_topic_score_gemma":0.000004922497,"domain_scores_codex":[0.9990593,0.00001540408,0.0002872317,0.0002623841,0.0001638118,0.0002118939],"domain_scores_gemma":[0.999167,0.0003039921,0.0001449632,0.0003221416,0.00001049711,0.00005142606],"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.000008274116,0.000144692,0.008934851,0.0002907661,0.0000184841,0.00002297371,0.006561833,0.0001290867,0.002549087,0.9443688,0.000008341971,0.03696284],"study_design_scores_gemma":[0.0009359129,0.00004715868,0.004304689,0.0001418993,0.00001153042,0.0001617307,0.0005871498,0.1290752,0.006174043,0.8575186,0.0004805299,0.000561589],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5780462,0.0002526324,0.4202942,0.00001561179,0.00005646214,0.0001427665,0.000003429484,0.00009578248,0.001092848],"genre_scores_gemma":[0.7249524,0.0000776958,0.2748922,0.00003040268,0.00002720606,0.000006144398,0.000001347583,0.000008241642,0.000004397848],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1469062,"threshold_uncertainty_score":0.5361841,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1975206347","doi":"10.1006/aama.1999.0665","title":"Enumeration of m-Ary Cacti","year":2000,"lang":"en","type":"article","venue":"Advances in Applied Mathematics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":45,"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":"Enumeration; Mathematics; Combinatorics; Vertex (graph theory); Generalization; Discrete mathematics; Graph","retraction":null,"screen_n_in":null,"score":{"opus":0.01739044766133961,"gpt":0.3104009309760274,"spread":0.2930104833146878,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004140227,0.000306424,0.0006776785,0.0001411559,0.00005744822,0.000015097,0.0003792778,0.0001398965,0.0005082879],"category_scores_gemma":[0.0004843572,0.0002952955,0.00008445988,0.0004795469,0.0001234961,0.0002947099,0.00005090633,0.0002500765,0.00007597414],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000897406,"about_ca_system_score_gemma":0.00004600952,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000136591,"about_ca_topic_score_gemma":0.000009844254,"domain_scores_codex":[0.997767,0.0000242248,0.001063286,0.0003012358,0.0004795771,0.0003646508],"domain_scores_gemma":[0.9974313,0.001299438,0.0004105896,0.0007188644,0.00005150093,0.0000883295],"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.00003746896,0.0006425682,0.00002792403,0.0009030745,0.00001295412,0.000004282736,0.001502794,0.0003515396,0.001135785,0.968518,0.00007397718,0.02678963],"study_design_scores_gemma":[0.0007929443,0.00004661855,0.00000712122,0.0001765146,0.00002930856,0.00001010461,0.0003655465,0.0007386366,0.009931628,0.9850999,0.002511188,0.0002905479],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.3558802,0.001251785,0.1016388,0.0001006822,0.0006884748,0.002981203,0.00002869318,0.0006112616,0.5368188],"genre_scores_gemma":[0.5470642,0.0003614425,0.4518867,0.00003183414,0.00007559379,0.0001304209,0.00000477439,0.00007678524,0.0003683204],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5364505,"threshold_uncertainty_score":0.9999499,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W177832585","doi":"10.1016/j.aam.2012.08.005","title":"On the regularity of the <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.gif\" overflow=\"scroll\"><mml:msub><mml:mrow><mml:mi>L</mml:mi></mml:mrow><mml:mrow><mml:mi>p</mml:mi></mml:mrow></mml:msub></mml:math> Minkowski problem","year":2012,"lang":"lv","type":"article","venue":"Advances in Applied Mathematics","topic":"Geometric Analysis and Curvature Flows","field":"Mathematics","cited_by":43,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"McGill University","keywords":"Mathematics; Degenerate energy levels; Function (biology); Algorithm; Physics","retraction":null,"screen_n_in":null,"score":{"opus":0.01850007045832368,"gpt":0.2474281718764745,"spread":0.2289281014181508,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","research_integrity","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.003845793,0.0009392013,0.0005594156,0.0005125228,0.001202625,0.0007509236,0.002778318,0.001963596,0.2601233],"category_scores_gemma":[0.002928267,0.0013451,0.001769448,0.002217318,0.001567597,0.001019718,0.001915951,0.001986012,0.001462026],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002478932,"about_ca_system_score_gemma":0.000792173,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002525702,"about_ca_topic_score_gemma":0.0008473351,"domain_scores_codex":[0.9905065,0.000361218,0.002437758,0.00131947,0.00310406,0.002271021],"domain_scores_gemma":[0.9884121,0.003962338,0.003306379,0.003485228,0.0001730797,0.0006608202],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0004201762,0.0008076328,0.00001665454,0.002882439,0.001136719,0.000113434,0.00390836,0.00142277,0.0008091577,0.8302989,0.1562567,0.001927009],"study_design_scores_gemma":[0.001776707,0.0007853456,0.00005387832,0.002133691,0.002455893,0.0004197709,0.005506084,0.02592992,0.9416459,0.01180269,0.005817142,0.001672968],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.2858734,0.002371801,0.002756008,0.0005532393,0.00149905,0.000110742,0.0001417167,0.0001332781,0.7065607],"genre_scores_gemma":[0.9764609,0.001545062,0.01712445,0.001042945,0.001144064,0.001282965,0.000230933,0.0006133837,0.0005553028],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9408367,"threshold_uncertainty_score":0.9993321,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2081148745","doi":"10.1016/j.aam.2004.10.003","title":"Is complexity a source of incompleteness?","year":2005,"lang":"en","type":"article","venue":"Advances in Applied Mathematics","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":41,"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; Discrete mathematics; Peano axioms; Bounded function; Measure (data warehouse); Null set; Probability theory; Probability measure; Set (abstract data type); Statistics","retraction":null,"screen_n_in":null,"score":{"opus":0.03344240360397974,"gpt":0.290507433322412,"spread":0.2570650297184322,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004515254,0.000218645,0.0004779815,0.0001364676,0.00005650712,0.00003734213,0.001328682,0.00006338717,0.0000305074],"category_scores_gemma":[0.00005151021,0.0002061256,0.0000743676,0.0006057231,0.0002276616,0.0003042158,0.0006451461,0.0001695103,0.00005360878],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008400428,"about_ca_system_score_gemma":0.00003657602,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006261664,"about_ca_topic_score_gemma":0.00003580577,"domain_scores_codex":[0.998109,0.00002189283,0.0006707437,0.0004308904,0.0004260514,0.0003414222],"domain_scores_gemma":[0.9981168,0.000489012,0.00029037,0.0009780737,0.00005759013,0.0000681759],"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.000005900067,0.0007257557,0.0006144533,0.0004124202,0.000009150212,0.000001729648,0.004261659,0.00548805,0.0003645084,0.7487874,0.00005051685,0.2392785],"study_design_scores_gemma":[0.00052756,0.00003943091,0.0005081795,0.00004814515,0.000005037456,0.00001293943,0.0001544449,0.3532805,0.003651658,0.6312304,0.01022994,0.0003117736],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01361167,0.0003420441,0.972606,0.0003092778,0.00008641916,0.0003503848,0.000003145113,0.0001550494,0.01253601],"genre_scores_gemma":[0.4017339,0.00002210854,0.5979984,0.00016043,0.00003614553,0.00002265623,7.130237e-7,0.00000946776,0.00001609792],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.3881223,"threshold_uncertainty_score":0.840556,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2075961729","doi":"10.1016/j.aam.2010.11.005","title":"Cubature formulae for orthogonal polynomials in terms of elements of finite order of compact simple Lie groups","year":2010,"lang":"en","type":"article","venue":"Advances in Applied Mathematics","topic":"Spectroscopy and Chemometric Analyses","field":"Chemistry","cited_by":41,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Montréal; University of Victoria","funders":"","keywords":"Mathematics; Simple Lie group; Simple (philosophy); Lie theory; Pure mathematics; Representation of a Lie group; Orthogonal polynomials; Lie algebra; Fundamental representation; Combinatorics; Discrete mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.01115430176122614,"gpt":0.3085199891319024,"spread":0.2973656873706763,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001945488,0.0001708151,0.000648448,0.0001824686,0.00001485664,0.00000381173,0.0002845412,0.000139606,0.0002489544],"category_scores_gemma":[0.0002761786,0.0001503439,0.00008565215,0.0004776285,0.0001057308,0.000071607,0.00004295899,0.0001984788,6.988654e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002032026,"about_ca_system_score_gemma":0.00002606811,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004450403,"about_ca_topic_score_gemma":0.00008399429,"domain_scores_codex":[0.9985196,0.000002241228,0.0008698243,0.000168493,0.0002083827,0.0002314643],"domain_scores_gemma":[0.9983025,0.0006362119,0.0006683105,0.0003190166,0.0000418669,0.00003211965],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0002322291,0.001500668,0.03980972,0.005677197,0.0001101819,9.097932e-7,0.0008020299,0.0004913493,0.8698197,0.07789557,0.00005225652,0.003608213],"study_design_scores_gemma":[0.001530758,0.00004156227,0.0002906597,0.00008393942,0.00007004244,9.01618e-7,0.0005310539,0.001142993,0.8702764,0.1253861,0.0004570972,0.0001885445],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9759179,0.000206386,0.006505872,0.00001025608,0.00003337883,0.0002676235,0.0001960872,0.00001258076,0.01684997],"genre_scores_gemma":[0.9570702,0.00007358638,0.04269204,0.0000100628,0.0000269225,0.00002676483,0.00004447379,0.00002004554,0.00003593416],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.0474905,"threshold_uncertainty_score":0.6130844,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2912937725","doi":"10.1016/s0196-8858(03)00041-1","title":"Graph-polynomials","year":2003,"lang":"en","type":"article","venue":"Advances in Applied Mathematics","topic":"Mathematics and Applications","field":"Mathematics","cited_by":34,"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; Tutte polynomial; Spanning tree; Combinatorics; Chromatic polynomial; Graph; Polynomial; Order (exchange); Discrete mathematics; Voltage graph; Line graph; Mathematical analysis","retraction":null,"screen_n_in":null,"score":{"opus":0.03043978165946452,"gpt":0.3267222162246508,"spread":0.2962824345651863,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007549853,0.0002928589,0.0005185683,0.0001691249,0.0001054076,0.00003873932,0.00033635,0.0001124015,0.0002065422],"category_scores_gemma":[0.0005177942,0.0002647353,0.00009278157,0.0005154953,0.0001050435,0.0001070707,0.00004620579,0.0002068711,0.0001298875],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000050328,"about_ca_system_score_gemma":0.00003491024,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":5.177451e-7,"about_ca_topic_score_gemma":0.00001542576,"domain_scores_codex":[0.9980844,0.00002246288,0.0008065657,0.0003381343,0.0003155931,0.0004329015],"domain_scores_gemma":[0.9975705,0.00120892,0.0003181428,0.0007715345,0.00003221642,0.0000986664],"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.000001386326,0.0004048831,0.00005037761,0.0003759229,0.000007878622,0.000001253662,0.0004349927,0.00001872262,0.0004976343,0.9958501,0.001484802,0.0008720329],"study_design_scores_gemma":[0.000463583,0.00001092699,0.000004449636,0.00006346206,0.00002240339,0.00001145121,0.0006751652,0.0001023678,0.003744246,0.9627958,0.03179933,0.000306824],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"methods","genre_scores_codex":[0.01893208,0.0006918068,0.2097897,0.0000771195,0.0001679268,0.001462006,0.0000121668,0.0002891053,0.7685781],"genre_scores_gemma":[0.310154,0.0002476766,0.688479,0.00007345877,0.0000360102,0.0004913111,0.000002774972,0.00007026619,0.0004455402],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7681326,"threshold_uncertainty_score":0.9999805,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2022357851","doi":"10.1016/j.aam.2010.05.001","title":"Recurrent words with constant Abelian complexity","year":2010,"lang":"en","type":"article","venue":"Advances in Applied Mathematics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":32,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Winnipeg","funders":"","keywords":"Mathematics; Abelian group; Constant (computer programming); Pure mathematics; Combinatorics; Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.01327778947053018,"gpt":0.259819825791514,"spread":0.2465420363209838,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003263449,0.000174727,0.0002444078,0.00008002068,0.00006990949,0.00007421972,0.0007677258,0.00004766567,0.00002484536],"category_scores_gemma":[0.00002245549,0.0001309414,0.00002305393,0.0003694687,0.0002398553,0.0002380548,0.0001594932,0.0002956201,0.00004386034],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001958642,"about_ca_system_score_gemma":0.00003481375,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001478187,"about_ca_topic_score_gemma":0.0001188841,"domain_scores_codex":[0.9988545,0.000008145204,0.0002824216,0.000303603,0.0002565056,0.0002948603],"domain_scores_gemma":[0.9988419,0.0002296241,0.0001474293,0.0006872864,0.00002036199,0.00007334867],"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.000005073933,0.0001346843,0.00006723715,0.00006677052,0.000002611137,0.00000623559,0.000610526,0.00001280289,0.000640034,0.950218,0.00001829978,0.04821778],"study_design_scores_gemma":[0.000586358,0.00005627226,0.0001374994,0.0001108068,0.000004794973,0.00003946968,0.0003339402,0.01885854,0.002280028,0.9706246,0.006611752,0.0003559026],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.05625593,0.0003295632,0.8668379,0.0002143183,0.0005392327,0.0005138211,0.000007139243,0.0003914332,0.07491067],"genre_scores_gemma":[0.463559,0.00003739171,0.53624,0.00008458962,0.00002191297,0.00003427222,0.000001487821,0.000009522812,0.00001186737],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.4073031,"threshold_uncertainty_score":0.5339634,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2552556533","doi":"10.1016/j.aam.2017.09.003","title":"Pfaffians and nonintersecting paths in graphs with cycles: Grassmann algebra methods","year":2017,"lang":"en","type":"article","venue":"Advances in Applied Mathematics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":31,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Perimeter Institute","funders":"Agence Nationale de la Recherche; Innovation, Science and Economic Development Canada","keywords":"Mathematics; Exterior algebra; Grassmannian; Algebra over a field; Schubert calculus; Algebraic number; Graph; Generalization; Combinatorics; Pure mathematics; Mathematical analysis","retraction":null,"screen_n_in":null,"score":{"opus":0.02961173959000027,"gpt":0.3745098303551216,"spread":0.3448980907651213,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001328311,0.0005468783,0.001042346,0.0002994488,0.0003090933,0.000169996,0.0008191959,0.0001904944,0.000007863345],"category_scores_gemma":[0.001459855,0.0004721115,0.00007014565,0.0002851973,0.0004241131,0.0005765269,0.0003719228,0.0005933214,0.000006308711],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001312691,"about_ca_system_score_gemma":0.00003944114,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007627753,"about_ca_topic_score_gemma":0.0003147045,"domain_scores_codex":[0.9972396,0.00005925882,0.0009735886,0.0006317734,0.000409463,0.0006863496],"domain_scores_gemma":[0.9950485,0.002332704,0.0009917204,0.001442989,0.0000542746,0.00012983],"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.00004333167,0.0004060502,0.001479966,0.001256549,0.00002551205,0.0000492073,0.004826564,0.00005263841,0.0003712684,0.9716142,0.000006231189,0.01986841],"study_design_scores_gemma":[0.001742068,0.00008550187,0.0001789069,0.000832618,0.00004448128,0.0000463099,0.005756687,0.001306863,0.001791441,0.9875267,0.0001145212,0.0005738917],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"methods","genre_scores_codex":[0.5235347,0.0006545337,0.4097051,0.000126742,0.0005928849,0.002552912,0.000009579526,0.0003916577,0.06243183],"genre_scores_gemma":[0.4385009,0.0001546597,0.5610024,0.00001770121,0.00002922843,0.0001768331,9.371571e-7,0.0000875093,0.00002973649],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.1512973,"threshold_uncertainty_score":0.9997731,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1999202617","doi":"10.1016/j.aam.2009.07.005","title":"Longest increasing subsequences, Plancherel-type measure and the Hecke insertion algorithm","year":2010,"lang":"en","type":"article","venue":"Advances in Applied Mathematics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":31,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of New Brunswick","funders":"","keywords":"Mathematics; Combinatorics; Young tableau; Measure (data warehouse); Hecke algebra; Conjecture; Algebraic number; Symmetric group; Probability measure; Limit (mathematics); Discrete mathematics; Algebra over a field; Pure mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.01829946448890567,"gpt":0.2885864767133121,"spread":0.2702870122244064,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002272921,0.0004559116,0.000779293,0.0001293958,0.0002299233,0.00009910408,0.0005688354,0.0002648772,0.0000231151],"category_scores_gemma":[0.002901099,0.0003291673,0.00006688036,0.000567425,0.0006920216,0.0003348112,0.000192648,0.0009852978,0.00002524047],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007396512,"about_ca_system_score_gemma":0.00006737406,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001004324,"about_ca_topic_score_gemma":0.0001706511,"domain_scores_codex":[0.9974042,0.00008820428,0.0009088227,0.0004469415,0.0006350491,0.000516767],"domain_scores_gemma":[0.9942297,0.004086137,0.0005551886,0.000880909,0.0001266383,0.0001213655],"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.0001232644,0.000236143,0.0001223549,0.0004863035,0.00002156916,0.000009091777,0.00161793,0.00001112546,0.001712432,0.9811043,0.00004486844,0.0145106],"study_design_scores_gemma":[0.002240931,0.00003265205,0.00003750062,0.0002002921,0.00006350679,0.0001242535,0.0008438099,0.002583201,0.001379966,0.9910073,0.001074596,0.0004119456],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"methods","genre_scores_codex":[0.7349023,0.005386042,0.1784777,0.0007878701,0.004682648,0.006773983,0.00003003114,0.00123091,0.06772856],"genre_scores_gemma":[0.4673337,0.0004766668,0.5316169,0.00006033813,0.0002194971,0.0001590121,0.000004842557,0.00008712841,0.00004183062],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.3531393,"threshold_uncertainty_score":0.999916,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2068854468","doi":"10.1016/j.aam.2008.05.002","title":"Some open problems on excluding a uniform matroid","year":2008,"lang":"en","type":"article","venue":"Advances in Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":31,"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":"Matroid; Minor (academic); Mathematics; Combinatorics; Graphic matroid; Discrete mathematics; Humanities","retraction":null,"screen_n_in":null,"score":{"opus":0.0561847561376672,"gpt":0.3320618360736579,"spread":0.2758770799359906,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006226118,0.0002465661,0.0003764955,0.0002633421,0.0002331645,0.0001081368,0.00277738,0.00006256383,0.000008557432],"category_scores_gemma":[0.00008042822,0.0002161371,0.00004462351,0.0008264508,0.0001709724,0.001301575,0.001051822,0.0003360456,0.000188337],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001198762,"about_ca_system_score_gemma":0.00005893838,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001271135,"about_ca_topic_score_gemma":0.000005602288,"domain_scores_codex":[0.9979004,0.00002274115,0.0004634598,0.0005172865,0.000515368,0.0005807502],"domain_scores_gemma":[0.9981386,0.0005101902,0.0001907945,0.001020208,0.00003124153,0.0001089686],"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.00001311527,0.0002060956,0.00003565448,0.0001131861,0.000004182587,0.00002504567,0.001034559,0.002738682,0.0004721657,0.9884694,0.00003326712,0.006854599],"study_design_scores_gemma":[0.0006709375,0.00008979879,0.00001979733,0.0001126423,0.000001254732,0.00004116988,0.0001350283,0.007843089,0.003087651,0.9841984,0.003508618,0.00029162],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01237696,0.00110049,0.8225784,0.0003001549,0.0002570293,0.002695336,0.000004977476,0.0004329742,0.1602536],"genre_scores_gemma":[0.2645686,0.001135059,0.7330245,0.0002496415,0.0000605352,0.0004624323,0.000002358522,0.00004567776,0.0004512546],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.2521916,"threshold_uncertainty_score":0.8813815,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2077155372","doi":"10.1006/aama.2001.0758","title":"A Structured Family of Clustering and Tree Construction Methods","year":2001,"lang":"en","type":"article","venue":"Advances in Applied Mathematics","topic":"Data Mining Algorithms and Applications","field":"Computer Science","cited_by":30,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"","keywords":"Mathematics; Disjoint sets; Cluster analysis; Hierarchical clustering; Cluster (spacecraft); Tree (set theory); Theoretical computer science; Combinatorics; Set (abstract data type); Computer science; Statistics","retraction":null,"screen_n_in":null,"score":{"opus":0.01897293709334736,"gpt":0.3204450755155659,"spread":0.3014721384222185,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001590591,0.00008584201,0.000174333,0.00007251983,0.00003408367,0.00002724078,0.0002761631,0.00003220232,0.000001237766],"category_scores_gemma":[0.00002155553,0.00007905802,0.00001249303,0.0003072824,0.00007725536,0.000190309,0.0001433185,0.0000644154,9.60615e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001098005,"about_ca_system_score_gemma":0.00000979897,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001976626,"about_ca_topic_score_gemma":0.00001421386,"domain_scores_codex":[0.9993341,0.000008224009,0.0002598661,0.0001896795,0.0000932583,0.0001148525],"domain_scores_gemma":[0.9993318,0.0001695987,0.0001319012,0.0003244658,0.00001429185,0.00002790003],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000001159757,0.00001799657,0.00004530171,0.00004670153,0.000002112503,4.550447e-7,0.0003978943,0.0000916756,0.002870544,0.2328793,0.000002306243,0.7636446],"study_design_scores_gemma":[0.000665704,0.00003623508,0.0009408743,0.00008559618,0.00001233737,0.00008845223,0.001275739,0.4352107,0.004533737,0.5508198,0.006039643,0.0002912651],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.004835689,0.0003178061,0.9871022,0.0000227803,0.0000555286,0.0001289827,0.000002518301,0.00004076156,0.007493775],"genre_scores_gemma":[0.0315905,0.0003934532,0.9679439,0.00001883347,0.00001122143,0.00002832425,0.000001372732,0.000005392859,0.000006975999],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.7633533,"threshold_uncertainty_score":0.3223892,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1680081660","doi":"10.1016/j.aam.2012.09.003","title":"A flow approach to the <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.gif\" overflow=\"scroll\"><mml:msub><mml:mrow><mml:mi>L</mml:mi></mml:mrow><mml:mrow><mml:mo>−</mml:mo><mml:mn>2</mml:mn></mml:mrow></mml:msub></mml:math> Minkowski problem","year":2012,"lang":"lv","type":"article","venue":"Advances in Applied Mathematics","topic":"Point processes and geometric inequalities","field":"Mathematics","cited_by":29,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Concordia University","funders":"","keywords":"Uniqueness; Mathematics; Unit sphere; Minkowski space; Unit disk; Norm (philosophy); Planar; Combinatorics; Mathematical analysis; Geometry; Computer science; Computer graphics (images)","retraction":null,"screen_n_in":null,"score":{"opus":0.02373070491946275,"gpt":0.2565127795228791,"spread":0.2327820746034164,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","sts","scholarly_communication","research_integrity","insufficient_payload"],"consensus_categories":["metaepi_narrow","insufficient_payload"],"category_scores_codex":[0.004329561,0.001346629,0.0007073327,0.0008353292,0.001631454,0.001517665,0.003249962,0.002350253,0.1270328],"category_scores_gemma":[0.003219138,0.002162329,0.001609614,0.002519372,0.001519197,0.00189056,0.002705407,0.002182196,0.003124705],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003927592,"about_ca_system_score_gemma":0.001201791,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003935558,"about_ca_topic_score_gemma":0.0006757825,"domain_scores_codex":[0.9874883,0.0003359114,0.003103984,0.001930676,0.003509044,0.003632125],"domain_scores_gemma":[0.988399,0.004007915,0.003032248,0.003122441,0.000242823,0.001195581],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0007381858,0.0009864478,0.000005166218,0.00718415,0.001118224,0.000215915,0.01038589,0.002757615,0.0004643943,0.8098522,0.1619895,0.00430228],"study_design_scores_gemma":[0.002746998,0.001409638,0.00001210394,0.002723218,0.002196515,0.001411732,0.01399451,0.08489823,0.8589545,0.009659455,0.0189436,0.003049528],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.1566908,0.004419218,0.01469426,0.0005930793,0.002351446,0.0002017343,0.0004801248,0.0003799416,0.8201894],"genre_scores_gemma":[0.9235858,0.002546836,0.06332873,0.001686524,0.00253121,0.003771993,0.0006604192,0.001080425,0.0008080359],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.85849,"threshold_uncertainty_score":0.9999285,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2172758441","doi":"10.1016/j.aam.2015.09.015","title":"The logarithmic Minkowski inequality for non-symmetric convex bodies","year":2015,"lang":"en","type":"article","venue":"Advances in Applied Mathematics","topic":"Point processes and geometric inequalities","field":"Mathematics","cited_by":29,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Logarithm; Minkowski space; Regular polygon; Inequality; Minkowski addition; Minkowski's theorem; Minkowski inequality; Pure mathematics; Convex body; Mixed volume; Mathematical analysis; Combinatorics; Rearrangement inequality; Linear inequality; Mathematical physics; Geometry; Convex optimization","retraction":null,"screen_n_in":null,"score":{"opus":0.0756796761499367,"gpt":0.3564699797214048,"spread":0.2807903035714681,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002684862,0.0003220044,0.0006425327,0.0002753707,0.0001997248,0.00009952633,0.0005773018,0.0001345268,0.00000562733],"category_scores_gemma":[0.005626121,0.0002230244,0.0001015597,0.0007938141,0.0002009819,0.0002061957,0.0001605762,0.0002279497,0.00002947279],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001304333,"about_ca_system_score_gemma":0.0001077123,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005562159,"about_ca_topic_score_gemma":0.00007866118,"domain_scores_codex":[0.99753,0.0000253831,0.0009877861,0.0003218547,0.0005203409,0.0006146483],"domain_scores_gemma":[0.9927381,0.005810751,0.0004824838,0.0005958964,0.0002580673,0.0001147419],"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.00005575223,0.000218181,0.00007452048,0.001426271,0.00002440759,0.000001610962,0.002440971,0.00002108619,0.000009196807,0.9834213,0.001698075,0.01060864],"study_design_scores_gemma":[0.001170123,0.00008632267,0.000008648531,0.00006685335,0.00003348447,0.000005664939,0.007074017,0.001739195,0.0007013911,0.956833,0.03196878,0.0003125009],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04023978,0.01038869,0.7197713,0.001122029,0.001780739,0.005945827,0.0001565495,0.0005201052,0.220075],"genre_scores_gemma":[0.6911279,0.0009035153,0.3045142,0.0002093109,0.0002929216,0.001282232,0.00001720756,0.00009480666,0.00155796],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6508881,"threshold_uncertainty_score":0.9094672,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2962838217","doi":"10.1016/j.aam.2016.06.007","title":"Affine isoperimetric inequalities in the functional Orlicz–Brunn–Minkowski theory","year":2016,"lang":"en","type":"article","venue":"Advances in Applied Mathematics","topic":"Point processes and geometric inequalities","field":"Mathematics","cited_by":29,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Memorial University of Newfoundland","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Isoperimetric inequality; Mathematics; Affine transformation; Pure mathematics; Type (biology); Regular polygon; Inequality; Mathematical analysis; Geometry","retraction":null,"screen_n_in":null,"score":{"opus":0.05478600815400669,"gpt":0.3126195291504167,"spread":0.25783352099641,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002835904,0.0003468507,0.0005506768,0.0006914306,0.00009432193,0.00005269988,0.0005919776,0.0001288849,0.0003918955],"category_scores_gemma":[0.002734758,0.0001881889,0.00008805305,0.001808836,0.0001929724,0.0003438921,0.000132124,0.0002567643,0.00009353925],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001173762,"about_ca_system_score_gemma":0.00006141722,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004445616,"about_ca_topic_score_gemma":0.00005752398,"domain_scores_codex":[0.9973478,0.00009503001,0.0009818303,0.0003540654,0.0006636625,0.0005575796],"domain_scores_gemma":[0.9890174,0.009942289,0.0003167166,0.0006121294,0.00006568225,0.00004577105],"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.00004716737,0.0003615122,0.0001782678,0.0005358807,0.00001124707,0.000005710291,0.002615001,0.00001032601,0.00009898638,0.9797893,0.0002903721,0.01605625],"study_design_scores_gemma":[0.001030487,0.00005187694,0.0001557735,0.0001849569,0.00001873015,0.00001799317,0.007602833,0.00002235817,0.0008547193,0.9806272,0.009105081,0.0003279607],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.2194014,0.008540643,0.3497631,0.001538362,0.0007947875,0.002527818,0.0001049271,0.0004528154,0.4168761],"genre_scores_gemma":[0.9674458,0.0007658366,0.02839369,0.0003426268,0.0002262745,0.0004049967,0.000006291594,0.00005826215,0.002356259],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7480444,"threshold_uncertainty_score":0.767412,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1967459533","doi":"10.1016/j.aam.2013.02.001","title":"Inequivalent representations of matroids over prime fields","year":2013,"lang":"en","type":"article","venue":"Advances in Applied Mathematics","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":27,"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":"Matroid; Mathematics; Mersenne prime; Combinatorics; Prime power; Prime (order theory); Integer (computer science); Discrete mathematics; Field (mathematics); Pure mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.02348674236484033,"gpt":0.3109929580723672,"spread":0.2875062157075268,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001304193,0.00008109445,0.0001528821,0.00007185401,0.00003781584,0.00003183116,0.0006077314,0.00002953218,0.00007922509],"category_scores_gemma":[0.00004569464,0.00007342323,0.00002636766,0.0003317461,0.00004553913,0.0002963418,0.0002873695,0.00009946228,0.00003417182],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002190216,"about_ca_system_score_gemma":0.00001703267,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002560283,"about_ca_topic_score_gemma":0.00001345572,"domain_scores_codex":[0.9992429,0.00001529919,0.0003311165,0.0001405075,0.0001452217,0.0001249396],"domain_scores_gemma":[0.998842,0.0002868388,0.0001299464,0.0006700143,0.00004276591,0.00002844017],"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":[7.494526e-7,0.0001234354,0.0003569854,0.0000523765,0.000004160094,2.528581e-7,0.001297943,0.0005351997,0.002595218,0.9468743,0.0002009634,0.04795839],"study_design_scores_gemma":[0.001306065,0.00008580733,0.006942831,0.0002631286,0.00001151633,0.000006318587,0.000604392,0.258859,0.02621906,0.698568,0.006504421,0.0006294514],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01933895,0.0007250099,0.9150313,0.0003108068,0.00008696739,0.0004370074,5.105579e-7,0.00006919306,0.06400031],"genre_scores_gemma":[0.7361722,0.0006108847,0.2629529,0.00007680798,0.00001057937,0.00008230776,0.000001010677,0.000004627179,0.00008867198],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7168332,"threshold_uncertainty_score":0.2994113,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2104469817","doi":"10.1016/s0196-8858(03)00021-6","title":"The Alexander polynomial of planar even valence graphs","year":2003,"lang":"en","type":"article","venue":"Advances in Applied Mathematics","topic":"Geometric and Algebraic Topology","field":"Mathematics","cited_by":26,"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; Combinatorics; Planar graph; Tutte polynomial; Spanning tree; Congruence relation; Book embedding; Knot polynomial; HOMFLY polynomial; Bracket polynomial; Knot (papermaking); Discrete mathematics; Jones polynomial; Polynomial; Graph; 1-planar graph; Knot theory; Matrix polynomial; Chordal graph; Knot invariant; Alternating polynomial; Square-free polynomial; Line graph; Voltage graph","retraction":null,"screen_n_in":null,"score":{"opus":0.01883455432085998,"gpt":0.2886096301471338,"spread":0.2697750758262737,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006887657,0.0001848617,0.0003808964,0.0001355651,0.0001015874,0.000009465349,0.0003650478,0.00009524071,0.00006629193],"category_scores_gemma":[0.0008243485,0.0001288492,0.00007003784,0.0005245212,0.000287764,0.0000576738,0.0000343671,0.0001870223,0.0000161272],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000248513,"about_ca_system_score_gemma":0.00003874535,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001499549,"about_ca_topic_score_gemma":0.0000231559,"domain_scores_codex":[0.9985173,0.00003432221,0.0006087667,0.0002013054,0.0002772406,0.0003610942],"domain_scores_gemma":[0.9963716,0.002756569,0.0003293643,0.0004679006,0.0000271895,0.000047359],"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.00001000098,0.0001408416,0.0003635219,0.0001804225,0.00001459966,0.000002025969,0.0004121274,0.00001015778,0.00009353455,0.9960704,0.0005999176,0.002102481],"study_design_scores_gemma":[0.0005035931,0.00003156453,0.00005263382,0.00003422282,0.00002105615,0.000017295,0.0013822,0.00002113572,0.001743466,0.9864461,0.009589861,0.0001568082],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.2752546,0.01265933,0.1391304,0.0004103069,0.001628095,0.003090885,0.000047552,0.0003022853,0.5674765],"genre_scores_gemma":[0.8667828,0.0008377112,0.1315471,0.00004475272,0.00002693366,0.00007684197,0.000001400939,0.00003451509,0.0006479464],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5915282,"threshold_uncertainty_score":0.5254319,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2053608071","doi":"10.1006/aama.2001.0771","title":"The Specification of 2-trees","year":2002,"lang":"en","type":"article","venue":"Advances in Applied Mathematics","topic":"Analytical Chemistry and Chromatography","field":"Chemistry","cited_by":26,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Montréal; Université du Québec à Montréal","funders":"","keywords":"Mathematics; Combinatorics; Tree (set theory); Applied mathematics; Discrete mathematics; Pure mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.01249551550776569,"gpt":0.2349535312782682,"spread":0.2224580157705025,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009726372,0.00008887418,0.0001322603,0.00001768828,0.00004645257,0.000008704536,0.0002288977,0.00005451537,0.0002689129],"category_scores_gemma":[0.00004613636,0.00006402857,0.00004470898,0.0001762136,0.0001841477,0.00003143757,0.00002367377,0.0001069774,0.00002024924],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001288591,"about_ca_system_score_gemma":0.000001885211,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":1.491697e-7,"about_ca_topic_score_gemma":0.000004849274,"domain_scores_codex":[0.9992327,0.00000109693,0.0003343585,0.0001088462,0.0001742216,0.0001487923],"domain_scores_gemma":[0.9990706,0.0004275453,0.0001444697,0.0003157927,0.00001464378,0.00002697585],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.00002923588,0.0008014892,0.002576485,0.001580972,0.00004075406,0.000004260151,0.0009716841,0.0001103664,0.105701,0.8420246,0.0004391485,0.04571992],"study_design_scores_gemma":[0.0006131038,0.000009675701,0.0001121477,0.000163615,0.00003730728,0.000007087456,0.004332691,0.003533833,0.7053235,0.2277045,0.05779248,0.0003700456],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.03777516,0.002294026,0.003361013,0.00004403366,0.00001888436,0.00005755581,0.00000355954,0.00004514918,0.9564006],"genre_scores_gemma":[0.99216,0.001004459,0.006398867,0.000006298667,0.00003441269,0.00001393219,0.000001939584,0.000009589138,0.0003705568],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9560301,"threshold_uncertainty_score":0.2944407,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1969240432","doi":"10.1016/s0196-8858(02)00507-9","title":"The lace expansion on a tree with application to networks of self-avoiding walks","year":2003,"lang":"en","type":"article","venue":"Advances in Applied Mathematics","topic":"Stochastic processes and statistical mechanics","field":"Mathematics","cited_by":25,"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","funders":"","keywords":"Mathematics; Lattice (music); Tree (set theory); Combinatorics; Gaussian; Percolation (cognitive psychology); Discrete mathematics; Statistical physics","retraction":null,"screen_n_in":null,"score":{"opus":0.01159207031076444,"gpt":0.2846844388829838,"spread":0.2730923685722194,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006397569,0.0002082554,0.0003355735,0.00005506357,0.0001426396,0.00002013971,0.000244483,0.00007244976,0.000002953089],"category_scores_gemma":[0.0008114306,0.0001339831,0.0000270086,0.0004306667,0.00003942025,0.00003853561,0.00003507616,0.0002204468,0.000008841917],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006003147,"about_ca_system_score_gemma":0.00002980797,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":3.958082e-7,"about_ca_topic_score_gemma":0.00003334864,"domain_scores_codex":[0.9985659,0.00002380594,0.0004817141,0.0002600362,0.0003536925,0.0003148493],"domain_scores_gemma":[0.995367,0.003775042,0.0002539923,0.0004723183,0.00005855068,0.00007308602],"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.0000545667,0.0002022795,0.00000333516,0.0002509735,0.000008475547,0.000001017074,0.0005362846,0.001617514,0.0001735334,0.9841309,0.00002312038,0.01299796],"study_design_scores_gemma":[0.0004885466,0.0002012,0.00000305254,0.0002226018,0.00003732028,0.000005613107,0.001469936,0.02842642,0.002352393,0.9653768,0.001194461,0.0002216656],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002700678,0.0001403019,0.9831176,0.00003298771,0.00004917102,0.0008478337,0.000002268875,0.00006212731,0.01304699],"genre_scores_gemma":[0.6026996,0.00008725801,0.3968114,0.00004210983,0.00001611333,0.000288522,7.52331e-7,0.00003362839,0.00002054925],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.599999,"threshold_uncertainty_score":0.5463673,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1994224388","doi":"10.1016/j.aam.2006.04.003","title":"Exact Euler–Maclaurin formulas for simple lattice polytopes","year":2007,"lang":"en","type":"article","venue":"Advances in Applied Mathematics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":23,"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; Polytope; Euler's formula; Combinatorics; Exponential function; Lattice (music); Generating function; Mathematical analysis","retraction":null,"screen_n_in":null,"score":{"opus":0.02912029830388322,"gpt":0.3487351982352748,"spread":0.3196148999313915,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001785013,0.0006001499,0.001005831,0.0003032046,0.0001897347,0.0000568271,0.0007309961,0.0002631701,0.00004670332],"category_scores_gemma":[0.002396447,0.0005711135,0.0001881302,0.0006135328,0.0001456228,0.0004141651,0.0002026164,0.0003868264,0.00005219977],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002743698,"about_ca_system_score_gemma":0.0000526943,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001519321,"about_ca_topic_score_gemma":0.0000763018,"domain_scores_codex":[0.9960493,0.00001705721,0.001569882,0.0005830433,0.0006288324,0.001151823],"domain_scores_gemma":[0.988709,0.009217837,0.0007217265,0.001025833,0.0001260173,0.0001995878],"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.00009658225,0.00063722,0.00004032585,0.001756212,0.00002577539,0.000009144323,0.001095454,0.00005248925,0.0009463894,0.9861106,0.0002058766,0.009023925],"study_design_scores_gemma":[0.001889665,0.0001005329,0.000009948038,0.0001587727,0.00006649363,0.00001574536,0.001276391,0.0008197932,0.0169073,0.9606431,0.01746879,0.0006434705],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.03819732,0.0004875834,0.9081812,0.00005494986,0.0006982256,0.002883595,0.00002928358,0.0005167664,0.04895109],"genre_scores_gemma":[0.2697263,0.00008795897,0.7290719,0.00008231832,0.0002776073,0.0003221119,0.00001278729,0.0001876349,0.0002314109],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.231529,"threshold_uncertainty_score":0.999674,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2051669952","doi":"10.1016/j.aam.2011.09.002","title":"Eigenvectors for a random walk on a left-regular band","year":2011,"lang":"en","type":"article","venue":"Advances in Applied Mathematics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":23,"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; Random walk; Hyperplane; Combinatorics; Eigenvalues and eigenvectors; Mathematical proof; Discrete mathematics; Pure mathematics; Geometry","retraction":null,"screen_n_in":null,"score":{"opus":0.04471569936793778,"gpt":0.3068397875395891,"spread":0.2621240881716513,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008280693,0.0005918861,0.001080521,0.0002654285,0.0001447702,0.00002955165,0.0006548663,0.0002259037,0.0001227245],"category_scores_gemma":[0.001327355,0.0005222954,0.0002116163,0.0003257107,0.0001678685,0.0002169297,0.00008639078,0.0003174397,0.00006649857],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001674204,"about_ca_system_score_gemma":0.00005406735,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":8.478772e-7,"about_ca_topic_score_gemma":0.00001793808,"domain_scores_codex":[0.9969561,0.0000314374,0.001152785,0.0005859511,0.0005257925,0.0007479292],"domain_scores_gemma":[0.9951074,0.00300927,0.0005732687,0.001071842,0.0000865024,0.0001517632],"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.000310427,0.001003673,0.00001922539,0.001209505,0.000038184,0.000007164751,0.004591528,0.00003365756,0.0004409123,0.990611,0.0001602898,0.001574408],"study_design_scores_gemma":[0.004012043,0.0002011201,0.000004379283,0.0002505732,0.00007939627,0.00001119949,0.0008760992,0.000438292,0.02510468,0.9650819,0.003361896,0.000578415],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.06835142,0.0005724363,0.6972597,0.00005584854,0.001671487,0.008463901,0.00005339369,0.0009313814,0.2226404],"genre_scores_gemma":[0.3600118,0.00009047844,0.6382192,0.00007683138,0.0001377771,0.0008593862,0.000006952672,0.0002096854,0.0003879667],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.2916603,"threshold_uncertainty_score":0.9997228,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2021000796","doi":"10.1016/s0196-8858(02)00506-7","title":"Multiplicative principal-minor inequalities for totally nonnegative matrices","year":2003,"lang":"en","type":"article","venue":"Advances in Applied Mathematics","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Regina","funders":"National Science Foundation","keywords":"Mathematics; Multiplicative function; Minor (academic); Combinatorics; Nonnegative matrix; Matrix (chemical analysis); Pure mathematics; Symmetric matrix; Mathematical analysis; Eigenvalues and eigenvectors; Humanities","retraction":null,"screen_n_in":null,"score":{"opus":0.0172206554813567,"gpt":0.2849951569266734,"spread":0.2677745014453167,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006558232,0.0002237512,0.0003281948,0.0001092221,0.000109768,0.0000688503,0.0006565485,0.0000633185,0.00001035791],"category_scores_gemma":[0.0002810964,0.000194977,0.00006002191,0.0003866357,0.00008754328,0.0004011308,0.0001092763,0.0001157966,0.00002996144],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004760137,"about_ca_system_score_gemma":0.00004368358,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":5.932741e-7,"about_ca_topic_score_gemma":0.000004842439,"domain_scores_codex":[0.9985633,0.00003318128,0.0004597718,0.0003933131,0.0001953983,0.0003550177],"domain_scores_gemma":[0.9975597,0.001544792,0.0002767016,0.0004988432,0.0000572039,0.00006273443],"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.000006816299,0.0001365018,0.000009493282,0.0002606968,0.00000696072,0.000001267389,0.003826416,0.0003882038,0.0001132694,0.9877561,0.000007358484,0.007486909],"study_design_scores_gemma":[0.0007006545,0.00005655636,0.000006386018,0.00005284386,0.000006700103,0.000005769851,0.001658802,0.01599931,0.01198928,0.9613975,0.00780049,0.0003256939],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002540415,0.0004946272,0.9476807,0.00003549033,0.0001313397,0.0008840877,0.00001161311,0.0001214943,0.04810026],"genre_scores_gemma":[0.2178211,0.00008275996,0.7811361,0.00007246851,0.00003139737,0.0005451367,0.000002034921,0.0000164454,0.0002925583],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.2152807,"threshold_uncertainty_score":0.7950929,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2157575511","doi":"10.1016/s0196-8858(02)00534-1","title":"Haruspicy and anisotropic generating functions","year":2003,"lang":"en","type":"article","venue":"Advances in Applied Mathematics","topic":"Mathematical functions and polynomials","field":"Mathematics","cited_by":21,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"York University","funders":"","keywords":"Mathematics; Multiplicative function; Computation; Anisotropy; Rational function; Product (mathematics); Pure mathematics; Applied mathematics; Mathematical analysis; Algorithm; Geometry","retraction":null,"screen_n_in":null,"score":{"opus":0.02704561902087376,"gpt":0.29914970810272,"spread":0.2721040890818462,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000447675,0.0002399701,0.0004192473,0.000117771,0.0001693293,0.0000542209,0.0001055176,0.0000988763,0.0002683164],"category_scores_gemma":[0.0007794743,0.0002087467,0.00004756089,0.0002711755,0.00009009895,0.0001375865,0.00004229749,0.0001921696,0.00006627671],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004205135,"about_ca_system_score_gemma":0.00002676223,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":8.713266e-7,"about_ca_topic_score_gemma":0.00001718379,"domain_scores_codex":[0.9985456,0.00003008533,0.0006070662,0.0002891772,0.0001927767,0.000335334],"domain_scores_gemma":[0.9981766,0.001140803,0.0001692527,0.0003943974,0.00002458594,0.00009440466],"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.000002703421,0.000176262,0.0001115278,0.0003525446,0.000008812056,0.000001712088,0.0003629396,0.00002369753,0.0008280899,0.9946195,0.0003295243,0.003182709],"study_design_scores_gemma":[0.0005806553,0.0000364364,0.00001179429,0.00007871804,0.00004094307,0.00003283026,0.001080203,0.0008002658,0.001161941,0.9677629,0.02809679,0.0003164747],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"methods","genre_scores_codex":[0.1854407,0.002026908,0.4040018,0.00009623479,0.0004960583,0.001342031,0.00001592583,0.0003209565,0.4062594],"genre_scores_gemma":[0.1849141,0.0002873157,0.812658,0.0001005341,0.00008655968,0.0002169538,0.000002707176,0.00005632202,0.001677579],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.4086561,"threshold_uncertainty_score":0.8512442,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1976341314","doi":"10.1006/aama.1999.0661","title":"The Strong Independence Theorem for Automorphism Groups and Congruence Lattices of Arbitrary Lattices","year":2000,"lang":"en","type":"article","venue":"Advances in Applied Mathematics","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Manitoba","funders":"","keywords":"Mathematics; Automorphism; Lattice (music); Algebraic number; Congruence (geometry); Independence (probability theory); Pure mathematics; Combinatorics; Automorphism group; Discrete mathematics; Algebra over a field; Mathematical analysis; Geometry","retraction":null,"screen_n_in":null,"score":{"opus":0.01191591219387377,"gpt":0.2628571735438551,"spread":0.2509412613499813,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000500269,0.0001793313,0.0002726715,0.00004315039,0.0001723504,0.00007258054,0.0008863863,0.00006519749,0.000008295067],"category_scores_gemma":[0.00005891829,0.0001242017,0.00004144697,0.000228428,0.0003564149,0.0005750202,0.0001106766,0.0001662873,0.0000047049],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001469798,"about_ca_system_score_gemma":0.00002983847,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001153968,"about_ca_topic_score_gemma":0.00002008059,"domain_scores_codex":[0.998651,0.00001775165,0.0004192996,0.0003233861,0.0002663541,0.0003222502],"domain_scores_gemma":[0.9973764,0.001837736,0.0002415597,0.0004631156,0.00003127917,0.00004991658],"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.00001570192,0.00004414621,0.00007447177,0.0001215405,0.000006182434,0.000001589456,0.0006584718,0.0003333111,0.00008423891,0.9156892,0.000001721949,0.08296941],"study_design_scores_gemma":[0.0003745268,0.00007287657,0.0002208584,0.00006912009,0.000009720753,0.000009972646,0.0003963876,0.02471851,0.0008591655,0.9717832,0.001303608,0.0001820298],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1507138,0.01019435,0.7988009,0.0003561873,0.0002557544,0.001666948,0.00001509613,0.0002389234,0.03775805],"genre_scores_gemma":[0.7471268,0.001027374,0.2515968,0.0000761656,0.00001998131,0.0000917712,7.222965e-7,0.00001037612,0.0000499464],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.596413,"threshold_uncertainty_score":0.5064797,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4205454290","doi":"10.1016/j.aam.2005.12.001","title":"Reflection groups and polytopes over finite fields, II","year":2006,"lang":"en","type":"article","venue":"Advances in Applied Mathematics","topic":"Supramolecular Self-Assembly in Materials","field":"Materials Science","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 New Brunswick","funders":"","keywords":"Mathematics; Polytope; Reflection (computer programming); Pure mathematics; Combinatorics; Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.007526119342805718,"gpt":0.2609374353880919,"spread":0.2534113160452862,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003637592,0.0001866191,0.0002800274,0.00008854281,0.0001225582,0.00008597865,0.0001752351,0.0001073106,0.0001271859],"category_scores_gemma":[0.00006942907,0.0001724577,0.00002307594,0.0001635316,0.00007428359,0.0002207975,0.0001376495,0.00008411527,0.00005018287],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003920908,"about_ca_system_score_gemma":0.00001196361,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002338778,"about_ca_topic_score_gemma":0.00009753949,"domain_scores_codex":[0.9987351,0.00002271461,0.0004210806,0.0003031285,0.000229484,0.0002884669],"domain_scores_gemma":[0.9992251,0.000260155,0.0001709541,0.0002959442,0.00001576706,0.00003202273],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.00002903339,0.0001751219,0.0002294243,0.000246105,0.000002630584,0.000008980833,0.0004601295,0.0006128027,0.843907,0.153264,0.0001385354,0.0009262454],"study_design_scores_gemma":[0.0007334563,0.00007628599,0.0004121142,0.00008788674,0.00002257189,0.00001964378,0.0002406257,0.0005173178,0.5683157,0.4244049,0.004731778,0.0004376292],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9648486,0.000581527,0.0180196,0.00004155246,0.0003488128,0.0003125999,0.000006282784,0.0001326686,0.01570836],"genre_scores_gemma":[0.9207399,0.0001179399,0.07873105,0.0001116056,0.0001138145,0.00007343941,0.000005658097,0.00002578208,0.00008074359],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2755913,"threshold_uncertainty_score":0.7032622,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1988228156","doi":"10.1016/j.aam.2004.06.003","title":"Markov's transformation of series and the WZ method","year":2004,"lang":"en","type":"article","venue":"Advances in Applied Mathematics","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Memoir; Markov chain; Mathematics; Transformation (genetics); Context (archaeology); Series (stratigraphy); Markov process; Convergence (economics); Acceleration; Markov model; Mathematical economics; Applied mathematics; Algorithm; Statistics; Art history; History","retraction":null,"screen_n_in":null,"score":{"opus":0.005931039444430894,"gpt":0.2574354021965067,"spread":0.2515043627520758,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007326022,0.00007897963,0.0001759516,0.00003981764,0.00004362133,0.0000225554,0.0002903224,0.00002466979,0.000002068527],"category_scores_gemma":[0.00002259854,0.00005096593,0.00002194888,0.0001961786,0.0001214409,0.0003482031,0.00004977693,0.00006872164,0.000001928747],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000008420473,"about_ca_system_score_gemma":0.00001145522,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":7.313133e-7,"about_ca_topic_score_gemma":0.000002640322,"domain_scores_codex":[0.999402,0.00001988527,0.0002547716,0.00009879375,0.0001242789,0.0001002788],"domain_scores_gemma":[0.9993579,0.0002921621,0.0001033328,0.0002199245,0.00001092307,0.00001569959],"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.00001517878,0.00002155209,3.478343e-7,0.0001572672,0.000002096084,3.365967e-7,0.004112577,0.000634822,0.00006666306,0.9555131,3.204563e-7,0.03947575],"study_design_scores_gemma":[0.000831709,0.00001546096,0.000002493857,0.00003219601,0.000004136246,0.00001555327,0.000533965,0.00546355,0.008686088,0.9839314,0.0004189792,0.00006441941],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0005758447,0.0003697761,0.9761351,0.0003078828,0.00004021099,0.0002263769,9.209119e-7,0.00002689028,0.02231699],"genre_scores_gemma":[0.1122206,0.0003449391,0.8873255,0.00004492826,0.000008907149,0.00003069521,3.397537e-7,0.000003859927,0.00002021301],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.1116447,"threshold_uncertainty_score":0.2078331,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2029396671","doi":"10.1016/j.aam.2012.05.003","title":"Congruences arising from Apéry-type series for zeta values","year":2012,"lang":"en","type":"article","venue":"Advances in Applied Mathematics","topic":"Advanced Mathematical Identities","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":"Dalhousie University","funders":"Abdus Salam International Centre for Theoretical Physics","keywords":"Mathematics; Congruence relation; Series (stratigraphy); Type (biology); Conjecture; Truncation (statistics); Binomial coefficient; Combinatorics; Pure mathematics; Statistics","retraction":null,"screen_n_in":null,"score":{"opus":0.04878537635750659,"gpt":0.3576987221949742,"spread":0.3089133458374677,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007483091,0.000468478,0.0009072155,0.000147091,0.0001875996,0.00009073052,0.0004976894,0.0001852015,0.0001125883],"category_scores_gemma":[0.001957582,0.0004204985,0.0001202821,0.0003376471,0.0003374436,0.001224596,0.0001305149,0.0002582155,0.00008217622],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000117071,"about_ca_system_score_gemma":0.00003596348,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004158325,"about_ca_topic_score_gemma":0.00005071432,"domain_scores_codex":[0.9971905,0.0000269246,0.001031804,0.000398346,0.0004932521,0.0008592019],"domain_scores_gemma":[0.9941416,0.004434951,0.0004935132,0.0006678999,0.0001023226,0.0001596637],"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.00004271138,0.0004159641,0.0003564657,0.001224484,0.00004091087,0.000001543687,0.003890574,0.00003562686,0.00142152,0.9910184,0.0004196627,0.001132151],"study_design_scores_gemma":[0.000503156,0.00004144141,0.00001858695,0.0002674757,0.0001007326,0.000006126288,0.006381783,0.0002343064,0.01329557,0.9747956,0.003854431,0.0005007489],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.1913745,0.01161879,0.6624359,0.0002734891,0.003369056,0.005622495,0.0001995588,0.001437591,0.1236686],"genre_scores_gemma":[0.2191477,0.0003865441,0.7786769,0.00005280223,0.0003484777,0.0002998663,0.00002149519,0.0001143017,0.0009520193],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.1227166,"threshold_uncertainty_score":0.9998247,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2013194786","doi":"10.1016/j.aam.2010.09.001","title":"Counting unicellular maps on non-orientable surfaces","year":2010,"lang":"en","type":"article","venue":"Advances in Applied Mathematics","topic":"Stochastic processes and statistical mechanics","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":"Simon Fraser University","funders":"","keywords":"Bijection; Mathematics; Embedding; Combinatorics; Graph; Complement (music); Topology (electrical circuits); Polyomino; Infinity; Surface (topology); Discrete mathematics; Computer science; Geometry; Biology; Mathematical analysis","retraction":null,"screen_n_in":null,"score":{"opus":0.01495369615490148,"gpt":0.2972277372576925,"spread":0.282274041102791,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005968933,0.0003004739,0.0004764133,0.00009733458,0.0001205591,0.00005402957,0.0003983566,0.0001497594,0.00009788314],"category_scores_gemma":[0.001057705,0.0002640878,0.00004459213,0.0003434883,0.00008835608,0.0001172044,0.00009892908,0.0005585838,0.0001294483],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003791682,"about_ca_system_score_gemma":0.0000401649,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002086438,"about_ca_topic_score_gemma":0.00005137562,"domain_scores_codex":[0.9980475,0.000006362898,0.0005966515,0.0003783233,0.0004736797,0.0004975307],"domain_scores_gemma":[0.996866,0.002171278,0.0002616119,0.0005408685,0.00005805172,0.0001021564],"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.00001742456,0.0002971033,0.00001350915,0.0006219664,0.000006706297,0.000008882689,0.0003671849,0.00007792836,0.002752936,0.9925094,0.0001170394,0.003209876],"study_design_scores_gemma":[0.0005280338,0.00004449299,0.00000320448,0.0001388223,0.00002542715,0.000007012661,0.0006222446,0.01245234,0.005315035,0.9769745,0.003564384,0.0003244454],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07917935,0.0001679798,0.7795414,0.00006694749,0.001068721,0.001118581,0.00005489136,0.0002451184,0.138557],"genre_scores_gemma":[0.5061474,0.00004559817,0.4933053,0.00006963087,0.00008061745,0.00009054258,0.000007656201,0.00005970056,0.0001935217],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.4269681,"threshold_uncertainty_score":0.9999811,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2061773557","doi":"10.1016/j.aam.2007.04.003","title":"Blow-up in nonlinear heat equations","year":2007,"lang":"en","type":"article","venue":"Advances in Applied Mathematics","topic":"Advanced Mathematical Physics Problems","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; Remainder; Nonlinear system; Maxima; Dimension (graph theory); Heat equation; Mathematical analysis; Point (geometry); Applied mathematics; Pure mathematics; Geometry","retraction":null,"screen_n_in":null,"score":{"opus":0.03330567724861253,"gpt":0.3512585302152535,"spread":0.317952852966641,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001558297,0.0004356115,0.0008192994,0.0003569724,0.00008012148,0.00002939155,0.0004909965,0.0001815118,0.00008931174],"category_scores_gemma":[0.001152315,0.0004201095,0.0001030113,0.00104106,0.0001857412,0.0003560726,0.0001701375,0.0005681908,0.000148166],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002523317,"about_ca_system_score_gemma":0.00004608597,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000280213,"about_ca_topic_score_gemma":0.0003052336,"domain_scores_codex":[0.9965089,0.00001912759,0.001504398,0.0005035718,0.0005967467,0.000867277],"domain_scores_gemma":[0.9938654,0.004871331,0.0002441266,0.0008133356,0.00006037739,0.0001453734],"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.00002483766,0.0008934776,0.00004445728,0.0007696591,0.000008112826,0.00001439239,0.001785909,0.0005317246,0.001527335,0.9888015,0.00002872449,0.005569802],"study_design_scores_gemma":[0.00115139,0.00002382465,0.000007538142,0.0002496046,0.00001904711,0.000005822746,0.001145965,0.006550577,0.005035229,0.9845135,0.0008435652,0.0004539781],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.03637676,0.0003269507,0.8696593,0.0001006454,0.0002548924,0.001670993,0.00001123827,0.0003028442,0.09129636],"genre_scores_gemma":[0.3111767,0.0000766123,0.6880835,0.00009937256,0.00009307517,0.0001597681,0.000008926982,0.0001096273,0.0001923353],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.2748,"threshold_uncertainty_score":0.9998251,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1981946205","doi":"10.1006/aama.2001.0736","title":"Random Partitions with Non-negative rth Differences","year":2001,"lang":"en","type":"article","venue":"Advances in Applied Mathematics","topic":"Advanced Mathematical Identities","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":"Université du Québec à Montréal","funders":"","keywords":"Mathematics; Combinatorics; Partition (number theory); Bijection; Omega; Integer (computer science); Discrete mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.02686189053724694,"gpt":0.3081751111392917,"spread":0.2813132206020448,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003411939,0.000459922,0.0009026787,0.0001984023,0.0001752175,0.000074439,0.000427489,0.0001111099,0.0002182471],"category_scores_gemma":[0.0005940698,0.0003455134,0.0000869802,0.0006403672,0.0004442174,0.0004733254,0.0001106775,0.0003452057,0.0001156691],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009475052,"about_ca_system_score_gemma":0.00004180071,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003134824,"about_ca_topic_score_gemma":0.0002571754,"domain_scores_codex":[0.9974639,0.00002672577,0.0008335759,0.0004522666,0.0005939665,0.000629594],"domain_scores_gemma":[0.9954203,0.003308752,0.0004057849,0.0006463646,0.00008207683,0.0001366757],"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.0001884482,0.001138276,0.0008743321,0.00111797,0.00006217423,0.00006195004,0.003869387,0.0004752126,0.0001694926,0.9904764,0.0001840181,0.001382311],"study_design_scores_gemma":[0.002254668,0.00007602043,0.00008302824,0.0004337168,0.00007099306,0.00003932862,0.00414789,0.0008027066,0.001013749,0.9902208,0.0003819008,0.0004752407],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1139836,0.000249198,0.605055,0.0001243419,0.0001260837,0.001888664,0.00001776372,0.0004019642,0.2781534],"genre_scores_gemma":[0.5862098,0.0004748811,0.4111613,0.00004099336,0.00006809417,0.0006864842,0.000003846297,0.00007693792,0.001277632],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.4722262,"threshold_uncertainty_score":0.9998997,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1718672927","doi":"10.1016/j.aam.2015.09.018","title":"Two operators on sandpile configurations, the sandpile model on the complete bipartite graph, and a Cyclic Lemma","year":2015,"lang":"en","type":"article","venue":"Advances in Applied Mathematics","topic":"Theoretical and Computational Physics","field":"Physics and Astronomy","cited_by":15,"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":"Agence Nationale de la Recherche","keywords":"Abelian sandpile model; Polyomino; Lemma (botany); Bijection; Mathematics; Combinatorics; Bipartite graph; Complete bipartite graph; Discrete mathematics; Equivalence (formal languages); Graph; Regular polygon; Geometry","retraction":null,"screen_n_in":null,"score":{"opus":0.02515159122030653,"gpt":0.2735925001591178,"spread":0.2484409089388113,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001799357,0.0001518514,0.0001648872,0.00002282841,0.0001553108,0.00006072697,0.0001777755,0.00001476579,0.00002070758],"category_scores_gemma":[0.000009966595,0.00008372138,0.00003440481,0.0001415576,0.0002017381,0.00005670006,0.00004295857,0.0001707994,0.00004892474],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001008067,"about_ca_system_score_gemma":0.00002281588,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002624896,"about_ca_topic_score_gemma":0.000001977166,"domain_scores_codex":[0.9992285,0.00002476947,0.0002195427,0.0001636573,0.0002015152,0.0001619853],"domain_scores_gemma":[0.9990053,0.0005994947,0.00008206863,0.0002324783,0.00002593674,0.00005472847],"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.00001748985,0.0001074465,0.00003676564,0.000006006997,0.000008661759,1.123876e-7,0.0005190646,0.04238705,0.00007980378,0.9548088,0.0001810372,0.001847731],"study_design_scores_gemma":[0.0004321507,0.00003166836,0.00001182055,0.00002503528,0.000009855199,2.514659e-7,0.0008648582,0.05710628,0.0005017557,0.9397653,0.001136901,0.0001141191],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5196112,0.0002241499,0.1537988,0.001695514,0.0001524344,0.001490758,0.00016106,0.00007666601,0.3227894],"genre_scores_gemma":[0.9966769,0.000006488626,0.00260329,0.0004261176,0.00008307907,0.0001474504,0.00001548363,0.00001407711,0.000027081],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4770658,"threshold_uncertainty_score":0.3414059,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1980283844","doi":"10.1016/s0196-8858(02)00529-8","title":"A direct algorithm to construct the minimal Z-pairs for rational functions","year":2003,"lang":"en","type":"article","venue":"Advances in Applied Mathematics","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":15,"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":"Construct (python library); Mathematics; Maple; Algorithm; Rational function; Discrete mathematics; Algebra over a field; Computer science; Pure mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.01146985244514401,"gpt":0.2527011517575469,"spread":0.2412312993124029,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002711967,0.0001036549,0.0001331707,0.00006067507,0.0001354205,0.0000589648,0.0002802476,0.00002324133,0.000006197509],"category_scores_gemma":[0.0001042215,0.00007752402,0.00003776585,0.0003299617,0.00004424525,0.0001408317,0.00004651329,0.0000533665,0.00002575251],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003266413,"about_ca_system_score_gemma":0.00006260835,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":4.384964e-7,"about_ca_topic_score_gemma":0.000008784126,"domain_scores_codex":[0.9992053,0.00001246205,0.0002375577,0.0002101179,0.0001480199,0.0001865555],"domain_scores_gemma":[0.9989972,0.0006440773,0.00007394677,0.0002146671,0.00002749697,0.00004268751],"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.000002590276,0.0000528663,0.000006545235,0.00001747077,0.000004530794,3.423806e-7,0.0005656685,0.001501621,0.0001154849,0.8689011,0.0003451223,0.1284867],"study_design_scores_gemma":[0.0008758685,0.00009512332,0.00006730902,0.00003359407,0.00001256006,0.00002640815,0.0007331197,0.1289121,0.003649909,0.7790708,0.08614548,0.0003777367],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0005973414,0.00009334939,0.9812584,0.0002701015,0.0003003062,0.0004948617,0.000006865898,0.00005791813,0.01692085],"genre_scores_gemma":[0.1242269,0.000004198009,0.8750547,0.0002317029,0.00005170263,0.0003003695,0.000002526655,0.000006952252,0.0001209334],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.128109,"threshold_uncertainty_score":0.3161338,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2049415597","doi":"10.1016/j.aam.2008.06.006","title":"On the theory of resonances in non-relativistic quantum electrodynamics and related models","year":2009,"lang":"en","type":"article","venue":"Advances in Applied Mathematics","topic":"Spectral Theory in Mathematical Physics","field":"Mathematics","cited_by":15,"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":"Resolvent; Hamiltonian (control theory); Physics; Analytic continuation; Quantum; Quantum mechanics; S-matrix; Quantum field theory; Quantum electrodynamics; Mathematics; Mathematical physics; Mathematical analysis","retraction":null,"screen_n_in":null,"score":{"opus":0.01644610173307735,"gpt":0.2854864843370331,"spread":0.2690403826039557,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001597158,0.0003499502,0.0007175559,0.0001639094,0.00006245916,0.00001888924,0.0004330099,0.0001377216,0.0000189753],"category_scores_gemma":[0.001016472,0.0002451163,0.00007294707,0.0006258205,0.0003250027,0.0001655751,0.00005322777,0.0005798333,0.000009061529],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008789076,"about_ca_system_score_gemma":0.00002265609,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":3.892418e-7,"about_ca_topic_score_gemma":0.000004310269,"domain_scores_codex":[0.9977478,0.0000873697,0.0009814252,0.0003471378,0.0004033227,0.0004329071],"domain_scores_gemma":[0.990373,0.008473379,0.000437119,0.00064186,0.00002824278,0.00004641685],"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.00007338256,0.0005139073,0.000005225497,0.0002552134,0.00001150808,0.000004292988,0.002353348,0.000998912,0.0003392264,0.9934861,0.000008210194,0.001950696],"study_design_scores_gemma":[0.0004830287,0.0001321923,0.00006318624,0.0004583533,0.00002577013,0.000005296194,0.0006481878,0.05500045,0.0006346116,0.9423003,0.000001654238,0.0002469983],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6820439,0.0006610457,0.08006413,0.0002704358,0.00007749627,0.001949187,0.000008046476,0.0001246054,0.2348012],"genre_scores_gemma":[0.9734701,0.0002238694,0.02605802,0.00006786823,0.00001165766,0.00005857325,0.000001333147,0.0000421869,0.00006641023],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2914262,"threshold_uncertainty_score":0.9995552,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2507315201","doi":"10.1016/j.aam.2015.10.003","title":"Characterizing 2-crossing-critical graphs","year":2015,"lang":"en","type":"article","venue":"Advances in Applied Mathematics","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"University of Waterloo; Javna Agencija za Raziskovalno Dejavnost RS; Natural Sciences and Engineering Research Council of Canada; Consejo Nacional de Ciencia y Tecnología","keywords":"Mathematics; Subdivision; Combinatorics; Crossing number (knot theory); Chordal graph; Indifference graph; Pathwidth; 1-planar graph; Clique-sum; Planar graph; Discrete mathematics; Graph; Line graph","retraction":null,"screen_n_in":null,"score":{"opus":0.02771898456671913,"gpt":0.3079163636321328,"spread":0.2801973790654137,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003386936,0.0001024019,0.0001416919,0.0001183948,0.00007572865,0.0001803291,0.0003145963,0.00003563798,0.000002284202],"category_scores_gemma":[0.0001555469,0.00009948188,0.00002189589,0.0004731496,0.00006843721,0.0004980635,0.0001073553,0.0000930247,0.00004833573],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003417379,"about_ca_system_score_gemma":0.00006254882,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":3.20839e-7,"about_ca_topic_score_gemma":0.000001660921,"domain_scores_codex":[0.9990593,0.000009955403,0.0002556576,0.0002161226,0.0002645583,0.0001944011],"domain_scores_gemma":[0.9993244,0.0002444915,0.00006249416,0.0002371759,0.00004704129,0.00008439522],"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.000002153031,0.00008189002,0.00002654344,0.00003942455,0.000001039295,0.000003800441,0.001097958,0.0007600993,0.0007557267,0.9633163,0.00003133835,0.03388372],"study_design_scores_gemma":[0.0003197687,0.00002723874,0.00007110572,0.00003369967,0.000002398423,0.00002032588,0.0001416168,0.06130704,0.003324962,0.9227157,0.01183851,0.0001976612],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.008134116,0.0004136092,0.9760109,0.0002532459,0.0003766358,0.0001131346,7.752427e-7,0.0001030454,0.01459455],"genre_scores_gemma":[0.4977,0.00001182175,0.5020388,0.0001647637,0.00003838829,0.00002020776,0.00000251331,0.000004911546,0.00001852071],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.4895659,"threshold_uncertainty_score":0.4056753,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2090113296","doi":"10.1016/j.aam.2014.11.001","title":"Factor complexity of S-adic words generated by the Arnoux–Rauzy–Poincaré algorithm","year":2014,"lang":"en","type":"article","venue":"Advances in Applied Mathematics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":14,"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; Austrian Science Fund; Agence Nationale de la Recherche","keywords":"Piecewise linear function; Upper and lower bounds; Fraction (chemistry); Convergence (economics); Factor (programming language); Piecewise; Euclidean algorithm","retraction":null,"screen_n_in":null,"score":{"opus":0.01632427309637725,"gpt":0.2521384388042421,"spread":0.2358141657078648,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051373,0.0002061637,0.0003612045,0.00006313428,0.00008886415,0.00005540719,0.001236582,0.00006351867,0.00001977174],"category_scores_gemma":[0.00004830657,0.0001433253,0.00005197078,0.0004510678,0.0003064348,0.0001922454,0.0002386698,0.000177772,0.00002468708],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003113555,"about_ca_system_score_gemma":0.00002079115,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000512918,"about_ca_topic_score_gemma":0.000006760477,"domain_scores_codex":[0.9985414,0.00004876919,0.0004701193,0.0002984929,0.0003356521,0.0003055916],"domain_scores_gemma":[0.9982744,0.0005341897,0.0002867848,0.0008206798,0.00002970631,0.00005427184],"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.00000256986,0.0001970044,0.00002495659,0.0001113608,0.00001120654,8.462654e-7,0.001538198,0.0001426694,0.003233349,0.7640827,0.000335548,0.2303196],"study_design_scores_gemma":[0.0005014693,0.00004440836,0.00007285094,0.00005673645,0.000007222858,0.000008478662,0.0002592438,0.3388507,0.01999618,0.633265,0.00664106,0.0002966498],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01062062,0.0006557984,0.9799784,0.0001055578,0.0001692718,0.0002703265,0.00001761624,0.0001283604,0.008054079],"genre_scores_gemma":[0.5241241,0.0001002496,0.475359,0.0002437192,0.00004913058,0.00004311797,0.000007782437,0.00001949482,0.00005333195],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5135036,"threshold_uncertainty_score":0.5844636,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4212872005","doi":"10.1016/j.aam.2007.07.001","title":"Reflection groups and polytopes over finite fields, III","year":2007,"lang":"en","type":"article","venue":"Advances in Applied Mathematics","topic":"Geometric and Algebraic Topology","field":"Mathematics","cited_by":14,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of New Brunswick","funders":"","keywords":"Mathematics; Polytope; Reflection (computer programming); Reflection group; Combinatorics; Pure mathematics; Coxeter group; Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.02049110561486117,"gpt":0.3195110390553648,"spread":0.2990199334405036,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006031576,0.0001830474,0.0003370387,0.0002668541,0.0000736697,0.00002075374,0.000132329,0.0001536856,0.00007974452],"category_scores_gemma":[0.0003438077,0.0001630601,0.0000332997,0.0004703924,0.0001045648,0.0001347032,0.00008194615,0.0002321102,0.0000105081],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003499813,"about_ca_system_score_gemma":0.000009450368,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004843789,"about_ca_topic_score_gemma":0.0001454211,"domain_scores_codex":[0.9987271,0.00000822209,0.0004825754,0.0002424473,0.0001897424,0.0003498502],"domain_scores_gemma":[0.9975744,0.001903048,0.0001862625,0.0002565341,0.00001583991,0.00006388625],"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.00003232341,0.0001699027,0.0003965733,0.00027069,0.00001106647,0.00001168294,0.001357756,0.00001022325,0.0001189783,0.9638721,0.0001224438,0.03362622],"study_design_scores_gemma":[0.0007860187,0.0000465359,0.0002537322,0.00005676315,0.00001905197,0.00002356844,0.001362047,0.0001493202,0.0009802297,0.9933835,0.002722651,0.0002165596],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4129352,0.001585642,0.4871959,0.0001041576,0.0003405173,0.000565168,0.000002995563,0.0001844116,0.097086],"genre_scores_gemma":[0.89015,0.0004616755,0.1088246,0.0001455089,0.00009262587,0.00001929333,0.000002027458,0.00002333243,0.000280935],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.4772148,"threshold_uncertainty_score":0.6649398,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2069859193","doi":"10.1016/j.aam.2010.10.004","title":"Lattice point methods for combinatorial games","year":2010,"lang":"en","type":"article","venue":"Advances in Applied Mathematics","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Banff International Research Station for Mathematical Innovation and Discovery; Dalhousie University; National Science Foundation","keywords":"Mathematics; Lattice (music); Combinatorics; Combinatorial analysis; Discrete mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.02524175753119254,"gpt":0.3759550201433229,"spread":0.3507132626121303,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001117467,0.0001792725,0.0002955532,0.00007790823,0.00007955113,0.00009763155,0.001082098,0.0001060869,0.00001325855],"category_scores_gemma":[0.000697164,0.0001651148,0.00006051917,0.0003045351,0.0001300285,0.000392166,0.0002083298,0.0002760161,0.00004338723],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002529622,"about_ca_system_score_gemma":0.00003875001,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001264065,"about_ca_topic_score_gemma":0.00001532294,"domain_scores_codex":[0.9986198,0.0000186613,0.0004763605,0.000359327,0.0001775192,0.0003483399],"domain_scores_gemma":[0.996645,0.002331362,0.0001889573,0.0007022504,0.00006406388,0.00006835462],"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.000004316975,0.0001030178,0.000009607099,0.00005970804,0.000002604535,5.604153e-7,0.0009162598,0.00004721146,0.003306285,0.8451551,0.00003044233,0.1503649],"study_design_scores_gemma":[0.0001436115,0.0000278336,0.000002955151,0.00001376883,0.000004647954,0.000003696608,0.0001902409,0.05173457,0.05674333,0.8662835,0.02466593,0.000185848],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001305297,0.000152848,0.9811137,0.000178556,0.002000492,0.0005517679,0.000001124176,0.0001566022,0.01453965],"genre_scores_gemma":[0.04638989,0.00003498187,0.9530799,0.0001117646,0.0001051629,0.0002230717,7.704545e-7,0.00001939427,0.00003500752],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.1501791,"threshold_uncertainty_score":0.6733185,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1987700418","doi":"10.1016/j.aam.2014.08.005","title":"On the asymptotic abelian complexity of morphic words","year":2014,"lang":"en","type":"article","venue":"Advances in Applied Mathematics","topic":"semigroups and automata theory","field":"Computer Science","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 Winnipeg","funders":"Carnegie Mellon University; Williams College; National Science Foundation","keywords":"Morphism; Mathematics; Abelian group; Iterated function; Permutation (music); Factorization; Binary number; Combinatorics on words; Discrete mathematics; Combinatorics; Word (group theory); Arithmetic; Algorithm","retraction":null,"screen_n_in":null,"score":{"opus":0.01856410111223538,"gpt":0.2458517527869865,"spread":0.2272876516747511,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006775189,0.0001340316,0.0002358666,0.00006829154,0.00005704729,0.00002905322,0.001015397,0.0000350411,0.00002010738],"category_scores_gemma":[0.0001118275,0.00008814909,0.00003763095,0.0003398705,0.0002115552,0.00009961376,0.0001580279,0.0001329306,0.00004943986],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001750519,"about_ca_system_score_gemma":0.00001045792,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001129181,"about_ca_topic_score_gemma":0.00000449049,"domain_scores_codex":[0.9989883,0.0000301468,0.0003093887,0.0002031176,0.0002643108,0.0002047467],"domain_scores_gemma":[0.9977655,0.001206101,0.0001833156,0.000801033,0.00001349708,0.0000305169],"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.000001744856,0.00009308869,0.00001401841,0.00006803259,0.000002473287,3.476119e-7,0.000441056,0.0003705946,0.0001619072,0.9884602,0.00003166736,0.01035481],"study_design_scores_gemma":[0.0001548921,0.00003052729,0.00008529727,0.00007921184,0.000002318217,0.000001812665,0.0000859443,0.07265288,0.002301039,0.9241037,0.0003996003,0.0001028047],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03412473,0.0001621934,0.8981355,0.0004549976,0.0001685621,0.0003113842,0.000001944297,0.0001230142,0.06651764],"genre_scores_gemma":[0.8708634,0.00002020059,0.1287384,0.0003092778,0.00001696831,0.00002436886,4.790119e-7,0.000008949481,0.00001800205],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8367386,"threshold_uncertainty_score":0.3594615,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2014803743","doi":"10.1016/j.aam.2014.08.002","title":"When does a biased graph come from a group labelling?","year":2014,"lang":"en","type":"article","venue":"Advances in Applied Mathematics","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":12,"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":"Australian Research Council; Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Discrete mathematics; Graph","retraction":null,"screen_n_in":null,"score":{"opus":0.00893912167333614,"gpt":0.2256887496741622,"spread":0.2167496280008261,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005057721,0.0002099427,0.0003452279,0.0001699133,0.00008847297,0.00009671401,0.0008115598,0.00007933564,0.00001141232],"category_scores_gemma":[0.00006527696,0.0001580543,0.00005459101,0.0004083901,0.00009253907,0.0002265119,0.0001742719,0.0001762337,0.00006927676],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001454922,"about_ca_system_score_gemma":0.000009399751,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001711,"about_ca_topic_score_gemma":0.00005316428,"domain_scores_codex":[0.9983953,0.00002803722,0.0004632334,0.0004543519,0.0003290783,0.0003299818],"domain_scores_gemma":[0.9981295,0.0007425189,0.0001993524,0.0008104658,0.00002745968,0.00009074411],"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.000003845246,0.000189507,0.0002190754,0.00007884103,0.000006957468,0.000002195605,0.001198027,0.0003332953,0.001738822,0.9854941,0.00005457088,0.01068073],"study_design_scores_gemma":[0.0006065942,0.00002804009,0.00001634725,0.0001001645,0.000006815784,0.000001058094,0.00006286358,0.03402706,0.001538734,0.9604369,0.002939238,0.00023617],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.03380158,0.0006613043,0.9581499,0.0002042077,0.0003865096,0.0002995043,0.000004882641,0.0003895911,0.00610248],"genre_scores_gemma":[0.3950389,0.00008792627,0.6044102,0.0003682008,0.00001116579,0.00004731239,0.000004745236,0.00001464006,0.00001689726],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.3612373,"threshold_uncertainty_score":0.6445268,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4367313129","doi":"10.1016/j.aam.2023.102540","title":"Row-strict dual immaculate functions","year":2023,"lang":"en","type":"article","venue":"Advances in Applied Mathematics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":11,"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","funders":"","keywords":"Mathematics; Hook; Dual (grammatical number); Skew; Combinatorics; Dual function; Discrete mathematics; Pure mathematics; Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.03220997425033819,"gpt":0.3271643900644732,"spread":0.2949544158141351,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000983141,0.0004900087,0.0007800073,0.0004658819,0.0001938735,0.00005452754,0.0004558075,0.0002020739,0.00008166449],"category_scores_gemma":[0.001429768,0.0004695984,0.0001457318,0.002113913,0.0001416372,0.0003183981,0.0002919275,0.0004624746,0.0009996312],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001809868,"about_ca_system_score_gemma":0.00005460083,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":8.636691e-7,"about_ca_topic_score_gemma":0.00001172488,"domain_scores_codex":[0.9967422,0.00003885497,0.001130093,0.0005366225,0.0007149359,0.0008373228],"domain_scores_gemma":[0.9951453,0.003188071,0.0004463828,0.0009991662,0.00007374708,0.0001473416],"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.00002722313,0.0003955235,0.00006337643,0.000781018,0.00002968556,0.00004473569,0.001184417,0.0008362612,0.0006969063,0.990913,0.001321088,0.003706763],"study_design_scores_gemma":[0.0009984149,0.00004090901,0.00002956337,0.000138067,0.00005066402,0.00002230929,0.001757323,0.002480116,0.0008816877,0.9859847,0.00709821,0.0005180699],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.3228502,0.0009556345,0.3124411,0.0005256282,0.005154854,0.006173462,0.0001363428,0.007442913,0.3443199],"genre_scores_gemma":[0.6376722,0.0006292446,0.3560736,0.00008814796,0.0004824353,0.001104325,0.00005915984,0.0003975818,0.003493241],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.3408266,"threshold_uncertainty_score":0.9997782,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1661759167","doi":"10.1016/j.aam.2009.01.002","title":"Structure and enumeration of two-connected graphs with prescribed three-connected components","year":2009,"lang":"en","type":"article","venue":"Advances in Applied Mathematics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":11,"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; Acadia University","funders":"","keywords":"Enumeration; Planar graph; Chordal graph; Graph; Class (philosophy); Bipartite graph; Modular decomposition; Tree (set theory)","retraction":null,"screen_n_in":null,"score":{"opus":0.01505160825475109,"gpt":0.2775496215708921,"spread":0.262498013316141,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000229168,0.0004600237,0.0009088,0.0002342819,0.00009022019,0.0000342857,0.0003309894,0.0001479124,0.00001790479],"category_scores_gemma":[0.0003634031,0.0003843449,0.00004840131,0.0006277015,0.0001745737,0.0003163746,0.0000662333,0.0003238004,0.000001672216],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005804002,"about_ca_system_score_gemma":0.00002892123,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002284801,"about_ca_topic_score_gemma":0.00007223858,"domain_scores_codex":[0.9976477,0.00003207332,0.000943519,0.000431934,0.0005317149,0.0004130371],"domain_scores_gemma":[0.9972681,0.001086158,0.0007344704,0.0006779893,0.0001351272,0.00009808825],"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.0001207781,0.0004423925,0.0002331978,0.0006751717,0.0000320705,0.000005485924,0.001505909,0.0002201443,0.02210615,0.9722484,0.000007449771,0.002402888],"study_design_scores_gemma":[0.002881938,0.0002000595,0.000223408,0.0003491365,0.00008124787,0.00002176388,0.0001916909,0.00251293,0.02522937,0.9678739,0.00002199624,0.0004125949],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9138204,0.0004297425,0.0810473,0.00004028177,0.000122433,0.001707151,0.00002391587,0.0002279983,0.002580795],"genre_scores_gemma":[0.6849026,0.00003097704,0.3149248,0.00002518262,0.00002222259,0.00003357618,0.00001238974,0.00004288325,0.000005328751],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2338775,"threshold_uncertainty_score":0.9998608,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1978671960","doi":"10.1016/j.aam.2014.10.002","title":"A characterization of p-automatic sequences as columns of linear cellular automata","year":2014,"lang":"en","type":"article","venue":"Advances in Applied Mathematics","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Trent University; Université du Québec à Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Cellular automaton; Characterization (materials science); Computer science; Computational biology; Mathematics; Algorithm; Biology; Materials science; Nanotechnology","retraction":null,"screen_n_in":null,"score":{"opus":0.008061664681708791,"gpt":0.2459680981247986,"spread":0.2379064334430898,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003798826,0.0001478602,0.0003779628,0.0001353885,0.00004572573,0.0000210186,0.0008209691,0.00006390046,0.00001320347],"category_scores_gemma":[0.0000637897,0.0001439293,0.00004866942,0.0006174438,0.0001163115,0.0002649967,0.0001567779,0.00007737842,0.00003589915],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001833515,"about_ca_system_score_gemma":0.00004571101,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004624606,"about_ca_topic_score_gemma":0.000004350522,"domain_scores_codex":[0.998533,0.00002216968,0.0006779481,0.0002556563,0.0003255305,0.0001856644],"domain_scores_gemma":[0.9983445,0.0002428182,0.0005388032,0.0007823903,0.00004820408,0.00004324463],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000001104985,0.0002550242,0.00007633003,0.000669821,0.000005683913,6.530908e-7,0.001058687,0.0001965078,0.3171958,0.6637839,0.000001553568,0.01675492],"study_design_scores_gemma":[0.000400696,0.00006553074,0.0002389728,0.0001885808,0.0000138233,0.000005968491,0.0001046454,0.5255126,0.35719,0.114558,0.001490633,0.0002304914],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2579498,0.00004876819,0.7358467,0.00004367164,0.0000488564,0.0003571229,0.00000543108,0.0001182564,0.005581429],"genre_scores_gemma":[0.7607043,0.00006315223,0.2390819,0.0000230749,0.00001292978,0.00006432531,0.00001471033,0.0000111127,0.00002448617],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5492259,"threshold_uncertainty_score":0.5869268,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1993840779","doi":"10.1016/s0196-8858(02)00542-0","title":"Attribute grammars and automatic complexity analysis","year":2003,"lang":"en","type":"article","venue":"Advances in Applied Mathematics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":9,"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","keywords":"Rule-based machine translation; Mathematics; Context-free grammar; L-attributed grammar; Class (philosophy); Tree-adjoining grammar; Context (archaeology); Function (biology); Theoretical computer science; Computer science; Artificial intelligence; Geography","retraction":null,"screen_n_in":null,"score":{"opus":0.04287354139864274,"gpt":0.3283646081009167,"spread":0.2854910667022739,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001055332,0.0005018504,0.001278192,0.0004265143,0.0001565584,0.00006416484,0.0003724717,0.0001699124,0.00007616242],"category_scores_gemma":[0.00154482,0.000476397,0.0001553997,0.001724313,0.000323374,0.000252544,0.0001346824,0.0003559558,0.0000271606],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001572541,"about_ca_system_score_gemma":0.00003797749,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001378827,"about_ca_topic_score_gemma":0.00004694117,"domain_scores_codex":[0.9969853,0.00007422353,0.001168251,0.0005475433,0.0005656303,0.0006591148],"domain_scores_gemma":[0.9957988,0.002423991,0.0005713967,0.0009603007,0.00006725407,0.0001782582],"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.000004044496,0.0003819866,0.0006710936,0.000819892,0.0001163925,0.000007823101,0.0007373891,0.00008776088,0.00004681195,0.9960579,0.00002804024,0.00104084],"study_design_scores_gemma":[0.000904675,0.00003072585,0.0000718946,0.00007690647,0.0004045503,0.00001818099,0.0009286343,0.003409681,0.0004755329,0.9924201,0.0007507194,0.0005083522],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.1788241,0.001149064,0.7768483,0.00007083806,0.0004230849,0.002201271,0.00003000456,0.0007466822,0.03970662],"genre_scores_gemma":[0.4148277,0.0001298423,0.5847284,0.00002859084,0.00001693671,0.0001338983,0.000005358754,0.0000576962,0.00007159486],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.2360036,"threshold_uncertainty_score":0.9997688,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1994554004","doi":"10.1016/j.aam.2010.09.009","title":"Eigenvectors for a random walk on a hyperplane arrangement","year":2011,"lang":"en","type":"article","venue":"Advances in Applied Mathematics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":9,"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":"Hyperplane; Mathematics; Random walk; Eigenvalues and eigenvectors; Random matrix; Combinatorics; Lattice (music); Discrete mathematics; Pure mathematics; Statistics","retraction":null,"screen_n_in":null,"score":{"opus":0.06116507959434987,"gpt":0.3159970725580246,"spread":0.2548319929636748,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007041961,0.000511885,0.0009203688,0.000228704,0.0001145784,0.00002150053,0.0005558753,0.0001612981,0.00009001639],"category_scores_gemma":[0.0008715629,0.0004470443,0.0001607603,0.0003343665,0.0001109642,0.0001501409,0.00009023905,0.0002647425,0.0000751451],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001646965,"about_ca_system_score_gemma":0.0000326929,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001129311,"about_ca_topic_score_gemma":0.00001588699,"domain_scores_codex":[0.9972969,0.00002411377,0.001019339,0.0005091474,0.0004868355,0.0006636101],"domain_scores_gemma":[0.9958485,0.002582244,0.0004939048,0.0008850272,0.00006390733,0.0001263706],"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.0003523632,0.001227024,0.00002052573,0.001148365,0.00003690093,0.000007570562,0.003597985,0.000029107,0.0002706028,0.9892554,0.000180323,0.003873776],"study_design_scores_gemma":[0.003995582,0.000232225,0.000004038846,0.000242383,0.00007255105,0.000007262562,0.0009577405,0.0004256164,0.007866955,0.9824046,0.00328164,0.0005093948],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.05828266,0.0005880474,0.672953,0.00006513269,0.00191782,0.009659134,0.00006857929,0.0009247055,0.2555409],"genre_scores_gemma":[0.276917,0.0001250512,0.7206579,0.00009354572,0.000144186,0.001698293,0.000008412644,0.000161344,0.0001942921],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.2553466,"threshold_uncertainty_score":0.9997981,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2069397816","doi":"10.1006/aama.2000.0684","title":"Priestley's Duality from Stone's","year":2000,"lang":"en","type":"article","venue":"Advances in Applied Mathematics","topic":"Quantum Mechanics and Applications","field":"Physics and Astronomy","cited_by":9,"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; Duality (order theory); Mathematical economics; Calculus (dental); Pure mathematics; Algebra over a field; Orthodontics; Medicine","retraction":null,"screen_n_in":null,"score":{"opus":0.0103728050770178,"gpt":0.2745315262241257,"spread":0.2641587211471079,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00009291666,0.0001322862,0.0001962328,0.00001957299,0.00006356404,0.00002435653,0.0001858519,0.00002843097,0.001973561],"category_scores_gemma":[0.000001869431,0.0001261007,0.00003620686,0.0001482878,0.0000375528,0.0000775105,0.00002668026,0.0001219429,0.0003541142],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001361757,"about_ca_system_score_gemma":0.00001503888,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000255319,"about_ca_topic_score_gemma":0.000007329888,"domain_scores_codex":[0.9991823,0.000005321382,0.0002840643,0.0002123002,0.0001276542,0.0001883568],"domain_scores_gemma":[0.9993879,0.0001263613,0.00007931494,0.0003518613,0.000008985256,0.00004557061],"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.000003282963,0.0002137659,0.0002080479,0.00001109258,0.000005803238,2.216803e-7,0.0002734912,0.00006296169,0.0002820082,0.948721,0.00004928898,0.05016902],"study_design_scores_gemma":[0.0002446595,0.000004430958,0.00007245491,0.00001598308,0.000008679558,1.10391e-7,0.0003411353,0.001108907,0.001747168,0.9590245,0.037279,0.0001529397],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.4408827,0.0002861136,0.2096432,0.0001421886,0.00009132535,0.0007204465,0.0001686858,0.0001152215,0.34795],"genre_scores_gemma":[0.9576689,0.00004287457,0.04173229,0.00004435784,0.0001008686,0.0001712117,0.00004914267,0.00001934949,0.0001710346],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.5167861,"threshold_uncertainty_score":0.9989388,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2054789626","doi":"10.1006/aama.2000.0695","title":"A Homological Interpretation of Skeletal Rigidity","year":2000,"lang":"en","type":"article","venue":"Advances in Applied Mathematics","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Montréal","funders":"","keywords":"Mathematics; Rigidity (electromagnetism); Interpretation (philosophy); Pure mathematics; Algebra over a field; Linguistics; Philosophy; Structural engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.008868251794471808,"gpt":0.2612120519522976,"spread":0.2523438001578258,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002026526,0.00008748122,0.0002423307,0.0001065189,0.00002132406,0.00001637404,0.000571864,0.00004578023,0.0001869941],"category_scores_gemma":[0.00007080529,0.00006373146,0.00005001697,0.0008510464,0.0000916987,0.0002063179,0.00008890878,0.00008698564,0.00007130587],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001318504,"about_ca_system_score_gemma":0.000006258653,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002157576,"about_ca_topic_score_gemma":0.000004106761,"domain_scores_codex":[0.99913,0.00001289723,0.0003222923,0.0002056562,0.000182956,0.0001461965],"domain_scores_gemma":[0.9992502,0.0002906623,0.00009549892,0.0003203998,0.00001239246,0.00003083308],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000004737385,0.000268709,0.00009220672,0.00003875478,0.000005162378,0.00000414447,0.000230945,0.001019397,0.00003745814,0.4868164,0.00001419012,0.5114679],"study_design_scores_gemma":[0.0003287932,0.0001024816,0.0007973241,0.00002390218,0.000012587,0.000009433001,0.00007844345,0.07370335,0.0006427512,0.9196093,0.004474217,0.0002173969],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05172313,0.0003268805,0.8948935,0.00005575295,0.00003358019,0.000116323,0.000004759488,0.00006308898,0.05278294],"genre_scores_gemma":[0.766225,0.0001706972,0.233494,0.00003747462,0.000006793146,0.00001281021,0.000002807656,0.000001690178,0.00004869393],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7145019,"threshold_uncertainty_score":0.2598894,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}