{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":110,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":110,"direct_label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline (scores rank; they never assert a category)","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12","author_layer_release":"2026-06-26"},"query_hash":"dd7739934530","filters":{"venue":"Advances in Applied Mathematics"}},"results":[{"id":"W2100552771","doi":"10.1016/s0196-8858(03)00078-2","title":"Homogeneous multivariate polynomials with the half-plane property","year":2003,"lang":"en","type":"article","venue":"Advances in Applied Mathematics","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":98,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Matroid; Homogeneous polynomial; Polynomial; Graphic matroid; Property (philosophy); Matroid partitioning; Matching (statistics); Class (philosophy); Set (abstract data type)","authors":[],"retraction":null,"screen_n_in":null,"score":{"opus":0.01027692145734738,"gpt":0.2299357953178658,"spread":0.2196588738605185,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004361635,0.0003963329,0.000506436,0.0008805504,0.0004995015,0.001603448,0.0005134923,0.0003818742,0.01173982],"category_scores_gemma":[0.002111837,0.0002057716,0.0003545149,0.001502137,0.001053977,0.002494893,0.001221987,0.001251308,0.0016969],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003564695,"about_ca_system_score_gemma":0.0004266286,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000507172,"about_ca_topic_score_gemma":0.0003745156,"domain_scores_codex":[0.9996883,0.00005736107,0.00001271737,0.00006515215,0.00009362039,0.00008286844],"domain_scores_gemma":[0.9991671,0.0002659702,0.0001814438,0.000146862,0.0001132851,0.0001254263],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001741239,0.00002574336,0.0006094812,0.00005113227,0.00001584034,0.000192836,0.0001138242,0.001132427,0.004862187,0.9476657,0.003952915,0.04120384],"study_design_scores_gemma":[0.00008124209,0.00005874859,0.001643106,0.00001637283,0.00002483478,0.0007097349,0.0001471719,0.009969922,0.006521057,0.9684003,0.01240166,0.00002579773],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5117063,0.001525964,0.3468132,0.002304603,0.0003856935,0.00006913514,0.001155819,0.0004017403,0.1356375],"genre_scores_gemma":[0.9690444,0.0008708001,0.01292368,0.0002639867,0.0003976971,0.00002959426,0.0004517163,0.00009828918,0.01591978],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01173982,"threshold_uncertainty_score":0.03927362,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2015106956","doi":"10.1016/j.aam.2004.11.006","title":"Wilf-equivalence for singleton classes","year":2006,"lang":"en","type":"article","venue":"Advances in Applied Mathematics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":93,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Victoria","funders":"Brandeis University","keywords":"Mathematics; Combinatorics; Bijection; Permutation (music); Singleton; Permutation matrix; Discrete mathematics; Physics","authors":[{"name":"Jörgen Backelin","is_ca":false},{"name":"Julian West","is_ca":true},{"name":"Guoce Xin","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02687452171482039,"gpt":0.3261446530526297,"spread":0.2992701313378093,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002199054,0.001046487,0.001658075,0.005995832,0.005405267,0.004846833,0.001564973,0.002074801,0.01368356],"category_scores_gemma":[0.004910012,0.0007615791,0.00177107,0.003537249,0.005095417,0.01305297,0.004965097,0.006789376,0.001335697],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002977461,"about_ca_system_score_gemma":0.000958674,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001381073,"about_ca_topic_score_gemma":0.001255162,"domain_scores_codex":[0.9980986,0.0003429918,0.0001016693,0.0004870366,0.0005837443,0.0003860839],"domain_scores_gemma":[0.9970668,0.001341668,0.0002509876,0.0002467738,0.0004917732,0.0006020024],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001877078,0.00002193077,0.0001509596,0.00001919767,0.000008743938,0.00005630453,0.0002311242,0.0001193447,0.0002358493,0.9944634,0.001221202,0.003453144],"study_design_scores_gemma":[0.000009423307,0.000007604891,0.0002213044,0.000004983268,0.000007387092,0.00005881816,0.00006711393,0.0005211503,0.0001288579,0.9970484,0.001917314,0.000007614245],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"other","genre_scores_codex":[0.3932717,0.002300025,0.1928378,0.006729146,0.001849342,0.0001190064,0.0008827536,0.0006892781,0.401321],"genre_scores_gemma":[0.9303553,0.001391675,0.02049961,0.001079541,0.002007285,0.0002002227,0.001058296,0.0002811941,0.04312682],"genre_candidate":"other","genre_consensus":"other","teacher_disagreement_score":0.01368356,"threshold_uncertainty_score":0.04577607,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2154871611","doi":"10.1016/j.aam.2011.04.004","title":"A new combinatorial identity for unicellular maps, via a direct bijective approach","year":2011,"lang":"en","type":"article","venue":"Advances in Applied Mathematics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":84,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"","keywords":"Bijection; Mathematics; Combinatorics; Bipartite graph; Genus; Identity (music); Graph; Discrete mathematics; Botany","authors":[{"name":"Guillaume Chapuy","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04158816758432483,"gpt":0.3043618415888434,"spread":0.2627736740045186,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006430237,0.0006518638,0.0007187189,0.002852713,0.003182081,0.004500404,0.001348433,0.001501558,0.006866265],"category_scores_gemma":[0.002156102,0.0005541866,0.0009595508,0.001356603,0.00356844,0.006137263,0.004560486,0.003918079,0.001711593],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009440797,"about_ca_system_score_gemma":0.0006167294,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005711812,"about_ca_topic_score_gemma":0.0006598982,"domain_scores_codex":[0.9990119,0.0001908258,0.00006764152,0.0002799153,0.0003323269,0.000117277],"domain_scores_gemma":[0.9989815,0.0002385368,0.00009001552,0.0001858441,0.0002872656,0.0002168306],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000006759984,0.00001318755,0.00004362978,0.00002790937,0.000002764362,0.00005135268,0.0002046294,0.00009622001,0.0007757585,0.9913795,0.001009675,0.006388523],"study_design_scores_gemma":[0.000008467258,0.0000255632,0.0001465632,0.00001918957,0.00001189361,0.0004815306,0.0002385309,0.002138835,0.001158379,0.9685213,0.02723087,0.00001887535],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1010997,0.001714213,0.5544751,0.002401176,0.002710256,0.0001678639,0.0003276353,0.0006269761,0.336477],"genre_scores_gemma":[0.6415378,0.002641144,0.2123562,0.001837332,0.00172898,0.0003854927,0.0005510776,0.0009380449,0.138024],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006866265,"threshold_uncertainty_score":0.02296996,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2044750531","doi":"10.1016/s0196-8858(02)00504-3","title":"When does Zeilberger's algorithm succeed?","year":2003,"lang":"en","type":"article","venue":"Advances in Applied Mathematics","topic":"Mathematical functions and polynomials","field":"Mathematics","cited_by":63,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Ministère des Ressources Naturelles et de la Faune","keywords":"Mathematics; Hypergeometric function; Order (exchange); Term (time); Algorithm; Rational function; Function (biology); Combinatorics; Discrete mathematics; Pure mathematics; Finance; Business","authors":[{"name":"С. А. Абрамов","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01707435351452438,"gpt":0.2903438337929929,"spread":0.2732694802784685,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007139223,0.001292596,0.001877828,0.001605108,0.002251359,0.004426119,0.002003633,0.006251038,0.01860541],"category_scores_gemma":[0.04177079,0.0006171174,0.001164019,0.001643837,0.003431198,0.01267393,0.004206272,0.002754582,0.01323677],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001213832,"about_ca_system_score_gemma":0.002350493,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001132164,"about_ca_topic_score_gemma":0.001268023,"domain_scores_codex":[0.9953399,0.001494861,0.0002698993,0.0006802123,0.001248387,0.0009667595],"domain_scores_gemma":[0.9882923,0.007039805,0.0003090624,0.002399725,0.001537798,0.0004213913],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0007912733,0.0001662661,0.003224879,0.0002130079,0.0001456828,0.0002144995,0.0003180516,0.01409273,0.001695242,0.682124,0.04968695,0.2473275],"study_design_scores_gemma":[0.00008342354,0.00008467086,0.0003764409,0.00009841889,0.00004015556,0.0001969962,0.0002291402,0.04798628,0.004589781,0.9257026,0.02056203,0.00005016042],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08219114,0.004136886,0.701305,0.04711417,0.004728392,0.0002619712,0.000364761,0.007433971,0.1524637],"genre_scores_gemma":[0.7492239,0.002143206,0.1930852,0.003949286,0.001229732,0.0001966254,0.0005331864,0.003380487,0.04625828],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01860541,"threshold_uncertainty_score":0.06224132,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2143645603","doi":"10.1016/j.aam.2005.05.007","title":"On the Stanley–Wilf limit of 4231-avoiding permutations and a conjecture of Arratia","year":2005,"lang":"en","type":"article","venue":"Advances in Applied Mathematics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":51,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"York University","funders":"","keywords":"Conjecture; Permutation (music); Mathematics; Combinatorics; Limit (mathematics); Class (philosophy); Parity of a permutation; Sequence (biology); Discrete mathematics; Cyclic permutation; Symmetric group; Computer science; Physics; Mathematical analysis","authors":[{"name":"Michael Albert","is_ca":false},{"name":"Murray Elder","is_ca":false},{"name":"Andrew Rechnitzer","is_ca":false},{"name":"P. Westcott","is_ca":false},{"name":"Mike Zabrocki","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.009003227470727602,"gpt":0.2391318660253993,"spread":0.2301286385546717,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002329527,0.0006395351,0.001711605,0.001970087,0.005662748,0.00447611,0.001679853,0.003273329,0.008380382],"category_scores_gemma":[0.01037668,0.00070045,0.001614222,0.0021418,0.00638191,0.008259844,0.003577356,0.004763096,0.001413222],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001774054,"about_ca_system_score_gemma":0.001419223,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002055216,"about_ca_topic_score_gemma":0.001358343,"domain_scores_codex":[0.9986768,0.0003218333,0.0000682983,0.0003016038,0.0003067463,0.0003246203],"domain_scores_gemma":[0.9954971,0.002611308,0.0003396794,0.0005553553,0.0004786207,0.000517972],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00006392227,0.00003029131,0.0002911818,0.00002966406,0.000005681231,0.00009726545,0.0003684332,0.0008624439,0.0004072759,0.9941332,0.001194984,0.002515623],"study_design_scores_gemma":[0.00001478122,0.00001221884,0.0001297966,0.000009212919,0.000004218046,0.00007832865,0.0001071523,0.001762811,0.0001884622,0.9963344,0.001346068,0.00001255331],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7261763,0.001788877,0.06850599,0.01111595,0.0007540183,0.00005994751,0.0003021758,0.0004195591,0.1908772],"genre_scores_gemma":[0.9592828,0.0007768819,0.01174881,0.00123146,0.0005309849,0.00008207637,0.0003183506,0.0001544556,0.02587417],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.008380382,"threshold_uncertainty_score":0.02803516,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2098464356","doi":"10.1016/j.aam.2008.03.005","title":"A connection between palindromic and factor complexity using return words","year":2008,"lang":"en","type":"article","venue":"Advances in Applied Mathematics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":48,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Palindrome; Mathematics; Combinatorics; Word (group theory); Connection (principal bundle); Function (biology); Set (abstract data type); Word length; Factor (programming language); Discrete mathematics; Geometry; Linguistics","authors":[{"name":"Michelangelo Bucci","is_ca":false},{"name":"Alessandro De Luca","is_ca":false},{"name":"Amy Glen","is_ca":true},{"name":"Luca Q. Zamboni","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0587870870588243,"gpt":0.291506953157473,"spread":0.2327198660986487,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001513165,0.000758854,0.001752025,0.002452087,0.001957806,0.005286833,0.00199043,0.002009164,0.01167608],"category_scores_gemma":[0.01212443,0.0007319221,0.001663112,0.003144236,0.006389377,0.0190976,0.003606751,0.003997249,0.001054555],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001733181,"about_ca_system_score_gemma":0.0007495104,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009378966,"about_ca_topic_score_gemma":0.0006445275,"domain_scores_codex":[0.9975242,0.0005184475,0.0002121249,0.0007930755,0.0006094687,0.0003426519],"domain_scores_gemma":[0.9875731,0.008355605,0.0009347299,0.001702098,0.0007936703,0.0006406626],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00002231224,0.00001051224,0.0001621444,0.00003216433,0.000004174993,0.0000268222,0.0001717741,0.0005774291,0.000295198,0.9952436,0.0002941419,0.003159666],"study_design_scores_gemma":[0.000008558131,0.00001151811,0.00008843874,0.000005379437,0.000006501878,0.00006869995,0.00003157636,0.00208038,0.0002652468,0.9963314,0.00109011,0.00001228228],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2912375,0.002137055,0.6104122,0.004294077,0.0004402585,0.0001163421,0.0006452499,0.0007613255,0.08995616],"genre_scores_gemma":[0.9415842,0.0007717352,0.04214958,0.0005453854,0.0007077475,0.0001054407,0.0003074897,0.0002758692,0.01355264],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01167608,"threshold_uncertainty_score":0.03906035,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1975206347","doi":"10.1006/aama.1999.0665","title":"Enumeration of m-Ary Cacti","year":2000,"lang":"en","type":"article","venue":"Advances in Applied Mathematics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":45,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Enumeration; Mathematics; Combinatorics; Vertex (graph theory); Generalization; Discrete mathematics; Graph","authors":[{"name":"Miklós Bóna","is_ca":true},{"name":"Michel Bousquet","is_ca":true},{"name":"Gilbert Labelle","is_ca":true},{"name":"Pierre Leroux","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01739044766133961,"gpt":0.3104009309760274,"spread":0.2930104833146878,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005378526,0.00098655,0.001027859,0.002931989,0.002935091,0.004497012,0.00227383,0.001547616,0.02503479],"category_scores_gemma":[0.004684934,0.0007452978,0.0007324562,0.003624128,0.00187295,0.003654129,0.003513506,0.002797151,0.003897745],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001502042,"about_ca_system_score_gemma":0.0007730054,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008682465,"about_ca_topic_score_gemma":0.001115254,"domain_scores_codex":[0.99889,0.0001651565,0.00008913725,0.000194133,0.0004019212,0.0002597313],"domain_scores_gemma":[0.997977,0.0008162306,0.0001854829,0.000378701,0.0003549262,0.0002877592],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000185585,0.00008934125,0.001377966,0.00022923,0.00002303906,0.0002804378,0.0007828355,0.001915167,0.003972863,0.9225571,0.01211329,0.05647307],"study_design_scores_gemma":[0.00004667986,0.00005084376,0.001168374,0.00008253418,0.00003279296,0.0005662024,0.0003496872,0.008303951,0.003734928,0.94924,0.0363844,0.00003946874],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.4603772,0.001460656,0.1518151,0.002734449,0.0008393255,0.0002913102,0.002051166,0.001426774,0.3790039],"genre_scores_gemma":[0.7981884,0.001042818,0.09057032,0.0006274849,0.0003790591,0.0003707896,0.003264326,0.0004390756,0.1051176],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.02503479,"threshold_uncertainty_score":0.08374971,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W177832585","doi":"10.1016/j.aam.2012.08.005","title":"On the regularity of the <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.gif\" overflow=\"scroll\"><mml:msub><mml:mrow><mml:mi>L</mml:mi></mml:mrow><mml:mrow><mml:mi>p</mml:mi></mml:mrow></mml:msub></mml:math> Minkowski problem","year":2012,"lang":"lv","type":"article","venue":"Advances in Applied Mathematics","topic":"Geometric Analysis and Curvature Flows","field":"Mathematics","cited_by":43,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"McGill University","keywords":"Mathematics; Degenerate energy levels; Function (biology); Algorithm; Physics","authors":[{"name":"Yong Huang","is_ca":false},{"name":"Qiuping Lu","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01850007045832368,"gpt":0.2474281718764745,"spread":0.2289281014181508,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003136225,0.0007836792,0.001203292,0.002833155,0.00166355,0.002993128,0.001615487,0.001396586,0.008110303],"category_scores_gemma":[0.01737837,0.0006425085,0.001288285,0.00117888,0.005812265,0.007059138,0.004184866,0.00457136,0.001532468],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001641551,"about_ca_system_score_gemma":0.001105284,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002181129,"about_ca_topic_score_gemma":0.001693023,"domain_scores_codex":[0.998628,0.0005493758,0.00007663948,0.0003047608,0.0002742443,0.0001668952],"domain_scores_gemma":[0.9902605,0.00608819,0.0008667078,0.0007519445,0.001189007,0.0008435756],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0000961895,0.00001964392,0.001040106,0.00009549192,0.00001815262,0.00008662105,0.0002333649,0.002737781,0.000842149,0.9845293,0.004231965,0.006069385],"study_design_scores_gemma":[0.00001737985,0.00003901474,0.001603093,0.00005441035,0.00001921749,0.0001766541,0.0001381262,0.02325791,0.0007011932,0.9688842,0.005081489,0.00002736498],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3749657,0.007300052,0.3939452,0.01805175,0.0009318613,0.0001103791,0.001972713,0.0003337224,0.2023887],"genre_scores_gemma":[0.9115528,0.004047835,0.04510758,0.001117951,0.001231968,0.000139731,0.001568881,0.0005986087,0.03463467],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008110303,"threshold_uncertainty_score":0.02713168,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2081148745","doi":"10.1016/j.aam.2004.10.003","title":"Is complexity a source of incompleteness?","year":2005,"lang":"en","type":"article","venue":"Advances in Applied Mathematics","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":41,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Western University","funders":"","keywords":"Mathematics; Discrete mathematics; Peano axioms; Bounded function; Measure (data warehouse); Null set; Probability theory; Probability measure; Set (abstract data type); Statistics","authors":[{"name":"Cristian S. Calude","is_ca":false},{"name":"Helmut Jürgensen","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03344240360397974,"gpt":0.290507433322412,"spread":0.2570650297184322,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01046403,0.0004635624,0.001884533,0.002828819,0.002097511,0.006607594,0.002986437,0.002909716,0.009638357],"category_scores_gemma":[0.08415756,0.0009130538,0.001404147,0.002440159,0.01152838,0.02877216,0.003385609,0.005667293,0.001100712],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003037595,"about_ca_system_score_gemma":0.003556307,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002543404,"about_ca_topic_score_gemma":0.00186234,"domain_scores_codex":[0.9945875,0.001597268,0.0004273408,0.0007719756,0.002222959,0.0003929695],"domain_scores_gemma":[0.8922348,0.07030776,0.007621523,0.01311025,0.01471022,0.002015463],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00004023791,0.0000284709,0.001583211,0.0002629816,0.00005904367,0.00009466869,0.0005658743,0.00246213,0.0002615415,0.9750898,0.003618556,0.01593347],"study_design_scores_gemma":[0.000006907,0.00000543551,0.0003555731,0.00005134656,0.00001021956,0.00005769493,0.0001838966,0.002533007,0.0001796781,0.99242,0.004181315,0.00001483908],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1564705,0.01826929,0.5440817,0.1486766,0.001523554,0.0001568031,0.002643432,0.0006230599,0.127555],"genre_scores_gemma":[0.92067,0.006190813,0.05819071,0.004278632,0.001807446,0.0001774715,0.001145196,0.0002355908,0.007304282],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01046403,"threshold_uncertainty_score":0.05533975,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2075961729","doi":"10.1016/j.aam.2010.11.005","title":"Cubature formulae for orthogonal polynomials in terms of elements of finite order of compact simple Lie groups","year":2010,"lang":"en","type":"article","venue":"Advances in Applied Mathematics","topic":"Spectroscopy and Chemometric Analyses","field":"Chemistry","cited_by":41,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Montréal; University of Victoria","funders":"","keywords":"Mathematics; Simple Lie group; Simple (philosophy); Lie theory; Pure mathematics; Representation of a Lie group; Orthogonal polynomials; Lie algebra; Fundamental representation; Combinatorics; Discrete mathematics","authors":[{"name":"Robert V. Moody","is_ca":true},{"name":"J. Patera","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01115430176122614,"gpt":0.3085199891319024,"spread":0.2973656873706763,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002072637,0.0007692204,0.001033544,0.001908988,0.0007429509,0.002500509,0.001419288,0.0009594863,0.00585702],"category_scores_gemma":[0.005610866,0.0005010078,0.0008187387,0.001360497,0.002150964,0.003773757,0.001656322,0.002349879,0.001051123],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001431488,"about_ca_system_score_gemma":0.0007980448,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001041072,"about_ca_topic_score_gemma":0.001603589,"domain_scores_codex":[0.9993142,0.0002374164,0.00003992183,0.00007142729,0.0002504486,0.00008670383],"domain_scores_gemma":[0.9979125,0.001254677,0.0001727068,0.000145593,0.0003488654,0.0001656482],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001537064,0.00001263393,0.00007810547,0.00002413428,0.000006614337,0.00002306056,0.00009528066,0.003883508,0.000637398,0.989029,0.0007560823,0.005438765],"study_design_scores_gemma":[0.000008720415,0.00001349327,0.0001076631,0.00001373347,0.00000595033,0.00003397784,0.00003286694,0.06463691,0.0005157118,0.9320906,0.002523579,0.00001676308],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1003648,0.0009852971,0.8636882,0.0009147667,0.0003160722,0.0000695593,0.0002654548,0.0002838862,0.03311202],"genre_scores_gemma":[0.7338719,0.001562988,0.2303696,0.0006117865,0.0007340576,0.0003249252,0.0004521432,0.000552232,0.03152033],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00585702,"threshold_uncertainty_score":0.01959372,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2912937725","doi":"10.1016/s0196-8858(03)00041-1","title":"Graph-polynomials","year":2003,"lang":"en","type":"article","venue":"Advances in Applied Mathematics","topic":"Mathematics and Applications","field":"Mathematics","cited_by":34,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Tutte polynomial; Spanning tree; Combinatorics; Chromatic polynomial; Graph; Polynomial; Order (exchange); Discrete mathematics; Voltage graph; Line graph; Mathematical analysis","authors":[{"name":"W. T. Tutte","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03043978165946452,"gpt":0.3267222162246508,"spread":0.2962824345651863,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002783445,0.0007509348,0.0007614832,0.002046939,0.001438378,0.00269964,0.0008093339,0.0008195138,0.0266356],"category_scores_gemma":[0.001412642,0.0003894278,0.0006428258,0.002703744,0.001961909,0.003569683,0.00184852,0.004390379,0.006008985],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001841138,"about_ca_system_score_gemma":0.0008102186,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001497175,"about_ca_topic_score_gemma":0.001741458,"domain_scores_codex":[0.9995603,0.00007532939,0.00001185258,0.0001378249,0.0001434968,0.00007131758],"domain_scores_gemma":[0.9994195,0.000166561,0.00005838151,0.0001025222,0.0001404234,0.000112673],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001697881,0.00001053099,0.00006407273,0.00003359908,0.000005248697,0.00001785235,0.00007468533,0.0002420855,0.0003521884,0.9774773,0.00972196,0.01198364],"study_design_scores_gemma":[0.000008230406,0.000007223305,0.0001777641,0.00001116923,0.0000091273,0.00008020982,0.00003991004,0.0009031884,0.0003262712,0.9691998,0.02922898,0.000007960046],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.08066995,0.005795246,0.1533233,0.01383646,0.004651893,0.000102699,0.002154673,0.001170863,0.7382949],"genre_scores_gemma":[0.6809894,0.005873505,0.03892625,0.002479087,0.002366734,0.0001263719,0.001707234,0.0007670803,0.2667643],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.0266356,"threshold_uncertainty_score":0.08910501,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2022357851","doi":"10.1016/j.aam.2010.05.001","title":"Recurrent words with constant Abelian complexity","year":2010,"lang":"en","type":"article","venue":"Advances in Applied Mathematics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":32,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Winnipeg","funders":"","keywords":"Mathematics; Abelian group; Constant (computer programming); Pure mathematics; Combinatorics; Computer science","authors":[{"name":"James D. Currie","is_ca":true},{"name":"Narad Rampersad","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01327778947053018,"gpt":0.259819825791514,"spread":0.2465420363209838,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008435915,0.0008452341,0.00141898,0.001959702,0.001963648,0.004762386,0.001300189,0.001893973,0.01339395],"category_scores_gemma":[0.006572034,0.0007248393,0.001213258,0.001479557,0.003612725,0.008799523,0.003172407,0.003239425,0.002701368],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001461225,"about_ca_system_score_gemma":0.0007528329,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004885677,"about_ca_topic_score_gemma":0.0005132415,"domain_scores_codex":[0.9979469,0.0004284249,0.000156344,0.0004837757,0.0006106784,0.0003739537],"domain_scores_gemma":[0.9925812,0.00444858,0.0006162844,0.0008827689,0.0009409335,0.0005302818],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00005026504,0.00001934118,0.0001202625,0.00003439235,0.00001023293,0.0001472176,0.0002979282,0.000634741,0.001512425,0.993037,0.0008063887,0.003329669],"study_design_scores_gemma":[0.00002070604,0.00001817734,0.0001188109,0.000006401191,0.00001728493,0.0002181658,0.00006328223,0.004191577,0.00122476,0.9913561,0.002744012,0.00002065955],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5371661,0.001513463,0.2816468,0.003374623,0.0007233423,0.0001729905,0.0006951673,0.001820981,0.1728866],"genre_scores_gemma":[0.9365642,0.0003676988,0.01709352,0.0004134214,0.0006912475,0.0001534569,0.0003011341,0.0003204193,0.04409488],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01339395,"threshold_uncertainty_score":0.0448072,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2552556533","doi":"10.1016/j.aam.2017.09.003","title":"Pfaffians and nonintersecting paths in graphs with cycles: Grassmann algebra methods","year":2017,"lang":"en","type":"article","venue":"Advances in Applied Mathematics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":31,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Perimeter Institute","funders":"Agence Nationale de la Recherche; Innovation, Science and Economic Development Canada","keywords":"Mathematics; Exterior algebra; Grassmannian; Algebra over a field; Schubert calculus; Algebraic number; Graph; Generalization; Combinatorics; Pure mathematics; Mathematical analysis","authors":[{"name":"Sylvain Carrozza","is_ca":true},{"name":"Adrian Tanasă","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02961173959000027,"gpt":0.3745098303551216,"spread":0.3448980907651213,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001557834,0.001528157,0.001342218,0.004460435,0.002164768,0.003689562,0.00252018,0.002150147,0.009573998],"category_scores_gemma":[0.003795269,0.0006701314,0.001574174,0.002407849,0.0039566,0.007600433,0.002715026,0.004128201,0.001301046],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001373096,"about_ca_system_score_gemma":0.001061609,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002116458,"about_ca_topic_score_gemma":0.002846218,"domain_scores_codex":[0.9993412,0.0002508287,0.00003176564,0.000153795,0.0001279493,0.00009439768],"domain_scores_gemma":[0.9985903,0.0005171779,0.0001899757,0.0001771187,0.0002358118,0.0002895317],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000005845099,0.00001451981,0.00004406442,0.00001575179,0.000003403065,0.00001181806,0.00007462408,0.0008316991,0.0001091678,0.995764,0.0004539782,0.002671119],"study_design_scores_gemma":[0.00000396899,0.000004470404,0.00003270956,0.000008003967,0.000003242833,0.00001247018,0.00003692025,0.00850983,0.00004291218,0.9905064,0.000833714,0.000005382195],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1925117,0.004218316,0.6889044,0.003221179,0.00133821,0.0001430209,0.0002634872,0.000441567,0.1089581],"genre_scores_gemma":[0.783767,0.004778352,0.1397999,0.001454604,0.002462852,0.0002677614,0.0005100839,0.0005057814,0.0664536],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009573998,"threshold_uncertainty_score":0.0320282,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1999202617","doi":"10.1016/j.aam.2009.07.005","title":"Longest increasing subsequences, Plancherel-type measure and the Hecke insertion algorithm","year":2010,"lang":"en","type":"article","venue":"Advances in Applied Mathematics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":31,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of New Brunswick","funders":"","keywords":"Mathematics; Combinatorics; Young tableau; Measure (data warehouse); Hecke algebra; Conjecture; Algebraic number; Symmetric group; Probability measure; Limit (mathematics); Discrete mathematics; Algebra over a field; Pure mathematics","authors":[{"name":"Hugh Thomas","is_ca":true},{"name":"Alexander Yong","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01829946448890567,"gpt":0.2885864767133121,"spread":0.2702870122244064,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002291509,0.0007729892,0.001265274,0.003918034,0.002107687,0.002852776,0.002972051,0.002005834,0.008113297],"category_scores_gemma":[0.01246334,0.0006578082,0.001237435,0.004120351,0.003476669,0.007491897,0.002232646,0.002922067,0.001959202],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001378914,"about_ca_system_score_gemma":0.001298958,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00083282,"about_ca_topic_score_gemma":0.0009398694,"domain_scores_codex":[0.9989555,0.0002703071,0.00007095946,0.0002212189,0.000316312,0.0001657221],"domain_scores_gemma":[0.9956185,0.002598959,0.000521915,0.000510495,0.0003957217,0.0003544352],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00006330818,0.00004175223,0.0004487598,0.00005538329,0.00001860373,0.00007600271,0.0001016523,0.006081331,0.0008379996,0.9684291,0.001288982,0.02255707],"study_design_scores_gemma":[0.00001729078,0.00002908888,0.0001964229,0.00001515713,0.00001081177,0.00009245838,0.00002991143,0.01800383,0.0008594751,0.9785737,0.002146384,0.00002541054],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1778906,0.003181599,0.7696919,0.001978894,0.0005124562,0.0001016193,0.0003411367,0.0007639136,0.04553789],"genre_scores_gemma":[0.6865965,0.003389688,0.2517885,0.0006402917,0.001024175,0.0002219245,0.0008668794,0.0005994554,0.05487272],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008113297,"threshold_uncertainty_score":0.02714169,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2068854468","doi":"10.1016/j.aam.2008.05.002","title":"Some open problems on excluding a uniform matroid","year":2008,"lang":"en","type":"article","venue":"Advances in Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":31,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Matroid; Minor (academic); Mathematics; Combinatorics; Graphic matroid; Discrete mathematics; Humanities","authors":[{"name":"Jim Geelen","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0561847561376672,"gpt":0.3320618360736579,"spread":0.2758770799359906,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004495709,0.001360536,0.003522344,0.002614168,0.007762335,0.007195106,0.005656619,0.005911402,0.0212238],"category_scores_gemma":[0.02314881,0.00161307,0.003241754,0.006240534,0.006861737,0.02372709,0.006348922,0.01293475,0.001871042],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002647524,"about_ca_system_score_gemma":0.001343382,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002405619,"about_ca_topic_score_gemma":0.002170539,"domain_scores_codex":[0.9967201,0.001106887,0.0002405936,0.0008542892,0.0005607906,0.0005172471],"domain_scores_gemma":[0.9805815,0.0147419,0.001001112,0.001296298,0.001193691,0.001185526],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001500979,0.0001084223,0.0006650853,0.0002670008,0.00004031802,0.0001663441,0.000394256,0.004054718,0.000335385,0.9702612,0.01196948,0.01158794],"study_design_scores_gemma":[0.00003633719,0.00002288868,0.0002299921,0.00003751508,0.000022881,0.0001128979,0.0001880018,0.005793367,0.0001803683,0.9887398,0.004620754,0.0000151568],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.3861657,0.007512881,0.2929264,0.04521507,0.002013861,0.0002061254,0.002600485,0.0006874863,0.262672],"genre_scores_gemma":[0.798373,0.00579745,0.09928968,0.006963701,0.006251477,0.0004328919,0.00584762,0.0007862115,0.07625802],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.0212238,"threshold_uncertainty_score":0.07100075,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2077155372","doi":"10.1006/aama.2001.0758","title":"A Structured Family of Clustering and Tree Construction Methods","year":2001,"lang":"en","type":"article","venue":"Advances in Applied Mathematics","topic":"Data Mining Algorithms and Applications","field":"Computer Science","cited_by":30,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"","keywords":"Mathematics; Disjoint sets; Cluster analysis; Hierarchical clustering; Cluster (spacecraft); Tree (set theory); Theoretical computer science; Combinatorics; Set (abstract data type); Computer science; Statistics","authors":[{"name":"David Bryant","is_ca":true},{"name":"Vincent Berry","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01897293709334736,"gpt":0.3204450755155659,"spread":0.3014721384222185,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004499916,0.001632884,0.00203902,0.003726415,0.001707132,0.002058336,0.003476767,0.002128005,0.006616101],"category_scores_gemma":[0.01629798,0.001242753,0.003387999,0.005516727,0.001260453,0.003759305,0.004317091,0.004376586,0.006721159],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007342247,"about_ca_system_score_gemma":0.001957466,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00108573,"about_ca_topic_score_gemma":0.002036495,"domain_scores_codex":[0.9956517,0.001521153,0.0002643103,0.0008332001,0.001603407,0.0001263366],"domain_scores_gemma":[0.9912794,0.003273517,0.0003715715,0.00236419,0.002368668,0.0003425864],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001175168,0.0001605516,0.001070808,0.0006440637,0.0002354763,0.0000977306,0.0003440903,0.0310068,0.005130019,0.131764,0.02208145,0.8073475],"study_design_scores_gemma":[0.0001209455,0.0002630816,0.0009434901,0.00027771,0.0001903119,0.0007872426,0.0001587471,0.4945601,0.005892358,0.4276077,0.06910126,0.00009718474],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0003604842,0.0002868492,0.9983864,0.00007060981,0.00005948052,0.00003678357,0.00007407103,0.0002682937,0.0004570507],"genre_scores_gemma":[0.009235804,0.000771397,0.9861414,0.0002088141,0.0001916942,0.0002740533,0.0005836345,0.0003214138,0.002271625],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.006616101,"threshold_uncertainty_score":0.02379811,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1680081660","doi":"10.1016/j.aam.2012.09.003","title":"A flow approach to the <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.gif\" overflow=\"scroll\"><mml:msub><mml:mrow><mml:mi>L</mml:mi></mml:mrow><mml:mrow><mml:mo>−</mml:mo><mml:mn>2</mml:mn></mml:mrow></mml:msub></mml:math> Minkowski problem","year":2012,"lang":"lv","type":"article","venue":"Advances in Applied Mathematics","topic":"Point processes and geometric inequalities","field":"Mathematics","cited_by":29,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Concordia University","funders":"","keywords":"Uniqueness; Mathematics; Unit sphere; Minkowski space; Unit disk; Norm (philosophy); Planar; Combinatorics; Mathematical analysis; Geometry; Computer science; Computer graphics (images)","authors":[{"name":"Mohammad N. Ivaki","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02373070491946275,"gpt":0.2565127795228791,"spread":0.2327820746034164,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002217185,0.001229583,0.0007810549,0.002851761,0.001867103,0.0034711,0.002185338,0.001449202,0.03136319],"category_scores_gemma":[0.005086611,0.0006681679,0.002453236,0.00189483,0.002318471,0.006696973,0.003173452,0.004445838,0.00530476],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002350217,"about_ca_system_score_gemma":0.001862713,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004697137,"about_ca_topic_score_gemma":0.00409727,"domain_scores_codex":[0.999014,0.0004023734,0.00006034804,0.0002175877,0.0002213844,0.00008427869],"domain_scores_gemma":[0.9986047,0.0006910271,0.00009847253,0.0001749808,0.0003096958,0.0001210803],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000007856412,0.00001490254,0.00003920631,0.00003436367,0.00000537872,0.00002275408,0.00007866335,0.001590148,0.0001283005,0.9846565,0.005671461,0.007750364],"study_design_scores_gemma":[0.000006175777,0.00001379728,0.00006376416,0.00002702781,0.000006460701,0.00003152878,0.00003099862,0.01750751,0.0001374406,0.9597456,0.02242022,0.000009257589],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002011882,0.0009340195,0.9481319,0.00240736,0.0004298861,0.00007615169,0.000427682,0.0001704828,0.04541065],"genre_scores_gemma":[0.126623,0.004017357,0.7726682,0.001625748,0.002151876,0.0005477059,0.001393718,0.001007385,0.08996505],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.03136319,"threshold_uncertainty_score":0.1049203,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2172758441","doi":"10.1016/j.aam.2015.09.015","title":"The logarithmic Minkowski inequality for non-symmetric convex bodies","year":2015,"lang":"en","type":"article","venue":"Advances in Applied Mathematics","topic":"Point processes and geometric inequalities","field":"Mathematics","cited_by":29,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Logarithm; Minkowski space; Regular polygon; Inequality; Minkowski addition; Minkowski's theorem; Minkowski inequality; Pure mathematics; Convex body; Mixed volume; Mathematical analysis; Combinatorics; Rearrangement inequality; Linear inequality; Mathematical physics; Geometry; Convex optimization","authors":[{"name":"Alina Stancu","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0756796761499367,"gpt":0.3564699797214048,"spread":0.2807903035714681,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002201282,0.001108765,0.001102287,0.002240467,0.001122347,0.003393887,0.001836856,0.001361095,0.006198721],"category_scores_gemma":[0.01041215,0.0005100947,0.001192415,0.001609774,0.004702068,0.01020096,0.003324535,0.004995345,0.0009134763],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001952115,"about_ca_system_score_gemma":0.0006967955,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001025535,"about_ca_topic_score_gemma":0.0007406606,"domain_scores_codex":[0.9987372,0.0004325733,0.00007170167,0.0002565258,0.0003532752,0.0001488752],"domain_scores_gemma":[0.995572,0.002744992,0.0004630627,0.0002974026,0.0005705635,0.0003519041],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00004291286,0.000008358394,0.0002289901,0.00006860386,0.000008980496,0.00005594304,0.00007725442,0.003266274,0.0009078963,0.9895214,0.0009010252,0.004912466],"study_design_scores_gemma":[0.00000562182,0.00001284883,0.0003099362,0.00001483256,0.000006433528,0.00006236704,0.00003803179,0.0207897,0.0004132773,0.9763523,0.001983814,0.00001082092],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1388975,0.005832091,0.7474185,0.007937212,0.0006440584,0.00004727955,0.0005451528,0.0001614544,0.09851686],"genre_scores_gemma":[0.9135114,0.004165521,0.04310454,0.001406229,0.0009776041,0.0001243681,0.0006065438,0.0002159074,0.03588785],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006198721,"threshold_uncertainty_score":0.02073681,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2962838217","doi":"10.1016/j.aam.2016.06.007","title":"Affine isoperimetric inequalities in the functional Orlicz–Brunn–Minkowski theory","year":2016,"lang":"en","type":"article","venue":"Advances in Applied Mathematics","topic":"Point processes and geometric inequalities","field":"Mathematics","cited_by":29,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Memorial University of Newfoundland","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Isoperimetric inequality; Mathematics; Affine transformation; Pure mathematics; Type (biology); Regular polygon; Inequality; Mathematical analysis; Geometry","authors":[{"name":"Umut Caglar","is_ca":false},{"name":"Deping Ye","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.05478600815400669,"gpt":0.3126195291504167,"spread":0.25783352099641,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00318074,0.001282069,0.001259649,0.003857245,0.001470259,0.003272926,0.001786198,0.001298569,0.00663644],"category_scores_gemma":[0.006232936,0.0004580829,0.001581458,0.002403999,0.003760946,0.007937611,0.003125192,0.005568319,0.0007564804],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002643029,"about_ca_system_score_gemma":0.0006986641,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001686162,"about_ca_topic_score_gemma":0.0008830749,"domain_scores_codex":[0.9985643,0.0005176986,0.00008828894,0.0002680582,0.0004153604,0.0001462812],"domain_scores_gemma":[0.9972787,0.001305543,0.000394468,0.0001808734,0.0005244976,0.0003158982],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0000128227,0.000005239,0.0001123819,0.00003815201,0.000009111534,0.00002281503,0.0000507091,0.0009965772,0.0003417422,0.9952886,0.0005027218,0.002619088],"study_design_scores_gemma":[0.000006819115,0.00001977383,0.0005401196,0.00002082345,0.00001338517,0.00007447379,0.00004967704,0.01328351,0.0002956417,0.981737,0.003941477,0.00001731507],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1587724,0.01468487,0.6361359,0.008538585,0.001133944,0.00008584447,0.001089429,0.0001821189,0.179377],"genre_scores_gemma":[0.8723515,0.009463995,0.07614679,0.001563308,0.002376813,0.0002001358,0.0009583743,0.0002054748,0.03673352],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00663644,"threshold_uncertainty_score":0.02220112,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1967459533","doi":"10.1016/j.aam.2013.02.001","title":"Inequivalent representations of matroids over prime fields","year":2013,"lang":"en","type":"article","venue":"Advances in Applied Mathematics","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Matroid; Mathematics; Mersenne prime; Combinatorics; Prime power; Prime (order theory); Integer (computer science); Discrete mathematics; Field (mathematics); Pure mathematics","authors":[{"name":"Jim Geelen","is_ca":true},{"name":"Geoff Whittle","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02348674236484033,"gpt":0.3109929580723672,"spread":0.2875062157075268,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001188242,0.0007768062,0.000772766,0.001733327,0.001402512,0.004504068,0.001260001,0.001674011,0.01179485],"category_scores_gemma":[0.003428323,0.0005102937,0.0007469022,0.001381823,0.002289545,0.005313052,0.002684294,0.003396556,0.001131815],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001430636,"about_ca_system_score_gemma":0.0005227592,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003281091,"about_ca_topic_score_gemma":0.0004385175,"domain_scores_codex":[0.9985977,0.0004098976,0.00008667538,0.0002029454,0.0003753184,0.0003274728],"domain_scores_gemma":[0.9979413,0.0007808544,0.0003300014,0.0003184094,0.0002590324,0.0003704129],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00005005854,0.00003738749,0.0001339115,0.00001755669,0.000003445278,0.00005540457,0.0002021893,0.000685645,0.000559025,0.9928631,0.000971568,0.004420693],"study_design_scores_gemma":[0.00002578687,0.00002147533,0.0001057008,0.000009736436,0.000004845455,0.00008569482,0.0001182702,0.004437823,0.0002996436,0.9931849,0.001697585,0.000008689788],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7591412,0.0007180987,0.1106561,0.003645113,0.0005736884,0.0001092762,0.0006433926,0.0003287351,0.1241844],"genre_scores_gemma":[0.9599754,0.0004141652,0.01662028,0.0004777713,0.0004429653,0.00008958489,0.0006122265,0.0001335017,0.02123403],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01179485,"threshold_uncertainty_score":0.03945768,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2104469817","doi":"10.1016/s0196-8858(03)00021-6","title":"The Alexander polynomial of planar even valence graphs","year":2003,"lang":"en","type":"article","venue":"Advances in Applied Mathematics","topic":"Geometric and Algebraic Topology","field":"Mathematics","cited_by":26,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Mathematics; Combinatorics; Planar graph; Tutte polynomial; Spanning tree; Congruence relation; Book embedding; Knot polynomial; HOMFLY polynomial; Bracket polynomial; Knot (papermaking); Discrete mathematics; Jones polynomial; Polynomial; Graph; 1-planar graph; Knot theory; Matrix polynomial; Chordal graph; Knot invariant; Alternating polynomial; Square-free polynomial; Line graph; Voltage graph","authors":[{"name":"Kunio Murasugi","is_ca":true},{"name":"A. Stoimenow","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01883455432085998,"gpt":0.2886096301471338,"spread":0.2697750758262737,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004347548,0.0005455519,0.0005100422,0.002503495,0.0009903569,0.002342828,0.0008193502,0.0004981352,0.004672996],"category_scores_gemma":[0.001887305,0.0002967816,0.0003272606,0.001594709,0.002398664,0.002601883,0.001431739,0.001546608,0.0008284323],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001051341,"about_ca_system_score_gemma":0.0006384319,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00238493,"about_ca_topic_score_gemma":0.002144515,"domain_scores_codex":[0.9997277,0.00004523632,0.000007453738,0.00004577806,0.0000879314,0.0000858323],"domain_scores_gemma":[0.9991143,0.000342778,0.000181988,0.0000711973,0.0001094362,0.0001801756],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0002046458,0.00005201984,0.002458994,0.00006635215,0.00001729556,0.0001612084,0.0006628088,0.006809354,0.004179426,0.9552799,0.002022297,0.02808563],"study_design_scores_gemma":[0.00001613411,0.00003026045,0.001779587,0.00001386784,0.00001739168,0.0001306831,0.0001877488,0.007853341,0.000851067,0.9861085,0.002991075,0.00002036664],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9178138,0.0004476606,0.01889036,0.0009023261,0.0001344122,0.00001720483,0.0001716207,0.0001280815,0.06149469],"genre_scores_gemma":[0.9873965,0.0005073888,0.001779809,0.0001047372,0.000144999,0.000007980977,0.0001359559,0.00004040724,0.009882108],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.004672996,"threshold_uncertainty_score":0.01563275,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2053608071","doi":"10.1006/aama.2001.0771","title":"The Specification of 2-trees","year":2002,"lang":"en","type":"article","venue":"Advances in Applied Mathematics","topic":"Analytical Chemistry and Chromatography","field":"Chemistry","cited_by":26,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Montréal; Université du Québec à Montréal","funders":"","keywords":"Mathematics; Combinatorics; Tree (set theory); Applied mathematics; Discrete mathematics; Pure mathematics","authors":[{"name":"T.B. Fowler","is_ca":true},{"name":"Ira M. Gessel","is_ca":false},{"name":"Gilbert Labelle","is_ca":true},{"name":"Pierre Leroux","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01249551550776569,"gpt":0.2349535312782682,"spread":0.2224580157705025,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004000938,0.0009191052,0.001200116,0.001309111,0.001991183,0.004952529,0.003134143,0.003218516,0.008171825],"category_scores_gemma":[0.01401561,0.001582208,0.003153634,0.002642545,0.002948314,0.01358963,0.004121347,0.004877287,0.002467089],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00169696,"about_ca_system_score_gemma":0.001894279,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002771212,"about_ca_topic_score_gemma":0.003236057,"domain_scores_codex":[0.9939925,0.00187723,0.0008583533,0.001078898,0.001505065,0.0006878375],"domain_scores_gemma":[0.9905581,0.004902175,0.0005611496,0.002009629,0.00151772,0.0004511496],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00006036548,0.00002686984,0.0004118647,0.00009483348,0.0000201082,0.0001183242,0.0002744364,0.008117833,0.00093511,0.9710722,0.002895157,0.01597288],"study_design_scores_gemma":[0.00002029724,0.00001923222,0.00009667796,0.00003760261,0.0000173634,0.0001213066,0.00007216194,0.03151334,0.001147565,0.9539859,0.01294709,0.00002148709],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01439729,0.0003151819,0.9724923,0.00100461,0.0001186945,0.00007811616,0.000999201,0.000975631,0.009618917],"genre_scores_gemma":[0.3170283,0.0007183203,0.6632784,0.00106739,0.0002762779,0.0004631848,0.004585224,0.0008978546,0.01168509],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008171825,"threshold_uncertainty_score":0.02733749,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1969240432","doi":"10.1016/s0196-8858(02)00507-9","title":"The lace expansion on a tree with application to networks of self-avoiding walks","year":2003,"lang":"en","type":"article","venue":"Advances in Applied Mathematics","topic":"Stochastic processes and statistical mechanics","field":"Mathematics","cited_by":25,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"","keywords":"Mathematics; Lattice (music); Tree (set theory); Combinatorics; Gaussian; Percolation (cognitive psychology); Discrete mathematics; Statistical physics","authors":[{"name":"Remco van der Hofstad","is_ca":false},{"name":"Gordon Slade","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01159207031076444,"gpt":0.2846844388829838,"spread":0.2730923685722194,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001202619,0.0005776324,0.001222998,0.002444562,0.001227085,0.001742369,0.001562802,0.00171528,0.004321876],"category_scores_gemma":[0.00796915,0.0004060006,0.0009127411,0.001955553,0.002436842,0.002960121,0.002132376,0.002084386,0.0004184633],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009531775,"about_ca_system_score_gemma":0.000686579,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002653428,"about_ca_topic_score_gemma":0.002919806,"domain_scores_codex":[0.9996512,0.0001531126,0.0000134835,0.00005412704,0.00007618649,0.00005194843],"domain_scores_gemma":[0.9966179,0.002060239,0.000203852,0.0001503826,0.0004532038,0.0005144643],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000033499,0.00002159839,0.0003152459,0.00005344938,0.00001074626,0.0001331169,0.0001985279,0.03618265,0.001128306,0.9520155,0.001686636,0.008220773],"study_design_scores_gemma":[0.00001023028,0.00001594216,0.0001996836,0.00001704705,0.00001095786,0.0001159982,0.00006268398,0.353583,0.0002681073,0.6436454,0.002050522,0.00002035792],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2551661,0.004234358,0.6793085,0.002613224,0.0004872064,0.0001057728,0.0002760513,0.0005003614,0.0573083],"genre_scores_gemma":[0.8829492,0.003229339,0.08179986,0.0004655156,0.0008966195,0.0001785136,0.0002627994,0.0002666031,0.02995165],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004321876,"threshold_uncertainty_score":0.01445812,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1994224388","doi":"10.1016/j.aam.2006.04.003","title":"Exact Euler–Maclaurin formulas for simple lattice polytopes","year":2007,"lang":"en","type":"article","venue":"Advances in Applied Mathematics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":23,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Mathematics; Polytope; Euler's formula; Combinatorics; Exponential function; Lattice (music); Generating function; Mathematical analysis","authors":[{"name":"Yael Karshon","is_ca":true},{"name":"Shlomo Sternberg","is_ca":false},{"name":"Jonathan Weitsman","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02912029830388322,"gpt":0.3487351982352748,"spread":0.3196148999313915,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008921386,0.001093334,0.000863958,0.002171267,0.001641245,0.004042134,0.001632497,0.0009851477,0.01079744],"category_scores_gemma":[0.003158124,0.0006405532,0.0006470136,0.002051983,0.002834025,0.005884239,0.001929681,0.003515104,0.001686977],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001778267,"about_ca_system_score_gemma":0.0006544605,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0010344,"about_ca_topic_score_gemma":0.001550521,"domain_scores_codex":[0.9993159,0.0001156187,0.00004271459,0.0001003769,0.0003106603,0.0001147138],"domain_scores_gemma":[0.9991037,0.0003421447,0.0001259785,0.00008943224,0.0001702628,0.000168354],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00003106743,0.00003304778,0.0002193218,0.00003786894,0.000007095672,0.00009309858,0.0001908553,0.001522579,0.0007055973,0.9877148,0.001513479,0.007931191],"study_design_scores_gemma":[0.00001599579,0.000009472375,0.0001295541,0.00001354599,0.000005384406,0.00008431115,0.00007442675,0.005261682,0.0005507055,0.9908018,0.003039506,0.00001370808],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.4732717,0.001831502,0.2531445,0.002373075,0.000946236,0.0001083865,0.0006422923,0.000445612,0.2672367],"genre_scores_gemma":[0.9060988,0.00120507,0.04761241,0.0006193543,0.0004769696,0.0001106018,0.0005164806,0.0002588332,0.0431014],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01079744,"threshold_uncertainty_score":0.03612101,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2051669952","doi":"10.1016/j.aam.2011.09.002","title":"Eigenvectors for a random walk on a left-regular band","year":2011,"lang":"en","type":"article","venue":"Advances in Applied Mathematics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":23,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Mathematics; Random walk; Hyperplane; Combinatorics; Eigenvalues and eigenvectors; Mathematical proof; Discrete mathematics; Pure mathematics; Geometry","authors":[{"name":"Franco Saliola","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04471569936793778,"gpt":0.3068397875395891,"spread":0.2621240881716513,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006213235,0.0009153917,0.001170306,0.002335481,0.001538276,0.003106341,0.00127737,0.00174223,0.01675168],"category_scores_gemma":[0.001844268,0.0005471496,0.0008761545,0.001035282,0.001891413,0.00225914,0.001477013,0.001669198,0.002805092],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007055898,"about_ca_system_score_gemma":0.0007245033,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001298208,"about_ca_topic_score_gemma":0.001267016,"domain_scores_codex":[0.99941,0.0001371085,0.00002584796,0.0001195111,0.0001539026,0.0001535305],"domain_scores_gemma":[0.9988779,0.0003221884,0.0001617715,0.00010072,0.0001564821,0.0003808328],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00008995162,0.00005979546,0.0001984103,0.00003733858,0.00001580956,0.00009877521,0.00007961517,0.006467247,0.003614694,0.9834061,0.002070745,0.003861589],"study_design_scores_gemma":[0.00005208883,0.00002727544,0.0004871751,0.00002103931,0.00001260698,0.0002017536,0.00009601082,0.1261858,0.0008728369,0.8700351,0.001959716,0.00004873509],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3725953,0.0007896489,0.5595556,0.002152995,0.0006333514,0.000144208,0.0007352353,0.0008562142,0.06253748],"genre_scores_gemma":[0.8661541,0.0007130541,0.06270303,0.0005963214,0.0004928769,0.0002875951,0.0006002079,0.0007514608,0.0677014],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01675168,"threshold_uncertainty_score":0.05603993,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2021000796","doi":"10.1016/s0196-8858(02)00506-7","title":"Multiplicative principal-minor inequalities for totally nonnegative matrices","year":2003,"lang":"en","type":"article","venue":"Advances in Applied Mathematics","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Regina","funders":"National Science Foundation","keywords":"Mathematics; Multiplicative function; Minor (academic); Combinatorics; Nonnegative matrix; Matrix (chemical analysis); Pure mathematics; Symmetric matrix; Mathematical analysis; Eigenvalues and eigenvectors; Humanities","authors":[{"name":"Shaun Fallat","is_ca":true},{"name":"Michael Gekhtman","is_ca":false},{"name":"Charles R. Johnson","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0172206554813567,"gpt":0.2849951569266734,"spread":0.2677745014453167,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002436656,0.002323418,0.001091811,0.002024513,0.001474806,0.003783421,0.001992866,0.001317092,0.00814715],"category_scores_gemma":[0.01290236,0.0008339309,0.001489578,0.001914159,0.003168323,0.006260643,0.003273233,0.004680583,0.001352733],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001232862,"about_ca_system_score_gemma":0.00100442,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007415871,"about_ca_topic_score_gemma":0.001557324,"domain_scores_codex":[0.9981136,0.0005719717,0.0001179646,0.0003338987,0.0006294659,0.0002331284],"domain_scores_gemma":[0.9907838,0.005799226,0.0007586679,0.0006521227,0.001372075,0.0006340746],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00008109174,0.00003159714,0.0002389185,0.0001224396,0.00002383726,0.0001088589,0.0001873709,0.003866736,0.003348047,0.9780414,0.003412181,0.01053758],"study_design_scores_gemma":[0.00001807371,0.00005249364,0.000292886,0.00002108061,0.00002344484,0.0001783944,0.00005580522,0.02528403,0.001124585,0.9691278,0.003799647,0.00002190507],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06148829,0.001801812,0.8720022,0.002485834,0.0006719824,0.00009294061,0.0005147111,0.0002290146,0.06071329],"genre_scores_gemma":[0.754905,0.004590193,0.1862251,0.002015841,0.002666822,0.0005336145,0.001134525,0.0004687785,0.04746006],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00814715,"threshold_uncertainty_score":0.02725494,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2157575511","doi":"10.1016/s0196-8858(02)00534-1","title":"Haruspicy and anisotropic generating functions","year":2003,"lang":"en","type":"article","venue":"Advances in Applied Mathematics","topic":"Mathematical functions and polynomials","field":"Mathematics","cited_by":21,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"York University","funders":"","keywords":"Mathematics; Multiplicative function; Computation; Anisotropy; Rational function; Product (mathematics); Pure mathematics; Applied mathematics; Mathematical analysis; Algorithm; Geometry","authors":[{"name":"Andrew Rechnitzer","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02704561902087376,"gpt":0.29914970810272,"spread":0.2721040890818462,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001080472,0.000927605,0.001066473,0.003124661,0.00223588,0.003041578,0.001030889,0.001628843,0.008309403],"category_scores_gemma":[0.003512495,0.000489897,0.0007810452,0.001415076,0.004282407,0.004650656,0.002116932,0.003787109,0.00100711],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001119593,"about_ca_system_score_gemma":0.000607985,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000728873,"about_ca_topic_score_gemma":0.0006792572,"domain_scores_codex":[0.9993653,0.0001683874,0.00002229336,0.00009877249,0.0002123276,0.0001329955],"domain_scores_gemma":[0.998157,0.0007185529,0.000293729,0.0002313642,0.0002832436,0.0003161463],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000004507185,0.000003165771,0.00003551551,0.000004387774,8.652623e-7,0.00001750414,0.00004452129,0.000112761,0.0000938305,0.9983922,0.0003924833,0.0008982212],"study_design_scores_gemma":[0.000004964767,0.000003136466,0.00008285731,0.000003503439,0.000002377013,0.00008056587,0.00002996674,0.0008938981,0.0001037647,0.9968523,0.001937195,0.000005500944],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.4458339,0.004806433,0.1330926,0.008214917,0.001697563,0.0000642593,0.0002942099,0.0003195465,0.4056765],"genre_scores_gemma":[0.9313056,0.001746665,0.01108831,0.0007093615,0.00167135,0.000068606,0.0001968699,0.0001764892,0.05303675],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.008309403,"threshold_uncertainty_score":0.0277977,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1976341314","doi":"10.1006/aama.1999.0661","title":"The Strong Independence Theorem for Automorphism Groups and Congruence Lattices of Arbitrary Lattices","year":2000,"lang":"en","type":"article","venue":"Advances in Applied Mathematics","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Manitoba","funders":"","keywords":"Mathematics; Automorphism; Lattice (music); Algebraic number; Congruence (geometry); Independence (probability theory); Pure mathematics; Combinatorics; Automorphism group; Discrete mathematics; Algebra over a field; Mathematical analysis; Geometry","authors":[{"name":"George Grätzer","is_ca":true},{"name":"Friedrich Wehrung","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01191591219387377,"gpt":0.2628571735438551,"spread":0.2509412613499813,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003303727,0.0008253035,0.001583892,0.00182148,0.003343252,0.005085127,0.001388271,0.001394708,0.004930919],"category_scores_gemma":[0.007247501,0.001480022,0.002813928,0.001702864,0.00829618,0.01329455,0.005796593,0.008092164,0.001147148],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001528048,"about_ca_system_score_gemma":0.00133211,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001087222,"about_ca_topic_score_gemma":0.001144849,"domain_scores_codex":[0.9964586,0.0007252276,0.000236663,0.0009007717,0.001103843,0.000574854],"domain_scores_gemma":[0.9905289,0.005527529,0.0005514629,0.001534519,0.0009672957,0.0008903377],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00006637465,0.00002698025,0.0003147686,0.00003356491,0.00001880868,0.00004841429,0.0001995689,0.0005288285,0.000727697,0.9935656,0.0009803277,0.003489057],"study_design_scores_gemma":[0.00002022531,0.000008643803,0.0002215649,0.00000432199,0.000008856688,0.00005229771,0.00002572278,0.001359545,0.0005142321,0.9957146,0.00206159,0.000008339862],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1987582,0.001998066,0.6141813,0.006070773,0.00094569,0.0001487482,0.001100023,0.0005329589,0.1762643],"genre_scores_gemma":[0.9142945,0.001322311,0.05277736,0.001127581,0.002258617,0.0002733796,0.001445482,0.0002497589,0.02625109],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005085127,"threshold_uncertainty_score":0.01747197,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4205454290","doi":"10.1016/j.aam.2005.12.001","title":"Reflection groups and polytopes over finite fields, II","year":2006,"lang":"en","type":"article","venue":"Advances in Applied Mathematics","topic":"Supramolecular Self-Assembly in Materials","field":"Materials Science","cited_by":18,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of New Brunswick","funders":"","keywords":"Mathematics; Polytope; Reflection (computer programming); Pure mathematics; Combinatorics; Computer science","authors":[{"name":"Barry Monson","is_ca":true},{"name":"Egon Schulte","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.007526119342805718,"gpt":0.2609374353880919,"spread":0.2534113160452862,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004239058,0.0004380072,0.000341884,0.0006249233,0.0006858181,0.001797351,0.0003869844,0.0004769301,0.006048428],"category_scores_gemma":[0.0007691863,0.0001925706,0.0003830092,0.0003902558,0.001965031,0.001920554,0.000762453,0.001852512,0.00103365],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005879077,"about_ca_system_score_gemma":0.0002992518,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002912945,"about_ca_topic_score_gemma":0.0001986252,"domain_scores_codex":[0.9997842,0.00005559379,0.000009181268,0.00004670065,0.00005295506,0.00005146202],"domain_scores_gemma":[0.9997303,0.0001116077,0.00004767119,0.00004328528,0.00002651554,0.00004068541],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001998992,0.00001407557,0.00005238599,0.0000149073,0.00000283768,0.0000203216,0.0001111069,0.0006230377,0.0009392407,0.9912601,0.001670552,0.005271485],"study_design_scores_gemma":[0.0000155857,0.00003584572,0.0002019785,0.0000148559,0.000003978381,0.00008148646,0.00009781397,0.003811842,0.001038252,0.9823354,0.01235388,0.000008988707],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.3467233,0.01055996,0.1897229,0.008661965,0.002794147,0.0001234284,0.0003058939,0.0004195782,0.4406888],"genre_scores_gemma":[0.8631077,0.002973,0.02484743,0.0009661125,0.001478246,0.0001289356,0.0002649004,0.0001719357,0.1060616],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006048428,"threshold_uncertainty_score":0.02023405,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1988228156","doi":"10.1016/j.aam.2004.06.003","title":"Markov's transformation of series and the WZ method","year":2004,"lang":"en","type":"article","venue":"Advances in Applied Mathematics","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Memoir; Markov chain; Mathematics; Transformation (genetics); Context (archaeology); Series (stratigraphy); Markov process; Convergence (economics); Acceleration; Markov model; Mathematical economics; Applied mathematics; Algorithm; Statistics; Art history; History","authors":[{"name":"Margo Kondratieva","is_ca":true},{"name":"Sergey Sadov","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.005931039444430894,"gpt":0.2574354021965067,"spread":0.2515043627520758,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001624078,0.0007526517,0.0009512065,0.002042013,0.0008093308,0.001537083,0.001468653,0.0009747053,0.008003782],"category_scores_gemma":[0.006043651,0.0004772546,0.001137121,0.001470166,0.002543207,0.00355219,0.001599116,0.00276557,0.001712609],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009309027,"about_ca_system_score_gemma":0.0009305293,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001894296,"about_ca_topic_score_gemma":0.001548793,"domain_scores_codex":[0.9993042,0.0002939827,0.00002573346,0.0001115444,0.00019311,0.00007149691],"domain_scores_gemma":[0.9986243,0.0007080819,0.0001386735,0.000198192,0.0002171211,0.0001135884],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001802452,0.00001191234,0.0000533009,0.00002725261,0.000006943641,0.00002281575,0.00004854139,0.003792322,0.0007078219,0.9828898,0.001093687,0.01132739],"study_design_scores_gemma":[0.00001392302,0.00001850839,0.0001187513,0.00001851522,0.000005833745,0.00005743025,0.00002558858,0.06169842,0.0007013064,0.9313206,0.005999144,0.00002202678],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02595827,0.001705851,0.9382825,0.001051855,0.0006319372,0.00004357713,0.0001281436,0.0002180935,0.03197979],"genre_scores_gemma":[0.594752,0.005096394,0.2886236,0.0009649583,0.001803062,0.0003043258,0.0003490167,0.001330339,0.1067763],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008003782,"threshold_uncertainty_score":0.0267753,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2029396671","doi":"10.1016/j.aam.2012.05.003","title":"Congruences arising from Apéry-type series for zeta values","year":2012,"lang":"en","type":"article","venue":"Advances in Applied Mathematics","topic":"Advanced Mathematical Identities","field":"Mathematics","cited_by":17,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Dalhousie University","funders":"Abdus Salam International Centre for Theoretical Physics","keywords":"Mathematics; Congruence relation; Series (stratigraphy); Type (biology); Conjecture; Truncation (statistics); Binomial coefficient; Combinatorics; Pure mathematics; Statistics","authors":[{"name":"Kh. Hessami Pilehrood","is_ca":true},{"name":"Tatiana Hessami Pilehrood","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04878537635750659,"gpt":0.3576987221949742,"spread":0.3089133458374677,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003099888,0.00211279,0.001965538,0.005098713,0.005134878,0.008478615,0.001753079,0.002681581,0.01252552],"category_scores_gemma":[0.008847459,0.001074134,0.002023024,0.003348011,0.007566911,0.01114606,0.0054205,0.00634925,0.002798146],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002703884,"about_ca_system_score_gemma":0.001107226,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005118581,"about_ca_topic_score_gemma":0.0005548664,"domain_scores_codex":[0.99774,0.0005114245,0.0001715215,0.00039314,0.0007722471,0.0004115694],"domain_scores_gemma":[0.9974183,0.001001845,0.0002805482,0.0002608217,0.0003852906,0.0006532077],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00002315146,0.00001290839,0.00006906017,0.00001360478,0.00000416018,0.0001059296,0.0001904435,0.00005707354,0.0003389132,0.9970933,0.0005399035,0.001551405],"study_design_scores_gemma":[0.00002753513,0.00001020997,0.00009528769,0.00001131461,0.000006767223,0.0001489963,0.0000686556,0.0005685312,0.0002845009,0.9968073,0.001959424,0.00001148679],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.3638018,0.002903626,0.2402407,0.005694843,0.005473589,0.0002398912,0.0005787244,0.0008458798,0.380221],"genre_scores_gemma":[0.9016622,0.001671514,0.02928517,0.0009783992,0.003926505,0.0002472009,0.0003689626,0.0005871209,0.06127295],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01252552,"threshold_uncertainty_score":0.04190207,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2013194786","doi":"10.1016/j.aam.2010.09.001","title":"Counting unicellular maps on non-orientable surfaces","year":2010,"lang":"en","type":"article","venue":"Advances in Applied Mathematics","topic":"Stochastic processes and statistical mechanics","field":"Mathematics","cited_by":17,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"","keywords":"Bijection; Mathematics; Embedding; Combinatorics; Graph; Complement (music); Topology (electrical circuits); Polyomino; Infinity; Surface (topology); Discrete mathematics; Computer science; Geometry; Biology; Mathematical analysis","authors":[{"name":"Olivier Bernardi","is_ca":false},{"name":"Guillaume Chapuy","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01495369615490148,"gpt":0.2972277372576925,"spread":0.282274041102791,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009680548,0.0009537502,0.001422041,0.005316596,0.001655151,0.003649463,0.002783698,0.002567179,0.004245897],"category_scores_gemma":[0.01073379,0.0006882134,0.000659443,0.002528345,0.002732245,0.005249097,0.002905501,0.001260996,0.0004875078],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001148588,"about_ca_system_score_gemma":0.0003248655,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008816309,"about_ca_topic_score_gemma":0.0007168323,"domain_scores_codex":[0.9989421,0.0002076408,0.00008530114,0.0002103085,0.0003894052,0.000165284],"domain_scores_gemma":[0.9917198,0.004033833,0.001381486,0.0006337591,0.001159034,0.00107196],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001179439,0.00004304191,0.003422072,0.000201071,0.00003506969,0.0003842541,0.0004386223,0.0113207,0.008222001,0.9587912,0.001543661,0.01548025],"study_design_scores_gemma":[0.00001900743,0.00004894212,0.003233828,0.00005351477,0.0000376772,0.0006555235,0.0003233654,0.1204301,0.004294695,0.8681602,0.002703969,0.00003911473],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.810488,0.0008657529,0.1638117,0.0005461191,0.0001997459,0.000062899,0.0002258525,0.0003367128,0.02346333],"genre_scores_gemma":[0.950729,0.0007151435,0.03764139,0.0001431174,0.0003137517,0.0001298895,0.0004726361,0.0001998528,0.009655312],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.005316596,"threshold_uncertainty_score":0.01420397,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2061773557","doi":"10.1016/j.aam.2007.04.003","title":"Blow-up in nonlinear heat equations","year":2007,"lang":"en","type":"article","venue":"Advances in Applied Mathematics","topic":"Advanced Mathematical Physics Problems","field":"Mathematics","cited_by":17,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Mathematics; Remainder; Nonlinear system; Maxima; Dimension (graph theory); Heat equation; Mathematical analysis; Point (geometry); Applied mathematics; Pure mathematics; Geometry","authors":[{"name":"S. I. Dejak","is_ca":true},{"name":"Zhou Gang","is_ca":true},{"name":"Israel Michael Sigal","is_ca":true},{"name":"Shuangcai Wang","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03330567724861253,"gpt":0.3512585302152535,"spread":0.317952852966641,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001401489,0.001481787,0.001935411,0.002333003,0.002880356,0.002413099,0.001644809,0.002882899,0.01130975],"category_scores_gemma":[0.00895766,0.0006336141,0.001737101,0.0008680273,0.004066407,0.005906758,0.004889627,0.004714747,0.0007900625],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001979232,"about_ca_system_score_gemma":0.001180093,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003951569,"about_ca_topic_score_gemma":0.002299209,"domain_scores_codex":[0.9994264,0.0002057118,0.00003171961,0.00006565414,0.0001686898,0.0001019323],"domain_scores_gemma":[0.9978954,0.0007379722,0.0001990779,0.0001761044,0.0003902947,0.0006010853],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001158064,0.00004766215,0.0003108025,0.000167527,0.00003916004,0.0002792607,0.0003018149,0.01129489,0.001747263,0.9763547,0.00436784,0.004973276],"study_design_scores_gemma":[0.00003377479,0.00003110815,0.0004577132,0.00003474166,0.0000192842,0.000128666,0.0001071673,0.1078828,0.0003867075,0.8881754,0.002716307,0.00002625003],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.3969327,0.01486625,0.2785968,0.02201206,0.007868552,0.0002841358,0.0006937267,0.001520789,0.2772249],"genre_scores_gemma":[0.844066,0.003593931,0.01928586,0.001913736,0.003715762,0.0001673727,0.0006136561,0.0007487332,0.125895],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01130975,"threshold_uncertainty_score":0.03783488,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1981946205","doi":"10.1006/aama.2001.0736","title":"Random Partitions with Non-negative rth Differences","year":2001,"lang":"en","type":"article","venue":"Advances in Applied Mathematics","topic":"Advanced Mathematical Identities","field":"Mathematics","cited_by":17,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Mathematics; Combinatorics; Partition (number theory); Bijection; Omega; Integer (computer science); Discrete mathematics","authors":[{"name":"Rod Canfield","is_ca":false},{"name":"Sylvie Corteel","is_ca":true},{"name":"Paweł Hitczenko","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02686189053724694,"gpt":0.3081751111392917,"spread":0.2813132206020448,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007535164,0.001138569,0.002181572,0.003186767,0.001693749,0.005018914,0.002982745,0.00337628,0.0125364],"category_scores_gemma":[0.03771499,0.001311865,0.001293683,0.001365374,0.00690597,0.008419146,0.004888104,0.004125391,0.002268857],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001725885,"about_ca_system_score_gemma":0.0009158987,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003514388,"about_ca_topic_score_gemma":0.0003619822,"domain_scores_codex":[0.9945088,0.002539937,0.0002124358,0.0009041418,0.001175691,0.000658929],"domain_scores_gemma":[0.9696572,0.01942289,0.002928048,0.004350849,0.001622403,0.002018594],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00009852931,0.00002348298,0.0002200576,0.00003425683,0.00001462874,0.00006670578,0.00008887522,0.003249259,0.0007210608,0.9919004,0.0007993302,0.002783376],"study_design_scores_gemma":[0.0000672644,0.0000442791,0.0003435369,0.00002714286,0.00001178071,0.0002401223,0.00005526348,0.04870962,0.0008190685,0.9483317,0.001307284,0.00004295346],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2432554,0.001319696,0.7230696,0.002784966,0.0006719318,0.0002572769,0.0006024668,0.000686185,0.02735258],"genre_scores_gemma":[0.8963568,0.0007745899,0.06650985,0.000943379,0.0008010837,0.0004724432,0.0005312219,0.0003748865,0.03323577],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.0125364,"threshold_uncertainty_score":0.04193848,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1718672927","doi":"10.1016/j.aam.2015.09.018","title":"Two operators on sandpile configurations, the sandpile model on the complete bipartite graph, and a Cyclic Lemma","year":2015,"lang":"en","type":"article","venue":"Advances in Applied Mathematics","topic":"Theoretical and Computational Physics","field":"Physics and Astronomy","cited_by":15,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"Agence Nationale de la Recherche","keywords":"Abelian sandpile model; Polyomino; Lemma (botany); Bijection; Mathematics; Combinatorics; Bipartite graph; Complete bipartite graph; Discrete mathematics; Equivalence (formal languages); Graph; Regular polygon; Geometry","authors":[{"name":"Jean-Christophe Aval","is_ca":false},{"name":"Michele D’Adderio","is_ca":false},{"name":"Mark Dukes","is_ca":false},{"name":"Yvan Le Borgne","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02515159122030653,"gpt":0.2735925001591178,"spread":0.2484409089388113,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001172767,0.0006201764,0.0009727561,0.001863813,0.002250643,0.002700307,0.001735914,0.002937942,0.01198385],"category_scores_gemma":[0.00436009,0.0005179158,0.001423805,0.001394602,0.004158549,0.006059334,0.003095285,0.003265079,0.0009253148],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001448308,"about_ca_system_score_gemma":0.001399411,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002095521,"about_ca_topic_score_gemma":0.001718125,"domain_scores_codex":[0.9989066,0.0003623754,0.00004395312,0.0001853079,0.0002249287,0.000276808],"domain_scores_gemma":[0.9963703,0.001613701,0.0003556601,0.0005217884,0.0003840347,0.0007546369],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001496186,0.000008733976,0.00003630006,0.000007736856,0.000001812841,0.00002605689,0.00005138533,0.0004767268,0.0002417585,0.9978974,0.0006162007,0.0006210523],"study_design_scores_gemma":[0.00001382995,0.00001165953,0.0000598234,0.000007032645,0.000002781175,0.0000476014,0.00005471426,0.01200203,0.0001837541,0.9868557,0.0007497011,0.00001140445],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.4307765,0.0006503885,0.4190348,0.005637212,0.0005682035,0.0001830405,0.0006524439,0.0005926852,0.1419046],"genre_scores_gemma":[0.9320517,0.0003247707,0.03612046,0.001295101,0.0003538339,0.0002521909,0.0004252802,0.0002310694,0.02894548],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01198385,"threshold_uncertainty_score":0.04008996,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1980283844","doi":"10.1016/s0196-8858(02)00529-8","title":"A direct algorithm to construct the minimal Z-pairs for rational functions","year":2003,"lang":"en","type":"article","venue":"Advances in Applied Mathematics","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Construct (python library); Mathematics; Maple; Algorithm; Rational function; Discrete mathematics; Algebra over a field; Computer science; Pure mathematics","authors":[{"name":"H. Q. Le","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01146985244514401,"gpt":0.2527011517575469,"spread":0.2412312993124029,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008128266,0.001627696,0.001492172,0.001646445,0.001405125,0.002128358,0.00174375,0.001251688,0.0138532],"category_scores_gemma":[0.002724336,0.0008847138,0.00141432,0.001445775,0.001068501,0.003346159,0.004140402,0.002467996,0.00592721],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009326013,"about_ca_system_score_gemma":0.001003392,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000558088,"about_ca_topic_score_gemma":0.001037121,"domain_scores_codex":[0.9992631,0.0001573924,0.00006387541,0.0002026966,0.0001989116,0.0001139691],"domain_scores_gemma":[0.9990892,0.0004191382,0.00005264247,0.0001957273,0.0001740046,0.00006928088],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0007133814,0.000291691,0.001328348,0.0007841013,0.0001302487,0.0002657281,0.0006669289,0.007484084,0.02098214,0.3639127,0.02261762,0.5808231],"study_design_scores_gemma":[0.0004608831,0.0004164097,0.0008836896,0.0001555459,0.0002261734,0.0007519217,0.0005316323,0.05913687,0.03992077,0.8484805,0.04888821,0.0001473589],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0351721,0.0003728145,0.9454768,0.0003869634,0.0001205311,0.0002740418,0.0004241891,0.002980075,0.0147924],"genre_scores_gemma":[0.1677681,0.0002124981,0.8230869,0.0001580512,0.00004220425,0.000329149,0.001168828,0.0007641227,0.006470291],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.0138532,"threshold_uncertainty_score":0.04634356,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2049415597","doi":"10.1016/j.aam.2008.06.006","title":"On the theory of resonances in non-relativistic quantum electrodynamics and related models","year":2009,"lang":"en","type":"article","venue":"Advances in Applied Mathematics","topic":"Spectral Theory in Mathematical Physics","field":"Mathematics","cited_by":15,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Resolvent; Hamiltonian (control theory); Physics; Analytic continuation; Quantum; Quantum mechanics; S-matrix; Quantum field theory; Quantum electrodynamics; Mathematics; Mathematical physics; Mathematical analysis","authors":[{"name":"Walid K. Abou Salem","is_ca":true},{"name":"Jérémy Faupin","is_ca":false},{"name":"Jürg Fröhlich","is_ca":false},{"name":"Israel Michael Sigal","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01644610173307735,"gpt":0.2854864843370331,"spread":0.2690403826039557,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002433556,0.001034741,0.001617049,0.001758392,0.002334612,0.003017252,0.002276415,0.003043595,0.005398555],"category_scores_gemma":[0.004036248,0.0004696728,0.00123383,0.001378562,0.005848061,0.006849948,0.002902088,0.003126162,0.0008161036],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001473461,"about_ca_system_score_gemma":0.0008535173,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001074241,"about_ca_topic_score_gemma":0.001020116,"domain_scores_codex":[0.9990558,0.0004367972,0.00004713744,0.00009946161,0.0002576887,0.0001030389],"domain_scores_gemma":[0.9982902,0.00101961,0.0001326009,0.0001885888,0.0002028199,0.0001662536],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000004142559,0.000005908181,0.00001227733,0.0000154921,0.000001975,0.00001777203,0.00005205131,0.0008191765,0.00009311265,0.9979924,0.0005178283,0.0004679887],"study_design_scores_gemma":[0.000002991504,0.000003269234,0.00001515073,0.000004285156,0.00000124252,0.00001282939,0.00001575372,0.003040003,0.00001432655,0.9962381,0.0006484353,0.000003461258],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1552975,0.02543791,0.4507049,0.02304562,0.004324202,0.00009588581,0.0002768461,0.0003939655,0.3404232],"genre_scores_gemma":[0.90273,0.008946846,0.03248039,0.003533331,0.0042506,0.000154167,0.0001883168,0.0001807057,0.04753546],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005398555,"threshold_uncertainty_score":0.01805991,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2507315201","doi":"10.1016/j.aam.2015.10.003","title":"Characterizing 2-crossing-critical graphs","year":2015,"lang":"en","type":"article","venue":"Advances in Applied Mathematics","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"University of Waterloo; Javna Agencija za Raziskovalno Dejavnost RS; Natural Sciences and Engineering Research Council of Canada; Consejo Nacional de Ciencia y Tecnología","keywords":"Mathematics; Subdivision; Combinatorics; Crossing number (knot theory); Chordal graph; Indifference graph; Pathwidth; 1-planar graph; Clique-sum; Planar graph; Discrete mathematics; Graph; Line graph","authors":[{"name":"Drago Bokal","is_ca":false},{"name":"Bogdan Oporowski","is_ca":false},{"name":"R. Bruce Richter","is_ca":true},{"name":"Gelasio Salazar","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02771898456671913,"gpt":0.3079163636321328,"spread":0.2801973790654137,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008223354,0.001018384,0.0006509254,0.004125261,0.001219137,0.002422691,0.001392169,0.001554737,0.007329395],"category_scores_gemma":[0.008009713,0.0007403741,0.0005342102,0.001631848,0.001551575,0.003065698,0.00178521,0.001372341,0.0006136933],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001194692,"about_ca_system_score_gemma":0.0005395655,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009974112,"about_ca_topic_score_gemma":0.001172957,"domain_scores_codex":[0.999423,0.0001088236,0.00002934346,0.0001693002,0.0001601681,0.0001094074],"domain_scores_gemma":[0.9954398,0.002116574,0.0007965335,0.0003532217,0.0006290778,0.0006648411],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0002532973,0.0001811678,0.008227104,0.0003353654,0.00005886763,0.0009136995,0.0009968753,0.0544959,0.01522541,0.8763946,0.007288018,0.03562966],"study_design_scores_gemma":[0.00003125401,0.000065694,0.002216934,0.00006840026,0.00003090324,0.0005684136,0.0004543305,0.1235571,0.004557322,0.8631083,0.005314033,0.00002732085],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6712751,0.0005139106,0.2919577,0.00060916,0.0001135837,0.0001939958,0.0006760813,0.0005276261,0.03413284],"genre_scores_gemma":[0.9466729,0.0003597713,0.04386563,0.0002574327,0.0000998085,0.0001001231,0.001080284,0.0002537441,0.007310337],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.007329395,"threshold_uncertainty_score":0.02451932,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2090113296","doi":"10.1016/j.aam.2014.11.001","title":"Factor complexity of S-adic words generated by the Arnoux–Rauzy–Poincaré algorithm","year":2014,"lang":"en","type":"article","venue":"Advances in Applied Mathematics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Austrian Science Fund; Agence Nationale de la Recherche","keywords":"Piecewise linear function; Upper and lower bounds; Fraction (chemistry); Convergence (economics); Factor (programming language); Piecewise; Euclidean algorithm","authors":[],"retraction":null,"screen_n_in":null,"score":{"opus":0.01632427309637725,"gpt":0.2521384388042421,"spread":0.2358141657078648,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007321293,0.0005518813,0.00109764,0.001412036,0.00100034,0.003378259,0.001111878,0.001121093,0.009632542],"category_scores_gemma":[0.007173064,0.0003252516,0.0007908051,0.001181547,0.00179143,0.003896307,0.001066469,0.001157755,0.0008803596],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001705001,"about_ca_system_score_gemma":0.0009556282,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00205499,"about_ca_topic_score_gemma":0.001496598,"domain_scores_codex":[0.9989437,0.0002412723,0.0000640782,0.0002121144,0.0003412302,0.0001976213],"domain_scores_gemma":[0.9954311,0.003265485,0.0002765811,0.0002695667,0.0005069554,0.0002504027],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0005022503,0.00005743155,0.002137626,0.000122827,0.00003781105,0.0001891189,0.0004944353,0.03158759,0.004168168,0.9433154,0.002782832,0.01460445],"study_design_scores_gemma":[0.00005644017,0.00004723886,0.0006443575,0.00001652582,0.00002043841,0.0001144127,0.00007631485,0.1320906,0.00220885,0.8631145,0.001581517,0.0000289095],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8274917,0.0009521627,0.1418202,0.001546674,0.0001103498,0.00005866641,0.0006715193,0.0003787378,0.02696989],"genre_scores_gemma":[0.9796925,0.0002455673,0.01212775,0.0001096739,0.0001192897,0.00005362729,0.0004938223,0.00009411568,0.007063673],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.009632542,"threshold_uncertainty_score":0.032224,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4212872005","doi":"10.1016/j.aam.2007.07.001","title":"Reflection groups and polytopes over finite fields, III","year":2007,"lang":"en","type":"article","venue":"Advances in Applied Mathematics","topic":"Geometric and Algebraic Topology","field":"Mathematics","cited_by":14,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of New Brunswick","funders":"","keywords":"Mathematics; Polytope; Reflection (computer programming); Reflection group; Combinatorics; Pure mathematics; Coxeter group; Computer science","authors":[{"name":"Barry Monson","is_ca":true},{"name":"Egon Schulte","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02049110561486117,"gpt":0.3195110390553648,"spread":0.2990199334405036,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006761987,0.0005945125,0.0006690648,0.00099264,0.001588375,0.003696278,0.0008330239,0.0007164584,0.00830914],"category_scores_gemma":[0.001332347,0.0003190849,0.0007104604,0.0007779811,0.00440051,0.004469613,0.001803192,0.003172242,0.001482456],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001108373,"about_ca_system_score_gemma":0.000507661,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007225113,"about_ca_topic_score_gemma":0.0004031807,"domain_scores_codex":[0.9995255,0.0001100689,0.00002189572,0.0001211322,0.0001221647,0.00009918926],"domain_scores_gemma":[0.9994494,0.0001977076,0.00008964731,0.0001124237,0.00006513397,0.00008569786],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0000112754,0.000007376551,0.00007050308,0.00001020391,0.000003080132,0.00001599472,0.0001133793,0.0002518852,0.0002121977,0.9958898,0.0009446846,0.002469654],"study_design_scores_gemma":[0.000007260375,0.00001629707,0.000145481,0.00001071484,0.000003104077,0.00004940997,0.000187716,0.0007848021,0.0002142647,0.9902587,0.008317385,0.000004791096],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.2682775,0.01207338,0.1911502,0.009108991,0.002379002,0.0001055838,0.0004559645,0.0003737964,0.5160756],"genre_scores_gemma":[0.8679377,0.003948679,0.02029188,0.0008939056,0.001764419,0.0001270518,0.00045113,0.0001369367,0.1044484],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00830914,"threshold_uncertainty_score":0.0277968,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2069859193","doi":"10.1016/j.aam.2010.10.004","title":"Lattice point methods for combinatorial games","year":2010,"lang":"en","type":"article","venue":"Advances in Applied Mathematics","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Banff International Research Station for Mathematical Innovation and Discovery; Dalhousie University; National Science Foundation","keywords":"Mathematics; Lattice (music); Combinatorics; Combinatorial analysis; Discrete mathematics","authors":[{"name":"Alan Guo","is_ca":false},{"name":"Ezra Miller","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02524175753119254,"gpt":0.3759550201433229,"spread":0.3507132626121303,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00272185,0.001532772,0.002087325,0.002381036,0.001159077,0.002642923,0.002707355,0.001555951,0.01213527],"category_scores_gemma":[0.00909663,0.00086038,0.001816652,0.002063086,0.002769132,0.00382426,0.002730737,0.006038228,0.002315242],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001671397,"about_ca_system_score_gemma":0.001584751,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003267591,"about_ca_topic_score_gemma":0.00382519,"domain_scores_codex":[0.9982627,0.0009851106,0.00005001125,0.0001277981,0.0004692691,0.0001052021],"domain_scores_gemma":[0.9959013,0.002937322,0.0001341292,0.0002883907,0.0004801008,0.0002587066],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00002337486,0.00004496432,0.00008890388,0.00008849776,0.00002987584,0.00001166632,0.00005895204,0.02688974,0.0002076167,0.9520293,0.003193427,0.0173337],"study_design_scores_gemma":[0.00002429437,0.00001060389,0.00002648824,0.00002129569,0.000007355006,0.000006696509,0.00001912253,0.2005676,0.00007745159,0.7958452,0.003386791,0.000007116489],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003619497,0.000911045,0.981028,0.0004884446,0.0002133205,0.00004723994,0.00006580156,0.0001051614,0.01352155],"genre_scores_gemma":[0.2183331,0.00370837,0.7172928,0.0005413978,0.00114334,0.0009659121,0.0005734208,0.0007726905,0.05666889],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01213527,"threshold_uncertainty_score":0.04059649,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1987700418","doi":"10.1016/j.aam.2014.08.005","title":"On the asymptotic abelian complexity of morphic words","year":2014,"lang":"en","type":"article","venue":"Advances in Applied Mathematics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Winnipeg","funders":"Carnegie Mellon University; Williams College; National Science Foundation","keywords":"Morphism; Mathematics; Abelian group; Iterated function; Permutation (music); Factorization; Binary number; Combinatorics on words; Discrete mathematics; Combinatorics; Word (group theory); Arithmetic; Algorithm","authors":[{"name":"F. Blanchet-Sadri","is_ca":false},{"name":"Nathan Fox","is_ca":false},{"name":"Narad Rampersad","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01856410111223538,"gpt":0.2458517527869865,"spread":0.2272876516747511,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00184048,0.0006459758,0.001412831,0.003813063,0.00184748,0.004842208,0.001909843,0.001755774,0.0106152],"category_scores_gemma":[0.02083328,0.0005944018,0.0008250177,0.002384779,0.005833744,0.01312791,0.004715497,0.003973578,0.0007456484],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002451513,"about_ca_system_score_gemma":0.000848647,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001154925,"about_ca_topic_score_gemma":0.0009587676,"domain_scores_codex":[0.9977229,0.0007108693,0.0001150555,0.000335835,0.0007274891,0.0003878469],"domain_scores_gemma":[0.9730543,0.02158661,0.00139845,0.001325911,0.00138322,0.001251469],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00009399623,0.00003257978,0.001319561,0.00006497698,0.00001353527,0.00008878521,0.0003521833,0.003218693,0.00068444,0.988773,0.00101566,0.004342524],"study_design_scores_gemma":[0.00001328417,0.00001457477,0.0007326088,0.0000141247,0.00001028735,0.00009475266,0.00009182893,0.01127802,0.0003177689,0.9865658,0.0008512472,0.00001567615],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7938325,0.002544765,0.07919417,0.006260429,0.0003280843,0.0000499303,0.0004678638,0.0003205787,0.1170016],"genre_scores_gemma":[0.9865868,0.000548596,0.004325802,0.0002989862,0.0005521636,0.00005805865,0.0002564923,0.00009284401,0.007280193],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.0106152,"threshold_uncertainty_score":0.03551137,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2014803743","doi":"10.1016/j.aam.2014.08.002","title":"When does a biased graph come from a group labelling?","year":2014,"lang":"en","type":"article","venue":"Advances in Applied Mathematics","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"Australian Research Council; Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Discrete mathematics; Graph","authors":[{"name":"Matt DeVos","is_ca":true},{"name":"Daryl Funk","is_ca":true},{"name":"Irene Pivotto","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.00893912167333614,"gpt":0.2256887496741622,"spread":0.2167496280008261,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003221827,0.0003936246,0.001291861,0.001548152,0.002572554,0.004125502,0.001614688,0.006920358,0.007463296],"category_scores_gemma":[0.04705336,0.0009712938,0.0008904451,0.001642454,0.004419717,0.01148582,0.002451288,0.004033648,0.001784968],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001401024,"about_ca_system_score_gemma":0.0008103653,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001711444,"about_ca_topic_score_gemma":0.001848124,"domain_scores_codex":[0.9974756,0.0007821755,0.0001154755,0.0008160987,0.0004823791,0.0003282476],"domain_scores_gemma":[0.972747,0.01797011,0.002268129,0.003523022,0.002134123,0.00135756],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000216874,0.00005897909,0.007318507,0.0002586425,0.00005814079,0.0005659609,0.001008122,0.003437029,0.002182859,0.9383561,0.01565653,0.03088224],"study_design_scores_gemma":[0.00002595538,0.000008987509,0.0007698066,0.00005337132,0.00001625861,0.0003951245,0.0005518324,0.009142421,0.0008184812,0.983678,0.004513256,0.00002637078],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3786761,0.001770379,0.5132573,0.04695839,0.001649536,0.0001790692,0.001660739,0.001416003,0.05443255],"genre_scores_gemma":[0.8848341,0.0007769403,0.09941579,0.004560076,0.0008329588,0.0001370727,0.001402905,0.0009895556,0.007050627],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007463296,"threshold_uncertainty_score":0.02496725,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4367313129","doi":"10.1016/j.aam.2023.102540","title":"Row-strict dual immaculate functions","year":2023,"lang":"en","type":"article","venue":"Advances in Applied Mathematics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":11,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"","keywords":"Mathematics; Hook; Dual (grammatical number); Skew; Combinatorics; Dual function; Discrete mathematics; Pure mathematics; Computer science","authors":[{"name":"Elizabeth Niese","is_ca":false},{"name":"Sheila Sundaram","is_ca":false},{"name":"Stephanie van Willigenburg","is_ca":true},{"name":"Julianne Vega","is_ca":false},{"name":"Shiyun Wang","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03220997425033819,"gpt":0.3271643900644732,"spread":0.2949544158141351,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008976125,0.001095433,0.000734252,0.001976596,0.001562382,0.00379403,0.001086348,0.0009082759,0.01924056],"category_scores_gemma":[0.002662699,0.0005013492,0.0008998073,0.001239767,0.002314257,0.004678295,0.003605751,0.004386856,0.004961755],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000999038,"about_ca_system_score_gemma":0.0006882055,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005347283,"about_ca_topic_score_gemma":0.0005552044,"domain_scores_codex":[0.9992562,0.0001515877,0.00003256756,0.0001328182,0.0002312638,0.0001957077],"domain_scores_gemma":[0.9990049,0.0002249249,0.00008131057,0.0001787708,0.0002778408,0.0002322468],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0000307202,0.00001423613,0.0000689759,0.00001689525,0.00000416045,0.00002716532,0.00004533319,0.0002578645,0.0005911263,0.9914986,0.002004096,0.005440793],"study_design_scores_gemma":[0.00001060368,0.00001883142,0.0001309883,0.00001432925,0.000009264729,0.00017415,0.00005642544,0.003886429,0.001534669,0.9855697,0.00857964,0.00001502707],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.1789163,0.0007629714,0.3988428,0.002253498,0.001327761,0.00008116998,0.0007575906,0.000680119,0.4163778],"genre_scores_gemma":[0.7288382,0.001052295,0.06584429,0.001460977,0.0008656565,0.000131222,0.0009459466,0.0008565306,0.200005],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01924056,"threshold_uncertainty_score":0.0643661,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1661759167","doi":"10.1016/j.aam.2009.01.002","title":"Structure and enumeration of two-connected graphs with prescribed three-connected components","year":2009,"lang":"en","type":"article","venue":"Advances in Applied Mathematics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":11,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université du Québec à Montréal; Acadia University","funders":"","keywords":"Enumeration; Planar graph; Chordal graph; Graph; Class (philosophy); Bipartite graph; Modular decomposition; Tree (set theory)","authors":[],"retraction":null,"screen_n_in":null,"score":{"opus":0.01505160825475109,"gpt":0.2775496215708921,"spread":0.262498013316141,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004559091,0.0005921792,0.0007227423,0.00217909,0.002284981,0.003726537,0.002137545,0.001607715,0.007293882],"category_scores_gemma":[0.003397781,0.0006212043,0.0007041104,0.003008125,0.002009926,0.003145271,0.001838328,0.001723583,0.001042082],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001027984,"about_ca_system_score_gemma":0.0008278326,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001448285,"about_ca_topic_score_gemma":0.001753795,"domain_scores_codex":[0.9994442,0.0001552492,0.00004682004,0.0001089398,0.0001376814,0.0001070602],"domain_scores_gemma":[0.9972066,0.001325575,0.0004098876,0.0003343463,0.0004188596,0.0003047586],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001202767,0.00007401653,0.001131001,0.0001022446,0.00001188263,0.0002063273,0.0006852802,0.003564153,0.003499461,0.976781,0.001875895,0.01194841],"study_design_scores_gemma":[0.00003154778,0.000018961,0.0007831261,0.00003407162,0.00001496782,0.0002273579,0.0002896756,0.01663764,0.001642407,0.9771134,0.003188835,0.00001798075],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7926984,0.0004035507,0.1194747,0.001252948,0.0001084689,0.0001387643,0.001105465,0.0003137242,0.08450398],"genre_scores_gemma":[0.9103294,0.0004093738,0.06903622,0.0002903554,0.00006655107,0.0001801584,0.002031977,0.0001316647,0.01752442],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.007293882,"threshold_uncertainty_score":0.02440047,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1978671960","doi":"10.1016/j.aam.2014.10.002","title":"A characterization of p-automatic sequences as columns of linear cellular automata","year":2014,"lang":"en","type":"article","venue":"Advances in Applied Mathematics","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Trent University; Université du Québec à Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Cellular automaton; Characterization (materials science); Computer science; Computational biology; Mathematics; Algorithm; Biology; Materials science; Nanotechnology","authors":[{"name":"Eric Rowland","is_ca":true},{"name":"Reem Yassawi","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.008061664681708791,"gpt":0.2459680981247986,"spread":0.2379064334430898,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002164111,0.0004986865,0.000449651,0.001187176,0.000805454,0.00227641,0.000657466,0.0006355585,0.008267026],"category_scores_gemma":[0.002757848,0.0003655707,0.0004749575,0.00103473,0.001298805,0.001404166,0.0007607315,0.001071719,0.00111335],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000569717,"about_ca_system_score_gemma":0.0006647923,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001215832,"about_ca_topic_score_gemma":0.0009229506,"domain_scores_codex":[0.9995342,0.00007445942,0.00003178663,0.0001430406,0.0001199242,0.00009655828],"domain_scores_gemma":[0.9976192,0.001158844,0.0003150465,0.0001605279,0.0004488269,0.00029757],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001470158,0.00006476026,0.001324735,0.0001152932,0.00001757259,0.0002867621,0.0004058442,0.0131941,0.02438161,0.9349915,0.002277191,0.02279358],"study_design_scores_gemma":[0.00003654861,0.0001917114,0.001432104,0.00005847948,0.0000245531,0.0006330141,0.0002895705,0.245776,0.01468677,0.7243815,0.01242323,0.00006649167],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3968652,0.0004178634,0.5542625,0.0004856587,0.0001485072,0.0001117966,0.001062346,0.0009441273,0.04570204],"genre_scores_gemma":[0.925616,0.0002968624,0.05623851,0.0002323882,0.0001937518,0.000193891,0.0008801719,0.0002392054,0.01610932],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008267026,"threshold_uncertainty_score":0.0276559,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1993840779","doi":"10.1016/s0196-8858(02)00542-0","title":"Attribute grammars and automatic complexity analysis","year":2003,"lang":"en","type":"article","venue":"Advances in Applied Mathematics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":9,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Rule-based machine translation; Mathematics; Context-free grammar; L-attributed grammar; Class (philosophy); Tree-adjoining grammar; Context (archaeology); Function (biology); Theoretical computer science; Computer science; Artificial intelligence; Geography","authors":[{"name":"Marni Mishna","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04287354139864274,"gpt":0.3283646081009167,"spread":0.2854910667022739,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002562538,0.0008525053,0.00160048,0.003506255,0.002521152,0.005484425,0.002002756,0.002131263,0.006490083],"category_scores_gemma":[0.01056957,0.001004677,0.002428845,0.004411045,0.00827915,0.01648886,0.003052431,0.006542742,0.0007808941],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003520572,"about_ca_system_score_gemma":0.001208887,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00256367,"about_ca_topic_score_gemma":0.002019814,"domain_scores_codex":[0.997211,0.001048024,0.0001578602,0.0005131121,0.0008238123,0.000246129],"domain_scores_gemma":[0.9876686,0.009848195,0.0005509173,0.00100678,0.0006907663,0.0002347761],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000005821475,0.000007208374,0.0001235745,0.00001840146,0.000006624189,0.00001582411,0.00009450093,0.001205769,0.00005909883,0.9947593,0.000548702,0.003155246],"study_design_scores_gemma":[0.000001572454,9.145205e-7,0.00003876181,0.000002592097,0.000001835455,0.000008166742,0.000008503065,0.001720833,0.00002952544,0.9975458,0.0006380788,0.000003376568],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09868348,0.01109865,0.7993098,0.01669704,0.0006146234,0.00005848934,0.0005760037,0.0006284848,0.07233343],"genre_scores_gemma":[0.8846209,0.004775959,0.08917014,0.001271696,0.002018445,0.0001921804,0.000801668,0.0002335135,0.01691549],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006490083,"threshold_uncertainty_score":0.02554369,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1994554004","doi":"10.1016/j.aam.2010.09.009","title":"Eigenvectors for a random walk on a hyperplane arrangement","year":2011,"lang":"en","type":"article","venue":"Advances in Applied Mathematics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":9,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Western University","funders":"","keywords":"Hyperplane; Mathematics; Random walk; Eigenvalues and eigenvectors; Random matrix; Combinatorics; Lattice (music); Discrete mathematics; Pure mathematics; Statistics","authors":[{"name":"Graham Denham","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.06116507959434987,"gpt":0.3159970725580246,"spread":0.2548319929636748,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005470868,0.0009447775,0.001116157,0.002624443,0.001467853,0.002487672,0.001262025,0.00165029,0.01958937],"category_scores_gemma":[0.001985845,0.0005938069,0.0008145405,0.001446647,0.001448185,0.002192305,0.001328517,0.001680546,0.003518765],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006468842,"about_ca_system_score_gemma":0.0006246027,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001418114,"about_ca_topic_score_gemma":0.001547052,"domain_scores_codex":[0.9993294,0.0001520948,0.0000333249,0.0001382122,0.0001911048,0.0001557977],"domain_scores_gemma":[0.998821,0.0003131929,0.0001773895,0.0001224916,0.0002217615,0.0003442744],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00008798617,0.00008377512,0.0003807187,0.00005861802,0.00002696309,0.0001584765,0.0001219213,0.01197287,0.003954174,0.9667301,0.005788256,0.01063611],"study_design_scores_gemma":[0.00004315629,0.0000348641,0.0006797286,0.00002106252,0.00001129516,0.0002592777,0.00009396033,0.101456,0.0007570875,0.8929299,0.003657565,0.00005611746],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3206048,0.0007881376,0.6127861,0.001938906,0.0008711559,0.000229881,0.001250852,0.001135056,0.0603951],"genre_scores_gemma":[0.7988952,0.0009123517,0.08122877,0.0007487888,0.0006381118,0.0004600025,0.001611893,0.001157482,0.1143473],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01958937,"threshold_uncertainty_score":0.06553298,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2069397816","doi":"10.1006/aama.2000.0684","title":"Priestley's Duality from Stone's","year":2000,"lang":"en","type":"article","venue":"Advances in Applied Mathematics","topic":"Quantum Mechanics and Applications","field":"Physics and Astronomy","cited_by":9,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Duality (order theory); Mathematical economics; Calculus (dental); Pure mathematics; Algebra over a field; Orthodontics; Medicine","authors":[{"name":"Isidore Fleisher","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0103728050770178,"gpt":0.2745315262241257,"spread":0.2641587211471079,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009896231,0.0007331074,0.001006711,0.001966707,0.002871516,0.003223249,0.0009077966,0.002079935,0.01467503],"category_scores_gemma":[0.002412599,0.0004491086,0.001066903,0.0009641016,0.004689479,0.008418047,0.003479504,0.00522836,0.002480096],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001374877,"about_ca_system_score_gemma":0.0008737739,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008647186,"about_ca_topic_score_gemma":0.0007276086,"domain_scores_codex":[0.9993531,0.0001511402,0.00004013537,0.0001486322,0.0001882413,0.0001187957],"domain_scores_gemma":[0.9994602,0.0001707825,0.00004448717,0.0001075655,0.0001365958,0.00008049887],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00000310765,0.000002175597,0.000005976953,0.000004192873,0.000001102886,0.00000989521,0.00004988417,0.0000136554,0.00004111299,0.9980105,0.0009207372,0.0009377571],"study_design_scores_gemma":[0.000003929847,0.0000033546,0.00002226663,0.000003810806,0.000001417403,0.00005146816,0.0000234382,0.00008691944,0.00007317864,0.9914716,0.008255543,0.000003239734],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.0431652,0.003103012,0.1041629,0.0149195,0.004603847,0.00006301437,0.0003655312,0.0003222428,0.8292947],"genre_scores_gemma":[0.6980177,0.002630195,0.03544944,0.00599918,0.00402278,0.0001644468,0.000297588,0.0005831457,0.2528356],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01467503,"threshold_uncertainty_score":0.04909283,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2054789626","doi":"10.1006/aama.2000.0695","title":"A Homological Interpretation of Skeletal Rigidity","year":2000,"lang":"en","type":"article","venue":"Advances in Applied Mathematics","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Montréal","funders":"","keywords":"Mathematics; Rigidity (electromagnetism); Interpretation (philosophy); Pure mathematics; Algebra over a field; Linguistics; Philosophy; Structural engineering","authors":[{"name":"Tiong-Seng Tay","is_ca":false},{"name":"Walter Whiteley","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.008868251794471808,"gpt":0.2612120519522976,"spread":0.2523438001578258,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001239661,0.0005321332,0.000549837,0.002482755,0.001692718,0.002555562,0.001316604,0.001619544,0.01354651],"category_scores_gemma":[0.004105507,0.0004778816,0.0007466687,0.001932803,0.00737574,0.006793496,0.003238747,0.002817125,0.001122416],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008272862,"about_ca_system_score_gemma":0.0003997739,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006541478,"about_ca_topic_score_gemma":0.0005277389,"domain_scores_codex":[0.9990521,0.0003373611,0.00005555653,0.0002366359,0.0002330112,0.00008544268],"domain_scores_gemma":[0.9986221,0.0005992803,0.0001506999,0.0002734861,0.0002383814,0.000116182],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000003968808,0.0000027377,0.00003591643,0.000009782516,0.000001493695,0.00002719372,0.00009877147,0.0002193831,0.0001347747,0.9970397,0.0003828767,0.00204332],"study_design_scores_gemma":[0.000003810731,0.00000608017,0.00009325623,0.000005098869,0.000002351427,0.00006800697,0.00004702213,0.001052778,0.00007475803,0.9948703,0.003772394,0.000004249827],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09640822,0.00343312,0.6089604,0.01166019,0.001062568,0.00005554586,0.0004999888,0.0005449582,0.277375],"genre_scores_gemma":[0.8946375,0.0014942,0.07200103,0.001284095,0.001691864,0.0000752823,0.0003188555,0.0002113482,0.02828578],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01354651,"threshold_uncertainty_score":0.04531753,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}