{"meta":{"query_hash":"dd7739934530","filters":{"venue":"Advances in Applied Mathematics"},"cohort_total":110,"direct_labels_cover":0,"predictions_cover":110,"exported":110,"export_cap":100000,"truncated":false,"label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"permalink":"https://metacan.xera.ac/q/dd7739934530","api":"https://metacan.xera.ac/api/v1/cohort?venue=Advances+in+Applied+Mathematics"},"results":[{"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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)","score_opus":0.015051608254751091,"score_gpt":0.2775496215708921,"score_spread":0.262498013316141,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1661759167","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9138204,0.0004297425,0.081047304,0.000040281768,0.000122433,0.0017071512,0.00002391587,0.00022799829,0.0025807952],"genre_scores_gemma":[0.6849026,0.00003097704,0.31492484,0.000025182622,0.000022222586,0.000033576183,0.000012389741,0.00004288325,0.0000053287513],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976477,0.000032073323,0.000943519,0.00043193402,0.00053171493,0.00041303714],"domain_scores_gemma":[0.99726814,0.0010861579,0.0007344704,0.00067798933,0.00013512721,0.000098088254],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00022916803,0.0004600237,0.0009088,0.00023428192,0.00009022019,0.0000342857,0.00033098937,0.00014791245,0.000017904795],"category_scores_gemma":[0.00036340312,0.00038434492,0.00004840131,0.0006277015,0.00017457367,0.0003163746,0.0000662333,0.0003238004,0.0000016722164],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012077814,0.0004423925,0.00023319782,0.0006751717,0.000032070497,0.0000054859242,0.0015059094,0.0002201443,0.022106154,0.9722484,0.000007449771,0.002402888],"study_design_scores_gemma":[0.002881938,0.00020005947,0.00022340799,0.00034913654,0.00008124787,0.000021763875,0.00019169091,0.00251293,0.025229366,0.9678739,0.000021996242,0.0004125949],"about_ca_topic_score_codex":0.0000022848005,"about_ca_topic_score_gemma":0.00007223858,"teacher_disagreement_score":0.23387754,"about_ca_system_score_codex":0.000058040023,"about_ca_system_score_gemma":0.000028921235,"threshold_uncertainty_score":0.9998608},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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)","score_opus":0.023730704919462754,"score_gpt":0.2565127795228791,"score_spread":0.23278207460341635,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1680081660","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15669079,0.004419218,0.0146942595,0.0005930793,0.0023514456,0.00020173428,0.00048012479,0.0003799416,0.8201894],"genre_scores_gemma":[0.92358583,0.0025468364,0.06332873,0.0016865236,0.0025312102,0.0037719926,0.0006604192,0.0010804248,0.0008080359],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.98748827,0.00033591138,0.003103984,0.0019306764,0.0035090442,0.003632125],"domain_scores_gemma":[0.98839897,0.0040079146,0.0030322485,0.0031224405,0.000242823,0.001195581],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","research_integrity","insufficient_payload"],"consensus_categories":["metaepi_narrow","insufficient_payload"],"category_scores_codex":[0.0043295613,0.0013466286,0.0007073327,0.00083532924,0.001631454,0.0015176653,0.003249962,0.0023502528,0.12703285],"category_scores_gemma":[0.0032191381,0.002162329,0.001609614,0.0025193717,0.0015191972,0.0018905596,0.002705407,0.0021821964,0.0031247053],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007381858,0.0009864478,0.000005166218,0.00718415,0.001118224,0.00021591502,0.0103858905,0.0027576147,0.00046439434,0.80985224,0.16198947,0.0043022796],"study_design_scores_gemma":[0.0027469979,0.0014096376,0.000012103939,0.0027232184,0.0021965152,0.0014117324,0.013994515,0.08489823,0.8589545,0.009659455,0.018943598,0.0030495285],"about_ca_topic_score_codex":0.0003935558,"about_ca_topic_score_gemma":0.0006757825,"teacher_disagreement_score":0.85849005,"about_ca_system_score_codex":0.000039275918,"about_ca_system_score_gemma":0.0012017912,"threshold_uncertainty_score":0.9999285},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.02515159122030653,"score_gpt":0.2735925001591178,"score_spread":0.24844090893881127,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1718672927","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5196112,0.00022414989,0.15379885,0.0016955138,0.0001524344,0.001490758,0.00016106002,0.00007666601,0.3227894],"genre_scores_gemma":[0.9966769,0.000006488626,0.0026032897,0.00042611762,0.000083079074,0.00014745041,0.000015483627,0.000014077114,0.000027080998],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99922854,0.000024769472,0.0002195427,0.00016365731,0.00020151523,0.00016198528],"domain_scores_gemma":[0.9990053,0.0005994947,0.00008206863,0.00023247825,0.000025936739,0.000054728465],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017993573,0.00015185143,0.00016488717,0.00002282841,0.00015531085,0.00006072697,0.00017777552,0.000014765792,0.000020707585],"category_scores_gemma":[0.000009966595,0.00008372138,0.00003440481,0.00014155764,0.00020173813,0.00005670006,0.000042958567,0.00017079941,0.000048924743],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017489847,0.00010744648,0.000036765643,0.0000060069965,0.000008661759,1.12387625e-7,0.0005190646,0.042387046,0.00007980378,0.95480883,0.00018103723,0.001847731],"study_design_scores_gemma":[0.00043215073,0.00003166836,0.000011820554,0.000025035282,0.000009855199,2.5146593e-7,0.0008648582,0.057106275,0.0005017557,0.93976533,0.0011369012,0.00011411907],"about_ca_topic_score_codex":0.0000026248963,"about_ca_topic_score_gemma":0.0000019771655,"teacher_disagreement_score":0.47706577,"about_ca_system_score_codex":0.000010080674,"about_ca_system_score_gemma":0.000022815884,"threshold_uncertainty_score":0.34140587},"labels":[],"label_agreement":null},{"id":"W1766005166","doi":"10.1016/j.aam.2015.05.001","title":"Star-cumulants of free unitary Brownian motion","year":2015,"lang":"en","type":"preprint","venue":"Advances in Applied Mathematics","topic":"Stochastic processes and financial applications","field":"Economics, Econometrics and Finance","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; Université du Québec à Montréal","funders":"Natural Sciences and Engineering Research Council of Canada; Agence Nationale de la Recherche","keywords":"Cumulant; Mathematics; Unitary state; Diagonal; Brownian motion; Connection (principal bundle); Infinity; Free probability; Mathematical physics; Combinatorics; Mathematical analysis; Geometry; Statistics","score_opus":0.04277739905697449,"score_gpt":0.26295938071407776,"score_spread":0.2201819816571033,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1766005166","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0071197767,0.007383757,0.9300587,0.00008369531,0.00035909086,0.00085923215,0.0010722966,0.000058848444,0.053004596],"genre_scores_gemma":[0.73131293,0.0010577847,0.2666879,0.000051087543,0.00015470122,0.00043513536,0.00017338693,0.00007319432,0.000053845655],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997996,0.0000018109619,0.0011737564,0.0004731109,0.00009074887,0.00026457047],"domain_scores_gemma":[0.99773127,0.00011066327,0.0010624096,0.00095992535,0.00006620663,0.000069517904],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00044924987,0.0002723623,0.0008338366,0.00028078925,0.000034710712,0.000020392034,0.0007610548,0.00027179215,0.000023096336],"category_scores_gemma":[0.00026348917,0.00032390768,0.00007926762,0.00032017115,0.0001079586,0.00008933509,0.00052797585,0.00038066844,0.00007461298],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009615917,0.00024391637,0.00018259356,0.0010900116,0.000013096054,8.243815e-7,0.00070604903,0.0014384901,0.0000053181225,0.9941658,0.00006127999,0.002083045],"study_design_scores_gemma":[0.00040711413,0.000017784196,0.00019544059,0.00013818443,0.000010971359,0.0000010691297,0.00019098824,0.005045087,0.000047811016,0.9919941,0.0016485809,0.00030287539],"about_ca_topic_score_codex":0.00006231996,"about_ca_topic_score_gemma":0.00006933811,"teacher_disagreement_score":0.72419316,"about_ca_system_score_codex":0.00013462322,"about_ca_system_score_gemma":0.00006112182,"threshold_uncertainty_score":0.9999213},"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,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"McGill University","keywords":"Mathematics; Degenerate energy levels; Function (biology); Algorithm; Physics","score_opus":0.018500070458323678,"score_gpt":0.24742817187647448,"score_spread":0.2289281014181508,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W177832585","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2858734,0.0023718006,0.002756008,0.00055323925,0.0014990502,0.000110741996,0.0001417167,0.00013327808,0.70656073],"genre_scores_gemma":[0.9764609,0.0015450619,0.017124454,0.0010429448,0.0011440642,0.001282965,0.000230933,0.0006133837,0.00055530283],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9905065,0.000361218,0.0024377576,0.0013194698,0.00310406,0.0022710213],"domain_scores_gemma":[0.98841214,0.003962338,0.0033063788,0.0034852284,0.00017307972,0.00066082017],"candidate_categories":["metaepi_narrow","research_integrity","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0038457934,0.0009392013,0.0005594156,0.00051252276,0.0012026245,0.00075092365,0.0027783178,0.0019635959,0.26012325],"category_scores_gemma":[0.0029282675,0.0013451001,0.0017694482,0.0022173184,0.0015675967,0.0010197182,0.0019159508,0.0019860119,0.0014620265],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004201762,0.00080763275,0.000016654541,0.0028824392,0.0011367195,0.000113434005,0.0039083604,0.0014227697,0.0008091577,0.8302989,0.15625672,0.0019270086],"study_design_scores_gemma":[0.0017767071,0.00078534556,0.00005387832,0.0021336908,0.0024558934,0.00041977086,0.005506084,0.025929917,0.9416459,0.011802694,0.005817142,0.0016729683],"about_ca_topic_score_codex":0.0002525702,"about_ca_topic_score_gemma":0.00084733515,"teacher_disagreement_score":0.9408367,"about_ca_system_score_codex":0.000024789324,"about_ca_system_score_gemma":0.00079217297,"threshold_uncertainty_score":0.9993321},"labels":[],"label_agreement":null},{"id":"W1779209123","doi":"10.1016/j.aam.2015.09.010","title":"Thick sections of convex bodies","year":2015,"lang":"en","type":"article","venue":"Advances in Applied Mathematics","topic":"Point processes and geometric inequalities","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Mixed volume; Hyperplane; Regular polygon; Convex body; Convex polytope; Polytope; Ball (mathematics); Section (typography); Geometry; Euclidean geometry; Convex set; Convex hull; Convex optimization","score_opus":0.07842768018165193,"score_gpt":0.35167282731892724,"score_spread":0.2732451471372753,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1779209123","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1211952,0.0045204135,0.15313764,0.00018623551,0.0006249945,0.0010360503,0.000047316375,0.00033928733,0.7189129],"genre_scores_gemma":[0.7774543,0.0002971343,0.22130646,0.000044088072,0.000065850276,0.000085369924,0.0000034530171,0.000031586656,0.0007117475],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99860257,0.000012331904,0.0006261874,0.0001601833,0.00035532424,0.00024341779],"domain_scores_gemma":[0.99812216,0.0010656968,0.0003055407,0.00031927455,0.00012487342,0.000062478444],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00067680544,0.00016687158,0.00046798287,0.0002290941,0.00003431814,0.000014041632,0.00021530782,0.000082956074,0.000025593485],"category_scores_gemma":[0.0012250615,0.00014312202,0.00004776396,0.00045314713,0.00012691449,0.0001590845,0.00008189358,0.00015590644,0.000022577911],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013196786,0.00024140101,0.0001037066,0.0013811874,0.000013051287,0.0000014271737,0.0071192547,0.00010439305,0.000030995336,0.9896489,0.00042554436,0.00091698504],"study_design_scores_gemma":[0.00047092556,0.00004497604,0.0000047787416,0.00009304559,0.000020155745,0.0000074945256,0.01236498,0.00024542518,0.0030302082,0.97824043,0.005309908,0.00016769487],"about_ca_topic_score_codex":0.0000050798626,"about_ca_topic_score_gemma":0.000040789575,"teacher_disagreement_score":0.7182011,"about_ca_system_score_codex":0.000045945668,"about_ca_system_score_gemma":0.000061579776,"threshold_uncertainty_score":0.5836347},"labels":[],"label_agreement":null},{"id":"W1907526925","doi":"10.1016/j.aam.2017.08.001","title":"A combinatorial understanding of lattice path asymptotics","year":2017,"lang":"en","type":"article","venue":"Advances in Applied Mathematics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Lattice (music); Exponential function; Exponential growth; Constant (computer programming); Path (computing); Combinatorial analysis","score_opus":0.06031521248991653,"score_gpt":0.34337190580613236,"score_spread":0.28305669331621586,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1907526925","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.055860635,0.00039764764,0.54720426,0.0001386554,0.00399299,0.002714562,0.000038276175,0.00041910427,0.38923386],"genre_scores_gemma":[0.73857176,0.00012829305,0.26098862,0.000009568342,0.00011676172,0.000057724912,0.0000017224828,0.00009004127,0.000035526307],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99690056,0.000029864445,0.0012698398,0.00042923592,0.0007811638,0.0005893219],"domain_scores_gemma":[0.9936156,0.0024737488,0.0017632649,0.0019264861,0.00009750212,0.00012334135],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009662305,0.00045359283,0.001093962,0.00017898741,0.00035496952,0.000098890865,0.0012773586,0.0002342869,0.000023785575],"category_scores_gemma":[0.0030555073,0.00044354243,0.00013691244,0.00021947517,0.00047172315,0.00048796082,0.00043704282,0.0004242803,0.000017842895],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003795802,0.00062737905,0.00023675237,0.0014737411,0.00002693971,0.000011119281,0.0011118804,0.00003796412,0.00022742967,0.99571526,0.00003018414,0.0004634117],"study_design_scores_gemma":[0.0020925747,0.00007634484,0.000016441181,0.00051300967,0.000074049465,0.000007809768,0.0014417961,0.0010509224,0.002227357,0.9917592,0.0003008459,0.00043968845],"about_ca_topic_score_codex":0.0000020525547,"about_ca_topic_score_gemma":0.000013127842,"teacher_disagreement_score":0.6827111,"about_ca_system_score_codex":0.00031339,"about_ca_system_score_gemma":0.00007624761,"threshold_uncertainty_score":0.99980164},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Matroid; Mathematics; Mersenne prime; Combinatorics; Prime power; Prime (order theory); Integer (computer science); Discrete mathematics; Field (mathematics); Pure mathematics","score_opus":0.023486742364840333,"score_gpt":0.31099295807236715,"score_spread":0.2875062157075268,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1967459533","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01933895,0.0007250099,0.91503125,0.00031080685,0.00008696739,0.00043700737,5.105579e-7,0.00006919306,0.06400031],"genre_scores_gemma":[0.7361722,0.0006108847,0.26295292,0.000076807984,0.000010579368,0.000082307764,0.0000010106771,0.0000046271794,0.00008867198],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992429,0.000015299194,0.00033111652,0.00014050747,0.00014522174,0.00012493959],"domain_scores_gemma":[0.998842,0.0002868388,0.0001299464,0.0006700143,0.00004276591,0.000028440169],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013041928,0.00008109445,0.0001528821,0.00007185401,0.000037815844,0.00003183116,0.0006077314,0.00002953218,0.00007922509],"category_scores_gemma":[0.000045694636,0.00007342323,0.000026367661,0.00033174607,0.000045539135,0.00029634184,0.00028736948,0.000099462275,0.000034171822],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[7.494526e-7,0.00012343535,0.00035698537,0.000052376497,0.000004160094,2.5285806e-7,0.0012979427,0.0005351997,0.0025952177,0.9468743,0.00020096343,0.04795839],"study_design_scores_gemma":[0.0013060648,0.00008580733,0.0069428305,0.0002631286,0.000011516332,0.0000063185867,0.000604392,0.258859,0.026219064,0.698568,0.006504421,0.0006294514],"about_ca_topic_score_codex":0.0000025602826,"about_ca_topic_score_gemma":0.000013455722,"teacher_disagreement_score":0.71683323,"about_ca_system_score_codex":0.000021902164,"about_ca_system_score_gemma":0.000017032673,"threshold_uncertainty_score":0.29941127},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Mathematics; Lattice (music); Tree (set theory); Combinatorics; Gaussian; Percolation (cognitive psychology); Discrete mathematics; Statistical physics","score_opus":0.011592070310764443,"score_gpt":0.2846844388829838,"score_spread":0.27309236857221936,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1969240432","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0027006778,0.00014030193,0.98311764,0.000032987708,0.000049171023,0.0008478337,0.0000022688746,0.00006212731,0.013046986],"genre_scores_gemma":[0.60269964,0.00008725801,0.39681143,0.00004210983,0.000016113332,0.00028852205,7.52331e-7,0.000033628392,0.000020549252],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985659,0.000023805942,0.00048171415,0.00026003618,0.0003536925,0.00031484925],"domain_scores_gemma":[0.995367,0.003775042,0.0002539923,0.00047231826,0.000058550675,0.00007308602],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063975685,0.00020825544,0.0003355735,0.000055063567,0.00014263962,0.000020139707,0.00024448297,0.00007244976,0.000002953089],"category_scores_gemma":[0.0008114306,0.0001339831,0.000027008602,0.0004306667,0.000039420247,0.00003853561,0.00003507616,0.00022044682,0.000008841917],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000054566703,0.00020227951,0.0000033351598,0.0002509735,0.0000084755475,0.0000010170744,0.0005362846,0.001617514,0.00017353342,0.9841309,0.00002312038,0.0129979635],"study_design_scores_gemma":[0.0004885466,0.00020119999,0.0000030525398,0.0002226018,0.00003732028,0.0000056131066,0.0014699355,0.02842642,0.0023523932,0.9653768,0.001194461,0.0002216656],"about_ca_topic_score_codex":3.9580817e-7,"about_ca_topic_score_gemma":0.000033348635,"teacher_disagreement_score":0.59999895,"about_ca_system_score_codex":0.000060031467,"about_ca_system_score_gemma":0.000029807967,"threshold_uncertainty_score":0.5463673},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Enumeration; Mathematics; Combinatorics; Vertex (graph theory); Generalization; Discrete mathematics; Graph","score_opus":0.017390447661339615,"score_gpt":0.31040093097602744,"score_spread":0.2930104833146878,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1975206347","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35588023,0.0012517849,0.10163884,0.00010068218,0.0006884748,0.002981203,0.000028693177,0.00061126164,0.5368188],"genre_scores_gemma":[0.5470642,0.00036144248,0.45188665,0.000031834137,0.00007559379,0.00013042091,0.00000477439,0.00007678524,0.00036832044],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99776703,0.000024224795,0.0010632857,0.00030123582,0.00047957705,0.00036465077],"domain_scores_gemma":[0.9974313,0.0012994378,0.0004105896,0.00071886444,0.000051500934,0.0000883295],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004140227,0.000306424,0.0006776785,0.00014115592,0.00005744822,0.000015096995,0.00037927783,0.00013989648,0.00050828786],"category_scores_gemma":[0.00048435724,0.00029529547,0.000084459876,0.0004795469,0.00012349608,0.00029470993,0.00005090633,0.00025007647,0.00007597414],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000037468963,0.0006425682,0.000027924034,0.0009030745,0.000012954122,0.0000042827364,0.0015027937,0.0003515396,0.001135785,0.968518,0.00007397718,0.026789626],"study_design_scores_gemma":[0.00079294434,0.00004661855,0.0000071212203,0.00017651462,0.000029308561,0.000010104605,0.00036554647,0.00073863665,0.009931628,0.98509985,0.0025111882,0.00029054788],"about_ca_topic_score_codex":0.0000013659097,"about_ca_topic_score_gemma":0.000009844254,"teacher_disagreement_score":0.5364505,"about_ca_system_score_codex":0.0000897406,"about_ca_system_score_gemma":0.00004600952,"threshold_uncertainty_score":0.99994993},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.011915912193873772,"score_gpt":0.26285717354385507,"score_spread":0.2509412613499813,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1976341314","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1507138,0.010194351,0.7988009,0.00035618735,0.00025575442,0.0016669476,0.0000150961305,0.00023892339,0.03775805],"genre_scores_gemma":[0.7471268,0.0010273744,0.25159684,0.000076165605,0.000019981313,0.0000917712,7.222965e-7,0.000010376119,0.000049946397],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99865097,0.000017751647,0.00041929964,0.00032338608,0.00026635407,0.0003222502],"domain_scores_gemma":[0.9973764,0.0018377358,0.00024155968,0.00046311558,0.00003127917,0.000049916576],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000500269,0.00017933125,0.00027267152,0.00004315039,0.00017235037,0.000072580544,0.0008863863,0.00006519749,0.000008295067],"category_scores_gemma":[0.000058918286,0.00012420166,0.000041446965,0.00022842796,0.00035641485,0.0005750202,0.00011067659,0.00016628731,0.0000047049],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015701919,0.00004414621,0.00007447177,0.00012154049,0.0000061824344,0.0000015894565,0.00065847184,0.00033331112,0.000084238905,0.91568923,0.0000017219493,0.08296941],"study_design_scores_gemma":[0.00037452677,0.00007287657,0.00022085845,0.00006912009,0.000009720753,0.000009972646,0.00039638762,0.024718512,0.0008591655,0.9717832,0.0013036083,0.00018202982],"about_ca_topic_score_codex":0.0000011539681,"about_ca_topic_score_gemma":0.000020080593,"teacher_disagreement_score":0.596413,"about_ca_system_score_codex":0.000014697982,"about_ca_system_score_gemma":0.000029838468,"threshold_uncertainty_score":0.5064797},"labels":[],"label_agreement":null},{"id":"W1977358807","doi":"10.1016/j.aam.2012.03.004","title":"On minor-closed classes of matroids with exponential growth rate","year":2012,"lang":"en","type":"article","venue":"Advances in Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Combinatorics; Exponential function; Matroid; Base (topology); Integer (computer science); Minor (academic); Prime power; Exponential growth; Prime (order theory); Discrete mathematics; Mathematical analysis","score_opus":0.013725122250598564,"score_gpt":0.2805289442160489,"score_spread":0.2668038219654503,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1977358807","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.160908,0.00034743335,0.8154036,0.000036767473,0.00012722614,0.0005191675,0.0000033884037,0.000105876876,0.022548582],"genre_scores_gemma":[0.70819527,0.000049002258,0.29158062,0.000028319126,0.000023900244,0.00006636628,0.0000011600351,0.000019034926,0.00003633217],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99829704,0.000044522447,0.00038145023,0.00028175698,0.00046493954,0.0005303077],"domain_scores_gemma":[0.9980192,0.000934036,0.00022955908,0.00066253345,0.000051026804,0.00010360173],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00058859,0.00021843077,0.00034163182,0.00023867446,0.000053493193,0.000027353502,0.00082348,0.00005424203,0.000012847307],"category_scores_gemma":[0.00009169135,0.00017019376,0.000041813582,0.0006661364,0.00020058002,0.00060095766,0.00018318502,0.00020580985,0.000042465213],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007154402,0.00037461388,0.00036017588,0.00022799271,0.000008994686,0.0000045764054,0.0006463378,0.00021207966,0.004269148,0.9911517,0.000012440242,0.0026604056],"study_design_scores_gemma":[0.0012193671,0.00023455059,0.0005036057,0.00014102068,0.000009683022,0.000012333846,0.0003308613,0.001309189,0.08706839,0.9084948,0.00028569732,0.0003905346],"about_ca_topic_score_codex":6.5963974e-7,"about_ca_topic_score_gemma":0.0000034535797,"teacher_disagreement_score":0.5472873,"about_ca_system_score_codex":0.0000420519,"about_ca_system_score_gemma":0.000028412793,"threshold_uncertainty_score":0.69403},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.008061664681708791,"score_gpt":0.24596809812479858,"score_spread":0.2379064334430898,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1978671960","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2579498,0.00004876819,0.7358467,0.00004367164,0.000048856404,0.00035712295,0.00000543108,0.0001182564,0.005581429],"genre_scores_gemma":[0.7607043,0.000063152234,0.23908192,0.000023074896,0.000012929778,0.00006432531,0.000014710328,0.000011112703,0.00002448617],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998533,0.00002216968,0.0006779481,0.00025565625,0.00032553053,0.00018566441],"domain_scores_gemma":[0.99834454,0.00024281816,0.00053880323,0.0007823903,0.00004820408,0.000043244632],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037988258,0.0001478602,0.00037796283,0.00013538847,0.000045725727,0.000021018597,0.00082096906,0.000063900465,0.000013203466],"category_scores_gemma":[0.000063789696,0.00014392934,0.00004866942,0.0006174438,0.00011631154,0.0002649967,0.00015677785,0.00007737842,0.00003589915],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000011049855,0.00025502424,0.000076330034,0.00066982105,0.000005683913,6.5309075e-7,0.0010586871,0.00019650784,0.3171958,0.6637839,0.000001553568,0.016754922],"study_design_scores_gemma":[0.00040069604,0.00006553074,0.00023897276,0.00018858085,0.0000138233045,0.0000059684908,0.00010464541,0.5255126,0.35719004,0.11455805,0.0014906325,0.00023049142],"about_ca_topic_score_codex":0.0000046246064,"about_ca_topic_score_gemma":0.0000043505224,"teacher_disagreement_score":0.54922587,"about_ca_system_score_codex":0.000018335153,"about_ca_system_score_gemma":0.00004571101,"threshold_uncertainty_score":0.5869268},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.011469852445144015,"score_gpt":0.2527011517575469,"score_spread":0.24123129931240292,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1980283844","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005973414,0.000093349394,0.9812584,0.00027010147,0.00030030622,0.0004948617,0.0000068658983,0.000057918125,0.016920848],"genre_scores_gemma":[0.12422693,0.000004198009,0.8750547,0.00023170294,0.000051702635,0.00030036946,0.0000025266547,0.0000069522516,0.000120933386],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992053,0.000012462054,0.00023755767,0.00021011793,0.00014801986,0.0001865555],"domain_scores_gemma":[0.99899715,0.0006440773,0.000073946765,0.00021466712,0.000027496972,0.000042687512],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027119668,0.00010365494,0.0001331707,0.000060675065,0.00013542047,0.000058964797,0.00028024756,0.000023241326,0.000006197509],"category_scores_gemma":[0.000104221544,0.00007752402,0.000037765847,0.00032996165,0.000044245247,0.00014083167,0.00004651329,0.0000533665,0.000025752506],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002590276,0.000052866304,0.000006545235,0.000017470773,0.000004530794,3.4238056e-7,0.0005656685,0.0015016211,0.000115484945,0.8689011,0.00034512233,0.1284867],"study_design_scores_gemma":[0.0008758685,0.000095123316,0.00006730902,0.000033594068,0.000012560056,0.000026408148,0.00073311967,0.12891209,0.0036499088,0.7790708,0.08614548,0.0003777367],"about_ca_topic_score_codex":4.3849636e-7,"about_ca_topic_score_gemma":0.000008784126,"teacher_disagreement_score":0.12810896,"about_ca_system_score_codex":0.00003266413,"about_ca_system_score_gemma":0.00006260835,"threshold_uncertainty_score":0.31613377},"labels":[],"label_agreement":null},{"id":"W1980317314","doi":"10.1016/j.aam.2005.08.007","title":"Group actions and invariants in algebras of generic matrices","year":2006,"lang":"en","type":"article","venue":"Advances in Applied Mathematics","topic":"Advanced Topics in Algebra","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Subalgebra; Mathematics; Invariant (physics); Pure mathematics; Homogeneous; Group (periodic table); Division algebra; Dimension (graph theory); Field (mathematics); Base (topology); Algebra over a field; Discrete mathematics; Combinatorics; Mathematical analysis; Physics; Mathematical physics","score_opus":0.029010732898471264,"score_gpt":0.3068892880005777,"score_spread":0.2778785551021064,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1980317314","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8519645,0.0025076373,0.09704711,0.000047529924,0.00017466629,0.0010209581,0.000015147945,0.0001286856,0.047093783],"genre_scores_gemma":[0.53718203,0.00044331956,0.46215555,0.000014003147,0.000039950213,0.000081815975,0.0000033873691,0.000033898836,0.000046072357],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982586,0.000018962302,0.0008354994,0.0003076126,0.00026300136,0.00031635282],"domain_scores_gemma":[0.9981673,0.00097188936,0.0003986644,0.00040413713,0.000021148213,0.000036902537],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031687898,0.00023739558,0.00051396753,0.00029654658,0.00004213808,0.000015788515,0.00023866454,0.00011790142,0.000023596276],"category_scores_gemma":[0.00016464814,0.00023294185,0.00003564153,0.00061584334,0.0001517907,0.00024012032,0.00012248599,0.00022108426,0.0000059439944],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000678676,0.0003668236,0.0015346052,0.00066545204,0.000005015352,0.0000060479456,0.00027004164,0.00008804969,0.001769416,0.99285316,0.000022634991,0.00241198],"study_design_scores_gemma":[0.0006615,0.000018912115,0.0008010167,0.00012398501,0.000016956023,0.000011477222,0.0004350088,0.00031055213,0.0022502884,0.9946635,0.00048114208,0.00022565752],"about_ca_topic_score_codex":0.000010611256,"about_ca_topic_score_gemma":0.00031393574,"teacher_disagreement_score":0.36510843,"about_ca_system_score_codex":0.00007477198,"about_ca_system_score_gemma":0.000017366732,"threshold_uncertainty_score":0.94990927},"labels":[],"label_agreement":null},{"id":"W1981471007","doi":"10.1016/j.aam.2011.11.002","title":"Toward a language theoretic proof of the four color theorem","year":2011,"lang":"en","type":"article","venue":"Advances in Applied Mathematics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Statement (logic); Parsing; Binary tree; Word (group theory); Simple (philosophy); Parse tree","score_opus":0.018778643605686242,"score_gpt":0.2382150284497964,"score_spread":0.21943638484411015,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1981471007","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09477924,0.00087321526,0.7077821,0.00009063321,0.0003042747,0.0010059484,0.00000529092,0.00017439097,0.19498491],"genre_scores_gemma":[0.8368084,0.000019606787,0.16297495,0.00008812549,0.000011186732,0.00005401745,1.854125e-7,0.000011143953,0.000032397544],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990134,0.000028014378,0.0003145997,0.00020311009,0.00022262392,0.0002182419],"domain_scores_gemma":[0.9987144,0.00026377253,0.00022051443,0.00075612485,0.000017365941,0.000027832095],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046297384,0.00013886296,0.00022562996,0.000050035465,0.00003493428,0.00001554272,0.0013686079,0.000047063604,0.00002561142],"category_scores_gemma":[0.000071300594,0.000085123895,0.00005832217,0.00033955267,0.00020485923,0.00014241914,0.00033539016,0.000117286465,0.0000104262335],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005135773,0.00011236336,0.000029859204,0.00015763553,0.000003896769,0.0000035698208,0.012943404,0.000017312794,0.0005381197,0.9730682,0.0000053431872,0.013115198],"study_design_scores_gemma":[0.00022221328,0.00002706194,0.00006934282,0.00008406681,0.000006682035,0.000012959313,0.0014211988,0.0064490805,0.059226923,0.93227315,0.00008157637,0.00012573395],"about_ca_topic_score_codex":0.000001421186,"about_ca_topic_score_gemma":0.0000039081447,"teacher_disagreement_score":0.74202913,"about_ca_system_score_codex":0.000018441415,"about_ca_system_score_gemma":0.000025676118,"threshold_uncertainty_score":0.34712517},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Mathematics; Combinatorics; Partition (number theory); Bijection; Omega; Integer (computer science); Discrete mathematics","score_opus":0.026861890537246944,"score_gpt":0.30817511113929175,"score_spread":0.2813132206020448,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1981946205","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11398363,0.000249198,0.605055,0.00012434185,0.00012608367,0.0018886639,0.000017763723,0.00040196424,0.27815336],"genre_scores_gemma":[0.5862098,0.0004748811,0.41116133,0.000040993356,0.00006809417,0.0006864842,0.0000038462967,0.00007693792,0.0012776316],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974639,0.000026725773,0.0008335759,0.0004522666,0.0005939665,0.00062959397],"domain_scores_gemma":[0.99542034,0.003308752,0.00040578493,0.00064636464,0.00008207683,0.00013667574],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003411939,0.000459922,0.0009026787,0.00019840231,0.00017521752,0.000074439,0.00042748902,0.00011110995,0.00021824708],"category_scores_gemma":[0.00059406983,0.00034551343,0.0000869802,0.00064036716,0.0004442174,0.0004733254,0.00011067745,0.0003452057,0.00011566914],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018844822,0.0011382761,0.0008743321,0.00111797,0.00006217423,0.00006195004,0.0038693873,0.00047521255,0.00016949262,0.9904764,0.00018401812,0.0013823113],"study_design_scores_gemma":[0.0022546682,0.00007602043,0.000083028244,0.0004337168,0.00007099306,0.000039328625,0.0041478905,0.00080270664,0.0010137492,0.9902208,0.00038190084,0.00047524067],"about_ca_topic_score_codex":0.0000031348243,"about_ca_topic_score_gemma":0.00025717536,"teacher_disagreement_score":0.47222617,"about_ca_system_score_codex":0.00009475052,"about_ca_system_score_gemma":0.000041800708,"threshold_uncertainty_score":0.9998997},"labels":[],"label_agreement":null},{"id":"W1982842138","doi":"10.1016/j.aam.2014.02.002","title":"A geometric version of the Andrásfai–Erdős–Sós Theorem","year":2014,"lang":"en","type":"article","venue":"Advances in Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Office of Naval Research","keywords":"Mathematics; Combinatorics; Matroid; Integer (computer science); Rank (graph theory); Binary number; Discrete mathematics; Simple (philosophy); Graphic matroid; Affine transformation; Graph; Upper and lower bounds; Geometry; Arithmetic; Mathematical analysis","score_opus":0.00964440343855563,"score_gpt":0.2692203123829219,"score_spread":0.2595759089443663,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1982842138","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016137091,0.00036202985,0.93360436,0.00008230834,0.00017054971,0.00042068688,0.000001941645,0.00006747703,0.04915357],"genre_scores_gemma":[0.81801033,0.00009803245,0.18172677,0.00005005515,0.000016110469,0.000026971631,4.0507624e-7,0.000012857864,0.000058474892],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99843985,0.000055046752,0.00035585824,0.00028972534,0.0005335209,0.0003260207],"domain_scores_gemma":[0.9974132,0.0011751861,0.00022499998,0.0010890644,0.000047051508,0.00005045049],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00097083196,0.00015125069,0.00026693824,0.00027227376,0.00008882,0.000026677686,0.0017206136,0.00005519916,0.000009298698],"category_scores_gemma":[0.00038636534,0.000102231235,0.000067130546,0.0020728512,0.00023028019,0.00025693476,0.00059060816,0.00021774728,0.000033737735],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007841009,0.00008605768,0.00025006742,0.000120801546,0.000002789568,4.2452405e-7,0.00032052363,0.00072820624,0.00072440866,0.9558498,0.000016989565,0.04189204],"study_design_scores_gemma":[0.00046390053,0.0000411807,0.00019519101,0.00006517913,0.0000034063144,0.0000043176747,0.0001275174,0.010445919,0.014824229,0.97028416,0.0034007563,0.00014425008],"about_ca_topic_score_codex":5.135512e-7,"about_ca_topic_score_gemma":0.0000027570698,"teacher_disagreement_score":0.80187327,"about_ca_system_score_codex":0.000040665927,"about_ca_system_score_gemma":0.000023564924,"threshold_uncertainty_score":0.4168869},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.018564101112235377,"score_gpt":0.24585175278698648,"score_spread":0.2272876516747511,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1987700418","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03412473,0.0001621934,0.89813554,0.0004549976,0.0001685621,0.00031138424,0.0000019442973,0.00012301421,0.06651764],"genre_scores_gemma":[0.8708634,0.00002020059,0.12873839,0.0003092778,0.000016968314,0.000024368857,4.7901193e-7,0.000008949481,0.000018002054],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989883,0.0000301468,0.00030938868,0.0002031176,0.00026431083,0.00020474674],"domain_scores_gemma":[0.99776554,0.0012061009,0.00018331564,0.00080103305,0.000013497078,0.000030516896],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006775189,0.00013403164,0.00023586661,0.00006829154,0.00005704729,0.00002905322,0.0010153973,0.0000350411,0.000020107384],"category_scores_gemma":[0.0001118275,0.00008814909,0.00003763095,0.00033987046,0.00021155525,0.00009961376,0.00015802793,0.00013293058,0.000049439863],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000001744856,0.00009308869,0.000014018408,0.00006803259,0.000002473287,3.4761186e-7,0.000441056,0.00037059464,0.00016190718,0.98846024,0.000031667365,0.010354807],"study_design_scores_gemma":[0.0001548921,0.00003052729,0.00008529727,0.00007921184,0.0000023182167,0.0000018126653,0.000085944295,0.072652884,0.0023010394,0.9241037,0.0003996003,0.00010280471],"about_ca_topic_score_codex":0.0000011291812,"about_ca_topic_score_gemma":0.0000044904896,"teacher_disagreement_score":0.83673865,"about_ca_system_score_codex":0.00001750519,"about_ca_system_score_gemma":0.000010457921,"threshold_uncertainty_score":0.35946155},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.005931039444430894,"score_gpt":0.2574354021965067,"score_spread":0.25150436275207577,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1988228156","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005758447,0.00036977607,0.97613513,0.00030788282,0.00004021099,0.00022637688,9.2091193e-7,0.000026890282,0.022316987],"genre_scores_gemma":[0.112220585,0.00034493912,0.8873255,0.000044928263,0.000008907149,0.00003069521,3.3975374e-7,0.000003859927,0.000020213009],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999402,0.00001988527,0.00025477158,0.000098793746,0.00012427894,0.000100278776],"domain_scores_gemma":[0.99935794,0.0002921621,0.00010333279,0.00021992446,0.000010923073,0.000015699587],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007326022,0.00007897963,0.00017595163,0.000039817638,0.000043621334,0.000022555401,0.00029032235,0.000024669787,0.0000020685266],"category_scores_gemma":[0.000022598544,0.000050965933,0.000021948883,0.00019617857,0.00012144093,0.00034820315,0.000049776932,0.00006872164,0.0000019287472],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000151787835,0.000021552094,3.4783432e-7,0.00015726718,0.0000020960836,3.3659668e-7,0.004112577,0.000634822,0.00006666306,0.9555131,3.204563e-7,0.039475746],"study_design_scores_gemma":[0.000831709,0.00001546096,0.0000024938572,0.000032196007,0.0000041362464,0.000015553274,0.000533965,0.0054635503,0.008686088,0.9839314,0.00041897915,0.00006441941],"about_ca_topic_score_codex":7.313133e-7,"about_ca_topic_score_gemma":0.0000026403218,"teacher_disagreement_score":0.111644745,"about_ca_system_score_codex":0.000008420473,"about_ca_system_score_gemma":0.000011455218,"threshold_uncertainty_score":0.20783305},"labels":[],"label_agreement":null},{"id":"W1990958156","doi":"10.1016/j.aam.2009.11.016","title":"A continuous extension of a q-analogue of the 9-j symbols and its orthogonality","year":2010,"lang":"en","type":"article","venue":"Advances in Applied Mathematics","topic":"Mathematical functions and polynomials","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Orthogonality; Mathematics; Extension (predicate logic); Pure mathematics; Discrete mathematics; Algebra over a field; Combinatorics; Geometry; Computer science","score_opus":0.023715646196213337,"score_gpt":0.30565031011558275,"score_spread":0.2819346639193694,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1990958156","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9784553,0.000273911,0.0034444989,0.00006753354,0.00016640038,0.00084536185,0.000031606975,0.00002639789,0.016688999],"genre_scores_gemma":[0.93761116,0.00005727271,0.06212761,0.000021345608,0.000023765651,0.000045740377,8.7581833e-7,0.000020108797,0.00009211476],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984491,0.000026655893,0.00085968926,0.00019508557,0.00028132222,0.00018814295],"domain_scores_gemma":[0.9968648,0.0018841386,0.0005312725,0.00058581296,0.00008561545,0.00004836956],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008706773,0.00017626872,0.00063915015,0.00006660348,0.000047982645,0.000007474776,0.00024544666,0.000118656106,0.0000810586],"category_scores_gemma":[0.0014491576,0.00011384739,0.000090394344,0.00026122606,0.00020001021,0.000061683204,0.00013966113,0.00026103304,0.0000034557513],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013371294,0.0003089498,0.00030907796,0.0014005709,0.000012777791,4.227773e-7,0.0005310252,0.000003021134,0.028319368,0.9678977,0.00003260108,0.001171128],"study_design_scores_gemma":[0.000444341,0.000028287353,0.00038445415,0.00023162764,0.000074500305,0.00001786271,0.0003740623,0.0005350789,0.027967986,0.969254,0.0005281261,0.00015966543],"about_ca_topic_score_codex":0.000002140628,"about_ca_topic_score_gemma":0.000060376133,"teacher_disagreement_score":0.058683112,"about_ca_system_score_codex":0.0000069931843,"about_ca_system_score_gemma":0.000030015064,"threshold_uncertainty_score":0.4642562},"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,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","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","score_opus":0.042873541398642745,"score_gpt":0.32836460810091667,"score_spread":0.2854910667022739,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1993840779","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1788241,0.0011490644,0.7768483,0.00007083806,0.00042308492,0.0022012715,0.000030004563,0.00074668217,0.039706618],"genre_scores_gemma":[0.41482773,0.00012984233,0.58472836,0.000028590837,0.000016936712,0.00013389834,0.0000053587537,0.0000576962,0.00007159486],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99698526,0.00007422353,0.0011682512,0.00054754334,0.00056563027,0.0006591148],"domain_scores_gemma":[0.9957988,0.002423991,0.00057139667,0.00096030073,0.00006725407,0.00017825821],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010553317,0.00050185045,0.0012781919,0.0004265143,0.00015655841,0.00006416484,0.00037247172,0.00016991241,0.00007616242],"category_scores_gemma":[0.0015448197,0.00047639696,0.0001553997,0.0017243131,0.000323374,0.000252544,0.00013468237,0.00035595582,0.000027160604],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000040444957,0.00038198655,0.00067109364,0.000819892,0.00011639254,0.0000078231005,0.0007373891,0.00008776088,0.000046811947,0.9960579,0.000028040244,0.0010408396],"study_design_scores_gemma":[0.00090467505,0.000030725845,0.0000718946,0.00007690647,0.00040455032,0.000018180992,0.00092863425,0.0034096811,0.00047553287,0.99242014,0.0007507194,0.0005083522],"about_ca_topic_score_codex":0.0000013788272,"about_ca_topic_score_gemma":0.000046941168,"teacher_disagreement_score":0.23600362,"about_ca_system_score_codex":0.00015725408,"about_ca_system_score_gemma":0.000037977494,"threshold_uncertainty_score":0.9997688},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Mathematics; Polytope; Euler's formula; Combinatorics; Exponential function; Lattice (music); Generating function; Mathematical analysis","score_opus":0.02912029830388322,"score_gpt":0.34873519823527477,"score_spread":0.3196148999313915,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1994224388","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.038197316,0.00048758343,0.9081812,0.00005494986,0.0006982256,0.0028835947,0.00002928358,0.0005167664,0.048951086],"genre_scores_gemma":[0.26972628,0.00008795897,0.7290719,0.00008231832,0.00027760732,0.00032211185,0.0000127872945,0.00018763487,0.00023141093],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99604934,0.000017057206,0.0015698823,0.00058304326,0.0006288324,0.0011518225],"domain_scores_gemma":[0.988709,0.009217837,0.0007217265,0.0010258332,0.00012601733,0.00019958775],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0017850134,0.0006001499,0.0010058308,0.0003032046,0.00018973465,0.0000568271,0.0007309961,0.0002631701,0.00004670332],"category_scores_gemma":[0.0023964474,0.00057111355,0.00018813019,0.00061353284,0.0001456228,0.00041416514,0.00020261644,0.0003868264,0.000052199768],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000096582255,0.00063722,0.00004032585,0.0017562124,0.000025775395,0.000009144323,0.0010954536,0.00005248925,0.0009463894,0.9861106,0.00020587658,0.009023925],"study_design_scores_gemma":[0.0018896653,0.00010053292,0.0000099480385,0.00015877272,0.00006649363,0.000015745361,0.0012763907,0.0008197932,0.016907297,0.9606431,0.017468788,0.0006434705],"about_ca_topic_score_codex":0.0000015193207,"about_ca_topic_score_gemma":0.000076301796,"teacher_disagreement_score":0.23152895,"about_ca_system_score_codex":0.00027436978,"about_ca_system_score_gemma":0.0000526943,"threshold_uncertainty_score":0.999674},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.061165079594349865,"score_gpt":0.3159970725580246,"score_spread":0.25483199296367476,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1994554004","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05828266,0.0005880474,0.672953,0.00006513269,0.0019178202,0.009659134,0.00006857929,0.00092470547,0.25554088],"genre_scores_gemma":[0.276917,0.00012505119,0.7206579,0.00009354572,0.00014418596,0.0016982935,0.000008412644,0.00016134395,0.0001942921],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972969,0.000024113768,0.0010193393,0.0005091474,0.0004868355,0.0006636101],"domain_scores_gemma":[0.99584854,0.002582244,0.0004939048,0.00088502717,0.00006390733,0.00012637064],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007041961,0.00051188504,0.00092036877,0.00022870401,0.0001145784,0.000021500528,0.0005558753,0.00016129806,0.000090016394],"category_scores_gemma":[0.0008715629,0.00044704427,0.00016076029,0.0003343665,0.00011096416,0.00015014086,0.000090239046,0.0002647425,0.0000751451],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003523632,0.0012270239,0.000020525727,0.0011483653,0.000036900932,0.000007570562,0.0035979853,0.000029106995,0.00027060285,0.9892554,0.00018032295,0.0038737762],"study_design_scores_gemma":[0.0039955825,0.00023222501,0.000004038846,0.00024238303,0.00007255105,0.0000072625617,0.00095774047,0.00042561637,0.007866955,0.9824046,0.0032816404,0.0005093948],"about_ca_topic_score_codex":0.0000011293115,"about_ca_topic_score_gemma":0.000015886986,"teacher_disagreement_score":0.2553466,"about_ca_system_score_codex":0.00016469652,"about_ca_system_score_gemma":0.0000326929,"threshold_uncertainty_score":0.9997981},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.01829946448890567,"score_gpt":0.28858647671331206,"score_spread":0.2702870122244064,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1999202617","genre_codex":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7349023,0.005386042,0.17847766,0.0007878701,0.0046826475,0.0067739827,0.000030031137,0.0012309102,0.06772856],"genre_scores_gemma":[0.46733373,0.0004766668,0.5316169,0.000060338127,0.0002194971,0.00015901208,0.000004842557,0.000087128414,0.000041830615],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974042,0.00008820428,0.0009088227,0.00044694153,0.0006350491,0.000516767],"domain_scores_gemma":[0.99422973,0.004086137,0.00055518857,0.00088090904,0.0001266383,0.00012136548],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0022729207,0.00045591165,0.00077929295,0.0001293958,0.00022992335,0.00009910408,0.0005688354,0.00026487725,0.000023115104],"category_scores_gemma":[0.0029010987,0.00032916732,0.00006688036,0.000567425,0.00069202157,0.00033481122,0.00019264803,0.0009852978,0.00002524047],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001232644,0.00023614301,0.00012235486,0.00048630347,0.000021569162,0.000009091777,0.0016179302,0.000011125459,0.0017124325,0.9811043,0.000044868437,0.014510601],"study_design_scores_gemma":[0.0022409311,0.000032652053,0.000037500617,0.00020029212,0.00006350679,0.00012425346,0.0008438099,0.0025832008,0.0013799664,0.9910073,0.0010745956,0.0004119456],"about_ca_topic_score_codex":0.000010043239,"about_ca_topic_score_gemma":0.00017065114,"teacher_disagreement_score":0.35313928,"about_ca_system_score_codex":0.00007396512,"about_ca_system_score_gemma":0.00006737406,"threshold_uncertainty_score":0.999916},"labels":[],"label_agreement":null},{"id":"W2005683145","doi":"10.1016/j.aam.2010.04.001","title":"An asymptotic version of a theorem of Knuth","year":2010,"lang":"en","type":"article","venue":"Advances in Applied Mathematics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Calculus (dental); Discrete mathematics; Combinatorics","score_opus":0.010258349416848844,"score_gpt":0.3053048232980565,"score_spread":0.2950464738812077,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2005683145","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8620014,0.00010155115,0.08642355,0.000012706067,0.00067455956,0.001221769,0.000026117552,0.00017830612,0.049359992],"genre_scores_gemma":[0.6076584,0.000026597496,0.3921883,0.000004143543,0.00003276213,0.000028459504,0.0000025924571,0.000046851666,0.00001190699],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975924,0.000027032751,0.0011540407,0.00030920203,0.0005691603,0.0003481818],"domain_scores_gemma":[0.99579847,0.0018293557,0.00094230607,0.0012037028,0.00012934794,0.00009682248],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00080640713,0.0003159538,0.0008584858,0.00022606668,0.000041112493,0.000009478135,0.00071437936,0.00019806842,0.00007667545],"category_scores_gemma":[0.0009209556,0.00028447865,0.00010051882,0.0004871267,0.00033738202,0.00026416325,0.00012232395,0.0004045422,0.000012978634],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000040814655,0.0010980115,0.0001393622,0.0014128531,0.000011650709,0.0000015912312,0.0014164426,0.00007030758,0.0420708,0.9520208,0.000010293555,0.0017070605],"study_design_scores_gemma":[0.0009134899,0.00012215214,0.000018287892,0.0001852676,0.00004362767,0.0000064136057,0.0010474819,0.0010866966,0.07303296,0.92313653,0.00015613974,0.00025093637],"about_ca_topic_score_codex":0.0000010207667,"about_ca_topic_score_gemma":0.000015107498,"teacher_disagreement_score":0.30576476,"about_ca_system_score_codex":0.00003688768,"about_ca_system_score_gemma":0.00005313984,"threshold_uncertainty_score":0.9999607},"labels":[],"label_agreement":null},{"id":"W2007646040","doi":"10.1016/j.aam.2011.01.002","title":"The primitives and antipode in the Hopf algebra of symmetric functions in noncommuting variables","year":2011,"lang":"en","type":"preprint","venue":"Advances in Applied Mathematics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Saint Mary's University","funders":"","keywords":"Algebra over a field; Hopf algebra; Mathematics; Pure mathematics","score_opus":0.035611364965840026,"score_gpt":0.3075497248901205,"score_spread":0.2719383599242805,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2007646040","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.528085,0.022424905,0.1466002,0.00042734115,0.0027132337,0.015227511,0.00012254552,0.00042691024,0.28397238],"genre_scores_gemma":[0.79972184,0.0029089998,0.19641337,0.000019161038,0.000068220375,0.0007254508,0.0000069667312,0.000104320054,0.0000316996],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.996009,0.00019849841,0.001986182,0.00056012534,0.00060892623,0.00063728925],"domain_scores_gemma":[0.9833546,0.013512878,0.001456731,0.0015448774,0.00008240102,0.000048487236],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0028046207,0.000613038,0.0012736344,0.0005514169,0.00016172169,0.0000802693,0.0013915292,0.0003795471,0.0000045285897],"category_scores_gemma":[0.002970919,0.00041992465,0.000114215414,0.0012215424,0.0004561672,0.0001654259,0.0011402249,0.0015817421,0.0000034589834],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028880364,0.00073102565,0.00038315356,0.0028584232,0.00002847379,0.000007861717,0.008072738,0.00020013434,0.00003442698,0.9842174,0.0000116460415,0.003425805],"study_design_scores_gemma":[0.0007520636,0.00003832741,0.00015121099,0.0013829198,0.00007472912,0.000014208017,0.007957462,0.0012800633,0.0002838365,0.9875257,0.00013495318,0.00040452252],"about_ca_topic_score_codex":0.000018290837,"about_ca_topic_score_gemma":0.00024413795,"teacher_disagreement_score":0.28394067,"about_ca_system_score_codex":0.00016439137,"about_ca_system_score_gemma":0.0001168452,"threshold_uncertainty_score":0.99982524},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.014953696154901476,"score_gpt":0.2972277372576925,"score_spread":0.28227404110279103,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2013194786","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.079179354,0.00016797979,0.77954143,0.00006694749,0.0010687208,0.0011185814,0.00005489136,0.00024511837,0.13855699],"genre_scores_gemma":[0.50614744,0.000045598168,0.4933053,0.00006963087,0.00008061745,0.000090542584,0.000007656201,0.000059700556,0.0001935217],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980475,0.0000063628977,0.0005966515,0.0003783233,0.00047367968,0.0004975307],"domain_scores_gemma":[0.99686605,0.002171278,0.0002616119,0.0005408685,0.000058051715,0.0001021564],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005968933,0.00030047394,0.00047641332,0.00009733458,0.00012055907,0.000054029573,0.00039835658,0.00014975945,0.000097883145],"category_scores_gemma":[0.0010577046,0.00026408775,0.000044592132,0.00034348827,0.00008835608,0.00011720437,0.00009892908,0.00055858376,0.00012944832],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017424556,0.00029710334,0.00001350915,0.00062196644,0.0000067062974,0.000008882689,0.00036718487,0.00007792836,0.0027529355,0.9925094,0.00011703936,0.0032098761],"study_design_scores_gemma":[0.0005280338,0.000044492986,0.00000320448,0.0001388223,0.000025427149,0.000007012661,0.0006222446,0.012452338,0.0053150347,0.97697455,0.0035643838,0.00032444537],"about_ca_topic_score_codex":0.0000020864381,"about_ca_topic_score_gemma":0.000051375624,"teacher_disagreement_score":0.42696807,"about_ca_system_score_codex":0.000037916823,"about_ca_system_score_gemma":0.0000401649,"threshold_uncertainty_score":0.9999811},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.00893912167333614,"score_gpt":0.2256887496741622,"score_spread":0.21674962800082606,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2014803743","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03380158,0.0006613043,0.9581499,0.00020420774,0.00038650964,0.00029950432,0.000004882641,0.0003895911,0.0061024805],"genre_scores_gemma":[0.39503887,0.000087926266,0.60441023,0.00036820082,0.000011165787,0.00004731239,0.000004745236,0.000014640059,0.000016897262],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983953,0.000028037215,0.00046323336,0.0004543519,0.00032907826,0.00032998176],"domain_scores_gemma":[0.9981295,0.0007425189,0.00019935242,0.0008104658,0.000027459679,0.000090744106],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005057721,0.00020994271,0.00034522792,0.0001699133,0.00008847297,0.000096714015,0.0008115598,0.00007933564,0.000011412316],"category_scores_gemma":[0.00006527696,0.00015805433,0.000054591008,0.00040839013,0.00009253907,0.00022651194,0.00017427186,0.00017623369,0.000069276764],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003845246,0.00018950705,0.00021907537,0.000078841025,0.0000069574676,0.0000021956046,0.0011980274,0.00033329535,0.0017388216,0.98549414,0.00005457088,0.01068073],"study_design_scores_gemma":[0.0006065942,0.000028040095,0.000016347247,0.00010016447,0.000006815784,0.0000010580942,0.000062863575,0.03402706,0.0015387344,0.96043694,0.0029392384,0.00023617003],"about_ca_topic_score_codex":0.00001711,"about_ca_topic_score_gemma":0.000053164276,"teacher_disagreement_score":0.36123732,"about_ca_system_score_codex":0.000014549216,"about_ca_system_score_gemma":0.0000093997505,"threshold_uncertainty_score":0.64452684},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Brandeis University","keywords":"Mathematics; Combinatorics; Bijection; Permutation (music); Singleton; Permutation matrix; Discrete mathematics; Physics","score_opus":0.026874521714820385,"score_gpt":0.32614465305262974,"score_spread":0.29927013133780933,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2015106956","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029040068,0.000865897,0.87814885,0.000108475404,0.00081536884,0.0029707793,0.000028231594,0.0006707883,0.08735152],"genre_scores_gemma":[0.2663276,0.000077332705,0.73210347,0.000038201415,0.00027337467,0.0006083522,0.000009885221,0.0001339511,0.00042783355],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9969904,0.000017997907,0.0011920197,0.00053166517,0.00052219356,0.0007457367],"domain_scores_gemma":[0.9945118,0.0038662464,0.00062011206,0.0008188198,0.00010583728,0.000077201614],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005796907,0.00048799434,0.0008179432,0.00019494288,0.00014626337,0.000060182072,0.00059093855,0.0001942181,0.000020197165],"category_scores_gemma":[0.0009355815,0.0004712201,0.00014144459,0.0004915816,0.00018098384,0.0003346481,0.00012861012,0.00025439277,0.00003028047],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028180337,0.00068725325,0.00005108174,0.0017009481,0.000007718404,0.000003954337,0.00022149658,0.00028706642,0.0016059261,0.9929934,0.0003868447,0.002026117],"study_design_scores_gemma":[0.0012480345,0.000069050126,0.0000064750375,0.0002561317,0.000045870926,0.000010470681,0.00036197735,0.0011616222,0.0077588614,0.97965,0.008902874,0.0005286227],"about_ca_topic_score_codex":0.0000017606657,"about_ca_topic_score_gemma":0.000037192298,"teacher_disagreement_score":0.23728752,"about_ca_system_score_codex":0.00022167359,"about_ca_system_score_gemma":0.000054628537,"threshold_uncertainty_score":0.999774},"labels":[],"label_agreement":null},{"id":"W2015119735","doi":"10.1016/j.aam.2013.10.001","title":"Dominating circuits in regular matroids","year":2013,"lang":"en","type":"article","venue":"Advances in Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Thompson Rivers University","funders":"","keywords":"Matroid; Mathematics; Combinatorics; Vertex (graph theory); Disjoint sets; Simple graph; Graphic matroid; Graph; Matroid partitioning; Discrete mathematics; Connectivity","score_opus":0.011976984798428804,"score_gpt":0.2799651368871039,"score_spread":0.2679881520886751,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2015119735","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0508067,0.00087297504,0.8951569,0.00015168425,0.00011047775,0.0011343374,7.418153e-7,0.00018261356,0.051583566],"genre_scores_gemma":[0.5849633,0.0000936887,0.4144722,0.000050938426,0.000015218042,0.00030176647,6.226326e-7,0.000019041254,0.00008320281],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980363,0.000034155742,0.00052035623,0.00042658445,0.00040964372,0.000572924],"domain_scores_gemma":[0.99830693,0.00064103404,0.00014695791,0.00078650774,0.000040090978,0.000078505385],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006868228,0.00019773135,0.00031754532,0.00034344854,0.000056299956,0.000096854004,0.0012181696,0.00007053721,0.000024828623],"category_scores_gemma":[0.00017163165,0.00018814768,0.000036416626,0.0010874964,0.00011545813,0.0008973396,0.00035226045,0.0003125043,0.00019670819],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000001112457,0.00010148218,0.00025643513,0.00013975952,0.0000016704067,0.000009804688,0.0011231584,0.0006542442,0.0038210177,0.87793785,0.000009870361,0.115943566],"study_design_scores_gemma":[0.00048838125,0.000019036946,0.000216551,0.00010794618,7.776087e-7,0.000009457983,0.00060058216,0.02070641,0.003443982,0.9739599,0.00021532919,0.00023160843],"about_ca_topic_score_codex":0.0000027276858,"about_ca_topic_score_gemma":0.000011256847,"teacher_disagreement_score":0.5341566,"about_ca_system_score_codex":0.0001019572,"about_ca_system_score_gemma":0.000027172302,"threshold_uncertainty_score":0.767244},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.0172206554813567,"score_gpt":0.28499515692667343,"score_spread":0.2677745014453167,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2021000796","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0025404152,0.00049462717,0.94768065,0.000035490328,0.00013133974,0.0008840877,0.000011613109,0.000121494275,0.048100263],"genre_scores_gemma":[0.21782112,0.00008275996,0.7811361,0.00007246851,0.000031397372,0.0005451367,0.0000020349207,0.0000164454,0.00029255825],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985633,0.000033181284,0.0004597718,0.00039331312,0.00019539834,0.00035501772],"domain_scores_gemma":[0.9975597,0.0015447924,0.00027670164,0.0004988432,0.000057203895,0.00006273443],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065582315,0.0002237512,0.00032819476,0.00010922207,0.00010976802,0.0000688503,0.0006565485,0.0000633185,0.000010357913],"category_scores_gemma":[0.0002810964,0.00019497695,0.000060021914,0.0003866357,0.00008754328,0.0004011308,0.000109276254,0.0001157966,0.000029961444],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000068162985,0.00013650183,0.000009493282,0.00026069678,0.00000696072,0.0000012673887,0.0038264163,0.00038820383,0.00011326936,0.98775613,0.0000073584843,0.0074869087],"study_design_scores_gemma":[0.00070065446,0.000056556357,0.0000063860184,0.000052843865,0.0000067001033,0.0000057698508,0.001658802,0.015999312,0.011989279,0.9613975,0.00780049,0.00032569392],"about_ca_topic_score_codex":5.9327414e-7,"about_ca_topic_score_gemma":0.0000048424395,"teacher_disagreement_score":0.21528071,"about_ca_system_score_codex":0.000047601374,"about_ca_system_score_gemma":0.00004368358,"threshold_uncertainty_score":0.79509294},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"","keywords":"Mathematics; Abelian group; Constant (computer programming); Pure mathematics; Combinatorics; Computer science","score_opus":0.013277789470530175,"score_gpt":0.25981982579151397,"score_spread":0.2465420363209838,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2022357851","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.056255925,0.0003295632,0.8668379,0.00021431826,0.0005392327,0.00051382114,0.000007139243,0.00039143325,0.07491067],"genre_scores_gemma":[0.46355897,0.000037391714,0.53624,0.00008458962,0.000021912965,0.000034272216,0.0000014878215,0.0000095228115,0.000011867371],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99885446,0.000008145204,0.00028242156,0.000303603,0.0002565056,0.00029486028],"domain_scores_gemma":[0.99884194,0.00022962411,0.00014742932,0.0006872864,0.000020361986,0.00007334867],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032634492,0.00017472699,0.0002444078,0.00008002068,0.00006990949,0.00007421972,0.0007677258,0.000047665668,0.000024845362],"category_scores_gemma":[0.000022455491,0.00013094136,0.000023053926,0.00036946873,0.00023985526,0.00023805484,0.00015949315,0.00029562012,0.000043860342],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005073933,0.0001346843,0.00006723715,0.00006677052,0.0000026111368,0.0000062355903,0.000610526,0.000012802885,0.00064003404,0.95021796,0.000018299781,0.04821778],"study_design_scores_gemma":[0.000586358,0.00005627226,0.00013749937,0.000110806766,0.0000047949734,0.000039469684,0.0003339402,0.018858543,0.0022800278,0.9706246,0.006611752,0.0003559026],"about_ca_topic_score_codex":0.0000014781867,"about_ca_topic_score_gemma":0.00011888408,"teacher_disagreement_score":0.40730307,"about_ca_system_score_codex":0.000019586421,"about_ca_system_score_gemma":0.000034813747,"threshold_uncertainty_score":0.5339634},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.04878537635750659,"score_gpt":0.35769872219497423,"score_spread":0.30891334583746766,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2029396671","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1913745,0.01161879,0.6624359,0.00027348907,0.0033690564,0.0056224945,0.00019955884,0.0014375912,0.12366862],"genre_scores_gemma":[0.21914765,0.00038654407,0.77867687,0.00005280223,0.00034847774,0.00029986625,0.000021495187,0.0001143017,0.0009520193],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971905,0.000026924596,0.0010318037,0.00039834596,0.00049325207,0.00085920194],"domain_scores_gemma":[0.99414164,0.0044349506,0.00049351325,0.0006678999,0.00010232258,0.00015966366],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00074830913,0.00046847799,0.00090721546,0.00014709098,0.0001875996,0.00009073052,0.0004976894,0.00018520151,0.00011258827],"category_scores_gemma":[0.001957582,0.00042049846,0.00012028212,0.00033764713,0.00033744358,0.0012245964,0.00013051486,0.00025821547,0.000082176215],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000042711377,0.00041596405,0.0003564657,0.0012244842,0.000040910865,0.0000015436866,0.0038905742,0.00003562686,0.0014215199,0.9910184,0.0004196627,0.0011321508],"study_design_scores_gemma":[0.000503156,0.000041441413,0.000018586947,0.00026747573,0.00010073262,0.0000061262876,0.0063817827,0.00023430637,0.013295572,0.97479564,0.003854431,0.00050074887],"about_ca_topic_score_codex":0.0000041583253,"about_ca_topic_score_gemma":0.000050714323,"teacher_disagreement_score":0.1227166,"about_ca_system_score_codex":0.00011707102,"about_ca_system_score_gemma":0.00003596348,"threshold_uncertainty_score":0.9998247},"labels":[],"label_agreement":null},{"id":"W2040923100","doi":"10.1016/j.aam.2013.04.001","title":"Identities for the Ramanujan zeta function","year":2013,"lang":"en","type":"article","venue":"Advances in Applied Mathematics","topic":"Advanced Mathematical Identities","field":"Mathematics","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Ramanujan's sum; Mathematics; Riemann zeta function; Hypergeometric function; Ramanujan tau function; Pure mathematics; Hypergeometric distribution; Arithmetic zeta function; Algebraic number; Combinatorics; Algebra over a field; Mathematical analysis","score_opus":0.03046188669035829,"score_gpt":0.3147266089888871,"score_spread":0.28426472229852884,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2040923100","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007792787,0.0017211236,0.9269656,0.00031697867,0.00066354807,0.0048403693,0.000013904779,0.0004174755,0.057268236],"genre_scores_gemma":[0.27911896,0.0008715476,0.69557846,0.00034393623,0.00047186654,0.008328889,0.000014637758,0.0002635834,0.015008109],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99778444,0.000016026554,0.00086359313,0.00034030536,0.0004453004,0.00055031816],"domain_scores_gemma":[0.9931276,0.005575188,0.00036009014,0.0007604745,0.00010824008,0.00006842445],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00055974757,0.0003495173,0.0005275142,0.00013313295,0.00023986606,0.00016890152,0.000565572,0.00011472557,0.00029926354],"category_scores_gemma":[0.0009410854,0.00024712892,0.00014389363,0.000280782,0.00028021846,0.0006578237,0.00015139788,0.00024762726,0.00024124827],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012052382,0.00016550817,0.000014410192,0.0011045818,0.000028610351,5.047586e-7,0.0007891457,0.000094278075,0.0002475282,0.99131286,0.0024441038,0.003786418],"study_design_scores_gemma":[0.0005591325,0.00003562281,0.00002602294,0.00009759965,0.00008754001,0.0000066952985,0.004705766,0.0023268529,0.00070456474,0.9879649,0.0031848985,0.00030039254],"about_ca_topic_score_codex":0.0000037114414,"about_ca_topic_score_gemma":0.000047891375,"teacher_disagreement_score":0.27132618,"about_ca_system_score_codex":0.00008646645,"about_ca_system_score_gemma":0.000020930203,"threshold_uncertainty_score":0.9999981},"labels":[],"label_agreement":null},{"id":"W2043355169","doi":"10.1016/j.aam.2010.01.010","title":"Scale invariant operators and combinatorial expansions","year":2010,"lang":"en","type":"article","venue":"Advances in Applied Mathematics","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Mathematics; Invariant (physics); Scale invariance; Scale (ratio); Pure mathematics; Algebra over a field; Mathematical physics; Statistics; Geography","score_opus":0.007211120988040579,"score_gpt":0.24510176232807018,"score_spread":0.2378906413400296,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2043355169","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2579689,0.0003536224,0.7058161,0.00030526525,0.0020506587,0.00071852625,0.0000030148808,0.00032861516,0.032455303],"genre_scores_gemma":[0.61230063,0.000065454115,0.3874402,0.00008981952,0.000042950163,0.000040220202,6.068866e-7,0.000008167037,0.000011932151],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99903893,0.0000075352764,0.00025068116,0.0002983096,0.00016603687,0.00023850979],"domain_scores_gemma":[0.9991363,0.0002325842,0.00007566821,0.0004491744,0.000017482058,0.000088749315],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019814218,0.00014634403,0.00021438277,0.00007082934,0.000105394865,0.000065133245,0.0004768976,0.00007467997,0.000009001491],"category_scores_gemma":[0.00006038325,0.00010861773,0.000022259592,0.0002804349,0.00010951128,0.00038437976,0.0002510578,0.00027639852,0.000020863692],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000014654444,0.00009222541,0.000120066536,0.000025702879,0.0000012528184,0.0000041117482,0.0006814454,0.000021371108,0.0036463405,0.9798263,0.000007983743,0.015571754],"study_design_scores_gemma":[0.0005649661,0.000026142447,0.00011911858,0.000018384897,0.0000033136914,0.000018400246,0.00019380217,0.0032042647,0.005010743,0.98727524,0.0033335262,0.00023208189],"about_ca_topic_score_codex":7.5994905e-7,"about_ca_topic_score_gemma":0.000025595657,"teacher_disagreement_score":0.35433173,"about_ca_system_score_codex":0.000010177783,"about_ca_system_score_gemma":0.00002595886,"threshold_uncertainty_score":0.44293025},"labels":[],"label_agreement":null},{"id":"W2043411243","doi":"10.1016/j.aam.2004.04.001","title":"Even permutations and oriented sets: their shifted asymmetry index series","year":2004,"lang":"en","type":"article","venue":"Advances in Applied Mathematics","topic":"Chemistry and Stereochemistry Studies","field":"Chemistry","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Mathematics; Permutation (music); Combinatorics; Series (stratigraphy); Vertex (graph theory); Enumeration; Modulo; Cyclic permutation; Asymmetry; Discrete mathematics; Symmetric group; Graph","score_opus":0.007304862717518181,"score_gpt":0.2459072126545531,"score_spread":0.2386023499370349,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2043411243","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8570148,0.0016877843,0.002882086,0.00018932564,0.000045283185,0.00016290529,0.00009949308,0.00019663073,0.13772173],"genre_scores_gemma":[0.9857678,0.00040064106,0.0133176325,0.00003110565,0.000044727647,0.00010184968,0.00004903578,0.00002631136,0.00026089838],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99884707,0.000002143012,0.0003794966,0.00031901686,0.0001734492,0.0002788181],"domain_scores_gemma":[0.9992536,0.00017968222,0.0001451833,0.00032242903,0.000030631967,0.00006850911],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000072288036,0.00027304885,0.0003282886,0.00003171862,0.00013638467,0.000028426703,0.00016304005,0.0001271937,0.00004914903],"category_scores_gemma":[0.00012189745,0.0002506464,0.000039905495,0.00021536603,0.00021332287,0.00014982575,0.000121913734,0.00024699466,0.0000054775974],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006741354,0.003697537,0.024449203,0.024625028,0.00068071025,0.00019669994,0.0584669,0.00237816,0.46659702,0.38206926,0.00020287742,0.03596249],"study_design_scores_gemma":[0.0030959796,0.000022702729,0.00033736558,0.0006183525,0.000059701724,0.00013785217,0.034218114,0.00023235973,0.5220074,0.43022317,0.008047817,0.0009991971],"about_ca_topic_score_codex":0.0000016852476,"about_ca_topic_score_gemma":0.000017825332,"teacher_disagreement_score":0.13746084,"about_ca_system_score_codex":0.00008806201,"about_ca_system_score_gemma":0.0000325883,"threshold_uncertainty_score":0.9999946},"labels":[],"label_agreement":null},{"id":"W2043514463","doi":"10.1016/j.aam.2005.03.006","title":"Counting unrooted maps on the plane","year":2005,"lang":"en","type":"article","venue":"Advances in Applied Mathematics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Mathematics; Planar graph; Combinatorics; Embedding; Dual polyhedron; Planar; Plane (geometry); Separable space; Geometry; Graph; Mathematical analysis","score_opus":0.01954950902446868,"score_gpt":0.2824597931664688,"score_spread":0.26291028414200013,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2043514463","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2712713,0.00082500605,0.009016029,0.0009576544,0.0005070541,0.00168583,0.00003740383,0.0004347618,0.715265],"genre_scores_gemma":[0.89620614,0.00012892016,0.102385625,0.00065388106,0.00022672773,0.00008645606,0.0000045123465,0.0000568676,0.00025084603],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984226,0.00002660537,0.0005256039,0.0002539444,0.0003936045,0.00037760285],"domain_scores_gemma":[0.9962564,0.0027809662,0.00025351744,0.0006464149,0.000021421838,0.000041259307],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00075025513,0.0002663716,0.00033521687,0.0000970815,0.00024257487,0.000034008226,0.0004922306,0.0001054006,0.00011991069],"category_scores_gemma":[0.00039175097,0.00016727345,0.000062788065,0.00025253152,0.00015536991,0.00008769919,0.00011409986,0.00039047594,0.000059489055],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018259087,0.00011107468,0.000033891014,0.00013323034,0.00001113754,0.0000024023284,0.0014408978,0.00015159167,0.00008508096,0.99097854,0.0006872076,0.0063466607],"study_design_scores_gemma":[0.0003446234,0.000018007817,0.000015659616,0.00010551609,0.000015840647,0.000009113137,0.0007239286,0.00048570597,0.0017851894,0.9696849,0.026585154,0.00022637151],"about_ca_topic_score_codex":4.4449905e-7,"about_ca_topic_score_gemma":0.000021908822,"teacher_disagreement_score":0.7150141,"about_ca_system_score_codex":0.000059242888,"about_ca_system_score_gemma":0.000011890682,"threshold_uncertainty_score":0.68212134},"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,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.01707435351452438,"score_gpt":0.2903438337929929,"score_spread":0.27326948027846854,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2044750531","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005991337,0.00068953534,0.47406104,0.00019274782,0.0008762347,0.0014764984,0.000038952607,0.00039725882,0.5162764],"genre_scores_gemma":[0.025648566,0.00020247055,0.97114515,0.00015252434,0.00010324226,0.00031269272,0.00000614173,0.00009766967,0.0023315162],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99748254,0.000047506957,0.0010165812,0.0004244548,0.0004274681,0.000601457],"domain_scores_gemma":[0.9964978,0.0022236563,0.00030044158,0.0007789369,0.000047698195,0.0001514621],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0010026537,0.0004043368,0.00074477465,0.00018895614,0.00012841223,0.00006313217,0.00033226848,0.00018036213,0.0014661244],"category_scores_gemma":[0.0009227064,0.00029022357,0.00013019587,0.00034083502,0.00013447356,0.00020831378,0.00006702392,0.00030172328,0.00020847273],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000048828974,0.00048277614,0.000046318095,0.00046286022,0.000019421648,0.00000539467,0.0008427021,0.000009292209,0.00012382069,0.988335,0.0014642621,0.0082032345],"study_design_scores_gemma":[0.000515435,0.000021627717,0.0000017068196,0.000097064476,0.000036083686,0.00001650428,0.000821957,0.00043340964,0.0035255044,0.9120112,0.08213358,0.00038588964],"about_ca_topic_score_codex":0.0000032344308,"about_ca_topic_score_gemma":0.000036380454,"teacher_disagreement_score":0.51394486,"about_ca_system_score_codex":0.00008449979,"about_ca_system_score_gemma":0.000044142726,"threshold_uncertainty_score":0.999955},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.016446101733077353,"score_gpt":0.2854864843370331,"score_spread":0.26904038260395574,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2049415597","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.68204385,0.0006610457,0.080064125,0.00027043576,0.00007749627,0.0019491875,0.000008046476,0.00012460536,0.23480123],"genre_scores_gemma":[0.9734701,0.0002238694,0.026058024,0.000067868226,0.000011657659,0.000058573245,0.0000013331471,0.000042186897,0.000066410226],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99774784,0.0000873697,0.0009814252,0.00034713777,0.00040332275,0.00043290708],"domain_scores_gemma":[0.99037296,0.008473379,0.000437119,0.00064186,0.000028242775,0.00004641685],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015971576,0.00034995016,0.00071755593,0.00016390938,0.00006245916,0.000018889237,0.00043300987,0.0001377216,0.000018975301],"category_scores_gemma":[0.0010164718,0.0002451163,0.00007294707,0.00062582054,0.00032500274,0.00016557505,0.000053227766,0.0005798333,0.000009061529],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007338256,0.00051390735,0.000005225497,0.00025521344,0.000011508081,0.0000042929883,0.0023533483,0.000998912,0.0003392264,0.9934861,0.000008210194,0.0019506963],"study_design_scores_gemma":[0.0004830287,0.00013219229,0.00006318624,0.00045835332,0.000025770129,0.000005296194,0.0006481878,0.055000454,0.00063461164,0.94230026,0.0000016542381,0.00024699827],"about_ca_topic_score_codex":3.8924176e-7,"about_ca_topic_score_gemma":0.0000043102687,"teacher_disagreement_score":0.29142624,"about_ca_system_score_codex":0.00008789076,"about_ca_system_score_gemma":0.000022656091,"threshold_uncertainty_score":0.99955523},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Mathematics; Random walk; Hyperplane; Combinatorics; Eigenvalues and eigenvectors; Mathematical proof; Discrete mathematics; Pure mathematics; Geometry","score_opus":0.044715699367937775,"score_gpt":0.30683978753958907,"score_spread":0.2621240881716513,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2051669952","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06835142,0.0005724363,0.6972597,0.00005584854,0.0016714875,0.008463901,0.00005339369,0.00093138136,0.22264042],"genre_scores_gemma":[0.36001176,0.00009047844,0.6382192,0.00007683138,0.00013777707,0.00085938623,0.000006952672,0.00020968543,0.0003879667],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9969561,0.000031437405,0.0011527849,0.00058595114,0.00052579254,0.0007479292],"domain_scores_gemma":[0.99510735,0.0030092704,0.0005732687,0.0010718422,0.000086502405,0.00015176323],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008280693,0.0005918861,0.001080521,0.00026542848,0.00014477022,0.000029551653,0.0006548663,0.00022590367,0.00012272451],"category_scores_gemma":[0.0013273553,0.00052229536,0.00021161631,0.00032571072,0.00016786848,0.00021692974,0.00008639078,0.00031743973,0.00006649857],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031042704,0.0010036731,0.000019225388,0.001209505,0.000038184004,0.000007164751,0.004591528,0.000033657558,0.00044091232,0.990611,0.00016028978,0.0015744076],"study_design_scores_gemma":[0.0040120427,0.00020112006,0.0000043792834,0.00025057315,0.00007939627,0.000011199493,0.00087609916,0.00043829205,0.025104677,0.96508193,0.0033618957,0.000578415],"about_ca_topic_score_codex":8.4787723e-7,"about_ca_topic_score_gemma":0.000017938079,"teacher_disagreement_score":0.29166034,"about_ca_system_score_codex":0.0001674204,"about_ca_system_score_gemma":0.00005406735,"threshold_uncertainty_score":0.99972284},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.01249551550776569,"score_gpt":0.23495353127826818,"score_spread":0.2224580157705025,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2053608071","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03777516,0.0022940263,0.0033610128,0.000044033655,0.000018884362,0.000057555808,0.0000035595403,0.00004514918,0.95640063],"genre_scores_gemma":[0.99215996,0.0010044586,0.0063988674,0.0000062986674,0.000034412686,0.000013932187,0.0000019395843,0.000009589138,0.00037055684],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9992327,0.0000010969296,0.00033435845,0.00010884617,0.0001742216,0.00014879231],"domain_scores_gemma":[0.9990706,0.00042754534,0.00014446965,0.0003157927,0.000014643783,0.000026975846],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009726372,0.00008887418,0.00013226026,0.00001768828,0.000046452573,0.000008704536,0.00022889767,0.000054515367,0.0002689129],"category_scores_gemma":[0.00004613636,0.000064028565,0.000044708984,0.00017621358,0.00018414766,0.00003143757,0.000023673774,0.000106977364,0.000020249243],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029235878,0.0008014892,0.002576485,0.0015809722,0.00004075406,0.000004260151,0.00097168406,0.000110366396,0.105701044,0.8420246,0.00043914854,0.04571992],"study_design_scores_gemma":[0.0006131038,0.000009675701,0.00011214769,0.00016361495,0.000037307276,0.0000070874557,0.0043326914,0.0035338332,0.7053235,0.22770448,0.057792485,0.0003700456],"about_ca_topic_score_codex":1.4916971e-7,"about_ca_topic_score_gemma":0.0000048492743,"teacher_disagreement_score":0.9560301,"about_ca_system_score_codex":0.000012885915,"about_ca_system_score_gemma":0.0000018852114,"threshold_uncertainty_score":0.29444075},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.008868251794471808,"score_gpt":0.2612120519522976,"score_spread":0.25234380015782576,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2054789626","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.051723126,0.00032688046,0.8948935,0.000055752946,0.000033580192,0.00011632298,0.0000047594876,0.00006308898,0.05278294],"genre_scores_gemma":[0.766225,0.00017069717,0.23349403,0.00003747462,0.0000067931464,0.000012810208,0.0000028076563,0.0000016901779,0.00004869393],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99913,0.000012897232,0.00032229233,0.00020565624,0.00018295598,0.00014619647],"domain_scores_gemma":[0.99925023,0.0002906623,0.00009549892,0.00032039976,0.00001239246,0.000030833082],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020265258,0.00008748122,0.00024233075,0.000106518906,0.000021324058,0.000016374039,0.000571864,0.000045780234,0.0001869941],"category_scores_gemma":[0.00007080529,0.00006373146,0.000050016974,0.00085104635,0.0000916987,0.00020631793,0.000088908775,0.00008698564,0.00007130587],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004737385,0.00026870903,0.00009220672,0.000038754784,0.0000051623783,0.0000041444696,0.00023094499,0.0010193974,0.000037458143,0.48681644,0.000014190119,0.5114679],"study_design_scores_gemma":[0.00032879316,0.00010248161,0.00079732406,0.000023902177,0.000012586996,0.000009433001,0.00007844345,0.07370335,0.00064275117,0.9196093,0.004474217,0.00021739687],"about_ca_topic_score_codex":0.0000021575756,"about_ca_topic_score_gemma":0.000004106761,"teacher_disagreement_score":0.71450186,"about_ca_system_score_codex":0.000013185045,"about_ca_system_score_gemma":0.000006258653,"threshold_uncertainty_score":0.25988936},"labels":[],"label_agreement":null},{"id":"W2056533610","doi":"10.1016/j.aam.2014.10.006","title":"Some properties of a Rudin–Shapiro-like sequence","year":2014,"lang":"en","type":"preprint","venue":"Advances in Applied Mathematics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Subsequence; Combinatorics; Sequence (biology); Generating function; Function (biology); Mathematics; Binary number; Arithmetic; Mathematical analysis; Bounded function; Chemistry; Biology","score_opus":0.03021710125596875,"score_gpt":0.2654711575106826,"score_spread":0.23525405625471388,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2056533610","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.043833695,0.01654345,0.9261746,0.0003195023,0.0014461706,0.0017625886,0.000022860715,0.0007146375,0.009182515],"genre_scores_gemma":[0.65105635,0.0012591386,0.34706149,0.00019492209,0.00012597122,0.00021425454,0.000003913036,0.000032942306,0.000051002324],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99773663,0.0000301515,0.0007858523,0.0006109163,0.00046425773,0.00037216232],"domain_scores_gemma":[0.99746025,0.00022250542,0.00066816824,0.0015427041,0.00004599169,0.00006038248],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006252821,0.0003818792,0.0007685331,0.00023977915,0.000043463766,0.00008245518,0.0023140917,0.00020735306,0.0000028028317],"category_scores_gemma":[0.000095671676,0.0003188185,0.000102902966,0.0002592147,0.0002350265,0.0002839322,0.0019216626,0.000437118,0.000030282268],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000458829,0.00014347567,0.000006603568,0.0033231045,0.000012940372,0.0000041890057,0.0015809626,0.003501743,0.004783002,0.970995,0.000021926513,0.015622465],"study_design_scores_gemma":[0.00019540463,0.000019228752,0.000003228176,0.0011367421,0.000009065213,0.000006900278,0.000110116234,0.082007356,0.013818183,0.9014482,0.00084958435,0.00039600945],"about_ca_topic_score_codex":0.000005746062,"about_ca_topic_score_gemma":0.0000031783495,"teacher_disagreement_score":0.6072227,"about_ca_system_score_codex":0.000093870614,"about_ca_system_score_gemma":0.0001530242,"threshold_uncertainty_score":0.9999264},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.033305677248612525,"score_gpt":0.3512585302152535,"score_spread":0.317952852966641,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2061773557","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.036376756,0.00032695066,0.8696593,0.000100645426,0.00025489242,0.0016709932,0.000011238271,0.00030284424,0.09129636],"genre_scores_gemma":[0.31117675,0.0000766123,0.6880835,0.000099372555,0.00009307517,0.00015976813,0.0000089269815,0.00010962725,0.0001923353],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9965089,0.000019127594,0.0015043982,0.00050357176,0.0005967467,0.00086727703],"domain_scores_gemma":[0.99386543,0.0048713307,0.00024412658,0.0008133356,0.00006037739,0.00014537336],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0015582966,0.00043561152,0.00081929937,0.0003569724,0.000080121485,0.00002939155,0.00049099646,0.00018151176,0.00008931174],"category_scores_gemma":[0.0011523153,0.00042010949,0.00010301134,0.0010410601,0.0001857412,0.0003560726,0.0001701375,0.0005681908,0.00014816603],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024837658,0.0008934776,0.00004445728,0.00076965906,0.0000081128255,0.000014392392,0.0017859094,0.0005317246,0.0015273348,0.98880154,0.000028724493,0.005569802],"study_design_scores_gemma":[0.0011513898,0.00002382465,0.0000075381417,0.00024960464,0.000019047115,0.0000058227456,0.0011459654,0.0065505775,0.0050352286,0.98451346,0.0008435652,0.00045397808],"about_ca_topic_score_codex":0.00000280213,"about_ca_topic_score_gemma":0.00030523358,"teacher_disagreement_score":0.27479997,"about_ca_system_score_codex":0.00025233172,"about_ca_system_score_gemma":0.000046085966,"threshold_uncertainty_score":0.99982506},"labels":[],"label_agreement":null},{"id":"W2065472795","doi":"10.1016/j.aam.2005.06.009","title":"Semigroup gradings on associative rings","year":2006,"lang":"en","type":"article","venue":"Advances in Applied Mathematics","topic":"Advanced Topics in Algebra","field":"Mathematics","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"Vanderbilt University","keywords":"Mathematics; Associative property; Semigroup; Simple (philosophy); Pure mathematics; Algebra over a field","score_opus":0.016853167980551163,"score_gpt":0.3035476987788032,"score_spread":0.2866945307982521,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2065472795","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28189403,0.00038842577,0.088341706,0.00017953929,0.00040057747,0.0014161518,0.000022470713,0.00068542885,0.6266717],"genre_scores_gemma":[0.47815025,0.00007763918,0.5196037,0.00016797846,0.00022881015,0.00022392406,0.000009052848,0.000118202974,0.0014204221],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975955,0.000019270503,0.0007722225,0.00046916003,0.0005694726,0.0005743563],"domain_scores_gemma":[0.99661386,0.0022196886,0.0005232079,0.0005535491,0.000041539548,0.00004812969],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004549564,0.00039799378,0.00060178636,0.0001883561,0.00011523328,0.000036672216,0.0004179613,0.00016940288,0.00004161807],"category_scores_gemma":[0.00049379776,0.00038159607,0.0000943311,0.0004551468,0.0001356692,0.00020711303,0.00010845268,0.00047785614,0.00011042406],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011154295,0.00040547544,0.00028154932,0.00021869846,0.000009223027,0.000009658963,0.0005773159,0.000037297777,0.00030383977,0.9961845,0.00044376153,0.0015174738],"study_design_scores_gemma":[0.00067401386,0.000036041918,0.000087686385,0.00015640551,0.000018433173,0.0000046490886,0.00038101332,0.00011737034,0.0053644804,0.9879384,0.0048179864,0.00040351527],"about_ca_topic_score_codex":0.00000270838,"about_ca_topic_score_gemma":0.00004519985,"teacher_disagreement_score":0.6252513,"about_ca_system_score_codex":0.000363252,"about_ca_system_score_gemma":0.000017815897,"threshold_uncertainty_score":0.9998636},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Matroid; Minor (academic); Mathematics; Combinatorics; Graphic matroid; Discrete mathematics; Humanities","score_opus":0.0561847561376672,"score_gpt":0.33206183607365786,"score_spread":0.27587707993599064,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2068854468","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012376961,0.0011004901,0.82257843,0.00030015488,0.00025702934,0.0026953362,0.000004977476,0.00043297422,0.16025364],"genre_scores_gemma":[0.2645686,0.0011350594,0.7330245,0.00024964148,0.0000605352,0.00046243233,0.0000023585224,0.000045677756,0.00045125463],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99790037,0.000022741153,0.0004634598,0.0005172865,0.000515368,0.00058075023],"domain_scores_gemma":[0.9981386,0.0005101902,0.0001907945,0.0010202084,0.000031241532,0.000108968605],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006226118,0.00024656614,0.00037649553,0.00026334205,0.00023316446,0.00010813685,0.0027773802,0.000062563835,0.000008557432],"category_scores_gemma":[0.000080428224,0.0002161371,0.000044623514,0.00082645076,0.0001709724,0.0013015749,0.0010518217,0.0003360456,0.00018833704],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001311527,0.00020609559,0.00003565448,0.00011318609,0.0000041825865,0.000025045669,0.0010345592,0.0027386816,0.0004721657,0.9884694,0.000033267115,0.0068545993],"study_design_scores_gemma":[0.0006709375,0.00008979879,0.000019797333,0.00011264231,0.0000012547316,0.000041169882,0.00013502827,0.007843089,0.0030876512,0.9841984,0.0035086176,0.00029162],"about_ca_topic_score_codex":0.0000012711348,"about_ca_topic_score_gemma":0.0000056022877,"teacher_disagreement_score":0.25219163,"about_ca_system_score_codex":0.000119876175,"about_ca_system_score_gemma":0.00005893838,"threshold_uncertainty_score":0.8813815},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.010372805077017797,"score_gpt":0.2745315262241257,"score_spread":0.26415872114710787,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2069397816","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44088274,0.00028611365,0.20964321,0.0001421886,0.000091325346,0.00072044646,0.00016868579,0.00011522151,0.34795004],"genre_scores_gemma":[0.9576689,0.000042874573,0.04173229,0.000044357836,0.00010086863,0.00017121171,0.000049142665,0.000019349489,0.00017103461],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991823,0.0000053213816,0.00028406433,0.0002123002,0.00012765416,0.00018835676],"domain_scores_gemma":[0.9993879,0.0001263613,0.000079314945,0.00035186132,0.0000089852565,0.000045570607],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000092916656,0.00013228624,0.00019623278,0.000019572986,0.00006356404,0.00002435653,0.00018585194,0.000028430972,0.001973561],"category_scores_gemma":[0.0000018694315,0.00012610074,0.000036206864,0.0001482878,0.0000375528,0.0000775105,0.000026680264,0.00012194288,0.00035411422],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000032829632,0.00021376586,0.00020804792,0.000011092582,0.0000058032383,2.2168025e-7,0.0002734912,0.00006296169,0.00028200823,0.948721,0.00004928898,0.05016902],"study_design_scores_gemma":[0.00024465946,0.0000044309577,0.00007245491,0.000015983082,0.000008679558,1.1039099e-7,0.00034113534,0.0011089074,0.0017471678,0.95902455,0.037279002,0.00015293965],"about_ca_topic_score_codex":0.0000255319,"about_ca_topic_score_gemma":0.000007329888,"teacher_disagreement_score":0.5167861,"about_ca_system_score_codex":0.000013617572,"about_ca_system_score_gemma":0.000015038882,"threshold_uncertainty_score":0.9989388},"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,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.025241757531192538,"score_gpt":0.3759550201433229,"score_spread":0.3507132626121303,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2069859193","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013052966,0.000152848,0.9811137,0.00017855596,0.0020004918,0.0005517679,0.0000011241758,0.00015660221,0.014539646],"genre_scores_gemma":[0.04638989,0.000034981873,0.95307994,0.00011176464,0.00010516292,0.00022307171,7.704545e-7,0.000019394272,0.00003500752],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986198,0.000018661298,0.00047636047,0.000359327,0.00017751916,0.00034833988],"domain_scores_gemma":[0.99664503,0.0023313619,0.00018895726,0.0007022504,0.00006406388,0.00006835462],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001117467,0.00017927254,0.00029555324,0.000077908226,0.00007955113,0.00009763155,0.0010820978,0.00010608691,0.000013258553],"category_scores_gemma":[0.000697164,0.00016511478,0.000060519174,0.0003045351,0.00013002848,0.000392166,0.0002083298,0.00027601607,0.000043387234],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000043169753,0.00010301785,0.000009607099,0.000059708043,0.0000026045345,5.604153e-7,0.0009162598,0.000047211455,0.0033062848,0.84515506,0.00003044233,0.15036494],"study_design_scores_gemma":[0.00014361154,0.000027833596,0.0000029551506,0.000013768831,0.0000046479536,0.0000036966082,0.0001902409,0.05173457,0.056743335,0.86628354,0.024665926,0.00018584798],"about_ca_topic_score_codex":0.0000012640646,"about_ca_topic_score_gemma":0.000015322941,"teacher_disagreement_score":0.15017909,"about_ca_system_score_codex":0.000025296218,"about_ca_system_score_gemma":0.000038750015,"threshold_uncertainty_score":0.6733185},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.011154301761226138,"score_gpt":0.30851998913190243,"score_spread":0.2973656873706763,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2075961729","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9759179,0.00020638599,0.0065058717,0.000010256078,0.000033378827,0.0002676235,0.0001960872,0.00001258076,0.016849969],"genre_scores_gemma":[0.9570702,0.00007358638,0.042692043,0.0000100627985,0.0000269225,0.000026764827,0.000044473793,0.000020045538,0.000035934157],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9985196,0.0000022412278,0.00086982426,0.00016849296,0.00020838267,0.0002314643],"domain_scores_gemma":[0.99830246,0.00063621195,0.0006683105,0.00031901657,0.000041866897,0.000032119646],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019454883,0.0001708151,0.000648448,0.00018246863,0.000014856642,0.0000038117305,0.00028454122,0.00013960603,0.00024895443],"category_scores_gemma":[0.00027617865,0.00015034385,0.00008565215,0.0004776285,0.00010573077,0.000071607,0.000042958985,0.0001984788,6.9886545e-7],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023222913,0.0015006678,0.039809715,0.005677197,0.00011018186,9.097932e-7,0.00080202986,0.00049134926,0.8698197,0.07789557,0.000052256524,0.0036082128],"study_design_scores_gemma":[0.0015307581,0.000041562274,0.00029065966,0.00008393942,0.000070042435,9.0161797e-7,0.0005310539,0.0011429929,0.8702764,0.12538607,0.00045709717,0.0001885445],"about_ca_topic_score_codex":0.000004450403,"about_ca_topic_score_gemma":0.00008399429,"teacher_disagreement_score":0.047490504,"about_ca_system_score_codex":0.000020320258,"about_ca_system_score_gemma":0.000026068108,"threshold_uncertainty_score":0.61308444},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.018972937093347356,"score_gpt":0.3204450755155659,"score_spread":0.30147213842221854,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2077155372","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0048356894,0.0003178061,0.98710215,0.000022780301,0.0000555286,0.00012898266,0.0000025183008,0.000040761555,0.007493775],"genre_scores_gemma":[0.0315905,0.00039345317,0.9679439,0.000018833467,0.000011221426,0.000028324252,0.0000013727321,0.0000053928593,0.0000069759994],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993341,0.000008224009,0.00025986606,0.00018967946,0.0000932583,0.000114852504],"domain_scores_gemma":[0.99933183,0.00016959873,0.0001319012,0.00032446577,0.0000142918525,0.000027900029],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015905913,0.00008584201,0.00017433304,0.00007251983,0.000034083667,0.000027240776,0.00027616313,0.000032202315,0.0000012377664],"category_scores_gemma":[0.00002155553,0.000079058016,0.000012493029,0.00030728237,0.00007725536,0.00019030897,0.00014331851,0.0000644154,9.60615e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000011597573,0.000017996566,0.00004530171,0.00004670153,0.0000021125027,4.550447e-7,0.0003978943,0.0000916756,0.0028705443,0.2328793,0.0000023062435,0.7636446],"study_design_scores_gemma":[0.00066570396,0.000036235084,0.0009408743,0.00008559618,0.00001233737,0.00008845223,0.0012757394,0.43521068,0.004533737,0.55081975,0.006039643,0.00029126508],"about_ca_topic_score_codex":0.0000019766255,"about_ca_topic_score_gemma":0.000014213858,"teacher_disagreement_score":0.7633533,"about_ca_system_score_codex":0.000010980051,"about_ca_system_score_gemma":0.00000979897,"threshold_uncertainty_score":0.32238925},"labels":[],"label_agreement":null},{"id":"W2077780770","doi":"10.1006/aama.2001.0776","title":"Combinatorial Addition Formulas and Applications","year":2002,"lang":"en","type":"article","venue":"Advances in Applied Mathematics","topic":"History and advancements in chemistry","field":"Chemistry","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Mathematics; Combinatorics; Binomial coefficient; Series (stratigraphy)","score_opus":0.010586042588638218,"score_gpt":0.24068759728299668,"score_spread":0.23010155469435847,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2077780770","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0064310073,0.0019519088,0.009920594,0.000015709586,0.00010913064,0.00023428789,0.000041460495,0.00014795602,0.98114794],"genre_scores_gemma":[0.9568189,0.0015066838,0.039026137,0.00006295117,0.00038730563,0.0008461219,0.00006003665,0.00004826981,0.0012436237],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991806,0.0000012955659,0.00027158114,0.00021948216,0.00014773203,0.0001792722],"domain_scores_gemma":[0.9994013,0.00015285751,0.00011726779,0.000265482,0.0000110716055,0.0000520591],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000048468464,0.00014063917,0.0001673816,0.000026385565,0.00009713876,0.000012916827,0.00013564329,0.00008238726,0.000891745],"category_scores_gemma":[0.000024940007,0.00015054652,0.000019985486,0.00009225647,0.000103256236,0.0001235427,0.000040339495,0.00016235124,0.000047028952],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017408203,0.0010174222,0.00011612455,0.0024546385,0.000015960604,0.000006079565,0.0008538991,0.00010603796,0.03140212,0.8323846,0.00042798644,0.13119774],"study_design_scores_gemma":[0.001236751,0.000007726837,8.248277e-7,0.00009940954,0.000018235327,0.000011116002,0.00046770196,0.0007389993,0.038847074,0.33348864,0.62472796,0.0003555545],"about_ca_topic_score_codex":1.0278523e-7,"about_ca_topic_score_gemma":7.873985e-7,"teacher_disagreement_score":0.9799043,"about_ca_system_score_codex":0.00007159375,"about_ca_system_score_gemma":0.0000036932145,"threshold_uncertainty_score":0.9763982},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.033442403603979744,"score_gpt":0.29050743332241197,"score_spread":0.2570650297184322,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2081148745","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013611667,0.00034204414,0.972606,0.00030927776,0.00008641916,0.00035038483,0.000003145113,0.00015504945,0.012536005],"genre_scores_gemma":[0.4017339,0.000022108541,0.59799844,0.00016042996,0.000036145535,0.000022656228,7.1302367e-7,0.00000946776,0.00001609792],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998109,0.000021892829,0.0006707437,0.00043089045,0.00042605144,0.00034142222],"domain_scores_gemma":[0.9981168,0.000489012,0.00029037002,0.0009780737,0.000057590132,0.000068175905],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045152544,0.00021864504,0.00047798155,0.00013646756,0.00005650712,0.000037342128,0.001328682,0.00006338717,0.000030507397],"category_scores_gemma":[0.00005151021,0.00020612564,0.0000743676,0.00060572306,0.00022766163,0.00030421582,0.0006451461,0.00016951034,0.000053608783],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005900067,0.0007257557,0.0006144533,0.0004124202,0.0000091502125,0.0000017296485,0.0042616595,0.0054880497,0.0003645084,0.7487874,0.000050516846,0.23927845],"study_design_scores_gemma":[0.00052755995,0.000039430914,0.00050817954,0.000048145146,0.000005037456,0.000012939429,0.00015444486,0.35328054,0.0036516576,0.63123035,0.010229939,0.0003117736],"about_ca_topic_score_codex":0.000006261664,"about_ca_topic_score_gemma":0.00003580577,"teacher_disagreement_score":0.38812226,"about_ca_system_score_codex":0.000084004285,"about_ca_system_score_gemma":0.000036576024,"threshold_uncertainty_score":0.84055597},"labels":[],"label_agreement":null},{"id":"W2083338546","doi":"10.1016/s0196-8858(03)00059-9","title":"A shifted asymmetry index series","year":2003,"lang":"en","type":"article","venue":"Advances in Applied Mathematics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Mathematics; Series (stratigraphy); Index (typography); Asymmetry; Statistics; Computer science; Geology","score_opus":0.01709765160113658,"score_gpt":0.2997415396594981,"score_spread":0.28264388805836155,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2083338546","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.037509203,0.0012002002,0.3936736,0.000078430705,0.0012989448,0.002500163,0.000013398482,0.000992157,0.5627339],"genre_scores_gemma":[0.40144682,0.00015140236,0.5974174,0.000054205982,0.000060456165,0.00028502216,0.0000024838664,0.0001397325,0.00044247913],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9968267,0.000056742872,0.0011632298,0.00052426854,0.00067105534,0.0007579796],"domain_scores_gemma":[0.99639827,0.0017644543,0.0005301912,0.0010781382,0.00007622962,0.00015272984],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008197429,0.00055425864,0.000919158,0.00028810772,0.00012926495,0.000056647743,0.0005339096,0.00024972932,0.000104839426],"category_scores_gemma":[0.0025061406,0.0005304086,0.000115377065,0.0010494499,0.00019773965,0.00047564047,0.00012480392,0.00051878294,0.00009598339],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022522505,0.0005488082,0.00019999736,0.00080813206,0.00001798717,0.000015759453,0.00080466346,0.000046125508,0.00014564364,0.9962111,0.00009028291,0.0010889436],"study_design_scores_gemma":[0.0011560132,0.000049058297,0.000009352753,0.00016499135,0.00003034986,0.00004655847,0.0015889693,0.00015483038,0.003977336,0.98328537,0.008957062,0.00058008556],"about_ca_topic_score_codex":5.8664796e-7,"about_ca_topic_score_gemma":0.000021715032,"teacher_disagreement_score":0.56229144,"about_ca_system_score_codex":0.00019736025,"about_ca_system_score_gemma":0.00007717144,"threshold_uncertainty_score":0.99971473},"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,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; 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","score_opus":0.016324273096377247,"score_gpt":0.2521384388042421,"score_spread":0.23581416570786484,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2090113296","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010620618,0.0006557984,0.9799784,0.000105557796,0.00016927184,0.00027032653,0.000017616241,0.00012836039,0.0080540795],"genre_scores_gemma":[0.52412415,0.00010024957,0.47535902,0.00024371923,0.00004913058,0.000043117965,0.000007782437,0.000019494819,0.000053331947],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99854136,0.00004876919,0.0004701193,0.00029849287,0.0003356521,0.00030559162],"domain_scores_gemma":[0.9982744,0.0005341897,0.00028678478,0.00082067976,0.00002970631,0.000054271837],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051373,0.00020616372,0.00036120447,0.00006313428,0.00008886415,0.000055407192,0.0012365816,0.000063518666,0.000019771744],"category_scores_gemma":[0.000048306574,0.00014332529,0.00005197078,0.0004510678,0.00030643484,0.00019224542,0.00023866982,0.00017777205,0.000024687079],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000025698598,0.00019700444,0.000024956591,0.000111360816,0.000011206536,8.4626544e-7,0.0015381983,0.00014266938,0.003233349,0.7640827,0.00033554804,0.23031959],"study_design_scores_gemma":[0.0005014693,0.000044408363,0.00007285094,0.000056736448,0.000007222858,0.000008478662,0.00025924382,0.33885074,0.01999618,0.63326496,0.00664106,0.0002966498],"about_ca_topic_score_codex":0.0000051291804,"about_ca_topic_score_gemma":0.0000067604774,"teacher_disagreement_score":0.51350355,"about_ca_system_score_codex":0.000031135547,"about_ca_system_score_gemma":0.000020791145,"threshold_uncertainty_score":0.5844636},"labels":[],"label_agreement":null},{"id":"W2090657605","doi":"10.1006/aama.2001.0787","title":"Spaces of Lattice Diagram Polynomials in One Set of Variables","year":2002,"lang":"en","type":"article","venue":"Advances in Applied Mathematics","topic":"Advanced Algebra and Geometry","field":"Mathematics","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Mathematics; Combinatorics; Partition (number theory); Lattice (music); Pure mathematics","score_opus":0.047026066640729565,"score_gpt":0.3072990137613018,"score_spread":0.26027294712057225,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2090657605","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8221,0.005558909,0.07491253,0.00014128411,0.00021159287,0.0018008676,0.00008670482,0.00013941905,0.09504869],"genre_scores_gemma":[0.71792173,0.00073717185,0.28112423,0.000014577219,0.0000310261,0.000046139197,0.000002286388,0.00003261891,0.00009022122],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979407,0.00002626819,0.001077345,0.0002561913,0.00034947682,0.00035000863],"domain_scores_gemma":[0.99641114,0.0023351638,0.00064754486,0.00051725254,0.000039086583,0.000049836075],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005198747,0.00024160361,0.0008984829,0.00031678667,0.000020987172,0.000008144718,0.00032744114,0.0001324821,0.0001569774],"category_scores_gemma":[0.0007613042,0.00023088536,0.000064250446,0.00081963366,0.00016828676,0.0001817481,0.00010027374,0.00020053182,0.000013940849],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000251602,0.0011485077,0.0010285417,0.0030621022,0.000027656277,0.0000040640066,0.0031059375,0.00059847016,0.00210633,0.97739464,0.00004740602,0.011451156],"study_design_scores_gemma":[0.0009438141,0.000052807492,0.000054483302,0.00044235494,0.000037155914,0.000002735074,0.0014428935,0.0011471233,0.017174106,0.9781453,0.00029169125,0.00026553753],"about_ca_topic_score_codex":0.000002818845,"about_ca_topic_score_gemma":0.000043710577,"teacher_disagreement_score":0.2062117,"about_ca_system_score_codex":0.000041296054,"about_ca_system_score_gemma":0.000012434634,"threshold_uncertainty_score":0.9415232},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Palindrome; Mathematics; Combinatorics; Word (group theory); Connection (principal bundle); Function (biology); Set (abstract data type); Word length; Factor (programming language); Discrete mathematics; Geometry; Linguistics","score_opus":0.0587870870588243,"score_gpt":0.291506953157473,"score_spread":0.2327198660986487,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2098464356","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5780462,0.00025263237,0.42029423,0.000015611795,0.000056462137,0.00014276647,0.0000034294837,0.00009578248,0.0010928483],"genre_scores_gemma":[0.7249524,0.000077695804,0.27489218,0.000030402683,0.000027206064,0.0000061443975,0.000001347583,0.000008241642,0.0000043978484],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99905926,0.000015404075,0.0002872317,0.00026238407,0.00016381175,0.00021189386],"domain_scores_gemma":[0.99916697,0.0003039921,0.00014496318,0.00032214163,0.000010497111,0.00005142606],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017238628,0.00014293169,0.00027690112,0.00008473865,0.00012437512,0.00003488203,0.00030261686,0.000058753227,0.000005665586],"category_scores_gemma":[0.000026004636,0.00013148595,0.00002338594,0.00024133346,0.00014544142,0.0002953865,0.00015532038,0.00013346055,0.000006018549],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008274116,0.00014469196,0.008934851,0.00029076613,0.0000184841,0.00002297371,0.0065618325,0.00012908672,0.0025490867,0.9443688,0.000008341971,0.03696284],"study_design_scores_gemma":[0.00093591295,0.000047158683,0.004304689,0.00014189926,0.000011530418,0.00016173074,0.00058714976,0.12907523,0.0061740433,0.85751855,0.0004805299,0.000561589],"about_ca_topic_score_codex":0.000004030897,"about_ca_topic_score_gemma":0.000004922497,"teacher_disagreement_score":0.14690615,"about_ca_system_score_codex":0.000044697343,"about_ca_system_score_gemma":0.000018121927,"threshold_uncertainty_score":0.53618413},"labels":[],"label_agreement":null},{"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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)","score_opus":0.01027692145734738,"score_gpt":0.22993579531786584,"score_spread":0.21965887386051847,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2100552771","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014428891,0.00047395861,0.94507825,0.00055840635,0.00017976835,0.0007233253,0.0000014768071,0.00015764311,0.038398262],"genre_scores_gemma":[0.6929348,0.000026495447,0.30647862,0.0002001319,0.000029461822,0.000080762344,0.0000010035396,0.000013015781,0.00023570913],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99896425,0.000029118597,0.0002462586,0.00027429318,0.00021037998,0.000275683],"domain_scores_gemma":[0.99903697,0.00032113187,0.00014694025,0.00043077976,0.000018355533,0.000045835302],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029811304,0.00017000134,0.00020629643,0.000050555802,0.00011539447,0.00008335011,0.00054434105,0.00003547716,0.000006763851],"category_scores_gemma":[0.000034168992,0.00008324475,0.000022851753,0.00032219957,0.000070916336,0.00017969911,0.000073642754,0.00012151954,0.00004555344],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015395171,0.00022143291,0.00002840079,0.000082951985,0.000014454606,0.000020117941,0.0021958577,0.003951342,0.001748909,0.8857329,0.00010613795,0.105882086],"study_design_scores_gemma":[0.005664037,0.00047436854,0.00033532784,0.00032023108,0.0000664126,0.0006076593,0.0016043778,0.09489312,0.07239399,0.6298667,0.19136758,0.0024061722],"about_ca_topic_score_codex":0.000008675336,"about_ca_topic_score_gemma":0.000045813733,"teacher_disagreement_score":0.6785059,"about_ca_system_score_codex":0.00003270388,"about_ca_system_score_gemma":0.000056275952,"threshold_uncertainty_score":0.33946222},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.018834554320859984,"score_gpt":0.28860963014713376,"score_spread":0.26977507582627375,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2104469817","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2752546,0.012659326,0.13913043,0.00041030694,0.0016280952,0.0030908845,0.000047552,0.0003022853,0.5674765],"genre_scores_gemma":[0.8667828,0.0008377112,0.13154711,0.00004475272,0.000026933662,0.00007684197,0.0000014009391,0.00003451509,0.0006479464],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985173,0.000034322205,0.00060876674,0.0002013054,0.00027724056,0.00036109422],"domain_scores_gemma":[0.9963716,0.002756569,0.00032936427,0.0004679006,0.000027189502,0.000047359],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00068876566,0.00018486172,0.0003808964,0.00013556515,0.0001015874,0.000009465349,0.0003650478,0.000095240706,0.00006629193],"category_scores_gemma":[0.0008243485,0.00012884922,0.00007003784,0.00052452117,0.00028776398,0.0000576738,0.000034367098,0.00018702232,0.000016127196],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010000976,0.00014084164,0.00036352192,0.00018042247,0.000014599656,0.0000020259688,0.0004121274,0.000010157776,0.000093534545,0.9960704,0.0005999176,0.0021024805],"study_design_scores_gemma":[0.00050359307,0.000031564527,0.00005263382,0.000034222816,0.00002105615,0.000017294999,0.0013822,0.000021135724,0.0017434665,0.98644614,0.009589861,0.00015680822],"about_ca_topic_score_codex":0.000001499549,"about_ca_topic_score_gemma":0.000023155899,"teacher_disagreement_score":0.5915282,"about_ca_system_score_codex":0.000024851304,"about_ca_system_score_gemma":0.000038745355,"threshold_uncertainty_score":0.5254319},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.009003227470727602,"score_gpt":0.23913186602539935,"score_spread":0.23012863855467175,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2143645603","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33685046,0.0010611416,0.64715666,0.0005927067,0.00005351634,0.00041311086,0.000008514287,0.000057859645,0.013806055],"genre_scores_gemma":[0.8897727,0.00008601089,0.10999182,0.00010410125,0.0000105516565,0.000017321057,4.6532816e-7,0.0000060956168,0.000010903483],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99927855,0.00001788383,0.00028257645,0.00014048602,0.00016538068,0.00011514806],"domain_scores_gemma":[0.9980897,0.0013474228,0.00019199203,0.00033570593,0.000016398162,0.000018788853],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033592436,0.00009836169,0.00018775888,0.000059454913,0.000054799777,0.000019125902,0.0003445163,0.000031673215,0.000008379304],"category_scores_gemma":[0.00009330753,0.00006632658,0.00002297356,0.00020789038,0.00010205463,0.00013105111,0.00007782849,0.0001172882,0.0000027209087],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000209233,0.00006452653,0.000009910782,0.000081179045,0.0000041676026,3.2359006e-7,0.0050617955,0.0015074469,0.002037597,0.98135054,0.000017210568,0.009863228],"study_design_scores_gemma":[0.0002729848,0.00005319044,0.000038527378,0.00015615388,0.0000073930723,0.000005887761,0.0020222978,0.05580134,0.024071641,0.9170743,0.00036903945,0.00012724091],"about_ca_topic_score_codex":4.6278274e-7,"about_ca_topic_score_gemma":0.0000071648733,"teacher_disagreement_score":0.55292225,"about_ca_system_score_codex":0.000012916246,"about_ca_system_score_gemma":0.000015709225,"threshold_uncertainty_score":0.27047196},"labels":[],"label_agreement":null},{"id":"W2151469863","doi":"10.1016/j.aam.2012.09.001","title":"Geometric graph properties of the spatial preferred attachment model","year":2012,"lang":"en","type":"preprint","venue":"Advances in Applied Mathematics","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University; Dalhousie University","funders":"","keywords":"Distance; Metric space; Metric (unit); Mathematics; Combinatorics; Resistance distance; Spatial network; Metric dimension; Intrinsic metric; Preferential attachment; Neighbourhood (mathematics); Graph; Discrete mathematics; Injective metric space; Line graph; Complex network; Graph power; Pathwidth; Mathematical analysis","score_opus":0.03217433644861553,"score_gpt":0.2847754627619362,"score_spread":0.25260112631332066,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2151469863","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07423098,0.0025610058,0.8879593,0.000022474522,0.00019694588,0.002041978,0.00004815933,0.000090347894,0.03284883],"genre_scores_gemma":[0.94922817,0.0000802333,0.04995691,0.0000064854917,0.00011270924,0.0005084075,0.000016754002,0.00003494665,0.000055363467],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982679,0.000020521937,0.0007202755,0.00029734976,0.00039233168,0.00030161245],"domain_scores_gemma":[0.9981575,0.00006474968,0.00073247735,0.000962264,0.00004614285,0.00003686375],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027009347,0.00033318487,0.0006482649,0.00020838958,0.00005110847,0.000023546416,0.00075883354,0.00009302775,0.000030168429],"category_scores_gemma":[0.000006965925,0.00023114998,0.0002380385,0.00042041438,0.00012422052,0.00005209761,0.0011046903,0.0004682368,0.0000030153515],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000050831146,0.0032163258,0.019566562,0.004194871,0.0005228379,1.8567452e-7,0.003975129,0.47119284,0.0019658913,0.3956164,0.00030451184,0.0993936],"study_design_scores_gemma":[0.00033050214,0.000009093826,0.00020966982,0.0007470923,0.00030884586,1.8814349e-7,0.0002523213,0.100309595,0.025921773,0.87092394,0.00035033395,0.00063664315],"about_ca_topic_score_codex":0.000037972815,"about_ca_topic_score_gemma":0.000017299826,"teacher_disagreement_score":0.8749972,"about_ca_system_score_codex":0.00005796328,"about_ca_system_score_gemma":0.00005412006,"threshold_uncertainty_score":0.9426023},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Bijection; Mathematics; Combinatorics; Bipartite graph; Genus; Identity (music); Graph; Discrete mathematics; Botany","score_opus":0.04158816758432483,"score_gpt":0.30436184158884344,"score_spread":0.2627736740045186,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2154871611","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001664898,0.00041296627,0.90420246,0.0000062141266,0.0012142307,0.0031131236,0.00002107958,0.00040348448,0.08896154],"genre_scores_gemma":[0.10761693,0.00007347659,0.89077365,0.000019378378,0.00028005676,0.00079505966,0.000015446663,0.00019958129,0.00022642913],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99636793,0.000050158887,0.0012830831,0.0007661258,0.000695582,0.0008371382],"domain_scores_gemma":[0.9958601,0.0017627816,0.000816071,0.0011879317,0.0001432576,0.00022983567],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001053888,0.00067022734,0.0012630644,0.00029504416,0.00016849674,0.000055465316,0.0010561437,0.0003170589,0.000052488587],"category_scores_gemma":[0.001032154,0.00065803336,0.00022190984,0.00087696174,0.00015486052,0.0007187932,0.00029150274,0.00042884925,0.000051812636],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001443517,0.001320617,0.000017374583,0.0013746958,0.00006148496,0.0000055893665,0.0042341375,0.000016480593,0.0002417612,0.9902445,0.00018901176,0.0021500064],"study_design_scores_gemma":[0.003020436,0.00012742203,0.000002508578,0.0001378968,0.0001471424,0.000012475486,0.001063616,0.00087219937,0.0058761267,0.986778,0.0012465441,0.00071562466],"about_ca_topic_score_codex":0.000010141472,"about_ca_topic_score_gemma":0.000024931964,"teacher_disagreement_score":0.10595203,"about_ca_system_score_codex":0.00029812963,"about_ca_system_score_gemma":0.00011948377,"threshold_uncertainty_score":0.9995871},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.027045619020873764,"score_gpt":0.29914970810271996,"score_spread":0.2721040890818462,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2157575511","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18544072,0.0020269076,0.40400183,0.00009623479,0.00049605826,0.001342031,0.000015925832,0.00032095652,0.40625936],"genre_scores_gemma":[0.1849141,0.00028731566,0.81265795,0.00010053409,0.00008655968,0.00021695383,0.0000027071756,0.00005632202,0.0016775794],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985456,0.000030085326,0.0006070662,0.00028917717,0.00019277673,0.000335334],"domain_scores_gemma":[0.9981766,0.0011408034,0.00016925269,0.00039439744,0.000024585943,0.000094404655],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000447675,0.00023997006,0.00041924728,0.00011777103,0.00016932926,0.0000542209,0.00010551764,0.0000988763,0.0002683164],"category_scores_gemma":[0.0007794743,0.00020874666,0.000047560894,0.00027117546,0.00009009895,0.00013758651,0.00004229749,0.00019216964,0.000066276705],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000027034207,0.00017626202,0.00011152781,0.00035254456,0.000008812056,0.0000017120875,0.00036293964,0.00002369753,0.0008280899,0.9946195,0.00032952428,0.0031827085],"study_design_scores_gemma":[0.0005806553,0.000036436402,0.000011794294,0.00007871804,0.00004094307,0.000032830256,0.0010802028,0.0008002658,0.0011619409,0.96776295,0.028096786,0.00031647467],"about_ca_topic_score_codex":8.713266e-7,"about_ca_topic_score_gemma":0.000017183793,"teacher_disagreement_score":0.40865612,"about_ca_system_score_codex":0.00004205135,"about_ca_system_score_gemma":0.000026762227,"threshold_uncertainty_score":0.85124415},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.0756796761499367,"score_gpt":0.35646997972140476,"score_spread":0.28079030357146806,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2172758441","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.040239785,0.010388693,0.7197713,0.0011220294,0.001780739,0.0059458273,0.00015654946,0.0005201052,0.22007495],"genre_scores_gemma":[0.6911279,0.0009035153,0.30451417,0.00020931089,0.00029292164,0.0012822319,0.000017207562,0.00009480666,0.0015579601],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99753,0.0000253831,0.0009877861,0.0003218547,0.0005203409,0.0006146483],"domain_scores_gemma":[0.99273807,0.0058107506,0.0004824838,0.00059589645,0.00025806733,0.000114741866],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002684862,0.00032200437,0.00064253266,0.00027537072,0.00019972482,0.000099526325,0.0005773018,0.00013452675,0.0000056273298],"category_scores_gemma":[0.0056261206,0.00022302441,0.00010155969,0.0007938141,0.00020098189,0.00020619569,0.00016057616,0.00022794973,0.000029472789],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000055752233,0.00021818104,0.00007452048,0.0014262706,0.000024407595,0.0000016109623,0.002440971,0.000021086187,0.000009196807,0.98342127,0.0016980747,0.010608644],"study_design_scores_gemma":[0.0011701225,0.000086322674,0.000008648531,0.00006685335,0.000033484474,0.0000056649387,0.007074017,0.0017391947,0.0007013911,0.956833,0.03196878,0.0003125009],"about_ca_topic_score_codex":0.0000055621595,"about_ca_topic_score_gemma":0.00007866118,"teacher_disagreement_score":0.6508881,"about_ca_system_score_codex":0.00013043325,"about_ca_system_score_gemma":0.00010771228,"threshold_uncertainty_score":0.90946716},"labels":[],"label_agreement":null},{"id":"W2347126292","doi":"10.1016/j.aam.2016.09.002","title":"⁎-freeness in finite tensor products","year":2016,"lang":"en","type":"article","venue":"Advances in Applied Mathematics","topic":"Advanced Operator Algebra Research","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Japan Society for the Promotion of Science; Natural Sciences and Engineering Research Council of Canada; Agence Nationale de la Recherche","keywords":"Tensor product; Tensor product of Hilbert spaces; Tensor (intrinsic definition); Corollary; Converse; Unitary state; Simple (philosophy); Tensor contraction; Algebra over a field","score_opus":0.038787642700013364,"score_gpt":0.3443614821770289,"score_spread":0.30557383947701555,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2347126292","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.54444534,0.002436321,0.34815413,0.002453819,0.0006966549,0.00786953,0.00006904272,0.0009619165,0.09291325],"genre_scores_gemma":[0.5690718,0.0004852544,0.42881963,0.000054752796,0.000091007874,0.0005567416,0.0000020785528,0.00011749438,0.0008011754],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972816,0.000040546907,0.00080707204,0.00056938117,0.0005636944,0.0007376671],"domain_scores_gemma":[0.995771,0.002891122,0.00019216628,0.0009649617,0.0000891074,0.0000916678],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00081661774,0.0003356157,0.0005915364,0.00032694987,0.000050664315,0.000024139257,0.0006000255,0.00012769367,0.000080436475],"category_scores_gemma":[0.0031556308,0.0002308541,0.000041031173,0.0008878795,0.000205787,0.00038567086,0.00021907507,0.00028551137,0.00018787247],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000828731,0.000757272,0.0021256774,0.0013277191,0.000010577511,0.0000567005,0.0009267444,0.000120508535,0.0086453715,0.9425304,0.000107300126,0.043308847],"study_design_scores_gemma":[0.0018053026,0.00004156909,0.00014831549,0.00048571714,0.0000069408225,0.000008633041,0.00037874246,0.00024298384,0.018764138,0.97423583,0.0034166547,0.0004651957],"about_ca_topic_score_codex":0.0000010992985,"about_ca_topic_score_gemma":0.00007760838,"teacher_disagreement_score":0.09211207,"about_ca_system_score_codex":0.00022174075,"about_ca_system_score_gemma":0.00007749539,"threshold_uncertainty_score":0.9413957},"labels":[],"label_agreement":null},{"id":"W2394897466","doi":"10.1016/j.aam.2018.05.002","title":"Restricted growth function patterns and statistics","year":2018,"lang":"en","type":"preprint","venue":"Advances in Applied Mathematics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"National Security Agency; Michigan State University; National Science Foundation","keywords":"Bijection; Generating function; Combinatorics; Mathematics; Integer (computer science); Function (biology); Set (abstract data type); Sequence (biology); Discrete mathematics; Statistics; Computer science","score_opus":0.023998184558911475,"score_gpt":0.3074853546176088,"score_spread":0.28348717005869734,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2394897466","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021952238,0.0005925721,0.9609136,0.00003601368,0.0018982963,0.0025312528,0.00040709806,0.00056903774,0.011099911],"genre_scores_gemma":[0.10589852,0.0018889543,0.89054644,0.000056087167,0.00047787835,0.0005956872,0.00013602313,0.00029282912,0.000107558684],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9956982,0.00006366685,0.0016727685,0.0010033082,0.00083710713,0.00072490604],"domain_scores_gemma":[0.99408853,0.002691593,0.001397808,0.0013643111,0.00026838726,0.00018937502],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00055247004,0.00094157754,0.001440108,0.00041325996,0.00013921353,0.00013400287,0.00070061855,0.0006720974,0.000053410437],"category_scores_gemma":[0.0018267956,0.0009426881,0.0000926396,0.00038830438,0.00029421848,0.00019033307,0.0013053206,0.0012491609,0.0000391595],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000054529322,0.0004672818,0.00025776023,0.008584893,0.00005538938,0.000016367487,0.0008490608,0.000026738564,0.00003116074,0.98633677,0.0006718786,0.0026481699],"study_design_scores_gemma":[0.0009356102,0.00011521818,0.000080110185,0.0010569586,0.00021403198,0.000012409218,0.00037790136,0.0019928224,0.00028400778,0.9935223,0.0005150862,0.00089352875],"about_ca_topic_score_codex":0.000006192975,"about_ca_topic_score_gemma":0.000055494547,"teacher_disagreement_score":0.08394628,"about_ca_system_score_codex":0.00027439286,"about_ca_system_score_gemma":0.000113847294,"threshold_uncertainty_score":0.9993024},"labels":[],"label_agreement":null},{"id":"W2404320461","doi":"10.1016/j.aam.2016.11.003","title":"Bounds on the regularity of toric ideals of graphs","year":2016,"lang":"en","type":"preprint","venue":"Advances in Applied Mathematics","topic":"Commutative Algebra and Its Applications","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Bipartite graph; Mathematics; Combinatorics; Betti number; Chordal graph; Ideal (ethics); Graph; Upper and lower bounds; Complete bipartite graph; Discrete mathematics; Mathematical analysis","score_opus":0.046167526623904664,"score_gpt":0.34580918125744126,"score_spread":0.2996416546335366,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2404320461","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30636215,0.0031088917,0.16624469,0.0013928313,0.0006061898,0.007375515,0.0005685138,0.00023859984,0.51410264],"genre_scores_gemma":[0.9191693,0.0007424537,0.07912088,0.000037265792,0.000044876728,0.000652025,0.000009032193,0.000066697234,0.00015746258],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99758935,0.00005978038,0.0012172081,0.00035573475,0.0005217844,0.00025613757],"domain_scores_gemma":[0.9915211,0.0050189043,0.0014683693,0.0018186917,0.00013268841,0.000040242092],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00095614203,0.00036397766,0.00096719654,0.00019530256,0.00006580709,0.000014744867,0.0010057745,0.00022199705,0.00007767558],"category_scores_gemma":[0.00058554957,0.00022939283,0.00019917944,0.00035156883,0.00040748733,0.000042560165,0.00055865786,0.000489225,0.000009512829],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015895188,0.00039728414,0.00004053273,0.001734209,0.00004831331,2.876707e-7,0.0011016403,0.00001333108,0.0006803475,0.99378014,0.00039045198,0.0017975788],"study_design_scores_gemma":[0.00023361083,0.000032842025,0.00006754578,0.0008152776,0.00006539899,8.1441e-7,0.00033602948,0.00004742024,0.010335055,0.98708916,0.00075233285,0.00022453262],"about_ca_topic_score_codex":0.000002482072,"about_ca_topic_score_gemma":0.000018905921,"teacher_disagreement_score":0.61280715,"about_ca_system_score_codex":0.00007916254,"about_ca_system_score_gemma":0.000079693054,"threshold_uncertainty_score":0.93543684},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.02771898456671913,"score_gpt":0.3079163636321328,"score_spread":0.2801973790654137,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2507315201","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008134116,0.00041360923,0.9760109,0.0002532459,0.00037663578,0.000113134585,7.752427e-7,0.00010304542,0.0145945465],"genre_scores_gemma":[0.49770004,0.0000118217495,0.50203884,0.00016476373,0.000038388287,0.000020207755,0.0000025133102,0.000004911546,0.000018520706],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990593,0.000009955403,0.0002556576,0.00021612264,0.0002645583,0.00019440115],"domain_scores_gemma":[0.9993244,0.00024449153,0.00006249416,0.00023717586,0.00004704129,0.00008439522],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033869364,0.00010240189,0.00014169193,0.00011839484,0.000075728654,0.00018032914,0.0003145963,0.000035637982,0.0000022842016],"category_scores_gemma":[0.00015554692,0.00009948188,0.00002189589,0.00047314956,0.00006843721,0.00049806345,0.00010735531,0.000093024704,0.000048335733],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000021530313,0.000081890015,0.000026543445,0.000039424547,0.0000010392954,0.000003800441,0.0010979582,0.0007600993,0.0007557267,0.9633163,0.00003133835,0.033883724],"study_design_scores_gemma":[0.00031976867,0.000027238744,0.00007110572,0.000033699667,0.0000023984226,0.000020325882,0.00014161675,0.06130704,0.0033249625,0.92271566,0.011838514,0.00019766121],"about_ca_topic_score_codex":3.2083898e-7,"about_ca_topic_score_gemma":0.000001660921,"teacher_disagreement_score":0.4895659,"about_ca_system_score_codex":0.000034173794,"about_ca_system_score_gemma":0.000062548825,"threshold_uncertainty_score":0.40567532},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.029611739590000272,"score_gpt":0.3745098303551216,"score_spread":0.3448980907651213,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2552556533","genre_codex":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5235347,0.0006545337,0.40970513,0.000126742,0.0005928849,0.002552912,0.000009579526,0.00039165767,0.062431835],"genre_scores_gemma":[0.43850094,0.00015465975,0.56100243,0.000017701208,0.000029228428,0.00017683308,9.371571e-7,0.0000875093,0.000029736486],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972396,0.000059258822,0.0009735886,0.00063177344,0.00040946298,0.00068634964],"domain_scores_gemma":[0.99504846,0.0023327041,0.0009917204,0.0014429888,0.0000542746,0.00012983005],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013283112,0.0005468783,0.0010423465,0.00029944876,0.0003090933,0.00016999595,0.0008191959,0.00019049441,0.000007863345],"category_scores_gemma":[0.0014598554,0.00047211154,0.00007014565,0.0002851973,0.00042411307,0.0005765269,0.00037192283,0.0005933214,0.000006308711],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004333167,0.00040605015,0.0014799661,0.0012565486,0.000025512047,0.0000492073,0.004826564,0.000052638414,0.00037126837,0.97161424,0.000006231189,0.019868413],"study_design_scores_gemma":[0.0017420682,0.00008550187,0.00017890686,0.000832618,0.00004448128,0.000046309902,0.0057566874,0.0013068633,0.0017914413,0.9875267,0.0001145212,0.00057389174],"about_ca_topic_score_codex":0.000007627753,"about_ca_topic_score_gemma":0.00031470446,"teacher_disagreement_score":0.15129732,"about_ca_system_score_codex":0.00013126912,"about_ca_system_score_gemma":0.000039441136,"threshold_uncertainty_score":0.9997731},"labels":[],"label_agreement":null},{"id":"W2592403877","doi":"10.1016/j.aam.2017.12.008","title":"Minimal length maximal green sequences","year":2018,"lang":"en","type":"article","venue":"Advances in Applied Mathematics","topic":"Algebraic structures and combinatorial models","field":"Mathematics","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Annulus (botany); Surface (topology); Representation (politics); String (physics); Cluster (spacecraft)","score_opus":0.025317636798873562,"score_gpt":0.3064135827271363,"score_spread":0.28109594592826276,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2592403877","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7796389,0.00060209393,0.018286673,0.00016748936,0.0012604924,0.001095098,0.000011035664,0.00038974494,0.19854851],"genre_scores_gemma":[0.8485148,0.000048071644,0.15064116,0.00007785858,0.00042354153,0.00006977684,0.0000016558091,0.000045408175,0.0001777456],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981345,0.000016327684,0.00058565766,0.0003741191,0.00042450495,0.0004649077],"domain_scores_gemma":[0.99859935,0.0005066244,0.0002536237,0.0005027332,0.000054558415,0.000083136045],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00030342306,0.00029960903,0.00046325344,0.00010458309,0.00011825634,0.000035933062,0.00050286925,0.00014455915,0.00016505808],"category_scores_gemma":[0.00014948171,0.00025371002,0.00006919675,0.00030845008,0.00031845583,0.00018595369,0.00014571231,0.00021466927,0.000072867966],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030405692,0.000101295926,0.00008756077,0.00019942051,0.000012201398,0.0000047798853,0.0016047383,0.0000032017315,0.0001420078,0.9922875,0.0000832582,0.00544363],"study_design_scores_gemma":[0.00052886095,0.000097414566,0.000024649087,0.00006280618,0.000022332513,0.000013509669,0.00082820625,0.000421223,0.0019682907,0.9933171,0.0024045783,0.00031102923],"about_ca_topic_score_codex":0.000007638706,"about_ca_topic_score_gemma":0.000057970683,"teacher_disagreement_score":0.19837077,"about_ca_system_score_codex":0.000068138776,"about_ca_system_score_gemma":0.000043738284,"threshold_uncertainty_score":0.99999154},"labels":[],"label_agreement":null},{"id":"W2740627096","doi":"10.1016/j.aam.2017.11.006","title":"A minimaj-preserving crystal on ordered multiset partitions","year":2017,"lang":"en","type":"article","venue":"Advances in Applied Mathematics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"Simons Foundation; National Science Foundation","keywords":"Multiset; Generalization; Conjecture; Statistic; Property (philosophy); Partition (number theory); Crystal (programming language)","score_opus":0.05356525700061415,"score_gpt":0.3713117681047803,"score_spread":0.31774651110416613,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2740627096","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20862408,0.00039239458,0.12670049,0.00072779495,0.0022328354,0.005090561,0.00015525284,0.0011919886,0.65488464],"genre_scores_gemma":[0.62926275,0.00009538683,0.36959082,0.00004648565,0.00014114176,0.00043436032,0.000006447358,0.000116095885,0.00030652914],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970901,0.000028611388,0.0009772738,0.00055650296,0.0006460513,0.0007014359],"domain_scores_gemma":[0.9942571,0.002063363,0.0009508357,0.0024893952,0.00008149151,0.0001578311],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00052920077,0.00050142064,0.0008116558,0.0001778741,0.00060854614,0.00019105087,0.001379003,0.00019153491,0.00010924711],"category_scores_gemma":[0.004011399,0.00048041405,0.00012815394,0.0001797781,0.0002765752,0.00051377626,0.0004822014,0.0004650394,0.00013754933],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000043580643,0.0009779856,0.00008752666,0.00083018764,0.000021783258,0.000025486623,0.0011071257,0.00018063613,0.0006151054,0.9936736,0.0004916296,0.0019453474],"study_design_scores_gemma":[0.0016604388,0.000069845395,0.000046710247,0.0004981331,0.000037476973,0.00000936145,0.0007463795,0.0016906455,0.0020087739,0.9894484,0.0032562541,0.00052758027],"about_ca_topic_score_codex":0.0000027294318,"about_ca_topic_score_gemma":0.00008873997,"teacher_disagreement_score":0.6545781,"about_ca_system_score_codex":0.00015559708,"about_ca_system_score_gemma":0.00004607822,"threshold_uncertainty_score":0.99976474},"labels":[],"label_agreement":null},{"id":"W2795186926","doi":"10.1016/j.aam.2018.08.003","title":"On contact graphs of totally separable packings in low dimensions","year":2018,"lang":"en","type":"preprint","venue":"Advances in Applied Mathematics","topic":"Point processes and geometric inequalities","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"Nemzeti Kutatási Fejlesztési és Innovációs Hivatal; Emberi Eroforrások Minisztériuma; Natural Sciences and Engineering Research Council of Canada; Magyar Tudományos Akadémia","keywords":"Combinatorics; Mathematics; Isoperimetric inequality; Separable space; Hyperplane; Regular polygon; Convexity; Disjoint sets; Vertex (graph theory); Convex body; Euclidean space; Graph; Convex hull; Geometry; Mathematical analysis","score_opus":0.028334863422970872,"score_gpt":0.32689312108905777,"score_spread":0.2985582576660869,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2795186926","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.76388294,0.0018013216,0.016200477,0.000042898468,0.0006906192,0.0024200012,0.00017186262,0.00018999615,0.21459989],"genre_scores_gemma":[0.9145943,0.0010921966,0.0836555,0.00006807681,0.00004448084,0.00026661024,0.000024038936,0.0000868158,0.00016798617],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9966698,0.000032942466,0.0015457476,0.00057056855,0.000631752,0.00054918014],"domain_scores_gemma":[0.99468905,0.003035807,0.0011035786,0.0009661019,0.00013382242,0.00007164069],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010513144,0.0005463754,0.0014202787,0.0008787568,0.000046555542,0.000037199297,0.0005883381,0.00039641032,0.000083828614],"category_scores_gemma":[0.00132258,0.00049125234,0.00017032478,0.0008147938,0.00015444322,0.000109105575,0.00048559686,0.00074290816,0.00002549635],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006353176,0.0008922045,0.000062547886,0.009719601,0.000034139503,0.000010017369,0.0024586616,0.0006885474,0.000048527232,0.9854348,0.00017469123,0.000412744],"study_design_scores_gemma":[0.0006708795,0.000110409885,0.000022936141,0.003867283,0.000037904825,0.0000030363408,0.0008457395,0.00081467564,0.0021732447,0.9908224,0.00014897891,0.00048253947],"about_ca_topic_score_codex":0.000020806923,"about_ca_topic_score_gemma":0.00010972304,"teacher_disagreement_score":0.21443191,"about_ca_system_score_codex":0.00013846449,"about_ca_system_score_gemma":0.00012688937,"threshold_uncertainty_score":0.9997539},"labels":[],"label_agreement":null},{"id":"W2805629005","doi":"10.1016/j.aam.2018.05.005","title":"Quasisymmetric and noncommutative skew Pieri rules","year":2018,"lang":"en","type":"preprint","venue":"Advances in Applied Mathematics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Skew; Noncommutative geometry; Mathematics; Symmetric function; Algebraic number; Combinatorics; Pure mathematics; Algebra over a field; Computer science; Mathematical analysis","score_opus":0.03416511433002784,"score_gpt":0.3510484837760912,"score_spread":0.3168833694460634,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2805629005","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11848996,0.010177115,0.6367278,0.00018692862,0.003474631,0.007912814,0.00027380933,0.0013468299,0.2214101],"genre_scores_gemma":[0.086569495,0.002204279,0.90957856,0.000052492192,0.00035249293,0.00077919493,0.000030620533,0.00027063745,0.0001622036],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9950756,0.000090105124,0.0019117013,0.0011292829,0.00092100684,0.00087230327],"domain_scores_gemma":[0.9907779,0.005233017,0.0017062856,0.0018589491,0.0001981198,0.00022569355],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012189868,0.0011738824,0.002181816,0.00073240726,0.00018178976,0.00015400075,0.0012070923,0.00074124965,0.000056510075],"category_scores_gemma":[0.002479678,0.0011336076,0.00019064498,0.0007085987,0.0006419259,0.00024371032,0.0022717456,0.0015061187,0.0001378756],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034873738,0.000768248,0.000043196418,0.007254944,0.00008238771,0.000018156587,0.0043893345,0.00003510192,0.00002662084,0.97840875,0.00025389422,0.008684466],"study_design_scores_gemma":[0.0010165668,0.00009534221,0.00001280181,0.0013786296,0.00017112421,0.000021013839,0.0010477928,0.00139819,0.0006290914,0.99170154,0.0014190726,0.0011088365],"about_ca_topic_score_codex":0.0000026338264,"about_ca_topic_score_gemma":0.000019844607,"teacher_disagreement_score":0.27285078,"about_ca_system_score_codex":0.00039249915,"about_ca_system_score_gemma":0.00012241055,"threshold_uncertainty_score":0.9991114},"labels":[],"label_agreement":null},{"id":"W2904565525","doi":"10.1016/j.aam.2019.06.001","title":"Complexity of model testing for dynamical systems with toric steady states","year":2019,"lang":"en","type":"preprint","venue":"Advances in Applied Mathematics","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Engineering and Physical Sciences Research Council; Natural Sciences and Engineering Research Council of Canada","keywords":"Euclidean space; Euclidean geometry; Dynamical systems theory; Degree (music); Invariant (physics); Euclidean distance; Computer science; Mathematical optimization; Optimization problem; Computational complexity theory; Applied mathematics; Mathematics; Algorithm; Artificial intelligence; Pure mathematics; Physics","score_opus":0.04423710264542948,"score_gpt":0.30535899887708606,"score_spread":0.2611218962316566,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2904565525","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0032949916,0.0003314483,0.9918885,0.00002259585,0.00024010285,0.0010784434,0.00004069741,0.00013067183,0.00297253],"genre_scores_gemma":[0.23472682,0.000015917605,0.76495415,0.000006876083,0.000030504621,0.00016636867,0.000021187407,0.000025715864,0.000052479725],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981805,0.000017677085,0.0005993031,0.0005200053,0.0003723153,0.00031018764],"domain_scores_gemma":[0.9975239,0.0008141324,0.00069893646,0.0008063709,0.000109753695,0.000046905916],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046843124,0.000303168,0.000746961,0.000114144386,0.000043972745,0.00008055483,0.0010249423,0.00011911487,2.9752258e-7],"category_scores_gemma":[0.000076028664,0.00024402997,0.000048035625,0.0002112455,0.00009541117,0.00009233819,0.0005897022,0.00045430777,0.0000023429254],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000053827594,0.000094014016,0.00009480647,0.0036396622,0.000009740854,5.510238e-7,0.00046332268,0.73389846,0.000012695594,0.25892898,0.0000035825865,0.0028487989],"study_design_scores_gemma":[0.00025713496,0.000057747868,0.000007130219,0.00049068674,0.00001023039,0.0000026406756,0.000089376495,0.7493789,0.00001649304,0.2494513,0.000021377198,0.000216989],"about_ca_topic_score_codex":0.000015751973,"about_ca_topic_score_gemma":0.0000067604215,"teacher_disagreement_score":0.23143181,"about_ca_system_score_codex":0.00008347673,"about_ca_system_score_gemma":0.00013335404,"threshold_uncertainty_score":0.99512535},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.030439781659464517,"score_gpt":0.3267222162246508,"score_spread":0.29628243456518627,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2912937725","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018932078,0.00069180684,0.2097897,0.0000771195,0.00016792677,0.0014620062,0.000012166802,0.00028910532,0.7685781],"genre_scores_gemma":[0.310154,0.00024767657,0.688479,0.000073458774,0.000036010202,0.0004913111,0.0000027749718,0.000070266186,0.00044554024],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99808437,0.00002246288,0.00080656575,0.00033813433,0.00031559315,0.00043290146],"domain_scores_gemma":[0.9975705,0.0012089197,0.00031814282,0.00077153445,0.000032216416,0.0000986664],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00075498526,0.00029285887,0.0005185683,0.00016912486,0.00010540757,0.00003873932,0.00033635,0.00011240152,0.00020654219],"category_scores_gemma":[0.00051779416,0.00026473528,0.00009278157,0.0005154953,0.0001050435,0.00010707072,0.000046205787,0.0002068711,0.00012988754],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000013863261,0.00040488306,0.000050377606,0.00037592286,0.000007878622,0.0000012536624,0.00043499275,0.00001872262,0.0004976343,0.9958501,0.001484802,0.00087203295],"study_design_scores_gemma":[0.00046358295,0.000010926986,0.000004449636,0.00006346206,0.000022403387,0.000011451212,0.0006751652,0.000102367834,0.0037442462,0.9627958,0.031799328,0.000306824],"about_ca_topic_score_codex":5.177451e-7,"about_ca_topic_score_gemma":0.000015425761,"teacher_disagreement_score":0.76813257,"about_ca_system_score_codex":0.000050328003,"about_ca_system_score_gemma":0.000034910245,"threshold_uncertainty_score":0.9999805},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.054786008154006686,"score_gpt":0.3126195291504167,"score_spread":0.25783352099641,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2962838217","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21940139,0.008540643,0.3497631,0.0015383619,0.0007947875,0.0025278183,0.00010492707,0.0004528154,0.41687614],"genre_scores_gemma":[0.9674458,0.00076583656,0.02839369,0.00034262682,0.0002262745,0.00040499674,0.000006291594,0.000058262154,0.0023562587],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99734783,0.00009503001,0.0009818303,0.00035406536,0.0006636625,0.00055757957],"domain_scores_gemma":[0.9890174,0.009942289,0.00031671659,0.0006121294,0.00006568225,0.000045771052],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028359035,0.0003468507,0.0005506768,0.0006914306,0.00009432193,0.00005269988,0.00059197756,0.00012888495,0.00039189548],"category_scores_gemma":[0.0027347584,0.00018818887,0.00008805305,0.0018088362,0.0001929724,0.00034389214,0.000132124,0.0002567643,0.00009353925],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000047167367,0.00036151224,0.00017826779,0.0005358807,0.00001124707,0.0000057102907,0.0026150013,0.000010326006,0.00009898638,0.97978926,0.00029037212,0.01605625],"study_design_scores_gemma":[0.0010304872,0.000051876945,0.0001557735,0.00018495685,0.000018730148,0.000017993169,0.007602833,0.000022358174,0.0008547193,0.98062724,0.009105081,0.00032796068],"about_ca_topic_score_codex":0.0000044456156,"about_ca_topic_score_gemma":0.000057523983,"teacher_disagreement_score":0.7480444,"about_ca_system_score_codex":0.00011737617,"about_ca_system_score_gemma":0.00006141722,"threshold_uncertainty_score":0.767412},"labels":[],"label_agreement":null},{"id":"W2963322863","doi":"10.1016/j.aam.2013.05.003","title":"On some polynomials enumerating Fully Packed Loop configurations: Evaluation at negative values","year":2013,"lang":"en","type":"article","venue":"Advances in Applied Mathematics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Mathematics; Enumeration; Matching (statistics); Combinatorics; Loop (graph theory); Discrete mathematics; Pure mathematics; Statistics","score_opus":0.033139388690969426,"score_gpt":0.33594676923215894,"score_spread":0.3028073805411895,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963322863","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8400738,0.0010041951,0.025605578,0.0004552749,0.001640976,0.013458162,0.000041176656,0.0008661097,0.116854675],"genre_scores_gemma":[0.6940759,0.00014150419,0.30118343,0.0002714121,0.00023310844,0.0032346577,0.000029848676,0.00019743653,0.00063272874],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9956727,0.00014818108,0.0015983263,0.0006578935,0.0012227402,0.00070014456],"domain_scores_gemma":[0.99030477,0.0070610116,0.0011272203,0.0010448868,0.00030519842,0.00015691349],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012653613,0.0006389613,0.0009824813,0.00027854214,0.00032677926,0.00013023803,0.0005066817,0.0002415792,0.0005981931],"category_scores_gemma":[0.0056763096,0.000586705,0.00012822259,0.00047579655,0.00021771509,0.00085441774,0.00018244566,0.00042054136,0.0007425531],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029747009,0.00050821697,0.000005986469,0.00043711124,0.000035255165,0.0000020755713,0.002694996,0.00058412954,0.005457803,0.9834788,0.0006195083,0.006146387],"study_design_scores_gemma":[0.001792386,0.000113158836,0.000009207034,0.00034313495,0.00007560387,0.0000065660624,0.002062877,0.008762472,0.018959338,0.9672128,0.00006659743,0.0005958645],"about_ca_topic_score_codex":0.000004079916,"about_ca_topic_score_gemma":0.000015238985,"teacher_disagreement_score":0.27557784,"about_ca_system_score_codex":0.0007460002,"about_ca_system_score_gemma":0.00010400851,"threshold_uncertainty_score":0.99965847},"labels":[],"label_agreement":null},{"id":"W2963389546","doi":"10.1016/j.aam.2020.102043","title":"The asymptotics of reflectable weighted walks in arbitrary dimension","year":2020,"lang":"en","type":"preprint","venue":"Advances in Applied Mathematics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"European Research Council; Natural Sciences and Engineering Research Council of Canada; Centre National de la Recherche Scientifique; Pacific Institute for the Mathematical Sciences","keywords":"Orthant; Mathematics; Invariant (physics); Rational function; Taylor series; Dimension (graph theory); Generating function; Pure mathematics; Singularity; Combinatorics; Mathematical analysis; Mathematical physics","score_opus":0.030676941889908094,"score_gpt":0.3272588277938495,"score_spread":0.2965818859039414,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963389546","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24507646,0.024616888,0.3294493,0.002343166,0.0106152035,0.028087541,0.0002808095,0.0023681675,0.35716248],"genre_scores_gemma":[0.30645648,0.0031284464,0.6891835,0.00006181689,0.00017550633,0.0005758552,0.000026362562,0.0003022839,0.000089760964],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99416256,0.00011164534,0.0029013373,0.00086341694,0.0011065992,0.0008544188],"domain_scores_gemma":[0.98961514,0.006079022,0.00204357,0.0019751268,0.00014427691,0.00014284722],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012356645,0.0009036054,0.0020451967,0.00030388267,0.00012548333,0.0000669199,0.0016086693,0.0006477928,0.00001245967],"category_scores_gemma":[0.0017867761,0.0007300076,0.00023589972,0.00094766833,0.00033809597,0.00015920312,0.0016470781,0.002166135,0.000021438036],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010034305,0.00070812466,0.000037357622,0.0056765834,0.000050089162,0.000024337933,0.0023693072,0.00057935633,0.00071130146,0.988003,0.0001202708,0.0016199053],"study_design_scores_gemma":[0.001021567,0.00006510591,0.000006159421,0.0016620813,0.000087578046,0.0000055806745,0.00082748494,0.00839207,0.005705081,0.9807113,0.000851346,0.0006646402],"about_ca_topic_score_codex":0.0000034773454,"about_ca_topic_score_gemma":0.00006226516,"teacher_disagreement_score":0.3597342,"about_ca_system_score_codex":0.0003952582,"about_ca_system_score_gemma":0.00026166765,"threshold_uncertainty_score":0.9995151},"labels":[],"label_agreement":null},{"id":"W2964254908","doi":"10.1016/j.aam.2018.06.001","title":"Matroids with no U2,-minor and many hyperplanes","year":2018,"lang":"en","type":"article","venue":"Advances in Applied Mathematics","topic":"Finite Group Theory Research","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Matroid; Hyperplane; Mathematics; Combinatorics; Minor (academic); Prime power; Rank (graph theory); Prime (order theory); Graphic matroid; Projective geometry; Discrete mathematics; Pure mathematics; Algebraic geometry; Humanities","score_opus":0.022703685762092675,"score_gpt":0.3176895981119242,"score_spread":0.2949859123498315,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2964254908","genre_codex":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.56749755,0.00055938005,0.021837695,0.00008505268,0.00016415752,0.0016098334,0.000023811233,0.0003494746,0.40787303],"genre_scores_gemma":[0.49183464,0.00016951576,0.50621265,0.00007423655,0.00021572648,0.00017009288,0.00000458945,0.000107044274,0.0012115415],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99825394,0.000024295146,0.00041719392,0.0003725855,0.00042634734,0.0005056154],"domain_scores_gemma":[0.99786884,0.0012119537,0.00015297244,0.00059456204,0.000068817884,0.00010284617],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00058833003,0.0002934464,0.00045529762,0.00016941472,0.00011103171,0.00005472026,0.00034396877,0.00010293598,0.00018885695],"category_scores_gemma":[0.000212203,0.00022499484,0.000024672961,0.00026022244,0.0005673874,0.00016794985,0.00016476045,0.00025251275,0.00041005563],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019377038,0.0002650467,0.0008139879,0.0014127142,0.000023234224,0.000022935717,0.0016450093,0.0000017369481,0.0012220556,0.9895934,0.00024873065,0.004557366],"study_design_scores_gemma":[0.001321263,0.00036695605,0.000098575525,0.0002352354,0.000036534566,0.00011916878,0.0014231394,0.0010210745,0.0027566291,0.9842791,0.007836849,0.0005055005],"about_ca_topic_score_codex":0.0000015014512,"about_ca_topic_score_gemma":0.00004330213,"teacher_disagreement_score":0.48437494,"about_ca_system_score_codex":0.000044189128,"about_ca_system_score_gemma":0.000025414582,"threshold_uncertainty_score":0.91750234},"labels":[],"label_agreement":null},{"id":"W2964307368","doi":"10.1016/j.aam.2018.05.003","title":"Infinite products involving Dirichlet characters and cyclotomic polynomials","year":2018,"lang":"en","type":"article","venue":"Advances in Applied Mathematics","topic":"Advanced Mathematical Identities","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"Natural Sciences and Engineering Research Council of Canada; Université Paris-Sud","keywords":"Mathematics; Dirichlet distribution; Pure mathematics; Product (mathematics); Infinite product; Simple (philosophy); Class (philosophy); Sine; Mathematical analysis","score_opus":0.02852278867274694,"score_gpt":0.31447742439450294,"score_spread":0.285954635721756,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2964307368","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.90759593,0.0021413001,0.016526094,0.00044135284,0.00067484466,0.0030636117,0.000025773175,0.00082213717,0.06870893],"genre_scores_gemma":[0.6775575,0.00070882274,0.3203656,0.00016276969,0.00032912742,0.00022383081,0.0000036454398,0.00012531962,0.0005233294],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973971,0.000029255878,0.0009834613,0.00055904815,0.0004026192,0.00062851585],"domain_scores_gemma":[0.9968743,0.0016829782,0.00048706858,0.0007339515,0.00009688214,0.00012485751],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006977578,0.00044146113,0.00078618276,0.00028264654,0.00016041024,0.00009490897,0.00038116533,0.00013917236,0.000036880505],"category_scores_gemma":[0.0019388887,0.00040867092,0.000048208418,0.000473256,0.0006419506,0.0005687182,0.0003059316,0.00028980905,0.000096841395],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000033017994,0.00028633088,0.00016549774,0.0022121468,0.000025032083,0.000007927875,0.0034774435,0.0000020157838,0.014003187,0.9784938,0.00026438208,0.001029206],"study_design_scores_gemma":[0.00061017275,0.000051479168,0.00013277699,0.00037489616,0.00004396541,0.000020743706,0.000996356,0.00026091357,0.012046936,0.9830654,0.0018841875,0.0005121421],"about_ca_topic_score_codex":0.000001619133,"about_ca_topic_score_gemma":0.000030215753,"teacher_disagreement_score":0.30383953,"about_ca_system_score_codex":0.00010656847,"about_ca_system_score_gemma":0.00004072338,"threshold_uncertainty_score":0.9998365},"labels":[],"label_agreement":null},{"id":"W2972368979","doi":"10.1016/j.aam.2019.101940","title":"Generalized minimum distance functions and algebraic invariants of Geramita ideals","year":2019,"lang":"en","type":"preprint","venue":"Advances in Applied Mathematics","topic":"Commutative Algebra and Its Applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"Office of Experimental Program to Stimulate Competitive Research; Natural Sciences and Engineering Research Council of Canada; Banff International Research Station for Mathematical Innovation and Discovery; National Science Foundation","keywords":"Mathematics; Polynomial ring; Algebraic number; Ideal (ethics); Pure mathematics; Function (biology); Commutative algebra; Commutative property; Algebraic function; Commutative ring; Field (mathematics); Finite field; Polynomial; Discrete mathematics; Mathematical analysis","score_opus":0.03454414216700699,"score_gpt":0.32450857166528957,"score_spread":0.2899644294982826,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2972368979","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4141597,0.007090659,0.50267214,0.00030989325,0.00055466226,0.0053999755,0.00056889304,0.0002484316,0.06899569],"genre_scores_gemma":[0.76939213,0.0017436572,0.2271529,0.000057178677,0.000063789295,0.0007634942,0.00007957127,0.00011167207,0.00063560344],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972344,0.00005129737,0.0013156389,0.0006398539,0.00039406135,0.0003647222],"domain_scores_gemma":[0.99510527,0.00218836,0.0010968234,0.0014145161,0.000108388136,0.00008664793],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005209723,0.00050857046,0.0012455883,0.0002442445,0.000081786886,0.000051506133,0.00058164285,0.00029905187,0.000067810506],"category_scores_gemma":[0.0003546375,0.00048810054,0.00012606093,0.00033772812,0.00026662528,0.0001177335,0.0007996751,0.0006020125,0.000029251598],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024607385,0.00037000232,0.00024640653,0.0036684251,0.00007268837,0.0000012171222,0.001639801,0.00022475445,0.0006262635,0.99038655,0.0004306876,0.0023086206],"study_design_scores_gemma":[0.00077471253,0.00002508153,0.00015062891,0.0005114013,0.00012940857,0.000004423126,0.00076508045,0.002243438,0.0005292931,0.9931255,0.0012648278,0.00047622633],"about_ca_topic_score_codex":0.000005977936,"about_ca_topic_score_gemma":0.000078678,"teacher_disagreement_score":0.35523248,"about_ca_system_score_codex":0.000086576365,"about_ca_system_score_gemma":0.00011103559,"threshold_uncertainty_score":0.99975705},"labels":[],"label_agreement":null},{"id":"W2985093053","doi":"10.1016/j.aam.2019.101971","title":"The L Gagliardo-Nirenberg-Zhang inequality","year":2019,"lang":"en","type":"article","venue":"Advances in Applied Mathematics","topic":"Point processes and geometric inequalities","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"National Natural Science Foundation of China","keywords":"Nirenberg and Matthaei experiment; Mathematics; Zhàng; Inequality; Isotropy; Sobolev inequality; Kantorovich inequality; Mathematical analysis; Pure mathematics; Linear inequality; Combinatorics; Sobolev space; Law","score_opus":0.02781696221262908,"score_gpt":0.32283624274301037,"score_spread":0.2950192805303813,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2985093053","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36089137,0.0057440363,0.0567255,0.00054315187,0.0013263593,0.002601284,0.000036111855,0.00053648563,0.57159567],"genre_scores_gemma":[0.93968683,0.0010667221,0.05585419,0.000166048,0.00013611141,0.0002182367,0.000005836353,0.000070828144,0.0027951912],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977589,0.000032256507,0.0008276961,0.00030562835,0.0005275741,0.0005478908],"domain_scores_gemma":[0.9946582,0.0041692234,0.00037271637,0.00067484664,0.00006567133,0.000059400016],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001619803,0.00027402,0.00048624096,0.00013220543,0.00014807082,0.000082784565,0.00050623604,0.000105318744,0.00009404753],"category_scores_gemma":[0.0009788241,0.00018520563,0.00008639765,0.0007109654,0.00010013039,0.00021052302,0.00017480222,0.0002987684,0.00022061593],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018358804,0.00012776458,0.00039182932,0.001058883,0.00001325051,0.0000015297334,0.00088002376,0.000022386852,0.00004992651,0.98723215,0.00023372851,0.00997016],"study_design_scores_gemma":[0.0004955718,0.000030104866,0.000042676445,0.00010529967,0.000014271733,0.000004801845,0.0033292193,0.0004903405,0.0008544504,0.96601176,0.028325768,0.00029573552],"about_ca_topic_score_codex":0.00000403384,"about_ca_topic_score_gemma":0.000054243726,"teacher_disagreement_score":0.57879543,"about_ca_system_score_codex":0.0000807066,"about_ca_system_score_gemma":0.000042693788,"threshold_uncertainty_score":0.75524664},"labels":[],"label_agreement":null},{"id":"W3008937182","doi":"10.1016/j.aam.2020.102013","title":"A proof of Rado's Theorem via principal extension","year":2020,"lang":"en","type":"article","venue":"Advances in Applied Mathematics","topic":"Advanced Topology and Set Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Matroid; Partition (number theory); Combinatorics; Extension (predicate logic); Discrete mathematics","score_opus":0.028726424420218846,"score_gpt":0.31154915583095993,"score_spread":0.2828227314107411,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3008937182","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.056367464,0.000861503,0.89403224,0.00025215923,0.0001311819,0.0012906293,0.000010338018,0.00019736847,0.04685711],"genre_scores_gemma":[0.712303,0.00005971782,0.2873116,0.0001536873,0.000047801637,0.00005033456,0.0000027621215,0.00003991984,0.00003115134],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983289,0.000036471625,0.0007206837,0.00033435973,0.00025985754,0.0003197076],"domain_scores_gemma":[0.9980142,0.0010123857,0.0004014195,0.00044073723,0.000041383373,0.00008987443],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041033633,0.00025426838,0.00063187705,0.00006972539,0.00005026292,0.000004172202,0.000337158,0.00014032278,0.000083065584],"category_scores_gemma":[0.0006331696,0.00021582769,0.00007862446,0.00029605802,0.0003012906,0.00012388082,0.00014653175,0.00029922754,0.000019169162],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013859324,0.00030949316,0.000035920515,0.0009888248,0.000013421644,0.0000116041865,0.0031076048,0.00027501237,0.0031675946,0.98147947,0.000021103295,0.010451337],"study_design_scores_gemma":[0.0006946084,0.00008019372,0.0000062636386,0.00008921769,0.000026952386,0.000011052551,0.0008592947,0.0023279323,0.028248435,0.96658796,0.00084704836,0.0002210579],"about_ca_topic_score_codex":1.6922168e-7,"about_ca_topic_score_gemma":0.000003310956,"teacher_disagreement_score":0.6559355,"about_ca_system_score_codex":0.000027580172,"about_ca_system_score_gemma":0.000025065501,"threshold_uncertainty_score":0.8801198},"labels":[],"label_agreement":null},{"id":"W3037965222","doi":"10.1016/j.aam.2016.11.005","title":"Profinite automata","year":2016,"lang":"en","type":"article","venue":"Advances in Applied Mathematics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Trent University","funders":"","keywords":"Mathematics; Modulo; Uncountable set; Discrete mathematics; Sequence (biology); Algebraic number; Alphabet; Prime number; Profinite group; Primitive root modulo n; Combinatorics; Prime (order theory); Group (periodic table)","score_opus":0.00865574799174698,"score_gpt":0.24458560634197135,"score_spread":0.23592985835022437,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3037965222","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0032545386,0.0002435714,0.94286597,0.00034035195,0.00017358072,0.00023096237,0.0000023795508,0.00044412934,0.0524445],"genre_scores_gemma":[0.43805432,0.00021581711,0.5612072,0.00017806784,0.000035281144,0.00008963606,5.262579e-7,0.00001688265,0.00020228393],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99890596,0.000009639371,0.00029344327,0.00028868718,0.00021528642,0.00028697748],"domain_scores_gemma":[0.9986211,0.00046465025,0.0001171211,0.0007374924,0.000011767866,0.000047890604],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032564715,0.00014196894,0.00019097008,0.000091485104,0.000037142192,0.000039733917,0.00090043497,0.000045246652,0.000016535805],"category_scores_gemma":[0.000056726563,0.00008964767,0.000028423325,0.00028117048,0.000064202504,0.0004639866,0.0002494839,0.000059377555,0.00028778848],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000012706498,0.000062249484,0.000035956487,0.000043446627,0.0000014921918,0.000004245702,0.00020403373,0.0000041169596,0.0014939344,0.8236489,0.000048535392,0.17445181],"study_design_scores_gemma":[0.00056994916,0.00002012583,0.00008466201,0.00013475277,0.0000019871225,0.000011906125,0.000054963464,0.005473969,0.0069541475,0.97503424,0.011420758,0.00023852324],"about_ca_topic_score_codex":2.0521387e-7,"about_ca_topic_score_gemma":0.0000014573967,"teacher_disagreement_score":0.4347998,"about_ca_system_score_codex":0.000034523404,"about_ca_system_score_gemma":0.00001978377,"threshold_uncertainty_score":0.36990348},"labels":[],"label_agreement":null},{"id":"W3045827620","doi":"10.1016/j.aam.2020.102084","title":"A new capacity for the affine bounded variation","year":2020,"lang":"en","type":"article","venue":"Advances in Applied Mathematics","topic":"Point processes and geometric inequalities","field":"Mathematics","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Affine transformation; Bounded function; Euclidean space; Variation (astronomy); Euclidean geometry; Dimension (graph theory); Affine space; Bounded variation; Pure mathematics; Discrete mathematics; Mathematical analysis; Geometry","score_opus":0.07992995489309905,"score_gpt":0.32003804046748224,"score_spread":0.24010808557438318,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3045827620","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013684735,0.00034573118,0.98702246,0.0016575536,0.000105621955,0.0008317584,0.000013868435,0.000102245795,0.008552312],"genre_scores_gemma":[0.120684564,0.00020982954,0.8775643,0.00059573737,0.00048210617,0.00023423464,0.0000044343365,0.000040703006,0.00018406211],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988005,0.000007819294,0.00047834418,0.00020483889,0.00024987754,0.00025858343],"domain_scores_gemma":[0.99628687,0.0031156593,0.0002459046,0.00023776248,0.000049313352,0.000064467466],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045543668,0.00017827186,0.00032222964,0.00005513984,0.00010700026,0.00005652612,0.00031936285,0.00006502396,0.00007033516],"category_scores_gemma":[0.0019950126,0.00012561133,0.000064448825,0.0005294621,0.000036889993,0.00014882299,0.000060326107,0.00013508442,0.0000146604225],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030311487,0.00005851947,0.0000047102017,0.00087382965,0.000015363516,2.9274867e-7,0.005008732,0.00009692151,0.00007145798,0.982156,0.00092576415,0.010758096],"study_design_scores_gemma":[0.0007533426,0.000042930573,0.000007912906,0.000027579154,0.000042991083,0.0000021012688,0.0008760582,0.0056749242,0.00048491772,0.94754815,0.044369116,0.00016999805],"about_ca_topic_score_codex":0.0000061625233,"about_ca_topic_score_gemma":0.000029976765,"teacher_disagreement_score":0.119316086,"about_ca_system_score_codex":0.000041102565,"about_ca_system_score_gemma":0.000050607752,"threshold_uncertainty_score":0.5122282},"labels":[],"label_agreement":null},{"id":"W3081131020","doi":"10.1016/j.aam.2021.102192","title":"Stack-sorting with consecutive-pattern-avoiding stacks","year":2021,"lang":"en","type":"preprint","venue":"Advances in Applied Mathematics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"National Security Agency; National Sleep Foundation; Hertz Foundation; National Sanitarium Association; Division of Mathematical Sciences; National Science Foundation","keywords":"Sigma; Sorting; Permutation (music); Combinatorics; sort; Stack (abstract data type); Sorting algorithm; Mathematics; Discrete mathematics; Computer science; Algorithm; Physics; Arithmetic","score_opus":0.0326017236596314,"score_gpt":0.3269899066100177,"score_spread":0.2943881829503863,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3081131020","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15156798,0.0016780612,0.8012696,0.00006898284,0.0011617277,0.0035600278,0.00006110243,0.00080059166,0.03983191],"genre_scores_gemma":[0.5269782,0.0004252585,0.47118503,0.00006168999,0.0001825885,0.0006892054,0.000045614528,0.00034071255,0.000091693866],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9933475,0.0001421983,0.0023930988,0.0014768614,0.0014003543,0.0012399796],"domain_scores_gemma":[0.98963964,0.004905228,0.0025399611,0.002362286,0.00031624667,0.00023661401],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":["metaepi_narrow"],"category_scores_codex":[0.0013367665,0.0014144429,0.0025885757,0.0003815446,0.0002520583,0.00029408414,0.0012463267,0.0006932496,0.00008494296],"category_scores_gemma":[0.0019406087,0.0013268209,0.00025247855,0.00067106885,0.00035083125,0.00035241822,0.0017544436,0.00303406,0.000023837947],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000095603005,0.0019527883,0.00051893713,0.02333037,0.00032702184,0.00045884342,0.017689858,0.0034902284,0.0004906046,0.9445285,0.000109238375,0.007007971],"study_design_scores_gemma":[0.0015231958,0.00007340427,0.0000052778482,0.0049313465,0.00023469047,0.000058038055,0.013232133,0.0022969919,0.0044307658,0.9713232,0.00026716,0.0016237892],"about_ca_topic_score_codex":0.0000057177717,"about_ca_topic_score_gemma":0.00013439206,"teacher_disagreement_score":0.37541023,"about_ca_system_score_codex":0.000658453,"about_ca_system_score_gemma":0.00041673423,"threshold_uncertainty_score":0.9998606},"labels":[],"label_agreement":null},{"id":"W3175794586","doi":"10.1016/j.aam.2022.102481","title":"Multiplicative and semi-multiplicative functions on non-crossing partitions, and relations to cumulants","year":2023,"lang":"en","type":"article","venue":"Advances in Applied Mathematics","topic":"Advanced Mathematical Identities","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Norges Forskningsråd; Natural Sciences and Engineering Research Council of Canada; Consejo Nacional de Ciencia y Tecnología; Trond Mohn stiftelse","keywords":"Mathematics; Cumulant; Multiplicative function; Pure mathematics; Statistics; Mathematical analysis","score_opus":0.040712818654365227,"score_gpt":0.36368338297552494,"score_spread":0.3229705643211597,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3175794586","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.589098,0.0003315711,0.34949717,0.001022225,0.00020312543,0.004886172,0.00023632796,0.0011947055,0.05353074],"genre_scores_gemma":[0.73373586,0.00024036027,0.26206076,0.00010265322,0.000055427536,0.0014081232,0.000021355147,0.00010002852,0.0022754066],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980206,0.000021599888,0.00065656647,0.0005435233,0.00030654907,0.00045114287],"domain_scores_gemma":[0.9951169,0.0038843837,0.00023038272,0.00052956556,0.000061542334,0.00017721781],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003900229,0.00033047,0.0005070238,0.0003431612,0.0004506321,0.000109665634,0.00016804208,0.00011189209,0.00001746522],"category_scores_gemma":[0.0013621198,0.000312207,0.000041545863,0.00079912704,0.00035887473,0.00028231187,0.00023501863,0.00029116636,0.0003521789],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000055653054,0.00062771863,0.0008088415,0.0012281262,0.00005531062,0.000010934447,0.019962745,0.0021903694,0.0031514636,0.9643756,0.0017641083,0.005769112],"study_design_scores_gemma":[0.00063084706,0.000050571594,0.0008163539,0.0004558084,0.000038019054,0.000007992994,0.006058502,0.0061443863,0.0011470063,0.98302656,0.0012350891,0.00038883643],"about_ca_topic_score_codex":0.0000018946072,"about_ca_topic_score_gemma":0.000045915356,"teacher_disagreement_score":0.14463791,"about_ca_system_score_codex":0.00009985923,"about_ca_system_score_gemma":0.000024012057,"threshold_uncertainty_score":0.999933},"labels":[],"label_agreement":null},{"id":"W3201049436","doi":"10.1016/j.aam.2022.102436","title":"Hopf algebras of parking functions and decorated planar trees","year":2022,"lang":"en","type":"article","venue":"Advances in Applied Mathematics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"Natural Sciences and Engineering Research Council of Canada; Research Grants Council, University Grants Committee; Hong Kong Baptist University","keywords":"Hopf algebra; Mathematics; Monomial; Basis (linear algebra); Multiplication (music); Dual (grammatical number); Combinatorics; Binary tree; Monomial basis; Planar; Pure mathematics; Algebra over a field; Discrete mathematics; Computer science; Geometry","score_opus":0.0220365179771794,"score_gpt":0.2874156691679391,"score_spread":0.2653791511907597,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3201049436","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.78785145,0.002590831,0.14848587,0.00011875953,0.0011772502,0.002850646,0.00013441798,0.00060142565,0.05618935],"genre_scores_gemma":[0.81175125,0.00012399408,0.18746053,0.00002357374,0.000036870126,0.00037064083,0.000010697833,0.00007940072,0.00014303383],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99780357,0.000045671626,0.0009221722,0.00034792855,0.00051405904,0.00036659054],"domain_scores_gemma":[0.99682105,0.0019280992,0.0006418183,0.00049078284,0.000043700344,0.000074583],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005822935,0.00030151187,0.0006874933,0.0002548849,0.0002533315,0.00001738606,0.0003311933,0.000069620866,0.00007731355],"category_scores_gemma":[0.0004222495,0.00030939232,0.00006149555,0.0007123466,0.0001475749,0.00015736544,0.00025892674,0.00036632232,0.000005324075],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000045450393,0.00060819404,0.00031879553,0.00066997117,0.000030246532,0.000008570091,0.0018492916,0.0004156813,0.0012248151,0.99088085,0.00014592109,0.0038022255],"study_design_scores_gemma":[0.00094209664,0.00010259781,0.000022181212,0.00007830208,0.000055922155,0.000028939257,0.0060662637,0.0013323248,0.0008924706,0.9881919,0.001968533,0.00031846736],"about_ca_topic_score_codex":0.0000017622147,"about_ca_topic_score_gemma":0.000030944484,"teacher_disagreement_score":0.056046315,"about_ca_system_score_codex":0.000121835925,"about_ca_system_score_gemma":0.00004504995,"threshold_uncertainty_score":0.9999358},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Mathematics; Polytope; Reflection (computer programming); Pure mathematics; Combinatorics; Computer science","score_opus":0.007526119342805718,"score_gpt":0.26093743538809194,"score_spread":0.2534113160452862,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4205454290","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9648486,0.000581527,0.018019598,0.000041552456,0.0003488128,0.00031259994,0.0000062827844,0.00013266857,0.015708363],"genre_scores_gemma":[0.92073995,0.00011793986,0.078731045,0.00011160557,0.00011381445,0.000073439405,0.000005658097,0.000025782076,0.000080743586],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99873513,0.000022714608,0.0004210806,0.00030312853,0.00022948402,0.00028846692],"domain_scores_gemma":[0.99922514,0.00026015498,0.0001709541,0.00029594422,0.000015767062,0.000032022726],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036375917,0.00018661912,0.0002800274,0.00008854281,0.00012255822,0.00008597865,0.00017523514,0.000107310574,0.00012718591],"category_scores_gemma":[0.00006942907,0.00017245773,0.000023075938,0.00016353157,0.00007428359,0.0002207975,0.00013764946,0.000084115265,0.00005018287],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029033388,0.00017512188,0.00022942433,0.00024610502,0.0000026305838,0.000008980833,0.00046012946,0.0006128027,0.843907,0.15326399,0.0001385354,0.00092624535],"study_design_scores_gemma":[0.0007334563,0.000076285985,0.00041211417,0.000087886736,0.00002257189,0.000019643776,0.00024062567,0.0005173178,0.56831574,0.42440495,0.0047317776,0.00043762918],"about_ca_topic_score_codex":0.000023387784,"about_ca_topic_score_gemma":0.00009753949,"teacher_disagreement_score":0.27559128,"about_ca_system_score_codex":0.00003920908,"about_ca_system_score_gemma":0.000011963605,"threshold_uncertainty_score":0.7032622},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.020491105614861168,"score_gpt":0.3195110390553648,"score_spread":0.29901993344050365,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4212872005","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41293517,0.0015856425,0.48719594,0.00010415764,0.00034051735,0.000565168,0.000002995563,0.00018441165,0.097086],"genre_scores_gemma":[0.89015,0.00046167555,0.10882459,0.00014550892,0.00009262587,0.00001929333,0.000002027458,0.000023332434,0.00028093497],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99872714,0.00000822209,0.00048257541,0.00024244728,0.00018974241,0.00034985025],"domain_scores_gemma":[0.99757445,0.0019030477,0.00018626252,0.0002565341,0.000015839909,0.00006388625],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060315756,0.00018304742,0.00033703874,0.00026685413,0.0000736697,0.000020753738,0.000132329,0.00015368559,0.00007974452],"category_scores_gemma":[0.00034380768,0.00016306009,0.000033299704,0.00047039238,0.00010456476,0.00013470324,0.00008194615,0.0002321102,0.000010508097],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032323405,0.0001699027,0.00039657328,0.00027069,0.000011066465,0.000011682941,0.0013577556,0.000010223247,0.000118978256,0.96387213,0.00012244385,0.033626225],"study_design_scores_gemma":[0.0007860187,0.000046535897,0.00025373217,0.00005676315,0.000019051968,0.000023568437,0.0013620469,0.00014932024,0.0009802297,0.9933835,0.002722651,0.00021655957],"about_ca_topic_score_codex":0.000004843789,"about_ca_topic_score_gemma":0.00014542106,"teacher_disagreement_score":0.47721484,"about_ca_system_score_codex":0.000034998135,"about_ca_system_score_gemma":0.0000094503675,"threshold_uncertainty_score":0.66493976},"labels":[],"label_agreement":null},{"id":"W4291177049","doi":"10.1016/j.aam.2009.03.002","title":"A filtration of <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.gif\" overflow=\"scroll\"><mml:mo stretchy=\"false\">(</mml:mo><mml:mi>q</mml:mi><mml:mo>,</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy=\"false\">)</mml:mo></mml:math>-Catalan numbers","year":2009,"lang":"lv","type":"article","venue":"Advances in Applied Mathematics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Fields Institute for Research in Mathematical Sciences; York University","funders":"","keywords":"Mathematics; Differential operator; Series (stratigraphy); Operator (biology); Algorithm; Catalan number; Diagonal; Combinatorics; Discrete mathematics; Pure mathematics; Geometry","score_opus":0.01661492265205911,"score_gpt":0.26181337642971936,"score_spread":0.24519845377766025,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4291177049","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9555642,0.0021897394,0.013380513,0.0003925231,0.0029146622,0.00069889793,0.00073305896,0.00085946947,0.023266964],"genre_scores_gemma":[0.9273693,0.0022884444,0.06468722,0.0006389565,0.0015604241,0.0014989434,0.00066570664,0.001164875,0.00012610467],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9840396,0.00037117905,0.005135217,0.0027426388,0.004290936,0.0034204167],"domain_scores_gemma":[0.98421335,0.004516893,0.0059091854,0.0036861594,0.00045185362,0.0012225271],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","research_integrity","insufficient_payload"],"consensus_categories":["metaepi_narrow","research_integrity","insufficient_payload"],"category_scores_codex":[0.0030370154,0.0022142355,0.0016629539,0.00081293035,0.0014821122,0.0011861753,0.0035611873,0.0031259812,0.0009874332],"category_scores_gemma":[0.0036944726,0.003358014,0.0019246694,0.002125454,0.001875148,0.002155729,0.0018445145,0.0028841125,0.0019507607],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010020914,0.0021001224,0.000009612284,0.006275932,0.0011892463,0.0004040999,0.0077471365,0.0042153015,0.0035829884,0.9636307,0.0047824355,0.005060372],"study_design_scores_gemma":[0.003947153,0.0018256584,0.0000061764276,0.0037663914,0.0020140805,0.00076003425,0.007377673,0.09218924,0.23192465,0.6514402,0.0018733758,0.0028753695],"about_ca_topic_score_codex":0.0002603602,"about_ca_topic_score_gemma":0.0004943999,"teacher_disagreement_score":0.31219047,"about_ca_system_score_codex":0.00016492693,"about_ca_system_score_gemma":0.0012123246,"threshold_uncertainty_score":0.9999258},"labels":[],"label_agreement":null},{"id":"W4300944187","doi":"10.1016/j.aam.2006.05.006","title":"Counting unlabelled toroidal graphs with no <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.gif\" overflow=\"scroll\"><mml:msub><mml:mi>K</mml:mi><mml:mrow><mml:mn>3</mml:mn><mml:mo>,</mml:mo><mml:mn>3</mml:mn></mml:mrow></mml:msub></mml:math>-subdivisions","year":2007,"lang":"lv","type":"article","venue":"Advances in Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Scroll; Mathematics; Toroid; Combinatorics; Physics; Theology; Philosophy","score_opus":0.01626335641312451,"score_gpt":0.26011814077966683,"score_spread":0.24385478436654232,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4300944187","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5016634,0.0036436585,0.05025694,0.0003987119,0.0032960726,0.0002828552,0.00046101515,0.00073958974,0.43925774],"genre_scores_gemma":[0.92297405,0.0025021245,0.06878136,0.0011381158,0.0012816249,0.0014621239,0.0004989665,0.0010039344,0.00035767216],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9844269,0.00041263917,0.0031410996,0.002971219,0.0047201375,0.0043279873],"domain_scores_gemma":[0.9858909,0.005061902,0.0032139816,0.0039211507,0.00041123698,0.0015008169],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","research_integrity","insufficient_payload"],"consensus_categories":["metaepi_narrow","sts","research_integrity","insufficient_payload"],"category_scores_codex":[0.005132062,0.0015280934,0.00078706053,0.0010931925,0.0026512193,0.0018631908,0.004898544,0.0021649397,0.038508322],"category_scores_gemma":[0.0021656544,0.0025437137,0.0015089369,0.0033529985,0.0031374968,0.0027780745,0.0037964114,0.0030138493,0.0028752293],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001654273,0.0008549497,0.00002444541,0.002378897,0.0010317354,0.001385092,0.0039802603,0.0041514034,0.0036042074,0.94120747,0.033642415,0.006084878],"study_design_scores_gemma":[0.0041284473,0.0022478711,0.00003409313,0.0027716768,0.0010261866,0.0014097991,0.004357594,0.12278672,0.8326587,0.016802026,0.0085077975,0.0032690882],"about_ca_topic_score_codex":0.0003552489,"about_ca_topic_score_gemma":0.0014372548,"teacher_disagreement_score":0.9244054,"about_ca_system_score_codex":0.000060660852,"about_ca_system_score_gemma":0.0015678619,"threshold_uncertainty_score":0.9997468},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Mathematics; Hook; Dual (grammatical number); Skew; Combinatorics; Dual function; Discrete mathematics; Pure mathematics; Computer science","score_opus":0.03220997425033819,"score_gpt":0.32716439006447323,"score_spread":0.29495441581413506,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4367313129","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32285023,0.00095563446,0.31244105,0.0005256282,0.0051548537,0.006173462,0.00013634277,0.0074429135,0.34431988],"genre_scores_gemma":[0.6376722,0.0006292446,0.35607365,0.00008814796,0.00048243534,0.0011043249,0.000059159844,0.00039758178,0.0034932408],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9967422,0.00003885497,0.0011300932,0.0005366225,0.00071493594,0.00083732285],"domain_scores_gemma":[0.9951453,0.0031880713,0.0004463828,0.0009991662,0.000073747084,0.0001473416],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000983141,0.00049000874,0.00078000734,0.00046588192,0.00019387354,0.000054527543,0.00045580746,0.0002020739,0.00008166449],"category_scores_gemma":[0.0014297683,0.00046959842,0.00014573176,0.0021139132,0.00014163715,0.0003183981,0.00029192754,0.0004624746,0.0009996312],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027223128,0.0003955235,0.00006337643,0.000781018,0.000029685563,0.000044735687,0.0011844174,0.0008362612,0.0006969063,0.990913,0.0013210876,0.003706763],"study_design_scores_gemma":[0.0009984149,0.000040909006,0.000029563374,0.00013806697,0.000050664017,0.000022309292,0.0017573227,0.0024801162,0.0008816877,0.9859847,0.0070982096,0.0005180699],"about_ca_topic_score_codex":8.636691e-7,"about_ca_topic_score_gemma":0.000011724885,"teacher_disagreement_score":0.34082663,"about_ca_system_score_codex":0.00018098681,"about_ca_system_score_gemma":0.000054600827,"threshold_uncertainty_score":0.9997782},"labels":[],"label_agreement":null},{"id":"W4384520312","doi":"10.1016/j.aam.2023.102566","title":"k-Factorizations of the full cycle and generalized Mahonian statistics on k-forests","year":2023,"lang":"en","type":"article","venue":"Advances in Applied Mathematics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University; Saint Mary's University","funders":"","keywords":"Mathematics; Bijection; Bijection, injection and surjection; Combinatorics; Statistics; Context (archaeology); Interpretation (philosophy); Set (abstract data type); Discrete mathematics; Geography","score_opus":0.02160199647648914,"score_gpt":0.3158093450087021,"score_spread":0.294207348532213,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4384520312","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7449912,0.000247383,0.22542137,0.00032688517,0.0018922696,0.004098244,0.0003543103,0.0007747122,0.021893622],"genre_scores_gemma":[0.6736789,0.00028693114,0.3253172,0.00003406392,0.00007334803,0.00019235452,0.0000116470055,0.000121628516,0.00028393866],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979541,0.000037576025,0.0008012198,0.00029415035,0.0005270921,0.00038588425],"domain_scores_gemma":[0.99630475,0.0022667728,0.0005009996,0.0007915321,0.00006253699,0.0000734006],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036446285,0.00030185995,0.0005406634,0.00017969796,0.00013199021,0.00002372261,0.00043170003,0.000115765026,0.0000146151315],"category_scores_gemma":[0.0011703534,0.00023019574,0.000056697867,0.00092419,0.00021605767,0.00009717212,0.00023028976,0.00024644428,0.000026454916],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016045891,0.00018919253,0.00018052942,0.00073276786,0.000012677974,0.000002486034,0.0011524067,0.0010486885,0.00061838835,0.9947034,0.00021015246,0.0011332418],"study_design_scores_gemma":[0.0007719177,0.000046936042,0.00019792728,0.0001958466,0.000032564807,0.000003989494,0.00035105774,0.0044371774,0.0020533917,0.99108607,0.00058491994,0.00023818419],"about_ca_topic_score_codex":0.0000011784947,"about_ca_topic_score_gemma":0.00005281792,"teacher_disagreement_score":0.099895835,"about_ca_system_score_codex":0.00007079419,"about_ca_system_score_gemma":0.0000525621,"threshold_uncertainty_score":0.93871105},"labels":[],"label_agreement":null},{"id":"W4385290098","doi":"10.1016/j.aam.2023.102593","title":"Rota's basis conjecture for matroids with density close to one","year":2023,"lang":"en","type":"article","venue":"Advances in Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Thompson Rivers University","funders":"","keywords":"Matroid; Mathematics; Disjoint sets; Combinatorics; Conjecture; Rainbow; Basis (linear algebra); Rank (graph theory); Graphic matroid; Discrete mathematics; Geometry","score_opus":0.019146766410876957,"score_gpt":0.304987635809085,"score_spread":0.285840869398208,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385290098","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025187766,0.00006370472,0.97034675,0.0003933943,0.00006548618,0.0014192299,0.000009723632,0.00035180748,0.0021621576],"genre_scores_gemma":[0.20253266,0.000046351204,0.79642016,0.00017075358,0.00003487375,0.000615669,0.0000045052575,0.00003627694,0.0001387298],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981039,0.00001724213,0.0003003688,0.00052532495,0.00045616517,0.0005970107],"domain_scores_gemma":[0.99791455,0.0009223139,0.00009881385,0.00086353376,0.00006689598,0.00013390851],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006229569,0.00021916993,0.0003672343,0.0003096866,0.00012521833,0.00007190774,0.0009556068,0.00006632889,0.0000043932687],"category_scores_gemma":[0.00014328836,0.00018708468,0.000046004578,0.0017012649,0.00009152364,0.00025401055,0.00034495536,0.00019276328,0.000116625175],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006373224,0.000095794276,0.00010056449,0.00029372817,0.000011828019,0.000011930183,0.0010585638,0.0020135753,0.001266146,0.96811,0.0000927021,0.026881436],"study_design_scores_gemma":[0.0007047781,0.00016375487,0.000089348454,0.00008174617,0.000006281554,0.000008196031,0.00022914432,0.0067034503,0.013292417,0.9762007,0.0022148993,0.00030526845],"about_ca_topic_score_codex":6.5263276e-7,"about_ca_topic_score_gemma":0.000041537685,"teacher_disagreement_score":0.1773449,"about_ca_system_score_codex":0.00006567319,"about_ca_system_score_gemma":0.000042547897,"threshold_uncertainty_score":0.7629092},"labels":[],"label_agreement":null},{"id":"W4391425602","doi":"10.1016/j.aam.2024.102673","title":"Block-counting sequences are not purely morphic","year":2024,"lang":"en","type":"article","venue":"Advances in Applied Mathematics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Block (permutation group theory); Arithmetic; Combinatorics; Discrete mathematics","score_opus":0.013040888794188792,"score_gpt":0.25576779638567254,"score_spread":0.24272690759148374,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391425602","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07386082,0.0133703975,0.84972364,0.0013193395,0.0017508987,0.000777468,0.000013860807,0.0022976876,0.05688589],"genre_scores_gemma":[0.81696486,0.0002498159,0.18230984,0.00023082101,0.000085223444,0.00005932147,9.196311e-7,0.000020210276,0.00007900901],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985061,0.000010612319,0.00037680438,0.00042886037,0.00034190642,0.00033569586],"domain_scores_gemma":[0.9988205,0.0005150336,0.00012181492,0.00048131603,0.000016131351,0.00004521457],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005394072,0.00020007252,0.00025652253,0.00015455055,0.00007431933,0.0002850107,0.0008730012,0.00006757733,0.000010697747],"category_scores_gemma":[0.00004839222,0.00016814894,0.000051105555,0.000612979,0.00008027568,0.0005563596,0.00021444153,0.00022974185,0.00016917272],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000010116185,0.000043685253,0.000024722405,0.00047027817,0.0000063744037,0.00005965956,0.00092319655,0.00057994906,0.0016684415,0.9685974,0.00005982636,0.02756544],"study_design_scores_gemma":[0.00013821313,0.000015325853,0.000034726294,0.0005974238,0.00000957275,0.00006562037,0.00053536496,0.1745353,0.007538174,0.8070491,0.009090992,0.00039017128],"about_ca_topic_score_codex":0.0000015901326,"about_ca_topic_score_gemma":0.00000680137,"teacher_disagreement_score":0.74310404,"about_ca_system_score_codex":0.000047523914,"about_ca_system_score_gemma":0.000035735993,"threshold_uncertainty_score":0.6856914},"labels":[],"label_agreement":null},{"id":"W4396883523","doi":"10.1016/j.aam.2024.102718","title":"Homogeneous sets in graphs and a chromatic multisymmetric function","year":2024,"lang":"en","type":"article","venue":"Advances in Applied Mathematics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Ministry of Colleges and Universities; Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada; Government of Ontario","keywords":"Mathematics; Chromatic scale; Combinatorics; Vertex (graph theory); Homogeneous; Conjecture; Symmetric function; Chromatic polynomial; Partition (number theory); Discrete mathematics; Function (biology); Graph","score_opus":0.01685311574104006,"score_gpt":0.3047257048523718,"score_spread":0.2878725891113318,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4396883523","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7771872,0.026154194,0.14840542,0.00012216321,0.0023629642,0.0050871545,0.00003146875,0.0019188331,0.038730565],"genre_scores_gemma":[0.74382305,0.0008545289,0.25471726,0.00002453836,0.000034172215,0.00035830215,0.0000040202553,0.00011849991,0.000065636836],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973368,0.000033267163,0.0010423893,0.00057329674,0.00046887153,0.00054535066],"domain_scores_gemma":[0.9962007,0.002911666,0.00020399976,0.0005524916,0.000028651084,0.00010253868],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006881503,0.00045429618,0.0007434029,0.0009228336,0.00006429783,0.00009630389,0.00027239422,0.0001961315,0.00002220773],"category_scores_gemma":[0.0006652757,0.00042511043,0.00007790026,0.0018907554,0.00012990899,0.00034585432,0.00015141562,0.00045855064,0.000051753585],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016440683,0.00035172372,0.00006733696,0.0044925367,0.00002143971,0.000069641996,0.001602964,0.00007266453,0.00032451787,0.9657955,0.000040485877,0.027144732],"study_design_scores_gemma":[0.0007807822,0.00007171393,0.00003778984,0.0008390322,0.000057681613,0.00006843689,0.00064082316,0.012046915,0.0003411431,0.98412335,0.0005553355,0.00043698115],"about_ca_topic_score_codex":0.00000250647,"about_ca_topic_score_gemma":0.00005686704,"teacher_disagreement_score":0.10631185,"about_ca_system_score_codex":0.00020646327,"about_ca_system_score_gemma":0.000042896514,"threshold_uncertainty_score":0.99982005},"labels":[],"label_agreement":null},{"id":"W4396921228","doi":"10.1016/j.aam.2024.102721","title":"Automatic sequences and the Glaisher–Kinkelin constant","year":2024,"lang":"en","type":"article","venue":"Advances in Applied Mathematics","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"Killam Trusts","keywords":"Mathematics; Constant (computer programming); Combinatorics; Computer science","score_opus":0.008344055255536602,"score_gpt":0.2605381709525949,"score_spread":0.2521941156970583,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4396921228","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019304374,0.0126793515,0.9650668,0.0005666261,0.00034769485,0.0003957572,0.0000041218727,0.00028572205,0.01872352],"genre_scores_gemma":[0.3927944,0.0014888209,0.6053709,0.00016284025,0.00004326655,0.00009431511,0.0000016466659,0.000011137487,0.000032705422],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990234,0.000018039907,0.00029335992,0.0002629529,0.00022667265,0.00017558083],"domain_scores_gemma":[0.9985901,0.00091654167,0.000060018436,0.00039115924,0.000009208836,0.000032932992],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052380183,0.00012804239,0.00020068021,0.000058859143,0.000081445956,0.0002860087,0.0005440999,0.000034909277,0.000011623813],"category_scores_gemma":[0.000037459507,0.00007221339,0.000023132856,0.00030348796,0.00024326082,0.000416982,0.0002859858,0.00014963342,0.000030421943],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000011924678,0.000012775826,0.000005102291,0.00018004201,0.0000033881674,0.000009940823,0.0011448904,0.00003883189,0.000025777796,0.85031796,0.00006144274,0.1481987],"study_design_scores_gemma":[0.00021746675,0.000006226566,0.000005099684,0.00017214665,0.000003961802,0.000025868425,0.00021178856,0.4910202,0.00007452382,0.5027633,0.0054110545,0.00008837847],"about_ca_topic_score_codex":0.0000033672743,"about_ca_topic_score_gemma":0.0000062232016,"teacher_disagreement_score":0.49098137,"about_ca_system_score_codex":0.000019076895,"about_ca_system_score_gemma":0.000035505727,"threshold_uncertainty_score":0.29447767},"labels":[],"label_agreement":null},{"id":"W4400876525","doi":"10.1016/j.aam.2024.102742","title":"General coefficient-vanishing results associated with theta series","year":2024,"lang":"en","type":"article","venue":"Advances in Applied Mathematics","topic":"Advanced Mathematical Identities","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Mathematics; Series (stratigraphy); Pure mathematics; Mathematical analysis; Geology","score_opus":0.024502287921519966,"score_gpt":0.30974015166393165,"score_spread":0.28523786374241167,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400876525","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.066285424,0.004164415,0.2984542,0.0005650756,0.0010707668,0.003349223,0.00025693185,0.003732846,0.62212116],"genre_scores_gemma":[0.48215985,0.00046592188,0.5023052,0.000061822495,0.00021242113,0.00040596238,0.000056943572,0.00033851966,0.013993327],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9968313,0.000036497026,0.0010548278,0.0006191764,0.0007646442,0.0006935562],"domain_scores_gemma":[0.9958993,0.0029414408,0.00029477823,0.0006856446,0.00007136187,0.00010744065],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009471969,0.00049555703,0.00073903723,0.00023635088,0.00014387014,0.0002750279,0.0004691701,0.00015922678,0.000046340516],"category_scores_gemma":[0.0015019705,0.00038370502,0.00009856895,0.0008292554,0.00033631583,0.00077698723,0.00017574731,0.00049994054,0.00007643124],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000047602494,0.000310549,0.0000063648035,0.0012510996,0.00005309558,0.000084848565,0.002887948,0.0008493551,0.0002652166,0.99316484,0.00038386395,0.00069520023],"study_design_scores_gemma":[0.0006680938,0.00007845819,0.000004663131,0.0014454457,0.00008704428,0.000046624515,0.0017791967,0.0058778375,0.0020017861,0.9849202,0.002564697,0.00052593806],"about_ca_topic_score_codex":0.0000012827926,"about_ca_topic_score_gemma":0.000120731536,"teacher_disagreement_score":0.60812783,"about_ca_system_score_codex":0.0002324498,"about_ca_system_score_gemma":0.00007112094,"threshold_uncertainty_score":0.9998615},"labels":[],"label_agreement":null},{"id":"W4400879021","doi":"10.1016/j.aam.2024.102741","title":"Global positioning: The uniqueness question and a new solution method","year":2024,"lang":"en","type":"article","venue":"Advances in Applied Mathematics","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Division of Mathematical Sciences; Banff International Research Station for Mathematical Innovation and Discovery","keywords":"Mathematics; Uniqueness; Calculus (dental); Applied mathematics; Mathematical analysis","score_opus":0.01537942158127803,"score_gpt":0.32879612699322314,"score_spread":0.3134167054119451,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400879021","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0004240738,0.0024605747,0.99211586,0.00083486916,0.00019043348,0.00015685808,8.5677806e-7,0.00010764428,0.003708842],"genre_scores_gemma":[0.16322987,0.00013229888,0.8363806,0.000107809195,0.00006663175,0.000024598208,0.0000037776388,0.0000036070844,0.000050828134],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993719,0.00002483248,0.00016089581,0.00019387437,0.0001473449,0.00010119141],"domain_scores_gemma":[0.99951744,0.0002625993,0.00003699033,0.00013736435,0.0000159701,0.000029623234],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042089546,0.000079715086,0.000077558885,0.000053977787,0.00007633998,0.00016962398,0.00015973714,0.000031608237,0.0000014613986],"category_scores_gemma":[0.000024956995,0.00006082576,0.000015233436,0.0005843304,0.000020600735,0.00032132596,0.00007328768,0.00006204293,0.0000062940344],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000010321286,0.000009779979,0.000004457395,0.000044452074,0.00000204357,0.0000010859458,0.00027705287,0.0076616937,0.00013444545,0.80107737,0.000049282255,0.1907373],"study_design_scores_gemma":[0.000055699755,0.0000092385835,0.000077011035,0.000046287758,0.0000043768873,0.00003261448,0.00002091495,0.36098242,0.00031421377,0.6355915,0.002806637,0.00005905437],"about_ca_topic_score_codex":0.0000054744905,"about_ca_topic_score_gemma":0.000016427319,"teacher_disagreement_score":0.35332075,"about_ca_system_score_codex":0.000057454014,"about_ca_system_score_gemma":0.000058935486,"threshold_uncertainty_score":0.24804026},"labels":[],"label_agreement":null},{"id":"W4402919518","doi":"10.1016/j.aam.2024.102787","title":"A topological approach to mapping space signatures","year":2024,"lang":"en","type":"article","venue":"Advances in Applied Mathematics","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Air Force Office of Scientific Research; Office of Naval Research; Engineering and Physical Sciences Research Council; Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Topological space; Topology (electrical circuits); Space (punctuation); Pure mathematics; Combinatorics; Computer science","score_opus":0.019086095157435486,"score_gpt":0.27338754682010463,"score_spread":0.25430145166266915,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402919518","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005688077,0.0023066602,0.9055894,0.0004709854,0.000107847016,0.00017862179,0.000003009684,0.0002459253,0.090528734],"genre_scores_gemma":[0.3683295,0.000108262815,0.631041,0.00022870665,0.000039360897,0.00006087088,0.0000025643462,0.0000052318114,0.00018453595],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986175,0.000012024917,0.0002736754,0.0005037235,0.00027697627,0.00031613055],"domain_scores_gemma":[0.9989771,0.00045493167,0.000036089932,0.00043227864,0.000010944694,0.000088611414],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003398287,0.00016042298,0.00027741547,0.00038318706,0.00004801398,0.00017097889,0.00091493863,0.00008155708,0.000019007084],"category_scores_gemma":[0.00013369914,0.00011100181,0.00006094269,0.0027695093,0.00005299809,0.00021920819,0.00042029945,0.00022375066,0.00015324532],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[7.738367e-7,0.00010086255,0.0000063582866,0.00009561637,0.0000068054487,0.000012879223,0.00049265014,0.0013642879,0.00009301067,0.96631193,0.00021978348,0.031295042],"study_design_scores_gemma":[0.00009909555,0.000036934107,0.00006024116,0.000052425854,0.000009298687,0.000012175382,0.0005260251,0.066024296,0.00024634055,0.8532012,0.0793895,0.00034247362],"about_ca_topic_score_codex":0.0000017943256,"about_ca_topic_score_gemma":0.0000016700133,"teacher_disagreement_score":0.3677607,"about_ca_system_score_codex":0.00003734109,"about_ca_system_score_gemma":0.000012712911,"threshold_uncertainty_score":0.45265225},"labels":[],"label_agreement":null},{"id":"W4405466740","doi":"10.1016/j.aam.2024.102834","title":"Letter frequency vs factor frequency in pure morphic words","year":2024,"lang":"en","type":"article","venue":"Advances in Applied Mathematics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"","keywords":"Mathematics; Factor (programming language); Frequency factor; Arithmetic; Combinatorics; Statistics; Discrete mathematics; Computer science; Physics; Programming language","score_opus":0.010677687350299388,"score_gpt":0.25297696468321423,"score_spread":0.24229927733291484,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405466740","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.046017606,0.011487798,0.89517105,0.001576512,0.0013970787,0.0008216102,0.000019373088,0.0009628443,0.042546116],"genre_scores_gemma":[0.75269747,0.0002464894,0.24607956,0.0006397306,0.00011437857,0.00012630208,0.000003196081,0.000032348184,0.000060497998],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981674,0.000020807127,0.00052059046,0.00051938294,0.00032707994,0.0004447702],"domain_scores_gemma":[0.9987528,0.00040562663,0.00008296189,0.0006896093,0.00001064621,0.00005838281],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033503675,0.00026829832,0.00033208882,0.000292946,0.000037264057,0.00018344917,0.0010186172,0.0001134951,0.000067840185],"category_scores_gemma":[0.000039117458,0.0002297702,0.000060062554,0.0009045932,0.000074621676,0.0007338533,0.00017799075,0.00040248557,0.00021115923],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000011253902,0.000082964994,0.00021492767,0.0004014019,0.0000051486913,0.00011398809,0.0021480918,0.00007825711,0.0013452533,0.9712858,0.00012312965,0.024199862],"study_design_scores_gemma":[0.00019526936,0.00002097841,0.00014250848,0.0003590992,0.0000034786187,0.000017956509,0.0000832196,0.016128955,0.0010660071,0.97882926,0.002808307,0.00034498167],"about_ca_topic_score_codex":0.0000046494147,"about_ca_topic_score_gemma":0.000032627075,"teacher_disagreement_score":0.7066799,"about_ca_system_score_codex":0.000112310954,"about_ca_system_score_gemma":0.000050778777,"threshold_uncertainty_score":0.9369757},"labels":[],"label_agreement":null},{"id":"W4405592922","doi":"10.1016/j.aam.2024.102830","title":"Conditions for virtually Cohen–Macaulay simplicial complexes","year":2024,"lang":"en","type":"article","venue":"Advances in Applied Mathematics","topic":"Commutative Algebra and Its Applications","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Mathematics; Combinatorics; Simplicial complex; Pure mathematics; Abstract simplicial complex; Algebra over a field","score_opus":0.03847092321700594,"score_gpt":0.38963789777064406,"score_spread":0.3511669745536381,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405592922","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032082282,0.0012768595,0.8900533,0.00065859343,0.0003082643,0.0033824714,0.00050049095,0.00078439206,0.07095335],"genre_scores_gemma":[0.7619641,0.00012872339,0.23498537,0.0001709991,0.00019476305,0.0020427487,0.00009511052,0.00010577095,0.00031245468],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99847156,0.000012718985,0.0006164729,0.0003441533,0.00021727268,0.00033784556],"domain_scores_gemma":[0.9951833,0.004157638,0.00011947746,0.00042062334,0.00005260793,0.000066347806],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030354667,0.00025719154,0.00040321704,0.00017837425,0.0001714737,0.00008781311,0.0003234711,0.000085918065,0.00011443244],"category_scores_gemma":[0.00020181917,0.00023719796,0.00011148625,0.00042435413,0.00016357344,0.00017636895,0.000079695725,0.00020860959,0.00009452456],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007726143,0.00019211372,0.0000055969927,0.0007292316,0.0000268571,0.0000015532289,0.0012594231,0.000043929205,0.0031470128,0.98744154,0.0023774463,0.0047675776],"study_design_scores_gemma":[0.00034195062,0.000037750888,0.0000147679675,0.00013161915,0.000059340593,0.0000075661414,0.0007792737,0.004765569,0.0016192243,0.9531318,0.03883942,0.00027170053],"about_ca_topic_score_codex":8.661607e-7,"about_ca_topic_score_gemma":0.00005503394,"teacher_disagreement_score":0.72988176,"about_ca_system_score_codex":0.00008078425,"about_ca_system_score_gemma":0.000056530287,"threshold_uncertainty_score":0.9672652},"labels":[],"label_agreement":null},{"id":"W4409180157","doi":"10.1016/j.aam.2025.102887","title":"The extra basis in noncommuting variables","year":2025,"lang":"en","type":"article","venue":"Advances in Applied Mathematics","topic":"Advanced Topics in Algebra","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Basis (linear algebra); Algebra over a field; Mathematical economics; Pure mathematics; Geometry","score_opus":0.021432978718703262,"score_gpt":0.33050388708356976,"score_spread":0.3090709083648665,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409180157","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02383125,0.0036010414,0.32290897,0.0005797735,0.0006807246,0.0016496606,0.0000055137516,0.0002896276,0.64645344],"genre_scores_gemma":[0.27873474,0.000996339,0.71872115,0.0001598775,0.0000577845,0.00040542547,0.0000018471314,0.000056325138,0.0008665185],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99785656,0.000040129882,0.0009526574,0.00032868522,0.0002813682,0.00054060936],"domain_scores_gemma":[0.99185824,0.00691934,0.00026480874,0.00089212094,0.000031492567,0.00003397951],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012116359,0.00027933007,0.00046381258,0.00018882632,0.00020558549,0.000057735353,0.00075616007,0.00012971583,0.000016813254],"category_scores_gemma":[0.0014938358,0.0002201452,0.000057125762,0.0008631204,0.0001829568,0.00015096158,0.0002786816,0.0005196504,0.000013679324],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011009558,0.00015987686,0.00033053613,0.00038479068,0.0000092803175,0.000004369351,0.000630453,0.00013595697,0.000079703444,0.9717917,0.00007435023,0.02638796],"study_design_scores_gemma":[0.00056475814,0.0000063756365,0.000043468463,0.000350003,0.0000136941435,0.000002342093,0.0020777714,0.0011502566,0.0013181444,0.9852983,0.008965751,0.00020918442],"about_ca_topic_score_codex":0.000002126669,"about_ca_topic_score_gemma":0.00025137299,"teacher_disagreement_score":0.6455869,"about_ca_system_score_codex":0.00021058481,"about_ca_system_score_gemma":0.00005951416,"threshold_uncertainty_score":0.89772606},"labels":[],"label_agreement":null},{"id":"W4411406868","doi":"10.1016/j.aam.2025.102926","title":"On the average number of cycles in conjugacy class products","year":2025,"lang":"en","type":"article","venue":"Advances in Applied Mathematics","topic":"Analytic Number Theory Research","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Mathematics; Conjugacy class; Class (philosophy); Combinatorics; Pure mathematics","score_opus":0.028446757533561372,"score_gpt":0.36185997822150856,"score_spread":0.3334132206879472,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411406868","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40771747,0.00015028343,0.00606665,0.00075765024,0.00010218533,0.0015706806,0.000007647979,0.00005971972,0.58356774],"genre_scores_gemma":[0.97639924,0.00009967613,0.021756526,0.000120757424,0.00001778076,0.00015908347,0.0000014081435,0.00003180061,0.0014137366],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981247,0.00007388853,0.00071767275,0.0003004041,0.00042361132,0.00035968286],"domain_scores_gemma":[0.9933605,0.005502662,0.00021723051,0.00083390274,0.000058766058,0.000026931111],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014516049,0.00021819724,0.00050819933,0.00017408458,0.00004724439,0.000019543042,0.00057435135,0.0000862558,0.00015547137],"category_scores_gemma":[0.0020176081,0.00015415152,0.000051462026,0.0008769638,0.00028460016,0.000076139164,0.00017105421,0.0004121823,0.000075441094],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000049610248,0.000491511,0.00048059988,0.0010358454,0.000018725737,0.000004869255,0.0008184542,0.00014022422,0.00016814066,0.9954162,0.0003994915,0.00097628986],"study_design_scores_gemma":[0.0005436915,0.000009937385,0.000041835498,0.0004339084,0.000012276221,0.0000020624545,0.0011634537,0.0008343107,0.0049300552,0.99128515,0.0006086035,0.0001347014],"about_ca_topic_score_codex":0.0000029604912,"about_ca_topic_score_gemma":0.00003413436,"teacher_disagreement_score":0.582154,"about_ca_system_score_codex":0.0001087342,"about_ca_system_score_gemma":0.000080160935,"threshold_uncertainty_score":0.6286116},"labels":[],"label_agreement":null},{"id":"W4413326508","doi":"10.1016/j.aam.2025.102959","title":"Proof of a K-theoretic polynomial conjecture of Monical, Pechenik, and Searles","year":2025,"lang":"en","type":"article","venue":"Advances in Applied Mathematics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Conjecture; Polynomial; Combinatorics; Discrete mathematics; Mathematical analysis","score_opus":0.011575758251031238,"score_gpt":0.31156148951561435,"score_spread":0.2999857312645831,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413326508","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6559943,0.0053839143,0.25583333,0.00023271407,0.0005630747,0.0043509468,0.000051787996,0.0002282476,0.07736171],"genre_scores_gemma":[0.7369835,0.00017610822,0.26263052,0.0000109216535,0.000016682952,0.00007997003,0.0000010644063,0.000034656052,0.000066597386],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978355,0.000033169195,0.0011724284,0.00031363615,0.00033459428,0.00031066293],"domain_scores_gemma":[0.9957836,0.0027781744,0.00064436765,0.00065805163,0.000082327955,0.000053422333],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000517603,0.00031367166,0.0010348001,0.00023988368,0.000040694795,0.000012094962,0.0003936514,0.00019696634,0.000013149174],"category_scores_gemma":[0.0012665385,0.00027687685,0.00008540813,0.00052488106,0.0005557682,0.000100226636,0.00023986332,0.00029037855,8.605919e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000620315,0.0005131397,0.00009522765,0.0057055764,0.000032420376,0.0000016087843,0.0012246273,0.00006247714,0.0017232382,0.9877537,0.000044028442,0.002781955],"study_design_scores_gemma":[0.0011989446,0.000073983,0.000007879194,0.000667053,0.00008306557,0.0000044778103,0.0009433181,0.00056101294,0.05862417,0.93743515,0.00019821824,0.0002026994],"about_ca_topic_score_codex":0.000001180674,"about_ca_topic_score_gemma":0.000007818563,"teacher_disagreement_score":0.08098921,"about_ca_system_score_codex":0.0000598314,"about_ca_system_score_gemma":0.000090841684,"threshold_uncertainty_score":0.99996835},"labels":[],"label_agreement":null},{"id":"W4414929342","doi":"10.1016/j.aam.2025.102979","title":"Hybrid pipe dreams for key polynomials","year":2025,"lang":"en","type":"article","venue":"Advances in Applied Mathematics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Key (lock); Algebra over a field; Dream; Orthogonal polynomials; Polynomial","score_opus":0.018559120417042694,"score_gpt":0.328744489555543,"score_spread":0.31018536913850026,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414929342","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012394972,0.0008118825,0.8936055,0.00018359546,0.0012507458,0.0034222116,0.000040030962,0.00047624003,0.08781485],"genre_scores_gemma":[0.21705736,0.00019681608,0.7796459,0.0001910225,0.0001759503,0.0014088892,0.000012577223,0.00013629433,0.0011751376],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9968946,0.000024177221,0.0013820452,0.0005768025,0.00038201912,0.00074037665],"domain_scores_gemma":[0.9932829,0.004886144,0.00053870416,0.0010837106,0.00011140717,0.00009713434],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00085830205,0.0005271327,0.0011105172,0.00033599118,0.00016472347,0.00006413424,0.00077720237,0.00016969178,0.00002493597],"category_scores_gemma":[0.0021967974,0.00051257096,0.00018179163,0.0004981763,0.00016356907,0.0002451279,0.00022195531,0.00030251694,0.000034067674],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005769684,0.0005643799,0.00001663299,0.0021556623,0.000032144482,0.0000031584143,0.00042783536,0.000055498313,0.0009904015,0.9885454,0.0009347914,0.0062163565],"study_design_scores_gemma":[0.0018505814,0.000044480163,0.0000020206437,0.00038680996,0.000080203,0.000005513119,0.00045174288,0.00071349856,0.02451537,0.9556806,0.015809432,0.00045971587],"about_ca_topic_score_codex":6.9809477e-7,"about_ca_topic_score_gemma":0.000009952679,"teacher_disagreement_score":0.2046624,"about_ca_system_score_codex":0.00026220013,"about_ca_system_score_gemma":0.00011018415,"threshold_uncertainty_score":0.9997326},"labels":[],"label_agreement":null},{"id":"W7108456235","doi":"10.1016/j.aam.2025.103003","title":"Decomposing conditional independence ideals with hidden variables","year":2025,"lang":"en","type":"article","venue":"Advances in Applied Mathematics","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"St. John's College, University of Oxford; Natural Sciences and Engineering Research Council of Canada; Engineering and Physical Sciences Research Council; KU Leuven; Fonds Wetenschappelijk Onderzoek; Canadian Institute for Advanced Research; UK Research and Innovation; National Science Foundation","keywords":"Conditional independence; Independence (probability theory); Hidden variable theory; Conditional expectation; Variable (mathematics); Random variable","score_opus":0.006332649715279815,"score_gpt":0.25668432775473143,"score_spread":0.25035167803945163,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7108456235","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005903692,0.0002004577,0.9637086,0.00014294904,0.00009597801,0.00018513502,0.0000013524236,0.00009391339,0.02966797],"genre_scores_gemma":[0.5573483,0.000014130658,0.44237894,0.00017431368,0.000013589339,0.000032655164,0.0000026628356,0.0000036148722,0.000031783802],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990531,0.000009531386,0.00026613683,0.00025359256,0.0002260937,0.0001915151],"domain_scores_gemma":[0.99913216,0.0004605294,0.00011203315,0.00023669947,0.000028298135,0.000030296582],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019772195,0.0001220157,0.0001812726,0.00013163709,0.0000824082,0.000085701846,0.00047551855,0.000041476873,0.0000053693066],"category_scores_gemma":[0.000022940543,0.00010423643,0.000016018996,0.00046303094,0.00005387183,0.0003471664,0.00014393593,0.00012001957,0.000013050805],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004400535,0.00005791696,0.00012298893,0.0000717989,0.0000053663075,0.0000036984552,0.00017997634,0.0024743793,0.00037292184,0.96712714,0.000025453026,0.029553968],"study_design_scores_gemma":[0.0004136796,0.000013167344,0.0002803478,0.00013657301,0.0000045456895,0.000009216962,0.000059217786,0.03510236,0.0025480827,0.96059006,0.0006998468,0.00014292846],"about_ca_topic_score_codex":0.0000023005377,"about_ca_topic_score_gemma":0.0000134722095,"teacher_disagreement_score":0.55144465,"about_ca_system_score_codex":0.000050467504,"about_ca_system_score_gemma":0.00009631736,"threshold_uncertainty_score":0.42506382},"labels":[],"label_agreement":null},{"id":"W7108753191","doi":"10.1016/j.aam.2025.103004","title":"Gapfree graphs and powers of edge ideals with linear quotients","year":2025,"lang":"en","type":"article","venue":"Advances in Applied Mathematics","topic":"Commutative Algebra and Its Applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"Natural Sciences and Engineering Research Council of Canada; Simons Foundation; American Institute of Mathematics; National Science Foundation","keywords":"Quotient; Conjecture; Graph; Order (exchange); Ideal (ethics); Resolution (logic)","score_opus":0.015445385737784775,"score_gpt":0.3222246993899757,"score_spread":0.30677931365219097,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7108753191","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6677586,0.0025398035,0.12206262,0.00021909297,0.00008587583,0.0022374114,0.0000379712,0.00018211702,0.20487654],"genre_scores_gemma":[0.7605069,0.00035092453,0.23883179,0.00005088085,0.0000040167697,0.00012752866,0.0000034041552,0.000022106447,0.000102430145],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998931,0.0000119782835,0.0004758872,0.00021434794,0.00017807868,0.00018868835],"domain_scores_gemma":[0.9982325,0.0010031237,0.0002323019,0.00044824215,0.000046019082,0.000037821144],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019020028,0.00018035399,0.0004011001,0.00019105934,0.000057549838,0.0000099041845,0.00022765841,0.000055152977,0.000010492524],"category_scores_gemma":[0.00013029554,0.00014610121,0.000030742318,0.0005655705,0.00023221396,0.00008215801,0.00010378072,0.00013821972,0.0000025934273],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020673742,0.00023429905,0.0010304594,0.00070559053,0.00002479204,5.355924e-7,0.0009265086,0.0000138349,0.0005593192,0.99387604,0.00006944308,0.002538491],"study_design_scores_gemma":[0.00073339447,0.00004319935,0.00030512217,0.00026067972,0.00004676529,0.0000018455761,0.0012835284,0.00020830074,0.004329215,0.99202985,0.00060585164,0.00015225295],"about_ca_topic_score_codex":0.0000019976824,"about_ca_topic_score_gemma":0.000033311135,"teacher_disagreement_score":0.20477411,"about_ca_system_score_codex":0.000017236165,"about_ca_system_score_gemma":0.00003096724,"threshold_uncertainty_score":0.5957834},"labels":[],"label_agreement":null},{"id":"W7115186767","doi":"10.1016/j.aam.2025.103020","title":"Macdonald polynomials at t = 0 through twisted multiline queues","year":2025,"lang":"en","type":"article","venue":"Advances in Applied Mathematics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Queue; Algebra over a field; Orthogonal polynomials; Macdonald polynomials; Burke's theorem","score_opus":0.026558788781765055,"score_gpt":0.36237512522592535,"score_spread":0.3358163364441603,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7115186767","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11635945,0.007181181,0.28710297,0.0009582487,0.0032590884,0.0067447647,0.000088868066,0.0021223591,0.5761831],"genre_scores_gemma":[0.22697337,0.00084798364,0.76691884,0.0004684625,0.00016215381,0.0006419326,0.000018425959,0.00017591075,0.0037929236],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99625516,0.000049842092,0.0016760267,0.00068045664,0.00057119987,0.00076733145],"domain_scores_gemma":[0.99390817,0.003935792,0.00065869215,0.0012986507,0.00010595102,0.00009277398],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00061613735,0.0006479749,0.0012621294,0.0002588274,0.00019263737,0.000047623613,0.0008094974,0.0002914699,0.00010648134],"category_scores_gemma":[0.0016298713,0.0006116892,0.00017097693,0.0009311774,0.00027268528,0.0003132946,0.00054247136,0.0004366796,0.00011596897],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008210481,0.00073871354,0.00007291766,0.002200613,0.000044075918,0.000011287718,0.0011748462,0.00010953764,0.0017058972,0.9904574,0.0008554597,0.002547116],"study_design_scores_gemma":[0.001898268,0.000029304903,0.00000785633,0.0006028066,0.000077935016,0.000009003269,0.0006592153,0.0009593458,0.018784136,0.95401406,0.022422887,0.0005351963],"about_ca_topic_score_codex":0.0000037613474,"about_ca_topic_score_gemma":0.00008019461,"teacher_disagreement_score":0.57239014,"about_ca_system_score_codex":0.0005624788,"about_ca_system_score_gemma":0.00008456481,"threshold_uncertainty_score":0.99963343},"labels":[],"label_agreement":null}]}