{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":76,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":76,"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":"bbdce79d7f7b","filters":{"venue":"SIAM Journal on Discrete Mathematics"}},"results":[{"id":"W2093347633","doi":"10.1137/s0895480100376022","title":"The Wakeup Problem in Synchronous Broadcast Systems","year":2001,"lang":"en","type":"article","venue":"SIAM Journal on Discrete Mathematics","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":103,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université du Québec en Outaouais","funders":"","keywords":"Synchronization (alternating current); Computer science; Asynchronous communication; Clock synchronization; Parallel computing; Channel (broadcasting); Distributed computing; Computer network","authors":[{"name":"Leszek Gąsieniec","is_ca":false},{"name":"Andrzej Pelc","is_ca":true},{"name":"David Peleg","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01245770845899721,"gpt":0.2471855765119259,"spread":0.2347278680529287,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.001301804,0.0002277237,0.0003349998,0.0000952,0.0003951394,0.001178153,0.001307915,0.00007739885,0.000005212374],"category_scores_gemma":[0.00006619957,0.0001347955,0.0001197831,0.0004636626,0.00006795276,0.0003621806,0.0001053624,0.0004685799,0.0001287524],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001578165,"about_ca_system_score_gemma":0.00008498667,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000009446953,"about_ca_topic_score_gemma":0.000005462363,"domain_scores_codex":[0.9976295,0.0001335617,0.0008295285,0.0002347464,0.0006268904,0.0005457298],"domain_scores_gemma":[0.9984261,0.0002143359,0.0004340346,0.0006482297,0.0001095152,0.0001677259],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002648356,0.0003918067,0.0005786498,0.0002167336,0.00009178919,0.000844835,0.003128169,0.007301121,0.0001241589,0.947147,0.005665727,0.03448357],"study_design_scores_gemma":[0.002980252,0.0009171512,0.001503173,0.004452317,0.00003150236,0.0110409,0.003473543,0.5597692,0.0000640375,0.06630234,0.3480425,0.001423047],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02193407,0.003609462,0.9357356,0.002854515,0.001832386,0.0008869268,0.00001232748,0.0001601637,0.03297447],"genre_scores_gemma":[0.9848633,0.0006143589,0.01067755,0.0001086958,0.0003330631,0.00005046199,0.000001734017,0.00003712474,0.00331375],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9629292,"threshold_uncertainty_score":0.9998587,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1813313303","doi":"10.1137/100793529","title":"A Simple Polynomial Algorithm for the Longest Path Problem on Cocomparability Graphs","year":2012,"lang":"en","type":"article","venue":"SIAM Journal on Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":39,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Longest path problem; Combinatorics; Mathematics; Lexicographical order; Discrete mathematics; Time complexity; Induced path; Hamiltonian path; Graph; Shortest path problem","authors":[{"name":"George B. Mertzios","is_ca":false},{"name":"Derek G. Corneil","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03762119088775073,"gpt":0.3278538762090636,"spread":0.2902326853213129,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002987877,0.0003014987,0.000364853,0.000160327,0.0007087305,0.0003552207,0.001595967,0.00007702289,0.00002769839],"category_scores_gemma":[0.0002324825,0.0001756801,0.0003342121,0.0004062935,0.0001967209,0.0005405023,0.0002156347,0.0006917866,0.00005652506],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001143255,"about_ca_system_score_gemma":0.00007487612,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001162875,"about_ca_topic_score_gemma":0.000001106006,"domain_scores_codex":[0.9972122,0.0002166947,0.0005719261,0.0002894191,0.0008212497,0.0008885677],"domain_scores_gemma":[0.9961472,0.001975816,0.0003691935,0.0009700896,0.000165096,0.000372602],"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.0001618614,0.001609252,0.0005225351,0.0001752118,0.0002580221,0.00001902842,0.004849017,0.0007743911,0.0002236558,0.8359599,0.00649581,0.1489513],"study_design_scores_gemma":[0.001875645,0.001750328,0.001252388,0.0002173008,0.00005735814,0.0003512953,0.0007553347,0.1656842,0.001578518,0.8126478,0.0131021,0.0007277239],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01112408,0.0002273536,0.9846927,0.001086612,0.0004154468,0.001175352,0.00003442063,0.00008777588,0.00115625],"genre_scores_gemma":[0.623201,0.00006504779,0.3751768,0.0004182479,0.0005992787,0.0001859872,0.000003974443,0.00006794061,0.0002817406],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6120769,"threshold_uncertainty_score":0.7164026,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2046684958","doi":"10.1137/100803870","title":"Gallai's Theorem for List Coloring of Digraphs","year":2011,"lang":"en","type":"article","venue":"SIAM Journal on Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":33,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"","keywords":"Combinatorics; Mathematics; Complete coloring; Fractional coloring; Greedy coloring; Vertex (graph theory); List coloring; Discrete mathematics; Generalization; Brooks' theorem; Graph; Graph coloring; Graph power; Line graph","authors":[{"name":"Ararat Harutyunyan","is_ca":false},{"name":"Bojan Mohar","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.05820909347208875,"gpt":0.311648151051908,"spread":0.2534390575798193,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001276674,0.0001804245,0.000317686,0.0002622164,0.0001920681,0.00009853444,0.001378006,0.00005588729,0.00004403662],"category_scores_gemma":[0.0003258035,0.0001320973,0.0002576289,0.0003569374,0.0001648459,0.0003739132,0.0001685479,0.0002842776,0.00001013448],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003300013,"about_ca_system_score_gemma":0.00005239067,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":6.562782e-7,"about_ca_topic_score_gemma":0.000001120802,"domain_scores_codex":[0.9983001,0.00007719337,0.0005241359,0.0002043821,0.0004856908,0.0004084368],"domain_scores_gemma":[0.9980901,0.000488748,0.0004148716,0.00059363,0.000231192,0.0001814658],"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.00005765406,0.0001338458,0.00008216513,0.0000945796,0.00005196318,0.00001430689,0.002575322,0.00002099097,0.0008364839,0.994263,0.00007891993,0.001790769],"study_design_scores_gemma":[0.0004800252,0.0007111222,0.0001035645,0.0002128594,0.00001350597,0.00009308402,0.0003955449,0.005017353,0.01777364,0.9746616,0.0003505776,0.0001871136],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03192917,0.00009425406,0.9482208,0.0001202179,0.0002344159,0.0003547909,0.000008319016,0.00005662066,0.01898141],"genre_scores_gemma":[0.7408592,0.00005211689,0.2586933,0.00004016235,0.00005020345,0.0000181242,4.355996e-7,0.00002797741,0.0002584789],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.70893,"threshold_uncertainty_score":0.5386772,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2963663369","doi":"10.1137/16m108080x","title":"Planar Digraphs of Digirth Four are 2-Colorable","year":2017,"lang":"en","type":"article","venue":"SIAM Journal on Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":30,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"Javna Agencija za Raziskovalno Dejavnost RS; Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Digraph; Combinatorics; Mathematics; Conjecture; Monochromatic color; Planar; Planar graph; Colored; Discrete mathematics; Computer science; Graph; Physics","authors":[{"name":"Zhentao Li","is_ca":false},{"name":"Bojan Mohar","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04470984151357586,"gpt":0.3163314232194713,"spread":0.2716215817058955,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000954762,0.0002135563,0.0004202485,0.0002439785,0.0007159033,0.0006161128,0.00298596,0.00007050423,0.00002299802],"category_scores_gemma":[0.0006267631,0.0001569053,0.0002273457,0.0001740697,0.0002318953,0.0009195517,0.0002845582,0.0004956326,0.00004757208],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003662481,"about_ca_system_score_gemma":0.00006625632,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001300318,"about_ca_topic_score_gemma":0.000003754732,"domain_scores_codex":[0.997882,0.00008211973,0.0004972437,0.0002434266,0.0008343865,0.0004608434],"domain_scores_gemma":[0.9965876,0.000281204,0.001130753,0.001558677,0.000195667,0.0002460853],"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.00006901875,0.0002983343,0.00276619,0.0002295639,0.0001589091,0.0004072359,0.001128103,0.0002993888,0.0009887258,0.9878709,0.001067583,0.004716012],"study_design_scores_gemma":[0.0007416376,0.000447555,0.003066566,0.0005858659,0.0000145118,0.0002862737,0.0002780913,0.006274972,0.002944613,0.9842118,0.0008420441,0.0003060853],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1675013,0.0002589151,0.7882039,0.002963345,0.0007040572,0.0005466928,0.00003715618,0.0001310203,0.03965359],"genre_scores_gemma":[0.928934,0.0001199602,0.06982566,0.00006073342,0.00007129371,0.000006596702,4.525413e-7,0.00002859201,0.000952673],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7614327,"threshold_uncertainty_score":0.6398413,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2064062633","doi":"10.1137/100801044","title":"Isostatic Block and Hole Frameworks","year":2013,"lang":"en","type":"article","venue":"SIAM Journal on Discrete Mathematics","topic":"Structural Analysis and Optimization","field":"Engineering","cited_by":24,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"York University","funders":"Natural Sciences and Engineering Research Council of Canada; York University","keywords":"Rigidity (electromagnetism); Vertex (graph theory); Mathematics; Regular polygon; Combinatorics; Digraph; Graph; Geometry; Physics","authors":[{"name":"Wendy Finbow-Singh","is_ca":false},{"name":"Walter Whiteley","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.005130116889062898,"gpt":0.2039752871299425,"spread":0.1988451702408796,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00006539368,0.0001297597,0.0001789924,0.00007229904,0.00007957929,0.000205326,0.00008121335,0.00008696729,0.0003258128],"category_scores_gemma":[0.00004078111,0.00008918219,0.00005817976,0.0001027638,0.00002132837,0.000143187,0.0000134489,0.0003640832,0.00006910898],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000211068,"about_ca_system_score_gemma":0.000003090827,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":8.37563e-7,"about_ca_topic_score_gemma":4.183421e-7,"domain_scores_codex":[0.9993422,0.00001057064,0.0002608683,0.00006548715,0.0001635807,0.0001572617],"domain_scores_gemma":[0.9996126,0.00005916055,0.00006577816,0.0001127443,0.00004086897,0.0001088754],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000007435933,0.00007368736,0.0005490069,0.0006029102,0.0006319935,0.00004156873,0.005008929,0.9404528,0.001811048,0.01044227,0.01509106,0.02528728],"study_design_scores_gemma":[0.0001992834,0.00005388778,0.001035407,0.0001994703,0.0000541002,0.0001026784,0.0004980228,0.9720654,0.000256277,0.02512206,0.0001957217,0.0002176802],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9579621,0.0003966844,0.03614532,0.0005271296,0.0001970588,0.0001533985,0.00000287988,0.0000902892,0.004525135],"genre_scores_gemma":[0.9722379,0.0002789598,0.02707411,0.0001074287,0.00008641076,0.000003803121,0.000001462866,0.00002671982,0.0001832219],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.03161261,"threshold_uncertainty_score":0.3636744,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2049572715","doi":"10.1137/13090465x","title":"On List Coloring and List Homomorphism of Permutation and Interval Graphs","year":2014,"lang":"en","type":"article","venue":"SIAM Journal on Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"","keywords":"Combinatorics; Mathematics; Permutation graph; Discrete mathematics; Indifference graph; Chordal graph; Bipartite graph; Graph coloring; Interval graph; Pathwidth; 1-planar graph; Homomorphism; Cograph; Maximal independent set; Interval (graph theory); Edge coloring; Time complexity; Graph; Line graph; Graph power","authors":[{"name":"Jessica Enright","is_ca":false},{"name":"Lorna Stewart","is_ca":true},{"name":"Gábor Tardos","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01830399331218107,"gpt":0.2873615626007403,"spread":0.2690575692885592,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009647379,0.0001460074,0.000255313,0.0002484814,0.0001834277,0.0002076899,0.0003711547,0.00004253591,0.000008979866],"category_scores_gemma":[0.0003800259,0.000112571,0.00006410423,0.0001999006,0.0001975174,0.000300755,0.0001499463,0.000324882,0.000003322766],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002386733,"about_ca_system_score_gemma":0.0000147945,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000010783,"about_ca_topic_score_gemma":0.000001859399,"domain_scores_codex":[0.9987071,0.0001282738,0.0003475515,0.000191018,0.0004145973,0.0002114199],"domain_scores_gemma":[0.9985978,0.000598682,0.0002663785,0.0002831876,0.00009760482,0.0001563191],"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.00003402834,0.00006917773,0.0001495001,0.0001207179,0.00002497375,0.00001436643,0.00201844,0.00007995841,0.00136472,0.9897522,0.00004488621,0.006327032],"study_design_scores_gemma":[0.0006788462,0.00123513,0.0006487974,0.0005184265,0.00001329302,0.0002947074,0.0003010822,0.05952401,0.002282195,0.9341885,0.000119006,0.0001959772],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7363089,0.00007712669,0.260672,0.0004527239,0.0001182472,0.0001324843,0.00000325554,0.00002673763,0.002208544],"genre_scores_gemma":[0.976514,0.00006828862,0.02322227,0.00006492776,0.00002554408,0.000003243696,4.843771e-7,0.00001430919,0.00008690242],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2402052,"threshold_uncertainty_score":0.4590512,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2040969474","doi":"10.1137/s0895480103421397","title":"On the Behavior of a Family of Meta-Fibonacci Sequences","year":2005,"lang":"en","type":"article","venue":"SIAM Journal on Discrete Mathematics","topic":"Advanced Mathematical Theories and Applications","field":"Physics and Astronomy","cited_by":19,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Fibonacci number; Mathematics; Combinatorics; Recursion (computer science); Sequence (biology); Palindrome; Term (time); Discrete mathematics; Algorithm; Physics","authors":[{"name":"Joseph H. Callaghan","is_ca":true},{"name":"John J. Chew","is_ca":true},{"name":"Stephen M. Tanny","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04635252515277444,"gpt":0.3245307035768404,"spread":0.2781781784240659,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003303496,0.0001590311,0.0003984386,0.00003759806,0.0001163195,0.00002427187,0.0003091981,0.00002308754,0.0008508961],"category_scores_gemma":[0.00003679469,0.00008124718,0.0003460181,0.0001267301,0.0001369182,0.00006913879,0.00003314026,0.0002183929,0.00002658038],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001146798,"about_ca_system_score_gemma":0.00002542697,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001271534,"about_ca_topic_score_gemma":1.459943e-7,"domain_scores_codex":[0.998833,0.000034239,0.0005612656,0.00009354737,0.0003190642,0.0001588543],"domain_scores_gemma":[0.9983894,0.0005839291,0.0005467624,0.0003279319,0.00008712965,0.00006481415],"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.000006004786,0.0002991389,0.000006525376,0.00001719396,0.0002073583,2.782172e-7,0.0002428548,0.0003646912,0.001247394,0.9957408,0.0001380006,0.001729818],"study_design_scores_gemma":[0.0001875274,0.0001459621,0.00001672159,0.0001003658,0.0004953162,0.000004460931,0.001661164,0.0004496473,0.01462303,0.9809904,0.001198823,0.0001265578],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7045149,0.0002109875,0.1996944,0.002107219,0.0000851994,0.001129385,0.0002345002,0.00002735917,0.09199608],"genre_scores_gemma":[0.9749156,0.000009501436,0.02447508,0.00005759221,0.00008919516,0.0000840527,0.000001629551,0.00001755811,0.0003498259],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2704007,"threshold_uncertainty_score":0.9316715,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2009791993","doi":"10.1137/13094075x","title":"An Erdös--Ko--Rado Theorem for the Derangement Graph of ${PGL}_3(q)$ Acting on the Projective Plane","year":2014,"lang":"en","type":"article","venue":"SIAM Journal on Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":19,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Regina","funders":"","keywords":"Combinatorics; Mathematics; Projective plane; Derangement; Coset; Conjecture; Projective space; Projective line; Discrete mathematics; Projective linear group; Collineation; Projective test; Pure mathematics","authors":[{"name":"Karen Meagher","is_ca":true},{"name":"Pablo Spiga","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01686300571492455,"gpt":0.2435795193572941,"spread":0.2267165136423696,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002008954,0.0002462252,0.0002990053,0.00008450177,0.0003498409,0.0001155702,0.0004813017,0.00006836878,0.00003265098],"category_scores_gemma":[0.0001417222,0.0001207179,0.0002053084,0.0001372327,0.00007933282,0.00008998341,0.00001399874,0.0003806671,0.000007135929],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003321385,"about_ca_system_score_gemma":0.000008922759,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001148054,"about_ca_topic_score_gemma":0.000002383147,"domain_scores_codex":[0.9985688,0.0001817371,0.0004677541,0.0001251909,0.0003609128,0.0002956605],"domain_scores_gemma":[0.9977149,0.001428932,0.000278031,0.0004453232,0.00005912121,0.00007369796],"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.0003511914,0.0004090144,0.0000652991,0.0009882988,0.001333603,0.000004765573,0.02480337,0.02099977,0.013136,0.9194536,0.006871589,0.01158348],"study_design_scores_gemma":[0.003251747,0.004052178,0.0002294649,0.002953866,0.000652383,0.0002489304,0.05627082,0.2349231,0.08636868,0.5948156,0.01474083,0.001492362],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7020856,0.0004745623,0.2674126,0.001111946,0.001429754,0.002735751,0.0001425511,0.0002276104,0.02437963],"genre_scores_gemma":[0.9989595,0.00004039969,0.0005525667,0.00008620242,0.0001951503,0.00005946617,0.000003420663,0.00005596218,0.00004732074],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.324638,"threshold_uncertainty_score":0.4922733,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2611857909","doi":"10.1137/16m1086819","title":"A Primal-Dual Approximation Algorithm for Min-Sum Single-Machine Scheduling Problems","year":2017,"lang":"en","type":"article","venue":"SIAM Journal on Discrete Mathematics","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":18,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Fondo Nacional de Desarrollo Científico y Tecnológico; National Science Foundation","keywords":"Knapsack problem; Mathematics; Approximation algorithm; Combinatorics; Polynomial-time approximation scheme; Scheduling (production processes); Algorithm; Time complexity; Cover (algebra); Discrete mathematics; Job shop scheduling; Schedule; Mathematical optimization; Computer science","authors":[{"name":"Maurice Cheung","is_ca":false},{"name":"Julián Mestre","is_ca":false},{"name":"David B. Shmoys","is_ca":false},{"name":"José Verschae","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02842515982407755,"gpt":0.263090745202883,"spread":0.2346655853788054,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006348896,0.0003116336,0.0003758343,0.000149874,0.0006595043,0.0007941813,0.0003767295,0.0001431335,0.00003621381],"category_scores_gemma":[0.0003342428,0.000264345,0.0001914293,0.0000726794,0.00005975957,0.0003996173,0.00004177162,0.0004083925,0.00002995148],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001130348,"about_ca_system_score_gemma":0.00002991371,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":6.152235e-7,"about_ca_topic_score_gemma":0.000001032074,"domain_scores_codex":[0.9983501,0.00002014332,0.0006287201,0.0001942494,0.0004017821,0.0004050086],"domain_scores_gemma":[0.9986291,0.000117068,0.0004275158,0.0004580227,0.0001758389,0.0001924746],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00004353691,0.0007320404,0.0000459123,0.001605907,0.00067561,0.00004275875,0.004917752,0.7769971,0.002984365,0.00616685,0.0005189555,0.2052692],"study_design_scores_gemma":[0.001084642,0.0001648614,0.000009744907,0.0004385072,0.00006310795,0.0001222736,0.0002243241,0.9909512,0.002492642,0.003693726,0.0004146198,0.0003402994],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.005699877,0.000243428,0.9895967,0.000299517,0.0008013931,0.0004617523,0.00004100137,0.0002204899,0.002635851],"genre_scores_gemma":[0.04629768,0.00007310583,0.9525666,0.00003739999,0.0005311093,0.00004008634,0.00003141492,0.0001169232,0.0003056388],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.2139541,"threshold_uncertainty_score":0.9999809,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2039117743","doi":"10.1137/s0895480103437651","title":"Alternative Digit Sets for Nonadjacent Representations","year":2005,"lang":"en","type":"article","venue":"SIAM Journal on Discrete Mathematics","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Integer (computer science); Mathematics; Set (abstract data type); Representation (politics); Combinatorics; Discrete mathematics; Numerical digit; Arithmetic; Computer science","authors":[{"name":"James A. Muir","is_ca":false},{"name":"Douglas R. Stinson","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02785605016917992,"gpt":0.3162148602328879,"spread":0.288358810063708,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002838716,0.0001602214,0.0001926214,0.0001844633,0.0002985039,0.0003841442,0.0006917448,0.00004134194,0.00002641822],"category_scores_gemma":[0.0001145455,0.0001180468,0.0002419715,0.0002329076,0.00004917978,0.0004436235,0.00008917747,0.0002136446,0.00004730156],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005016903,"about_ca_system_score_gemma":0.00004623879,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001128462,"about_ca_topic_score_gemma":0.00000372765,"domain_scores_codex":[0.9986283,0.00003708856,0.000401821,0.0002157864,0.0004164917,0.0003005168],"domain_scores_gemma":[0.9986921,0.0003394795,0.0002608619,0.0004014871,0.0001297595,0.0001763375],"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.00002741455,0.0007419481,0.00008986601,0.00009102232,0.0002784404,0.00005494604,0.007611201,0.008287209,0.000255023,0.9020476,0.007704546,0.07281078],"study_design_scores_gemma":[0.00207586,0.0006144243,0.0004920856,0.0003705637,0.00006930759,0.0006063614,0.0005710074,0.2722523,0.008877366,0.6888581,0.02456506,0.000647573],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0120207,0.0001111769,0.9749231,0.005517454,0.0003597387,0.0003376518,0.00001571232,0.00006640935,0.006648037],"genre_scores_gemma":[0.4701073,0.000146428,0.5281843,0.0005803985,0.0003857332,0.00003581896,0.000003987055,0.00002817676,0.0005278316],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.4580866,"threshold_uncertainty_score":0.4813807,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1974452921","doi":"10.1137/120891265","title":"Lower Bounds for the Isoperimetric Numbers of Random Regular Graphs","year":2014,"lang":"en","type":"article","venue":"SIAM Journal on Discrete Mathematics","topic":"Graph theory and applications","field":"Mathematics","cited_by":14,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"","keywords":"Isoperimetric inequality; Combinatorics; Mathematics; Upper and lower bounds; Vertex (graph theory); Graph; Discrete mathematics; Mathematical analysis","authors":[{"name":"Brett Kolesnik","is_ca":true},{"name":"Nick Wormald","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0264843269633047,"gpt":0.3057508159746372,"spread":0.2792664890113325,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002521566,0.0002389968,0.0004876429,0.0001926973,0.0004658702,0.0001011241,0.0005936031,0.00009506623,0.0001082594],"category_scores_gemma":[0.001431139,0.0001404511,0.0005665942,0.000484313,0.0002247054,0.00008897207,0.0000394675,0.0002985282,0.00001571022],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000217916,"about_ca_system_score_gemma":0.00002909104,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":7.421162e-7,"about_ca_topic_score_gemma":0.000001122739,"domain_scores_codex":[0.998205,0.0001235511,0.0007688411,0.0001634632,0.0004360495,0.0003030614],"domain_scores_gemma":[0.9945156,0.003776483,0.0006842064,0.0007148694,0.0001917216,0.0001171222],"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.0001087402,0.0002438123,0.000009960366,0.0001534005,0.0001704137,5.862956e-7,0.000560912,0.00003639281,0.000491201,0.9938427,0.003709882,0.0006720526],"study_design_scores_gemma":[0.001511963,0.0002584586,0.0000137707,0.0001597724,0.000259002,0.00005124406,0.0005402646,0.001875939,0.0022228,0.9843636,0.008559395,0.0001837591],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2956342,0.0005051412,0.6720088,0.002362505,0.0008662478,0.002292417,0.00006646607,0.0001314938,0.0261328],"genre_scores_gemma":[0.9600061,0.00008026252,0.03836617,0.0001425275,0.0001548674,0.00007686936,0.000002438825,0.00007134148,0.00109941],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6643719,"threshold_uncertainty_score":0.5727429,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2131975287","doi":"10.1137/100795425","title":"Nested Recurrence Relations with Conolly-like Solutions","year":2012,"lang":"en","type":"article","venue":"SIAM Journal on Discrete Mathematics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"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":"Combinatorics; Mathematics; Fibonacci number; Sequence (biology); BETA (programming language); Integer (computer science); Discrete mathematics","authors":[{"name":"Alejandro Erickson","is_ca":false},{"name":"Abraham Isgur","is_ca":false},{"name":"Bradley W. Jackson","is_ca":false},{"name":"Frank Ruskey","is_ca":false},{"name":"Stephen M. Tanny","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02611174129951032,"gpt":0.2522767201504192,"spread":0.2261649788509089,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007716177,0.0001877279,0.0002101849,0.000136643,0.0004668251,0.000263393,0.0006431373,0.00006045244,0.0000770176],"category_scores_gemma":[0.0000922152,0.000128065,0.00009106779,0.0003851196,0.00008082365,0.001011868,0.0001149098,0.0003879073,0.0002867439],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000691883,"about_ca_system_score_gemma":0.00008196236,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":8.818092e-7,"about_ca_topic_score_gemma":0.000001080456,"domain_scores_codex":[0.9984948,0.0000900577,0.0003691396,0.0001539018,0.0003969811,0.000495132],"domain_scores_gemma":[0.9985055,0.0002790305,0.0003185653,0.0005348143,0.00009057969,0.0002714487],"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.000007413541,0.0003111332,0.0004543978,0.00002612952,0.00006459183,0.00001881189,0.003951367,0.0002432831,0.0001133361,0.9869866,0.004446702,0.003376192],"study_design_scores_gemma":[0.005092244,0.002476773,0.01564725,0.004388787,0.0004577896,0.01365234,0.006512925,0.2962405,0.001539738,0.5804958,0.06938514,0.004110726],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03014995,0.0004289828,0.9549375,0.001803193,0.0007246377,0.0001917127,0.000007255854,0.0001965276,0.01156026],"genre_scores_gemma":[0.8627269,0.00003971854,0.135995,0.0002889937,0.0001682124,0.00001077283,0.000002747813,0.00002317086,0.0007444345],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.832577,"threshold_uncertainty_score":0.5222341,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2600683609","doi":"10.1137/16m1057486","title":"Toward a 6/5 Bound for the Minimum Cost 2-Edge Connected Spanning Subgraph","year":2017,"lang":"en","type":"article","venue":"SIAM Journal on Discrete Mathematics","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"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":"Combinatorics; Mathematics; Minimum degree spanning tree; Vertex connectivity; Enhanced Data Rates for GSM Evolution; Induced subgraph isomorphism problem; Upper and lower bounds; Spanning tree; Subgraph isomorphism problem; Connected dominating set; Discrete mathematics; Graph; Computer science; Line graph; Vertex (graph theory); Voltage graph; Artificial intelligence","authors":[{"name":"Sylvia Boyd","is_ca":false},{"name":"Philippe Legault","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.08980382657351924,"gpt":0.325023209135156,"spread":0.2352193825616367,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.001080658,0.000256105,0.0003392781,0.0001242471,0.002511065,0.00256768,0.003053438,0.00007458877,0.00002436882],"category_scores_gemma":[0.0006975729,0.0001637998,0.0003630291,0.0001433872,0.0002866808,0.0005043403,0.0003566878,0.0004576413,0.00002164479],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003955065,"about_ca_system_score_gemma":0.00008701995,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003708534,"about_ca_topic_score_gemma":0.000006360838,"domain_scores_codex":[0.998222,0.00005027654,0.0004741376,0.0002711,0.0004881467,0.0004943753],"domain_scores_gemma":[0.9967091,0.0009750159,0.0006808779,0.001251356,0.0001993781,0.0001842464],"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.00005678762,0.0002608185,0.0001301093,0.0001800014,0.0003593282,0.0001144059,0.007361574,0.0001133865,0.0002132493,0.9524121,0.007646826,0.03115138],"study_design_scores_gemma":[0.002053755,0.0005605842,0.001653947,0.0006387714,0.0001074893,0.0006915574,0.001080611,0.3559344,0.0009232662,0.6128197,0.02284969,0.0006862307],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01228714,0.0002925707,0.9735327,0.008279321,0.001719523,0.0006421836,0.00002161723,0.00009027169,0.003134717],"genre_scores_gemma":[0.8497682,0.0001713917,0.1478956,0.0006615801,0.0007156909,0.00007068266,0.000002770004,0.00005130994,0.0006627018],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8374811,"threshold_uncertainty_score":0.9987875,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1999315130","doi":"10.1137/080716931","title":"Paths with No Small Angles","year":2009,"lang":"en","type":"article","venue":"SIAM Journal on Discrete Mathematics","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":false,"about_ca":true},"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Vertex (graph theory); Conjecture; Travelling salesman problem; Path (computing); Constant (computer programming); Plane (geometry); Set (abstract data type); Discrete mathematics; Geometry; Algorithm; Graph; Computer science","authors":[{"name":"Imre Bárány","is_ca":false},{"name":"Attila Pór","is_ca":false},{"name":"Pável Valtr","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01561867068542233,"gpt":0.2381191567294982,"spread":0.2225004860440759,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003096561,0.0001477509,0.0001594392,0.0001326171,0.0001832415,0.0003414087,0.0004216643,0.00003597527,0.00002171574],"category_scores_gemma":[0.00006192135,0.00009953613,0.00007171081,0.0002845359,0.00001600113,0.0002766856,0.00002866867,0.0001966622,0.0001036018],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003302573,"about_ca_system_score_gemma":0.00007010878,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":1.607997e-7,"about_ca_topic_score_gemma":5.805516e-7,"domain_scores_codex":[0.9989257,0.0000379193,0.0002686901,0.0001628316,0.0003994316,0.0002054395],"domain_scores_gemma":[0.9991477,0.00008749208,0.0001936648,0.0002598722,0.0001756557,0.0001356277],"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.00006772522,0.0008140695,0.00005068987,0.00007133088,0.00009871404,0.0003479006,0.002911163,0.01822234,0.00224691,0.8460146,0.004586905,0.1245676],"study_design_scores_gemma":[0.002876743,0.007399766,0.003803334,0.001000172,0.00007634787,0.003512421,0.0002859851,0.4432105,0.006916881,0.5059198,0.02345284,0.001545263],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.03660376,0.0000805484,0.9481831,0.001575524,0.0002175707,0.0001102291,0.000001400377,0.00007230979,0.0131556],"genre_scores_gemma":[0.4828719,0.00003429873,0.5146014,0.001061831,0.0003468512,0.000002461016,0.000003501583,0.00001160653,0.001066112],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.4462682,"threshold_uncertainty_score":0.4058966,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2569664619","doi":"10.1137/15m100866x","title":"Lower Bounds on the Probability of a Finite Union of Events","year":2016,"lang":"en","type":"article","venue":"SIAM Journal on Discrete Mathematics","topic":"Risk and Portfolio Optimization","field":"Decision Sciences","cited_by":8,"is_retracted":false,"has_abstract":true,"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":"Mathematics; Combinatorics; Upper and lower bounds; Event (particle physics); Discrete mathematics; Pairwise comparison; Finite set; Class (philosophy); Statistics; Mathematical analysis","authors":[{"name":"Jun Yang","is_ca":false},{"name":"Fady Alajaji","is_ca":false},{"name":"Glen Takahara","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.07988994126648957,"gpt":0.3476467137898471,"spread":0.2677567725233576,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005105176,0.0001324028,0.0003160716,0.000167298,0.0001091617,0.00005111276,0.0006002738,0.00006370448,0.0004082434],"category_scores_gemma":[0.004752088,0.00005056275,0.0002235507,0.0003996752,0.000147304,0.0001725319,0.00005486572,0.0001396129,0.00006561067],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003277687,"about_ca_system_score_gemma":0.00007665793,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":8.106862e-7,"about_ca_topic_score_gemma":0.000001909221,"domain_scores_codex":[0.9967749,0.0003336745,0.001077241,0.0001546204,0.00149785,0.0001617552],"domain_scores_gemma":[0.9950798,0.002535401,0.001228382,0.0006598331,0.0004167194,0.00007986704],"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.002037087,0.006141834,0.03776876,0.0002278527,0.000610591,0.00004182952,0.01911307,0.02618741,0.005842379,0.7178348,0.02775451,0.1564398],"study_design_scores_gemma":[0.0006864398,0.001009758,0.004020186,0.0007196613,0.00003324285,0.00002124009,0.0005165722,0.003011656,0.003349239,0.9830708,0.003387036,0.0001741607],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9189737,0.00002642964,0.06532007,0.003372655,0.0004281093,0.0003212013,0.00003774785,0.000009715045,0.0115104],"genre_scores_gemma":[0.9958283,0.0001589484,0.002543058,0.00005080297,0.00004354024,0.000002547256,4.031092e-7,0.00001112632,0.001361313],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.265236,"threshold_uncertainty_score":0.5689037,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3198462604","doi":"10.1137/21m1443352","title":"Complexity Dichotomy for List-5-Coloring with a Forbidden Induced Subgraph","year":2022,"lang":"en","type":"article","venue":"SIAM Journal on Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Disjoint sets; Induced subgraph; Discrete mathematics; Complete coloring; Integer (computer science); Graph; Time complexity; Fractional coloring; List coloring; Graph power; Computer science; Line graph","authors":[{"name":"Sepehr Hajebi","is_ca":true},{"name":"Yanjia Li","is_ca":true},{"name":"Sophie Spirkl","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0753537972018547,"gpt":0.3294979614260338,"spread":0.2541441642241791,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00154318,0.0002474395,0.0003636756,0.0003727174,0.001170323,0.000342207,0.001785521,0.00003473675,0.00006947576],"category_scores_gemma":[0.0001386142,0.0001894766,0.0002043526,0.0007883692,0.000110413,0.0004625977,0.0004853082,0.0008452961,0.000006629163],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001804405,"about_ca_system_score_gemma":0.0001344455,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001934614,"about_ca_topic_score_gemma":0.000005019834,"domain_scores_codex":[0.997339,0.0001723266,0.0004497638,0.0003457381,0.001068499,0.0006246634],"domain_scores_gemma":[0.997987,0.0005142083,0.0003943899,0.0006819983,0.0001653293,0.0002570628],"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.0002539041,0.0003212398,0.000174912,0.0001164884,0.0001434176,0.0001357313,0.002906248,0.0006545068,0.001311262,0.9916883,0.0003129489,0.001981008],"study_design_scores_gemma":[0.002070336,0.002949936,0.0002002289,0.0001306269,0.000027321,0.0008910429,0.001325648,0.03567136,0.00180402,0.9511293,0.003262358,0.0005377845],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2776859,0.00005179115,0.7166793,0.001246664,0.0002844928,0.001078065,0.00002958017,0.0001512406,0.002792985],"genre_scores_gemma":[0.8253295,0.000006799481,0.1737555,0.0002119035,0.00008522441,0.0002498886,0.000003437653,0.00005109076,0.0003066671],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5476435,"threshold_uncertainty_score":0.9001296,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1975406723","doi":"10.1137/070687988","title":"Edge-Face Total Chromatic Number of Halin Graphs","year":2009,"lang":"en","type":"article","venue":"SIAM Journal on Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Mathematics; Combinatorics; Chromatic scale; Vertex (graph theory); Discrete mathematics; Face (sociological concept); Enhanced Data Rates for GSM Evolution; Graph; Computer science; Artificial intelligence","authors":[{"name":"Wai Hong Chan","is_ca":false},{"name":"Peter Che Bor Lam","is_ca":false},{"name":"Wai Chee Shiu","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01865966902696562,"gpt":0.3178651783919686,"spread":0.299205509365003,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000958407,0.0002497438,0.0004402129,0.0002298736,0.0001758505,0.0001861596,0.001265049,0.00007786487,0.0001070463],"category_scores_gemma":[0.0002517788,0.0001891136,0.0002744056,0.0006710815,0.0001256355,0.0005337907,0.0001284205,0.0005169581,0.0001466911],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000532097,"about_ca_system_score_gemma":0.00007151784,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":3.036821e-7,"about_ca_topic_score_gemma":1.524699e-7,"domain_scores_codex":[0.9974391,0.0001472497,0.0007219904,0.0002448406,0.0009612734,0.0004855754],"domain_scores_gemma":[0.9980137,0.0003013242,0.0004676766,0.0007965766,0.0001611818,0.000259522],"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.00002639028,0.0004404839,0.00005533973,0.0001169275,0.00007210117,0.0001114888,0.002556999,0.0005822236,0.002756175,0.9841549,0.0005461089,0.00858084],"study_design_scores_gemma":[0.0005799631,0.0004876833,0.0004049945,0.0003936764,0.00001505027,0.001147279,0.0002707622,0.01803291,0.005185787,0.9731222,0.00007103425,0.0002886855],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3032302,0.0001928459,0.6772235,0.001378736,0.0002976498,0.0003508919,0.000006692075,0.0001216092,0.01719789],"genre_scores_gemma":[0.8419498,0.00004821036,0.1572005,0.0001143531,0.00005368222,0.000003086391,7.501743e-7,0.00002121142,0.0006084342],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5387196,"threshold_uncertainty_score":0.7711828,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2238259313","doi":"10.1137/15m1007185","title":"Lehman's Theorem and the Directed Steiner Tree Problem","year":2016,"lang":"en","type":"article","venue":"SIAM Journal on Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Steiner tree problem; Mathematics; Combinatorics; Discrete mathematics; Tree (set theory); Mathematical economics","authors":[{"name":"Ahmad Abdi","is_ca":true},{"name":"Andreas Emil Feldmann","is_ca":false},{"name":"Bertrand Guenin","is_ca":true},{"name":"Jochen Könemann","is_ca":true},{"name":"Laura Sanità","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01524831230176371,"gpt":0.2699891274693736,"spread":0.2547408151676099,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001965198,0.0002161418,0.0003015973,0.0001456438,0.0003281712,0.0003191147,0.001195262,0.00005077083,0.00003339082],"category_scores_gemma":[0.0004136178,0.00008457346,0.0001323685,0.0003101129,0.0004746686,0.0004670719,0.0003202737,0.0003383568,0.00005180055],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004227117,"about_ca_system_score_gemma":0.00004169067,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":3.817404e-7,"about_ca_topic_score_gemma":0.000001794713,"domain_scores_codex":[0.9978983,0.0003535971,0.0004135304,0.0002516278,0.0006540759,0.0004289148],"domain_scores_gemma":[0.9973164,0.001400998,0.0002697895,0.0006917842,0.0001351959,0.0001857898],"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.00006773831,0.0000394298,0.00001929799,0.00001928741,0.00004644471,0.00002422883,0.0009515594,0.000005068203,0.0006090292,0.9662477,0.0002963266,0.03167389],"study_design_scores_gemma":[0.001947865,0.0001784157,0.00008229809,0.0002727593,0.00001226771,0.0003072372,0.000111555,0.00416357,0.0009252955,0.9904644,0.001348359,0.0001859606],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01973804,0.0004768776,0.9272359,0.01732344,0.0002129739,0.0007124969,0.000006066924,0.000266795,0.03402739],"genre_scores_gemma":[0.8509816,0.0005967609,0.1404695,0.0003881459,0.0002180857,0.00004666594,3.656172e-7,0.000069542,0.007229353],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8312435,"threshold_uncertainty_score":0.3448806,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2903461617","doi":"10.1137/18m1229420","title":"Counterexamples to a Conjecture of Harris on Hall Ratio","year":2022,"lang":"en","type":"article","venue":"SIAM Journal on Discrete Mathematics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":5,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada; European Commission; National Security Agency; Centre de Recherches Mathématiques; Simons Foundation; National Science Foundation","keywords":"Counterexample; Conjecture; Mathematics; Combinatorics; Discrete mathematics","authors":[{"name":"Adam Blumenthal","is_ca":false},{"name":"Bernard Lidický","is_ca":false},{"name":"Ryan R. Martin","is_ca":false},{"name":"Sergey Norin","is_ca":true},{"name":"Florian Pfender","is_ca":false},{"name":"Jan Volec","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03824283640347566,"gpt":0.3103611491623025,"spread":0.2721183127588268,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.001079512,0.0003134885,0.0005890366,0.0002991422,0.0006596966,0.00007581028,0.0006668518,0.0000706772,0.001432199],"category_scores_gemma":[0.0005993051,0.0002266814,0.0003080413,0.0002512488,0.00007840686,0.00006112303,0.0002459388,0.0007645767,0.00001155282],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001263814,"about_ca_system_score_gemma":0.00006237037,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000170935,"about_ca_topic_score_gemma":0.000002600262,"domain_scores_codex":[0.997356,0.0002228982,0.0008131983,0.0002304016,0.001032204,0.0003453133],"domain_scores_gemma":[0.9975823,0.0008812798,0.0006298862,0.0006144053,0.000103317,0.0001888042],"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.0001903559,0.0002715915,0.00003474249,0.0001906331,0.0001929333,0.00005309053,0.01019317,0.0009333635,0.0004675516,0.9746895,0.01232589,0.00045711],"study_design_scores_gemma":[0.0008289428,0.001569499,0.00006748175,0.0002745275,0.0000995247,0.0004137626,0.003284055,0.0004579041,0.00207067,0.9813035,0.009248435,0.0003817188],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9578785,0.0001273842,0.01288122,0.001556648,0.001219682,0.0009493126,0.0003594702,0.00009882305,0.02492902],"genre_scores_gemma":[0.9833841,0.00001441752,0.01457626,0.0008518068,0.0001665366,0.00002745002,0.000004571932,0.00007559871,0.0008993196],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.0255056,"threshold_uncertainty_score":0.9994806,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2964048937","doi":"10.1137/18m1174544","title":"An Optimization Parameter for Seriation of Noisy Data","year":2019,"lang":"kn","type":"article","venue":"SIAM Journal on Discrete Mathematics","topic":"Graph theory and applications","field":"Mathematics","cited_by":5,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Dalhousie University","funders":"Natural Sciences and Engineering Research Council of Canada; University of Delaware Research Foundation","keywords":"Mathematics; Similarity (geometry); Matrix (chemical analysis); Identity matrix; Combinatorics; Diagonal; Square matrix; Matrix similarity; Matrix norm; Row; Row and column spaces; Seriation (archaeology); Symmetric matrix; Artificial intelligence; Computer science; Mathematical analysis; Eigenvalues and eigenvectors","authors":[{"name":"Mahya Ghandehari","is_ca":false},{"name":"Jeannette Janssen","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.05583733570121908,"gpt":0.3495324354803124,"spread":0.2936950997790934,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002213652,0.0004017701,0.0007566322,0.0002351788,0.0002420119,0.0002512108,0.001301966,0.0002280441,0.000752034],"category_scores_gemma":[0.0007611204,0.0003416751,0.0002719586,0.0003074916,0.00009077892,0.0007582168,0.0001228423,0.000400829,0.00008455885],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005833854,"about_ca_system_score_gemma":0.0001162203,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":9.771787e-7,"about_ca_topic_score_gemma":0.000002158904,"domain_scores_codex":[0.9968986,0.0002063297,0.001479427,0.0004439795,0.000565566,0.000406093],"domain_scores_gemma":[0.9937794,0.001417137,0.0019408,0.002262479,0.0003876172,0.0002126305],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0003144938,0.002273649,0.0001715559,0.002610974,0.0005329992,0.000001996428,0.003664268,0.03368519,0.004059231,0.9507877,0.001073541,0.0008244584],"study_design_scores_gemma":[0.001272272,0.0009126308,0.00002385922,0.0007573431,0.0005162252,0.00005581332,0.001642918,0.509276,0.001556254,0.4831164,0.0004651228,0.000405132],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3625114,0.00009427056,0.630455,0.0005683122,0.0006361078,0.002422773,0.001209796,0.00005862712,0.002043654],"genre_scores_gemma":[0.6016599,0.0001348142,0.3968196,0.0000943281,0.0002621945,0.00003189312,0.0003707205,0.0001322421,0.0004943028],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.4755908,"threshold_uncertainty_score":0.9999035,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2001034532","doi":"10.1137/s0895480101384402","title":"Lower Bounds from Tile Covers for the Channel Assignment Problem","year":2005,"lang":"en","type":"article","venue":"SIAM Journal on Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Dalhousie University","funders":"","keywords":"Cover (algebra); Mathematics; Reduction (mathematics); Clique; Channel (broadcasting); Constraint (computer-aided design); Tile; Upper and lower bounds; Combinatorics; Enumeration; Mathematical optimization; Assignment problem; Discrete mathematics; Computer science; Computer network","authors":[{"name":"Jeannette Janssen","is_ca":true},{"name":"T. E. Wentzell","is_ca":true},{"name":"Shannon L. Fitzpatrick","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01180277747908987,"gpt":0.2196632457915288,"spread":0.207860468312439,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004878758,0.00020318,0.0002279361,0.00004835302,0.0002258645,0.0001805661,0.0002841575,0.00007312617,0.0001638177],"category_scores_gemma":[0.00002190579,0.0001265946,0.000206307,0.00007073133,0.00003528378,0.0001294392,0.00001632976,0.0002620917,0.00008922716],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009559267,"about_ca_system_score_gemma":0.00001315247,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":6.621501e-7,"about_ca_topic_score_gemma":0.000002733094,"domain_scores_codex":[0.998891,0.00002530351,0.000396075,0.0001011254,0.000290902,0.0002956014],"domain_scores_gemma":[0.9991848,0.0002935739,0.0001233259,0.000261786,0.00003048494,0.0001059646],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000333446,0.0007769663,0.00002472005,0.0007762656,0.002888775,0.00004800479,0.02108455,0.6997849,0.01259144,0.125415,0.1246604,0.01161552],"study_design_scores_gemma":[0.003523998,0.0008052998,0.00006552682,0.001555951,0.0004693636,0.0002112858,0.006771219,0.4596868,0.0119219,0.2529259,0.2607005,0.001362292],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3273225,0.003725106,0.5896918,0.003794908,0.006657026,0.003434835,0.0005006079,0.0007104584,0.06416271],"genre_scores_gemma":[0.9959467,0.00008305152,0.002330504,0.0001177572,0.0006163616,0.00005698931,0.000004560397,0.0000594254,0.0007846686],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6686242,"threshold_uncertainty_score":0.5162377,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2061027724","doi":"10.1137/s0895480103428053","title":"Counting Strings with Given Elementary Symmetric Function Evaluations II: Circular Strings","year":2004,"lang":"en","type":"article","venue":"SIAM Journal on Discrete Mathematics","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Victoria","funders":"","keywords":"Combinatorics; Mathematics; Aperiodic graph; Alphabet; Finite field; Ring (chemistry); Physics","authors":[{"name":"C. Robert Miers","is_ca":true},{"name":"Frank Ruskey","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01631480771133677,"gpt":0.2511368983542985,"spread":0.2348220906429618,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00124702,0.0002297971,0.0002322073,0.0005082602,0.0008111668,0.0004114774,0.0006431552,0.00005204575,0.00004690635],"category_scores_gemma":[0.00008084383,0.0001794148,0.0001640713,0.001193576,0.00005260348,0.0006959268,0.000135815,0.0004317443,0.00002569647],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001597461,"about_ca_system_score_gemma":0.0001154696,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003613948,"about_ca_topic_score_gemma":0.000001622097,"domain_scores_codex":[0.9979375,0.00006186565,0.0004524438,0.0002730418,0.0009093012,0.0003658197],"domain_scores_gemma":[0.9986773,0.0001229388,0.0004309662,0.0004351989,0.0001792357,0.0001543493],"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.00005480823,0.0005531255,0.0004701767,0.0001718482,0.0004094014,0.00007393663,0.003498856,0.01088308,0.0007570999,0.9697573,0.0002176537,0.01315272],"study_design_scores_gemma":[0.003862437,0.004353733,0.001946286,0.001446719,0.0004049047,0.0008399149,0.001891146,0.01508834,0.002049115,0.9633928,0.003711215,0.001013419],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2257147,0.0001197658,0.7699682,0.0009451255,0.0002111997,0.0002250604,0.000003208839,0.0001213019,0.002691441],"genre_scores_gemma":[0.9464123,0.0000419384,0.05305882,0.0002961748,0.0001184025,0.000009785254,0.000003198952,0.00002325936,0.00003616168],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7206976,"threshold_uncertainty_score":0.7316324,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2568997022","doi":"10.1137/120885498","title":"Phase Transition for Glauber Dynamics for Independent Sets on Regular Trees","year":2014,"lang":"en","type":"article","venue":"SIAM Journal on Discrete Mathematics","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":5,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"National Science Foundation","keywords":"Glauber; Omega; Combinatorics; Mathematics; Lambda; Vertex (graph theory); Inverse; Boundary (topology); Tree (set theory); Spectral gap; Markov chain; Discrete mathematics; Physics; Mathematical analysis; Geometry; Graph; Scattering; Quantum mechanics; Statistics","authors":[{"name":"Ricardo Restrepo","is_ca":false},{"name":"Daniel Štefankovič","is_ca":false},{"name":"Juan C. Vera","is_ca":true},{"name":"Eric Vigoda","is_ca":false},{"name":"Linji Yang","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04782450638894484,"gpt":0.3731392362918386,"spread":0.3253147299028938,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.003018995,0.0004270066,0.000727803,0.0002159182,0.0003389262,0.000165789,0.0003288016,0.000234236,0.00002277455],"category_scores_gemma":[0.001323412,0.0003256005,0.0006441112,0.0001009753,0.0000547091,0.000124991,0.00002255279,0.0003777717,6.079913e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002083136,"about_ca_system_score_gemma":0.00004437287,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":4.655737e-7,"about_ca_topic_score_gemma":0.0000193013,"domain_scores_codex":[0.997449,0.0001933449,0.0009104993,0.0003311596,0.0005949667,0.0005210192],"domain_scores_gemma":[0.9964278,0.001890941,0.000608141,0.0005567464,0.0002480844,0.0002683389],"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.001419009,0.003101454,0.000002332223,0.00232575,0.0004490908,0.0000189252,0.003895585,0.0005268186,0.001100661,0.9333127,0.01053545,0.04331222],"study_design_scores_gemma":[0.009624915,0.004674171,0.000001543417,0.0009069272,0.0004149563,0.0001524701,0.001330744,0.3823135,0.002270479,0.588555,0.009100411,0.0006548325],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.08331561,0.00002823305,0.908995,0.001415215,0.0004934685,0.00132286,0.0002242072,0.00007502576,0.004130355],"genre_scores_gemma":[0.3418782,0.00005926775,0.652512,0.0008226322,0.001112953,0.0003242265,0.0001284119,0.000341705,0.002820602],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.3817867,"threshold_uncertainty_score":0.9999196,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4394576567","doi":"10.1137/23m1566881","title":"The Rainbow Saturation Number Is Linear","year":2024,"lang":"en","type":"article","venue":"SIAM Journal on Discrete Mathematics","topic":"Graph theory and applications","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada; Royal Society; Pacific Institute for the Mathematical Sciences","keywords":"Mathematics; Rainbow; Combinatorics; Saturation (graph theory); Discrete mathematics; Physics","authors":[{"name":"Natalie Behague","is_ca":false},{"name":"Tom Johnston","is_ca":false},{"name":"Shoham Letzter","is_ca":false},{"name":"Natasha Morrison","is_ca":true},{"name":"Shannon N. Ogden","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03317991022247071,"gpt":0.3507728544403557,"spread":0.317592944217885,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001214078,0.0002214152,0.0002074415,0.00006432582,0.0007159727,0.000517189,0.0003590015,0.00009449747,0.0003844431],"category_scores_gemma":[0.000340202,0.0001251652,0.0002846349,0.0003087697,0.0001114342,0.0001650471,0.00004115251,0.0006355548,0.0007749835],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005013634,"about_ca_system_score_gemma":0.00005419045,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":2.389606e-7,"about_ca_topic_score_gemma":0.000001001935,"domain_scores_codex":[0.9984124,0.00009144927,0.0005683888,0.000177269,0.0004562059,0.0002942564],"domain_scores_gemma":[0.9976591,0.00146446,0.000195516,0.0004650206,0.00009362125,0.0001222117],"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.000009467459,0.0000555572,0.000002960332,0.00009974767,0.00009737281,0.0000120453,0.001874756,0.000003778305,0.000165106,0.9664069,0.02974525,0.001527004],"study_design_scores_gemma":[0.0001157344,0.00003814666,0.000005329624,0.0002920278,0.00007732637,0.000288219,0.0006702445,0.003627373,0.0008625033,0.9254178,0.06844424,0.0001610011],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.4885957,0.002573573,0.1546753,0.0807748,0.005394357,0.003504084,0.0002519611,0.001864842,0.2623654],"genre_scores_gemma":[0.9295179,0.0006630808,0.04366853,0.0007230398,0.001326138,0.00008627254,0.000008921921,0.0001809509,0.02382513],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4409222,"threshold_uncertainty_score":0.9961104,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4401922998","doi":"10.1137/23m1561105","title":"Cliques, Chromatic Number, and Independent Sets in the Semi-random Process","year":2024,"lang":"en","type":"article","venue":"SIAM Journal on Discrete Mathematics","topic":"Stochastic processes and statistical mechanics","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Toronto Metropolitan University","funders":"Austrian Science Fund","keywords":"Mathematics; Chromatic scale; Combinatorics; Discrete mathematics; Random graph; Graph","authors":[{"name":"David Gamarnik","is_ca":false},{"name":"Mihyun Kang","is_ca":false},{"name":"Paweł Prałat","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03010766748283094,"gpt":0.3597117220717129,"spread":0.3296040545888819,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001803236,0.0003340589,0.0005091341,0.0001277199,0.0001724877,0.0005440446,0.0004143257,0.0001374797,0.0001552303],"category_scores_gemma":[0.001688744,0.0001927371,0.0001149751,0.0003386788,0.00007265602,0.000180475,0.00005827963,0.0009397707,0.00006267941],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007704473,"about_ca_system_score_gemma":0.0001177391,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001380203,"about_ca_topic_score_gemma":0.000006717089,"domain_scores_codex":[0.997433,0.0001303483,0.0008508881,0.0002756124,0.0008820946,0.00042807],"domain_scores_gemma":[0.9965127,0.002748825,0.0002119619,0.0002889667,0.0000782678,0.0001592643],"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.00006652647,0.0003593739,0.00001641084,0.004663078,0.000135126,0.0007728267,0.0139302,0.00002252808,0.00003279112,0.9750668,0.001899057,0.003035279],"study_design_scores_gemma":[0.0006605465,0.0001944391,0.00001696703,0.002265123,0.000125834,0.002277423,0.002421995,0.04828773,0.00004993165,0.9432852,0.0001617507,0.0002530147],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2761919,0.001898621,0.6997932,0.003427722,0.0008806611,0.001785227,0.00009874997,0.0002762235,0.01564766],"genre_scores_gemma":[0.9882275,0.0002316204,0.01088195,0.0002377,0.0001476067,0.00005650404,0.0000028897,0.00006920032,0.0001449806],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7120356,"threshold_uncertainty_score":0.7859589,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4400893749","doi":"10.1137/23m1587713","title":"Optimal Adjacency Labels for Subgraphs of Cartesian Products","year":2024,"lang":"en","type":"article","venue":"SIAM Journal on Discrete Mathematics","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Agence Nationale de la Recherche","keywords":"Adjacency list; Combinatorics; Mathematics; Cartesian product; Cartesian coordinate system; Discrete mathematics; Geometry","authors":[{"name":"Louis Esperet","is_ca":false},{"name":"Nathaniel Harms","is_ca":true},{"name":"Viktor Zamaraev","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02111613834027702,"gpt":0.2820577793294158,"spread":0.2609416409891388,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006119187,0.000134087,0.0001954751,0.0002572896,0.0001107099,0.00025237,0.0003709973,0.0000399555,0.00001184007],"category_scores_gemma":[0.0001397538,0.0001037532,0.0001403266,0.0005618482,0.00002580369,0.0003483332,0.00004265418,0.0001507574,0.00001335021],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002804714,"about_ca_system_score_gemma":0.0001646903,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":2.274218e-7,"about_ca_topic_score_gemma":2.453162e-7,"domain_scores_codex":[0.9987757,0.00003243715,0.0004099136,0.000209014,0.000378211,0.0001947378],"domain_scores_gemma":[0.9990866,0.0002169957,0.0001465133,0.000239345,0.0002265068,0.00008407571],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001321625,0.0001986762,0.000005878432,0.000822464,0.0001331207,0.00002984567,0.003132064,0.01046282,0.008186547,0.9543896,0.004789302,0.01783643],"study_design_scores_gemma":[0.0008149102,0.001671517,0.0001296251,0.001185535,0.0001071902,0.0006650542,0.0002522385,0.6840688,0.06587332,0.2272231,0.0173932,0.0006155219],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0310726,0.0009453941,0.9639755,0.002010257,0.0008542495,0.0002779193,0.00001349012,0.0000657571,0.0007848606],"genre_scores_gemma":[0.5705583,0.00005790504,0.428322,0.00005805863,0.0003031613,0.00001319621,0.000005777089,0.00001820484,0.0006634509],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7271665,"threshold_uncertainty_score":0.4230933,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4381382709","doi":"10.1137/22m150767x","title":"The Spectrum of Triangle-Free Graphs","year":2023,"lang":"en","type":"article","venue":"SIAM Journal on Discrete Mathematics","topic":"Graph theory and applications","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada; Grantová Agentura České Republiky; Beckman Institute for Advanced Science and Technology, University of Illinois, Urbana-Champaign; Simons Foundation; National Science Foundation","keywords":"Combinatorics; Mathematics; Discrete mathematics; Vertex (graph theory); Bipartite graph; Conjecture; Triangle-free graph; Upper and lower bounds; Graph; Line graph; Graph power","authors":[{"name":"József Balogh","is_ca":false},{"name":"Felix Christian Clemen","is_ca":false},{"name":"Bernard Lidický","is_ca":false},{"name":"Sergey Norin","is_ca":true},{"name":"Jan Volec","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04292685767823912,"gpt":0.316427439417595,"spread":0.2735005817393559,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002172014,0.0002022769,0.0003728914,0.000211653,0.000557397,0.0000978803,0.000926724,0.00007289607,0.0000808455],"category_scores_gemma":[0.001361375,0.0001200241,0.0004027225,0.0007881384,0.000195804,0.00007237653,0.0001128946,0.0003922706,0.0001150274],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002136246,"about_ca_system_score_gemma":0.00003842206,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":4.203727e-7,"about_ca_topic_score_gemma":0.000004274202,"domain_scores_codex":[0.9980161,0.0001261609,0.0008041284,0.0001371126,0.0005404355,0.000376109],"domain_scores_gemma":[0.995831,0.002375813,0.0006272225,0.0009646813,0.00007517477,0.000126164],"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.00002490811,0.00009820105,0.00001235405,0.00007120618,0.00009578114,0.000008381471,0.000642313,0.000009131792,0.0002307545,0.9848967,0.01353783,0.0003724548],"study_design_scores_gemma":[0.0005212735,0.0001248867,0.00006614394,0.0001505839,0.00006885027,0.00006666066,0.001351161,0.000282988,0.001629445,0.9928244,0.002776537,0.0001370573],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9037695,0.0003232435,0.00741309,0.01699863,0.001039452,0.001542806,0.0001598908,0.000564275,0.06818911],"genre_scores_gemma":[0.981566,0.0007319684,0.01089909,0.0001010423,0.0002793889,0.00007439949,0.000006439844,0.0001406003,0.006201043],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.07779653,"threshold_uncertainty_score":0.4894439,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2896348413","doi":"10.1137/18m1220856","title":"Higher Dimensional Lattice Walks: Connecting Combinatorial and Analytic Behavior","year":2019,"lang":"en","type":"preprint","venue":"SIAM Journal on Discrete Mathematics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":true,"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":"Mathematics; Lattice (music); Diagonal; Gravitational singularity; Combinatorics; Generating function; Enumeration; Boundary (topology); Function (biology); Rational function; Discrete mathematics; Pure mathematics; Mathematical analysis; Geometry; Physics","authors":[{"name":"Stephen Melczer","is_ca":false},{"name":"Mark C. Wilson","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04752788008209991,"gpt":0.3384440532801255,"spread":0.2909161731980256,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":["metaepi_narrow"],"category_scores_codex":[0.001897324,0.001332278,0.002366188,0.0004688063,0.0005039872,0.0006941452,0.001091082,0.0009547119,0.0003376084],"category_scores_gemma":[0.002484741,0.001127898,0.0006730639,0.0002701102,0.0001955404,0.0002950004,0.00155694,0.003876923,0.0001365711],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005532167,"about_ca_system_score_gemma":0.0002790237,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002877457,"about_ca_topic_score_gemma":0.000001237779,"domain_scores_codex":[0.9934317,0.0003323218,0.002318395,0.0009453868,0.001989373,0.0009827776],"domain_scores_gemma":[0.9904207,0.003746429,0.002992637,0.001683572,0.0005850268,0.0005716319],"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.0001478304,0.001711133,0.0001018942,0.004753561,0.0008402503,0.0004002151,0.001998099,0.0005322486,0.0001783581,0.9871245,0.001800763,0.0004111712],"study_design_scores_gemma":[0.002443191,0.0004548291,0.0000487073,0.003036187,0.001501203,0.0005247554,0.0004413275,0.004094149,0.0001914705,0.9853899,0.0005672318,0.001307025],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9469579,0.0008392142,0.01015571,0.000960162,0.02430545,0.00399895,0.0002006101,0.0006614303,0.0119206],"genre_scores_gemma":[0.8629583,0.000112846,0.1320081,0.0001762352,0.002108154,0.0001140832,0.00003785935,0.0006764237,0.001808017],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1218524,"threshold_uncertainty_score":0.9999428,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3014010934","doi":"10.1137/18m1224672","title":"Multitasking Capacity: Hardness Results and Improved Constructions","year":2020,"lang":"en","type":"article","venue":"SIAM Journal on Discrete Mathematics","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"United States - Israel Binational Science Foundation; Simons Foundation; National Science Foundation","keywords":"Combinatorics; Bipartite graph; Mathematics; Matching (statistics); Cardinality (data modeling); Upper and lower bounds; Discrete mathematics; Hardness of approximation; Complete bipartite graph; Approximation algorithm; Graph; Computer science","authors":[{"name":"Noga Alon","is_ca":false},{"name":"Jonathan D. Cohen","is_ca":false},{"name":"Thomas L. Griffiths","is_ca":false},{"name":"Pasin Manurangsi","is_ca":false},{"name":"Daniel Reichman","is_ca":false},{"name":"Igor Shinkar","is_ca":true},{"name":"Tal Wagner","is_ca":false},{"name":"Alexander Yu","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04865152016433313,"gpt":0.2558573971456671,"spread":0.2072058769813339,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003289591,0.0001717609,0.0002472527,0.00008757406,0.0003977188,0.000494639,0.0005197632,0.00005128346,0.00001017936],"category_scores_gemma":[0.0003381376,0.0001399148,0.000102964,0.000274198,0.0001381228,0.0003724005,0.0001949401,0.0004637947,0.00001379766],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002162522,"about_ca_system_score_gemma":0.00003775081,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001753726,"about_ca_topic_score_gemma":0.000001427215,"domain_scores_codex":[0.9987148,0.00005451664,0.0004386513,0.0002539625,0.0002916105,0.0002464408],"domain_scores_gemma":[0.9989157,0.0001656068,0.0002637095,0.000284603,0.00008647793,0.0002838996],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00008091947,0.0002840271,0.0000903383,0.0003779541,0.0003195949,0.0002038203,0.03334225,0.0002593671,0.003726098,0.8991221,0.002856341,0.05933724],"study_design_scores_gemma":[0.002246442,0.0005453036,0.0002158949,0.0003680182,0.00004499173,0.001445545,0.001594766,0.8379981,0.001527213,0.1469673,0.006432264,0.0006141934],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02849229,0.00008459063,0.9572183,0.009097549,0.0008454704,0.0002164223,0.00004632601,0.0001809456,0.003818057],"genre_scores_gemma":[0.462085,0.00005633622,0.536808,0.0007121191,0.0002563519,0.000003611521,0.000001400995,0.00001771054,0.00005946729],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8377388,"threshold_uncertainty_score":0.570556,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4400467622","doi":"10.1137/23m1591773","title":"Product Structure Extension of the Alon–Seymour–Thomas Theorem","year":2024,"lang":"en","type":"article","venue":"SIAM Journal on Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University; University of Ottawa","funders":"Australian Research Council; Ontario Ministry of Research and Innovation; Natural Sciences and Engineering Research Council of Canada; Narodowe Centrum Nauki; Fonds De La Recherche Scientifique - FNRS; Australian Government; National Science Foundation","keywords":"Mathematics; Extension (predicate logic); Combinatorics; Product (mathematics); Discrete mathematics; Structured program theorem; Geometry; Computer science","authors":[{"name":"Marc Distel","is_ca":false},{"name":"Vida Dujmović","is_ca":true},{"name":"David Eppstein","is_ca":false},{"name":"Robert Hickingbotham","is_ca":false},{"name":"Gwenaël Joret","is_ca":false},{"name":"Piotr Micek","is_ca":false},{"name":"Pat Morin","is_ca":true},{"name":"Michał T. Seweryn","is_ca":false},{"name":"David R. Wood","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01963596640253596,"gpt":0.3005775145388873,"spread":0.2809415481363513,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001155339,0.0002257333,0.0002781849,0.0002061195,0.0002462808,0.0003318713,0.001692295,0.00005797491,0.00004347042],"category_scores_gemma":[0.0004316356,0.0001155589,0.0002555507,0.0008254523,0.00020745,0.0004060859,0.0003967757,0.0008513127,0.00002184044],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005726919,"about_ca_system_score_gemma":0.0001343711,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":2.784601e-7,"about_ca_topic_score_gemma":6.956845e-7,"domain_scores_codex":[0.9975666,0.0002333597,0.0004859219,0.0003318926,0.001014527,0.0003677321],"domain_scores_gemma":[0.9979579,0.0003519708,0.0002296929,0.001160952,0.0001755768,0.0001238835],"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.00001384738,0.00005013721,0.00001832162,0.0002110423,0.0000595174,0.00007306161,0.001866822,0.0004518314,0.01361208,0.9750266,0.0009274192,0.007689313],"study_design_scores_gemma":[0.0001457382,0.0001468586,0.0001705905,0.0007857247,0.00001980212,0.0007671099,0.0001597716,0.01632322,0.02533098,0.9542945,0.001673083,0.0001826322],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2686339,0.00500488,0.6947739,0.01332493,0.004258403,0.001494022,0.00005658517,0.0004169981,0.01203643],"genre_scores_gemma":[0.9573935,0.00006375824,0.04121921,0.00008665307,0.000180333,0.000002846681,5.202952e-7,0.0000382641,0.001014858],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6887597,"threshold_uncertainty_score":0.4712354,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1965667139","doi":"10.1137/110847585","title":"A Local Strengthening of Reed's $\\omega$, $\\Delta$, $\\chi$ Conjecture for Quasi-line Graphs","year":2013,"lang":"en","type":"preprint","venue":"SIAM Journal on Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"Office of Naval Research; Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Omega; Conjecture; Combinatorics; Mathematics; Line (geometry); Mathematical proof; Graph; Line graph; Discrete mathematics; Physics; Geometry","authors":[{"name":"Maria Chudnovsky","is_ca":false},{"name":"Andrew D. King","is_ca":true},{"name":"Matthieu Plumettaz","is_ca":false},{"name":"Paul Seymour","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03564674079192311,"gpt":0.3243638320159371,"spread":0.288717091224014,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.002098591,0.0007621389,0.001373179,0.0008560256,0.0003062898,0.0005252218,0.00361509,0.0004858166,0.00004702473],"category_scores_gemma":[0.0006931656,0.00057722,0.0009477948,0.0005158935,0.0004164196,0.0003820999,0.001431436,0.002608674,0.00001944745],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001499011,"about_ca_system_score_gemma":0.0003698776,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005947821,"about_ca_topic_score_gemma":0.000004818319,"domain_scores_codex":[0.9948282,0.000296876,0.001750965,0.0007559119,0.001449504,0.0009185993],"domain_scores_gemma":[0.9936701,0.001282144,0.001998848,0.001844635,0.0007423197,0.0004619708],"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.0001271332,0.0005459526,0.0000153997,0.001788208,0.0005672238,0.00006161707,0.003257198,0.01878872,0.0002692158,0.958626,0.0007564579,0.01519684],"study_design_scores_gemma":[0.0008505827,0.001020526,0.000007333133,0.001567819,0.00005881505,0.0001699564,0.00043941,0.2194557,0.001580378,0.7740371,0.0002861359,0.0005262226],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0265224,0.0005583236,0.9695663,0.0007285089,0.0006444801,0.001174736,0.000132929,0.0001162938,0.0005559599],"genre_scores_gemma":[0.5267797,0.0002488111,0.472083,0.00009162361,0.0002038961,0.0001118425,0.00002636201,0.0001225749,0.0003322464],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5002573,"threshold_uncertainty_score":0.9996923,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4401922144","doi":"10.1137/23m1625342","title":"Off-Diagonal Commonality of Graphs via Entropy","year":2024,"lang":"en","type":"article","venue":"SIAM Journal on Discrete Mathematics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada; Pacific Institute for the Mathematical Sciences; University of Victoria","keywords":"Mathematics; Combinatorics; Diagonal; Discrete mathematics; Entropy (arrow of time); Chordal graph; Graph; Geometry","authors":[{"name":"Natalie Behague","is_ca":false},{"name":"Natasha Morrison","is_ca":true},{"name":"Jonathan A. Noel","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02840167449277752,"gpt":0.3151510392851999,"spread":0.2867493647924224,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00140862,0.0003530756,0.0006350965,0.0002972062,0.0002654653,0.0001349787,0.0005459236,0.0001526894,0.0006564335],"category_scores_gemma":[0.0003584996,0.0002363375,0.0006418218,0.0003191103,0.0002737995,0.0001636005,0.0001384277,0.0008089089,0.00002309448],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000623226,"about_ca_system_score_gemma":0.00006446513,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000104108,"about_ca_topic_score_gemma":0.000001310626,"domain_scores_codex":[0.9971949,0.0001812147,0.001077769,0.0002374989,0.0009132599,0.000395356],"domain_scores_gemma":[0.997326,0.001371751,0.0004132148,0.0005452807,0.0001370803,0.0002067197],"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.0000452153,0.0001737913,0.00008170506,0.000772106,0.0003629138,0.00008870496,0.002016037,0.000009556107,0.0004772506,0.9903857,0.003141678,0.002445417],"study_design_scores_gemma":[0.0003066253,0.0002180739,0.0001185946,0.00070994,0.0001737696,0.0005157326,0.0002640992,0.001841713,0.001392763,0.9917516,0.002442126,0.0002650074],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9368601,0.002949622,0.0314204,0.0009759875,0.002582308,0.0005941693,0.0001878475,0.0002869104,0.02414261],"genre_scores_gemma":[0.9793322,0.0002360764,0.01957308,0.0001080083,0.0002616121,0.00000614478,0.000004687939,0.00007901074,0.0003991674],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.04247206,"threshold_uncertainty_score":0.9637565,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4402011228","doi":"10.1137/21m1425736","title":"Rainbow Thresholds","year":2024,"lang":"en","type":"article","venue":"SIAM Journal on Discrete Mathematics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Toronto Metropolitan University","funders":"National Science Foundation","keywords":"Rainbow; Mathematics; Combinatorics; Discrete mathematics; Physics; Optics","authors":[{"name":"Tolson Bell","is_ca":false},{"name":"Alan Frieze","is_ca":false},{"name":"Trent G. Marbach","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03558605946525564,"gpt":0.3326163717282182,"spread":0.2970303122629625,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001222095,0.0003541871,0.0004317641,0.0002882818,0.0004431096,0.0004376339,0.0005049966,0.0001615798,0.0008229849],"category_scores_gemma":[0.0004591199,0.0002251432,0.0004426005,0.0002837374,0.0001394102,0.0002111678,0.0001250257,0.0009002122,0.0001151751],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000818647,"about_ca_system_score_gemma":0.00006064316,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":2.308989e-7,"about_ca_topic_score_gemma":5.444078e-7,"domain_scores_codex":[0.9977855,0.00008984846,0.0006897823,0.0002606608,0.0007153332,0.0004588534],"domain_scores_gemma":[0.9980612,0.0009311617,0.0001795624,0.0005335987,0.00007249721,0.000222012],"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.00001576783,0.00006236052,0.00001403618,0.0003951278,0.0001907551,0.0002496846,0.003207855,0.00001031589,0.0001014697,0.9767507,0.01717258,0.001829288],"study_design_scores_gemma":[0.0002282335,0.0001592041,0.00001327674,0.0007698242,0.0001044287,0.001203842,0.0004855326,0.001295412,0.0003306287,0.9800088,0.01509622,0.0003045734],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5854685,0.004190204,0.04818133,0.004207436,0.008927741,0.001122472,0.0001011505,0.001404106,0.3463971],"genre_scores_gemma":[0.9611326,0.0002235633,0.03156275,0.0003317344,0.00101615,0.00001090891,0.000002387935,0.0001540684,0.005565833],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3756641,"threshold_uncertainty_score":0.9181073,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1969856863","doi":"10.1137/120898528","title":"On the Maximum Density of Graphs with Unique-Path Labelings","year":2013,"lang":"en","type":"article","venue":"SIAM Journal on Discrete Mathematics","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Combinatorics; Mathematics; Edge-graceful labeling; Vertex (graph theory); Lemma (botany); Path graph; Path (computing); Graph labeling; Graph; Discrete mathematics; Induced path; Upper and lower bounds; Simple graph; Longest path problem; Graph power; Shortest path problem; Line graph; Computer science","authors":[{"name":"Abbas Mehrabian","is_ca":false},{"name":"Dieter Mitsche","is_ca":false},{"name":"Paweł Prałat","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01161458247781246,"gpt":0.2120082200075993,"spread":0.2003936375297868,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008423724,0.000217079,0.0002839199,0.0001539647,0.0002605485,0.0002371616,0.0008245114,0.00006083285,0.00004740983],"category_scores_gemma":[0.0001286156,0.0001066158,0.0001298407,0.0004153807,0.0001307772,0.0002108061,0.0001026164,0.0004467474,0.00008228142],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001789079,"about_ca_system_score_gemma":0.00005429432,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001144729,"about_ca_topic_score_gemma":0.000001321061,"domain_scores_codex":[0.9982343,0.0001056061,0.0004575287,0.0002051703,0.0006956763,0.0003016824],"domain_scores_gemma":[0.9979528,0.0003718333,0.0004752305,0.0007184821,0.0003241697,0.0001575502],"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.00001007494,0.0001683098,0.00008259999,0.00003892644,0.00005780497,0.00001570071,0.001074944,0.0001744266,0.001074062,0.9940097,0.002760638,0.0005327913],"study_design_scores_gemma":[0.0003419086,0.0006397748,0.0001367165,0.0005152702,0.00001919394,0.0001518308,0.0002005341,0.01064968,0.004168018,0.9829473,0.00004553275,0.0001842136],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9280582,0.00005604411,0.06374734,0.004184078,0.0001391937,0.0003393249,0.00000182158,0.00008580936,0.003388213],"genre_scores_gemma":[0.9257663,0.0000351882,0.07307968,0.0009122454,0.000006152798,0.00000786932,3.942392e-7,0.00002035263,0.000171761],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.0110624,"threshold_uncertainty_score":0.4347667,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2797568317","doi":"10.1137/18m1182255","title":"On a Generalization of Spikes","year":2019,"lang":"en","type":"article","venue":"SIAM Journal on Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Marsden Fund; National Science Foundation","keywords":"Matroid; Partition (number theory); Generalization; Matroid partitioning; Graphic matroid; Integer (computer science); Property (philosophy)","authors":[],"retraction":null,"screen_n_in":null,"score":{"opus":0.0186028006303082,"gpt":0.3010084478666883,"spread":0.2824056472363801,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005807711,0.0001262087,0.0002180405,0.0002349611,0.00006760468,0.0000968851,0.0007608791,0.00004105536,0.00008973543],"category_scores_gemma":[0.0001540286,0.00009030736,0.0001115779,0.0003353207,0.00003877597,0.0002693762,0.00009473449,0.0002396018,0.0001671296],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003773346,"about_ca_system_score_gemma":0.00003887729,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":1.964688e-7,"about_ca_topic_score_gemma":1.549031e-7,"domain_scores_codex":[0.998516,0.00008686323,0.0003538931,0.00015881,0.0006563484,0.0002281064],"domain_scores_gemma":[0.9987102,0.0002366903,0.0002922215,0.0005434555,0.0001200527,0.00009734069],"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.00001628093,0.00009000103,0.00006520582,0.00005593732,0.0000143231,0.000008547629,0.0005089859,0.003638576,0.00308696,0.9912251,0.0001520254,0.001138075],"study_design_scores_gemma":[0.0005710741,0.000925641,0.0001109743,0.0003546615,0.000005416764,0.00008070588,0.0001033405,0.06601712,0.01380922,0.9175033,0.0003217333,0.0001968285],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2192543,0.00004859416,0.768728,0.0003464801,0.0002565462,0.000217688,0.000002554948,0.00003790885,0.01110788],"genre_scores_gemma":[0.912883,0.00004701086,0.08567728,0.0001635087,0.00004740303,0.000003114667,9.471157e-7,0.00002396403,0.001153701],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6936287,"threshold_uncertainty_score":0.3682627,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4408874684","doi":"10.1137/24m1647692","title":"Dyadic Packing of Dijoins","year":2025,"lang":"es","type":"article","venue":"SIAM Journal on Discrete Mathematics","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Combinatorics; Packing problems; Discrete mathematics","authors":[{"name":"Bertrand Guenin","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01175268312992277,"gpt":0.2671095122186709,"spread":0.2553568290887481,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005081755,0.0003112157,0.000549528,0.0004345024,0.0001507283,0.0002592132,0.0003255352,0.0001730263,0.0003095138],"category_scores_gemma":[0.0002222272,0.0002707047,0.0002686026,0.0004956335,0.0000727025,0.0001326049,0.00005797642,0.0006236155,0.00006182138],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001057277,"about_ca_system_score_gemma":0.00008927337,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000112642,"about_ca_topic_score_gemma":5.684457e-7,"domain_scores_codex":[0.9980993,0.00006265402,0.0009689432,0.0001446383,0.000378804,0.0003456419],"domain_scores_gemma":[0.9987215,0.0002435067,0.0004000423,0.0003712706,0.000134406,0.0001292254],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0000435003,0.0004701584,0.001571676,0.007811352,0.001223193,0.00005283698,0.004249502,0.2916909,0.001800859,0.6774255,0.006351185,0.007309344],"study_design_scores_gemma":[0.005439118,0.001043219,0.002416407,0.05580914,0.001460334,0.0003261644,0.002757808,0.7316647,0.01641401,0.1130992,0.06719568,0.002374291],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.04101577,0.004284775,0.4615051,0.002358324,0.003840431,0.0007483247,0.0001032285,0.0002919922,0.4858521],"genre_scores_gemma":[0.9768397,0.002025221,0.01874495,0.0001226898,0.0001431884,0.000003157113,0.000005740425,0.00007995442,0.002035399],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9358239,"threshold_uncertainty_score":0.9999745,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2886010892","doi":"10.1137/20m1356968","title":"When Do Gomory--Hu Subtrees Exist?","year":2022,"lang":"en","type":"preprint","venue":"SIAM Journal on Discrete Mathematics","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Agence Nationale de la Recherche","keywords":"Combinatorics; Computer science; Mathematics","authors":[{"name":"Guyslain Naves","is_ca":false},{"name":"F. Bruce Shepherd","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04253123021233643,"gpt":0.2935675574971187,"spread":0.2510363272847822,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","scholarly_communication","research_integrity","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.001595028,0.0006529941,0.0008581247,0.000514664,0.0007571236,0.001859976,0.005204345,0.0002298217,0.0009671975],"category_scores_gemma":[0.0001803472,0.0005634935,0.0008029965,0.0003336819,0.0001522624,0.0003170869,0.004565298,0.003366661,0.0001029619],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002822396,"about_ca_system_score_gemma":0.000303514,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006886737,"about_ca_topic_score_gemma":0.000003774545,"domain_scores_codex":[0.9954231,0.0003006449,0.001105953,0.0007539184,0.001739092,0.000677279],"domain_scores_gemma":[0.9958203,0.0003991938,0.00113767,0.002118766,0.0001609084,0.0003631651],"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.00002417841,0.0007563367,0.00006735913,0.0007116016,0.0004659564,0.0008911255,0.01158495,0.002798304,0.00001733575,0.9450064,0.020055,0.0176215],"study_design_scores_gemma":[0.0003297257,0.0002607043,0.00007607451,0.0006617821,0.00005322397,0.0004723848,0.0004073794,0.0201058,0.00004863728,0.9548399,0.02199308,0.0007512707],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01329498,0.003268701,0.8444574,0.00809954,0.01098092,0.001244171,0.0002461034,0.0008220419,0.1175861],"genre_scores_gemma":[0.06463753,0.001199714,0.9255581,0.001112655,0.001693796,0.0001374907,0.00004991642,0.0002100903,0.005400638],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.1121855,"threshold_uncertainty_score":0.9999461,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3195869111","doi":"10.1137/19m1296069","title":"Hamiltonicity of Random Graphs in the Stochastic Block Model","year":2021,"lang":"en","type":"article","venue":"SIAM Journal on Discrete Mathematics","topic":"Graph theory and applications","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Mathematics; Combinatorics; Random graph; Discrete mathematics; Partition (number theory); Graph; Stochastic block model; Statistics","authors":[{"name":"Michael Anastos","is_ca":true},{"name":"Alan Frieze","is_ca":true},{"name":"Pu Gao","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.041733432782127,"gpt":0.3138007515288425,"spread":0.2720673187467155,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001540747,0.0002045229,0.0004514637,0.0001321366,0.0001824318,0.00006202933,0.0004670965,0.00008226053,0.00004427271],"category_scores_gemma":[0.0007660163,0.0001310708,0.0003154497,0.0004560615,0.0001200009,0.0000728637,0.00005176696,0.0005574343,0.000008463554],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002354423,"about_ca_system_score_gemma":0.00009081382,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":4.864563e-7,"about_ca_topic_score_gemma":0.000007303519,"domain_scores_codex":[0.998051,0.0002168577,0.0007966438,0.0001594466,0.0005087389,0.0002672442],"domain_scores_gemma":[0.9972576,0.00148034,0.0004335081,0.0006069022,0.00014506,0.00007661395],"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.00003673955,0.0005995579,0.000006786628,0.0001310666,0.00005687684,0.00001840465,0.003408255,0.00546329,0.0006558161,0.9891994,0.0003757105,0.00004810222],"study_design_scores_gemma":[0.001074667,0.000047168,0.00001820469,0.0003245902,0.000101607,0.000256662,0.00185973,0.02471007,0.0008513137,0.970597,0.00001779228,0.0001412181],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8907372,0.0001993781,0.09827881,0.001114267,0.00008088067,0.0005333438,0.0000395733,0.00003176574,0.00898478],"genre_scores_gemma":[0.9835943,0.00004875724,0.01593592,0.0001450166,0.00002659153,0.00002773661,0.00000217669,0.00002749001,0.0001920245],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.09285709,"threshold_uncertainty_score":0.5344913,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3091567360","doi":"10.1137/20m1380314","title":"A Complete Multipartite Basis for the Chromatic Symmetric Function","year":2021,"lang":"en","type":"preprint","venue":"SIAM Journal on Discrete Mathematics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Symmetric function; Combinatorics; Mathematics; Multipartite; Chromatic scale; Basis (linear algebra); Monomial; Stanley symmetric function; Lambda; Disjoint sets; Discrete mathematics; Ring of symmetric functions; Graph; Physics","authors":[{"name":"Logan Crew","is_ca":true},{"name":"Sophie Spirkl","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.08086964179098748,"gpt":0.3354876833294389,"spread":0.2546180415384514,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaresearch","metaepi_narrow","scholarly_communication","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.002631723,0.001206676,0.002055135,0.0005211293,0.0009550622,0.001159458,0.001663097,0.0006130996,0.000246096],"category_scores_gemma":[0.01133459,0.0008281645,0.001593429,0.0007205198,0.0001968048,0.0002525612,0.0009034917,0.002566906,0.00006156632],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006626323,"about_ca_system_score_gemma":0.0003877494,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000253183,"about_ca_topic_score_gemma":0.00000720629,"domain_scores_codex":[0.9934425,0.0003431898,0.002616546,0.0007661443,0.001812588,0.001019039],"domain_scores_gemma":[0.9809932,0.01198057,0.003303688,0.002399789,0.0009528906,0.0003699309],"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.0003477445,0.002937063,0.0000131602,0.01972113,0.00525087,0.0001470614,0.008376016,0.005555609,0.0008369956,0.9398558,0.01258507,0.004373488],"study_design_scores_gemma":[0.001434531,0.0004649214,0.00001911975,0.004851127,0.00206045,0.0002565753,0.002538918,0.06634197,0.0002642251,0.9185569,0.002192284,0.001018971],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0237058,0.001651691,0.9577416,0.001414838,0.007746876,0.004720886,0.0002883216,0.0003964659,0.002333585],"genre_scores_gemma":[0.3661241,0.0009861772,0.623912,0.0006956733,0.003578032,0.001685875,0.0001186833,0.001051277,0.001848171],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.3424183,"threshold_uncertainty_score":0.9998775,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2592462466","doi":"10.1137/17m1144805","title":"Lollipop and Lariat Symmetric Functions","year":2018,"lang":"en","type":"preprint","venue":"SIAM Journal on Discrete Mathematics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":true,"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":"Symmetric function; Chromatic scale; Mathematics; Graph; Combinatorics; Ring of symmetric functions; Stanley symmetric function; Discrete mathematics; Pure mathematics; Orthogonal polynomials","authors":[{"name":"Samantha Dahlberg","is_ca":false},{"name":"Stephanie van Willigenburg","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04853382306923126,"gpt":0.3299887152324487,"spread":0.2814548921632175,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.001549226,0.001126673,0.001747986,0.000875871,0.0006154422,0.0007240787,0.00105628,0.0008374814,0.000374381],"category_scores_gemma":[0.00519509,0.0009193097,0.000584476,0.0005692503,0.0003098951,0.0002387032,0.001339906,0.002968553,0.0002578901],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004289458,"about_ca_system_score_gemma":0.0002589783,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002013597,"about_ca_topic_score_gemma":0.000003461375,"domain_scores_codex":[0.9946155,0.0002507828,0.001981218,0.000764687,0.001521429,0.0008663757],"domain_scores_gemma":[0.9924839,0.002162363,0.002376064,0.001759086,0.0006234977,0.0005950854],"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.00009564601,0.001345448,0.00003755983,0.00459608,0.001139412,0.0002117564,0.002847487,0.00008295385,0.00005157279,0.9654926,0.02255245,0.001547026],"study_design_scores_gemma":[0.0009445499,0.0004729653,0.0000104395,0.002359655,0.0006739201,0.0007555818,0.0006487088,0.002619579,0.0001438762,0.9880304,0.002397223,0.0009430531],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.2581694,0.002773553,0.5953008,0.003423256,0.02538621,0.006122391,0.0007686233,0.00174145,0.1063143],"genre_scores_gemma":[0.2847464,0.00170029,0.6929512,0.0003162929,0.007203949,0.0002655502,0.00007678549,0.001284432,0.01145503],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.09765044,"threshold_uncertainty_score":0.9993317,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3176383582","doi":"10.1137/21m1450082","title":"A Spectral Moore Bound for Bipartite Semiregular Graphs","year":2023,"lang":"en","type":"article","venue":"SIAM Journal on Discrete Mathematics","topic":"Graph theory and applications","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Bipartite graph; Mathematics; Combinatorics; Upper and lower bounds; Discrete mathematics; Graph","authors":[{"name":"Sabrina Lato","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.05080937930989123,"gpt":0.3374562849573426,"spread":0.2866469056474514,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001286721,0.0003024711,0.0004322036,0.000322907,0.0005933546,0.0002090015,0.0004379908,0.0001184122,0.0001255911],"category_scores_gemma":[0.0004485401,0.0002377423,0.0004972521,0.0006757667,0.0001316141,0.0001443346,0.00004997322,0.0003556872,0.0001907689],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004366334,"about_ca_system_score_gemma":0.00004557824,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":2.532001e-7,"about_ca_topic_score_gemma":0.000002287638,"domain_scores_codex":[0.997974,0.00006336564,0.0006864328,0.0002514651,0.0004398545,0.0005849056],"domain_scores_gemma":[0.997845,0.0008475085,0.000395774,0.0005573788,0.0001137514,0.0002405989],"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.00002902937,0.0001623031,0.00001995604,0.0002217258,0.0001258076,0.00001621783,0.001068363,0.00003948795,0.001420126,0.9789055,0.017791,0.000200503],"study_design_scores_gemma":[0.0005818362,0.0001719778,0.00005702793,0.0002353868,0.0001234758,0.000123466,0.0008425697,0.00226955,0.002295503,0.9879256,0.005085203,0.0002884015],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.973682,0.00006957462,0.0157669,0.002430261,0.0003566561,0.001157718,0.0001363443,0.0004834805,0.005917047],"genre_scores_gemma":[0.9183437,0.0001996007,0.07092199,0.0003240773,0.0006572177,0.0004242379,0.00005739517,0.0002958312,0.008775936],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.0553383,"threshold_uncertainty_score":0.969485,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4386848811","doi":"10.1137/22m1534195","title":"Extremal Bounds for 3-Neighbor Bootstrap Percolation in Dimensions Two and Three","year":2023,"lang":"en","type":"article","venue":"SIAM Journal on Discrete Mathematics","topic":"Stochastic processes and statistical mechanics","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada; University of Victoria","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Cardinality (data modeling); Grid; k-nearest neighbors algorithm; Graph; Percolation (cognitive psychology); Discrete mathematics; Set (abstract data type); Computer science","authors":[{"name":"Peter J. Dukes","is_ca":true},{"name":"Jonathan A. Noel","is_ca":true},{"name":"Abel E. Romer","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1075846876101875,"gpt":0.3861414268246157,"spread":0.2785567392144281,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009074711,0.000248327,0.0004326913,0.0002484708,0.0002718112,0.0001562148,0.0001677927,0.0001004193,0.00004981373],"category_scores_gemma":[0.002269305,0.000193566,0.0001092649,0.0003217332,0.00005404299,0.0001339988,0.00006335136,0.0003352112,0.00002170739],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006490968,"about_ca_system_score_gemma":0.00006646839,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001283717,"about_ca_topic_score_gemma":0.00003821448,"domain_scores_codex":[0.99818,0.00002981677,0.00067788,0.0002373385,0.0004192565,0.0004556715],"domain_scores_gemma":[0.9970547,0.002168063,0.0002468689,0.0002196412,0.0001184192,0.0001923244],"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.00006837379,0.0001338156,0.0000500676,0.0004114143,0.00003888295,0.0000471037,0.001007434,0.00005947519,0.000381313,0.9945613,0.0007470018,0.002493784],"study_design_scores_gemma":[0.00101761,0.0002907503,0.0001762899,0.0003884614,0.00006288145,0.0000973032,0.0005641727,0.1746648,0.0000411192,0.8223889,0.0001058194,0.0002019059],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1774631,0.00009205972,0.8194324,0.0007946861,0.0003151077,0.0007450738,0.0000797461,0.0001125004,0.0009652887],"genre_scores_gemma":[0.8642593,0.00008056965,0.134873,0.00008515362,0.0002093415,0.00008059576,0.00001092279,0.0000922098,0.0003088912],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6867962,"threshold_uncertainty_score":0.7893391,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4403257040","doi":"10.1137/24m1640859","title":"Kissing Polytopes","year":2024,"lang":"en","type":"article","venue":"SIAM Journal on Discrete Mathematics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"McMaster University","funders":"Natural Sciences and Engineering Research Council of Canada; Israel Science Foundation; Deutsche Forschungsgemeinschaft; Technion-Israel Institute of Technology; National Science Foundation","keywords":"Polytope; Mathematics; Combinatorics; Discrete mathematics","authors":[{"name":"Antoine Deza","is_ca":true},{"name":"Shmuel Onn","is_ca":false},{"name":"Sebastian Pokutta","is_ca":false},{"name":"Lionel Pournin","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04336039856165239,"gpt":0.3579043796522653,"spread":0.314543981090613,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001140622,0.0005084581,0.0006748931,0.0003671487,0.0003420204,0.0008065697,0.0005980937,0.0001759584,0.0003729915],"category_scores_gemma":[0.00153374,0.0003748781,0.0004164135,0.0004889557,0.000114195,0.0004789051,0.0001287617,0.001052295,0.00045147],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002595478,"about_ca_system_score_gemma":0.0001427284,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":3.739438e-7,"about_ca_topic_score_gemma":5.228552e-7,"domain_scores_codex":[0.9967472,0.0001018824,0.001119575,0.0003538757,0.001029079,0.0006483645],"domain_scores_gemma":[0.9967311,0.001769697,0.0003634717,0.0006746003,0.0001336055,0.0003275483],"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.00001354095,0.0002081135,0.000002139285,0.0008705169,0.000159175,0.0003271158,0.001973099,0.00002197125,0.0006269824,0.9867729,0.005797037,0.003227388],"study_design_scores_gemma":[0.0003288109,0.000220622,0.00000178397,0.002364983,0.0001389552,0.001013382,0.0006615671,0.003853443,0.001832259,0.9789225,0.01020305,0.0004585735],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1365652,0.003608931,0.668839,0.005527624,0.01216316,0.001797229,0.00006287088,0.00305373,0.1683822],"genre_scores_gemma":[0.6305369,0.0002483712,0.3578708,0.0002559308,0.002156237,0.00003834832,0.000004113484,0.0005211128,0.008368148],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.4939717,"threshold_uncertainty_score":0.9998703,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4283011735","doi":"10.1137/21m1417077","title":"Robust Connectivity of Graphs on Surfaces","year":2022,"lang":"en","type":"article","venue":"SIAM Journal on Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; Uniwersytet Warszawski","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Lambda; Discrete mathematics; Degeneracy (biology); Dominating set; Tree (set theory); Arboricity; Spanning tree; Invariant (physics); Graph; Planar graph","authors":[{"name":"Peter Bradshaw","is_ca":true},{"name":"Tomáš Masařík","is_ca":false},{"name":"Jana Novotná","is_ca":true},{"name":"Ladislav Stacho","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04604837284947536,"gpt":0.2979433993994719,"spread":0.2518950265499965,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001895395,0.0001782192,0.000326839,0.0003455049,0.0004927521,0.0001028987,0.001431102,0.00002858053,0.0001427435],"category_scores_gemma":[0.0002582323,0.00014244,0.0002001846,0.0007151189,0.0001122558,0.0002638193,0.0004247978,0.0007829976,0.00001598221],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008904703,"about_ca_system_score_gemma":0.00007441094,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":9.726081e-7,"about_ca_topic_score_gemma":8.009599e-7,"domain_scores_codex":[0.9973899,0.0003797109,0.0004281951,0.0002493931,0.001195398,0.0003574766],"domain_scores_gemma":[0.9978196,0.0008321161,0.0004297673,0.000665316,0.0001050792,0.0001481271],"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.00006123703,0.0004298667,0.0001366877,0.00005055432,0.0000612038,0.00007485496,0.001232779,0.04998526,0.0008971833,0.9451008,0.0003669444,0.001602634],"study_design_scores_gemma":[0.0007212777,0.001953841,0.0003611186,0.0001102587,0.0000110031,0.0003092157,0.001037114,0.05113417,0.004281342,0.9391784,0.0005820203,0.0003202643],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7201879,0.0001685037,0.2668276,0.001264266,0.0005572519,0.0003902994,0.0000350919,0.0001038546,0.01046525],"genre_scores_gemma":[0.9716282,0.00002976793,0.02793334,0.00009637132,0.00001854414,0.00001142865,7.186027e-7,0.0000220062,0.0002595946],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2514403,"threshold_uncertainty_score":0.5808536,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3026391377","doi":"10.1137/20m1367672","title":"The Uniformity Conjecture in Additive Combinatorics","year":2021,"lang":"en","type":"preprint","venue":"SIAM Journal on Discrete Mathematics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Hungarian Scientific Research Fund; Natural Sciences and Engineering Research Council of Canada; Ministry of Education and Science of the Russian Federation","keywords":"Conjecture; Cardinality (data modeling); Combinatorics; Mathematics; Product (mathematics); Discrete mathematics; Computer science","authors":[{"name":"Ilya D. Shkredov","is_ca":false},{"name":"József Solymosi","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02487217775426493,"gpt":0.3041367521464307,"spread":0.2792645743921658,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.002255274,0.0007550336,0.001146595,0.0002398117,0.0009475006,0.0007175939,0.001415846,0.0007073628,0.0001403823],"category_scores_gemma":[0.002515056,0.0004512813,0.0007097654,0.0003210956,0.0003234492,0.0001119284,0.001220401,0.005044393,0.000005796696],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003822853,"about_ca_system_score_gemma":0.0003434792,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003109236,"about_ca_topic_score_gemma":0.00003075726,"domain_scores_codex":[0.9957054,0.0005105856,0.00146764,0.0004540002,0.001145666,0.0007167113],"domain_scores_gemma":[0.9933881,0.003209125,0.001467507,0.001365082,0.0003344035,0.0002357863],"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.00004893666,0.0002578209,0.00005376934,0.0005446497,0.0003909917,0.0003956473,0.00946944,0.0001129963,0.000002573389,0.9853914,0.002421032,0.0009107151],"study_design_scores_gemma":[0.0006415289,0.0001167029,0.0001520382,0.001642901,0.000139811,0.0003591726,0.00406219,0.000603451,0.0001957127,0.9896015,0.001935596,0.0005494053],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9056391,0.003964307,0.007449569,0.003932509,0.01193283,0.002929454,0.0004454612,0.0002765809,0.0634302],"genre_scores_gemma":[0.9865682,0.002596128,0.008378685,0.000283238,0.0005729666,0.00005937865,0.00003806268,0.0001982964,0.00130501],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.08092914,"threshold_uncertainty_score":0.9997939,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2053642853","doi":"10.1137/130929229","title":"Homological Face-Width Condition Forcing $K_6$-Minors in Graphs on Surfaces","year":2014,"lang":"en","type":"article","venue":"SIAM Journal on Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; Javna Agencija za Raziskovalno Dejavnost RS; Simon Fraser University","keywords":"Mathematics; Combinatorics; Projective plane; Face (sociological concept); Graph; Minor (academic); Discrete mathematics; Surface (topology); Plane (geometry); Geometry","authors":[{"name":"Roi Krakovski","is_ca":true},{"name":"Bojan Mohar","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0269461334175931,"gpt":0.3094823273796334,"spread":0.2825361939620403,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002119526,0.0002649469,0.0003846565,0.0004667414,0.0002612203,0.0002930291,0.001104517,0.0001092883,0.00004084373],"category_scores_gemma":[0.0006758099,0.0001903114,0.0001658653,0.0005520622,0.0001494215,0.0004700828,0.0001622555,0.0008156512,0.0001103041],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009348913,"about_ca_system_score_gemma":0.00003192043,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":9.319432e-7,"about_ca_topic_score_gemma":0.0000034405,"domain_scores_codex":[0.9972456,0.0004529502,0.0005643307,0.0003483911,0.0008049104,0.0005838494],"domain_scores_gemma":[0.9976609,0.001164613,0.0003167126,0.0005566403,0.00007661004,0.0002245265],"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.00004617622,0.0002092474,0.0003796763,0.00004438766,0.00002461457,0.00009630847,0.001204893,0.005767493,0.0005493989,0.9863991,0.0001397307,0.005139021],"study_design_scores_gemma":[0.0006807174,0.0009312341,0.001281123,0.0002909031,0.00000546991,0.0001581964,0.0003334741,0.04411986,0.0019522,0.9497832,0.0001678359,0.0002957949],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6008993,0.0000540138,0.3916607,0.0007400439,0.0002347088,0.0002746465,0.000003954384,0.00009188792,0.006040683],"genre_scores_gemma":[0.9720562,0.00004716553,0.02741978,0.0002116855,0.00003875592,0.00001036473,0.000001891104,0.00002207477,0.0001921109],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3711568,"threshold_uncertainty_score":0.7760674,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3014978470","doi":"10.1137/20m1370744","title":"Dense Induced Subgraphs of Dense Bipartite Graphs","year":2021,"lang":"en","type":"preprint","venue":"SIAM Journal on Discrete Mathematics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Bipartite graph; Conjecture; Combinatorics; Mathematics; Degree (music); Graph; Induced subgraph; Girth (graph theory); Discrete mathematics; Vertex (graph theory); Physics","authors":[{"name":"Rose McCarty","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.05106553509882367,"gpt":0.3211682898076904,"spread":0.2701027547088667,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.002101758,0.0009973766,0.002079713,0.0008837839,0.0004389199,0.0003525016,0.001306616,0.0008792942,0.0003732794],"category_scores_gemma":[0.001818939,0.0007664301,0.00181842,0.0005145103,0.0003194268,0.000148047,0.001115933,0.003039044,0.000007361961],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000108878,"about_ca_system_score_gemma":0.0002987299,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005478401,"about_ca_topic_score_gemma":0.00001408499,"domain_scores_codex":[0.9939557,0.0005508823,0.002494513,0.0006472665,0.001587434,0.0007642432],"domain_scores_gemma":[0.9926054,0.001272919,0.002933191,0.002035876,0.0007109205,0.0004416494],"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.0002782477,0.00140917,0.0006093195,0.007583725,0.003613711,0.001081893,0.02624984,0.000228552,0.004659811,0.9503458,0.002575249,0.001364741],"study_design_scores_gemma":[0.0007487282,0.0002683046,0.0001806276,0.004349548,0.000707977,0.0006255979,0.00194415,0.0002928661,0.00842876,0.9815348,0.00006835126,0.0008502384],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9901243,0.001051582,0.002245039,0.0001407323,0.002015674,0.0006081439,0.00007848241,0.0001025294,0.003633522],"genre_scores_gemma":[0.9577276,0.0009448886,0.04042973,0.0001362707,0.0002745435,0.00002656964,0.00001528264,0.0002128578,0.0002322286],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.03818469,"threshold_uncertainty_score":0.9994786,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3001604198","doi":"10.1137/20m1320730","title":"Counting Linear Extensions of Posets with Determinants of Hook Lengths","year":2021,"lang":"en","type":"preprint","venue":"SIAM Journal on Discrete Mathematics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"International Max Planck Research School for Advanced Methods in Process and Systems Engineering; Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs; National Science Foundation","keywords":"Mathematics; Combinatorics; Skew; Hook; Ribbon; Star product; Descent (aeronautics); Class (philosophy); Discrete mathematics; Geometry; Computer science; Physics","authors":[{"name":"Alexander Garver","is_ca":false},{"name":"Stefan N. Grösser","is_ca":false},{"name":"Jacob P. Matherne","is_ca":false},{"name":"Alejandro H. Morales","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04490005041821215,"gpt":0.3455230302338493,"spread":0.3006229798156371,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001476051,0.0009191727,0.002843332,0.0004032459,0.000188631,0.0001161166,0.001111895,0.0005501595,0.00009474839],"category_scores_gemma":[0.004036618,0.0007004707,0.0007018003,0.0003602358,0.0002994461,0.0002093134,0.0008838709,0.002036498,0.000006813659],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001788234,"about_ca_system_score_gemma":0.0006762364,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003518469,"about_ca_topic_score_gemma":0.000009400012,"domain_scores_codex":[0.993577,0.0002228123,0.003065612,0.0005418265,0.001944006,0.0006487662],"domain_scores_gemma":[0.9878958,0.002179628,0.006112012,0.001883343,0.001646926,0.0002822913],"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.001805834,0.02437058,0.002602705,0.1666387,0.009795543,0.005940718,0.07838371,0.01393736,0.01616002,0.6705721,0.002548437,0.007244273],"study_design_scores_gemma":[0.002244983,0.001202665,0.00006606288,0.04094285,0.00152547,0.001349763,0.005881941,0.01153905,0.02976844,0.9039184,0.00005851728,0.001501883],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9543399,0.0003589308,0.04069418,0.00008168678,0.001109932,0.001084264,0.0001168299,0.00009586111,0.002118453],"genre_scores_gemma":[0.6015213,0.0002724227,0.3974222,0.00002114259,0.0002341113,0.00002341285,0.00001035072,0.0002700968,0.0002249215],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.356728,"threshold_uncertainty_score":0.9995446,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2903896173","doi":"10.1137/18m1214196","title":"Corrigendum: Orthogonal Tree Decompositions of Graphs","year":2018,"lang":"en","type":"erratum","venue":"SIAM Journal on Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University; Carleton University; University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada; Australian Research Council; Fédération Wallonie-Bruxelles","keywords":"Mathematics; Combinatorics; Tree (set theory); Discrete mathematics","authors":[{"name":"Vida Dujmović","is_ca":false},{"name":"Gwenaël Joret","is_ca":false},{"name":"Pat Morin","is_ca":true},{"name":"Sergey Norin","is_ca":true},{"name":"David R. Wood","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03365558894771017,"gpt":0.3176513302921984,"spread":0.2839957413444883,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.00121176,0.0005851696,0.0009667077,0.001064223,0.0004663561,0.0003411818,0.003514109,0.0004059235,0.0002666777],"category_scores_gemma":[0.0002754485,0.0004606655,0.0007617092,0.0009796907,0.0004899832,0.0004420767,0.000536781,0.002308937,0.0001746779],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001271759,"about_ca_system_score_gemma":0.0005496627,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":6.34869e-7,"about_ca_topic_score_gemma":0.00000858768,"domain_scores_codex":[0.9952557,0.0002844084,0.001285129,0.0005296249,0.001874262,0.0007708724],"domain_scores_gemma":[0.9954578,0.0003369518,0.001495788,0.001568825,0.000688554,0.0004520578],"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.00003200487,0.0003534927,0.000008162227,0.0003158271,0.000299982,0.0001722979,0.0007032412,0.00001803418,0.000141959,0.5050747,0.4907632,0.002117087],"study_design_scores_gemma":[0.0005419457,0.001266417,0.00005889067,0.002024385,0.00009139085,0.001030516,0.000128934,0.006142342,0.0004129063,0.9436191,0.04394079,0.0007423952],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0004485221,0.001228942,0.7787273,0.0007547859,0.02903317,0.0007457811,0.0002434681,0.0002029466,0.1886151],"genre_scores_gemma":[0.00561103,0.003099595,0.7416707,0.0005503778,0.003790037,0.0000854193,0.0002415249,0.0005037508,0.2444475],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.4468223,"threshold_uncertainty_score":0.9999928,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3193900015","doi":"10.1137/22m1511801","title":"The Typical Approximate Structure of Sets with Bounded Sumset","year":2023,"lang":"en","type":"article","venue":"SIAM Journal on Discrete Mathematics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"European Social Fund; Agencia Estatal de Investigación; Conselho Nacional de Desenvolvimento Científico e Tecnológico; Ministerio de Economía y Competitividad; Nederlandse Organisatie voor Wetenschappelijk Onderzoek","keywords":"Mathematics; Abelian group; Hypergraph; Combinatorics; Bounded function; Discrete mathematics; Structured program theorem","authors":[{"name":"Marcelo Campos","is_ca":false},{"name":"Matthew Coulson","is_ca":true},{"name":"Oriol Serra","is_ca":false},{"name":"Maximilian Wötzel","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02510234087633091,"gpt":0.3033898950029553,"spread":0.2782875541266244,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008192676,0.0003123841,0.0004862307,0.0001489594,0.0008029052,0.0001584326,0.000641184,0.0001367301,0.00008280171],"category_scores_gemma":[0.0005583572,0.0001481033,0.0002062296,0.0004312704,0.0003745846,0.00009146873,0.0001459873,0.0006555428,0.000009471017],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003691761,"about_ca_system_score_gemma":0.00006047367,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":3.139413e-7,"about_ca_topic_score_gemma":0.000005542883,"domain_scores_codex":[0.9976174,0.0001437629,0.000707114,0.0001880435,0.0008515885,0.0004921505],"domain_scores_gemma":[0.9971347,0.001262906,0.0006171843,0.0006788783,0.0001545893,0.0001517433],"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.0002718939,0.00005432828,0.0001187092,0.0003132492,0.000294422,0.00004683552,0.002890314,0.0000494339,0.0002609059,0.9912812,0.00380205,0.0006166306],"study_design_scores_gemma":[0.0005891105,0.0002670256,0.0002774712,0.0002609284,0.00009501411,0.000348017,0.001482606,0.0009454128,0.001024997,0.9936986,0.0007866011,0.000224225],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9939832,0.00006934268,0.001490508,0.0005429619,0.0004257103,0.0003888471,0.00008485245,0.0001203958,0.002894167],"genre_scores_gemma":[0.9835023,0.00009967911,0.0156361,0.00005879963,0.000135252,0.000004945823,0.000006709317,0.0000842466,0.0004719573],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01414559,"threshold_uncertainty_score":0.6175379,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}