{"meta":{"query_hash":"25aae82f91eb","filters":{"topic":"Limits and Structures in Graph Theory"},"cohort_total":834,"direct_labels_cover":0,"predictions_cover":834,"exported":834,"export_cap":100000,"truncated":false,"label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"permalink":"https://metacan.xera.ac/q/25aae82f91eb","api":"https://metacan.xera.ac/api/v1/cohort?topic=Limits+and+Structures+in+Graph+Theory"},"results":[{"id":"W100995880","doi":"10.1002/jgt.20611","title":"Random graphons and a weak Positivstellensatz for graphs","year":2011,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Mathematics; Discrete mathematics; Combinatorics; Multiplicative function; Random graph; Countable set; Graph; Ergodic theory; Pure mathematics","score_opus":0.041843984161114615,"score_gpt":0.2771186155277397,"score_spread":0.23527463136662508,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W100995880","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9596924,0.003075106,0.023363497,0.000085540014,0.0012587154,0.0005629001,0.00003135135,0.00004876277,0.011881723],"genre_scores_gemma":[0.9787424,0.00041290993,0.020358862,0.00014543103,0.000117342504,0.000008974234,4.7202542e-7,0.000045111126,0.00016847669],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99831206,0.00030082552,0.0006773012,0.00017387241,0.00023452505,0.00030139342],"domain_scores_gemma":[0.99702865,0.0016734482,0.0005814839,0.00028268702,0.00025574514,0.00017801343],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024688262,0.00024369266,0.00056114607,0.00056570733,0.00031752992,0.000025282663,0.00032493775,0.00014222715,0.00008812998],"category_scores_gemma":[0.00045499342,0.00016862349,0.0006349905,0.00021440702,0.0004142728,0.0001834717,0.00006113121,0.00029489116,4.1932475e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0025357017,0.000112618916,0.0006117783,0.0000777373,0.00047325387,0.000017838283,0.0042446284,1.436963e-7,0.0004946253,0.9874488,0.0011952405,0.002787606],"study_design_scores_gemma":[0.003017101,0.00050413696,0.0011037599,0.00009599863,0.000366156,0.00046857804,0.0011977095,0.0000022081758,0.0017155566,0.9908939,0.0004268624,0.00020804629],"about_ca_topic_score_codex":0.0000015582451,"about_ca_topic_score_gemma":0.000002099474,"teacher_disagreement_score":0.019050015,"about_ca_system_score_codex":0.00000871138,"about_ca_system_score_gemma":0.000027147698,"threshold_uncertainty_score":0.6876266},"labels":[],"label_agreement":null},{"id":"W10105315","doi":"","title":"On Asymmetric Colorings of Integer Grids.","year":2002,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Van der Waerden's theorem; Combinatorics; Counterexample; Conjecture; Integer (computer science); Monochromatic color; Sequence (biology); Arithmetic progression; Infinity; Discrete mathematics; Integer sequence; Natural number; Mathematical analysis","score_opus":0.027451573705194077,"score_gpt":0.26118393112549837,"score_spread":0.2337323574203043,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W10105315","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8727029,0.000109169356,0.000006702842,0.00005222837,0.0012605425,0.00012814776,0.0000033772167,0.000057796686,0.12567912],"genre_scores_gemma":[0.9987221,0.000023321072,0.00026354243,0.00008909875,0.000006784107,0.000007580781,5.217352e-7,0.000023168699,0.0008638873],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990284,0.000054640474,0.00027152678,0.00017499151,0.00027207882,0.00019839371],"domain_scores_gemma":[0.99857616,0.00074875646,0.00013615428,0.00040595804,0.00007328538,0.000059702452],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022781323,0.00014217893,0.00026131346,0.00020023274,0.00009239298,0.000010475919,0.00027224352,0.00009980841,0.00029160452],"category_scores_gemma":[0.00067478616,0.00011527462,0.000109995,0.00043445182,0.00008671311,0.000053744385,0.00008853709,0.00020380934,0.000032676006],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001436442,0.00016109315,0.0004446862,0.000035127257,0.000037625385,0.0000045325855,0.00034802346,5.4698825e-7,0.000026698744,0.98767847,0.010474554,0.00077427464],"study_design_scores_gemma":[0.0005639456,0.00022750773,0.0004710921,0.000032225136,0.000022166796,0.0000034051943,0.00003214784,0.000043297303,0.0024739562,0.994616,0.001385432,0.00012885743],"about_ca_topic_score_codex":0.000004385832,"about_ca_topic_score_gemma":2.952877e-7,"teacher_disagreement_score":0.12601918,"about_ca_system_score_codex":0.000033466582,"about_ca_system_score_gemma":0.0000043612845,"threshold_uncertainty_score":0.47007626},"labels":[],"label_agreement":null},{"id":"W104379926","doi":"10.1007/978-1-4614-5392-5_4","title":"More Restrictive Classes of I 0 Sets","year":2012,"lang":"en","type":"book-chapter","venue":"CMS books in mathematics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; University of British Columbia","funders":"","keywords":"Bounded function; Class (philosophy); Set (abstract data type); Process (computing); Mathematics; Combinatorics; Discrete mathematics; Computer science; Artificial intelligence; Mathematical analysis","score_opus":0.05635932118677339,"score_gpt":0.3107536537130222,"score_spread":0.2543943325262488,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W104379926","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0029232197,0.0014926707,0.0003609451,0.00002443179,0.00042889742,0.00081767375,0.00012334269,0.00010115222,0.9937277],"genre_scores_gemma":[0.070297755,0.0013919764,0.14043735,0.00017934144,0.00083838846,0.00010018691,0.00006071828,0.0009793448,0.7857149],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973018,0.0000371712,0.0012373255,0.00035718907,0.000632767,0.00043370327],"domain_scores_gemma":[0.9962334,0.0011969891,0.001061619,0.0012230686,0.0001675621,0.000117335796],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00058956107,0.0006372046,0.0012819296,0.0004404459,0.00009201647,0.000018415312,0.0006170817,0.0007989416,0.0003785964],"category_scores_gemma":[0.00042396056,0.00053620327,0.00036035565,0.000055710632,0.00048228327,0.0000880718,0.00038160468,0.0008271156,0.000020384836],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014562466,0.000085240026,0.000030135025,0.001490527,0.00016693158,0.000020897616,0.0050528487,0.0000010490489,0.000016104797,0.9898154,0.0021667322,0.0011395577],"study_design_scores_gemma":[0.0002783632,0.00005094327,0.000024168228,0.0012444,0.00025040464,0.00003215791,0.0002880561,0.000034614714,0.00019633041,0.98877704,0.008319432,0.0005041159],"about_ca_topic_score_codex":0.0000018602584,"about_ca_topic_score_gemma":0.000005012085,"teacher_disagreement_score":0.20801273,"about_ca_system_score_codex":0.00012357112,"about_ca_system_score_gemma":0.0000844717,"threshold_uncertainty_score":0.99970895},"labels":[],"label_agreement":null},{"id":"W110328050","doi":"","title":"On Deuber's partition theorem for (m, p, c)-sets.","year":2002,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Mathematics; Partition (number theory); Van der Waerden's theorem; Combinatorics; Conjecture; Discrete mathematics; Graph","score_opus":0.032919959704339155,"score_gpt":0.2787629024567095,"score_spread":0.24584294275237034,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W110328050","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9633634,0.00007372893,0.00007502072,0.00022124259,0.0021617974,0.00041191073,0.000017239629,0.00014948222,0.033526152],"genre_scores_gemma":[0.9982328,0.000011547448,0.00082144723,0.00028647014,0.0000142032595,0.000061274426,0.000004892151,0.00003461239,0.00053278694],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990763,0.000061788945,0.00020734676,0.00021441458,0.00018021188,0.0002599016],"domain_scores_gemma":[0.99858916,0.000794279,0.0000865704,0.00040398448,0.000057996367,0.00006801068],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026790373,0.00015619888,0.00018861721,0.0000576088,0.00027662687,0.000027707352,0.0001902631,0.000107631626,0.00036087804],"category_scores_gemma":[0.00040526496,0.00012722374,0.00012792714,0.00009541551,0.00006995193,0.00006685391,0.00003858359,0.00012295025,0.00003831638],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028049317,0.000118221615,0.000045009343,0.00002628058,0.00003098815,0.0000021331941,0.00061053433,0.0000011504994,0.00001933503,0.96646994,0.031422902,0.0012254737],"study_design_scores_gemma":[0.00085927086,0.00019219371,0.00006149298,0.000024307355,0.000029550138,0.000003608701,0.000035909095,0.00031701368,0.00094865065,0.9948321,0.0025280563,0.0001678399],"about_ca_topic_score_codex":7.444077e-7,"about_ca_topic_score_gemma":7.5823925e-7,"teacher_disagreement_score":0.03486934,"about_ca_system_score_codex":0.00003220938,"about_ca_system_score_gemma":0.0000035208463,"threshold_uncertainty_score":0.5188034},"labels":[],"label_agreement":null},{"id":"W112565541","doi":"","title":"Ramsey Numbers r(C5, G) for all Graphs G of Order Six.","year":2000,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Order (exchange); Ramsey's theorem; Discrete mathematics; Graph; Business","score_opus":0.019324165387974192,"score_gpt":0.2875337660461576,"score_spread":0.2682096006581834,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W112565541","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9787868,0.00008863192,0.00002071894,0.00007848067,0.0011145691,0.0004085038,0.00002088656,0.00007888781,0.019402469],"genre_scores_gemma":[0.99430466,0.000036026482,0.0042267996,0.00017431256,0.000011007768,0.00003042063,0.000008697186,0.000043032727,0.001165059],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988473,0.00005798572,0.00035659896,0.00022560572,0.00021495209,0.0002975795],"domain_scores_gemma":[0.9987205,0.0004665596,0.00012211261,0.00048330906,0.00012865635,0.00007886334],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003220926,0.00018349648,0.00033050307,0.00006253529,0.00012562063,0.000014731973,0.0003229425,0.00014507878,0.00060113694],"category_scores_gemma":[0.0001854944,0.0001587974,0.0001856965,0.00021700155,0.00012940576,0.000079242775,0.000039972198,0.0001281365,0.000008378926],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000080646096,0.00011812105,0.00049083336,0.00008211733,0.00012235821,0.0000016026463,0.0008512147,0.0000022531242,0.000075690165,0.9857859,0.010658509,0.0017307646],"study_design_scores_gemma":[0.0012888121,0.0001146631,0.00021561568,0.000023680472,0.0000700601,0.000004226203,0.00006574061,0.000032597058,0.00095284893,0.9841685,0.01287255,0.00019066317],"about_ca_topic_score_codex":0.00001868001,"about_ca_topic_score_gemma":0.0000048556712,"teacher_disagreement_score":0.01823741,"about_ca_system_score_codex":0.000016249443,"about_ca_system_score_gemma":0.000023301081,"threshold_uncertainty_score":0.65820277},"labels":[],"label_agreement":null},{"id":"W11278350","doi":"10.1074/jbc.m007560200","title":"A Note on multicolor bipartite Ramsey numbers for K_{2, n}.","year":2003,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"National Institute of Diabetes and Digestive and Kidney Diseases; National Institute of General Medical Sciences","keywords":"Mathematics; Bipartite graph; Ramsey's theorem; Combinatorics; Arithmetic; Discrete mathematics","score_opus":0.02821047530836589,"score_gpt":0.3097200164003997,"score_spread":0.2815095410920338,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W11278350","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97708786,0.000037337642,0.0002325813,0.0001195245,0.004243042,0.0007862351,0.000016373218,0.00015192738,0.017325142],"genre_scores_gemma":[0.99095494,0.0000051519883,0.0076893326,0.00036573724,0.000017132046,0.00009543862,0.0000030444533,0.000053574917,0.0008156688],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99869156,0.00011103868,0.0002876236,0.00029916625,0.00021740825,0.00039322788],"domain_scores_gemma":[0.9980349,0.0011291328,0.00012273512,0.0005071997,0.00008787426,0.00011818729],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004790128,0.00022165467,0.00029123324,0.00007322706,0.00030168233,0.000036398986,0.00021939061,0.0001605627,0.000082037084],"category_scores_gemma":[0.0014123555,0.0001876728,0.00017816522,0.0001549701,0.00008508784,0.00006645251,0.000036748166,0.00018563448,0.000030464407],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000073923424,0.00015738435,0.00029203983,0.000046274068,0.000046647754,0.000003913353,0.00069317047,0.000004253878,0.00014787145,0.9915253,0.006682819,0.00032640135],"study_design_scores_gemma":[0.0019178832,0.00018816686,0.00010662774,0.000029589539,0.00004519989,0.0000042256834,0.0000583022,0.00009614626,0.0050105783,0.9665451,0.025754282,0.00024390622],"about_ca_topic_score_codex":0.0000035660603,"about_ca_topic_score_gemma":0.0000035446517,"teacher_disagreement_score":0.02498021,"about_ca_system_score_codex":0.00005830407,"about_ca_system_score_gemma":0.00003214014,"threshold_uncertainty_score":0.7653075},"labels":[],"label_agreement":null},{"id":"W121029182","doi":"","title":"Application of Upper and Lower Bounds for the Domination Number to Vizing's Conjecture.","year":2003,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Conjecture; Domination analysis; Combinatorics; Upper and lower bounds; Mathematical analysis","score_opus":0.011756391269372562,"score_gpt":0.28477292846113883,"score_spread":0.2730165371917663,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W121029182","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9870029,0.0000832006,0.006907618,0.00023464639,0.0011306701,0.0008347866,0.0000069967623,0.000024977087,0.0037742238],"genre_scores_gemma":[0.9972096,0.0000060003413,0.0024127143,0.00012331853,0.000009034704,0.00008482928,0.0000012236712,0.000017267463,0.00013598536],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993908,0.000041280757,0.00017729485,0.00014599496,0.00012172495,0.0001229487],"domain_scores_gemma":[0.9987469,0.0007350986,0.000089523586,0.00029299487,0.00010078072,0.000034703844],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044246038,0.00009788992,0.0001429988,0.00002817769,0.00018531898,0.000020587922,0.000115790885,0.00007186577,0.000023022874],"category_scores_gemma":[0.0003789515,0.000066697394,0.000053653905,0.00011018318,0.00007040121,0.000041306677,0.00004138295,0.00006292121,0.0000017762393],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024824438,0.000033067514,0.0011166178,0.000030087538,0.000028193632,7.3007776e-8,0.0006432158,0.0000010046211,0.0003010504,0.99563956,0.00093821215,0.0012440612],"study_design_scores_gemma":[0.0005374031,0.00004980521,0.0010440464,0.000008010229,0.00004063421,0.000004208421,0.00008658785,0.000058223697,0.0039335196,0.9831045,0.011045677,0.000087352026],"about_ca_topic_score_codex":0.000003925205,"about_ca_topic_score_gemma":0.000001663156,"teacher_disagreement_score":0.012535059,"about_ca_system_score_codex":0.000017093857,"about_ca_system_score_gemma":0.000011634489,"threshold_uncertainty_score":0.27198407},"labels":[],"label_agreement":null},{"id":"W132858928","doi":"","title":"Distance between two k-sets and Path-Systems Extendibility.","year":2006,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Combinatorics; Mathematics; Path graph; Vertex (graph theory); Graph; Induced path; Disjoint sets; Path (computing); Connectivity; Bound graph; Discrete mathematics; Distance; Graph power; Shortest path problem; Line graph; Computer science","score_opus":0.01747837690461657,"score_gpt":0.2805900898952599,"score_spread":0.26311171299064334,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W132858928","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9890989,0.0006866203,0.00013392387,0.0000356333,0.0012654905,0.00026171948,0.000028269704,0.00011563376,0.008373819],"genre_scores_gemma":[0.9990434,0.0000083060795,0.00050151494,0.0000127462645,0.000045980454,0.000015426109,0.0000086254395,0.000029531642,0.00033446867],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986541,0.00012559212,0.00035846847,0.00032376012,0.00024884127,0.00028923166],"domain_scores_gemma":[0.99870473,0.0004926108,0.00013629676,0.0005282274,0.000058712427,0.000079392164],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004572306,0.00019728903,0.00033188486,0.000046271383,0.00025464277,0.000064913336,0.00020419675,0.00009324114,0.0000125302295],"category_scores_gemma":[0.000100224315,0.00016563988,0.00006336392,0.00012478959,0.00015091385,0.00010295511,0.00011770432,0.00016944532,0.000004255133],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006860078,0.000036458307,0.056184128,0.000067241526,0.000019328627,0.0000086511545,0.00014660532,5.57559e-7,0.000017819155,0.9414068,0.0016176867,0.00048786143],"study_design_scores_gemma":[0.00070282107,0.000035418456,0.025910707,0.000035193323,0.00003372729,0.0000057214907,0.000039220802,0.000039462924,0.00007300827,0.9701845,0.0027363156,0.00020387617],"about_ca_topic_score_codex":0.00010197626,"about_ca_topic_score_gemma":0.000008121409,"teacher_disagreement_score":0.03027342,"about_ca_system_score_codex":0.00003745023,"about_ca_system_score_gemma":0.000011932203,"threshold_uncertainty_score":0.6754598},"labels":[],"label_agreement":null},{"id":"W141504791","doi":"10.1007/978-1-4614-5392-5_2","title":"ε-Kronecker Sets","year":2012,"lang":"en","type":"book-chapter","venue":"CMS books in mathematics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; University of British Columbia","funders":"","keywords":"Computer science","score_opus":0.05894320541362806,"score_gpt":0.29600292702385045,"score_spread":0.23705972161022237,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W141504791","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006776533,0.0014455332,0.00037362578,0.000029569324,0.0007248804,0.0007307209,0.000055568064,0.00013836045,0.9958241],"genre_scores_gemma":[0.0056229704,0.000312111,0.0712995,0.00016374298,0.00061565335,0.00004438443,0.000028063234,0.00052007043,0.9213935],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970268,0.000035154662,0.0011757098,0.00046548975,0.0006471114,0.0006497146],"domain_scores_gemma":[0.99689734,0.0006797494,0.00065538456,0.0014906753,0.000091065085,0.00018576806],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00089013943,0.00081532844,0.0011966961,0.00036867725,0.00016132258,0.00004797093,0.0006820339,0.00095856836,0.0025556255],"category_scores_gemma":[0.00024220206,0.00069620705,0.00039337386,0.000036088066,0.0003218386,0.00010355228,0.0004598659,0.0011006753,0.00032697927],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007179444,0.000064861444,0.000009751687,0.0007791246,0.000119913646,0.0000368135,0.002861851,4.2470091e-7,0.0000066393945,0.98749256,0.005256666,0.0033641974],"study_design_scores_gemma":[0.00027778867,0.000025775287,0.0000046724545,0.0008064214,0.0001916346,0.00006540476,0.00005794499,0.000039370243,0.0000390243,0.9083543,0.089428745,0.0007089433],"about_ca_topic_score_codex":8.07882e-7,"about_ca_topic_score_gemma":0.00000842926,"teacher_disagreement_score":0.08417208,"about_ca_system_score_codex":0.00016643446,"about_ca_system_score_gemma":0.00006015826,"threshold_uncertainty_score":0.9995489},"labels":[],"label_agreement":null},{"id":"W1494111593","doi":"10.1007/s00373-016-1700-4","title":"A Tight Upper Bound on Acquaintance Time of Graphs","year":2016,"lang":"en","type":"article","venue":"Graphs and Combinatorics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Conjecture; Upper and lower bounds; Multiplicative function; Vertex (graph theory); Graph; Discrete mathematics; Mathematical analysis","score_opus":0.013483029321444037,"score_gpt":0.24491935892343747,"score_spread":0.23143632960199342,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1494111593","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99266064,0.00036241257,0.000108936554,0.00014024579,0.0003738507,0.00015257136,0.000022151846,0.00006524409,0.006113932],"genre_scores_gemma":[0.9982413,0.00027463285,0.00016031545,0.00010302414,0.000010164787,0.000008897402,7.590028e-7,0.000025204065,0.0011756696],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99887687,0.00006064202,0.0002791343,0.00025831425,0.0002704342,0.00025460604],"domain_scores_gemma":[0.9987611,0.00046476533,0.00014752902,0.00044443188,0.000086757114,0.0000954158],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025842863,0.000201398,0.00031406418,0.00016742876,0.00018490024,0.000016864473,0.0002183298,0.00012413727,0.00009835814],"category_scores_gemma":[0.000103550025,0.00012068012,0.00014382557,0.00027635216,0.00025648758,0.00007416007,0.00008085969,0.0001019592,0.0000063152133],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004237848,0.000095560215,0.0031734619,0.000042340085,0.0000514941,0.0000039240786,0.00027289084,2.1244782e-8,0.0006462942,0.9920178,0.0017823491,0.001871509],"study_design_scores_gemma":[0.0007243805,0.00023271154,0.0026314184,0.00009638194,0.000031413765,0.0000073908977,0.000025656604,0.0000048307757,0.0022625795,0.99237823,0.0014113723,0.0001936499],"about_ca_topic_score_codex":0.0000021241246,"about_ca_topic_score_gemma":4.393981e-7,"teacher_disagreement_score":0.0055806777,"about_ca_system_score_codex":0.000014852176,"about_ca_system_score_gemma":0.0000130980925,"threshold_uncertainty_score":0.49211925},"labels":[],"label_agreement":null},{"id":"W1497318709","doi":"10.37236/506","title":"On a Generalization of Meyniel's Conjecture on the Cops and Robbers Game","year":2011,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":23,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Combinatorics; Mathematics; Conjecture; Omega; Graph; Upper and lower bounds; Generalization; Discrete mathematics; Physics; Mathematical analysis","score_opus":0.027189800630967837,"score_gpt":0.2455228207970944,"score_spread":0.21833302016612655,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1497318709","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9938199,0.0009222102,0.0017942822,0.0003965178,0.0003223449,0.0001576292,0.0000010898841,0.000007866613,0.0025781856],"genre_scores_gemma":[0.9991641,0.00043139528,0.000019768484,0.00021798396,0.000043426502,0.0000012906381,1.6548836e-7,0.000018188382,0.000103704646],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987947,0.00024663116,0.00032492037,0.000074112984,0.00031971867,0.00023995932],"domain_scores_gemma":[0.9983468,0.0007052325,0.0005045625,0.00027919444,0.00012899727,0.00003519191],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010969234,0.00013756509,0.00023942301,0.00007452765,0.00013787666,0.000011537967,0.0003739123,0.00007481525,0.00003884634],"category_scores_gemma":[0.00029028347,0.00006445089,0.00010100397,0.00017312978,0.00012984729,0.000038687725,0.00003694377,0.0005646906,3.942535e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014599193,0.00006714481,0.000041688352,0.000012096015,0.00012538735,0.000001786067,0.0024942264,0.000020084444,0.000070499336,0.99614906,0.0007401661,0.00013184368],"study_design_scores_gemma":[0.00051917805,0.0010342677,0.00015557487,0.000038913407,0.000093035975,0.00007149787,0.00015695284,0.000046259018,0.0041119223,0.993428,0.0002713241,0.00007308328],"about_ca_topic_score_codex":0.0000027286678,"about_ca_topic_score_gemma":0.0000018360932,"teacher_disagreement_score":0.005344203,"about_ca_system_score_codex":0.00006666062,"about_ca_system_score_gemma":0.000082738676,"threshold_uncertainty_score":0.2628231},"labels":[],"label_agreement":null},{"id":"W1504941748","doi":"10.37236/1175","title":"On Ryser's conjecture","year":2012,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Conjecture; Hypergraph; Cover (algebra); Matching (statistics); Statistics","score_opus":0.016473878180495057,"score_gpt":0.2854909058667473,"score_spread":0.26901702768625224,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1504941748","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9848607,0.004171911,0.0027485124,0.0005864107,0.0018588613,0.0001205868,7.6132113e-7,0.000021796652,0.005630458],"genre_scores_gemma":[0.998917,0.00017081102,0.000020683428,0.00021829347,0.00034371423,9.918554e-7,1.3746208e-7,0.000024786534,0.0003036006],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99841887,0.00019246021,0.00032739778,0.000056006615,0.00041510287,0.0005901468],"domain_scores_gemma":[0.99821424,0.0008962357,0.00038689803,0.00030961612,0.00010248309,0.00009051182],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017127832,0.00015495573,0.00025937826,0.000081240745,0.00022784573,0.000016722193,0.0005062387,0.00008837271,0.000055445555],"category_scores_gemma":[0.00038016232,0.00008249711,0.00017843251,0.00019503442,0.00006693724,0.00010688354,0.000050424525,0.0010127053,0.000004692637],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005935302,0.00010800381,0.00014899106,0.000008261176,0.00011385268,0.0000019261402,0.00074933295,0.000004448626,0.000025565261,0.99511164,0.0034649072,0.00020370715],"study_design_scores_gemma":[0.00052806444,0.00043863145,0.00015384407,0.000017029615,0.00008748445,0.00028703653,0.00009321164,0.0000029937657,0.00092805194,0.9905675,0.0067951186,0.000101056394],"about_ca_topic_score_codex":4.5295334e-7,"about_ca_topic_score_gemma":3.2843096e-7,"teacher_disagreement_score":0.014056279,"about_ca_system_score_codex":0.00016750253,"about_ca_system_score_gemma":0.00009768441,"threshold_uncertainty_score":0.43997568},"labels":[],"label_agreement":null},{"id":"W1504968429","doi":"10.37236/3144","title":"Cores of Vertex Transitive Graphs","year":2013,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Transitive relation; Discrete mathematics; Cayley graph; Graph","score_opus":0.010838545790543492,"score_gpt":0.2492117707299721,"score_spread":0.2383732249394286,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1504968429","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99383336,0.0018035244,0.0011831784,0.00026939233,0.0004166331,0.00015812853,8.237854e-7,0.000009279235,0.0023256917],"genre_scores_gemma":[0.99933285,0.00043750787,0.000028138758,0.000042922813,0.000029291952,0.0000019600598,1.3171872e-7,0.000018393099,0.00010881029],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985496,0.00016936401,0.00048001815,0.000065937114,0.00038284776,0.00035224934],"domain_scores_gemma":[0.99813014,0.00068700535,0.000486138,0.00024821743,0.00039646108,0.000052011612],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00080879754,0.00013571393,0.00034511683,0.00010915718,0.000108867505,0.000012479174,0.00052020786,0.00006910714,0.00004822259],"category_scores_gemma":[0.00018331756,0.00007798037,0.0002177832,0.0002695317,0.00016465462,0.000097492804,0.000033442837,0.0005778164,8.8171856e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000043726075,0.00008149415,0.00015580736,0.000020776319,0.00019924999,0.0000017154349,0.0012531854,0.0000019005386,0.0005557582,0.99675584,0.00049953826,0.0004310142],"study_design_scores_gemma":[0.0006232904,0.0005213854,0.0006236923,0.000031467236,0.00011239265,0.000100502584,0.00037042252,0.000031591753,0.003868758,0.99350345,0.00012649785,0.00008656433],"about_ca_topic_score_codex":0.000008413709,"about_ca_topic_score_gemma":0.0000015914254,"teacher_disagreement_score":0.005499495,"about_ca_system_score_codex":0.00006417091,"about_ca_system_score_gemma":0.00013327156,"threshold_uncertainty_score":0.3179947},"labels":[],"label_agreement":null},{"id":"W1509033261","doi":"10.48550/arxiv.1307.1148","title":"Forbidden Families of Configurations","year":2013,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"TRACE (psycholinguistics); Combinatorics; Permutation (music); Matrix (chemical analysis); Simple (philosophy); Mathematics; Function (biology); Physics; Linguistics; Philosophy","score_opus":0.11384300798870196,"score_gpt":0.21828117398957436,"score_spread":0.1044381660008724,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1509033261","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94690645,0.000042350697,0.010257652,0.000017430311,0.00042095382,0.00037682772,0.00007685929,0.00009362158,0.041807838],"genre_scores_gemma":[0.99555457,0.00015352354,0.00094746577,0.000021699636,0.000058670543,0.000001255972,0.0000158694,0.000023815113,0.0032231421],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990069,0.00009059181,0.00024850926,0.00039253812,0.00006993527,0.00019152749],"domain_scores_gemma":[0.9982492,0.00029248942,0.00032423908,0.0008523789,0.00020879257,0.000072924246],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001278376,0.00023593823,0.00039431237,0.00020278411,0.000138947,0.00001947129,0.00059604255,0.00031159323,0.00041992846],"category_scores_gemma":[0.00011689704,0.00023066065,0.00025839824,0.00016145942,0.0002650963,0.000094412266,0.0006509877,0.00036440438,0.000017400645],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001407979,0.000038204216,0.00056081265,0.00021343955,0.00016377165,0.00001129667,0.0006201953,0.0013294806,0.000062256346,0.99555475,0.0013267614,0.000104927225],"study_design_scores_gemma":[0.00023248786,0.000023843128,0.00062061625,0.00008105632,0.0001751554,0.0000014958877,0.00056754256,0.0034502097,0.00037281826,0.99384123,0.00038577066,0.00024774484],"about_ca_topic_score_codex":0.000113844566,"about_ca_topic_score_gemma":0.000027183492,"teacher_disagreement_score":0.04864809,"about_ca_system_score_codex":0.00004278732,"about_ca_system_score_gemma":0.00006882939,"threshold_uncertainty_score":0.9406068},"labels":[],"label_agreement":null},{"id":"W1513878650","doi":"10.1007/978-1-4614-7254-4_23","title":"Paul Erdős’ Set Theory","year":2013,"lang":"hu","type":"book-chapter","venue":"","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Set (abstract data type); Universal set; Subject (documents); Set theory; Mathematics; Computer science; Mathematical economics; Epistemology; Philosophy; Library science; Programming language","score_opus":0.041553756918966206,"score_gpt":0.2694626750084311,"score_spread":0.22790891808946487,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1513878650","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00079989753,0.0013579439,0.001613175,0.00018609832,0.0022594016,0.0010882712,0.00028182467,0.00028997834,0.9921234],"genre_scores_gemma":[0.04211067,0.00087941164,0.0051607247,0.0014471408,0.0011261875,0.000026628832,0.000077343764,0.00035631136,0.9488156],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9960696,0.00019725345,0.0011987388,0.00095772994,0.0007521616,0.0008245266],"domain_scores_gemma":[0.99464643,0.0017770602,0.00066742377,0.0022520071,0.00028853337,0.00036855985],"candidate_categories":["metaepi_narrow","research_integrity","insufficient_payload"],"consensus_categories":["metaepi_narrow","insufficient_payload"],"category_scores_codex":[0.0010361896,0.0013134034,0.0013649707,0.0003025541,0.0006868411,0.0001864441,0.001130232,0.001598967,0.21090442],"category_scores_gemma":[0.00023395361,0.0009504083,0.00091115537,0.000046924346,0.0008752432,0.00017293655,0.0008889853,0.001383821,0.006696055],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000048406684,0.000026911983,0.0000040601694,0.00036823133,0.000739194,0.000047690555,0.0011320258,4.4986226e-7,0.000009766211,0.9243145,0.064298555,0.00901021],"study_design_scores_gemma":[0.00034737933,0.000103396356,0.000009981408,0.00027055366,0.00042079075,0.00007138748,0.00028788578,0.000022866148,0.000069477945,0.78659993,0.21079934,0.0009970114],"about_ca_topic_score_codex":0.000012401888,"about_ca_topic_score_gemma":0.000007284257,"teacher_disagreement_score":0.20420837,"about_ca_system_score_codex":0.00007692646,"about_ca_system_score_gemma":0.00007330123,"threshold_uncertainty_score":0.99996173},"labels":[],"label_agreement":null},{"id":"W1517176311","doi":"10.1007/11944836_14","title":"Zero Error List-Decoding Capacity of the q/(q–1) Channel","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Combinatorics; Conjecture; Context (archaeology); Zero (linguistics); Physics; Omega; Mathematics; Discrete mathematics; Quantum mechanics","score_opus":0.04426056993050859,"score_gpt":0.2666411813092641,"score_spread":0.22238061137875553,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1517176311","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010233814,0.00018478831,0.9697894,0.00020561565,0.0032725644,0.00052262057,0.000037824346,0.000068502886,0.015684875],"genre_scores_gemma":[0.94895524,0.0000061352653,0.049419403,0.0004189852,0.00041511323,0.0000034763548,0.0000012721654,0.000046707064,0.0007336782],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975833,0.000042802356,0.0005417602,0.0006417745,0.0007639805,0.00042633212],"domain_scores_gemma":[0.9973876,0.00074880343,0.0004737848,0.0011587604,0.00017025486,0.000060795348],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007871137,0.00041349427,0.0005451088,0.0003114646,0.0003830211,0.00006603678,0.0017754586,0.00034611777,0.00003076031],"category_scores_gemma":[0.00027494453,0.0002681594,0.00025919636,0.00028354628,0.0015524414,0.00010097122,0.0009045107,0.00078956346,0.0000012438885],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024601193,0.00008143012,0.00029227434,0.0005915398,0.000067893874,0.000026295356,0.005014258,0.013668598,0.00059611537,0.92577213,0.00083667773,0.053028204],"study_design_scores_gemma":[0.00012677428,0.000035063185,0.00009856382,0.00040490404,0.00002266509,0.000028162094,2.0275853e-7,0.01071553,0.0027198042,0.9852528,0.000281257,0.00031427585],"about_ca_topic_score_codex":0.000035520356,"about_ca_topic_score_gemma":0.000093623734,"teacher_disagreement_score":0.9387214,"about_ca_system_score_codex":0.00012752274,"about_ca_system_score_gemma":0.00011890782,"threshold_uncertainty_score":0.99997705},"labels":[],"label_agreement":null},{"id":"W1517376969","doi":"10.37236/1844","title":"Bounds on the Turán Density of ${\\rm PG}(3,2)$","year":2004,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.017657423144434477,"score_gpt":0.2631549794956275,"score_spread":0.24549755635119302,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1517376969","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9926855,0.0009292403,0.0016590855,0.0015974711,0.00059894315,0.0001307179,6.6089433e-7,0.000009802641,0.0023886038],"genre_scores_gemma":[0.99917716,0.000317506,0.000028373981,0.00019593778,0.00011154563,9.575914e-7,1.151675e-7,0.000020941527,0.00014745191],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99824476,0.0001879443,0.00048609357,0.000084062114,0.0005857978,0.0004113379],"domain_scores_gemma":[0.99766976,0.00087510754,0.000645382,0.00049334194,0.00026804753,0.00004835099],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021000726,0.00016781312,0.00033099914,0.000076565404,0.00033261196,0.00002311489,0.0008402689,0.00008490802,0.000020975447],"category_scores_gemma":[0.0005158158,0.0000799345,0.000256303,0.0002878785,0.00020381238,0.000060411952,0.00008008212,0.0010606581,0.0000021721255],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009451995,0.00014796715,0.000070981674,0.000013216961,0.00015117977,0.0000048579845,0.00095144287,0.000018850767,0.00017944939,0.99776804,0.0004972466,0.00010223295],"study_design_scores_gemma":[0.0006906541,0.00067928137,0.00025911193,0.00004593044,0.00010489801,0.00017670455,0.000191,0.000003793254,0.011101241,0.985844,0.0008139567,0.00008942525],"about_ca_topic_score_codex":0.0000042857428,"about_ca_topic_score_gemma":0.000003891189,"teacher_disagreement_score":0.011924051,"about_ca_system_score_codex":0.0002656048,"about_ca_system_score_gemma":0.0003114703,"threshold_uncertainty_score":0.46080905},"labels":[],"label_agreement":null},{"id":"W1532975866","doi":"10.1214/16-aop1094","title":"Local algorithms for independent sets are half-optimal","year":2017,"lang":"en","type":"article","venue":"The Annals of Probability","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":85,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Asymptotically optimal algorithm; Infinity; Discrete mathematics; Upper and lower bounds; Random graph; Poisson distribution; Tree (set theory); Algorithm; Statistics; Graph","score_opus":0.22137340332838445,"score_gpt":0.4079639967249845,"score_spread":0.18659059339660006,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1532975866","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9786025,0.00010877121,0.014647995,0.003558472,0.00041197767,0.0010693358,0.00011538291,0.000045372915,0.0014401525],"genre_scores_gemma":[0.9898924,0.000008149967,0.009682615,0.00011884503,0.00010892042,0.000046342033,0.0000015897804,0.000016103548,0.00012500442],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99872637,0.00011368228,0.0003484137,0.00025565593,0.00027095815,0.0002849326],"domain_scores_gemma":[0.99714214,0.00042615843,0.0004751569,0.001582517,0.0003102459,0.00006379781],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022774716,0.00015994738,0.0003283813,0.00002046772,0.000687243,0.000047059108,0.0009378699,0.0001150399,0.000041635238],"category_scores_gemma":[0.0014277138,0.00009613564,0.0002535998,0.00002397985,0.00073860906,0.00011740568,0.0003603352,0.00017039488,0.000001764532],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006155348,0.00048034644,0.003149893,0.0008606079,0.0002939009,0.000003422228,0.0025973625,0.000116143776,0.00006459555,0.948722,0.0068580406,0.03623817],"study_design_scores_gemma":[0.00029899442,0.00009989676,0.014007584,0.000034516008,0.000031690593,0.0000037204131,0.0001399037,0.0005199336,0.0051285094,0.9788679,0.0007442593,0.00012307511],"about_ca_topic_score_codex":0.000035402318,"about_ca_topic_score_gemma":0.00004279398,"teacher_disagreement_score":0.036115095,"about_ca_system_score_codex":0.000011966986,"about_ca_system_score_gemma":0.00003165406,"threshold_uncertainty_score":0.5285787},"labels":[],"label_agreement":null},{"id":"W1533352408","doi":"10.37236/707","title":"An Erdős-Ko-Rado Theorem for Multisets","year":2011,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Element (criminal law); Discrete mathematics; Law","score_opus":0.038360408509622294,"score_gpt":0.3028242215553487,"score_spread":0.2644638130457264,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1533352408","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9401527,0.0019061406,0.052688867,0.0001583143,0.0014679023,0.0004674212,0.0000051688135,0.000049986033,0.0031034674],"genre_scores_gemma":[0.99869996,0.0001935753,0.00066155585,0.00007969952,0.00017948958,0.000005368571,5.2247293e-7,0.000044739973,0.00013506413],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99828666,0.00021288444,0.00049125165,0.0001189714,0.00031581233,0.0005744],"domain_scores_gemma":[0.9980076,0.0005563495,0.00054234953,0.00048393343,0.00030838972,0.0001013806],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022136027,0.0001932272,0.0003365395,0.00009771827,0.00032385514,0.000024134199,0.0009897946,0.00010480439,0.000039787832],"category_scores_gemma":[0.00029495696,0.00011342228,0.0002477585,0.00016617117,0.0001230811,0.00017485647,0.000048718823,0.0006004542,0.0000011136341],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023298379,0.00019883741,0.00011024368,0.000018425459,0.00014472907,0.000003623803,0.0028166939,0.0000014012925,0.00011461447,0.99491733,0.00045727962,0.0009838346],"study_design_scores_gemma":[0.0010896747,0.0011874506,0.00021717403,0.000017319355,0.00015687186,0.00016349947,0.000321037,0.00008991283,0.002675879,0.9925157,0.0014141105,0.00015139463],"about_ca_topic_score_codex":0.0000021140124,"about_ca_topic_score_gemma":0.000002738241,"teacher_disagreement_score":0.05854725,"about_ca_system_score_codex":0.00012362894,"about_ca_system_score_gemma":0.00016739106,"threshold_uncertainty_score":0.4625226},"labels":[],"label_agreement":null},{"id":"W153491315","doi":"","title":"Asymptotically good choice numbers of multigraphs.","year":2001,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Mathematical economics","score_opus":0.019369932241194703,"score_gpt":0.2854565604757975,"score_spread":0.2660866282346028,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W153491315","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95078653,0.000072516734,0.000029001863,0.00007105014,0.0012285962,0.0001693049,0.000004214786,0.00009221816,0.047546543],"genre_scores_gemma":[0.99741906,0.000030058434,0.0019910748,0.00008022577,0.00001447153,0.0000070475644,0.0000018279516,0.000030575953,0.00042565135],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99868447,0.000089622336,0.00037791778,0.00022829782,0.000320998,0.0002987071],"domain_scores_gemma":[0.99827427,0.00078181387,0.00015709388,0.00054855796,0.00012704212,0.00011122991],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003120852,0.00018407573,0.0003215975,0.00008970356,0.00013223015,0.000014310145,0.00037192518,0.00014777598,0.00017694326],"category_scores_gemma":[0.0005846856,0.00015932239,0.00016885408,0.00031699927,0.00017355557,0.000090091045,0.00010973895,0.00020811745,0.000009303456],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022039798,0.00016416027,0.03549959,0.00004029331,0.000081565355,0.000007961398,0.00040901045,6.907654e-7,0.00023207409,0.96192026,0.00110143,0.000520898],"study_design_scores_gemma":[0.00096659025,0.00008338417,0.013406278,0.000035615813,0.000049490707,0.000013259705,0.00006468162,0.000023718216,0.0010775907,0.9814841,0.0026088257,0.0001864432],"about_ca_topic_score_codex":0.000037196645,"about_ca_topic_score_gemma":0.000012534857,"teacher_disagreement_score":0.04712089,"about_ca_system_score_codex":0.00001992781,"about_ca_system_score_gemma":0.000021615851,"threshold_uncertainty_score":0.64969784},"labels":[],"label_agreement":null},{"id":"W1536629256","doi":"10.37236/484","title":"A Tight Lower Bound for Convexly Independent Subsets of the Minkowski Sums of Planar Point Sets","year":2010,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"Japan Society for the Promotion of Science; Natural Sciences and Engineering Research Council of Canada; Nederlandse Organisatie voor Wetenschappelijk Onderzoek","keywords":"Combinatorics; Mathematics; Cardinality (data modeling); Upper and lower bounds; Minkowski space; Constant (computer programming); Function (biology); Planar; Point (geometry); Discrete mathematics; Mathematical analysis; Geometry","score_opus":0.01105788651696158,"score_gpt":0.264043747088684,"score_spread":0.2529858605717224,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1536629256","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99516153,0.00071605295,0.00082598435,0.0005065914,0.001914377,0.00035390575,0.000012316181,0.0000056852678,0.0005035801],"genre_scores_gemma":[0.9994913,0.00008066884,0.00007937991,0.000055320044,0.00008185125,0.0000032726161,5.0378924e-7,0.000029352897,0.00017839501],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979483,0.0001425892,0.0007520301,0.00010472031,0.0006164505,0.00043590053],"domain_scores_gemma":[0.9967301,0.0009401122,0.0012306155,0.00057343405,0.00046371957,0.00006203972],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022077216,0.00019024796,0.00047058606,0.00009180261,0.00019266712,0.000017286235,0.0010779665,0.0001606026,0.000032574764],"category_scores_gemma":[0.0004671329,0.00009867107,0.00039854526,0.00020646588,0.00026854777,0.00008043413,0.000085409294,0.0010768274,3.3805162e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023902021,0.00015434426,0.0003733355,0.0000723126,0.0002557735,0.000001940339,0.0009986474,0.0000011841996,0.0036253196,0.992763,0.0014385723,0.000076540004],"study_design_scores_gemma":[0.0013298511,0.0005165282,0.0005433962,0.000047452573,0.00019833124,0.0001884105,0.00013038222,0.000018638393,0.025952356,0.96936774,0.0015961833,0.00011073257],"about_ca_topic_score_codex":0.0000041862454,"about_ca_topic_score_gemma":0.000031134332,"teacher_disagreement_score":0.023395272,"about_ca_system_score_codex":0.000081494516,"about_ca_system_score_gemma":0.0004226569,"threshold_uncertainty_score":0.4678339},"labels":[],"label_agreement":null},{"id":"W1538770237","doi":"10.37236/3396","title":"Remarks on a Conjecture of Barát and Tóth","year":2014,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Fundação de Amparo à Pesquisa do Estado de São Paulo","keywords":"Combinatorics; Mathematics; Conjecture; Counterexample; Subdivision; Graph; Integer (computer science); Discrete mathematics; Computer science","score_opus":0.007093477513968651,"score_gpt":0.24895110354961106,"score_spread":0.2418576260356424,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1538770237","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9882824,0.0016222751,0.0040173745,0.00046929953,0.0003952101,0.000107469445,7.651391e-7,0.000009229072,0.005096008],"genre_scores_gemma":[0.99932307,0.00032196767,0.00004711199,0.000099940095,0.00009394794,4.7210992e-7,9.8267606e-8,0.000016760952,0.00009662399],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987444,0.00022864995,0.00036159388,0.0000745107,0.00032001286,0.00027078393],"domain_scores_gemma":[0.99804515,0.0010115952,0.0004793127,0.0002783217,0.00013601485,0.000049594593],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017233663,0.00013001035,0.0003343151,0.00008383478,0.00011724033,0.000011971341,0.00034209518,0.00008252172,0.000011170255],"category_scores_gemma":[0.0005463478,0.00007201118,0.000110455854,0.00013750204,0.00011448905,0.00003862927,0.00004992919,0.00067990605,2.5342794e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000096844255,0.00004440875,0.00012102465,0.000026714059,0.00008756373,0.0000011500431,0.00047099555,0.0000041023245,0.000093564275,0.9976553,0.0005280852,0.0008702627],"study_design_scores_gemma":[0.0008434412,0.0011304778,0.00028247887,0.00005412203,0.00008494844,0.00015769886,0.000064325926,0.00003071827,0.0012678675,0.99416405,0.0018416004,0.000078275625],"about_ca_topic_score_codex":8.6155455e-7,"about_ca_topic_score_gemma":0.0000010478768,"teacher_disagreement_score":0.011040708,"about_ca_system_score_codex":0.000052597265,"about_ca_system_score_gemma":0.00007951629,"threshold_uncertainty_score":0.29538912},"labels":[],"label_agreement":null},{"id":"W1543632961","doi":"","title":"Limits of Boolean Functions on F n","year":2014,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Mathematics; Combinatorics; Discrete mathematics; Vertex (graph theory); Limit of a sequence; Limit (mathematics); Sequence (biology); Subspace topology; Probability distribution; Probability measure; Graph","score_opus":0.11735605891738683,"score_gpt":0.21975667945528649,"score_spread":0.10240062053789965,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1543632961","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9357908,0.000017568818,0.017531853,0.000023634459,0.0009368249,0.00024832028,0.000072742325,0.00011484856,0.045263458],"genre_scores_gemma":[0.99391675,0.000040407125,0.00029988488,0.00006091515,0.0001355664,5.0887616e-7,0.000014948292,0.00003506204,0.0054959683],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987477,0.00013932656,0.0002432931,0.00055217295,0.00009215872,0.00022533251],"domain_scores_gemma":[0.99784446,0.00039392294,0.0003489146,0.0011820059,0.00012819831,0.000102512844],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00024788777,0.00028944106,0.0004385561,0.00026089355,0.00017006363,0.000013145842,0.0005888748,0.00036396174,0.00016064994],"category_scores_gemma":[0.00017455868,0.00028572622,0.00035579683,0.00018004491,0.00018432901,0.000039769402,0.0004887203,0.00059605326,0.000031008673],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009700767,0.0001041892,0.0006339807,0.00023501989,0.00019217569,0.000020699708,0.00018724958,0.012453225,0.00001645016,0.98328096,0.0025301024,0.0002489558],"study_design_scores_gemma":[0.00039340166,0.00012256662,0.00062093325,0.00019258996,0.00027924986,0.000001913313,0.000122036756,0.0037444984,0.00026894503,0.9922938,0.0016121946,0.0003478799],"about_ca_topic_score_codex":0.000015527714,"about_ca_topic_score_gemma":0.000013292352,"teacher_disagreement_score":0.05812599,"about_ca_system_score_codex":0.00006477213,"about_ca_system_score_gemma":0.00004624773,"threshold_uncertainty_score":0.99995947},"labels":[],"label_agreement":null},{"id":"W1544545299","doi":"10.37236/791","title":"$\\overline{\\cal R}(3,4)=17$","year":2008,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"Natural Sciences and Engineering Research Council of Canada; Mitacs","keywords":"Mathematics; Combinatorics; Overline; Line (geometry); State (computer science); Upper and lower bounds; Discrete mathematics; Physics; Geometry; Mathematical analysis; Algorithm","score_opus":0.024897423045848976,"score_gpt":0.27149773401503274,"score_spread":0.24660031096918378,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1544545299","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98243,0.002947035,0.007411225,0.00054316566,0.0009846803,0.0001163631,8.4902206e-7,0.000030022618,0.0055366615],"genre_scores_gemma":[0.9969219,0.00092802546,0.00007709876,0.00015693608,0.00028595602,9.5265153e-7,1.9221572e-7,0.000026347749,0.0016025968],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982079,0.00015140948,0.00050383084,0.000088847184,0.0005403653,0.00050759676],"domain_scores_gemma":[0.9983,0.0005777787,0.00045207026,0.0003509137,0.00024033694,0.00007886794],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011354256,0.00016779995,0.0003344332,0.000091602466,0.000408842,0.000012732423,0.0007088501,0.00008938889,0.000053931268],"category_scores_gemma":[0.00033689756,0.000097691074,0.00024808777,0.00027903146,0.00016217226,0.00011001736,0.00008387787,0.0010049845,0.0000032109049],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006766313,0.00008833331,0.00022112,0.000006923019,0.00011342771,0.000027552012,0.0006927469,0.0000065280447,0.00003988931,0.99012053,0.008484975,0.00013032393],"study_design_scores_gemma":[0.00074945454,0.00039697377,0.00029029348,0.00001164591,0.000070439375,0.001772001,0.00007106799,0.000021713216,0.0004911378,0.98269975,0.013306642,0.00011885415],"about_ca_topic_score_codex":0.0000013061617,"about_ca_topic_score_gemma":0.0000010711648,"teacher_disagreement_score":0.014491896,"about_ca_system_score_codex":0.00018499739,"about_ca_system_score_gemma":0.00028666283,"threshold_uncertainty_score":0.43662134},"labels":[],"label_agreement":null},{"id":"W1545103561","doi":"10.1023/a:1015254221022","title":"András Sárközy – a retrospective on the occasion of his sixtieth birthday","year":2001,"lang":"en","type":"article","venue":"Periodica Mathematica Hungarica","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Pure mathematics","score_opus":0.038821331116072506,"score_gpt":0.2862002606841279,"score_spread":0.2473789295680554,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1545103561","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.86846477,0.0002034906,0.0017110441,0.0023924175,0.00031778772,0.0010335807,0.00004081906,0.00025411748,0.12558201],"genre_scores_gemma":[0.9918094,0.00009594065,0.005433264,0.00026982915,0.00012882204,0.00006800128,0.0000021452734,0.000067089815,0.0021254923],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972287,0.0002546451,0.00074688124,0.00045444592,0.0008292541,0.00048608237],"domain_scores_gemma":[0.996125,0.0017423477,0.0004777561,0.0013510416,0.00017000957,0.00013387032],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0010926775,0.00039606844,0.000729425,0.00018496356,0.00072898995,0.00007191978,0.0007330046,0.00019628392,0.0021673033],"category_scores_gemma":[0.0022526074,0.00023082606,0.00035790348,0.0005530841,0.0006246277,0.000087800785,0.0002559552,0.0005041483,0.00006185742],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012186232,0.00039334272,0.000730291,0.0001578993,0.00014583579,0.000018828609,0.010042732,8.09362e-7,0.00087807456,0.9778147,0.00885839,0.0008372563],"study_design_scores_gemma":[0.0005120108,0.0004201991,0.002422486,0.0002289201,0.00013561327,0.00008949322,0.0010328579,0.00034028105,0.0014446658,0.9836053,0.0093773855,0.00039075117],"about_ca_topic_score_codex":0.00000753777,"about_ca_topic_score_gemma":0.000003968597,"teacher_disagreement_score":0.12345651,"about_ca_system_score_codex":0.00008698926,"about_ca_system_score_gemma":0.00005118608,"threshold_uncertainty_score":0.99874485},"labels":[],"label_agreement":null},{"id":"W1545253661","doi":"10.48550/arxiv.1305.0603","title":"Repeated columns and an old chestnut","year":2013,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Disjoint sets; Combinatorics; Conjecture; Multiplicity (mathematics); Mathematics; Bounded function; Integer (computer science); Matrix (chemical analysis); Family of sets; Discrete mathematics; Set (abstract data type); Computer science; Geometry","score_opus":0.1029443675093957,"score_gpt":0.21873487331997918,"score_spread":0.11579050581058348,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1545253661","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9900796,0.00003499925,0.0016355634,0.000018752593,0.00034142955,0.0004243462,0.00003172308,0.00023654327,0.0071970383],"genre_scores_gemma":[0.9921644,0.000087440974,0.0008699788,0.00007721487,0.00012284766,0.0000013799511,0.000020490452,0.000045642584,0.006610643],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99838156,0.00017514249,0.00021614901,0.0008451501,0.00007256927,0.0003094112],"domain_scores_gemma":[0.998011,0.00017030338,0.00025067627,0.0012053414,0.00013435987,0.00022832163],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00024891793,0.00034760204,0.00043598577,0.00017067046,0.0002627929,0.00008081458,0.0005770515,0.0005023614,0.00024252282],"category_scores_gemma":[0.00010009764,0.00035987672,0.00014422952,0.00016622066,0.00027368503,0.00017505267,0.0011221743,0.0006254177,0.000013712118],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004223121,0.000076021875,0.0033999418,0.00021887454,0.00016621598,0.00012236371,0.0006978114,0.0005320545,0.000023558496,0.99351746,0.0009951108,0.00020833628],"study_design_scores_gemma":[0.00041739582,0.000059746475,0.0017477575,0.00008343015,0.00020877215,0.000008763544,0.000234589,0.010204723,0.00010708048,0.98614645,0.00030801067,0.00047328146],"about_ca_topic_score_codex":0.00022068822,"about_ca_topic_score_gemma":0.00005693893,"teacher_disagreement_score":0.009672669,"about_ca_system_score_codex":0.00007492195,"about_ca_system_score_gemma":0.0000436705,"threshold_uncertainty_score":0.9998853},"labels":[],"label_agreement":null},{"id":"W1549301089","doi":"10.4153/cjm-2014-016-0","title":"On a Sumset Conjecture of Erdős","year":2014,"lang":"en","type":"article","venue":"Canadian Journal of Mathematics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"York University; American Institute of Mathematics; National Science Foundation","keywords":"Mathematics; Conjecture; Countable set; Natural density; Set (abstract data type); Discrete mathematics; Pseudorandom number generator; Combinatorics; Statistics","score_opus":0.020098637973211198,"score_gpt":0.2545995363139453,"score_spread":0.23450089834073407,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1549301089","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9832762,0.00010028989,0.0040651625,0.00021431959,0.0005511917,0.00011504202,0.000029087909,0.0000073539272,0.011641373],"genre_scores_gemma":[0.9833678,0.0000033525716,0.016166758,0.00016288907,0.00013497571,5.243814e-7,5.2672766e-7,0.000028083125,0.0001350866],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987531,0.00007750744,0.0006041099,0.00007501909,0.00025524167,0.00023503967],"domain_scores_gemma":[0.9975807,0.0009456269,0.0005909859,0.0003526269,0.00018593846,0.00034411295],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008653436,0.00015462485,0.00046403622,0.00028934563,0.00010584139,0.000020575308,0.00038618525,0.00011893911,0.000231952],"category_scores_gemma":[0.0021267943,0.0001107488,0.0001903932,0.00012114983,0.00014715438,0.000043364755,0.000013414068,0.0002809482,0.0000039042984],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006076958,0.000028577411,0.00015815707,0.00020250955,0.00007415619,0.000020367615,0.0027635326,0.000026259328,0.000043510983,0.9872906,0.008916762,0.0004694617],"study_design_scores_gemma":[0.00038373563,0.00024964398,0.00011313785,0.0002888302,0.00007288377,0.0002028247,0.00027662126,0.0000921988,0.0008211614,0.9943546,0.0030207785,0.00012356375],"about_ca_topic_score_codex":0.000044537,"about_ca_topic_score_gemma":0.00089523866,"teacher_disagreement_score":0.012101595,"about_ca_system_score_codex":0.00004567371,"about_ca_system_score_gemma":0.00023166428,"threshold_uncertainty_score":0.4516205},"labels":[],"label_agreement":null},{"id":"W1550173909","doi":"10.37236/1107","title":"Encores on Cores","year":2006,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":55,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Australian Research Council; Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Mathematics; Random graph; Combinatorics; Sequence (biology); Discrete mathematics; Simple (philosophy); Poisson distribution; Random regular graph; Degree (music); Graph; Line graph; Pathwidth; Statistics","score_opus":0.010959225790021314,"score_gpt":0.2607164635614196,"score_spread":0.24975723777139827,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1550173909","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98409086,0.0019642902,0.0019234578,0.00063714635,0.0008447539,0.00010671407,7.8538005e-7,0.000024383029,0.0104076],"genre_scores_gemma":[0.99886763,0.00019825058,0.00002296965,0.00007271029,0.00027667696,0.0000010760375,1.880407e-7,0.000020406473,0.0005400973],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986246,0.000107634034,0.00038214176,0.00007190932,0.0004289978,0.00038468582],"domain_scores_gemma":[0.99834335,0.00080609025,0.00040304236,0.0002738806,0.00014123223,0.00003240115],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009513105,0.00013827135,0.00023280074,0.00009600081,0.00027437232,0.00002480906,0.00054049067,0.000060298717,0.000022191127],"category_scores_gemma":[0.00019378413,0.00007572819,0.00016561602,0.00019182738,0.00009133861,0.000055793338,0.000041968106,0.0006314529,0.0000024809726],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007137537,0.00009898274,0.00030335903,0.000007987132,0.00004852944,0.00000731335,0.00013144354,0.000033674845,0.00002868865,0.99261606,0.0065307505,0.000121822995],"study_design_scores_gemma":[0.00049739564,0.00052164774,0.00060675346,0.0000223636,0.000054142467,0.0001317194,0.00004578862,0.000012077273,0.0012313602,0.9897944,0.006991687,0.00009069333],"about_ca_topic_score_codex":0.000004924813,"about_ca_topic_score_gemma":0.0000079386555,"teacher_disagreement_score":0.014776755,"about_ca_system_score_codex":0.00014459906,"about_ca_system_score_gemma":0.000100317855,"threshold_uncertainty_score":0.3088106},"labels":[],"label_agreement":null},{"id":"W1551680922","doi":"10.1007/978-0-387-26677-0_6","title":"Sequences of Integers","year":2004,"lang":"en","type":"book-chapter","venue":"Problem books in mathematics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Integer (computer science); Sequence (biology); Combinatorics; Mathematics; Prime (order theory); Discrete mathematics; Computer science; Chemistry; Programming language","score_opus":0.04135664302572321,"score_gpt":0.2815118348294226,"score_spread":0.2401551918036994,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1551680922","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00050469674,0.000607947,0.0009812932,0.000031797204,0.00018299416,0.00083062163,0.00004272329,0.00010159627,0.9967163],"genre_scores_gemma":[0.04172987,0.0006778467,0.49081764,0.00010314159,0.0002209797,0.000090173424,0.000019636938,0.00051713095,0.4658236],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972302,0.000024006766,0.0014327462,0.00039245948,0.0005748286,0.00034578796],"domain_scores_gemma":[0.99735314,0.00059484714,0.0010224963,0.00081706175,0.00013633967,0.000076091004],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007628298,0.000577361,0.0011518484,0.00036911215,0.00007627055,0.000023478344,0.00069316535,0.0005839395,0.00071254646],"category_scores_gemma":[0.0001488971,0.00047688538,0.00034296967,0.000043979868,0.0005110757,0.00006753817,0.00028114062,0.00075581035,0.000017882008],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000791472,0.000050134542,0.000004491605,0.0033274682,0.000100158075,0.000022947192,0.0034603951,0.000022637856,0.0000522123,0.9921562,0.00021184502,0.00058357324],"study_design_scores_gemma":[0.00029961174,0.00007573307,3.5833494e-7,0.003788889,0.00012613059,0.00002799616,0.00012375142,0.000021808259,0.00065563276,0.9932819,0.0011358064,0.0004623686],"about_ca_topic_score_codex":0.000006832786,"about_ca_topic_score_gemma":0.000019867839,"teacher_disagreement_score":0.5308927,"about_ca_system_score_codex":0.00018120502,"about_ca_system_score_gemma":0.00017534768,"threshold_uncertainty_score":0.99976826},"labels":[],"label_agreement":null},{"id":"W1557050186","doi":"10.5555/1496770.1496782","title":"Asymptotically optimal frugal colouring","year":2009,"lang":"en","type":"article","venue":"","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Neighbourhood (mathematics); Asymptotically optimal algorithm; Vertex (graph theory); Graph; Mathematics; Combinatorics; Binary logarithm; Constant (computer programming); Computer science; Discrete mathematics; Algorithm","score_opus":0.022859949423054162,"score_gpt":0.30403434982434485,"score_spread":0.2811744004012907,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1557050186","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.75820434,0.00001719301,0.008146878,0.0005624243,0.00015443626,0.00010377946,9.943313e-7,0.00020459757,0.23260532],"genre_scores_gemma":[0.92704874,0.0000019758645,0.07014113,0.0005527133,0.00010970447,0.0000010312004,3.505421e-7,0.000008071538,0.0021362586],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993147,0.000023736246,0.0001629147,0.00013606965,0.00015098386,0.00021158087],"domain_scores_gemma":[0.9995035,0.00014916675,0.000028573022,0.00021777286,0.00003134076,0.00006964251],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017499649,0.000099359495,0.00013459947,0.000037225996,0.00013581033,0.000025948588,0.00016368239,0.00007154761,0.00052513357],"category_scores_gemma":[0.0001484894,0.000072178234,0.00007073416,0.0000601907,0.000038014634,0.000054205047,0.000043474174,0.00012282653,0.000014586817],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014412966,0.000032869924,0.000080494705,0.0000043262644,0.000011309107,0.000007985526,0.00019708995,0.0000074853165,0.00021642161,0.99503773,0.002379164,0.0020107245],"study_design_scores_gemma":[0.00024774633,0.00011856374,0.0025523491,0.0000090835865,0.000016543947,0.000022328635,0.000051990835,0.00029112224,0.0017745389,0.9934982,0.0012691667,0.00014836759],"about_ca_topic_score_codex":5.023869e-7,"about_ca_topic_score_gemma":6.6926856e-7,"teacher_disagreement_score":0.23046906,"about_ca_system_score_codex":0.000012082683,"about_ca_system_score_gemma":0.000009970353,"threshold_uncertainty_score":0.57498443},"labels":[],"label_agreement":null},{"id":"W1561983737","doi":"","title":"On cross numbers of minimal zero sequences in certain cyclic groups","year":2004,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Integer (computer science); Upper and lower bounds; Set (abstract data type); Zero (linguistics); Discrete mathematics; Mathematical analysis","score_opus":0.019577989922383864,"score_gpt":0.300315737069441,"score_spread":0.2807377471470571,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1561983737","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99238276,0.000037693855,0.000006948303,0.000058825513,0.0012679668,0.00016495884,0.000006384313,0.000037902104,0.006036583],"genre_scores_gemma":[0.9992599,0.000007180537,0.00055195607,0.000067001085,0.000006339634,0.000010256489,0.0000019515294,0.000022376691,0.00007302574],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99874574,0.00007542884,0.00038608414,0.00023546147,0.0002790678,0.0002781917],"domain_scores_gemma":[0.9989455,0.0004387281,0.00015211452,0.000362926,0.000041410498,0.000059320882],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035809202,0.00017333432,0.00029252443,0.00010985325,0.00009643347,0.000020065274,0.00032791693,0.00013806175,0.00003538864],"category_scores_gemma":[0.00034533086,0.00014846494,0.00010353558,0.00023914145,0.00023113405,0.000095444215,0.00007273161,0.0002148904,0.0000063388993],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006982196,0.00016194585,0.00869448,0.000052608353,0.000022250659,0.000023459384,0.0020053813,0.000052335683,0.00023922675,0.98848814,0.00012398098,0.0000663898],"study_design_scores_gemma":[0.0014886602,0.00017253033,0.006842742,0.00008633803,0.000009058161,0.000005966371,0.00015931841,0.000004209948,0.004172896,0.9868767,0.000019599483,0.00016194751],"about_ca_topic_score_codex":0.000105877596,"about_ca_topic_score_gemma":0.00002804764,"teacher_disagreement_score":0.0068771746,"about_ca_system_score_codex":0.00008485613,"about_ca_system_score_gemma":0.00003780853,"threshold_uncertainty_score":0.60542244},"labels":[],"label_agreement":null},{"id":"W1564254624","doi":"10.1016/j.endm.2009.11.051","title":"The chromatic number of random lifts of","year":2009,"lang":"en","type":"article","venue":"Electronic Notes in Discrete Mathematics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University","funders":"","keywords":"Mathematics; Chromatic scale; Random graph; Friendship graph; Combinatorics; Lift (data mining); Discrete mathematics; Brooks' theorem; Independence number; Windmill graph; Independence (probability theory); Graph; Chordal graph; Statistics; Computer science; Graph power; 1-planar graph; Line graph","score_opus":0.011398609847135626,"score_gpt":0.3020878539338001,"score_spread":0.29068924408666447,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1564254624","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98378766,0.0007242518,0.008212191,0.00023058351,0.00008877327,0.0005735536,0.0000062042363,0.000041760108,0.0063350284],"genre_scores_gemma":[0.98888874,0.00017478231,0.010716909,0.000024232633,0.00003648597,0.000012238583,0.0000014148408,0.000027550255,0.00011762033],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99773544,0.00012848902,0.0010183891,0.00017469877,0.0004183085,0.0005246591],"domain_scores_gemma":[0.9953848,0.0031707226,0.000544062,0.00078989216,0.00007102519,0.000039504168],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012827781,0.00024211756,0.00064314593,0.000073662544,0.00012839393,0.000016927635,0.0005974553,0.00011493315,0.00006767245],"category_scores_gemma":[0.0017778706,0.00014975903,0.0002252782,0.00033249124,0.00025272556,0.00006702864,0.00008366841,0.00030193268,0.0000028983945],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000699604,0.00013811256,0.00021346853,0.00026098592,0.00007557894,0.0000012924083,0.002589178,0.000011349754,0.0006095247,0.993968,0.000064204534,0.0019983621],"study_design_scores_gemma":[0.00097529474,0.00012235485,0.00022828202,0.00022553922,0.00006353417,0.000019349098,0.00017049708,0.0011321271,0.008992306,0.9878513,0.000055504734,0.00016390282],"about_ca_topic_score_codex":0.000005234827,"about_ca_topic_score_gemma":0.00002069551,"teacher_disagreement_score":0.008382781,"about_ca_system_score_codex":0.000055430224,"about_ca_system_score_gemma":0.00007341071,"threshold_uncertainty_score":0.6106996},"labels":[],"label_agreement":null},{"id":"W1571206417","doi":"10.1002/jgt.22152","title":"Graph properties, graph limits, and entropy","year":2017,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; McGill University","funders":"Natural Sciences and Engineering Research Council of Canada; Knut och Alice Wallenbergs Stiftelse; Fonds Québécois de la Recherche sur la Nature et les Technologies","keywords":"Mathematics; Combinatorics; Random graph; Discrete mathematics; Limiting; Graph","score_opus":0.04169039496165616,"score_gpt":0.2858973154108309,"score_spread":0.24420692044917475,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1571206417","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9877133,0.00506346,0.0012437706,0.00041606717,0.0014592028,0.00023375853,0.000010884818,0.00004055185,0.0038190167],"genre_scores_gemma":[0.99433804,0.0017069448,0.0029114452,0.00021156463,0.00039229853,0.0000039008173,3.5167457e-7,0.000052029205,0.00038341782],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99772114,0.00034768353,0.0007702535,0.00024549357,0.00050529634,0.00041015435],"domain_scores_gemma":[0.9968042,0.0004039142,0.0013388741,0.00091063126,0.00028366386,0.00025873195],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024241223,0.00033729113,0.00064785493,0.00047399814,0.00126321,0.0002444402,0.0010252108,0.00018886803,0.00007912153],"category_scores_gemma":[0.0012450878,0.00021905996,0.0005016693,0.00011466194,0.0010099876,0.0005352365,0.00019782831,0.0006279181,0.0000016938762],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006186738,0.000120040044,0.003687233,0.00012486067,0.00047718504,0.000090391986,0.0014982761,9.902212e-7,0.0026761345,0.9820575,0.001908863,0.006739866],"study_design_scores_gemma":[0.0011462139,0.00028590875,0.0058598123,0.0002392183,0.0002462488,0.00044661437,0.00043548996,0.000002292478,0.0026301222,0.98685014,0.0015717364,0.00028622727],"about_ca_topic_score_codex":0.000004298077,"about_ca_topic_score_gemma":0.000004530818,"teacher_disagreement_score":0.00662476,"about_ca_system_score_codex":0.000019019892,"about_ca_system_score_gemma":0.0000515321,"threshold_uncertainty_score":0.97157174},"labels":[],"label_agreement":null},{"id":"W1573350772","doi":"10.1017/s0963548315000322","title":"Local Maxima of Quadratic Boolean Functions","year":2015,"lang":"en","type":"article","venue":"Combinatorics Probability Computing","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Trinity College","funders":"","keywords":"Maxima; Boolean function; Generalization; Quadratic equation; Maxima and minima; Function (biology); Quadratic function","score_opus":0.08224524302706783,"score_gpt":0.30350843026178137,"score_spread":0.22126318723471355,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1573350772","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.878552,0.00011812944,0.112694174,0.00006561361,0.0012132704,0.0003648731,0.0000045870693,0.00015355709,0.006833764],"genre_scores_gemma":[0.99257404,5.6028733e-7,0.007239554,0.000022419017,0.000044848555,0.0000034487055,0.0000033675196,0.000023425822,0.00008833858],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99815094,0.00021117549,0.0006207188,0.00031612784,0.00039974714,0.0003012606],"domain_scores_gemma":[0.99788606,0.0005461512,0.00025889184,0.00069306104,0.00044683315,0.00016902821],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015754367,0.00019825538,0.00040184284,0.00008596407,0.0002269777,0.00002163952,0.0003544818,0.00012221627,0.0000126722325],"category_scores_gemma":[0.0014294309,0.00017715851,0.00013985799,0.00042112978,0.00029773504,0.00008275188,0.00038001724,0.00029221427,0.0000055289624],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020813142,0.0003052081,0.0052083386,0.0002598916,0.00003594132,0.000002220258,0.0017030278,0.00025532037,0.000009772326,0.9881439,0.00078277016,0.0032727772],"study_design_scores_gemma":[0.0005604609,0.00016704218,0.0005717557,0.000042636068,0.000036962658,0.0000113989,0.00050984195,0.0058707944,0.00029440326,0.99142605,0.00032405433,0.00018460536],"about_ca_topic_score_codex":0.000014293149,"about_ca_topic_score_gemma":0.0000030349804,"teacher_disagreement_score":0.11402201,"about_ca_system_score_codex":0.0001718922,"about_ca_system_score_gemma":0.00011460065,"threshold_uncertainty_score":0.7224315},"labels":[],"label_agreement":null},{"id":"W1574374495","doi":"10.37236/4445","title":"Limits of Boolean Functions on $\\mathbb{F}_p^n$","year":2014,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada; Fonds Québécois de la Recherche sur la Nature et les Technologies","keywords":"Mathematics; Combinatorics; Limit (mathematics); Abelian group; Subspace topology; Sequence (biology); Affine transformation; Boolean function; Inverse limit; Discrete mathematics; Limit point; Pure mathematics; Mathematical analysis","score_opus":0.01753344308060332,"score_gpt":0.2714953866020699,"score_spread":0.25396194352146656,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1574374495","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9574013,0.0009930804,0.026429422,0.0007826796,0.0014217844,0.00017361817,0.000002151611,0.000027942042,0.012768039],"genre_scores_gemma":[0.9989249,0.00014581643,0.000038012946,0.00013542514,0.00018105563,0.0000012243481,3.1119117e-7,0.000027277534,0.0005459738],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99813217,0.00035614666,0.0005562923,0.00008979386,0.0004797563,0.0003858187],"domain_scores_gemma":[0.99716276,0.0013892546,0.0006727968,0.0004406345,0.00026958136,0.000064997264],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00315382,0.00016246634,0.00036169123,0.00013930965,0.00022390795,0.000015191537,0.0005769516,0.00008458975,0.000024132558],"category_scores_gemma":[0.0010359547,0.00009757941,0.00024247392,0.00026632682,0.00010005636,0.00006393249,0.00004069545,0.00079175294,0.000003232166],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008686645,0.0001396695,0.000063318854,0.000024350058,0.00012571887,8.368612e-7,0.00032933353,0.000028275563,0.00012322469,0.994919,0.002389358,0.0017700385],"study_design_scores_gemma":[0.00061443564,0.0016187958,0.0001391196,0.000049928687,0.000117939104,0.000062461804,0.000120116136,0.000076997276,0.0014620482,0.9859803,0.009656173,0.00010168974],"about_ca_topic_score_codex":9.254373e-7,"about_ca_topic_score_gemma":0.0000014855812,"teacher_disagreement_score":0.04152362,"about_ca_system_score_codex":0.00010803969,"about_ca_system_score_gemma":0.00012015957,"threshold_uncertainty_score":0.3979173},"labels":[],"label_agreement":null},{"id":"W1574979076","doi":"10.37236/3007","title":"Unique Sequences Containing No $k$-Term Arithmetic Progressions","year":2013,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Mathematics; Combinatorics; Conjecture; Generalization; Term (time); Sequence (biology); Simple (philosophy); Arithmetic progression; Discrete mathematics","score_opus":0.015600988080101566,"score_gpt":0.28380662618684754,"score_spread":0.26820563810674597,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1574979076","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9897514,0.0022430094,0.002415479,0.0008048029,0.0008274277,0.00035406,5.600371e-7,0.000037956626,0.0035653003],"genre_scores_gemma":[0.99870473,0.0003638216,0.0002271907,0.00009700826,0.00014845734,0.000010685842,2.4865415e-7,0.000024948447,0.00042290837],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981303,0.00028624653,0.0005206876,0.00009932592,0.00041360682,0.00054982887],"domain_scores_gemma":[0.9977004,0.00078043266,0.0005964522,0.00031091704,0.00051583495,0.00009597352],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013660283,0.00018001109,0.00033230483,0.00010212098,0.00036918858,0.00007239521,0.00074645336,0.00009397307,0.000095628646],"category_scores_gemma":[0.0005045672,0.00009792614,0.00016526013,0.00024513763,0.00017040347,0.0002039508,0.00009700472,0.0010130992,0.000008353872],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023130255,0.000064099644,0.00052236626,0.000018630833,0.00011622531,0.000007367663,0.0007267248,0.0000015839651,0.000206287,0.9969959,0.00063697144,0.0006807028],"study_design_scores_gemma":[0.0004468241,0.0006968187,0.00028474012,0.00008501749,0.000075277516,0.00032219655,0.0002850256,0.000052008578,0.0005685673,0.99620426,0.00085001334,0.00012923963],"about_ca_topic_score_codex":0.000004843074,"about_ca_topic_score_gemma":0.0000013564962,"teacher_disagreement_score":0.008953326,"about_ca_system_score_codex":0.0001710493,"about_ca_system_score_gemma":0.0003062305,"threshold_uncertainty_score":0.44014683},"labels":[],"label_agreement":null},{"id":"W1575622900","doi":"10.37236/1819","title":"Short Cycles in Random Regular Graphs","year":2004,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":112,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Australian Research Council","keywords":"Mathematics; Combinatorics; Bipartite graph; Random regular graph; Random graph; Discrete mathematics; Degree (music); Poisson distribution; Random variable; Chordal graph; Graph; Statistics; 1-planar graph","score_opus":0.013362643966246686,"score_gpt":0.2724877291639331,"score_spread":0.2591250851976864,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1575622900","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9914814,0.0034843986,0.0030602696,0.00044789482,0.00043662247,0.00015119357,3.541001e-7,0.000014892996,0.00092295784],"genre_scores_gemma":[0.99878585,0.0009726958,0.000058174646,0.000048676004,0.00006402356,0.000002139803,1.7629144e-7,0.0000241182,0.00004412642],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99825054,0.0001708189,0.0005586653,0.00009482702,0.0004364605,0.0004887057],"domain_scores_gemma":[0.9988929,0.00036477015,0.00024510513,0.00032154168,0.00012006833,0.000055603632],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002186886,0.00016374481,0.0003825908,0.00018820216,0.00016114577,0.000022626242,0.0006306351,0.00009001625,0.0000056208255],"category_scores_gemma":[0.00024190654,0.000099221565,0.00022738364,0.00041724212,0.0001116364,0.00011344567,0.000057698282,0.00089971314,6.5968385e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015167531,0.00010810275,0.00035154208,0.000011408209,0.000087776425,0.00002164297,0.0006837862,0.00008989061,0.00009370601,0.99801576,0.0000633615,0.00032133362],"study_design_scores_gemma":[0.0025426548,0.00021385279,0.0006011384,0.000049664057,0.000068468784,0.00027173082,0.00018004506,0.0000028219456,0.0015739029,0.9940475,0.00033053057,0.00011765512],"about_ca_topic_score_codex":0.0000033338224,"about_ca_topic_score_gemma":0.000009130836,"teacher_disagreement_score":0.0073044533,"about_ca_system_score_codex":0.0002634398,"about_ca_system_score_gemma":0.0002264393,"threshold_uncertainty_score":0.40461382},"labels":[],"label_agreement":null},{"id":"W1576464478","doi":"10.37236/1937","title":"Erdős-Ko-Rado theorems for uniform set-partition systems","year":2005,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":36,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Partition (number theory); Mathematics; Combinatorics; Cardinality (data modeling); Generalization; Discrete mathematics; Class (philosophy); Computer science","score_opus":0.023660366305949452,"score_gpt":0.2953013095934258,"score_spread":0.27164094328747634,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1576464478","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8998276,0.009891405,0.07810289,0.0023003567,0.0033566244,0.0011052134,0.000014463815,0.00009314545,0.005308331],"genre_scores_gemma":[0.9981463,0.00042870775,0.000091935966,0.00007698836,0.0006115247,0.000009677979,0.000001385347,0.000038639297,0.00059483835],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980763,0.0001610756,0.0006367257,0.00010573894,0.0004276989,0.0005924154],"domain_scores_gemma":[0.9979117,0.0006405982,0.00067315734,0.0003531492,0.0003437653,0.000077615405],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027157185,0.00019466429,0.00036628914,0.00010925706,0.00037576043,0.0000583466,0.000611888,0.00011334091,0.000014718651],"category_scores_gemma":[0.00026132478,0.00011652408,0.00025048517,0.00021203751,0.00009062696,0.0001956737,0.000047154645,0.0006060976,0.0000026688288],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011524779,0.0000719017,0.000017854143,0.000043471824,0.00015419038,0.0000010766715,0.0007681506,0.0001226587,0.0000562177,0.9952343,0.002780231,0.0006346668],"study_design_scores_gemma":[0.0010344598,0.0004811487,0.000010890849,0.000042145224,0.00015468051,0.00025674622,0.00035815456,0.0008971107,0.0006037352,0.9631128,0.032903656,0.00014449486],"about_ca_topic_score_codex":0.0000014214908,"about_ca_topic_score_gemma":0.0000027840215,"teacher_disagreement_score":0.09831873,"about_ca_system_score_codex":0.00037786856,"about_ca_system_score_gemma":0.00019267846,"threshold_uncertainty_score":0.47517142},"labels":[],"label_agreement":null},{"id":"W157787184","doi":"","title":"Further Ramsey Numbers for Small Complete Bipartite Graphs.","year":2006,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Bipartite graph; Combinatorics; Ramsey's theorem; Complete bipartite graph; Discrete mathematics; Graph","score_opus":0.03096334432265397,"score_gpt":0.26689878981841536,"score_spread":0.2359354454957614,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W157787184","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98540837,0.00013323867,0.0002826241,0.00018473162,0.0023819155,0.0005685984,0.000042014042,0.00020712045,0.010791401],"genre_scores_gemma":[0.9936996,0.0000048931374,0.005146902,0.00017327169,0.000039539194,0.00006674986,0.000021429743,0.00006583577,0.00078179216],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986251,0.00007390582,0.0003692896,0.00030622628,0.00019007683,0.0004354145],"domain_scores_gemma":[0.99862504,0.00051216537,0.00016007894,0.00051161414,0.00011198527,0.0000791335],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036192685,0.0002444079,0.00032965772,0.00009212749,0.00028576964,0.00005069327,0.00033467024,0.00014084873,0.00007753606],"category_scores_gemma":[0.000101278485,0.00021348734,0.0002449321,0.00020100204,0.00014281746,0.00006788499,0.00008374358,0.00015126303,0.000015140807],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004079022,0.00009316815,0.002795994,0.000056842608,0.000058940856,0.0000033588954,0.00030152634,0.0000025411136,0.00025016692,0.98300666,0.0131377885,0.0002522344],"study_design_scores_gemma":[0.0013392881,0.000071261966,0.0012941405,0.000021170386,0.00005808039,0.000005774748,0.000053175336,0.00006401462,0.00055259175,0.97967696,0.016579278,0.00028423796],"about_ca_topic_score_codex":0.000060872924,"about_ca_topic_score_gemma":0.000044984685,"teacher_disagreement_score":0.010009609,"about_ca_system_score_codex":0.000029813382,"about_ca_system_score_gemma":0.000016512402,"threshold_uncertainty_score":0.8705761},"labels":[],"label_agreement":null},{"id":"W1583473912","doi":"10.37236/322","title":"Forbidden Configurations: Exact Bounds Determined by Critical Substructures","year":2010,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; Universities Space Research Association; University of South Carolina","keywords":"Combinatorics; Mathematics; Simple (philosophy); Matrix (chemical analysis); Substructure; Permutation (music); Integer (computer science); Multiset; Discrete mathematics; Physics; Computer science","score_opus":0.010095952164721837,"score_gpt":0.29832399491315575,"score_spread":0.28822804274843394,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1583473912","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98938125,0.0013875599,0.004051197,0.0010620477,0.0019597888,0.00015107813,0.000005018026,0.000030298532,0.0019717303],"genre_scores_gemma":[0.9991432,0.00011472114,0.00010308631,0.0001232315,0.00026009022,0.0000030892468,9.911597e-7,0.00003157337,0.00022002058],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981241,0.0001554557,0.00055932195,0.000116028845,0.00048160547,0.000563451],"domain_scores_gemma":[0.99723464,0.0015329047,0.00036147854,0.0004167991,0.00034063973,0.00011352035],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012893381,0.00020264713,0.00033097048,0.00008972069,0.00046328214,0.000097452175,0.0007932354,0.00015780202,0.00013119243],"category_scores_gemma":[0.0016551444,0.00012362307,0.00019660513,0.00018918783,0.00028832818,0.00018889742,0.00005338682,0.0015732268,0.000001463919],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004996233,0.00005634807,0.000069442336,0.000013290264,0.000079531885,0.000005476899,0.00034772945,2.5027637e-7,0.0056119123,0.9891168,0.00431353,0.00033572005],"study_design_scores_gemma":[0.0005697165,0.00029562783,0.00014001409,0.000010097051,0.00012236151,0.0006102246,0.00009882297,0.000026433028,0.007150129,0.9832351,0.0075911023,0.00015032526],"about_ca_topic_score_codex":0.000002320507,"about_ca_topic_score_gemma":0.0000090500025,"teacher_disagreement_score":0.009761915,"about_ca_system_score_codex":0.000081163314,"about_ca_system_score_gemma":0.00025563556,"threshold_uncertainty_score":0.6834975},"labels":[],"label_agreement":null},{"id":"W1586454560","doi":"10.1007/978-1-4939-1601-6_3","title":"A Short Proof of Kneser’s Addition Theorem for Abelian Groups","year":2014,"lang":"en","type":"book-chapter","venue":"Springer proceedings in mathematics & statistics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Abelian group; Mathematics; Intersection (aeronautics); Argument (complex analysis); Combinatorics; Simple (philosophy); Pure mathematics; Chemistry; Geography; Philosophy","score_opus":0.030816307203814054,"score_gpt":0.28231468598200593,"score_spread":0.25149837877819187,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1586454560","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0029226716,0.00033469495,0.47504717,0.00006526599,0.0012564135,0.007726478,0.0040763626,0.00035431513,0.5082166],"genre_scores_gemma":[0.051691793,0.00019118226,0.88221174,0.000063214444,0.000765491,0.00044865315,0.00019851321,0.0007744237,0.063654974],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99603313,0.000011557715,0.0018551272,0.000684742,0.0008226477,0.0005927657],"domain_scores_gemma":[0.99578595,0.001385434,0.0012793245,0.0005727072,0.0008381838,0.00013837747],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0015864864,0.0008533919,0.0015862796,0.0005605812,0.00017894508,0.00007343686,0.0007562942,0.00071427575,0.00017266486],"category_scores_gemma":[0.001556102,0.0007701092,0.0003096913,0.00008394849,0.00044065376,0.00009127445,0.00030904403,0.00070644164,0.0000053304784],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005384965,0.00010310265,0.000015617845,0.009624357,0.00018260666,0.000004998354,0.0024188207,0.0000012067618,0.000041480733,0.9773463,0.00421272,0.005994919],"study_design_scores_gemma":[0.00045342513,0.0002230887,0.000012569203,0.0020542697,0.00040887,0.000017688104,0.00014421114,0.0009294833,0.00048739943,0.9864155,0.008079503,0.0007739597],"about_ca_topic_score_codex":0.0000010761512,"about_ca_topic_score_gemma":0.000011425933,"teacher_disagreement_score":0.44456166,"about_ca_system_score_codex":0.00015361323,"about_ca_system_score_gemma":0.00006534401,"threshold_uncertainty_score":0.999475},"labels":[],"label_agreement":null},{"id":"W1587274897","doi":"","title":"An Upper Bound of 62 on the Classical Ramsey Number R(3, 3, 3, 3).","year":2004,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Ramsey's theorem; Combinatorics","score_opus":0.021281415312157676,"score_gpt":0.2925127670443617,"score_spread":0.27123135173220403,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1587274897","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98151535,0.000014351619,0.000012173859,0.00059556705,0.0011670644,0.00018158599,0.0000053591657,0.000054426677,0.016454106],"genre_scores_gemma":[0.9989678,0.000005056301,0.00045172143,0.00030914217,0.000026175203,0.0000097200045,0.0000019366362,0.00003134814,0.00019707861],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99882483,0.00012594681,0.00026804153,0.00020682889,0.00033552144,0.00023883065],"domain_scores_gemma":[0.9985079,0.000457948,0.00011615429,0.0007643397,0.000073876006,0.00007975226],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039110964,0.00017020552,0.0002391036,0.00003206658,0.00023811859,0.00003329834,0.00043461806,0.00013692667,0.00023343886],"category_scores_gemma":[0.00022850482,0.00010550649,0.00012619417,0.00014807809,0.00026450344,0.000079909405,0.000071446295,0.0002933167,0.000037061433],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000036899342,0.0003222299,0.00073859,0.000013922667,0.00004239081,0.000004721639,0.0009344515,0.0000016137285,0.00021891044,0.9952769,0.0022286875,0.00018065226],"study_design_scores_gemma":[0.0007485641,0.0001529481,0.002194793,0.000033356147,0.000026653071,0.000010208232,0.00012711181,0.000006098618,0.0034043794,0.9920174,0.0011399449,0.00013853419],"about_ca_topic_score_codex":0.000009921676,"about_ca_topic_score_gemma":0.0000028340405,"teacher_disagreement_score":0.017452456,"about_ca_system_score_codex":0.0000420421,"about_ca_system_score_gemma":0.000040885978,"threshold_uncertainty_score":0.43024302},"labels":[],"label_agreement":null},{"id":"W1588550780","doi":"10.37236/1987","title":"A Sperner-Type Theorem for Set-Partition Systems","year":2005,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; University of Ottawa","funders":"","keywords":"Partition (number theory); Mathematics; Combinatorics; Cardinality (data modeling); Discrete mathematics; Computer science","score_opus":0.026864058793790297,"score_gpt":0.29994456808964026,"score_spread":0.27308050929585,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1588550780","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95455474,0.009471519,0.02892488,0.0011878408,0.0025471672,0.0006002108,0.0000041992016,0.000049362538,0.0026600831],"genre_scores_gemma":[0.9981635,0.00038429708,0.0000829849,0.000067440546,0.00061672705,0.00000432623,7.0973437e-7,0.000029964871,0.000650029],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984928,0.00015894958,0.00048043346,0.00008671642,0.0003326174,0.00044849998],"domain_scores_gemma":[0.9981601,0.0006514196,0.00048655027,0.00027963912,0.00036579737,0.00005649852],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021113702,0.00014831615,0.00029385448,0.00007774942,0.00025513885,0.000042866057,0.0004715267,0.000084205516,0.00001531283],"category_scores_gemma":[0.0003313431,0.000087262124,0.00017845974,0.00019313325,0.00006620591,0.00012669388,0.000035929395,0.00046207232,0.0000028157],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001447986,0.000058622292,0.000018398341,0.000029629226,0.00012592738,9.561853e-7,0.00061183324,0.00009022973,0.00010719848,0.995197,0.0032725614,0.0003428516],"study_design_scores_gemma":[0.0007655824,0.000540616,0.000011009773,0.00003079936,0.00013172487,0.00022599098,0.0002258896,0.000509388,0.0007283742,0.9677494,0.028972337,0.000108880624],"about_ca_topic_score_codex":8.576189e-7,"about_ca_topic_score_gemma":0.0000015276801,"teacher_disagreement_score":0.043608785,"about_ca_system_score_codex":0.00024951377,"about_ca_system_score_gemma":0.00016707208,"threshold_uncertainty_score":0.35584462},"labels":[],"label_agreement":null},{"id":"W1597739364","doi":"10.37236/682","title":"Strengthened Brooks' Theorem for Digraphs of Girth at least Three","year":2011,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; Javna Agencija za Raziskovalno Dejavnost RS; Fonds Québécois de la Recherche sur la Nature et les Technologies","keywords":"Combinatorics; Mathematics; Digraph; Degree (music); Chromatic scale; Graph; Vertex (graph theory); Corollary; Delta; Discrete mathematics; Girth (graph theory); Physics","score_opus":0.037544311311885646,"score_gpt":0.26000391042211424,"score_spread":0.22245959911022858,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1597739364","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9816463,0.0026654047,0.009829318,0.00006871961,0.0006190539,0.00032591095,0.000007749643,0.000020018813,0.0048175324],"genre_scores_gemma":[0.999148,0.00026479314,0.00022378993,0.000020185533,0.00007882121,0.000004339085,4.7384208e-7,0.00003935256,0.00022024878],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99818903,0.00012646304,0.0006600211,0.00011477734,0.000388948,0.00052074686],"domain_scores_gemma":[0.9973649,0.0008074502,0.00093140063,0.00047306248,0.00035301378,0.00007020843],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016014677,0.00021180941,0.00046538023,0.00012947504,0.00025174834,0.000009468741,0.0008952161,0.000103041886,0.00004873555],"category_scores_gemma":[0.00028383362,0.00012406817,0.00042435495,0.00022165746,0.00022283666,0.000086802575,0.000111802474,0.00045590036,7.3434404e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00052630267,0.00015514268,0.00064138765,0.00004691793,0.0003295926,0.0000014199697,0.0017249899,0.0000018172145,0.00015668385,0.9955349,0.00026931392,0.00061154604],"study_design_scores_gemma":[0.0012591309,0.0010516156,0.00041669924,0.000036887053,0.00022874954,0.00009045324,0.00019154784,0.000027511216,0.006868692,0.9890883,0.0006015567,0.00013888047],"about_ca_topic_score_codex":0.00000279304,"about_ca_topic_score_gemma":0.000020381176,"teacher_disagreement_score":0.017501704,"about_ca_system_score_codex":0.00012133006,"about_ca_system_score_gemma":0.0001513531,"threshold_uncertainty_score":0.5059354},"labels":[],"label_agreement":null},{"id":"W1607738003","doi":"10.4310/jdg/1143593212","title":"Lattice counting for deformations of convex domains","year":2006,"lang":"en","type":"article","venue":"Journal of Differential Geometry","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Mathematics; Lattice (music); Convex domain; Regular polygon; Combinatorics; Convex function; Function (biology); Domain (mathematical analysis); Geometry; Mathematical analysis; Physics","score_opus":0.01892612818530932,"score_gpt":0.2854620440286774,"score_spread":0.2665359158433681,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1607738003","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9253021,0.00012848145,0.072653726,0.000032786338,0.0006251387,0.00010528606,0.000031064672,0.000008182511,0.0011132288],"genre_scores_gemma":[0.988589,0.000010110431,0.010793886,0.000019406347,0.0004675403,0.0000012955982,0.0000031851775,0.00001540934,0.0001001691],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986366,0.00003545894,0.0007742521,0.00006118831,0.0003173978,0.00017512839],"domain_scores_gemma":[0.9979377,0.0006363749,0.0009004988,0.00013697716,0.00034622836,0.000042248917],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040417517,0.00011226593,0.00037419295,0.0003023777,0.00014109498,0.000025898882,0.00021126498,0.00008733899,0.000100275945],"category_scores_gemma":[0.00031976562,0.00008129896,0.0002969557,0.00017931995,0.00007275369,0.00014575878,0.000043586795,0.00016073491,4.5449872e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022390897,0.00042617088,0.008591622,0.0007421292,0.0004192298,0.000004322971,0.00060683757,0.000044944893,0.0066603506,0.97634363,0.0037570228,0.0021798261],"study_design_scores_gemma":[0.0022018666,0.00023038012,0.015064658,0.00013448793,0.00043686695,0.00005988629,0.00036891855,0.00026134402,0.010272774,0.96911937,0.0016502785,0.00019918002],"about_ca_topic_score_codex":0.0000034530835,"about_ca_topic_score_gemma":0.0000025841505,"teacher_disagreement_score":0.06328689,"about_ca_system_score_codex":0.000022879878,"about_ca_system_score_gemma":0.00002584679,"threshold_uncertainty_score":0.33152753},"labels":[],"label_agreement":null},{"id":"W1621851219","doi":"10.1016/j.aim.2015.08.021","title":"A disjoint unions theorem for trees","year":2015,"lang":"en","type":"article","venue":"Advances in Mathematics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; Centre National de la Recherche Scientifique","keywords":"Mathematics; Disjoint sets; Product (mathematics); Type (biology); Tree (set theory); Discrete mathematics; Product type; Combinatorics; Computer science; Geometry","score_opus":0.05131478679783009,"score_gpt":0.34915067218934687,"score_spread":0.2978358853915168,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1621851219","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2634687,0.0062133754,0.51936716,0.00087232346,0.002824763,0.0038652266,0.00017392944,0.0007386234,0.20247592],"genre_scores_gemma":[0.5857421,0.00018455113,0.41256914,0.00010248193,0.00016892051,0.00018029,0.000007053593,0.00007096012,0.0009744791],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987207,0.000051724488,0.00046430677,0.00021151289,0.00023638486,0.00031534358],"domain_scores_gemma":[0.9978299,0.0013022266,0.00017542292,0.0004984649,0.00009456162,0.00009942039],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008424476,0.0002055197,0.00037167658,0.0001146425,0.00010467111,0.000022921331,0.00034122053,0.00008382676,0.0000244484],"category_scores_gemma":[0.0018006755,0.00015099318,0.00011244392,0.00020007549,0.00016185487,0.00023524933,0.0001083816,0.00013090954,0.0000046561813],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021133703,0.00013493677,0.0001367235,0.00016452034,0.000013218431,0.0000024889382,0.0043535726,0.00007800439,0.000010161287,0.9915078,0.00042276827,0.003154627],"study_design_scores_gemma":[0.00067629956,0.000073083575,0.000022622937,0.000106898675,0.000026466203,0.00001270612,0.0025188846,0.0015785418,0.0001796411,0.98426,0.010339189,0.00020562],"about_ca_topic_score_codex":8.489164e-7,"about_ca_topic_score_gemma":0.00004239058,"teacher_disagreement_score":0.3222734,"about_ca_system_score_codex":0.000054297114,"about_ca_system_score_gemma":0.000030614705,"threshold_uncertainty_score":0.6157323},"labels":[],"label_agreement":null},{"id":"W1650378662","doi":"10.1016/j.jctb.2015.08.003","title":"The critical number of dense triangle-free binary matroids","year":2015,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Office of Naval Research","keywords":"Matroid; Combinatorics; Conjecture; Mathematics; Binary number; Simple (philosophy); Statement (logic); Integer (computer science); Discrete mathematics; Computer science; Arithmetic; Law","score_opus":0.03175829879797034,"score_gpt":0.32562907512655026,"score_spread":0.29387077632857994,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1650378662","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9588563,0.0016215727,0.00034053222,0.0012133605,0.02259583,0.00020586101,0.000015734578,0.00003784957,0.015112994],"genre_scores_gemma":[0.9954987,0.0000777992,0.0025085916,0.000041899544,0.001292177,0.000002583792,2.2132197e-7,0.000037908954,0.000540107],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99689883,0.00092717196,0.0010558097,0.00010532379,0.0007257451,0.00028714573],"domain_scores_gemma":[0.993554,0.004035033,0.0006572863,0.00063893624,0.00090156787,0.00021315468],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.005320727,0.0002055843,0.0006402774,0.00008241939,0.000276231,0.000063443615,0.0009566597,0.00015960581,0.00010335318],"category_scores_gemma":[0.012704622,0.00012240419,0.00038666217,0.00018975875,0.00080571417,0.0003443555,0.00029068618,0.0004451122,0.000002996875],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.004820732,0.00012891166,0.00014138623,0.000040923558,0.00015169613,0.000057507183,0.0012432269,8.3841405e-7,0.00008690377,0.98150486,0.011505163,0.00031784642],"study_design_scores_gemma":[0.0024114773,0.00074502325,0.000033847504,0.000077442826,0.00013883074,0.00055527163,0.0018495369,0.0000013998725,0.0012700346,0.9832902,0.009487975,0.00013893902],"about_ca_topic_score_codex":9.477658e-7,"about_ca_topic_score_gemma":4.0252257e-7,"teacher_disagreement_score":0.036642447,"about_ca_system_score_codex":0.000056328572,"about_ca_system_score_gemma":0.00019117791,"threshold_uncertainty_score":0.9956118},"labels":[],"label_agreement":null},{"id":"W1658178599","doi":"10.1016/j.jctb.2015.07.001","title":"A transition of limiting distributions of large matchings in random graphs","year":2015,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; Fundação de Amparo à Pesquisa do Estado de São Paulo","keywords":"Limiting; Mathematics; Asymptotic distribution; Combinatorics; Range (aeronautics); Distribution (mathematics); Statistical physics; Discrete mathematics; Statistics; Physics; Mathematical analysis; Materials science","score_opus":0.01959443799609526,"score_gpt":0.28452176409885827,"score_spread":0.264927326102763,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1658178599","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99352074,0.00021608063,0.0032424866,0.00007550887,0.0018172665,0.00012602325,0.000039745322,0.000008820824,0.00095330714],"genre_scores_gemma":[0.99895644,0.000024410594,0.0008506595,0.000010668819,0.00013097888,0.0000014318142,0.0000031602594,0.000013879276,0.000008397944],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979468,0.00047372797,0.00096213527,0.000073746356,0.00036967144,0.00017389827],"domain_scores_gemma":[0.9978218,0.00064883934,0.0008387662,0.00016817977,0.00044005903,0.000082365674],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036801544,0.00013298099,0.00060451217,0.00020473702,0.00006758317,0.000010823057,0.00023790414,0.00011128023,0.000023907209],"category_scores_gemma":[0.0011884236,0.00010497589,0.00026067547,0.00027218545,0.00017470197,0.0003207761,0.000044958757,0.00029055512,1.0048403e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.003381449,0.00024111762,0.00021126072,0.000085560794,0.000083434454,0.000011107344,0.007367726,0.000009640429,0.0006439578,0.98778594,0.00009083491,0.00008796145],"study_design_scores_gemma":[0.00565553,0.00042935842,0.000104238425,0.000292028,0.00008267653,0.000058005142,0.0030163773,0.0000043157374,0.0073610833,0.9827344,0.00016778926,0.00009422002],"about_ca_topic_score_codex":0.0000026520202,"about_ca_topic_score_gemma":0.0000015743051,"teacher_disagreement_score":0.0067171254,"about_ca_system_score_codex":0.000036468202,"about_ca_system_score_gemma":0.0001034299,"threshold_uncertainty_score":0.42807925},"labels":[],"label_agreement":null},{"id":"W1660086198","doi":"10.1007/s00493-015-3237-1","title":"Odd circuits in dense binary matroids","year":2015,"lang":"en","type":"article","venue":"COMBINATORICA","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Matroid; Combinatorics; Lemma (botany); Integer (computer science); Abelian group; Binary number; Discrete mathematics; Simple (philosophy); Arithmetic; Computer science","score_opus":0.07131799654960404,"score_gpt":0.31188509652276625,"score_spread":0.24056709997316222,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1660086198","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96107507,0.0005912735,0.000074553565,0.00013453883,0.0011743492,0.00018479972,0.0000023442087,0.00013158425,0.036631487],"genre_scores_gemma":[0.99858767,0.000014085823,0.000417272,0.00009492952,0.000052909112,0.000015312258,0.0000015517778,0.000030401594,0.00078585366],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99881274,0.00012895523,0.0002757992,0.00021825658,0.0002666442,0.00029758544],"domain_scores_gemma":[0.9990087,0.00020633027,0.000076032105,0.0004726439,0.0000790346,0.00015724784],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050523365,0.0001585043,0.00027288275,0.0001625077,0.00008143896,0.00002106376,0.00032121432,0.00011960092,0.00003807882],"category_scores_gemma":[0.00046667198,0.00013820326,0.00007059087,0.0003690442,0.000064142245,0.00008699674,0.00017793679,0.00022938718,0.000035417317],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016177119,0.00016409949,0.005224077,0.00003839024,0.000014059794,0.00010059429,0.0014308799,0.0000017324055,0.000059485694,0.97325724,0.01882155,0.00087169424],"study_design_scores_gemma":[0.00092954765,0.000111987385,0.0022295567,0.000023797294,0.0000121779985,0.00002546615,0.00018560348,0.00004755947,0.00016838998,0.9909545,0.0051231324,0.0001882766],"about_ca_topic_score_codex":0.000008334755,"about_ca_topic_score_gemma":0.0000015806529,"teacher_disagreement_score":0.037512615,"about_ca_system_score_codex":0.00012802449,"about_ca_system_score_gemma":0.000051783714,"threshold_uncertainty_score":0.5635766},"labels":[],"label_agreement":null},{"id":"W1676968817","doi":"10.1017/apr.2016.31","title":"On the relation between graph distance and Euclidean distance in random geometric graphs","year":2016,"lang":"en","type":"article","venue":"Advances in Applied Probability","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Minkowski distance; Mathematics; Relation (database); Geometric graph theory; Random geometric graph; Euclidean distance; Combinatorics; Random graph; Euclidean geometry; Graph; Discrete mathematics; Line graph; Computer science; Voltage graph; Geometry; Data mining","score_opus":0.018546913000366084,"score_gpt":0.2683948767119855,"score_spread":0.24984796371161938,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1676968817","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9557678,0.00087052793,0.030615602,0.00026338617,0.00015151319,0.001375938,0.000034255292,0.00006200799,0.010858952],"genre_scores_gemma":[0.9971318,0.0003871405,0.0022051502,0.00004291867,0.000027989514,0.00016749416,0.0000017396658,0.000017513783,0.000018231705],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99810654,0.00020820281,0.0005573207,0.0005251095,0.0002806104,0.00032220574],"domain_scores_gemma":[0.9929272,0.0061577824,0.0002078036,0.0006346496,0.000023445555,0.000049097293],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018091018,0.00023108085,0.00038327347,0.00019001243,0.00016663563,0.000017655615,0.00029292188,0.000104305764,0.000021122716],"category_scores_gemma":[0.0012096307,0.00012279607,0.0000640061,0.00094671187,0.00053991174,0.0001740674,0.00008549328,0.00028103034,0.0000015056128],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002727455,0.0000425136,0.09267525,0.000072295705,0.0000064977257,6.160855e-7,0.00022181463,0.00001772165,0.000011941052,0.884236,0.000010050847,0.022432603],"study_design_scores_gemma":[0.001305978,0.000027202123,0.06435723,0.00009025791,0.000008324365,3.2809743e-7,0.000030104362,0.000004342298,0.00013837365,0.93314,0.0007213084,0.00017656296],"about_ca_topic_score_codex":0.0000030730082,"about_ca_topic_score_gemma":0.0001424661,"teacher_disagreement_score":0.04890403,"about_ca_system_score_codex":0.000092278045,"about_ca_system_score_gemma":0.0000110596275,"threshold_uncertainty_score":0.50074786},"labels":[],"label_agreement":null},{"id":"W1677185937","doi":"10.1090/s0002-9939-00-05921-9","title":"Double exponential sums over thin sets","year":2000,"lang":"en","type":"article","venue":"Proceedings of the American Mathematical Society","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Modulo; Exponential function; Multiplicative function; Order (exchange); Prime (order theory); Omega; Physics; Mathematics; Mathematical analysis; Quantum mechanics","score_opus":0.01893596304647435,"score_gpt":0.2874381748797771,"score_spread":0.26850221183330275,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1677185937","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9695796,0.000018138579,0.000049035556,0.00035856257,0.000058279482,0.00033638664,0.0000077709465,0.00011046913,0.02948177],"genre_scores_gemma":[0.97433525,0.000036362155,0.023254298,0.0005045431,0.00011413298,0.000027593125,4.1889749e-7,0.00005143761,0.001675958],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99815214,0.000013210349,0.0005002866,0.00029681614,0.0006286791,0.00040885792],"domain_scores_gemma":[0.9988527,0.00023795779,0.00041510112,0.0002917204,0.00009703815,0.00010547438],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00054883125,0.00026239498,0.00055940566,0.000019134523,0.00032138583,0.00005194553,0.0007849965,0.00008501173,0.0011617398],"category_scores_gemma":[0.00012348138,0.00015953583,0.0006819519,0.00041447172,0.0010143445,0.00015086896,0.00028018377,0.00032315432,0.00001565659],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021491986,0.00039928846,0.0016234012,0.0006203634,0.000339068,3.5549579e-7,0.0109012425,0.0000023918114,0.004279649,0.9488507,0.030457366,0.002311257],"study_design_scores_gemma":[0.0005732227,0.00006206936,0.0013649896,0.00009659668,0.00012894731,0.000016887712,0.0009527776,0.00060121226,0.0057501374,0.9893821,0.0008105508,0.00026054605],"about_ca_topic_score_codex":0.000015879315,"about_ca_topic_score_gemma":2.5564535e-7,"teacher_disagreement_score":0.040531367,"about_ca_system_score_codex":0.00004177437,"about_ca_system_score_gemma":0.000016182437,"threshold_uncertainty_score":0.9997513},"labels":[],"label_agreement":null},{"id":"W168516241","doi":"","title":"Anti-Ramsey numbers for small complete bipartite graphs.","year":2004,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":37,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Ramsey's theorem; Bipartite graph; Combinatorics; Robertson–Seymour theorem; Discrete mathematics; Graph; 1-planar graph; Chordal graph","score_opus":0.042413865062384294,"score_gpt":0.28400207813885303,"score_spread":0.24158821307646874,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W168516241","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9927811,0.000092008515,0.00039015815,0.00020880908,0.0027611165,0.0005439046,0.00003661603,0.00019878645,0.002987526],"genre_scores_gemma":[0.99100506,0.000017082075,0.008451103,0.00026903948,0.000021529553,0.000048499787,0.00001412977,0.000057934423,0.0001156255],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99859715,0.000047416812,0.0003599321,0.00033101384,0.00020410148,0.00046037603],"domain_scores_gemma":[0.9986963,0.00033940366,0.00015473332,0.0005560799,0.00011878369,0.00013466706],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035585702,0.00025205783,0.0003921256,0.000104011335,0.00039117073,0.000051661584,0.00039844593,0.00014577495,0.000029944287],"category_scores_gemma":[0.00022480842,0.00022484911,0.00024959576,0.0002455577,0.00016375267,0.00008915414,0.00010800438,0.00018671608,0.00001539942],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002605021,0.00010631931,0.0012326849,0.00008082595,0.00009030645,0.000006331392,0.00065737235,0.000009462975,0.000300787,0.9958582,0.001467884,0.0001637742],"study_design_scores_gemma":[0.002124573,0.00011546502,0.0010382903,0.000047133526,0.000063312655,0.000011234694,0.000068722715,0.000014872999,0.001365931,0.99043417,0.0044159815,0.0003003068],"about_ca_topic_score_codex":0.000030258707,"about_ca_topic_score_gemma":0.000017056513,"teacher_disagreement_score":0.008060945,"about_ca_system_score_codex":0.000048699992,"about_ca_system_score_gemma":0.000035768513,"threshold_uncertainty_score":0.9169081},"labels":[],"label_agreement":null},{"id":"W170807379","doi":"10.5556/j.tkjm.41.2010.500","title":"Recursive construction of maximum number of non-overlapping Klein 4-groups inside an elementary Abelian 2-group","year":2010,"lang":"en","type":"article","venue":"Tamkang Journal of Mathematics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Mathematics; Abelian group; Group (periodic table); Non-abelian group; Pure mathematics; Elementary abelian group; G-module; Algebra over a field; Combinatorics; Discrete mathematics; Physics","score_opus":0.016048774133218383,"score_gpt":0.2948946226212022,"score_spread":0.2788458484879838,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W170807379","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9888483,0.000029893728,0.008242894,0.00003981938,0.0008574616,0.00020713023,0.000022991251,0.000014506367,0.0017369972],"genre_scores_gemma":[0.6314388,0.000037415313,0.3682627,0.000024504385,0.00018625036,0.0000013088311,0.0000022991235,0.00003385381,0.000012854204],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99730784,0.00009263248,0.0015745843,0.0001472089,0.0006185548,0.00025916],"domain_scores_gemma":[0.99591327,0.000508228,0.0024376889,0.0005267435,0.00047298998,0.00014109323],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013872548,0.00025578926,0.0007863174,0.0002568255,0.000109131455,0.000016399536,0.0004825672,0.00019964918,0.00031811025],"category_scores_gemma":[0.00044208838,0.0002054303,0.00028587255,0.00023227134,0.0003339065,0.00034224128,0.00010382908,0.0006216722,0.0000022308222],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017481117,0.000994587,0.0056677726,0.0015581743,0.0006747128,0.000040747804,0.012580324,0.000007072672,0.16387028,0.80652523,0.0007595772,0.0071467124],"study_design_scores_gemma":[0.0010248978,0.000326881,0.00047355553,0.0005561834,0.0002952217,0.00085021416,0.0065089073,0.00012256495,0.041042406,0.94849396,0.000075014716,0.00023019212],"about_ca_topic_score_codex":0.0000099690105,"about_ca_topic_score_gemma":0.000019922236,"teacher_disagreement_score":0.3600198,"about_ca_system_score_codex":0.000032970624,"about_ca_system_score_gemma":0.00006490294,"threshold_uncertainty_score":0.83772045},"labels":[],"label_agreement":null},{"id":"W1762497644","doi":"10.37236/4373","title":"On Obstacle Numbers","year":2015,"lang":"en","type":"preprint","venue":"The Electronic Journal of Combinatorics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Obstacle; Upper and lower bounds; Combinatorics; Omega; Mathematics; Graph; Binary logarithm; Discrete mathematics; Physics; Mathematical analysis; Quantum mechanics","score_opus":0.033886102808367485,"score_gpt":0.3135568381593907,"score_spread":0.27967073535102327,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1762497644","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9632647,0.0043345564,0.0024161772,0.0008418179,0.0061840294,0.00038200518,0.000005839421,0.0000529313,0.02251791],"genre_scores_gemma":[0.9980663,0.0004858671,0.00003751339,0.00012487112,0.00032631643,0.0000032142705,0.0000011040996,0.00006081382,0.0008940149],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99720865,0.0003822187,0.00070123875,0.00017571589,0.0009257835,0.0006063667],"domain_scores_gemma":[0.9963324,0.00097372464,0.0011994059,0.0008270926,0.0005387598,0.00012863238],"candidate_categories":["research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0030814738,0.00034595208,0.00065084704,0.00015193409,0.000195935,0.00005980795,0.0015311863,0.00030474886,0.000028722465],"category_scores_gemma":[0.00094276795,0.0002085685,0.0004157413,0.0001869516,0.000120519464,0.00005147843,0.0004616497,0.003809912,0.0000048818706],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012825616,0.00011871393,0.000015987745,0.000046754034,0.00033006503,0.000014053009,0.0011643474,0.000116807976,0.0000019961692,0.98231053,0.015566224,0.00018624245],"study_design_scores_gemma":[0.0006804303,0.00047582257,0.000010154124,0.00011519383,0.00023082356,0.0001769105,0.00013399191,0.000028929497,0.00012436,0.99471235,0.003088419,0.0002226358],"about_ca_topic_score_codex":0.000003362742,"about_ca_topic_score_gemma":0.0000019779022,"teacher_disagreement_score":0.03480155,"about_ca_system_score_codex":0.0007960234,"about_ca_system_score_gemma":0.0009580266,"threshold_uncertainty_score":0.99848837},"labels":[],"label_agreement":null},{"id":"W1767752187","doi":"10.37236/4642","title":"Power of $k$ Choices and Rainbow Spanning Trees in Random Graphs","year":2015,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University; University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Combinatorics; Mathematics; Rainbow; Spanning tree; Random graph; Graph; Tree (set theory); Discrete mathematics; Physics","score_opus":0.01874576018923169,"score_gpt":0.27745429318003983,"score_spread":0.25870853299080815,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1767752187","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98942965,0.00819038,0.00038035028,0.00015580711,0.0002945961,0.00009781468,4.0849812e-7,0.0000057786856,0.0014452337],"genre_scores_gemma":[0.99934334,0.00046452568,0.000047987505,0.000022828697,0.000027750879,8.7854824e-7,7.798552e-8,0.000014483897,0.00007811664],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985603,0.0002228632,0.00048259913,0.000071994844,0.00035470145,0.0003075043],"domain_scores_gemma":[0.9983555,0.0007142068,0.0005026045,0.00018653963,0.00017578498,0.000065334956],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028234068,0.00012768566,0.00040248586,0.0001869138,0.00006431182,0.000016356762,0.00035152843,0.00006540546,0.0000051041],"category_scores_gemma":[0.0005914922,0.00007586009,0.00010362882,0.00029683489,0.00013139268,0.0001180673,0.000062828294,0.0005277033,1.01690304e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028477985,0.00006429903,0.0024898986,0.000012178591,0.00008813168,0.0000049601376,0.0037218907,0.000016645585,0.00007532673,0.99295944,0.00014519297,0.00013725016],"study_design_scores_gemma":[0.003473048,0.00044889582,0.00086666114,0.000050819195,0.00005018363,0.00010718191,0.0008541296,0.000020605676,0.0004679231,0.9930048,0.0005723065,0.000083452265],"about_ca_topic_score_codex":0.000005001034,"about_ca_topic_score_gemma":0.0000069440844,"teacher_disagreement_score":0.00991372,"about_ca_system_score_codex":0.00006719494,"about_ca_system_score_gemma":0.0001811244,"threshold_uncertainty_score":0.30934846},"labels":[],"label_agreement":null},{"id":"W1774627331","doi":"10.1007/s00026-016-0313-1","title":"On Linear Configurations in Subsets of Compact Abelian Groups, and Invariant Measurable Hypergraphs","year":2016,"lang":"en","type":"article","venue":"Annals of Combinatorics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Agence Nationale de la Recherche","keywords":"Mathematics; Abelian group; Combinatorics; Finitary; Coprime integers; Lemma (botany); Hypergraph; Invariant (physics); Discrete mathematics","score_opus":0.08315348678708288,"score_gpt":0.3303523111892179,"score_spread":0.24719882440213498,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1774627331","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9939933,0.00023783083,0.000091729475,0.0007150644,0.00015450692,0.00016032647,0.00003793037,0.000016006628,0.0045933137],"genre_scores_gemma":[0.99941355,0.00034676443,0.00007320286,0.00007688091,0.000008028212,0.0000023656382,0.0000014355629,0.000014950539,0.00006279337],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99887687,0.00011287937,0.00041772236,0.00014847325,0.00025681953,0.00018724309],"domain_scores_gemma":[0.9982493,0.0009121104,0.00021632547,0.0003342383,0.00021608255,0.00007193639],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005720934,0.00013769456,0.00036323606,0.00021575809,0.00006319644,0.0000060140655,0.00017175094,0.00009877376,0.000027670301],"category_scores_gemma":[0.0006574379,0.00009155537,0.00007324253,0.00027614538,0.00015658732,0.000096834345,0.00002911149,0.00009982408,0.0000011447027],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000053698568,0.00020095694,0.003753223,0.00006993373,0.00003840787,0.0000029277103,0.00034046438,0.0000017293668,0.0018348906,0.9922782,0.0011890151,0.00023653521],"study_design_scores_gemma":[0.0007477337,0.00022092053,0.010089484,0.00018951522,0.000011916609,0.0000028207578,0.000042230986,0.000021439397,0.022211235,0.9661392,0.00020399695,0.000119491546],"about_ca_topic_score_codex":0.000028169296,"about_ca_topic_score_gemma":0.000009919199,"teacher_disagreement_score":0.026139002,"about_ca_system_score_codex":0.0000077300865,"about_ca_system_score_gemma":0.000027994312,"threshold_uncertainty_score":0.37335196},"labels":[],"label_agreement":null},{"id":"W1778871662","doi":"10.1017/s096354831400073x","title":"Orientability Thresholds for Random Hypergraphs","year":2015,"lang":"en","type":"article","venue":"Combinatorics Probability Computing","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Hypergraph; Combinatorics; Conjecture; Cardinality (data modeling); Vertex (graph theory); Mathematics; Graph; Orientation (vector space); Discrete mathematics; Computer science; Geometry","score_opus":0.12500517015308962,"score_gpt":0.34212752033350835,"score_spread":0.21712235018041873,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1778871662","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9584471,0.00019032543,0.0328215,0.00012855843,0.0026370792,0.0015795477,0.000010951677,0.00037159692,0.0038133597],"genre_scores_gemma":[0.98072267,0.0000013565555,0.018922446,0.000063526444,0.0001531651,0.000039376333,0.0000071825975,0.0000407645,0.000049519942],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99735785,0.00027247934,0.0007217188,0.0006380203,0.00045532515,0.00055462134],"domain_scores_gemma":[0.99576735,0.0019818826,0.00024366201,0.00099137,0.0007363361,0.00027939407],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0044411086,0.0003193255,0.00059235597,0.00008829829,0.00055516063,0.00006539355,0.00057641574,0.00019660039,0.000006854295],"category_scores_gemma":[0.0051753563,0.00027436906,0.0003096901,0.0004622145,0.00026078412,0.00013352916,0.0004539455,0.00030584415,0.0000018530285],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017032742,0.00033417658,0.03367982,0.00024974812,0.00004204909,0.0000010453823,0.001787951,0.000047535777,0.000009268899,0.961345,0.0010237277,0.0013093092],"study_design_scores_gemma":[0.0034269486,0.00018723334,0.00050092133,0.000023876159,0.00004752864,0.000009750128,0.00017693311,0.0023439256,0.00025926705,0.9912611,0.0014372077,0.00032528516],"about_ca_topic_score_codex":0.000008099519,"about_ca_topic_score_gemma":0.0000030608198,"teacher_disagreement_score":0.0331789,"about_ca_system_score_codex":0.00023980427,"about_ca_system_score_gemma":0.00012667799,"threshold_uncertainty_score":0.99997085},"labels":[],"label_agreement":null},{"id":"W1780397282","doi":"10.1016/j.disc.2015.08.021","title":"On the geometric Ramsey numbers of trees","year":2015,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Combinatorics; Mathematics; General position; Ramsey's theorem; Graph; Regular polygon; Discrete mathematics; Geometry","score_opus":0.0659309890628435,"score_gpt":0.308355392422251,"score_spread":0.24242440335940751,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1780397282","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.88290685,0.00008969539,0.006656042,0.00029510874,0.00031205796,0.00045256934,0.00003273094,0.00009318794,0.10916178],"genre_scores_gemma":[0.98852694,0.0000067123647,0.010341,0.0001090405,0.000054618184,0.000015186759,0.00000247887,0.000040870716,0.00090315286],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984577,0.00009242281,0.00045574733,0.00016077432,0.00058825227,0.00024511834],"domain_scores_gemma":[0.99666893,0.0019935674,0.0003046931,0.00081833586,0.00011257108,0.00010189315],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010096624,0.00021212545,0.00037036292,0.00015348736,0.00011889142,0.000029308525,0.000522006,0.000094397416,0.00014591344],"category_scores_gemma":[0.0030614743,0.000114407245,0.00017937283,0.0004999646,0.00021438398,0.000051747138,0.00014794058,0.00018915457,0.000024759942],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016143673,0.000081771395,0.00009183136,0.00008552902,0.000072659146,0.000002088831,0.004516824,0.000014228625,0.000016603835,0.9847742,0.010133405,0.00019476641],"study_design_scores_gemma":[0.0003046455,0.000101685866,0.000055853725,0.00007434528,0.000064417065,0.000008683256,0.0026846763,0.00041845828,0.0010816265,0.99464256,0.00040560437,0.00015743366],"about_ca_topic_score_codex":0.000005106344,"about_ca_topic_score_gemma":0.0000050146195,"teacher_disagreement_score":0.10825863,"about_ca_system_score_codex":0.000028133874,"about_ca_system_score_gemma":0.000027211343,"threshold_uncertainty_score":0.4665392},"labels":[],"label_agreement":null},{"id":"W1787172169","doi":"10.37236/2742","title":"Integral Cayley Multigraphs over Abelian and Hamiltonian Groups","year":2013,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; Javna Agencija za Raziskovalno Dejavnost RS; Simon Fraser University","keywords":"Mathematics; Abelian group; Multigraph; Cayley graph; Combinatorics; Converse; Cayley's theorem; Cayley transform; Hamiltonian (control theory); Character (mathematics); Discrete mathematics; Pure mathematics; Algebra over a field; Graph; Voltage graph; Line graph","score_opus":0.008445332578899789,"score_gpt":0.24754603429603086,"score_spread":0.23910070171713108,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1787172169","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99443084,0.0028868609,0.0007267734,0.0004748732,0.0005195239,0.00018887906,8.1274624e-7,0.000020165637,0.00075129885],"genre_scores_gemma":[0.99857026,0.00077033776,0.00011932378,0.00014885725,0.00010172829,0.0000038199673,2.179201e-7,0.000029155322,0.00025629072],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983319,0.00016809719,0.00046766744,0.000118851436,0.00036776945,0.00054572365],"domain_scores_gemma":[0.9984816,0.00045573758,0.00040092596,0.00032846592,0.00021475783,0.00011854902],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009782431,0.00021221173,0.00034297555,0.0001480158,0.00028307716,0.000070988295,0.0005253077,0.00010679382,0.000052262643],"category_scores_gemma":[0.00021972897,0.00012022487,0.0001717627,0.0002602538,0.00018662045,0.00021567477,0.00009804484,0.0010227447,0.0000026511816],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024202098,0.000058792193,0.0013040894,0.000016712602,0.00014358648,0.0000036136955,0.0012282828,6.065067e-7,0.00021376008,0.994704,0.0011705623,0.0011317715],"study_design_scores_gemma":[0.00084981724,0.00034441546,0.0052827294,0.000032080217,0.000082958046,0.00022777927,0.00035303034,0.000079371086,0.00025413578,0.9911866,0.0011570613,0.00014999825],"about_ca_topic_score_codex":0.00003335365,"about_ca_topic_score_gemma":0.00001670592,"teacher_disagreement_score":0.004139457,"about_ca_system_score_codex":0.000112695445,"about_ca_system_score_gemma":0.00009385112,"threshold_uncertainty_score":0.49026278},"labels":[],"label_agreement":null},{"id":"W1791559082","doi":"10.1093/imrn/rnr127","title":"Constellations in Pd","year":2011,"lang":"en","type":"preprint","venue":"International Mathematics Research Notices","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Hyperplane; Mathematics; Affine transformation; Combinatorics; Constellation; General position; Tuple; Point (geometry); Lattice (music); Position (finance); Set (abstract data type); Finite set; Discrete mathematics; Pure mathematics; Physics; Computer science; Geometry; Mathematical analysis","score_opus":0.3830062643875095,"score_gpt":0.49245012222117823,"score_spread":0.10944385783366872,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1791559082","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4511701,0.0002932927,0.0013372556,0.00064055837,0.0024632828,0.0013048901,0.0001405188,0.00015086016,0.54249924],"genre_scores_gemma":[0.9504934,0.00014629799,0.046492737,0.000029906503,0.00036303714,0.0001350807,0.000028877294,0.000073277726,0.0022374145],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9959385,0.0003517129,0.00097647286,0.00058206375,0.0016077397,0.0005435511],"domain_scores_gemma":[0.99381876,0.0039314763,0.0003863059,0.0009727716,0.00076213793,0.00012853205],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0034106118,0.0003419022,0.0005313046,0.001297036,0.00021129743,0.00024241433,0.002006661,0.00045289053,0.0016053162],"category_scores_gemma":[0.0038328762,0.00029805044,0.00021066397,0.0002544165,0.0005095088,0.00015043945,0.0028421,0.0020167804,0.00009639715],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026281868,0.00040920122,0.00062956783,0.0006709425,0.00020054645,0.000046709116,0.0070439144,0.000112713,0.000024195695,0.9886689,0.0017046938,0.00046233684],"study_design_scores_gemma":[0.00025154944,0.000022096767,0.0003282778,0.00080186495,0.000023366543,0.00000905561,0.00081873493,0.00494474,0.00023490633,0.9913404,0.00093554286,0.00028945453],"about_ca_topic_score_codex":0.000117391595,"about_ca_topic_score_gemma":0.00018625257,"teacher_disagreement_score":0.5402618,"about_ca_system_score_codex":0.00023061731,"about_ca_system_score_gemma":0.00020320647,"threshold_uncertainty_score":0.9999472},"labels":[],"label_agreement":null},{"id":"W1809658767","doi":"","title":"Complete minors in cubic graphs with few short cycles and random cubic graphs","year":2004,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Cubic graph; Combinatorics; Minor (academic); Girth (graph theory); Discrete mathematics; Graph; Robertson–Seymour theorem; Kappa; Odd graph; 1-planar graph; Line graph; Humanities; Geometry; Voltage graph","score_opus":0.018937704088158314,"score_gpt":0.25736463420247574,"score_spread":0.23842693011431743,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1809658767","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99613273,0.00052219303,0.000021221456,0.00008440237,0.0005782642,0.00051024684,0.00001169619,0.00010293169,0.0020362905],"genre_scores_gemma":[0.9983569,0.00012552533,0.0012862284,0.00009608495,0.000006723552,0.00003708262,0.0000082458255,0.000053168667,0.000030039948],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99819756,0.00012208203,0.0004260762,0.0004384769,0.00035118224,0.0004646232],"domain_scores_gemma":[0.9987865,0.00036639007,0.00010552089,0.0005268452,0.00006187701,0.00015286806],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00041812417,0.000359482,0.0005907773,0.00031106634,0.00027201133,0.000059073474,0.0003211827,0.00015194104,0.000018828125],"category_scores_gemma":[0.00007766303,0.0002790686,0.00012388517,0.00050431915,0.00039600595,0.00016348127,0.00012184148,0.0003475231,0.0000028063403],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019127692,0.00013247241,0.024424275,0.000085503576,0.00009533603,0.00005951303,0.0013008498,0.000007995792,0.0002014212,0.97302145,0.0001082976,0.00037161438],"study_design_scores_gemma":[0.005675199,0.00017262854,0.015499897,0.000147879,0.00007719756,0.000057660924,0.00023322663,0.000011221486,0.0005249625,0.9771066,0.000109953515,0.0003835858],"about_ca_topic_score_codex":0.00009047485,"about_ca_topic_score_gemma":0.00014608019,"teacher_disagreement_score":0.008924378,"about_ca_system_score_codex":0.000044833225,"about_ca_system_score_gemma":0.00003613948,"threshold_uncertainty_score":0.99996614},"labels":[],"label_agreement":null},{"id":"W1817239339","doi":"10.1017/fms.2016.28","title":"DICHROMATIC NUMBER AND FRACTIONAL CHROMATIC NUMBER","year":2016,"lang":"en","type":"preprint","venue":"Forum of Mathematics Sigma","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; Javna Agencija za Raziskovalno Dejavnost RS; Simon Fraser University","keywords":"Chromatic scale; Mathematics; Combinatorics; Conjecture; Bounded function; Graph; Partition (number theory); Integer (computer science); Upper and lower bounds; Discrete mathematics; Computer science; Mathematical analysis","score_opus":0.02279443586487219,"score_gpt":0.30369456760339514,"score_spread":0.28090013173852296,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1817239339","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8945897,0.00023177132,0.04238416,0.00071932626,0.0014435782,0.0015391714,0.00036593265,0.0003076846,0.05841867],"genre_scores_gemma":[0.91568667,0.00007925477,0.08231024,0.000072041876,0.00023948836,0.00010911696,0.00001816583,0.000159453,0.0013255461],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9964377,0.00013258321,0.001432553,0.0005611406,0.00089257595,0.00054344715],"domain_scores_gemma":[0.9944102,0.0023880699,0.0014363123,0.0013819004,0.00020152815,0.00018198347],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0007954477,0.0006912549,0.001406439,0.00013712903,0.00023676571,0.00007144739,0.00066699815,0.00067059515,0.0023581407],"category_scores_gemma":[0.0010132004,0.0004969133,0.0004301,0.00010790828,0.00046818645,0.00014592332,0.0015747478,0.0005978079,0.00008380271],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018129955,0.00041171955,0.0018053693,0.009698256,0.00073063973,0.000012381135,0.0031852468,0.0000034161446,0.00018545715,0.9740696,0.009394234,0.00048554366],"study_design_scores_gemma":[0.0005492813,0.000031099913,0.00020467032,0.0023971542,0.00032252722,0.00017734598,0.0004485288,0.00070999697,0.00066449714,0.99366313,0.00026037078,0.00057140936],"about_ca_topic_score_codex":0.000008506848,"about_ca_topic_score_gemma":0.0000041705107,"teacher_disagreement_score":0.057093125,"about_ca_system_score_codex":0.000083398336,"about_ca_system_score_gemma":0.000107278946,"threshold_uncertainty_score":0.99974823},"labels":[],"label_agreement":null},{"id":"W1817870969","doi":"10.1016/j.ejc.2015.09.006","title":"Intersection theorems for multisets","year":2015,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Multiset; Mathematics; Combinatorics; Intersection (aeronautics); Homomorphism; Graph; Family of sets; Discrete mathematics; Structured program theorem; Set (abstract data type); Computer science","score_opus":0.11506094032244622,"score_gpt":0.33122726990632767,"score_spread":0.21616632958388143,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1817870969","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8505054,0.0003135495,0.10517161,0.00014337251,0.008250087,0.00020970276,0.000004657434,0.000048377962,0.035353236],"genre_scores_gemma":[0.9953884,0.000008828522,0.0039471295,0.000047596135,0.00030672702,4.2754743e-7,4.4112022e-7,0.000036040892,0.00026442032],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99885035,0.00030357164,0.00041222374,0.00007260978,0.00022960249,0.00013164154],"domain_scores_gemma":[0.9985544,0.00025088384,0.0004178614,0.00016492257,0.00047226495,0.00013966316],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023501927,0.00010613366,0.00019418872,0.00011052552,0.0000857907,0.000029754485,0.00029161977,0.00002294226,0.000006124388],"category_scores_gemma":[0.0012349492,0.00007788502,0.00014966048,0.00009548339,0.000047657097,0.000113415015,0.000060248192,0.00019428013,0.0000029808775],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017547896,0.000094863004,0.00022727074,0.000025883628,0.000063137326,0.00004675929,0.0025611422,0.000009226666,0.00006085625,0.9745165,0.019194363,0.0030244908],"study_design_scores_gemma":[0.0019303116,0.0007152502,0.00023019456,0.000042124022,0.000045559547,0.0001588387,0.00044107405,0.000059347476,0.00034547865,0.973191,0.022733156,0.000107642474],"about_ca_topic_score_codex":1.24418e-7,"about_ca_topic_score_gemma":8.264581e-8,"teacher_disagreement_score":0.14488298,"about_ca_system_score_codex":0.000055642042,"about_ca_system_score_gemma":0.00002682668,"threshold_uncertainty_score":0.31760588},"labels":[],"label_agreement":null},{"id":"W1822544575","doi":"10.1090/crmp/043/12","title":"Lattice points on circles, squares in arithmetic progressions and sumsets of squares","year":2007,"lang":"en","type":"book-chapter","venue":"CRM proceedings & lecture notes","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":51,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Arithmetic; Mathematics; Computer science","score_opus":0.04836523270387424,"score_gpt":0.3139277180477621,"score_spread":0.2655624853438879,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1822544575","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30149138,0.007941685,0.00031507385,0.0009884352,0.0007184283,0.0028652216,0.0001787134,0.00041833593,0.68508273],"genre_scores_gemma":[0.99696255,0.00016113267,0.0018514388,0.00024258826,0.0002818118,0.00001922986,0.000012792084,0.0001614573,0.00030702472],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99753153,0.000014086041,0.000671469,0.00069984124,0.0006039361,0.00047913348],"domain_scores_gemma":[0.9974077,0.0012419331,0.00060335296,0.00029974332,0.00030090756,0.00014636655],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005796834,0.00067255937,0.000938355,0.0007714163,0.0002000996,0.000066298926,0.0003660193,0.000966888,0.00010332619],"category_scores_gemma":[0.0014940102,0.0005366212,0.00019460438,0.00013839288,0.0004195197,0.00008885741,0.00020326767,0.0011509295,0.000003037712],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014429686,0.00006226485,0.0008071403,0.0013052358,0.00009357975,0.000021099584,0.0025079672,6.204056e-7,0.00014787263,0.97886527,0.00009515842,0.01594951],"study_design_scores_gemma":[0.00045961316,0.00031092382,0.00085650926,0.0028438987,0.00018242073,0.00004528909,0.00005942801,0.000012816712,0.0027403655,0.9892715,0.0026657253,0.00055148616],"about_ca_topic_score_codex":0.000007654755,"about_ca_topic_score_gemma":0.000036185087,"teacher_disagreement_score":0.6954711,"about_ca_system_score_codex":0.00006615502,"about_ca_system_score_gemma":0.00004920518,"threshold_uncertainty_score":0.99970853},"labels":[],"label_agreement":null},{"id":"W1830735411","doi":"10.1002/jgt.21684","title":"A Note on Hitting Maximum and Maximal Cliques With a Stable Set","year":2012,"lang":"en","type":"preprint","venue":"Journal of Graph Theory","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Omega; Counterexample; Conjecture; Mathematics; Graph; Clique; Clique graph; Split graph; Independent set; Discrete mathematics; Set (abstract data type); Chordal graph; Line graph; Physics; Computer science; 1-planar graph; Graph power","score_opus":0.0324010661079993,"score_gpt":0.30390056357440576,"score_spread":0.27149949746640645,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1830735411","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9841406,0.0020491667,0.0073369835,0.0001628659,0.0010032047,0.00033436844,0.00005906882,0.00005495894,0.0048588193],"genre_scores_gemma":[0.9739089,0.00038178053,0.024552226,0.00025743438,0.0006658998,0.0000069116004,0.0000024569447,0.000098307086,0.00012606748],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99714977,0.00062182185,0.0008558493,0.00030256071,0.0005935841,0.0004764141],"domain_scores_gemma":[0.99589866,0.0013115252,0.0016784389,0.0005894891,0.0002784861,0.00024338414],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.004087642,0.000511101,0.00097247795,0.0005432773,0.00025353997,0.00011496493,0.00051423453,0.00041657966,0.000087280394],"category_scores_gemma":[0.00040268246,0.00032607254,0.00038690754,0.000122892,0.0003491734,0.00017994666,0.0004743972,0.0020238077,9.723315e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0036235016,0.00023796422,0.002889476,0.0011074613,0.0011408764,0.00020419383,0.009694486,0.000036171048,0.00013585824,0.97145236,0.0008952637,0.008582422],"study_design_scores_gemma":[0.0006770553,0.0003987802,0.0011225123,0.0012071829,0.00046956658,0.0005302241,0.0005127236,0.0000064586993,0.0004807287,0.9936757,0.0005182091,0.00040084604],"about_ca_topic_score_codex":0.0000045087836,"about_ca_topic_score_gemma":0.0000034118038,"teacher_disagreement_score":0.022223387,"about_ca_system_score_codex":0.0000633899,"about_ca_system_score_gemma":0.00011394509,"threshold_uncertainty_score":0.9999191},"labels":[],"label_agreement":null},{"id":"W1849270272","doi":"10.1007/s00026-015-0285-6","title":"The Erdős-Ko-Rado Property for Some 2-Transitive Groups","year":2015,"lang":"en","type":"article","venue":"Annals of Combinatorics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Mathematics; Combinatorics; Transitive relation; Coset; Sigma; Group (periodic table); Algebraic number; Degree (music); Discrete mathematics; Physics","score_opus":0.15447487980376223,"score_gpt":0.36156757787513977,"score_spread":0.20709269807137753,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1849270272","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.92992276,0.006787196,0.006263051,0.013556406,0.0069804676,0.0036015394,0.00018119303,0.00034936232,0.032358017],"genre_scores_gemma":[0.9978258,0.00018315116,0.00025641898,0.00034339502,0.00011136139,0.00003855993,0.0000032425426,0.00003341466,0.001204631],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99868965,0.00010890381,0.00034923677,0.00016942393,0.00035641552,0.0003263722],"domain_scores_gemma":[0.99778223,0.0008422882,0.00018815248,0.0004472273,0.00061845494,0.00012166288],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012371483,0.00016981637,0.00029314554,0.000046422498,0.00029365672,0.000031552696,0.00042132082,0.000091996866,0.0000022751742],"category_scores_gemma":[0.00094981166,0.00008810661,0.00018373295,0.00015811951,0.0001963673,0.00015102801,0.00008564661,0.00014917308,0.0000018217028],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000121579345,0.00010052627,0.00005469735,0.00006829746,0.00007960023,0.0000017547126,0.0014481104,0.0000011356808,0.000017112505,0.9658839,0.030883582,0.0013397014],"study_design_scores_gemma":[0.0005834555,0.00032110765,0.00007017737,0.000023807546,0.000029854864,0.0000037503398,0.00043726806,0.00008460325,0.003881973,0.96222216,0.032194633,0.0001471854],"about_ca_topic_score_codex":0.0000056128115,"about_ca_topic_score_gemma":0.0000017647199,"teacher_disagreement_score":0.06790306,"about_ca_system_score_codex":0.000015105794,"about_ca_system_score_gemma":0.00006798267,"threshold_uncertainty_score":0.35928833},"labels":[],"label_agreement":null},{"id":"W1850205219","doi":"10.1016/j.jctb.2017.04.005","title":"The extremal function for disconnected minors","year":2017,"lang":"en","type":"preprint","venue":"Journal of Combinatorial Theory Series B","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"European Research Council; Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Infimum and supremum; Mathematics; Robertson–Seymour theorem; Graph; Disjoint sets; Minor (academic); Null (SQL); Vertex (graph theory); Discrete mathematics; 1-planar graph; Computer science; Humanities; Line graph; Art","score_opus":0.037965161545544364,"score_gpt":0.31332659824379777,"score_spread":0.2753614366982534,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1850205219","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6818331,0.004630898,0.013200462,0.0018117874,0.2854892,0.0024665364,0.00015720457,0.00014363056,0.010267185],"genre_scores_gemma":[0.9887884,0.000279493,0.0012129509,0.000027216813,0.006917646,0.00004001281,0.000006719733,0.00009202905,0.0026355197],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973363,0.00053355563,0.001031889,0.00023714174,0.0005082135,0.0003528531],"domain_scores_gemma":[0.99193954,0.0031812524,0.0028729155,0.0010546164,0.0008328229,0.000118841366],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.004004807,0.0004119219,0.00082792144,0.00011871757,0.0015938889,0.00042358536,0.001493862,0.00046945552,0.000044000393],"category_scores_gemma":[0.00471907,0.00024392141,0.0008504581,0.000042197255,0.0005363476,0.0002868295,0.0006243548,0.0010749408,5.2681935e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.006194027,0.0000616437,0.000017862989,0.00016247775,0.00069666945,0.000008496427,0.00066308136,0.000004235014,0.000044624237,0.9836177,0.0047824993,0.003746638],"study_design_scores_gemma":[0.0012525673,0.0005858207,0.0000992757,0.00021891492,0.0005192385,0.000055030276,0.00046227546,0.0000047160847,0.00048494237,0.9647946,0.031249115,0.00027353805],"about_ca_topic_score_codex":9.88477e-7,"about_ca_topic_score_gemma":0.00000307135,"teacher_disagreement_score":0.3069553,"about_ca_system_score_codex":0.000085651554,"about_ca_system_score_gemma":0.0002654221,"threshold_uncertainty_score":0.9997059},"labels":[],"label_agreement":null},{"id":"W1864140179","doi":"10.19086/da.613","title":"Monochromatic sums and products","year":2016,"lang":"en","type":"article","venue":"Discrete Analysis","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Banff International Research Station for Mathematical Innovation and Discovery","keywords":"Monochromatic color; Mathematics; Combinatorics; Set (abstract data type); Field (mathematics); Ramsey theory; Multiplication (music); Fraction (chemistry); Finite set; Discrete mathematics; Number theory; Arithmetic; Pure mathematics; Computer science; Physics; Mathematical analysis","score_opus":0.02151046206878525,"score_gpt":0.28861734320284294,"score_spread":0.26710688113405767,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1864140179","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99114823,0.0001860628,0.0055779456,0.0005876824,0.00004038662,0.00009390824,0.00001374042,0.000059050937,0.0022929665],"genre_scores_gemma":[0.9955304,0.00004986709,0.0029690235,0.00004017358,0.0000495576,0.0000071949753,0.000002390201,0.000012407271,0.0013389403],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99915737,0.00006239823,0.0002010747,0.00025337064,0.00015378912,0.00017202189],"domain_scores_gemma":[0.9990482,0.00028515002,0.00008514044,0.0004768838,0.000044332886,0.000060302755],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002341055,0.00012302466,0.00028871556,0.00017794892,0.00012628132,0.000023789516,0.00012624612,0.000043266315,0.00017358451],"category_scores_gemma":[0.0004416231,0.00006353624,0.00013449465,0.0004588795,0.000112668524,0.00009552504,0.000084998144,0.00003599652,0.0000060783555],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004050548,0.00004928327,0.04824511,0.0002002867,0.0057408884,0.000018455325,0.0028366332,0.000003364405,0.00566689,0.9182885,0.0015626798,0.017347394],"study_design_scores_gemma":[0.00036691385,0.00003790723,0.020936698,0.00003789354,0.0030485708,0.000004046536,0.00018878533,0.0003224667,0.0034968322,0.9706147,0.00060301606,0.0003421937],"about_ca_topic_score_codex":0.0000093181925,"about_ca_topic_score_gemma":0.000015896658,"teacher_disagreement_score":0.052326165,"about_ca_system_score_codex":0.000010612961,"about_ca_system_score_gemma":0.00000601379,"threshold_uncertainty_score":0.25909325},"labels":[],"label_agreement":null},{"id":"W1866996682","doi":"10.1002/jgt.21735","title":"Gallai's Conjecture For Graphs of Girth at Least Four","year":2013,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Thompson Rivers University","funders":"","keywords":"Combinatorics; Mathematics; Conjecture; Girth (graph theory); Simple graph; Graph; Discrete mathematics","score_opus":0.028004410505626045,"score_gpt":0.27200749115219947,"score_spread":0.24400308064657342,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1866996682","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9901707,0.0008871184,0.004689545,0.00024704356,0.0008791043,0.00046785214,0.00003207725,0.000022575581,0.0026039549],"genre_scores_gemma":[0.99095213,0.00009667506,0.007889308,0.00017967145,0.0001964182,0.000010216872,0.0000010453763,0.00004869647,0.0006258347],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979945,0.00024421178,0.00088027946,0.00015980341,0.00039589076,0.00032533467],"domain_scores_gemma":[0.9962827,0.0014863699,0.0011428461,0.0003960803,0.00053232716,0.00015967552],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001461016,0.0002604471,0.0006632955,0.00041724142,0.00021671302,0.00002537355,0.00052726973,0.00018680507,0.0006041999],"category_scores_gemma":[0.0005713165,0.00017269504,0.00086532807,0.00021721736,0.00034671286,0.00018739095,0.00009446447,0.00031492062,0.0000026721973],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00048298683,0.000091541086,0.0014406315,0.0002251924,0.00049243483,0.000008675265,0.0010886596,0.00000932636,0.0033565063,0.9789581,0.011307085,0.0025388987],"study_design_scores_gemma":[0.0012573843,0.00043691398,0.0017863184,0.000111942216,0.00018336116,0.00028545794,0.00038984328,0.0000065612053,0.0033821894,0.99091935,0.0010475017,0.00019320361],"about_ca_topic_score_codex":0.0000020676955,"about_ca_topic_score_gemma":0.0000039244105,"teacher_disagreement_score":0.011961261,"about_ca_system_score_codex":0.000028625016,"about_ca_system_score_gemma":0.000041447296,"threshold_uncertainty_score":0.70422995},"labels":[],"label_agreement":null},{"id":"W1871140597","doi":"10.1002/jgt.21995","title":"Rainbow Arborescence in Random Digraphs","year":2015,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University; University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; Engineering and Physical Sciences Research Council; Ryerson University; National Science Foundation","keywords":"Combinatorics; Mathematics; Rainbow; Vertex (graph theory); Random graph; Discrete mathematics; Tree (set theory); Graph; Asymptotically optimal algorithm; Algorithm","score_opus":0.04533237273199347,"score_gpt":0.30877191099375534,"score_spread":0.26343953826176186,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1871140597","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9831974,0.0022677414,0.003091636,0.00016934023,0.0012814696,0.00019080762,0.000003823628,0.00002884071,0.0097689405],"genre_scores_gemma":[0.99576324,0.00013004096,0.003583826,0.00018224466,0.0001938129,0.000002351271,2.4477646e-7,0.00002557945,0.00011868361],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976968,0.0006083769,0.000768267,0.00013664398,0.0004989084,0.00029099602],"domain_scores_gemma":[0.9975547,0.0011343091,0.00053243025,0.00032409446,0.00023614556,0.0002183088],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0054140957,0.00019616233,0.0005219923,0.0006478806,0.00007570999,0.000030594398,0.00053413224,0.00011910976,0.000043858974],"category_scores_gemma":[0.0020365189,0.00013426255,0.0003424702,0.00047239757,0.00027314355,0.00023198518,0.00007172444,0.00051916507,0.0000017204497],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0018722097,0.00014580657,0.0059078718,0.000032066706,0.00011185722,0.00017264177,0.0044658347,0.000021329703,0.00016754521,0.9822738,0.0027049358,0.002124075],"study_design_scores_gemma":[0.0035636732,0.00016426659,0.001490265,0.00012804786,0.000050338902,0.00018458793,0.0010059022,0.0000065438508,0.00037169573,0.99204373,0.0008278259,0.00016313995],"about_ca_topic_score_codex":0.0000023967682,"about_ca_topic_score_gemma":0.0000047971657,"teacher_disagreement_score":0.012565817,"about_ca_system_score_codex":0.000037558184,"about_ca_system_score_gemma":0.00010678892,"threshold_uncertainty_score":0.54750675},"labels":[],"label_agreement":null},{"id":"W1881477017","doi":"10.1016/j.disc.2015.09.020","title":"Entropy of symmetric graphs","year":2015,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Combinatorics; Mathematics; Discrete mathematics; Perfect graph theorem; Perfect graph; Factor-critical graph; Circulant graph; Line graph; Disjoint sets; Windmill graph; Voltage graph; Graph power; Graph","score_opus":0.051681198523323764,"score_gpt":0.3078868075246955,"score_spread":0.25620560900137174,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1881477017","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.92939264,0.00035153533,0.0050855177,0.00007889257,0.0004975523,0.0004424766,0.000041040952,0.00016597401,0.0639444],"genre_scores_gemma":[0.92305636,0.000016763199,0.07635623,0.000035268167,0.000050479353,0.000010172021,0.0000043820196,0.000043771946,0.00042658125],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983978,0.00006309072,0.00056338124,0.00017726496,0.00052701245,0.00027140975],"domain_scores_gemma":[0.998224,0.00046511294,0.0003258619,0.0006513228,0.00017275593,0.00016092275],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065038796,0.00021226457,0.00046201918,0.00024832913,0.00007256541,0.000020133495,0.0003925499,0.00010458359,0.000066353845],"category_scores_gemma":[0.001343466,0.00015377767,0.00019962597,0.0005133295,0.00016708826,0.00008323245,0.00017259602,0.00013877652,0.000012534255],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011589609,0.000087911445,0.0002852585,0.00023459065,0.00006992743,0.000003831349,0.0030970133,0.000002147217,0.00009441396,0.99418354,0.001693449,0.0002363076],"study_design_scores_gemma":[0.000456847,0.00008767105,0.00004594624,0.000056869492,0.00009179568,0.000017830798,0.0011037707,0.00052650453,0.001675493,0.99531424,0.00043761192,0.0001854241],"about_ca_topic_score_codex":0.0000038364524,"about_ca_topic_score_gemma":9.585838e-7,"teacher_disagreement_score":0.07127071,"about_ca_system_score_codex":0.00002439895,"about_ca_system_score_gemma":0.000031598323,"threshold_uncertainty_score":0.6270871},"labels":[],"label_agreement":null},{"id":"W188570670","doi":"","title":"On Multicolor Ramsey Numbers for Even Cycles in Graphs.","year":2007,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Ramsey's theorem; Combinatorics; Discrete mathematics; Graph","score_opus":0.02371764824039489,"score_gpt":0.314858636182584,"score_spread":0.29114098794218907,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W188570670","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9928535,0.000029884799,0.000068276386,0.00005793941,0.0018250025,0.0005506266,0.000007025205,0.00007457223,0.004533141],"genre_scores_gemma":[0.9971382,0.0000044005315,0.00245397,0.00018878606,0.000011058717,0.000033405555,0.0000035660944,0.00003773691,0.00012887528],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987612,0.00004992055,0.00033838,0.00025197945,0.00020080268,0.00039776345],"domain_scores_gemma":[0.99756426,0.0018481899,0.00010453008,0.00034707435,0.00005135422,0.00008460714],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00089644484,0.0001820949,0.00026359278,0.00017124462,0.00014797463,0.000017769593,0.0002613342,0.0001642762,0.0000243222],"category_scores_gemma":[0.00068941514,0.00015919475,0.00013456393,0.00020430259,0.00007996315,0.000060952687,0.00005406685,0.00019919181,0.0000055764795],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018085132,0.00018037198,0.0037338126,0.00004111968,0.000030526895,0.000009640441,0.0008940212,0.0000022691574,0.00008212647,0.99204904,0.0017948562,0.0010013736],"study_design_scores_gemma":[0.0019360656,0.00013139022,0.007872901,0.00004226964,0.000016535212,0.000002216855,0.00016761215,0.000039172308,0.001281164,0.98783857,0.00047232973,0.00019980615],"about_ca_topic_score_codex":0.00002129913,"about_ca_topic_score_gemma":0.000053900432,"teacher_disagreement_score":0.004404266,"about_ca_system_score_codex":0.000064948435,"about_ca_system_score_gemma":0.0000143916395,"threshold_uncertainty_score":0.6491774},"labels":[],"label_agreement":null},{"id":"W1891033505","doi":"10.1023/a:1024545026029","title":"On sums which are powers","year":2003,"lang":"en","type":"article","venue":"Acta Mathematica Academiae Scientiarum Hungaricae","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Cardinality (data modeling); Combinatorics; Element (criminal law); Set (abstract data type); Discrete mathematics","score_opus":0.028534760072438374,"score_gpt":0.2985598121552844,"score_spread":0.270025052082846,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1891033505","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.68170923,0.00016096194,0.00285021,0.0028089501,0.002384795,0.0012876389,0.000042813506,0.0006985374,0.30805686],"genre_scores_gemma":[0.9834972,0.000022833869,0.010374154,0.0008253933,0.00007898104,0.00004528677,0.0000035261883,0.00010202422,0.005050587],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9954595,0.0003712172,0.00086056214,0.0009166697,0.0012926518,0.0010993879],"domain_scores_gemma":[0.99556977,0.0017772473,0.00057684316,0.0014696595,0.0002005076,0.00040598147],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0027136486,0.00056635815,0.00073346787,0.0004239914,0.0009914392,0.00016782264,0.0012170507,0.0005753194,0.0014870316],"category_scores_gemma":[0.00817089,0.00043662282,0.00030448608,0.001315478,0.00037301183,0.00033138695,0.00027176418,0.0013014955,0.00023505186],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016723738,0.00021551363,0.00018503667,0.0001431216,0.00008986557,0.000007085538,0.0012225537,0.0000025454674,0.0007556846,0.9447549,0.052523457,0.00008349828],"study_design_scores_gemma":[0.00056836737,0.00008044527,0.0003207685,0.00019300045,0.00012208073,0.000059235626,0.0006059573,0.00013886121,0.0044525303,0.97904783,0.013800972,0.000609969],"about_ca_topic_score_codex":9.693309e-7,"about_ca_topic_score_gemma":0.0000037195393,"teacher_disagreement_score":0.30300626,"about_ca_system_score_codex":0.000112562,"about_ca_system_score_gemma":0.0000841293,"threshold_uncertainty_score":0.99980855},"labels":[],"label_agreement":null},{"id":"W1897016437","doi":"10.1016/j.ejc.2016.04.005","title":"Positive independence densities of finite rank countable hypergraphs are achieved by finite hypergraphs","year":2016,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"National Science Foundation","keywords":"Mathematics; Countable set; Combinatorics; Rank (graph theory); Independence (probability theory); Discrete mathematics; Independence number; Graph; Statistics","score_opus":0.01560923728923203,"score_gpt":0.23327514059379265,"score_spread":0.21766590330456062,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1897016437","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.980358,0.0015494023,0.008166096,0.00025634878,0.0014343148,0.00015347294,0.00012692915,0.000040063438,0.007915349],"genre_scores_gemma":[0.9975582,0.00070036727,0.0006660743,0.00014989445,0.0000856868,6.3686394e-7,0.0000013362807,0.00007166395,0.00076614204],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9966879,0.00086875766,0.0010143259,0.00021512798,0.0008539162,0.00035999378],"domain_scores_gemma":[0.99479365,0.0020857244,0.0014859923,0.0004523659,0.0009962305,0.00018601112],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001938974,0.00032415352,0.000673322,0.00031243794,0.00023243207,0.000043230197,0.00075900083,0.000092812654,0.00005155573],"category_scores_gemma":[0.0013194118,0.00021372492,0.00033993655,0.00039133968,0.0003254852,0.0003421123,0.00017926228,0.00048466172,0.0000068577306],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0018657362,0.0012323302,0.039164227,0.00040986793,0.0016562366,0.0013954579,0.0063945386,0.00004988567,0.019025838,0.8898799,0.03384755,0.00507843],"study_design_scores_gemma":[0.007915202,0.0020317344,0.013252465,0.0018917838,0.0004976119,0.00048111673,0.0015728568,0.000024023204,0.020566728,0.9423564,0.008364843,0.0010452084],"about_ca_topic_score_codex":0.0000018223652,"about_ca_topic_score_gemma":6.877396e-7,"teacher_disagreement_score":0.052476525,"about_ca_system_score_codex":0.000057641915,"about_ca_system_score_gemma":0.000063506464,"threshold_uncertainty_score":0.87154496},"labels":[],"label_agreement":null},{"id":"W1913153908","doi":"10.1016/j.aim.2016.01.019","title":"General systems of linear forms: Equidistribution and true complexity","year":2016,"lang":"en","type":"preprint","venue":"Advances in Mathematics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada; Fonds Québécois de la Recherche sur la Nature et les Technologies; National Science Foundation","keywords":"Mathematics; Abelian group; Conjecture; Order (exchange); Orthogonality; Bounded function; Prime (order theory); Group (periodic table); Combinatorics; Distribution (mathematics); Function (biology); Discrete mathematics; Pure mathematics; Mathematical analysis","score_opus":0.05391811351336887,"score_gpt":0.348005239041537,"score_spread":0.2940871255281681,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1913153908","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7746144,0.00990057,0.19942497,0.000051591356,0.0016450796,0.0016966425,0.0010683355,0.0001460823,0.01145232],"genre_scores_gemma":[0.9220507,0.0023402898,0.075021066,0.000008699575,0.00023080363,0.00007725509,0.000039713428,0.000059294536,0.00017214767],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99777627,0.000102036516,0.0010833015,0.00036142877,0.00035812863,0.00031881063],"domain_scores_gemma":[0.9974587,0.0006810185,0.00088040973,0.0007825802,0.0001329167,0.00006440243],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008039528,0.0003737125,0.0009809794,0.00014392138,0.00009830799,0.000022529,0.0004227078,0.00034243095,0.000019190082],"category_scores_gemma":[0.00053220434,0.00026000364,0.00013575243,0.00009149143,0.00044390187,0.00015893634,0.000804128,0.00037331626,0.0000010234787],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018899655,0.00008264382,0.00033158506,0.005872395,0.000044390992,0.0000033187519,0.00094528846,0.000083608575,0.000044709042,0.99166507,0.000027244329,0.0008808726],"study_design_scores_gemma":[0.0003873938,0.00003783627,0.00007236425,0.001576318,0.000055878794,0.000018682842,0.00022568199,0.0055987495,0.00030287725,0.99101096,0.00041022233,0.00030301075],"about_ca_topic_score_codex":0.000006432654,"about_ca_topic_score_gemma":0.000011456192,"teacher_disagreement_score":0.14743632,"about_ca_system_score_codex":0.000088868095,"about_ca_system_score_gemma":0.000033474036,"threshold_uncertainty_score":0.9999852},"labels":[],"label_agreement":null},{"id":"W1918750269","doi":"10.55016/ojs/cdm.v10i1.62186","title":"Graphs embedded into finite projective planes","year":2015,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"California State University, Fresno; National Science Foundation","keywords":"Projective test; Projective plane; Mathematics; Pure mathematics; Computer science; Algebra over a field; Geometry","score_opus":0.03742679694509653,"score_gpt":0.34990496707552243,"score_spread":0.3124781701304259,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1918750269","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4087312,0.0004994241,0.53069526,0.0023535558,0.0018386155,0.0051118596,0.0017261929,0.0014723869,0.047571532],"genre_scores_gemma":[0.9225346,0.0000067329215,0.07581647,0.00021944051,0.00018193033,0.00022643253,0.0000616907,0.000065264016,0.00088743016],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99787045,0.00014015239,0.0006180596,0.00036255972,0.0004895942,0.000519199],"domain_scores_gemma":[0.996833,0.0010200212,0.00021934975,0.00085067353,0.00065421767,0.00042269874],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009226863,0.00036160764,0.0005630296,0.00027875474,0.0004702398,0.000104708415,0.0004939417,0.00018612586,0.000057268884],"category_scores_gemma":[0.0071358117,0.0002802197,0.00019803167,0.0006035044,0.00019096643,0.00016259808,0.00032267906,0.00026869107,0.00010243375],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004440249,0.000118020296,0.00006392766,0.000093257586,0.00012763489,0.000011225341,0.018591825,0.000038477465,0.00008202116,0.9715134,0.009124827,0.00019101833],"study_design_scores_gemma":[0.00075005577,0.00015862967,0.000027906977,0.00010401981,0.00013566669,0.000028489767,0.003445255,0.0011993728,0.0009977571,0.9893091,0.0034385181,0.00040523623],"about_ca_topic_score_codex":0.000012451669,"about_ca_topic_score_gemma":0.000023225395,"teacher_disagreement_score":0.5138034,"about_ca_system_score_codex":0.00016474137,"about_ca_system_score_gemma":0.00013278761,"threshold_uncertainty_score":0.999965},"labels":[],"label_agreement":null},{"id":"W1926931217","doi":"10.1002/rsa.20781","title":"The diameter of inhomogeneous random graphs","year":2018,"lang":"en","type":"article","venue":"Random Structures and Algorithms","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Metric space; Separable space; Metric (unit); Kernel (algebra); Space (punctuation); Combinatorics; Random graph; Constant (computer programming); Upper and lower bounds; Discrete mathematics; Mathematical analysis; Graph; Computer science","score_opus":0.01626645147185195,"score_gpt":0.27604747824386133,"score_spread":0.25978102677200937,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1926931217","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97616816,0.004240825,0.013015611,0.0001638092,0.0020287815,0.00088260527,0.000071520146,0.00009747135,0.0033312233],"genre_scores_gemma":[0.9883246,0.0005002064,0.010399145,0.00009752524,0.00042560726,0.000014489967,0.0000020419852,0.0000318375,0.00020456509],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984739,0.00017813695,0.00045187218,0.0002705382,0.00029519683,0.000330369],"domain_scores_gemma":[0.9976195,0.0014714216,0.00021665847,0.00046549056,0.00013538475,0.000091513066],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060349,0.00024902265,0.00048157055,0.00007688072,0.0007740558,0.00006317152,0.00030909502,0.00012233591,0.00007762938],"category_scores_gemma":[0.00038717105,0.00012952188,0.00021316014,0.00015566655,0.0010139379,0.000050752566,0.0001095285,0.00016802471,6.4521026e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0032533193,0.000040224186,0.0009027953,0.0001466442,0.0007538034,0.000016552482,0.0042110793,0.0000028063237,0.0020566995,0.75124896,0.0029777575,0.23438935],"study_design_scores_gemma":[0.00625629,0.00015448008,0.000958316,0.000020949394,0.00010026919,0.00008005529,0.00014388352,0.00022062124,0.007500199,0.98109937,0.0032577985,0.00020776261],"about_ca_topic_score_codex":0.000019180708,"about_ca_topic_score_gemma":0.00001815186,"teacher_disagreement_score":0.23418158,"about_ca_system_score_codex":0.0000059393037,"about_ca_system_score_gemma":0.000015643474,"threshold_uncertainty_score":0.59534895},"labels":[],"label_agreement":null},{"id":"W1927650282","doi":"10.37236/331","title":"The $t$-Stability Number of a Random Graph","year":2010,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":22,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Commonwealth Scholarship Commission; University of Oxford; Natural Sciences and Engineering Research Council of Canada; McGill University","keywords":"Mathematics; Combinatorics; Vertex (graph theory); Graph; Degree (music); Discrete mathematics; Random graph","score_opus":0.010337783308994763,"score_gpt":0.27857065461001973,"score_spread":0.26823287130102497,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1927650282","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9933027,0.00076821964,0.0012723601,0.0004604686,0.0012709831,0.00015604332,9.810152e-7,0.000009811015,0.002758426],"genre_scores_gemma":[0.999306,0.0004012332,0.000042832944,0.000021070075,0.000106499414,0.0000021412438,7.794862e-8,0.0000175977,0.00010255383],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99807996,0.000295122,0.0006366445,0.00007720118,0.0004911301,0.00041994103],"domain_scores_gemma":[0.99558234,0.00264223,0.00072936865,0.0005805059,0.0004103431,0.000055190372],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0048920256,0.00014352189,0.0003401897,0.00003663491,0.0004110471,0.000025791738,0.00094511104,0.000090399335,0.00005457542],"category_scores_gemma":[0.0011763716,0.000065462285,0.00033121,0.00028520887,0.00038121062,0.000072560644,0.00008450694,0.00145777,8.563391e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024023729,0.00008319696,0.0007731288,0.000013620202,0.00014316934,9.3743245e-7,0.0005721159,4.16428e-7,0.0004614667,0.9970081,0.00036540983,0.00033819428],"study_design_scores_gemma":[0.0012671932,0.00012236788,0.0002308529,0.000008377052,0.00010410232,0.00020035941,0.00017854419,0.000008221503,0.0034461443,0.99170256,0.0026555047,0.000075791795],"about_ca_topic_score_codex":0.0000029030216,"about_ca_topic_score_gemma":0.0000139793865,"teacher_disagreement_score":0.006003286,"about_ca_system_score_codex":0.00004368326,"about_ca_system_score_gemma":0.00021797004,"threshold_uncertainty_score":0.63333666},"labels":[],"label_agreement":null},{"id":"W1945239439","doi":"10.1002/jgt.21903","title":"Interval Minors of Complete Bipartite Graphs","year":2015,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University; Natural Sciences and Engineering Research Council of Canada","funders":"American Roentgen Ray Society","keywords":"Combinatorics; Bipartite graph; Mathematics; Interval (graph theory); Minor (academic); Robertson–Seymour theorem; Discrete mathematics; Complete bipartite graph; Indifference graph; Cograph; Upper and lower bounds; Strong perfect graph theorem; 1-planar graph; Chordal graph; Graph; Law","score_opus":0.0846462219045069,"score_gpt":0.31779192468737305,"score_spread":0.23314570278286617,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1945239439","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9900452,0.0010112396,0.002434435,0.00007047244,0.0012178456,0.00009497133,0.000015884187,0.000018453615,0.0050914977],"genre_scores_gemma":[0.9939668,0.000043344484,0.005575701,0.00011224649,0.00013503894,9.743005e-7,5.742714e-7,0.00002758672,0.000137731],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99774736,0.00045314466,0.00093956053,0.00011613868,0.00050733634,0.00023646488],"domain_scores_gemma":[0.99730015,0.0006461697,0.0009981709,0.0003631187,0.00047245083,0.0002199298],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003039794,0.00019405101,0.00059437315,0.0005313427,0.00007398167,0.00001705512,0.0005604493,0.00009929279,0.00009551712],"category_scores_gemma":[0.00075111503,0.00013462052,0.0005563828,0.00032915245,0.0004397208,0.0001796041,0.000111990434,0.0003374642,0.0000023323714],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006351209,0.00012624556,0.0022088634,0.000070325244,0.00034494314,0.000032344,0.0034061642,0.000007897497,0.00090432446,0.9857896,0.0047995476,0.0016746148],"study_design_scores_gemma":[0.0009273896,0.00044985194,0.00078746554,0.00012674314,0.00015456934,0.0002127159,0.0011693189,0.0000064726964,0.0017680544,0.9926857,0.0015663502,0.00014536368],"about_ca_topic_score_codex":0.0000023598955,"about_ca_topic_score_gemma":0.0000023832295,"teacher_disagreement_score":0.0068960954,"about_ca_system_score_codex":0.00002048525,"about_ca_system_score_gemma":0.00005386608,"threshold_uncertainty_score":0.5489666},"labels":[],"label_agreement":null},{"id":"W1956715345","doi":"10.37236/3000","title":"Permutations Destroying Arithmetic Structure","year":2015,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Mathematics; Permutation (music); Abelian group; Arithmetic progression; Combinatorics; Discrete mathematics; Arithmetic","score_opus":0.040530509911866554,"score_gpt":0.30660721040063416,"score_spread":0.2660767004887676,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1956715345","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9823203,0.0021908376,0.013340265,0.00043371553,0.0008903999,0.000109675624,0.0000016656489,0.000021331596,0.00069177477],"genre_scores_gemma":[0.9993063,0.000057948953,0.00024894456,0.000060862505,0.0001726858,8.887566e-7,4.2248104e-7,0.000023842129,0.00012810365],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984209,0.00019663264,0.0004013141,0.000078263576,0.0004997285,0.00040319652],"domain_scores_gemma":[0.99845326,0.00037794694,0.0004139895,0.00027491682,0.00037046755,0.00010942367],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001170444,0.00013912693,0.00025512438,0.0001137418,0.00020260962,0.00004122488,0.0005699043,0.00007389705,0.000012059116],"category_scores_gemma":[0.000720327,0.00008642218,0.0001283433,0.0003232103,0.00011585704,0.00012518295,0.00006639376,0.0008591039,9.636757e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026573798,0.000032705128,0.00020298063,0.0000066257585,0.000093434704,0.000009215506,0.0018052108,0.00006722522,0.000042648528,0.9967791,0.00065551867,0.0002787808],"study_design_scores_gemma":[0.00070837454,0.0002908381,0.00019208585,0.000013822469,0.00013439114,0.0006761261,0.0006331656,0.00006168586,0.00023356079,0.9956241,0.0013308582,0.00010094561],"about_ca_topic_score_codex":0.0000016371765,"about_ca_topic_score_gemma":0.0000024925437,"teacher_disagreement_score":0.016985966,"about_ca_system_score_codex":0.0002539152,"about_ca_system_score_gemma":0.00042302866,"threshold_uncertainty_score":0.37324268},"labels":[],"label_agreement":null},{"id":"W1963632717","doi":"10.1016/j.aim.2012.11.004","title":"Finite order spreading models","year":2012,"lang":"en","type":"article","venue":"Advances in Mathematics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":17,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Mathematics; Order (exchange); Applied mathematics; Calculus (dental)","score_opus":0.04100416711810919,"score_gpt":0.3272727660808902,"score_spread":0.286268598962781,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1963632717","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17189689,0.008636417,0.47944647,0.000069345384,0.0018594374,0.00087361276,0.000019696205,0.0003888438,0.3368093],"genre_scores_gemma":[0.7246618,0.0004083104,0.27413988,0.00007278382,0.00014595798,0.000028500366,0.0000015305955,0.000046323592,0.00049485394],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985411,0.000050120456,0.0004652187,0.00016466303,0.00026938782,0.0005094716],"domain_scores_gemma":[0.9978628,0.0013480922,0.00017131999,0.00047845137,0.00005006168,0.00008927127],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006631496,0.0002231172,0.00034630718,0.00013429907,0.00012452631,0.00001818859,0.00029354237,0.000103440965,0.00015112034],"category_scores_gemma":[0.00074193004,0.00017810914,0.0000718491,0.00031729857,0.00009468299,0.0009255782,0.00014327555,0.00022399373,0.000019485207],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000047453027,0.0001419242,0.0007022536,0.0002608386,0.000012404438,0.0000020691898,0.0064930287,0.00082912593,0.000010977057,0.98900604,0.000061880746,0.0024747227],"study_design_scores_gemma":[0.00022004328,0.000010620238,0.000025197205,0.00012483733,0.000021283417,0.000013233358,0.00069232343,0.009373318,0.00017359426,0.98701644,0.002092298,0.00023682664],"about_ca_topic_score_codex":9.465393e-7,"about_ca_topic_score_gemma":0.0000046740283,"teacher_disagreement_score":0.55276495,"about_ca_system_score_codex":0.000039817085,"about_ca_system_score_gemma":0.000009618126,"threshold_uncertainty_score":0.726308},"labels":[],"label_agreement":null},{"id":"W1963635783","doi":"10.1016/s0012-365x(02)00298-4","title":"Solution of an outstanding conjecture: the non-existence of universal cycles with k=n−2","year":2002,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University; Memorial University of Newfoundland; University of Saskatchewan; York University; University of Guelph; Simon Fraser University; University of Manitoba; University of Toronto; Carleton University","funders":"University of British Columbia; York University; Simon Fraser University; University of Saskatchewan","keywords":"Mathematics; Conjecture; Combinatorics; Sequence (biology); Word (group theory); Discrete mathematics; Set (abstract data type)","score_opus":0.0354910501675276,"score_gpt":0.2709126714978926,"score_spread":0.235421621330365,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1963635783","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9478272,0.0000740964,0.039161935,0.000089347675,0.00007403541,0.0003663723,0.000039787392,0.000042995616,0.0123241935],"genre_scores_gemma":[0.96207404,0.000014550558,0.03771703,0.00001063271,0.000026270453,0.0000031042027,0.0000020313955,0.000025753765,0.00012661451],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988978,0.00005540552,0.00036433633,0.0001458822,0.0003453398,0.00019122145],"domain_scores_gemma":[0.99852425,0.00035474455,0.00041058223,0.0005851822,0.00008007332,0.000045155903],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030936344,0.00017505435,0.00034231142,0.00006563716,0.00016840319,0.000015412164,0.00037601066,0.000075470205,0.00008598467],"category_scores_gemma":[0.00010381051,0.00009598041,0.00009843081,0.00018703661,0.0004518255,0.00011601852,0.00008097416,0.00013152127,8.87787e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003121673,0.0001255131,0.0002166121,0.0005455231,0.00012771737,0.0000053506583,0.026869463,0.000057565274,0.00082340307,0.970704,0.000102796555,0.00039080705],"study_design_scores_gemma":[0.0010258948,0.0005056953,0.00030585055,0.0005067271,0.00038078206,0.00007448545,0.013728708,0.042193897,0.01197304,0.9288546,0.000050854273,0.00039945543],"about_ca_topic_score_codex":0.0000070173705,"about_ca_topic_score_gemma":0.000011211511,"teacher_disagreement_score":0.042136334,"about_ca_system_score_codex":0.000019418121,"about_ca_system_score_gemma":0.00001014648,"threshold_uncertainty_score":0.39139673},"labels":[],"label_agreement":null},{"id":"W1963702185","doi":"10.1007/s00373-004-0571-2","title":"Random Hypergraph Processes with Degree Restrictions","year":2004,"lang":"en","type":"article","venue":"Graphs and Combinatorics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Hypergraph; Mathematics; Combinatorics; Tuple; Degree (music); Equivalence (formal languages); Infinity; Discrete mathematics","score_opus":0.029094748128303937,"score_gpt":0.24837416858877107,"score_spread":0.21927942046046714,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1963702185","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9886135,0.0012525616,0.0015696822,0.00014223794,0.000268055,0.00026669534,0.0000069914963,0.00019792575,0.0076823374],"genre_scores_gemma":[0.99710774,0.0008602295,0.001785655,0.00005905182,0.000016122021,0.00003226662,0.0000018197419,0.00002541931,0.00011170058],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990769,0.000024372344,0.0001872854,0.00024112363,0.00022988117,0.00024042852],"domain_scores_gemma":[0.9991217,0.0002505751,0.00008604764,0.00028254135,0.00014939607,0.00010968777],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012491959,0.00019454365,0.00023566127,0.00016884807,0.0005523287,0.00005055975,0.00015428534,0.000091775895,0.0000053663443],"category_scores_gemma":[0.00015095218,0.00013335986,0.000058863126,0.00084970886,0.00017281127,0.00010960666,0.000050834962,0.00017763078,6.545813e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006263428,0.00010936757,0.004587818,0.00012038053,0.000056574692,0.000013814776,0.00044001636,0.000004235875,0.000006205922,0.9941353,0.00016785329,0.00029576576],"study_design_scores_gemma":[0.0026979204,0.0002104434,0.0023477708,0.00005708908,0.00008377531,0.00007147575,0.00020689609,9.933212e-7,0.00018021173,0.9932921,0.00063937093,0.00021194188],"about_ca_topic_score_codex":0.000024517638,"about_ca_topic_score_gemma":0.00004003329,"teacher_disagreement_score":0.008494222,"about_ca_system_score_codex":0.000014342592,"about_ca_system_score_gemma":0.000073345196,"threshold_uncertainty_score":0.54382575},"labels":[],"label_agreement":null},{"id":"W1965328002","doi":"10.1006/jcta.2000.3144","title":"Logarithmic Concavity and sl2(C)","year":2001,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"SL2(R); Logarithm; Mathematics; Combinatorics; Graph; Sequence (biology); Discrete mathematics; Pure mathematics; Mathematical analysis","score_opus":0.01844273816181695,"score_gpt":0.27882510868235116,"score_spread":0.2603823705205342,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1965328002","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98869646,0.00043198324,0.00038703874,0.0001881793,0.004674007,0.00010379839,0.0000027920155,0.000023803279,0.0054919245],"genre_scores_gemma":[0.997321,0.00024586802,0.0010796288,0.00008411123,0.00080855435,0.0000010854193,1.9649688e-7,0.000020210173,0.000439329],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99867034,0.00029453734,0.00046731872,0.00010250071,0.0002697408,0.00019554135],"domain_scores_gemma":[0.9983149,0.00072622893,0.00041356805,0.00020301098,0.0002179494,0.00012431004],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015835563,0.00016198568,0.00041607383,0.00009890544,0.000220327,0.000051564937,0.00024906866,0.0001232521,0.0001720201],"category_scores_gemma":[0.00072483777,0.000118650576,0.0001353323,0.00011585606,0.00029552614,0.0003246448,0.000113405455,0.00034170222,8.109782e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011123996,0.00005793851,0.0005672073,0.000022669494,0.00009832393,0.000093123286,0.0008571464,3.2428258e-7,0.00020837365,0.9947231,0.00063011074,0.0016293168],"study_design_scores_gemma":[0.0013532819,0.00046851113,0.00037890818,0.000038758204,0.000071046146,0.0010870531,0.00042246107,0.0000011224487,0.00051755866,0.9758917,0.01963534,0.00013427432],"about_ca_topic_score_codex":9.894369e-7,"about_ca_topic_score_gemma":6.4541916e-7,"teacher_disagreement_score":0.01900523,"about_ca_system_score_codex":0.000034939185,"about_ca_system_score_gemma":0.00004432311,"threshold_uncertainty_score":0.483843},"labels":[],"label_agreement":null},{"id":"W1966530078","doi":"10.1007/s00493-011-2545-3","title":"On the threshold for k-regular subgraphs of random graphs","year":2011,"lang":"en","type":"article","venue":"COMBINATORICA","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; Toronto Metropolitan University","funders":"","keywords":"Combinatorics; Mathematics; Graph; Induced subgraph; Factor-critical graph; Random regular graph; Random graph; Discrete mathematics; Line graph; Graph power; Pathwidth; Vertex (graph theory)","score_opus":0.0697965727121189,"score_gpt":0.27221612325454037,"score_spread":0.20241955054242144,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1966530078","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94533676,0.00036920045,0.0010279622,0.00011118952,0.0011190054,0.001138781,0.000017955947,0.0000982879,0.050780844],"genre_scores_gemma":[0.9990052,0.000019404863,0.0005911689,0.00010453406,0.000013737808,0.00007458477,9.983086e-7,0.00002767927,0.00016269555],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990417,0.00007058044,0.00027783087,0.00018142084,0.00020933463,0.00021916526],"domain_scores_gemma":[0.9978274,0.0011585288,0.00016072375,0.0006965437,0.00010861823,0.000048180318],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005923474,0.00016212554,0.00029558202,0.00009517038,0.00024012238,0.000007634235,0.00048982084,0.00009141781,0.000099682555],"category_scores_gemma":[0.00035294986,0.00009368257,0.00030191784,0.00022899672,0.00019309562,0.00003115204,0.000067435474,0.00013143745,0.0000015781546],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002249967,0.00015147447,0.00028590302,0.00004553322,0.00008471284,9.616763e-7,0.00090994104,8.732374e-8,0.00005780858,0.991059,0.0070336973,0.00014590344],"study_design_scores_gemma":[0.0013497489,0.00023618208,0.00023160363,0.00002494899,0.000060971186,0.0000014146494,0.00008031487,0.000014954458,0.007924106,0.9894232,0.0005314196,0.00012113041],"about_ca_topic_score_codex":0.000003037962,"about_ca_topic_score_gemma":4.5871744e-7,"teacher_disagreement_score":0.05366842,"about_ca_system_score_codex":0.000010681173,"about_ca_system_score_gemma":0.000011494641,"threshold_uncertainty_score":0.38202643},"labels":[],"label_agreement":null},{"id":"W1967042891","doi":"10.1007/s00373-009-0844-x","title":"Small Cycle Double Covers of Products II: Categorical and Strong Products with Paths and Cycles","year":2009,"lang":"en","type":"article","venue":"Graphs and Combinatorics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary; Dalhousie University","funders":"","keywords":"Categorical variable; Cartesian product; Product (mathematics); Mathematics; Combinatorics; Statistics; Geometry","score_opus":0.02579601507518095,"score_gpt":0.23950222730206627,"score_spread":0.21370621222688532,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1967042891","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9969973,0.0014026343,0.000027019256,0.0002575252,0.00011323787,0.00031252974,0.0000049806063,0.000044434462,0.00084032264],"genre_scores_gemma":[0.9985837,0.00039853557,0.0008650513,0.000028597075,0.00001730736,0.0000051051125,0.000002390984,0.00001631533,0.000083046514],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989438,0.000030571082,0.00021985952,0.0003655153,0.00019158468,0.00024864342],"domain_scores_gemma":[0.9992678,0.0000656215,0.00013193216,0.00029760323,0.00013531002,0.00010173935],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021343,0.00021536357,0.00033287902,0.00010052709,0.00030110363,0.00003755344,0.000101029684,0.00009021595,0.0000011282738],"category_scores_gemma":[0.00005110426,0.00015647673,0.00002342025,0.0003154452,0.00022933693,0.00010341518,0.0000959687,0.00016768406,4.114754e-8],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000117451134,0.00015496039,0.005843508,0.00017103755,0.000039363378,0.000008048044,0.0012056552,9.886847e-7,0.00020670544,0.99037534,0.000116027,0.001760906],"study_design_scores_gemma":[0.0015180891,0.0007808623,0.013389026,0.000032534528,0.00009056667,0.000053799882,0.00025686488,0.000018735383,0.0023427857,0.9810446,0.00022152472,0.00025062912],"about_ca_topic_score_codex":0.000016893771,"about_ca_topic_score_gemma":0.0000030949066,"teacher_disagreement_score":0.009330768,"about_ca_system_score_codex":0.000008842504,"about_ca_system_score_gemma":0.000027045737,"threshold_uncertainty_score":0.6380936},"labels":[],"label_agreement":null},{"id":"W1967512075","doi":"10.1007/s00026-012-0163-4","title":"Cops and Robber Game with a Fast Robber on Expander Graphs and Random Graphs","year":2012,"lang":"en","type":"article","venue":"Annals of Combinatorics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Combinatorics; Mathematics; Cartesian product; Vertex (graph theory); Graph; Discrete mathematics; Random graph; Upper and lower bounds","score_opus":0.05001114505301214,"score_gpt":0.3106557785154308,"score_spread":0.2606446334624187,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1967512075","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9927917,0.0016670281,0.00012710156,0.00014997725,0.00024903606,0.00027470017,0.000008090084,0.000047333557,0.004685022],"genre_scores_gemma":[0.9985079,0.0006517688,0.000191702,0.00031458604,0.000021419843,0.000014822593,0.0000022397144,0.000039387312,0.0002561836],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986252,0.00009737916,0.0003030728,0.00022345035,0.00034616955,0.00040469435],"domain_scores_gemma":[0.99846494,0.00058253686,0.0002006285,0.00037580254,0.0001682931,0.00020777312],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005521647,0.00027733977,0.00048506437,0.00018246667,0.0001503996,0.00003076818,0.00013327562,0.00014101747,0.000025137724],"category_scores_gemma":[0.00011951649,0.00019289272,0.00009333462,0.00026105857,0.00028570284,0.00020062028,0.00009332409,0.00022121666,8.7320734e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003074967,0.00022739252,0.02015107,0.00011429381,0.00015780202,0.0000030666286,0.0018865777,0.0000010031226,0.00002918952,0.97437686,0.0021087455,0.0006365191],"study_design_scores_gemma":[0.0025349893,0.00036219982,0.010090042,0.0000943631,0.00008100367,0.000031062,0.00026549178,0.000007340676,0.0015462678,0.9835808,0.0011119787,0.00029441493],"about_ca_topic_score_codex":0.0000062793843,"about_ca_topic_score_gemma":0.0000018382158,"teacher_disagreement_score":0.0100610275,"about_ca_system_score_codex":0.0000045772035,"about_ca_system_score_gemma":0.000012070413,"threshold_uncertainty_score":0.7865937},"labels":[],"label_agreement":null},{"id":"W1967777504","doi":"10.1016/j.endm.2007.01.026","title":"Sub-Ramsey Numbers for Arithmetic Progressions and Schur Triples","year":2007,"lang":"en","type":"article","venue":"Electronic Notes in Discrete Mathematics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Mathematics; Integer (computer science); Combinatorics; Rainbow; Arithmetic progression; Upper and lower bounds; Type (biology); Discrete mathematics; Mathematical analysis; Physics","score_opus":0.021779421701841578,"score_gpt":0.3269318068410557,"score_spread":0.30515238513921417,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1967777504","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8951016,0.0011186732,0.10060664,0.00021242973,0.00015813638,0.0014230389,0.000019228693,0.00014741906,0.00121281],"genre_scores_gemma":[0.90587926,0.000104298364,0.09356055,0.000050316426,0.00009958655,0.00008426956,0.000008113719,0.000076780874,0.00013684605],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99754703,0.000052803374,0.00071124063,0.00038106288,0.00030251534,0.0010053704],"domain_scores_gemma":[0.99602985,0.0030274382,0.00025429056,0.00049898104,0.00006373777,0.00012571902],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0019151677,0.00034336795,0.0005168892,0.00022321036,0.00029235586,0.000062315536,0.0003243527,0.0002166876,0.00002262377],"category_scores_gemma":[0.0020819297,0.00027013593,0.0001528658,0.00031642074,0.0002564376,0.000110932924,0.0001504338,0.00043077164,0.0000017578503],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007074346,0.00014764823,0.0007497732,0.00049730786,0.00007942343,0.0000060839243,0.0023721652,0.0000025392374,0.00057197886,0.9887484,0.000089167785,0.006664798],"study_design_scores_gemma":[0.0009952971,0.00017123648,0.00022462054,0.00022220373,0.00008878424,0.00004670602,0.00048612626,0.0010946679,0.0064959214,0.9893657,0.00043655804,0.00037218485],"about_ca_topic_score_codex":0.0000047121302,"about_ca_topic_score_gemma":0.00016860581,"teacher_disagreement_score":0.010777621,"about_ca_system_score_codex":0.00011996311,"about_ca_system_score_gemma":0.00007372614,"threshold_uncertainty_score":0.9999751},"labels":[],"label_agreement":null},{"id":"W1968181001","doi":"10.1016/j.disc.2004.02.003","title":"Ramsey numbers in complete balanced multipartite graphs. Part II: Size numbers","year":2004,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":25,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Mathematics; Multipartite; Ramsey's theorem; Combinatorics; Discrete mathematics; Graph","score_opus":0.029877456998500543,"score_gpt":0.28952597875345,"score_spread":0.25964852175494946,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1968181001","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97552335,0.00007029701,0.001569906,0.0003491971,0.00056182133,0.0008526512,0.00010176158,0.00029435364,0.020676648],"genre_scores_gemma":[0.929038,0.000046506233,0.06972337,0.0003306905,0.00009281468,0.000077973746,0.000020316858,0.00011096053,0.0005593976],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9969473,0.00009819676,0.0010466313,0.0005082846,0.0005934784,0.0008060969],"domain_scores_gemma":[0.9974996,0.0007869994,0.00039473968,0.0010232405,0.00007815969,0.00021728706],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006789674,0.00052836275,0.0008396849,0.00014225728,0.00042518773,0.00007504256,0.0006131964,0.00023903267,0.00029571788],"category_scores_gemma":[0.0009674204,0.0004429543,0.00034817064,0.00052778656,0.00036185858,0.00021233509,0.00030915037,0.0004716401,0.000044231456],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004734461,0.00030720377,0.0011644833,0.00042033673,0.00013144015,0.000046242665,0.015793033,0.00018825862,0.00037368908,0.9803995,0.0010080226,0.00012046974],"study_design_scores_gemma":[0.0022953856,0.00007293507,0.0004806489,0.00042903173,0.00007682206,0.000037339756,0.001597531,0.0003984514,0.0005640105,0.99185586,0.0015590347,0.00063295517],"about_ca_topic_score_codex":0.000056983692,"about_ca_topic_score_gemma":0.00018084048,"teacher_disagreement_score":0.06815346,"about_ca_system_score_codex":0.000120991564,"about_ca_system_score_gemma":0.000046297475,"threshold_uncertainty_score":0.99980223},"labels":[],"label_agreement":null},{"id":"W1969104367","doi":"10.1007/s00493-013-2910-5","title":"Lines in hypergraphs","year":2013,"lang":"en","type":"article","venue":"COMBINATORICA","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; Concordia University; Google (Canada)","funders":"Concordia University; Canada Research Chairs","keywords":"Hypergraph; Combinatorics; Mathematics; Vertex (graph theory); De Bruijn sequence; Finite set; Statement (logic); Discrete mathematics; Graph","score_opus":0.023471736362064788,"score_gpt":0.2756630780826877,"score_spread":0.2521913417206229,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1969104367","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96960723,0.00022639318,0.00002769001,0.00022158716,0.00055212196,0.00019225388,5.281531e-7,0.000083054874,0.029089147],"genre_scores_gemma":[0.9981679,0.000024274432,0.0009626417,0.00010521646,0.000032032072,0.00003668881,5.213996e-7,0.000016078908,0.00065467745],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993054,0.000047740785,0.00018942417,0.00014215741,0.00011747441,0.0001977666],"domain_scores_gemma":[0.9993367,0.00021507166,0.000042354797,0.0003027936,0.000049740538,0.00005332466],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011771511,0.00010505251,0.00016855879,0.00011047354,0.00007705193,0.00001959127,0.00021741015,0.00007318531,0.00022804867],"category_scores_gemma":[0.00019286636,0.00008144423,0.00005752917,0.0002729158,0.000044763296,0.000081237085,0.00008742244,0.00013845722,0.00004123861],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000001979021,0.000074860596,0.008469169,0.000019833145,0.000007484678,0.000003612309,0.00026133933,1.6782802e-7,0.00009533504,0.98118377,0.008065236,0.0018171929],"study_design_scores_gemma":[0.00028608926,0.000024928017,0.009609498,0.000011683094,0.0000040202276,0.0000031106172,0.000050028517,0.00003473586,0.0002453389,0.9867787,0.0028401548,0.0001117487],"about_ca_topic_score_codex":0.00002512526,"about_ca_topic_score_gemma":0.0000017478092,"teacher_disagreement_score":0.028560646,"about_ca_system_score_codex":0.000019794745,"about_ca_system_score_gemma":0.000007610507,"threshold_uncertainty_score":0.33211994},"labels":[],"label_agreement":null},{"id":"W1970138544","doi":"10.1016/j.jctb.2011.03.005","title":"Finitely forcible graphons","year":2011,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":54,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Iterated function; Mathematics; Algebraic structure; Combinatorics; Graph; Discrete mathematics; Pure mathematics; Mathematical analysis","score_opus":0.05386988719056061,"score_gpt":0.27678391431481614,"score_spread":0.22291402712425554,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1970138544","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.89705276,0.00040732994,0.00140025,0.00005649007,0.018665941,0.00019923349,0.000009353998,0.00007379373,0.08213485],"genre_scores_gemma":[0.9935685,0.000068205605,0.0051004216,0.000060731916,0.00061276555,0.0000022246788,3.036095e-7,0.00003488466,0.0005519795],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983539,0.00028552327,0.00065293285,0.0001099746,0.00033850913,0.0002591393],"domain_scores_gemma":[0.9980184,0.0005830407,0.00059850194,0.00034291114,0.00031747136,0.00013967798],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016545772,0.00019829234,0.00044353103,0.00021761078,0.0002469279,0.000029000505,0.0005392684,0.00014092827,0.0007397281],"category_scores_gemma":[0.0007391019,0.00014447542,0.00034087242,0.00022797714,0.00025957436,0.00044492166,0.000110428,0.00037795157,0.000003432975],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013902793,0.00012836175,0.00022927977,0.000024719056,0.00016656973,0.00004811978,0.0034051624,1.7586586e-7,0.00010949212,0.992183,0.0017931381,0.0005216846],"study_design_scores_gemma":[0.00073557644,0.0007367241,0.00017415782,0.00004304889,0.00010047085,0.00021131245,0.0007227628,2.2187108e-7,0.008762904,0.98234993,0.005992872,0.00017004205],"about_ca_topic_score_codex":0.0000011903692,"about_ca_topic_score_gemma":5.049225e-7,"teacher_disagreement_score":0.09651573,"about_ca_system_score_codex":0.00002327855,"about_ca_system_score_gemma":0.00006491604,"threshold_uncertainty_score":0.80995035},"labels":[],"label_agreement":null},{"id":"W1972423218","doi":"10.1016/j.jctb.2012.09.003","title":"Limits of permutation sequences","year":2012,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":115,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Mathematics; Combinatorics; Sequence (biology); Permutation (music); Limit (mathematics); Random permutation; Limit of a sequence; Discrete mathematics; Function (biology); Limit of a function; Class (philosophy); Mathematical analysis","score_opus":0.031892451417784934,"score_gpt":0.30929187706200817,"score_spread":0.27739942564422326,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1972423218","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9844156,0.00060453144,0.0003542426,0.000054611835,0.008366535,0.00007965715,0.000003616391,0.00001296004,0.0061082793],"genre_scores_gemma":[0.99662876,0.00005571738,0.002135562,0.000020075327,0.0010182349,9.2566626e-7,3.7520007e-7,0.000016017802,0.00012432104],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984193,0.0003475032,0.0006071023,0.00005402599,0.0003794536,0.00019261919],"domain_scores_gemma":[0.9978002,0.0007949279,0.0008026606,0.00016924605,0.0003353508,0.00009762172],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002144958,0.00012960251,0.00037285092,0.000120248136,0.00011486402,0.0000149964,0.00026810096,0.00010162966,0.00015026642],"category_scores_gemma":[0.0010434106,0.00009214531,0.0001854082,0.00013855117,0.00021569997,0.00066807435,0.00003964363,0.00020750203,8.928379e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00052598247,0.00009855787,0.00075917545,0.00005326621,0.0001040354,0.0000030151282,0.004124068,0.000001307537,0.001642896,0.99155164,0.00026386214,0.0008722176],"study_design_scores_gemma":[0.00050542125,0.000356251,0.00044908392,0.00005332158,0.00008681784,0.00012901642,0.0012429458,3.4344282e-7,0.026766712,0.96856034,0.0017513714,0.000098405064],"about_ca_topic_score_codex":4.357876e-7,"about_ca_topic_score_gemma":9.7805184e-8,"teacher_disagreement_score":0.025123816,"about_ca_system_score_codex":0.000029366485,"about_ca_system_score_gemma":0.000051860217,"threshold_uncertainty_score":0.37575766},"labels":[],"label_agreement":null},{"id":"W1974601014","doi":"10.4064/aa166-1-5","title":"A generalization of a theorem of Erdős–Rényi to m-fold sums and differences","year":2014,"lang":"en","type":"article","venue":"Acta Arithmetica","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Omega; Combinatorics; Generalization; Integer (computer science); Discrete mathematics; Mathematical analysis","score_opus":0.0205513266444521,"score_gpt":0.27128269285049245,"score_spread":0.25073136620604036,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1974601014","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98957866,0.00003544677,0.0057153483,0.00017769466,0.00008137354,0.00014335872,0.000010197199,0.000017684368,0.0042402605],"genre_scores_gemma":[0.983246,0.00002042181,0.016509619,0.0000865817,0.000035350724,0.000004804645,0.0000011975436,0.000012373644,0.00008360131],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99919546,0.00009730604,0.00025795994,0.0001481618,0.00017403775,0.00012706775],"domain_scores_gemma":[0.9989999,0.0004576946,0.00011575121,0.0002909449,0.00007646153,0.00005925348],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031145103,0.00010561987,0.00027691177,0.00009418842,0.000051143405,0.0000109402345,0.0001644433,0.00006492068,0.000056548615],"category_scores_gemma":[0.00060021336,0.000075027296,0.000045503395,0.00012904465,0.00016127765,0.000033599583,0.00011303981,0.00005016607,3.6739107e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022917364,0.00003842396,0.0034844456,0.000119091135,0.000033666623,1.6522756e-7,0.0016627708,5.0589733e-7,0.005127788,0.9863291,0.00021851112,0.0029626067],"study_design_scores_gemma":[0.00026474483,0.00020082774,0.013789586,0.00006946525,0.000067201596,0.0000035959245,0.00010402782,0.0006260148,0.012777081,0.97148806,0.00047619932,0.00013317996],"about_ca_topic_score_codex":0.000013737068,"about_ca_topic_score_gemma":0.000008103562,"teacher_disagreement_score":0.014841031,"about_ca_system_score_codex":0.0000036835352,"about_ca_system_score_gemma":0.00000750542,"threshold_uncertainty_score":0.30595243},"labels":[],"label_agreement":null},{"id":"W1977033885","doi":"10.1016/j.ejc.2006.05.003","title":"3-star factors in random <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si7.gif\" display=\"inline\" overflow=\"scroll\"><mml:mi>d</mml:mi></mml:math>-regular graphs","year":2006,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Random graph; Combinatorics; Star (game theory); Discrete mathematics; Graph","score_opus":0.01542945236961823,"score_gpt":0.23443577868424,"score_spread":0.21900632631462177,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1977033885","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9917866,0.0005976635,0.00055330846,0.000079416444,0.0018756285,0.00006472929,0.000026405189,0.00006568409,0.004950588],"genre_scores_gemma":[0.9976987,0.00022262825,0.0012248784,0.00013552536,0.00038491882,0.0000047218045,0.000020818388,0.00018124335,0.00012652882],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99623275,0.0004826303,0.0013264414,0.00035287038,0.0009952182,0.0006101046],"domain_scores_gemma":[0.99692285,0.00073291146,0.0012182307,0.00071564387,0.00015962517,0.00025075613],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0021042957,0.00043359818,0.00046657235,0.0003086894,0.00043547733,0.00021110382,0.0008965652,0.00022570984,0.000034643275],"category_scores_gemma":[0.0006647427,0.0004152552,0.0007311394,0.00045346006,0.0002717955,0.00039497795,0.00033558754,0.0009809412,0.000050916165],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00036980846,0.0002825361,0.00026403338,0.00016343879,0.00020617392,0.0009989023,0.00095785165,0.00022325471,0.00028759005,0.9944964,0.0016123536,0.00013765435],"study_design_scores_gemma":[0.020112801,0.0030436914,0.0062152636,0.0018717123,0.0013939419,0.0017110017,0.0018802349,0.09468645,0.011786861,0.8288262,0.026087286,0.002384587],"about_ca_topic_score_codex":0.0000212787,"about_ca_topic_score_gemma":0.000009935313,"teacher_disagreement_score":0.16567023,"about_ca_system_score_codex":0.000032392134,"about_ca_system_score_gemma":0.00015115862,"threshold_uncertainty_score":0.99982995},"labels":[],"label_agreement":null},{"id":"W1977305469","doi":"10.1016/j.disc.2011.10.011","title":"Häggkvist–Hell graphs: A class of Kneser-colorable graphs","year":2011,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Combinatorics; Mathematics; Triangle-free graph; Homomorphism; Graph; Graph homomorphism; Discrete mathematics; Odd graph; Symmetric graph; 1-planar graph; Chordal graph; Graph power; Line graph; Voltage graph","score_opus":0.04894744649945722,"score_gpt":0.28071702798371423,"score_spread":0.23176958148425703,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1977305469","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.78731227,0.00019804316,0.005154252,0.000027953476,0.00047102637,0.0008100288,0.00009876442,0.00026860525,0.20565906],"genre_scores_gemma":[0.9037666,0.000053343225,0.09462574,0.000065315595,0.00003159771,0.00004657502,0.0000067477768,0.00010213846,0.0013019469],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974993,0.00010604756,0.0009743731,0.0003689219,0.00051938195,0.0005319815],"domain_scores_gemma":[0.9973573,0.00045502075,0.0005996247,0.0012298813,0.0001932533,0.00016492512],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00074050284,0.00042861432,0.0007956974,0.0002849792,0.00022962505,0.0000282605,0.00077751564,0.00024023427,0.0005974408],"category_scores_gemma":[0.00041190354,0.00032576502,0.00046816465,0.0005158269,0.00046027527,0.00017414136,0.00027444726,0.00029455387,0.000024155663],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000042271742,0.00027888626,0.0004732516,0.0008400802,0.00018696775,0.000009648285,0.011131379,6.8528294e-7,0.0005062658,0.98561996,0.00078152464,0.00012908425],"study_design_scores_gemma":[0.00046125372,0.00016717307,0.0002572182,0.00017781858,0.000206139,0.000025793282,0.0019370485,0.00022742027,0.005348472,0.99027836,0.0005158023,0.00039751612],"about_ca_topic_score_codex":0.000020085492,"about_ca_topic_score_gemma":0.000012764308,"teacher_disagreement_score":0.20435712,"about_ca_system_score_codex":0.000021703558,"about_ca_system_score_gemma":0.000036040856,"threshold_uncertainty_score":0.9999194},"labels":[],"label_agreement":null},{"id":"W1977424721","doi":"10.1090/s0002-9939-09-09860-8","title":"The symmetry preserving removal lemma","year":2009,"lang":"en","type":"article","venue":"Proceedings of the American Mathematical Society","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":21,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Lemma (botany); Generalization; Mathematics; Hypergraph; Abelian group; Homogeneous space; Symmetry (geometry); Combinatorics; Enhanced Data Rates for GSM Evolution; Discrete mathematics; Arithmetic; Computer science; Mathematical analysis; Geometry; Artificial intelligence","score_opus":0.017824654955174143,"score_gpt":0.2840035119935509,"score_spread":0.26617885703837674,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1977424721","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9508347,0.00011513063,0.00022985181,0.003464639,0.000078249956,0.00039444538,0.0000030183546,0.00011685782,0.044763133],"genre_scores_gemma":[0.9598662,0.000060775732,0.03817978,0.0007161741,0.00015779861,0.00001169858,9.8903e-8,0.000031497944,0.0009759661],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981092,0.000023072598,0.0005206222,0.0002502196,0.0006449062,0.00045196092],"domain_scores_gemma":[0.9977276,0.00093466317,0.00066105364,0.0003961139,0.00019236951,0.00008825547],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011704726,0.00023634033,0.00045750765,0.000016568672,0.00079886965,0.00008616491,0.0013846768,0.000066668006,0.00001919461],"category_scores_gemma":[0.0013105179,0.000115076036,0.0006297324,0.00056127604,0.0010081712,0.00011362156,0.00045965516,0.00039019855,0.0000024151689],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024144008,0.00007418776,0.00024764086,0.00012947162,0.00009063307,1.7876754e-7,0.0015872873,1.6481212e-7,0.00211539,0.97936237,0.013463759,0.002904779],"study_design_scores_gemma":[0.00013109883,0.000078058736,0.001508812,0.00009177911,0.00007967215,0.000036040656,0.0021174492,0.0003540477,0.0032664165,0.9911213,0.0010544751,0.00016085642],"about_ca_topic_score_codex":0.0000029701569,"about_ca_topic_score_gemma":1.2459775e-7,"teacher_disagreement_score":0.043787166,"about_ca_system_score_codex":0.000045707686,"about_ca_system_score_gemma":0.000017964641,"threshold_uncertainty_score":0.61443406},"labels":[],"label_agreement":null},{"id":"W1978359906","doi":"10.1215/00127094-2009-039","title":"Maximal averages over linear and monomial polyhedra","year":2009,"lang":"en","type":"article","venue":"Duke Mathematical Journal","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Monomial; Polyhedron; Mathematics; Monomial ideal; Combinatorics; Monomial basis; Pure mathematics; Discrete mathematics; Mathematical analysis; Polynomial; Polynomial ring","score_opus":0.022544495867568078,"score_gpt":0.30237592590012835,"score_spread":0.2798314300325603,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1978359906","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96890587,0.00016839996,0.014260945,0.0008109381,0.00023302018,0.0001575112,0.0000060733323,0.00007787128,0.015379384],"genre_scores_gemma":[0.9469762,0.000051401836,0.051180918,0.0005285922,0.0007399647,0.0000015705382,5.265764e-7,0.000028194981,0.0004926485],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99844927,0.00008615012,0.0005294727,0.00019408831,0.00035518908,0.00038583745],"domain_scores_gemma":[0.9988533,0.00038591443,0.00017128367,0.00026141512,0.000051982133,0.00027606756],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060164474,0.0002433797,0.00041471559,0.000117093405,0.0003815949,0.0001419478,0.00024600365,0.00014987627,0.0007595593],"category_scores_gemma":[0.00044525316,0.0001693643,0.00017561059,0.000077730656,0.00013122064,0.00018336665,0.00008897672,0.00054089364,0.000018082517],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008312868,0.00013949236,0.000117369906,0.00004684675,0.00006105191,0.00010101634,0.0011440305,0.0000016568191,0.00048397243,0.9877965,0.0022676026,0.00775735],"study_design_scores_gemma":[0.0007075545,0.00015962453,0.0013823954,0.00006894471,0.000060503706,0.0014412296,0.000082925195,0.0008104791,0.000355707,0.9937131,0.0009929186,0.00022462837],"about_ca_topic_score_codex":2.7452094e-7,"about_ca_topic_score_gemma":1.4153433e-7,"teacher_disagreement_score":0.036919974,"about_ca_system_score_codex":0.000031001968,"about_ca_system_score_gemma":0.00002380057,"threshold_uncertainty_score":0.83166414},"labels":[],"label_agreement":null},{"id":"W1981926792","doi":"10.1016/j.jctb.2009.07.002","title":"Asymptotically optimal frugal colouring","year":2009,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":18,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Neighbourhood (mathematics); Mathematics; Vertex (graph theory); Graph; Combinatorics; Constant (computer programming); Asymptotically optimal algorithm; Term (time); Discrete mathematics; Computer science; Mathematical optimization; Physics; Mathematical analysis","score_opus":0.013233764270504525,"score_gpt":0.2763653776591601,"score_spread":0.26313161338865554,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1981926792","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9770487,0.00018058272,0.001634364,0.0004430688,0.0070127216,0.00013112219,0.0000025601585,0.00005394328,0.013492946],"genre_scores_gemma":[0.99077195,0.00002683148,0.0072694975,0.00014342545,0.0014629522,6.0887623e-7,2.5759877e-7,0.000021938933,0.00030252102],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998026,0.0003115792,0.0007303341,0.00012626318,0.00049711514,0.00030868896],"domain_scores_gemma":[0.9980108,0.00069786573,0.00050607824,0.00027412534,0.00033893707,0.00017217058],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019167972,0.00021858129,0.0005219665,0.00013690209,0.0002675335,0.00007679055,0.00051683973,0.00016856387,0.000213119],"category_scores_gemma":[0.0011718159,0.00016534125,0.00029028626,0.00014980654,0.00017623189,0.00042176183,0.00007793625,0.0005302897,0.0000021522503],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0017009166,0.00014414219,0.000038266084,0.000013161029,0.0001019494,0.00008489813,0.00083865866,0.000013754568,0.00052640494,0.99452966,0.00089054374,0.0011176524],"study_design_scores_gemma":[0.001265424,0.0014620761,0.00031396822,0.00006108311,0.00008739661,0.00036079934,0.00027080558,0.0000029309815,0.0035319098,0.98928326,0.0031701867,0.0001901577],"about_ca_topic_score_codex":1.10353035e-7,"about_ca_topic_score_gemma":5.985493e-8,"teacher_disagreement_score":0.013723276,"about_ca_system_score_codex":0.000057720034,"about_ca_system_score_gemma":0.000087193745,"threshold_uncertainty_score":0.6742421},"labels":[],"label_agreement":null},{"id":"W1982114488","doi":"10.1007/s004930200024","title":"On Erdős's Conjecture on Multiplicities of Complete Subgraphs Lower Upper Bound for Cliques of Size 6","year":2002,"lang":"en","type":"article","venue":"COMBINATORICA","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Mathematics; Combinatorics; Conjecture; Upper and lower bounds; Discrete mathematics","score_opus":0.044313882278276054,"score_gpt":0.28693761128235407,"score_spread":0.24262372900407803,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1982114488","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98701817,0.00028146937,0.00010306688,0.00013449811,0.0007782941,0.00053516723,0.000121042394,0.00006630971,0.010961971],"genre_scores_gemma":[0.9982232,0.00003887749,0.00086344307,0.00020166252,0.00003497068,0.000024806546,0.000002578447,0.000039947874,0.0005705111],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987343,0.0000821908,0.00041596172,0.00023869921,0.00027548432,0.00025338586],"domain_scores_gemma":[0.99577135,0.0031828706,0.00026790565,0.0005602765,0.00015984624,0.000057775174],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018171221,0.0002358,0.00053156144,0.00011725957,0.00015337035,0.000012488465,0.0003031057,0.00016009486,0.0001751172],"category_scores_gemma":[0.00067185046,0.00018093488,0.00030148373,0.00015104703,0.0002513028,0.00003489446,0.000056124045,0.00017983337,0.0000020992877],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017279405,0.00039312005,0.00026207854,0.00022657625,0.00009208643,0.0000016597832,0.0009829719,0.0000024405201,0.0003674373,0.9877357,0.009543357,0.00021978356],"study_design_scores_gemma":[0.00132042,0.0012474421,0.0004787252,0.000108968896,0.000047222115,0.000001811207,0.000079507015,0.00009636599,0.0069662426,0.98566306,0.0037811243,0.00020910433],"about_ca_topic_score_codex":0.0000047095687,"about_ca_topic_score_gemma":0.0000012288135,"teacher_disagreement_score":0.011205021,"about_ca_system_score_codex":0.000031198277,"about_ca_system_score_gemma":0.000007937857,"threshold_uncertainty_score":0.737831},"labels":[],"label_agreement":null},{"id":"W1983016207","doi":"10.2478/s12175-008-0112-1","title":"Cliques in Steiner systems","year":2009,"lang":"en","type":"article","venue":"Mathematica Slovaca","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Mathematics; Hypergraph; Combinatorics; Clique; Steiner tree problem; Element (criminal law); Order (exchange); Enhanced Data Rates for GSM Evolution; Discrete mathematics; Steiner system; Upper and lower bounds; Mathematical analysis; Computer science","score_opus":0.035077161763884424,"score_gpt":0.31916843214364066,"score_spread":0.28409127037975623,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1983016207","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.85588294,0.0006225193,0.0027027729,0.00042833493,0.00032863993,0.0007341132,0.000004872618,0.0003362583,0.13895953],"genre_scores_gemma":[0.98899084,0.000019598077,0.009100574,0.00019800926,0.00012026009,0.00002299545,0.0000013380748,0.000027990738,0.0015183752],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99839693,0.00010845625,0.0005925383,0.00025513463,0.00030082016,0.00034609908],"domain_scores_gemma":[0.9987394,0.00038355784,0.00014028639,0.00061082694,0.000047421952,0.000078456316],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00055024895,0.00023067567,0.0004719938,0.00018952409,0.00009280477,0.000055851015,0.00034766333,0.00014575227,0.00011469725],"category_scores_gemma":[0.00035269072,0.00017008788,0.00010745244,0.0002461875,0.000050674367,0.0001142037,0.000061856925,0.00022347781,0.00003573936],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013531631,0.00012601518,0.000060907805,0.00016116565,0.000015559024,0.000021008285,0.0017069024,0.00000429443,0.00018388958,0.994098,0.0027731343,0.0008355554],"study_design_scores_gemma":[0.0003462562,0.000067868146,0.00043001104,0.00021364579,0.000020514999,0.000033599543,0.00033644127,0.0006156477,0.00027759385,0.99587315,0.0015476369,0.00023763868],"about_ca_topic_score_codex":0.0000032842156,"about_ca_topic_score_gemma":0.0000018765948,"teacher_disagreement_score":0.13744114,"about_ca_system_score_codex":0.000043095995,"about_ca_system_score_gemma":0.0000139810845,"threshold_uncertainty_score":0.6935983},"labels":[],"label_agreement":null},{"id":"W1983747324","doi":"10.7151/dmgt.1252","title":"A clone-theoretic formulation of the Erdős-Faber-Lovász conjecture","year":2004,"lang":"en","type":"article","venue":"Discussiones Mathematicae Graph Theory","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Royal Military College of Canada","funders":"","keywords":"Mathematics; Conjecture; Combinatorics; clone (Java method); Discrete mathematics; Genetics; Biology","score_opus":0.016729793635537005,"score_gpt":0.2728471466446489,"score_spread":0.25611735300911187,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1983747324","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95948786,0.0002682283,0.027164483,0.000865057,0.0006950941,0.0013134254,0.000048601734,0.00022583941,0.009931397],"genre_scores_gemma":[0.9932812,0.000020691326,0.005853496,0.00015024384,0.00008099633,0.00005997489,0.000005577296,0.000087908455,0.0004599322],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9969685,0.00042340293,0.0009520178,0.00043277245,0.0007217349,0.0005015648],"domain_scores_gemma":[0.9965208,0.0010020926,0.00065037265,0.0015679811,0.00012306041,0.00013565895],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014267516,0.00048514453,0.00069236837,0.00022847706,0.0006495558,0.000038484846,0.00093636505,0.00027842273,0.00036572738],"category_scores_gemma":[0.0010942323,0.00022934357,0.00072649826,0.0006878299,0.0007910586,0.00018613749,0.00038337253,0.00040965524,0.000013653458],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009539513,0.00023608659,0.00015499147,0.00049448723,0.00013030595,0.0000029398484,0.0077236006,0.000033365483,0.0011626919,0.98930556,0.000096035656,0.0005645328],"study_design_scores_gemma":[0.0010212293,0.00006943143,0.0009426672,0.00056597305,0.00024591322,0.000060266728,0.0012644564,0.00002007835,0.009967401,0.98542905,0.00005811623,0.00035540832],"about_ca_topic_score_codex":0.0000024400651,"about_ca_topic_score_gemma":0.0000041256944,"teacher_disagreement_score":0.033793304,"about_ca_system_score_codex":0.000050605042,"about_ca_system_score_gemma":0.00006984473,"threshold_uncertainty_score":0.9352359},"labels":[],"label_agreement":null},{"id":"W1983805560","doi":"10.1002/rsa.20053","title":"Maxima in hypercubes","year":2005,"lang":"en","type":"article","venue":"Random Structures and Algorithms","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":46,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Maxima; Hypercube; Mathematics; Upper and lower bounds; Combinatorics; Maxima and minima; Poisson distribution; Simplex; Square (algebra); Generality; Discrete mathematics; Mathematical analysis; Geometry; Statistics","score_opus":0.020699561443162123,"score_gpt":0.2864416798429761,"score_spread":0.265742118399814,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1983805560","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98896897,0.0015595527,0.00052142504,0.00031815367,0.00027706765,0.00030640897,0.00002065977,0.000082993574,0.007944767],"genre_scores_gemma":[0.9757369,0.00022215494,0.023065683,0.000286508,0.00044527036,0.000010460503,0.0000021332519,0.000024550085,0.0002063535],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99882054,0.000071358096,0.00030460133,0.00027463856,0.00023322714,0.00029563595],"domain_scores_gemma":[0.99934536,0.00029276407,0.000059011436,0.00018847406,0.000033208893,0.000081199825],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034855344,0.00021021548,0.00037475236,0.00012386178,0.00016543394,0.000045540222,0.00015386836,0.000117764575,0.00014348247],"category_scores_gemma":[0.00015357064,0.00014806227,0.00008379815,0.000113719776,0.00011797025,0.000111832815,0.000088425375,0.0002158367,0.0000017747087],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00040171106,0.00006449624,0.0019671277,0.00011875628,0.000096388445,0.000034921195,0.0032762121,0.000068872774,0.0004706652,0.6733215,0.002085888,0.3180935],"study_design_scores_gemma":[0.004703169,0.00003220112,0.0044941776,0.000023117505,0.000020708498,0.000113847826,0.00015629375,0.0012835374,0.00064393185,0.9790692,0.009181268,0.00027858946],"about_ca_topic_score_codex":0.000018380935,"about_ca_topic_score_gemma":0.00002755789,"teacher_disagreement_score":0.31781492,"about_ca_system_score_codex":0.000023559121,"about_ca_system_score_gemma":0.000012868943,"threshold_uncertainty_score":0.60378045},"labels":[],"label_agreement":null},{"id":"W1984128946","doi":"10.1016/j.jctb.2015.02.002","title":"Linear embeddings of graphs and graph limits","year":2015,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Complement graph; Line graph; Discrete mathematics; Voltage graph; Null graph; Regular graph; Graph power; Random graph; Distance-regular graph; Butterfly graph; Symmetric graph; Graph","score_opus":0.033213788291548946,"score_gpt":0.2978219061608675,"score_spread":0.2646081178693186,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1984128946","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9909034,0.0006976923,0.00017768594,0.00007841231,0.004842486,0.00010186242,0.000005423933,0.000022007038,0.003171041],"genre_scores_gemma":[0.99599904,0.000139561,0.0033444883,0.000033307235,0.00031324607,9.167762e-7,3.3660058e-7,0.000027233473,0.00014187841],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982418,0.00028725705,0.00071320724,0.00011033939,0.00045786335,0.00018955964],"domain_scores_gemma":[0.99750686,0.00063091295,0.00078101066,0.0002429282,0.00062968186,0.00020861349],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024061964,0.00019193672,0.0005803375,0.00023596667,0.00010425266,0.000024438768,0.00032683718,0.00014557462,0.000026303083],"category_scores_gemma":[0.0014774784,0.00014079834,0.00020605144,0.0002337854,0.00041351104,0.00037325994,0.00010048242,0.0003149532,3.2368905e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014626127,0.000079680045,0.00044198817,0.000058177488,0.00016043484,0.000017286138,0.0028869614,0.0000020172972,0.00033265055,0.993029,0.0011632742,0.00036592133],"study_design_scores_gemma":[0.0016515873,0.0010152576,0.00008035253,0.00008163245,0.0001137385,0.0002054172,0.0012363648,0.0000014070758,0.0058822786,0.9877519,0.001834127,0.00014594241],"about_ca_topic_score_codex":8.9675444e-7,"about_ca_topic_score_gemma":2.6005452e-7,"teacher_disagreement_score":0.0055496283,"about_ca_system_score_codex":0.0000172591,"about_ca_system_score_gemma":0.0000743817,"threshold_uncertainty_score":0.57415897},"labels":[],"label_agreement":null},{"id":"W1984355138","doi":"10.5486/pmd.2011.5051","title":"Primitive sets with large counting functions","year":2011,"lang":"en","type":"preprint","venue":"Publicationes Mathematicae Debrecen","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Converse; Mathematics; Combinatorics; Set (abstract data type); Element (criminal law); Discrete mathematics; Computer science; Geometry","score_opus":0.0566955530879423,"score_gpt":0.299663392789828,"score_spread":0.2429678397018857,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1984355138","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24249321,0.00062638684,0.21610598,0.0031407794,0.0018735494,0.0068752915,0.0011762701,0.0032219274,0.5244866],"genre_scores_gemma":[0.8869041,0.000067526504,0.1046487,0.0004939544,0.00040772333,0.001939369,0.00061653816,0.0003563315,0.0045657563],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99660766,0.00018710297,0.00091569417,0.00091512105,0.0006785389,0.00069586956],"domain_scores_gemma":[0.99485487,0.0008086065,0.0011042578,0.0020661626,0.000950893,0.00021522844],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0011903645,0.0006839428,0.00088056945,0.00038347964,0.000686162,0.0002779717,0.0010480428,0.0005200476,0.0012779238],"category_scores_gemma":[0.0011431052,0.00051355734,0.0002608147,0.00040716346,0.00022613493,0.00031988186,0.0012058576,0.00093599607,0.00013543337],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000033664528,0.0004722304,0.00081448327,0.0011404648,0.0005508176,0.0000028346237,0.0059380652,0.0000014926525,0.0000072277116,0.98267436,0.007570481,0.0007938955],"study_design_scores_gemma":[0.0004499463,0.000037060094,0.0023762276,0.00043238225,0.00046838395,0.00006936539,0.0007527177,0.00046474815,0.00011089215,0.988498,0.005572776,0.0007675003],"about_ca_topic_score_codex":0.000011814799,"about_ca_topic_score_gemma":0.000030561427,"teacher_disagreement_score":0.6444109,"about_ca_system_score_codex":0.00012157299,"about_ca_system_score_gemma":0.0002257782,"threshold_uncertainty_score":0.9997316},"labels":[],"label_agreement":null},{"id":"W1984685721","doi":"10.1090/s0894-0347-2011-00690-5","title":"Intersecting families of permutations","year":2011,"lang":"lv","type":"preprint","venue":"Journal of the American Mathematical Society","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; Israel Science Foundation","keywords":"Conjecture; Coset; Combinatorics; Mathematical proof; Mathematics; Eigenvalues and eigenvectors; Set (abstract data type); Symmetric group; Group (periodic table); Representation (politics); Computer science; Physics; Geometry","score_opus":0.034085655126890026,"score_gpt":0.3028616156639923,"score_spread":0.26877596053710223,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1984685721","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96904165,0.00021793418,0.023134273,0.0004419045,0.0011287372,0.00042233826,0.00004496698,0.000020222846,0.0055479747],"genre_scores_gemma":[0.9244329,0.0005474219,0.07401904,0.00026196524,0.0003787481,0.000005689415,5.751309e-7,0.00008028842,0.00027340723],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99501187,0.0005718964,0.0025962638,0.00029747892,0.001060379,0.00046211522],"domain_scores_gemma":[0.98648715,0.0030308436,0.008436028,0.001117095,0.0007371766,0.0001917188],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.002287311,0.00056871853,0.0021694785,0.00011135731,0.00042350194,0.000057760742,0.002095588,0.00026250386,0.0002645369],"category_scores_gemma":[0.0033066326,0.00033242625,0.004265913,0.00049590337,0.0028377392,0.00011310189,0.0018085091,0.0022905653,0.0000068426475],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00039904958,0.0022149852,0.002821706,0.0064586555,0.010651386,0.00001869586,0.39268786,0.00037458053,0.0032320193,0.5656633,0.008016271,0.0074615204],"study_design_scores_gemma":[0.00035958138,0.0002822545,0.001657696,0.0024358032,0.001544849,0.0002487549,0.04538263,0.00069248135,0.0012804499,0.9456696,0.000079715275,0.00036618675],"about_ca_topic_score_codex":0.000036703528,"about_ca_topic_score_gemma":0.0000019382435,"teacher_disagreement_score":0.38000634,"about_ca_system_score_codex":0.00019911247,"about_ca_system_score_gemma":0.00027177943,"threshold_uncertainty_score":0.9999128},"labels":[],"label_agreement":null},{"id":"W1984911038","doi":"10.1007/s004930100000","title":"On a Generalized Anti-Ramsey Problem","year":2001,"lang":"en","type":"article","venue":"COMBINATORICA","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Mathematics; Combinatorics; Ramsey's theorem; Order (exchange); Ramsey theory; Greedy coloring; Fractional coloring; List coloring; Complete coloring; Discrete mathematics","score_opus":0.03030719509583264,"score_gpt":0.29230931718515496,"score_spread":0.26200212208932233,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1984911038","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.90598035,0.00012277704,0.00031173235,0.0002567078,0.0006838242,0.00027567914,0.000002245274,0.00023546812,0.092131235],"genre_scores_gemma":[0.99529076,0.000058828056,0.0020636288,0.00030859635,0.00006346566,0.000022312275,0.0000020639327,0.000034645534,0.0021556958],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99890095,0.000091693575,0.000223794,0.00024166366,0.00024858024,0.0002933359],"domain_scores_gemma":[0.9990318,0.00023085556,0.00008981497,0.0004962679,0.000057529036,0.00009377374],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002119923,0.00017696037,0.00026184059,0.00008712472,0.00025104234,0.000030448127,0.0002943113,0.00010470278,0.00023737158],"category_scores_gemma":[0.00015298075,0.00013655031,0.00010884844,0.00027379766,0.000051831306,0.000046682773,0.000095955365,0.00018964225,0.000037665468],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002459102,0.00016164241,0.0005649126,0.000020322745,0.000029079609,0.00002911924,0.00022454326,0.0000018761217,0.00006844734,0.98140687,0.016480962,0.0009876197],"study_design_scores_gemma":[0.000805289,0.000111299385,0.00039565668,0.000022074939,0.00001891114,0.000020280686,0.000011282411,0.000036608628,0.00028692596,0.97408986,0.024015985,0.00018583414],"about_ca_topic_score_codex":0.000004585289,"about_ca_topic_score_gemma":3.7405724e-7,"teacher_disagreement_score":0.089975536,"about_ca_system_score_codex":0.00004533044,"about_ca_system_score_gemma":0.000014806043,"threshold_uncertainty_score":0.556836},"labels":[],"label_agreement":null},{"id":"W1985239078","doi":"10.1007/s003730200035","title":"A Note on Cycle Lengths in Graphs","year":2002,"lang":"en","type":"article","venue":"Graphs and Combinatorics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":27,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Combinatorics; Graph; Interval (graph theory); Degree (music); Discrete mathematics; Physics","score_opus":0.023160266115908844,"score_gpt":0.2606883193951853,"score_spread":0.23752805327927642,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1985239078","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.974553,0.00059552636,0.000016365604,0.0001395444,0.0005073694,0.00017809935,0.0000058362066,0.000092007154,0.023912251],"genre_scores_gemma":[0.9987168,0.00059076835,0.00018540549,0.0002112098,0.000010984881,0.00001477322,7.803606e-7,0.000025712665,0.00024359417],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988346,0.00006540001,0.00026073292,0.00028537845,0.0002388637,0.00031501966],"domain_scores_gemma":[0.99910975,0.00031860496,0.00007431495,0.00036804614,0.00003127959,0.00009800669],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022344572,0.00020914155,0.00026779308,0.0002801743,0.00021693516,0.00003374669,0.0001883591,0.00014481218,0.000058093974],"category_scores_gemma":[0.000107798696,0.0001753389,0.00010222533,0.0005176024,0.00010059803,0.000071776216,0.00007544108,0.0003139748,0.0000054904244],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011731604,0.00018830018,0.0029674566,0.000035129906,0.000012651648,0.000020973628,0.0010509457,9.785298e-7,0.0000072116845,0.9904837,0.0010085568,0.0042123655],"study_design_scores_gemma":[0.00084440294,0.00015069502,0.0029214774,0.000035149416,0.000014748743,0.000009460067,0.00007713834,0.0003232133,0.00006352371,0.99392956,0.0014022621,0.00022834222],"about_ca_topic_score_codex":0.00001098283,"about_ca_topic_score_gemma":0.000007656007,"teacher_disagreement_score":0.02416377,"about_ca_system_score_codex":0.000019279616,"about_ca_system_score_gemma":0.0000034511577,"threshold_uncertainty_score":0.71501124},"labels":[],"label_agreement":null},{"id":"W1985568077","doi":"10.1016/j.disc.2007.07.039","title":"Trees with depression three","year":2007,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Mathematics; Combinatorics; Discrete mathematics; Depression (economics)","score_opus":0.023816710911365575,"score_gpt":0.2927496452322637,"score_spread":0.26893293432089815,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1985568077","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6911368,0.00009182087,0.24755907,0.000035272315,0.00012532223,0.00034335174,0.000007942147,0.00022290299,0.060477562],"genre_scores_gemma":[0.86330897,0.0000032859712,0.13602066,0.00004752805,0.000107727035,0.00000832889,0.0000033736517,0.000059743365,0.0004403758],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99851024,0.000017782875,0.00039372573,0.00024076161,0.00044072352,0.00039678297],"domain_scores_gemma":[0.9983215,0.0006043722,0.00020143596,0.00068630633,0.000065155415,0.00012124581],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006704687,0.00025814795,0.00032289783,0.000101441656,0.00027021987,0.000040005478,0.00032599436,0.000117374766,0.00012890712],"category_scores_gemma":[0.00019092984,0.00015394011,0.00010535981,0.00018518696,0.00015368787,0.00010269395,0.000133008,0.00019351584,0.000011385235],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007590128,0.000104551335,0.005655594,0.0002135624,0.00009703382,0.000042456948,0.003360814,0.0000042568786,0.00032312746,0.9866418,0.00049359695,0.002987297],"study_design_scores_gemma":[0.00049520243,0.00008161625,0.0031038618,0.0001814338,0.000097296375,0.000074246236,0.00087080384,0.00034051156,0.0033953204,0.99060047,0.0004264107,0.0003328437],"about_ca_topic_score_codex":0.0000035595551,"about_ca_topic_score_gemma":0.00014803768,"teacher_disagreement_score":0.17217222,"about_ca_system_score_codex":0.000021946817,"about_ca_system_score_gemma":0.00001250724,"threshold_uncertainty_score":0.62774956},"labels":[],"label_agreement":null},{"id":"W1985880617","doi":"10.1016/j.ejc.2011.04.001","title":"On the maximum number of cliques in a graph embedded in a surface","year":2011,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Omega; Combinatorics; Mathematics; Integer (computer science); Graph; Sigma; Vertex (graph theory); Surface (topology); Discrete mathematics; Physics; Geometry; Quantum mechanics; Computer science","score_opus":0.04936329978905404,"score_gpt":0.28329069176825206,"score_spread":0.233927391979198,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1985880617","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94308764,0.00006930005,0.00012556616,0.000041446885,0.0003531083,0.00007947831,0.0000010334063,0.0000062749937,0.056236178],"genre_scores_gemma":[0.99877983,0.00006566579,0.0009929616,0.00006675458,0.00001585276,2.2381131e-7,6.412322e-8,0.000028554421,0.000050100753],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99774754,0.0009991575,0.0007151826,0.00008619226,0.00028294072,0.00016895983],"domain_scores_gemma":[0.9984658,0.0005363363,0.00052475446,0.00029086124,0.00013360435,0.000048672122],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027928266,0.00013548677,0.000307393,0.00013889525,0.0000366185,0.000009915627,0.00050887937,0.000032451742,0.00008698936],"category_scores_gemma":[0.0005383566,0.00008422686,0.00013580102,0.0003582149,0.00009286775,0.00007202127,0.00008153516,0.00051288767,0.000003658622],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016730439,0.0003137765,0.011185447,0.000028338087,0.000029404297,0.00023508316,0.007322418,0.000004951808,0.00003072963,0.9798909,0.00065101945,0.00014062868],"study_design_scores_gemma":[0.00081719086,0.00024061535,0.011274711,0.00017839117,0.000012852462,0.00004718499,0.00046997188,0.00000502021,0.0005996441,0.9861758,0.00008471301,0.00009394151],"about_ca_topic_score_codex":0.0000026944335,"about_ca_topic_score_gemma":0.0000014791615,"teacher_disagreement_score":0.056186076,"about_ca_system_score_codex":0.00002590599,"about_ca_system_score_gemma":0.00002321415,"threshold_uncertainty_score":0.34346715},"labels":[],"label_agreement":null},{"id":"W1985961648","doi":"10.5555/644108.644165","title":"A (1 + ε)-approximation algorithm for partitioning hypergraphs using a new algorithmic version of the Lovász Local Lemma","year":2003,"lang":"en","type":"article","venue":"","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Hypergraph; Lemma (botany); Combinatorics; Time complexity; Mathematics; Speedup; Approximation algorithm; Algorithm; Range (aeronautics); Running time; Constant (computer programming); Discrete mathematics; Computer science; Parallel computing","score_opus":0.036276766191685385,"score_gpt":0.2862338144673004,"score_spread":0.24995704827561502,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1985961648","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06621381,0.000055739078,0.93092275,0.00003797754,0.00036609886,0.0004731864,0.000011925285,0.000035957317,0.0018825332],"genre_scores_gemma":[0.49222648,0.0000038400317,0.5071767,0.00007350434,0.00006764324,0.00000972718,0.0000029241169,0.000024652214,0.00041451535],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99901885,0.00008564646,0.0003021007,0.00017257292,0.00021552255,0.00020527982],"domain_scores_gemma":[0.99919194,0.00020979173,0.00016252321,0.00029077881,0.00009472181,0.00005026243],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034534428,0.00013457873,0.00019066346,0.00006881375,0.00029972979,0.000017669705,0.00015090698,0.00009701737,0.00010484516],"category_scores_gemma":[0.0001628295,0.00008892692,0.00019578259,0.00023153843,0.0001117031,0.000107680775,0.000044265766,0.000091112815,8.581352e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001900146,0.00006798858,0.00014473236,0.00009464751,0.00007887527,4.7581148e-7,0.00077579095,0.000216271,0.0011860676,0.95718205,0.001626275,0.038607813],"study_design_scores_gemma":[0.00094842917,0.000055039563,0.000039270206,0.00007337313,0.00009922674,0.000026054366,0.0005974886,0.07373594,0.0292886,0.89360136,0.0013728951,0.00016233568],"about_ca_topic_score_codex":0.000029502944,"about_ca_topic_score_gemma":0.0000057249586,"teacher_disagreement_score":0.42601267,"about_ca_system_score_codex":0.000039312938,"about_ca_system_score_gemma":0.00006971985,"threshold_uncertainty_score":0.36263344},"labels":[],"label_agreement":null},{"id":"W1986323939","doi":"10.1016/j.jctb.2007.10.007","title":"Eigenvalue bounds for independent sets","year":2008,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":78,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Eigenvalues and eigenvectors; Mathematics; Independence (probability theory); Combinatorics; Maximal independent set; Independence number; Independent set; Set (abstract data type); Polarity (international relations); Discrete mathematics; Graph; Chordal graph; 1-planar graph; Computer science; Statistics; Physics","score_opus":0.03658537179050098,"score_gpt":0.30046302215396115,"score_spread":0.26387765036346017,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1986323939","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9785196,0.00037229722,0.0021882372,0.00011556276,0.0145146875,0.00029339135,0.000015317522,0.000037046535,0.00394384],"genre_scores_gemma":[0.99387014,0.00009159118,0.0038416742,0.00007749662,0.0013026001,0.0000064458345,0.0000010579689,0.000042453263,0.0007665527],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981282,0.00025419495,0.0007134214,0.00013043913,0.0004913034,0.00028244348],"domain_scores_gemma":[0.9975242,0.00095507904,0.00062977,0.00030020537,0.00045179718,0.00013895934],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019252094,0.00021257864,0.00051972194,0.00014515994,0.0005438301,0.000036003377,0.00047094587,0.00017547874,0.00013453768],"category_scores_gemma":[0.0010418936,0.00016057618,0.0003853558,0.00011838014,0.00027356873,0.0003617544,0.00009341096,0.00033496282,0.000001273557],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0018677795,0.00011685771,0.0001368147,0.000042271327,0.00019855073,0.000051058407,0.0021743607,0.0000028812706,0.00017480257,0.9907024,0.0040998883,0.00043233178],"study_design_scores_gemma":[0.0019676413,0.0008189958,0.00017617027,0.00003224389,0.00008338932,0.0008433358,0.00035893565,0.0000015484603,0.0033758401,0.9745775,0.01757862,0.00018578753],"about_ca_topic_score_codex":4.6296134e-7,"about_ca_topic_score_gemma":3.6546805e-7,"teacher_disagreement_score":0.016124912,"about_ca_system_score_codex":0.00006996373,"about_ca_system_score_gemma":0.00015833093,"threshold_uncertainty_score":0.65481067},"labels":[],"label_agreement":null},{"id":"W1987172896","doi":"10.1007/s00440-004-0356-9","title":"Asymptotic normality determined by high moments, and submap counts of random maps","year":2004,"lang":"en","type":"article","venue":"Probability Theory and Related Fields","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":29,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Universidade de Macau; Canada Research Chairs","keywords":"Mathematics; Factorial; Triangulation; Moment (physics); Infinity; Combinatorics; Planar; Asymptotic distribution; Expected value; Method of moments (probability theory); Mathematical analysis; Geometry; Statistics; Estimator","score_opus":0.008498597363544618,"score_gpt":0.233300488572123,"score_spread":0.22480189120857838,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1987172896","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9928503,0.0004810057,0.00075739634,0.00011237977,0.00018633554,0.0002780894,0.00002445649,0.000036216705,0.0052737906],"genre_scores_gemma":[0.99900556,0.0001040105,0.00038521958,0.000048211303,0.00000965978,0.0000046883915,0.0000051123848,0.00000779877,0.000429738],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991121,0.00018304125,0.00029312045,0.00018201131,0.000095596086,0.00013407448],"domain_scores_gemma":[0.99916315,0.00042892518,0.00009177038,0.00023005538,0.00003338624,0.000052694588],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010599486,0.000119538185,0.00023764418,0.000026051004,0.000100692196,0.000009842499,0.00008383813,0.00025481696,0.00013762296],"category_scores_gemma":[0.00028887024,0.00008652948,0.00004968588,0.00005771772,0.00030006882,0.000056460314,0.000066753186,0.0002166751,0.0000014556915],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002999639,0.00008657562,0.00067528995,0.00025939193,0.00008874962,0.0000019737315,0.0010330725,0.0000039445467,0.00008919577,0.9961149,0.000096584015,0.0012503255],"study_design_scores_gemma":[0.0013970861,0.00007124127,0.00039524047,0.000036700243,0.00006132268,0.00001404872,0.000028762879,0.0000055441265,0.0010502632,0.99674696,0.000089720415,0.000103088125],"about_ca_topic_score_codex":0.0000069852003,"about_ca_topic_score_gemma":0.0000011967704,"teacher_disagreement_score":0.006155232,"about_ca_system_score_codex":0.000012347113,"about_ca_system_score_gemma":0.000012166094,"threshold_uncertainty_score":0.35285696},"labels":[],"label_agreement":null},{"id":"W1988333015","doi":"10.1016/j.jctb.2010.07.003","title":"The lattice of integer flows of a regular matroid","year":2010,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Combinatorics; Mathematics; Matroid; Abelian group; Integer (computer science); Integer lattice; Lattice (music); Discrete mathematics; Half-integer; Physics; Computer science; Condensed matter physics","score_opus":0.009229537207443047,"score_gpt":0.26315463478057205,"score_spread":0.253925097573129,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1988333015","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9851402,0.00026135534,0.00025836565,0.0001601047,0.010478572,0.00012363499,0.0000058154133,0.000009823367,0.0035621277],"genre_scores_gemma":[0.99555326,0.000057223315,0.0034525255,0.000012902503,0.000624677,0.000001277223,1.6962464e-7,0.000025020654,0.0002729662],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99800503,0.00034266678,0.00092998793,0.000079521546,0.0004616832,0.00018113265],"domain_scores_gemma":[0.9956578,0.0019368106,0.0011745984,0.0005142032,0.0006450489,0.00007154894],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035363708,0.00015907575,0.00050556543,0.000093048766,0.00018151097,0.000025084672,0.0007166399,0.00014772305,0.0001209306],"category_scores_gemma":[0.0022128224,0.00009168349,0.0003265347,0.00015293661,0.0005522911,0.00021332805,0.00013587347,0.00060218596,4.796315e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015350055,0.00007898714,0.000046076035,0.0000632568,0.00019092808,0.000005487154,0.0012064584,9.798899e-7,0.012513068,0.9832009,0.00051287125,0.0006460009],"study_design_scores_gemma":[0.00074539904,0.00039737817,0.00006273038,0.000058191254,0.00011022357,0.00011455484,0.00076179113,0.000003090948,0.03256018,0.95617396,0.008922516,0.00009000029],"about_ca_topic_score_codex":9.160241e-7,"about_ca_topic_score_gemma":0.0000020274235,"teacher_disagreement_score":0.027026936,"about_ca_system_score_codex":0.000012118016,"about_ca_system_score_gemma":0.000076145094,"threshold_uncertainty_score":0.37387443},"labels":[],"label_agreement":null},{"id":"W1988884000","doi":"10.1016/j.ejc.2011.09.007","title":"Degenerate and star colorings of graphs on surfaces","year":2011,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"American Roentgen Ray Society","keywords":"Mathematics; Combinatorics; Degenerate energy levels; Star (game theory); Physics; Mathematical analysis","score_opus":0.06385033420358606,"score_gpt":0.2493722401986703,"score_spread":0.18552190599508422,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1988884000","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97489464,0.00031294406,0.000051778086,0.000012042064,0.00044435525,0.00004259045,0.000002255314,0.000008906586,0.024230506],"genre_scores_gemma":[0.9976556,0.00021925416,0.0019549816,0.000027085338,0.000018850898,8.952874e-8,8.562858e-8,0.000026155398,0.00009795254],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987886,0.00030479796,0.00046089466,0.00008174124,0.00023869555,0.00012524582],"domain_scores_gemma":[0.99881977,0.00016620732,0.00054467586,0.00017068813,0.0002040903,0.000094540505],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012034492,0.0001236032,0.00026534533,0.00013779459,0.000084784035,0.000011618183,0.00025680277,0.000022397571,0.000021432545],"category_scores_gemma":[0.00017277346,0.00009036457,0.00008610123,0.00013299685,0.00011008512,0.000078414574,0.000072311144,0.00021913428,9.65886e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012026824,0.00011072419,0.0027647128,0.000045959874,0.00007461461,0.000093174844,0.0017312701,0.0000011991946,0.00033324314,0.99404824,0.00041010167,0.00026651117],"study_design_scores_gemma":[0.0010098733,0.0015829256,0.019257838,0.00010151066,0.00007408103,0.00006509166,0.00022538155,0.000004104206,0.009776248,0.96645933,0.0012888077,0.00015480952],"about_ca_topic_score_codex":5.926905e-7,"about_ca_topic_score_gemma":1.2839405e-7,"teacher_disagreement_score":0.02758889,"about_ca_system_score_codex":0.000009499327,"about_ca_system_score_gemma":0.000013727961,"threshold_uncertainty_score":0.36849603},"labels":[],"label_agreement":null},{"id":"W1991381366","doi":"10.1016/j.jctb.2003.11.004","title":"Colorings of the d-regular infinite tree","year":2004,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Tree (set theory); Mathematics; Combinatorics; Computer science","score_opus":0.014375893882085673,"score_gpt":0.2519831543722079,"score_spread":0.23760726049012224,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1991381366","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9838166,0.00015862472,0.00013311156,0.00028729907,0.0056419545,0.00013660421,0.000003934698,0.0000140114125,0.009807832],"genre_scores_gemma":[0.99838334,0.000028784423,0.000879991,0.000053982207,0.00037213942,0.0000013043865,1.0482161e-7,0.000022530867,0.000257843],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983116,0.0002444511,0.0006966615,0.000082781014,0.000483141,0.00018136174],"domain_scores_gemma":[0.997842,0.0004896639,0.0008998457,0.00039068342,0.00030870756,0.000069110414],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014338193,0.00016684805,0.00044443808,0.000095547104,0.00020020297,0.000023034687,0.0006754707,0.00012340603,0.00006294952],"category_scores_gemma":[0.0009903978,0.00009887428,0.0003645449,0.0002442244,0.00043999325,0.00025698164,0.00016955164,0.00036132446,5.41146e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00074449275,0.00009122641,0.00013328173,0.00003957959,0.0001386569,0.000008784181,0.001435221,0.000018534061,0.0011621374,0.99589664,0.000128409,0.00020305917],"study_design_scores_gemma":[0.0017063089,0.00044453822,0.00041590337,0.00012141643,0.00009940607,0.00011354005,0.00044594036,7.833178e-8,0.033208974,0.95804054,0.005297788,0.000105599116],"about_ca_topic_score_codex":0.0000011067033,"about_ca_topic_score_gemma":9.797818e-7,"teacher_disagreement_score":0.03785611,"about_ca_system_score_codex":0.000057099795,"about_ca_system_score_gemma":0.00012944847,"threshold_uncertainty_score":0.40319762},"labels":[],"label_agreement":null},{"id":"W1992296250","doi":"10.1017/s096354830300587x","title":"Rainbow Arithmetic Progressions and Anti-Ramsey Results","year":2003,"lang":"en","type":"article","venue":"Combinatorics Probability Computing","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":49,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Univerzita Karlova v Praze","keywords":"Rainbow; Van der Waerden's theorem; Arithmetic progression; Mathematics; Monochromatic color; Arithmetic; Class (philosophy); Combinatorics; Term (time); Ramsey theory; Discrete mathematics; Computer science; Physics; Artificial intelligence","score_opus":0.04527451832759227,"score_gpt":0.30251243573841324,"score_spread":0.25723791741082097,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1992296250","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9909779,0.000306482,0.001267729,0.0001515338,0.0008461097,0.000695027,0.0000055035975,0.0002597384,0.0054899827],"genre_scores_gemma":[0.9752156,0.0000088300085,0.024588045,0.00004060349,0.000035863704,0.0000066802495,0.0000024119759,0.000029839648,0.0000720848],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99749374,0.00047005134,0.0006307141,0.00059810246,0.0003260075,0.0004813639],"domain_scores_gemma":[0.99721557,0.0014042151,0.00025735734,0.0007306257,0.00021187593,0.00018036753],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025147183,0.00028173087,0.00042545897,0.00009665554,0.00083326927,0.000090321606,0.00027659943,0.00017846301,0.0000061800147],"category_scores_gemma":[0.005821587,0.00023742836,0.00010056229,0.0004614614,0.0003030193,0.000084171355,0.00033819315,0.0004569934,0.0000014967562],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009886804,0.00023956216,0.010411616,0.0002040987,0.000026459436,0.000006785462,0.0013975336,0.00000939757,0.000019000276,0.98507756,0.00021664274,0.0023814782],"study_design_scores_gemma":[0.000980348,0.000072611474,0.0037488176,0.00009723973,0.000030264124,0.000039400442,0.00009961865,0.00057885255,0.00032181054,0.9929103,0.00082757283,0.00029316082],"about_ca_topic_score_codex":0.0000026316543,"about_ca_topic_score_gemma":6.508977e-7,"teacher_disagreement_score":0.023320317,"about_ca_system_score_codex":0.00007536739,"about_ca_system_score_gemma":0.0000623027,"threshold_uncertainty_score":0.96820474},"labels":[],"label_agreement":null},{"id":"W1994460676","doi":"10.1002/rsa.20496","title":"The number of Sidon sets and the maximum size of Sidon sets contained in a sparse random set of integers","year":2013,"lang":"en","type":"article","venue":"Random Structures and Algorithms","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":55,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Trinity College","funders":"","keywords":"Mathematics; Cardinality (data modeling); Combinatorics; Constant (computer programming); Function (biology); Discrete mathematics; Set (abstract data type); Piecewise; Piecewise linear function; Computer science","score_opus":0.012260669117951846,"score_gpt":0.27480424031656014,"score_spread":0.26254357119860827,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1994460676","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99626684,0.0011324747,0.0002118,0.00028042242,0.00023718223,0.00118383,0.00007916629,0.000012433102,0.00059582375],"genre_scores_gemma":[0.99746215,0.0006041673,0.001718113,0.000059703354,0.00004773245,0.000034553053,0.000003655645,0.00002513294,0.000044786757],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977601,0.00045890585,0.0008813171,0.00025572462,0.00033990614,0.00030404716],"domain_scores_gemma":[0.99329686,0.005493194,0.00054499705,0.0004417411,0.00015174816,0.000071476315],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011773927,0.00030414303,0.001040366,0.00006083882,0.00017745112,0.000042382093,0.00030216266,0.00016306003,0.000102084305],"category_scores_gemma":[0.00094638683,0.00014489786,0.00021162865,0.00016402751,0.0011801203,0.00009033178,0.00017642562,0.0002834751,1.9449735e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.04959156,0.00022096858,0.01809194,0.0029784336,0.0030691095,0.00003674543,0.054699592,0.0002142696,0.004274207,0.6649465,0.002397436,0.19947922],"study_design_scores_gemma":[0.03778512,0.000077323486,0.0059331395,0.00012801548,0.00014748338,0.000058866277,0.0025823778,0.002494427,0.0017067831,0.9487817,0.000092658374,0.00021210291],"about_ca_topic_score_codex":0.0005447079,"about_ca_topic_score_gemma":0.00005470641,"teacher_disagreement_score":0.2838352,"about_ca_system_score_codex":0.000010322574,"about_ca_system_score_gemma":0.000026580703,"threshold_uncertainty_score":0.59087634},"labels":[],"label_agreement":null},{"id":"W1995045578","doi":"10.1007/s00041-011-9195-0","title":"Kronecker Constants for Finite Subsets of Integers","year":2011,"lang":"en","type":"article","venue":"Journal of Fourier Analysis and Applications","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Kronecker delta; Mathematics; Kronecker product; Constant (computer programming); Combinatorics; Finite set; Set (abstract data type); Function (biology); Element (criminal law); Discrete mathematics; Mathematical analysis; Computer science","score_opus":0.055820958423727716,"score_gpt":0.31519263207982984,"score_spread":0.25937167365610214,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1995045578","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.280002,0.00030523186,0.7154218,0.00006003251,0.000042757834,0.00023256322,0.00008059993,0.0000047389162,0.0038502824],"genre_scores_gemma":[0.9468899,0.00008433999,0.05286923,0.000023345581,0.000044566637,0.000009729201,0.0000015189822,0.0000062546715,0.00007113439],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991908,0.000023603894,0.00049509964,0.000081317965,0.00012319628,0.000086003274],"domain_scores_gemma":[0.9985817,0.0003255444,0.00054505584,0.00019314537,0.0002860925,0.000068473106],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004407556,0.00007676693,0.0003400806,0.00025658403,0.000095737065,0.000008239193,0.00013789862,0.000046059387,0.00012634689],"category_scores_gemma":[0.000099734316,0.000054119973,0.0003068081,0.000330355,0.0001262657,0.000055652163,0.000020553569,0.00007972527,2.610335e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019189011,0.0003985174,0.028479068,0.00011761962,0.0062649674,0.0000024624323,0.0043761265,0.00002913219,0.0005936496,0.9254883,0.0010883332,0.032969937],"study_design_scores_gemma":[0.00063933275,0.000110414585,0.007909425,0.000025853806,0.004921236,0.000015246302,0.0008773015,0.000537908,0.0030491205,0.97688127,0.0048670014,0.00016586842],"about_ca_topic_score_codex":0.000002935709,"about_ca_topic_score_gemma":0.000007193409,"teacher_disagreement_score":0.6668879,"about_ca_system_score_codex":0.0000061055252,"about_ca_system_score_gemma":0.000019352527,"threshold_uncertainty_score":0.22069485},"labels":[],"label_agreement":null},{"id":"W1995234636","doi":"10.1016/j.ejc.2008.05.006","title":"A new proof of the Erdős–Ko–Rado theorem for intersecting families of permutations","year":2008,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":82,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina; University of Waterloo","funders":"","keywords":"Combinatorics; Mathematics; Coset; Symmetric group; Point (geometry); Upper and lower bounds; Discrete mathematics; Geometry","score_opus":0.037368124268792303,"score_gpt":0.26929644003350856,"score_spread":0.23192831576471626,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1995234636","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9556209,0.0002573742,0.03337507,0.00010353536,0.0011149253,0.00021148931,0.0000067942447,0.000008953096,0.009300976],"genre_scores_gemma":[0.99541914,0.000023969253,0.004098366,0.000020341471,0.000096809665,3.5575738e-7,1.8546504e-7,0.00003195923,0.00030888888],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984855,0.00030621016,0.0007145906,0.000072966184,0.00029435696,0.00012638785],"domain_scores_gemma":[0.9976234,0.0005985583,0.0010273589,0.00025628135,0.00043917526,0.000055234115],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009355524,0.000119590935,0.00030145713,0.00011593414,0.00018690377,0.0000075899625,0.0005176499,0.000023498742,0.000010273549],"category_scores_gemma":[0.0013105661,0.00007435909,0.0003174016,0.00023069292,0.00015485504,0.00008013382,0.00010623225,0.00023713407,1.5120946e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000102215956,0.00012757725,0.0015478778,0.0001635731,0.00015842574,0.000014146333,0.020822993,0.00005880578,0.00052534655,0.9713637,0.0030133182,0.0021019957],"study_design_scores_gemma":[0.0015669529,0.00060847827,0.003009942,0.00027506307,0.0001357604,0.0002770039,0.0024934849,0.000046868594,0.010508973,0.97971,0.0012333713,0.00013412346],"about_ca_topic_score_codex":6.6682594e-7,"about_ca_topic_score_gemma":3.1189927e-7,"teacher_disagreement_score":0.03979824,"about_ca_system_score_codex":0.000023015446,"about_ca_system_score_gemma":0.000094820134,"threshold_uncertainty_score":0.30322757},"labels":[],"label_agreement":null},{"id":"W1996563160","doi":"10.1002/jcd.20283","title":"Existential closure of block intersection graphs of infinite designs having infinite block size","year":2011,"lang":"en","type":"article","venue":"Journal of Combinatorial Designs","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Disjoint sets; Intersection (aeronautics); Block (permutation group theory); Block size; Discrete mathematics; Closure (psychology); Graph; Computer science","score_opus":0.07509661579310065,"score_gpt":0.2916596910825237,"score_spread":0.21656307528942306,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1996563160","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9879503,0.000094866205,0.0011084629,0.00000795015,0.0068387403,0.00025129935,0.0000100195275,0.000023999557,0.0037143568],"genre_scores_gemma":[0.993198,0.00005004641,0.0062593017,0.000015019649,0.00038965096,0.0000024453104,4.0631863e-7,0.000045804227,0.00003936977],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99657464,0.00048818695,0.0017345968,0.00018057994,0.00071475597,0.000307234],"domain_scores_gemma":[0.99495345,0.0012210262,0.0023041102,0.00041229508,0.0009500647,0.00015906697],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0016679391,0.00031002468,0.0009063926,0.0005320043,0.00014216924,0.00002448352,0.00058383896,0.00031122885,0.00012952414],"category_scores_gemma":[0.0014261426,0.00025806876,0.00069343275,0.0004867765,0.0002702084,0.000274869,0.00012446156,0.0005936831,8.4660064e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0037434248,0.0013233603,0.010219813,0.0005336888,0.0014466644,0.00008285923,0.014841871,0.000031292013,0.049553707,0.9162454,0.0015328311,0.00044511203],"study_design_scores_gemma":[0.003272248,0.002534187,0.003581001,0.00042980566,0.00059408986,0.00020136399,0.000543423,0.000009445624,0.07341827,0.91493875,0.00017241802,0.00030501818],"about_ca_topic_score_codex":0.00002502528,"about_ca_topic_score_gemma":0.0000029964121,"teacher_disagreement_score":0.023864558,"about_ca_system_score_codex":0.000050103863,"about_ca_system_score_gemma":0.00014913036,"threshold_uncertainty_score":0.9999871},"labels":[],"label_agreement":null},{"id":"W1999614683","doi":"10.9734/bjmcs/2015/14231","title":"Overview of Graph Colouring and some Ramsey-type Numbers","year":2014,"lang":"en","type":"article","venue":"British Journal of Mathematics & Computer Science","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Nipissing University","funders":"","keywords":"Mathematics; Ramsey's theorem; Combinatorics; Graph; Discrete mathematics","score_opus":0.03412295081493342,"score_gpt":0.29417112249170363,"score_spread":0.2600481716767702,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1999614683","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9523104,0.00095799443,0.045764755,0.000029396886,0.0006096652,0.00009342989,0.0000014365753,0.000014286491,0.00021864565],"genre_scores_gemma":[0.736166,0.00031495176,0.263283,0.00008287936,0.00012841827,3.3175e-7,4.9170186e-8,0.00001278676,0.000011597525],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981335,0.00007236495,0.0007128714,0.00017126252,0.0006568347,0.00025315981],"domain_scores_gemma":[0.99795735,0.0004703874,0.0007516691,0.00025734692,0.00040923615,0.00015403207],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028916001,0.0001334942,0.0004874019,0.00018673678,0.00024836126,0.00015204832,0.0007243592,0.00005163525,0.000011286073],"category_scores_gemma":[0.00055945397,0.00012237164,0.000118300515,0.00037959302,0.0006266262,0.00040576854,0.00031520036,0.00021691756,4.979441e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000136033805,0.00028726386,0.0004489453,0.0013352003,0.00009848822,0.00007331995,0.004943246,0.00006619032,0.000929562,0.9300688,0.00092894543,0.06080646],"study_design_scores_gemma":[0.0005075785,0.00023220356,0.0014376371,0.0014029575,0.000052661053,0.0031661673,0.00008728481,0.004539874,0.0008665857,0.98741335,0.000108556924,0.00018512098],"about_ca_topic_score_codex":0.0000035497922,"about_ca_topic_score_gemma":0.000001370956,"teacher_disagreement_score":0.21751826,"about_ca_system_score_codex":0.00001857011,"about_ca_system_score_gemma":0.00006218817,"threshold_uncertainty_score":0.4990171},"labels":[],"label_agreement":null},{"id":"W2001779588","doi":"10.1006/jcta.1999.3036","title":"Some New Bounds for Cover-Free Families","year":2000,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":102,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Cover (algebra); Combinatorics; Mathematics; Upper and lower bounds; Discrete mathematics; Engineering; Mathematical analysis","score_opus":0.015494861498290434,"score_gpt":0.26975640607044293,"score_spread":0.2542615445721525,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2001779588","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9547408,0.0024043696,0.0012559262,0.0011621392,0.022794986,0.00064816256,0.00006492645,0.00011357357,0.016815098],"genre_scores_gemma":[0.9341671,0.0015627632,0.016716104,0.0007675112,0.017273327,0.000015417427,0.000004047666,0.00018615345,0.02930758],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982854,0.00017434725,0.00069976697,0.00013603589,0.0003985918,0.00030582363],"domain_scores_gemma":[0.9976503,0.0010883596,0.00041181725,0.00047688946,0.00020364102,0.0001689541],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012963769,0.00023708421,0.0005701944,0.000119294666,0.00032345374,0.00009880197,0.0007554172,0.00016079872,0.00075369613],"category_scores_gemma":[0.001052753,0.00017909188,0.00041395338,0.0001262963,0.00021391398,0.0006504549,0.00008066437,0.00028181783,0.0000035507678],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0037285625,0.000076064185,0.000009853496,0.000045295033,0.00018993586,0.000010449738,0.0013119023,0.0000062017216,0.0000809352,0.9579729,0.03283034,0.003737554],"study_design_scores_gemma":[0.002849707,0.00087622163,0.000015091856,0.000048444108,0.00010712544,0.00009420176,0.00027834656,0.0000013016344,0.0010369538,0.82732236,0.16719365,0.00017656307],"about_ca_topic_score_codex":0.0000015412357,"about_ca_topic_score_gemma":4.3424797e-7,"teacher_disagreement_score":0.13436331,"about_ca_system_score_codex":0.00005314279,"about_ca_system_score_gemma":0.00017045661,"threshold_uncertainty_score":0.82524437},"labels":[],"label_agreement":null},{"id":"W2002473456","doi":"10.1016/j.jctb.2015.04.006","title":"Sparse halves in dense triangle-free graphs","year":2015,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Combinatorics; Mathematics; Conjecture; Degree (music); Trapezoid graph; Graph; Chordal graph; Split graph; Discrete mathematics; Indifference graph; 1-planar graph","score_opus":0.043663304583729926,"score_gpt":0.28988127677971504,"score_spread":0.24621797219598512,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2002473456","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9778131,0.0007947187,0.00010852298,0.0002514831,0.012037359,0.00018222298,0.000006259415,0.000032968208,0.0087733455],"genre_scores_gemma":[0.99654454,0.000060849976,0.0021576737,0.00006695383,0.00076106953,0.0000030033618,4.7383426e-7,0.00003816487,0.00036727203],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972849,0.00077414024,0.000927759,0.00013926449,0.00057218235,0.00030176606],"domain_scores_gemma":[0.99723214,0.00096854474,0.00065440714,0.0005312448,0.000378657,0.00023500601],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0045125033,0.00023924881,0.0007063133,0.00036574743,0.000102379665,0.00005995923,0.0007796726,0.0001807326,0.00007937612],"category_scores_gemma":[0.0050653443,0.00017954515,0.0003024188,0.00033887054,0.0002651464,0.0005155388,0.00019851103,0.0004954709,0.0000020709288],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0034571216,0.00016584588,0.00046486943,0.000023462337,0.000101248756,0.00018348,0.0031000313,0.0000047151098,0.000054163207,0.9867836,0.0052334294,0.00042802168],"study_design_scores_gemma":[0.005326309,0.00068163505,0.00013249474,0.00008208188,0.00006864205,0.0002849766,0.0017294409,0.000001036391,0.001012729,0.98530585,0.0051726326,0.0002021551],"about_ca_topic_score_codex":0.0000025377956,"about_ca_topic_score_gemma":0.0000049226583,"teacher_disagreement_score":0.018731419,"about_ca_system_score_codex":0.000084462394,"about_ca_system_score_gemma":0.00016564887,"threshold_uncertainty_score":0.7321639},"labels":[],"label_agreement":null},{"id":"W2003130149","doi":"10.1016/j.jcta.2004.10.006","title":"On a conjecture of Brown concerning accessible sets","year":2005,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Conjecture; Mathematics; Pure mathematics","score_opus":0.023209250469334558,"score_gpt":0.3031206753338589,"score_spread":0.27991142486452436,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2003130149","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9835367,0.00038053497,0.00029521596,0.0002254627,0.0038446293,0.00013036304,0.000009456093,0.000024110193,0.011553497],"genre_scores_gemma":[0.99702847,0.000037547197,0.0017610791,0.00011240224,0.0007780557,0.0000013149996,4.2770486e-7,0.000028915689,0.00025178026],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99814045,0.00033421553,0.0007357604,0.00011487578,0.0004625609,0.00021215311],"domain_scores_gemma":[0.99700916,0.0012999808,0.0010216173,0.00028287742,0.0002882923,0.00009808719],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001401444,0.00020440751,0.0005852796,0.00015431453,0.0001592708,0.000038233153,0.00046507717,0.00015962489,0.0005304802],"category_scores_gemma":[0.0010270936,0.00014351089,0.00026158305,0.00015807488,0.00021918495,0.00035093483,0.00009275578,0.00046528698,0.0000013208039],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0018441953,0.000109844535,0.00006188845,0.000055406013,0.00017001158,0.000016670649,0.0020528997,0.00003823359,0.00044901346,0.9912807,0.001674258,0.0022469151],"study_design_scores_gemma":[0.0018154993,0.00079232984,0.000044619243,0.00018735518,0.00007783941,0.00012547785,0.0003233916,0.0000037303612,0.014024554,0.9751369,0.0073202173,0.00014810669],"about_ca_topic_score_codex":5.665624e-7,"about_ca_topic_score_gemma":5.2127484e-7,"teacher_disagreement_score":0.016143784,"about_ca_system_score_codex":0.000050391467,"about_ca_system_score_gemma":0.00009257255,"threshold_uncertainty_score":0.5852204},"labels":[],"label_agreement":null},{"id":"W2003634762","doi":"10.1002/rsa.20324","title":"Regular induced subgraphs of a random Graph","year":2010,"lang":"en","type":"article","venue":"Random Structures and Algorithms","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Combinatorics; Random regular graph; Induced subgraph isomorphism problem; Graph factorization; Factor-critical graph; Mathematics; Random graph; Graph; Wheel graph; struct; Induced subgraph; Discrete mathematics; Graph power; Line graph; Voltage graph; Computer science; Vertex (graph theory); Pathwidth","score_opus":0.016115455177745156,"score_gpt":0.2739155880886527,"score_spread":0.25780013291090753,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2003634762","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99567,0.00039015745,0.0012686445,0.000058539652,0.0010359378,0.0004905488,0.000039015347,0.0000779103,0.00096920755],"genre_scores_gemma":[0.9849471,0.00010719523,0.014482091,0.000058242706,0.00027821015,0.000016828044,0.000006165831,0.000040900333,0.00006326112],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981762,0.0001302681,0.0005566161,0.00039508694,0.00038076984,0.00036101814],"domain_scores_gemma":[0.9981373,0.00069275504,0.00028456975,0.0005933827,0.00012579137,0.00016620955],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006788221,0.00034485158,0.00079322216,0.00023993496,0.00032994212,0.00004720539,0.0003206886,0.00029308817,0.0001616268],"category_scores_gemma":[0.00040097436,0.00023743363,0.0003171787,0.00026917647,0.00039557865,0.00010296957,0.00012463139,0.00052695704,2.870609e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015932557,0.00007046725,0.0012282707,0.00028223265,0.0004624252,0.000023704717,0.0024429718,0.0000022978402,0.056420643,0.89316267,0.0005552227,0.043755822],"study_design_scores_gemma":[0.011769101,0.00008991342,0.0027916438,0.000026215277,0.00013540593,0.00010372142,0.00014243004,0.000118072676,0.018492663,0.9654399,0.0005620424,0.0003288885],"about_ca_topic_score_codex":0.00004322218,"about_ca_topic_score_gemma":0.000023195695,"teacher_disagreement_score":0.07227721,"about_ca_system_score_codex":0.00000352397,"about_ca_system_score_gemma":0.000024337456,"threshold_uncertainty_score":0.96822625},"labels":[],"label_agreement":null},{"id":"W2005177185","doi":"10.1016/j.jpaa.2009.08.003","title":"The Erdős–Ginzburg–Ziv theorem for finite solvable groups","year":2009,"lang":"en","type":"article","venue":"Journal of Pure and Applied Algebra","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":18,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University","funders":"National Key Research and Development Program of China; Natural Sciences and Engineering Research Council of Canada; Brock University","keywords":"Mathematics; Combinatorics; Finite group; Order (exchange); Sequence (biology); Product (mathematics); Solvable group; Cyclic group; Repetition (rhetorical device); Discrete mathematics; Group (periodic table); Abelian group; Geometry; Physics","score_opus":0.015236078130318251,"score_gpt":0.2582046708477834,"score_spread":0.24296859271746518,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2005177185","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.90398425,0.0049314583,0.052763347,0.007731288,0.0014325549,0.001288391,0.000024958936,0.00008978478,0.027753988],"genre_scores_gemma":[0.9941059,0.00017033613,0.0039035736,0.00083447405,0.0006962604,0.0000047137546,7.006361e-7,0.00001777838,0.00026625898],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99894303,0.000028110057,0.00042945737,0.00011323499,0.00021912646,0.00026704028],"domain_scores_gemma":[0.99824005,0.0010105387,0.00036595672,0.00020424504,0.00008550835,0.00009371865],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009700892,0.00016222878,0.0003003022,0.000057700196,0.0005185082,0.00010224228,0.0002895925,0.00009813984,0.000020083717],"category_scores_gemma":[0.00013736887,0.00008664379,0.0001708426,0.00008424731,0.00009568138,0.00008010107,0.000035934638,0.00027688424,7.67094e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018278604,0.00003177692,0.0000060942093,0.000019036252,0.000067733745,0.0000031650377,0.00064857595,0.0000065972813,0.0005784156,0.96921587,0.009787632,0.019452324],"study_design_scores_gemma":[0.000706938,0.00018542349,0.00009035521,0.00002462051,0.00008290601,0.000048339654,0.00047077498,0.00003701523,0.0013971502,0.9813995,0.0154375285,0.00011945596],"about_ca_topic_score_codex":6.64097e-8,"about_ca_topic_score_gemma":7.684214e-7,"teacher_disagreement_score":0.09012167,"about_ca_system_score_codex":0.000011423167,"about_ca_system_score_gemma":0.000023885712,"threshold_uncertainty_score":0.3987998},"labels":[],"label_agreement":null},{"id":"W2007625773","doi":"10.1007/s00440-011-0403-2","title":"Linear cover time is exponentially unlikely","year":2011,"lang":"en","type":"article","venue":"Probability Theory and Related Fields","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Mathematics; Exponential growth; Conjecture; Cover (algebra); Simple (philosophy); Mathematical finance; Bounded function; Random walk; Discrete mathematics; Graph; Combinatorics; Applied mathematics; Statistical physics; Mathematical analysis; Statistics","score_opus":0.0300886413041751,"score_gpt":0.2513436588127229,"score_spread":0.2212550175085478,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2007625773","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8829396,0.0002494903,0.0019358355,0.00014878044,0.00038045252,0.00040737062,0.0000124812195,0.0001853615,0.11374066],"genre_scores_gemma":[0.9887662,0.00004984775,0.0033473736,0.00034762145,0.00004218898,0.000007678132,0.0000026159441,0.000023303086,0.007413179],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99856895,0.00036303222,0.0003631204,0.00033548995,0.00012950649,0.00023989157],"domain_scores_gemma":[0.9987761,0.00047927204,0.00010211657,0.00048778072,0.000060372593,0.00009436516],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0014548306,0.00019422184,0.00025508337,0.000048654874,0.00022713009,0.00001341663,0.00020493835,0.00049733184,0.0062784357],"category_scores_gemma":[0.0003848313,0.00014132455,0.00013782896,0.00010362353,0.0003337396,0.00011251618,0.0001688138,0.00046271578,0.0000827962],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003044322,0.00013603743,0.00023300012,0.00008910055,0.00015452298,0.000008271106,0.011482889,8.100097e-7,0.00007894822,0.9855354,0.0005787801,0.0013978295],"study_design_scores_gemma":[0.0003531356,0.00010277245,0.00027162005,0.000028334089,0.00008890139,0.000026161459,0.000052857526,0.000081594786,0.0014821155,0.99674976,0.00056188187,0.00020089286],"about_ca_topic_score_codex":0.0000037741424,"about_ca_topic_score_gemma":4.120377e-7,"teacher_disagreement_score":0.10632748,"about_ca_system_score_codex":0.00000979172,"about_ca_system_score_gemma":0.000018517843,"threshold_uncertainty_score":0.99463},"labels":[],"label_agreement":null},{"id":"W2008159222","doi":"10.1145/1806689.1806705","title":"Load balancing and orientability thresholds for random hypergraphs","year":2010,"lang":"en","type":"article","venue":"","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":30,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Hypergraph; Combinatorics; Conjecture; Mathematics; Vertex (graph theory); Orientation (vector space); Cardinality (data modeling); Graph; Discrete mathematics; Computer science; Geometry","score_opus":0.015553342676786312,"score_gpt":0.2914554300851569,"score_spread":0.2759020874083706,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2008159222","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98271465,0.000035814905,0.0030703482,0.000081335296,0.0006360007,0.00037533604,0.000009459615,0.00007924252,0.012997797],"genre_scores_gemma":[0.97658646,0.0000047919116,0.02276274,0.000119667115,0.00010638548,0.00002563267,9.860078e-7,0.000013950904,0.00037936526],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992658,0.000017650638,0.00018909104,0.00021163185,0.00012872617,0.00018708427],"domain_scores_gemma":[0.9987359,0.00073582336,0.000042059008,0.00033259884,0.00008281652,0.00007082223],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00072827673,0.00011673055,0.00020077002,0.000028345128,0.00022415035,0.000027299484,0.00010908481,0.000099288,0.00016009388],"category_scores_gemma":[0.00063057523,0.00007797609,0.000091461276,0.000053492367,0.00013736691,0.00006733537,0.00006562785,0.00014356301,5.681895e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012900567,0.000028611701,0.01918285,0.00007318784,0.000025391924,3.9846338e-7,0.00060724263,7.79405e-8,0.0033611096,0.9734738,0.0010497377,0.0020685897],"study_design_scores_gemma":[0.0016980534,0.00003188427,0.0018011879,0.0000042983743,0.00002978528,0.000013543513,0.000112520225,0.00011582009,0.002565271,0.98915786,0.0043357196,0.00013408967],"about_ca_topic_score_codex":0.000010180855,"about_ca_topic_score_gemma":0.0001282393,"teacher_disagreement_score":0.019692391,"about_ca_system_score_codex":0.000006780234,"about_ca_system_score_gemma":0.000018110642,"threshold_uncertainty_score":0.31797728},"labels":[],"label_agreement":null},{"id":"W2008912653","doi":"10.1016/j.jctb.2014.11.008","title":"A density Hales–Jewett theorem for matroids","year":2014,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Office of Naval Research","keywords":"Matroid; Mathematics; Mathematical economics; Combinatorics","score_opus":0.01541190292802947,"score_gpt":0.2713370931026248,"score_spread":0.25592519017459536,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2008912653","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.928704,0.00016771958,0.044223666,0.00039256678,0.017359277,0.00043242302,0.000012803633,0.000081127015,0.008626387],"genre_scores_gemma":[0.9892562,0.00001674948,0.007808104,0.00013833,0.0022647285,0.000005011527,8.836381e-7,0.000048405127,0.00046157255],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979182,0.0005199306,0.00070736284,0.0001532105,0.00039010638,0.0003111784],"domain_scores_gemma":[0.9960474,0.002164698,0.0007072477,0.00040789106,0.00052793376,0.00014483574],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0043046135,0.00024734394,0.00064422004,0.0001317636,0.00036558637,0.000069230126,0.0005454177,0.0001826732,0.00008235625],"category_scores_gemma":[0.0025898688,0.00017903117,0.00045326067,0.000113262875,0.00029057893,0.0003028175,0.00011297312,0.0003406333,0.0000016700972],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00228648,0.00008293964,0.0000922179,0.00008078485,0.00015271732,0.0000060318207,0.0007695482,0.0000014564811,0.00039097332,0.9921594,0.0022775333,0.001699902],"study_design_scores_gemma":[0.0018266775,0.0008515768,0.00006876508,0.000056858556,0.00014508003,0.00018624762,0.0002917618,0.000006591144,0.007227098,0.97080255,0.018328972,0.00020779918],"about_ca_topic_score_codex":3.389908e-7,"about_ca_topic_score_gemma":5.2651177e-7,"teacher_disagreement_score":0.060552187,"about_ca_system_score_codex":0.000048599613,"about_ca_system_score_gemma":0.00005809004,"threshold_uncertainty_score":0.7300679},"labels":[],"label_agreement":null},{"id":"W2012217557","doi":"10.1016/j.laa.2012.01.014","title":"Rational decomposition of dense hypergraphs and some related eigenvalue estimates","year":2012,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":21,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Hypergraph; Eigenvalues and eigenvectors; Decomposition; Combinatorics; Scheme (mathematics); Discrete mathematics; Mathematical analysis","score_opus":0.018751817336667954,"score_gpt":0.30297765680643857,"score_spread":0.2842258394697706,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2012217557","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99373746,0.0032910171,0.001948069,0.00011703387,0.000043251126,0.00031013566,0.000029263945,0.000044485918,0.0004792576],"genre_scores_gemma":[0.9871989,0.00027108256,0.012246994,0.00005391906,0.00008550951,0.00004973682,0.000023295044,0.000013730307,0.000056859066],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993935,0.0000246232,0.0002404101,0.00012390991,0.00009103381,0.00012651215],"domain_scores_gemma":[0.9993347,0.0002865045,0.000096745505,0.00014471916,0.000055780885,0.00008153904],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015926268,0.000098671015,0.00014364174,0.00007019245,0.00023064208,0.0000093203125,0.000056637607,0.00008020325,0.000036081718],"category_scores_gemma":[0.000054848748,0.0000829726,0.000035963956,0.0001071098,0.000092611146,0.00015515044,0.00004830651,0.00007764635,0.0000039241227],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005994038,0.000058814494,0.0016098265,0.000051143066,0.000037583814,6.603548e-8,0.00042725346,0.0000018114034,0.0047057816,0.9922277,0.000049965187,0.0008240954],"study_design_scores_gemma":[0.00027337432,0.000026659613,0.009474704,0.000019980125,0.00010624272,0.00003776916,0.00005872948,0.0013433045,0.009707948,0.97825396,0.00055372267,0.00014362593],"about_ca_topic_score_codex":0.0000012816301,"about_ca_topic_score_gemma":3.1564744e-7,"teacher_disagreement_score":0.013973726,"about_ca_system_score_codex":0.0000041839435,"about_ca_system_score_gemma":0.000007707314,"threshold_uncertainty_score":0.3383524},"labels":[],"label_agreement":null},{"id":"W2013425391","doi":"10.1016/j.jcta.2012.12.008","title":"On the number of pentagons in triangle-free graphs","year":2013,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":164,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Engineering and Physical Sciences Research Council","keywords":"Combinatorics; Mathematics; Computer science; Discrete mathematics","score_opus":0.017312287981244973,"score_gpt":0.2730303166830055,"score_spread":0.2557180287017605,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2013425391","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98261744,0.00006141847,0.000019004037,0.00060800527,0.0035083634,0.00025392242,0.000005377177,0.000008492715,0.012917981],"genre_scores_gemma":[0.9990364,0.000033107353,0.0003670098,0.000099431854,0.00019879328,0.000007730092,1.8498733e-7,0.000022457773,0.0002349322],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99784625,0.00063394575,0.0007968114,0.000090519905,0.0004272555,0.00020520821],"domain_scores_gemma":[0.9953698,0.0031129813,0.0006996258,0.0005144413,0.00023649445,0.00006667056],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0021370274,0.00017410814,0.0005124487,0.00014120441,0.00011656329,0.000036637422,0.00079469493,0.00010851485,0.0014575003],"category_scores_gemma":[0.0026376129,0.00009798126,0.0003170439,0.00025405773,0.00027973758,0.00026125324,0.00013763206,0.00044842288,0.0000043381506],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008904198,0.00016993085,0.0003652819,0.000021921012,0.00010100617,0.0000090110425,0.001229056,8.9325505e-7,0.00013261719,0.9914896,0.005360663,0.00022959565],"study_design_scores_gemma":[0.0018722554,0.0003210397,0.00049472105,0.000098707584,0.000037924034,0.000062637846,0.0012350733,6.860734e-7,0.0014138661,0.9938669,0.00049010204,0.00010607929],"about_ca_topic_score_codex":0.000006116842,"about_ca_topic_score_gemma":0.0000012579922,"teacher_disagreement_score":0.016418917,"about_ca_system_score_codex":0.000031467705,"about_ca_system_score_gemma":0.00004881717,"threshold_uncertainty_score":0.9994553},"labels":[],"label_agreement":null},{"id":"W2014991120","doi":"10.1007/s11856-011-0170-x","title":"Sums and products along sparse graphs","year":2011,"lang":"en","type":"article","venue":"Israel Journal of Mathematics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Mathematics; Combinatorics; Disjoint sets; Upper and lower bounds; Product (mathematics); Matching (statistics); Discrete mathematics; Generalization; Mathematical proof","score_opus":0.078044364158453,"score_gpt":0.2790261313142098,"score_spread":0.20098176715575677,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2014991120","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9928702,0.0005792597,0.001320484,0.000061627834,0.00044326988,0.00016121099,0.0000032464081,0.000026664617,0.004534019],"genre_scores_gemma":[0.83254224,0.00013671772,0.16696644,0.000061455496,0.00012215173,0.0000013357552,1.5579765e-7,0.000037238315,0.00013224213],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983668,0.00006893097,0.0008091002,0.00013356096,0.0003775287,0.00024411942],"domain_scores_gemma":[0.9981139,0.00031945383,0.00075262587,0.0003781923,0.00029978037,0.00013608509],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012213084,0.00021347478,0.0004798093,0.00021120574,0.00012983952,0.000030435509,0.00034122373,0.00010054059,0.000040553703],"category_scores_gemma":[0.000818673,0.00014683462,0.00013812973,0.00016682554,0.00019297666,0.00016141063,0.00011109579,0.00029973936,0.0000030776434],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000036271238,0.00032103105,0.002592089,0.00047433944,0.00020505337,0.00011205131,0.013474571,2.4872423e-7,0.00037434438,0.9795997,0.0010032905,0.001806998],"study_design_scores_gemma":[0.00047567787,0.00016938236,0.0011230663,0.00019617012,0.00018511305,0.0013405447,0.0023884731,0.0000169403,0.0033927006,0.99025613,0.00026452984,0.00019129991],"about_ca_topic_score_codex":0.000004258901,"about_ca_topic_score_gemma":0.0000046419173,"teacher_disagreement_score":0.16564596,"about_ca_system_score_codex":0.000013594011,"about_ca_system_score_gemma":0.000037563186,"threshold_uncertainty_score":0.5987742},"labels":[],"label_agreement":null},{"id":"W2015916970","doi":"10.4153/cmb-2005-019-9","title":"The Distribution of Totatives","year":2005,"lang":"en","type":"article","venue":"Canadian Mathematical Bulletin","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Mathematics; Coprime integers; Combinatorics; Prime (order theory); Character (mathematics); Prime number; Number theory; Distribution (mathematics); Discrete mathematics; Mathematical analysis","score_opus":0.015615507584769643,"score_gpt":0.2614591314321451,"score_spread":0.24584362384737546,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2015916970","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.79606986,0.000569773,0.0068050795,0.034752656,0.00024884733,0.00083009247,0.0001864343,0.00010637141,0.16043088],"genre_scores_gemma":[0.9945623,0.0000109379025,0.002553829,0.0001541678,0.00008592675,0.000014128233,0.00000402704,0.0000147136325,0.002599913],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990167,0.00007399015,0.00032410142,0.00011447228,0.00016890415,0.00030180352],"domain_scores_gemma":[0.99821186,0.001098882,0.00008264779,0.0003278932,0.00007311833,0.00020560587],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0004973167,0.000112800866,0.00017745815,0.000029958013,0.00034868467,0.000024017965,0.00026385701,0.00007021008,0.0020694642],"category_scores_gemma":[0.0015095654,0.00006989466,0.00009249887,0.000085112784,0.00030075925,0.00001653651,0.000035327666,0.00012907671,0.00037786094],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000046069126,0.000012547717,0.000011501713,0.00002940775,0.00001849731,0.0000013092332,0.0003427696,0.0000011191142,0.0000062292033,0.9687883,0.02744058,0.0033431195],"study_design_scores_gemma":[0.00009566552,0.000016052918,0.00012608847,0.0000283101,0.000015680196,0.000009116658,0.00016254745,0.00008615634,0.0002826305,0.78317195,0.21592009,0.00008570384],"about_ca_topic_score_codex":0.000056735797,"about_ca_topic_score_gemma":0.00038532654,"teacher_disagreement_score":0.1984925,"about_ca_system_score_codex":0.00007075703,"about_ca_system_score_gemma":0.000055814893,"threshold_uncertainty_score":0.9988428},"labels":[],"label_agreement":null},{"id":"W2016667694","doi":"10.1007/s004930200014","title":"Ramsey Numbers for Trees of Small Maximum Degree","year":2002,"lang":"en","type":"article","venue":"COMBINATORICA","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":25,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Combinatorics; Bipartite graph; Degree (music); Ramsey's theorem; Vertex (graph theory); Graph; Upper and lower bounds; Complete bipartite graph; Tree (set theory); Discrete mathematics","score_opus":0.1102685928597671,"score_gpt":0.28648096946199547,"score_spread":0.17621237660222838,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2016667694","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8094656,0.0016789313,0.0078032757,0.00047581532,0.0029074464,0.001367612,0.000056849873,0.00034110242,0.1759034],"genre_scores_gemma":[0.9899778,0.000032117256,0.008161109,0.000046760822,0.000042427066,0.000026854474,0.0000014794741,0.00003108486,0.0016803703],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991455,0.000039382787,0.00027217923,0.00017382503,0.00013738644,0.00023174784],"domain_scores_gemma":[0.9987569,0.000518799,0.0001419638,0.00042427715,0.00009128861,0.000066758315],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017203929,0.00014309159,0.000287122,0.00006435813,0.00012921522,0.000010486667,0.00032076155,0.00010698971,0.00016621174],"category_scores_gemma":[0.00031576538,0.0001190922,0.00017388604,0.00015092637,0.000086422704,0.000034544104,0.000075246346,0.00009698957,0.000004804017],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020478426,0.00017933414,0.0006299871,0.00012231339,0.00006093771,0.000002234514,0.0008000024,4.9225736e-7,0.00006160714,0.97161245,0.016878884,0.009631295],"study_design_scores_gemma":[0.0008500489,0.00013876661,0.0003094639,0.00002011666,0.000048291982,0.0000044959233,0.00006861295,0.00015244483,0.00071924285,0.98659587,0.0109407725,0.00015185619],"about_ca_topic_score_codex":0.000004778609,"about_ca_topic_score_gemma":0.000003301466,"teacher_disagreement_score":0.18051222,"about_ca_system_score_codex":0.000026717977,"about_ca_system_score_gemma":0.0000058380733,"threshold_uncertainty_score":0.4856439},"labels":[],"label_agreement":null},{"id":"W2019462472","doi":"10.1007/s00373-008-0795-7","title":"Hadwiger Number and the Cartesian Product of Graphs","year":2008,"lang":"en","type":"article","venue":"Graphs and Combinatorics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Combinatorics; Cartesian product; Mathematics; Graph; Discrete mathematics; Upper and lower bounds; Square (algebra); Geometry","score_opus":0.019050658265849774,"score_gpt":0.24508049963449793,"score_spread":0.22602984136864815,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2019462472","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9915272,0.0013934681,0.000014886916,0.000166277,0.00030204892,0.00024939032,0.0000046583773,0.0000362159,0.006305876],"genre_scores_gemma":[0.99827665,0.0010692575,0.00024058994,0.00007473276,0.000012868163,0.0000132952155,8.1210925e-7,0.00001744061,0.000294334],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99902135,0.00009350642,0.0002575865,0.00021540339,0.0002210633,0.0001910711],"domain_scores_gemma":[0.99904794,0.0002839428,0.00012390691,0.00038528428,0.00009305892,0.000065895336],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036628128,0.00016754809,0.00032616145,0.0000641816,0.00043911606,0.000014979913,0.00015513985,0.00006619215,0.000013195759],"category_scores_gemma":[0.00010515347,0.000100696365,0.00010581577,0.00030562427,0.0008744808,0.00005943569,0.00010343591,0.0001718821,3.8100438e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000037118803,0.000046015524,0.035317544,0.000058986305,0.000055223252,0.0000050080794,0.0021139795,3.912361e-8,0.000009789696,0.9607267,0.001262749,0.00036688385],"study_design_scores_gemma":[0.0011572836,0.000035938992,0.012984129,0.000012920326,0.000055983255,0.00011144964,0.00015474964,0.000008048757,0.00022877402,0.9844703,0.00064627547,0.00013411247],"about_ca_topic_score_codex":0.00002743767,"about_ca_topic_score_gemma":0.0000017489953,"teacher_disagreement_score":0.023743674,"about_ca_system_score_codex":0.0000035313706,"about_ca_system_score_gemma":0.000013918188,"threshold_uncertainty_score":0.41062787},"labels":[],"label_agreement":null},{"id":"W2020233469","doi":"10.1017/s0963548311000642","title":"Corrádi and Hajnal's Theorem for Sparse Random Graphs","year":2012,"lang":"en","type":"article","venue":"Combinatorics Probability Computing","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":28,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Trinity College","funders":"","keywords":"Combinatorics; Mathematics; Embedding; Independent set; Graph; Random graph; Binary logarithm; Discrete mathematics; Computer science","score_opus":0.049873761704026916,"score_gpt":0.296083561940946,"score_spread":0.24620980023691907,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2020233469","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97184974,0.0006847343,0.022284327,0.000058339738,0.0017142566,0.0011610051,0.00000744174,0.00019865639,0.0020414826],"genre_scores_gemma":[0.9854974,0.000008998755,0.014186408,0.000070856484,0.00013710368,0.000021350279,0.0000036556198,0.000038008267,0.000036227368],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99805236,0.00022859349,0.0005093401,0.00036458598,0.00023222255,0.00061291456],"domain_scores_gemma":[0.9958955,0.0029404236,0.00022920639,0.0005357166,0.0001971575,0.00020199196],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003239932,0.00028153835,0.0004966347,0.000085100786,0.0006881269,0.000057382644,0.0002870973,0.00015551153,0.000009263147],"category_scores_gemma":[0.0019304068,0.00023487925,0.00018859672,0.00024015653,0.00026411272,0.00015001128,0.00035512156,0.00026237257,0.0000010212237],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000096818,0.00019597053,0.017098222,0.00030664596,0.000044428747,3.5868948e-7,0.0026092713,0.000003309289,0.000016513959,0.97665423,0.00024810206,0.0027261018],"study_design_scores_gemma":[0.0018059292,0.000091963346,0.0015115724,0.000039600036,0.00007005379,0.000017037712,0.00012732655,0.0013537727,0.00021193351,0.99387336,0.00060843356,0.00028904752],"about_ca_topic_score_codex":0.0000027978592,"about_ca_topic_score_gemma":6.176536e-7,"teacher_disagreement_score":0.017219072,"about_ca_system_score_codex":0.000070711,"about_ca_system_score_gemma":0.000025061323,"threshold_uncertainty_score":0.95780975},"labels":[],"label_agreement":null},{"id":"W2022058915","doi":"10.1016/j.jcta.2007.11.007","title":"The number of possibilities for random dating","year":2008,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Combinatorics; Vertex (graph theory); Induced subgraph isomorphism problem; Mathematics; Random graph; Graph; Set (abstract data type); Discrete mathematics; Computer science; Line graph; Voltage graph; Programming language","score_opus":0.02580193314037548,"score_gpt":0.3056127799729388,"score_spread":0.2798108468325633,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2022058915","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.989587,0.00029709077,0.00086834066,0.00006437394,0.0054529915,0.00022083586,0.000009779758,0.000011876851,0.0034876906],"genre_scores_gemma":[0.99481326,0.00011589861,0.0031996975,0.000016926098,0.0007939294,0.000005375576,3.3014794e-7,0.00002317085,0.0010313912],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99830425,0.00031360186,0.0008067712,0.000073935524,0.00031366703,0.00018778615],"domain_scores_gemma":[0.9927731,0.0055376524,0.000852082,0.00027176697,0.00051530584,0.000050062114],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028081497,0.00013525884,0.0004519937,0.00003651786,0.0005830316,0.000024661476,0.00040536042,0.00007700424,0.00006433037],"category_scores_gemma":[0.0033741642,0.00007652262,0.00034014665,0.000083927305,0.00051264267,0.000225895,0.00007299037,0.00019524575,2.148751e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0045458497,0.00004501159,0.00018828307,0.000052267464,0.00016511702,0.000004115912,0.0033339967,0.0000011264165,0.000107404434,0.99000716,0.0011893385,0.00036032673],"study_design_scores_gemma":[0.0027366844,0.0002607615,0.00003687122,0.000048690046,0.000060140515,0.00028011634,0.0019468856,0.0000019866181,0.0029846395,0.98836535,0.003189551,0.000088302324],"about_ca_topic_score_codex":8.7711703e-7,"about_ca_topic_score_gemma":2.0595584e-7,"teacher_disagreement_score":0.0055311075,"about_ca_system_score_codex":0.00002113557,"about_ca_system_score_gemma":0.00009249228,"threshold_uncertainty_score":0.4484267},"labels":[],"label_agreement":null},{"id":"W2022319070","doi":"10.1002/rsa.20488","title":"For most graphs<i>H</i>, most<i>H</i>‐free graphs have a linear homogeneous set","year":2013,"lang":"en","type":"article","venue":"Random Structures and Algorithms","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Engineering and Physical Sciences Research Council","keywords":"Combinatorics; Mathematics; Split graph; Conjecture; Cograph; Graph; Induced subgraph; Discrete mathematics; Homogeneous; Random regular graph; Chordal graph; 1-planar graph","score_opus":0.02067114998214117,"score_gpt":0.2743805863062095,"score_spread":0.25370943632406834,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2022319070","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9720534,0.003322071,0.013517236,0.00064635335,0.0019480071,0.0048271706,0.0014631303,0.0004768727,0.0017457664],"genre_scores_gemma":[0.86016107,0.0009570627,0.13391298,0.0017213109,0.0009795465,0.00065004866,0.00017150093,0.0002682761,0.0011782313],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99722743,0.00013632984,0.00069340714,0.00071746996,0.00043282183,0.0007925626],"domain_scores_gemma":[0.9971959,0.0010177704,0.00027900242,0.0009198494,0.00026095187,0.00032651384],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00041520144,0.00063345575,0.0009101983,0.00023967569,0.00088804896,0.00019739449,0.0006277813,0.00034128252,0.00020065528],"category_scores_gemma":[0.0005095518,0.00045607053,0.0003864498,0.0002874829,0.0003832865,0.00020301143,0.00029223866,0.00037116566,0.0000020569091],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001555421,0.00018733532,0.001862893,0.0011554781,0.0018746491,0.00008435528,0.0069585564,0.00010379144,0.0025444585,0.75185186,0.08912159,0.14269961],"study_design_scores_gemma":[0.008771922,0.00020342554,0.00034817404,0.000036625053,0.00019513749,0.00018648856,0.00036040344,0.0026200355,0.0017006572,0.9796368,0.005279483,0.0006608542],"about_ca_topic_score_codex":0.00016334374,"about_ca_topic_score_gemma":0.000030186677,"teacher_disagreement_score":0.22778493,"about_ca_system_score_codex":0.000018051634,"about_ca_system_score_gemma":0.0000381822,"threshold_uncertainty_score":0.9997891},"labels":[],"label_agreement":null},{"id":"W2022449958","doi":"10.1016/j.jcta.2004.07.010","title":"Almost disjoint families of 3-term arithmetic progressions","year":2004,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Disjoint sets; Arithmetic; Term (time); Mathematics; Arithmetic progression; Point (geometry); Combinatorics; Discrete mathematics; Geometry","score_opus":0.016629102650738782,"score_gpt":0.28815015757052165,"score_spread":0.27152105491978284,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2022449958","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99140006,0.00042960967,0.0005622106,0.00017901827,0.005085885,0.0001980025,0.000010826566,0.000025819741,0.0021085588],"genre_scores_gemma":[0.9944863,0.00012662045,0.0047960393,0.000021195754,0.00045558365,0.0000034044253,6.2434316e-7,0.000030100777,0.00008015793],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99806,0.00022135727,0.00088239723,0.00011691409,0.00048454662,0.00023480698],"domain_scores_gemma":[0.9977897,0.00048168417,0.00088786596,0.00034476834,0.00037254055,0.00012346676],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011577191,0.00021482832,0.0006158735,0.00018617393,0.00020955266,0.000032388638,0.00044568663,0.00013038154,0.00008139319],"category_scores_gemma":[0.000929683,0.00014538462,0.0003314426,0.00021879462,0.0004925274,0.0002964154,0.00015704904,0.00036437073,7.308048e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00085962226,0.00030069484,0.00019663268,0.00010163401,0.00017114046,0.000046106463,0.003300211,0.000007456444,0.0009415195,0.99302375,0.000084676365,0.0009665688],"study_design_scores_gemma":[0.001776806,0.0009366468,0.00035950585,0.0003455122,0.00012390262,0.00025475194,0.0015955115,2.2220054e-7,0.012559184,0.9812416,0.00064958987,0.00015677647],"about_ca_topic_score_codex":0.0000010978788,"about_ca_topic_score_gemma":6.043665e-7,"teacher_disagreement_score":0.011782146,"about_ca_system_score_codex":0.00005524756,"about_ca_system_score_gemma":0.00013747685,"threshold_uncertainty_score":0.5928613},"labels":[],"label_agreement":null},{"id":"W2022730759","doi":"10.1007/s11083-009-9131-y","title":"On Minimal Prime Graphs and Posets","year":2009,"lang":"en","type":"article","venue":"Order","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Mathematics; Antichain; Combinatorics; Prime (order theory); Discrete mathematics; Partially ordered set","score_opus":0.015306450410302702,"score_gpt":0.28578481517410337,"score_spread":0.27047836476380066,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2022730759","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9680929,0.00007766158,0.00004907909,0.00028041558,0.00008876368,0.00007972082,0.0000025026773,0.00005134424,0.031277604],"genre_scores_gemma":[0.994512,0.000009370099,0.003947598,0.00070603454,0.000021681823,0.0000010492251,9.085809e-7,0.000008318208,0.0007930151],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995433,0.00001970931,0.0000881096,0.00012636743,0.00009573141,0.00012674645],"domain_scores_gemma":[0.9996272,0.00010530966,0.0000284124,0.00017847028,0.00002122786,0.00003943665],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008260911,0.000087601744,0.00010093307,0.00004567713,0.000093266906,0.00001497645,0.000067022665,0.000056356923,0.0001387958],"category_scores_gemma":[0.000100118195,0.00006372671,0.000028058821,0.000070922644,0.000039757742,0.000028677798,0.00001848988,0.0000805501,0.0000067425253],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028148592,0.00003728385,0.00013838754,0.000005386165,0.000010325893,0.000004576245,0.00038876152,1.06022995e-7,0.00021569653,0.98690933,0.0032747888,0.008987212],"study_design_scores_gemma":[0.0002412916,0.00013885117,0.007259924,0.000010441511,0.000010764477,0.000010193443,0.00001640366,0.000009075246,0.00043687123,0.99058706,0.0011862806,0.00009287018],"about_ca_topic_score_codex":5.6650805e-7,"about_ca_topic_score_gemma":6.069058e-7,"teacher_disagreement_score":0.03048459,"about_ca_system_score_codex":0.0000033450494,"about_ca_system_score_gemma":0.0000051451393,"threshold_uncertainty_score":0.25986996},"labels":[],"label_agreement":null},{"id":"W2022956475","doi":"10.1017/s0963548306007693","title":"Colouring Random 4-Regular Graphs","year":2006,"lang":"en","type":"article","venue":"Combinatorics Probability Computing","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":24,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Random graph; Mathematics; Random regular graph; Combinatorics; Discrete mathematics; Exponential random graph models; Chromatic scale; Graph; Line graph; Pathwidth","score_opus":0.021718065295472547,"score_gpt":0.26021704019595693,"score_spread":0.23849897490048438,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2022956475","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98205733,0.00023203253,0.0075053563,0.00007137923,0.0010859208,0.0006157042,0.0000022618674,0.00044439075,0.007985617],"genre_scores_gemma":[0.9914402,0.000001836549,0.008230019,0.000030805935,0.00012511764,0.000008597023,0.000003967621,0.000039540184,0.000119940305],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975779,0.00027692626,0.00068568095,0.00050805404,0.00041507243,0.0005363625],"domain_scores_gemma":[0.9975633,0.0011188696,0.00026349543,0.00073812524,0.00022536093,0.00009083549],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0017571091,0.0003034034,0.00049533916,0.00012498912,0.0008131075,0.00007769831,0.000489662,0.00017021991,0.000017337523],"category_scores_gemma":[0.0006004188,0.00027672367,0.00025978775,0.0005194794,0.00021385105,0.00009658196,0.00042536354,0.0003734802,0.0000033926672],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002497463,0.00021464216,0.013357667,0.00018314533,0.00002648259,0.000007183711,0.00025081992,0.00014307396,0.000091036025,0.9846112,0.0004622557,0.00062748324],"study_design_scores_gemma":[0.0015281684,0.000044401964,0.0030307525,0.000046295056,0.000036649653,0.000013464254,0.000026445978,0.0015794013,0.0011279372,0.99183685,0.0004094252,0.0003201855],"about_ca_topic_score_codex":0.000026349653,"about_ca_topic_score_gemma":0.000004214104,"teacher_disagreement_score":0.0103269145,"about_ca_system_score_codex":0.00014184043,"about_ca_system_score_gemma":0.00003717134,"threshold_uncertainty_score":0.99996847},"labels":[],"label_agreement":null},{"id":"W2023112883","doi":"10.4153/cmb-2004-035-7","title":"A Strong Form of a Problem of R. L. Graham","year":2004,"lang":"en","type":"article","venue":"Canadian Mathematical Bulletin","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Canadian Mathematical Society; National Science Foundation","keywords":"Mathematics; Combinatorics; Set (abstract data type)","score_opus":0.020562321262978637,"score_gpt":0.2549708241667181,"score_spread":0.2344085029037395,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2023112883","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.83433974,0.00011559917,0.0072154696,0.0018457253,0.000083432176,0.0009980889,0.00009809482,0.00006392727,0.15523994],"genre_scores_gemma":[0.9529572,0.0000026665575,0.046498235,0.0000808556,0.000026626432,0.00001776085,0.0000019231309,0.000029800865,0.0003849074],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986251,0.000028289058,0.00056364987,0.00016600217,0.00024437992,0.00037259786],"domain_scores_gemma":[0.99877,0.0002464129,0.00017486949,0.00040213362,0.00010382761,0.00030275033],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00038327917,0.00016867937,0.00043737164,0.00016796838,0.00008192218,0.000008541986,0.00030562363,0.00012888853,0.0031250704],"category_scores_gemma":[0.00038087234,0.00013603081,0.0001657598,0.000152766,0.00025705196,0.000021327633,0.000051281735,0.00015309172,0.000086469416],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007634871,0.000056429886,0.000023140115,0.0005391257,0.00004124114,0.000008212009,0.001547734,0.0000033240035,0.00006191679,0.99626803,0.001100638,0.00034258034],"study_design_scores_gemma":[0.00041868835,0.00008251626,0.000035762398,0.00025516545,0.00004099476,0.000023339617,0.0002585362,0.0000068118434,0.0013050603,0.9954774,0.0019567048,0.00013901418],"about_ca_topic_score_codex":0.00060894236,"about_ca_topic_score_gemma":0.0008007864,"teacher_disagreement_score":0.15485503,"about_ca_system_score_codex":0.000085680156,"about_ca_system_score_gemma":0.00018430981,"threshold_uncertainty_score":0.9977862},"labels":[],"label_agreement":null},{"id":"W2024469085","doi":"10.1016/j.disc.2009.04.020","title":"Some bounds on the injective chromatic number of graphs","year":2009,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":38,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Council","keywords":"Injective function; Chromatic scale; Mathematics; Combinatorics; Discrete mathematics","score_opus":0.023747419379476255,"score_gpt":0.30682949604287385,"score_spread":0.2830820766633976,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2024469085","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9538206,0.000058987087,0.0005774189,0.00043709052,0.00018187801,0.0005270546,0.000025759418,0.000104021885,0.044267185],"genre_scores_gemma":[0.99073666,0.000020295414,0.008329096,0.0004102839,0.000091348615,0.000017536013,0.0000026612233,0.00003753254,0.0003545592],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99823266,0.00011259597,0.0005929638,0.00021684171,0.0005239787,0.00032092907],"domain_scores_gemma":[0.99727935,0.0012372363,0.000391464,0.0009456856,0.00008068608,0.00006555898],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000615571,0.00030331174,0.00049666385,0.00008880463,0.00029010559,0.000044943452,0.0005325808,0.00012103474,0.0001911224],"category_scores_gemma":[0.0006742217,0.00017199152,0.00029238182,0.00028472222,0.00027156132,0.00011049688,0.000081098246,0.00027045514,0.000025844774],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014335387,0.00015223019,0.000041315612,0.00014249532,0.000091989335,0.0000027024398,0.006712969,0.00000164244,0.00016860181,0.9912805,0.0012146899,0.00017655916],"study_design_scores_gemma":[0.0002315998,0.00014176051,0.0003629717,0.0002077309,0.00009043393,0.000022274844,0.0011608142,0.0002937098,0.0022384569,0.9949841,0.000049073,0.00021709247],"about_ca_topic_score_codex":0.0000017874917,"about_ca_topic_score_gemma":6.7804206e-7,"teacher_disagreement_score":0.043912627,"about_ca_system_score_codex":0.000030160021,"about_ca_system_score_gemma":0.000022137663,"threshold_uncertainty_score":0.70136106},"labels":[],"label_agreement":null},{"id":"W2027453144","doi":"10.1073/pnas.0503263102","title":"Regularity, uniformity, and quasirandomness","year":2005,"lang":"en","type":"letter","venue":"Proceedings of the National Academy of Sciences","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computational biology; Chemistry; Biology","score_opus":0.0663980061671866,"score_gpt":0.3302229077788199,"score_spread":0.2638249016116333,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2027453144","genre_codex":"commentary","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28532484,0.00062972686,0.0000017551909,0.6582156,0.00014088926,0.0008109251,0.000114596696,0.000050330724,0.054711334],"genre_scores_gemma":[0.88662344,0.00014774183,0.008028509,0.100499004,0.002230543,0.000016035727,5.30269e-7,0.00002830486,0.0024258909],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99735683,0.0000140480915,0.00046334765,0.00029595318,0.0016730713,0.00019674494],"domain_scores_gemma":[0.9983375,0.00052165735,0.0008279506,0.0000140556085,0.00027700086,0.000021840196],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020016907,0.0001876607,0.00037085923,0.00023851177,0.0003595269,0.00003743467,0.0012912556,0.0004883892,0.000017034803],"category_scores_gemma":[0.0008877349,0.00011070642,0.00014353826,0.0003948943,0.0020141208,0.0002810059,0.0004957859,0.0008404907,1.8644695e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001160532,0.000016574928,0.00051032,0.0006384833,0.00004622449,1.9210926e-8,0.0002587385,7.015224e-7,0.0005238196,0.77270645,0.22495613,0.00033096335],"study_design_scores_gemma":[0.00020804844,0.000018028664,0.0013959622,0.00019991324,0.000047374535,0.0000347709,0.000032756103,0.00003624115,0.0048361435,0.9785276,0.014525269,0.00013786912],"about_ca_topic_score_codex":0.0000020836515,"about_ca_topic_score_gemma":4.1217593e-8,"teacher_disagreement_score":0.6012986,"about_ca_system_score_codex":0.000024446437,"about_ca_system_score_gemma":0.0000255414,"threshold_uncertainty_score":0.7421112},"labels":[],"label_agreement":null},{"id":"W2027624102","doi":"10.1002/jgt.20103","title":"Linear Ramsey numbers of sparse graphs","year":2005,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Combinatorics; Mathematics; Ramsey's theorem; Chordal graph; Clique-sum; Indifference graph; Pathwidth; Discrete mathematics; Conjecture; 1-planar graph; Dense graph; Graph; Line graph","score_opus":0.026343419314670446,"score_gpt":0.3002599617595846,"score_spread":0.27391654244491415,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2027624102","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9868506,0.0010084502,0.0023421308,0.00015060337,0.0006936185,0.00011814481,0.000010318949,0.000025859352,0.008800281],"genre_scores_gemma":[0.9778709,0.00024752918,0.0210218,0.00020798108,0.00033912322,9.4635607e-7,4.412656e-7,0.00003724605,0.00027402779],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978033,0.00032202993,0.0009900191,0.00013079135,0.00048475314,0.00026911634],"domain_scores_gemma":[0.9972837,0.00082039967,0.0010397537,0.00040791612,0.00029539427,0.00015284531],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002481246,0.0002172135,0.0005687143,0.00047023653,0.00012588387,0.000012355918,0.0005348492,0.00015212233,0.0003609718],"category_scores_gemma":[0.00052847306,0.00015549488,0.0006813279,0.00034213826,0.00037744944,0.00022122516,0.00007204,0.00047338603,0.0000037920556],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00044469652,0.00018983017,0.0010437036,0.00006474966,0.00035671817,0.000022026163,0.0019185453,0.000047026144,0.0008718072,0.9862405,0.0028062293,0.0059941844],"study_design_scores_gemma":[0.0008742636,0.00018497727,0.00047344592,0.00011210284,0.00017729189,0.00021759882,0.000496691,0.000010739421,0.0045261616,0.98988473,0.0028721176,0.00016987418],"about_ca_topic_score_codex":0.0000014315482,"about_ca_topic_score_gemma":0.0000029471707,"teacher_disagreement_score":0.01867967,"about_ca_system_score_codex":0.000021664991,"about_ca_system_score_gemma":0.00004731956,"threshold_uncertainty_score":0.6340897},"labels":[],"label_agreement":null},{"id":"W2027899079","doi":"10.1016/j.disc.2005.06.009","title":"Chromatic numbers and products","year":2005,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Chromatic scale; Mathematics; Combinatorics; Discrete mathematics; Graph; Graph theory; Product (mathematics); Geometry","score_opus":0.02251451114500187,"score_gpt":0.2876285084972687,"score_spread":0.2651139973522668,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2027899079","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9513025,0.00029399738,0.0023729845,0.0009328317,0.00016432664,0.00054177095,0.000012815705,0.00025779346,0.04412097],"genre_scores_gemma":[0.812742,0.00003068928,0.1851161,0.0001388447,0.00022205229,0.000019471821,0.0000030555134,0.000054522356,0.0016732566],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986958,0.000040089,0.00041230425,0.000260181,0.00028452397,0.00030712847],"domain_scores_gemma":[0.99880725,0.0002975638,0.00016717475,0.00057373685,0.000053478765,0.0001007983],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040023559,0.00024486595,0.00034551808,0.00007145508,0.00023287642,0.000059836766,0.00022113818,0.00008876351,0.00012993693],"category_scores_gemma":[0.000559227,0.00018220617,0.00006896656,0.00014844238,0.00018048876,0.00015999445,0.00016253928,0.00015445732,0.000030075335],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000050646154,0.00007529649,0.000085026164,0.00076791126,0.00007149501,0.000003811663,0.009439286,0.0000017389755,0.00032400148,0.98408395,0.0032074028,0.0019350006],"study_design_scores_gemma":[0.00039267098,0.000037941878,0.000136804,0.00013116344,0.000110261964,0.00011159468,0.00090157916,0.0013057854,0.0020117778,0.990222,0.004262938,0.00037549197],"about_ca_topic_score_codex":0.0000017106865,"about_ca_topic_score_gemma":0.0000058305695,"teacher_disagreement_score":0.18274312,"about_ca_system_score_codex":0.000026148899,"about_ca_system_score_gemma":0.000015819265,"threshold_uncertainty_score":0.7430152},"labels":[],"label_agreement":null},{"id":"W2027965373","doi":"10.1016/s0097-3165(03)00100-6","title":"Independent Deuber sets in graphs on the natural numbers","year":2003,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Natural (archaeology); Natural number; Mathematics; Combinatorics; Geography; Archaeology","score_opus":0.01538640533843842,"score_gpt":0.2696220057074402,"score_spread":0.2542356003690018,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2027965373","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9723532,0.00020380833,0.000010969949,0.0002238765,0.009308697,0.00018833634,0.000001849563,0.000013001566,0.017696243],"genre_scores_gemma":[0.9991712,0.000037383652,0.0002388041,0.00019510911,0.0001459057,0.0000037449047,1.7916327e-7,0.000026503836,0.0001811564],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99743444,0.0009912759,0.000610162,0.00012793695,0.0005538141,0.0002823473],"domain_scores_gemma":[0.99735945,0.0016187617,0.000455018,0.00033295545,0.00015512771,0.00007865646],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003236396,0.0002224543,0.0003925876,0.00017050582,0.00025627334,0.000058026075,0.00044510124,0.00013360762,0.00023981159],"category_scores_gemma":[0.0017011403,0.00012771493,0.00026141957,0.0002765967,0.00020163557,0.0002289879,0.000055376582,0.0008860215,0.000002175302],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00087813206,0.000110512636,0.0003914522,0.000011798858,0.000105074025,0.000059772465,0.0016610638,0.000004075335,0.000046666562,0.9957238,0.0008645439,0.0001431483],"study_design_scores_gemma":[0.0012725169,0.00025378284,0.00029850114,0.000069803726,0.00003292866,0.00021914855,0.0014423471,5.345908e-7,0.0016001732,0.99046236,0.0041916766,0.00015622884],"about_ca_topic_score_codex":0.0000012558475,"about_ca_topic_score_gemma":0.0000048020047,"teacher_disagreement_score":0.026817996,"about_ca_system_score_codex":0.00007657129,"about_ca_system_score_gemma":0.00006530918,"threshold_uncertainty_score":0.5208064},"labels":[],"label_agreement":null},{"id":"W2028246501","doi":"10.1016/s0012-365x(00)00311-3","title":"Ramsey properties of generalised irredundant sets in graphs","year":2001,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Mathematics; Combinatorics; Discrete mathematics","score_opus":0.05613135934968266,"score_gpt":0.2956441910405573,"score_spread":0.23951283169087462,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2028246501","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99098396,0.00025544348,0.0005972112,0.00008856308,0.00014849652,0.00041523308,0.000014261313,0.00006868665,0.007428147],"genre_scores_gemma":[0.9811907,0.00008748151,0.018221151,0.000050318697,0.00002654713,0.000028513165,0.0000040564328,0.000050452945,0.0003407948],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981968,0.00008663056,0.00075651763,0.00022893258,0.0003749904,0.0003561743],"domain_scores_gemma":[0.99879813,0.00014475633,0.00027607658,0.00063030707,0.000076873745,0.000073842995],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005045015,0.0002661232,0.0005478939,0.00021359808,0.00009800053,0.000028840792,0.00038673726,0.00012619511,0.00009134083],"category_scores_gemma":[0.0003205549,0.00018656395,0.0001845238,0.000351288,0.00022235668,0.00011313208,0.0001473746,0.00018125263,0.0000041498615],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000063665786,0.00027440875,0.0016606669,0.0009579265,0.00009515135,0.000029003466,0.014943105,0.000025883108,0.0061089722,0.9749052,0.00034267147,0.00059337064],"study_design_scores_gemma":[0.0006640163,0.0000500878,0.0003716175,0.00040434513,0.000053486758,0.000044710305,0.0015379771,0.0019733547,0.007282355,0.9871237,0.00017916546,0.00031518322],"about_ca_topic_score_codex":0.000019005945,"about_ca_topic_score_gemma":0.000026807702,"teacher_disagreement_score":0.01762394,"about_ca_system_score_codex":0.0000257329,"about_ca_system_score_gemma":0.00002630808,"threshold_uncertainty_score":0.7607857},"labels":[],"label_agreement":null},{"id":"W2028399610","doi":"10.1016/j.jcta.2007.07.010","title":"On sets of integers whose shifted products are powers","year":2007,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Cardinality (data modeling); Integer (computer science); Combinatorics; Mathematics; Property (philosophy); Discrete mathematics; Binary logarithm; Computer science","score_opus":0.01633077978276656,"score_gpt":0.28504268758100726,"score_spread":0.2687119077982407,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2028399610","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9857116,0.00017065457,0.00023109964,0.0001959572,0.009328611,0.00018484096,0.000007644663,0.000024279938,0.00414531],"genre_scores_gemma":[0.9981412,0.000021955833,0.0011070624,0.000075140466,0.00045943877,6.526952e-7,5.3822544e-7,0.000035782556,0.00015821279],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977776,0.00028228114,0.00090462447,0.00014940111,0.00059518387,0.00029092075],"domain_scores_gemma":[0.99631613,0.0011957905,0.00132838,0.0004023113,0.00062600005,0.00013138283],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003767755,0.00023835483,0.00061826076,0.00028684028,0.00013340778,0.000024470071,0.0004590736,0.0001649703,0.00010110622],"category_scores_gemma":[0.00361104,0.00017266274,0.00024577137,0.0003265072,0.00031601725,0.00025555174,0.00008354508,0.0005192553,0.0000010578034],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0061144377,0.00022785041,0.00010400084,0.00010019801,0.00020904696,0.000081521124,0.002492174,0.0000027062167,0.00056794536,0.98765665,0.0016608716,0.0007825687],"study_design_scores_gemma":[0.0013157215,0.0011456584,0.00035281706,0.00025152884,0.00007522382,0.00008975889,0.0018528898,3.271527e-7,0.023167811,0.9701501,0.0014248984,0.00017326201],"about_ca_topic_score_codex":6.3979877e-7,"about_ca_topic_score_gemma":6.2963505e-7,"teacher_disagreement_score":0.022599867,"about_ca_system_score_codex":0.000073241135,"about_ca_system_score_gemma":0.00008228141,"threshold_uncertainty_score":0.7040982},"labels":[],"label_agreement":null},{"id":"W2028659954","doi":"10.1016/j.disc.2012.05.010","title":"Shift graphs on precompact families of finite sets of natural numbers","year":2012,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; Fondo Nacional de Ciencia Tecnología e Innovación; Centre National de la Recherche Scientifique","keywords":"Mathematics; Combinatorics; Homomorphism; Discrete mathematics; Indifference graph; 1-planar graph; Pathwidth; Chordal graph; Maximal independent set; Chromatic scale; Natural number; Graph; Line graph","score_opus":0.028505839719055393,"score_gpt":0.3114435045596719,"score_spread":0.2829376648406165,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2028659954","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9709754,0.00017013072,0.00052966777,0.000020961568,0.00043316153,0.00030407982,0.00009678561,0.000056366734,0.02741343],"genre_scores_gemma":[0.98039746,0.000023869175,0.019341782,0.000028483475,0.000036713358,0.0000071707113,0.0000099350655,0.00004508509,0.00010949148],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99825716,0.000085488195,0.000677987,0.00015005919,0.00045366224,0.0003756395],"domain_scores_gemma":[0.9971813,0.0014749152,0.00051772443,0.0006655237,0.00006207826,0.0000984588],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005215621,0.00028793965,0.0006186312,0.0001817089,0.00008946908,0.000010833031,0.00035238158,0.00011991113,0.000116928146],"category_scores_gemma":[0.00059829047,0.00020333116,0.0003264519,0.00022632269,0.00025579843,0.00014443877,0.00011555794,0.00022409165,0.0000064375336],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004369249,0.00023576531,0.002552724,0.0010782474,0.00019588921,6.686598e-7,0.02314775,0.000010900687,0.00016372002,0.97179395,0.00041861783,0.00035805575],"study_design_scores_gemma":[0.0004418016,0.00011526796,0.0033202767,0.000378491,0.00016060888,0.0000066082316,0.0024062402,0.0003863249,0.008526944,0.98380387,0.00012154659,0.00033202706],"about_ca_topic_score_codex":0.000006919253,"about_ca_topic_score_gemma":0.000003749877,"teacher_disagreement_score":0.027303938,"about_ca_system_score_codex":0.00001622228,"about_ca_system_score_gemma":0.000013378071,"threshold_uncertainty_score":0.8291604},"labels":[],"label_agreement":null},{"id":"W2029408549","doi":"10.1016/j.aim.2009.04.006","title":"Bounding multiplicative energy by the sumset","year":2009,"lang":"en","type":"article","venue":"Advances in Mathematics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":148,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Bounding overwatch; Mathematics; Multiplicative function; Upper and lower bounds; Set (abstract data type); Discrete mathematics; Computer science; Mathematical analysis","score_opus":0.01552868812815231,"score_gpt":0.3177975687069196,"score_spread":0.3022688805787673,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2029408549","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4360965,0.026981806,0.2181482,0.0032800382,0.001767805,0.0023002424,0.0001473879,0.00089674105,0.3103813],"genre_scores_gemma":[0.96196103,0.0008017461,0.0359046,0.00047171532,0.00008220749,0.000036989062,0.000004996301,0.000028879738,0.0007078392],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99864024,0.00007749677,0.00044338123,0.00023066498,0.00027400968,0.0003341869],"domain_scores_gemma":[0.99776596,0.0013211528,0.00023152505,0.0005962405,0.000039071838,0.000046049125],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004658641,0.00022171244,0.00030464475,0.0000649285,0.0002678589,0.000037965066,0.0005486399,0.00008258745,0.00004030248],"category_scores_gemma":[0.0004954444,0.00013837247,0.000084012536,0.00027025977,0.00017813517,0.00022962257,0.00007454043,0.00021268871,0.0000036117144],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007240919,0.00011402182,0.00007544784,0.000036001034,0.000010157565,0.000002512278,0.002919493,0.00001169484,0.00015426075,0.9798623,0.0011641516,0.015642729],"study_design_scores_gemma":[0.00024190747,0.000034414476,0.0000614054,0.00006836555,0.000014743578,0.000015492222,0.0007869696,0.00068871805,0.0011182693,0.98049307,0.016289802,0.00018684582],"about_ca_topic_score_codex":0.0000027699461,"about_ca_topic_score_gemma":0.000014573035,"teacher_disagreement_score":0.52586454,"about_ca_system_score_codex":0.0000491824,"about_ca_system_score_gemma":0.000009425067,"threshold_uncertainty_score":0.56426656},"labels":[],"label_agreement":null},{"id":"W2029461183","doi":"10.1515/crelle-2012-0064","title":"On the number of integers in a generalized multiplication table","year":2012,"lang":"en","type":"article","venue":"Journal für die reine und angewandte Mathematik (Crelles Journal)","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Multiplication (music); Table (database); Order (exchange); Natural number; Multiplication algorithm; Prime number","score_opus":0.0380263259884183,"score_gpt":0.3443773132782273,"score_spread":0.306350987289809,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2029461183","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9778872,0.003965043,0.0044531054,0.0011536701,0.00065449125,0.0003605839,0.000012466,0.000028098537,0.011485314],"genre_scores_gemma":[0.9831546,0.002812611,0.011777979,0.00024770232,0.00073460204,0.000015152655,0.0000015237376,0.00008150613,0.0011743534],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99678904,0.00046600215,0.001278021,0.00016770956,0.00069086615,0.00060837244],"domain_scores_gemma":[0.9960834,0.0015887364,0.0013115746,0.0004934906,0.00026412262,0.0002586904],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035643948,0.000363257,0.0006714682,0.0003069505,0.00057907874,0.00013274644,0.0006088365,0.00017005217,0.00074341334],"category_scores_gemma":[0.0015626631,0.00019993212,0.00040475966,0.00037050017,0.00014752605,0.00037095495,0.00012713665,0.0011832287,0.000019889056],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003715642,0.00084543566,0.0026438984,0.00022327939,0.00062967144,0.000048901424,0.009808913,0.00014002704,0.0036221144,0.9651064,0.013799559,0.002760224],"study_design_scores_gemma":[0.0016622125,0.00009336765,0.0002730387,0.00082343444,0.00018293783,0.0016005753,0.0013993514,0.00029090323,0.0074829264,0.9782475,0.007595122,0.00034859809],"about_ca_topic_score_codex":0.000007479143,"about_ca_topic_score_gemma":0.0000068324157,"teacher_disagreement_score":0.013141121,"about_ca_system_score_codex":0.00016556533,"about_ca_system_score_gemma":0.000060323684,"threshold_uncertainty_score":0.8152996},"labels":[],"label_agreement":null},{"id":"W2029485128","doi":"10.1016/j.jcta.2004.02.002","title":"A hypergraph extension of the bipartite Turán problem","year":2004,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":26,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Extension (predicate logic); Hypergraph; Combinatorics; Upper and lower bounds; Mathematics; Bipartite graph; Element (criminal law); Set (abstract data type); Computer science; Graph; Law; Mathematical analysis; Political science","score_opus":0.014395830166834702,"score_gpt":0.25527151260474595,"score_spread":0.24087568243791124,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2029485128","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99144465,0.0004034671,0.0001865121,0.0003758938,0.0055144713,0.00020654494,0.0000040560676,0.000017214546,0.0018471634],"genre_scores_gemma":[0.99696714,0.00006475822,0.0023690164,0.00006146529,0.00039639004,0.0000019809502,1.1756506e-7,0.000024943309,0.00011417037],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99816215,0.00028743522,0.00074215344,0.00010869674,0.0004974796,0.00020209883],"domain_scores_gemma":[0.9978466,0.00032833283,0.00089794677,0.00043500608,0.00041581682,0.000076295255],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001529579,0.00017914573,0.0004522849,0.0001124991,0.00023018333,0.000024480698,0.00053567026,0.00012199907,0.000042910247],"category_scores_gemma":[0.00067029876,0.00009920482,0.00041743575,0.00031545587,0.00036639188,0.0002490448,0.00016183247,0.00036866413,5.19237e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008206634,0.00014446837,0.000100770056,0.00005591912,0.00011327689,0.000010607611,0.0015602672,0.00003285627,0.004060304,0.9926088,0.00023426786,0.0002578195],"study_design_scores_gemma":[0.0014675806,0.0004619829,0.0002918769,0.00024013531,0.000105552375,0.00022644582,0.0003561041,2.4080433e-7,0.020866077,0.9735658,0.0023042036,0.00011400751],"about_ca_topic_score_codex":0.0000017778495,"about_ca_topic_score_gemma":9.263018e-7,"teacher_disagreement_score":0.019042987,"about_ca_system_score_codex":0.000038802547,"about_ca_system_score_gemma":0.00011444756,"threshold_uncertainty_score":0.40454555},"labels":[],"label_agreement":null},{"id":"W2030099274","doi":"10.1002/rsa.20491","title":"Sets that are connected in two random graphs","year":2013,"lang":"en","type":"article","venue":"Random Structures and Algorithms","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Combinatorics; struct; Mathematics; Random graph; Vertex (graph theory); Vertex connectivity; Set (abstract data type); Random regular graph; Discrete mathematics; Graph; Chordal graph; Computer science; 1-planar graph","score_opus":0.022245076795035533,"score_gpt":0.2897099671517167,"score_spread":0.2674648903566812,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2030099274","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99526626,0.0011844522,0.00055711705,0.00018577011,0.0005932044,0.0010380754,0.00004128851,0.000121743244,0.0010121093],"genre_scores_gemma":[0.99396086,0.00021628733,0.0051927543,0.00026602967,0.00012590835,0.00007414677,0.000012241576,0.000046253757,0.00010554069],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979496,0.00025843355,0.00046857516,0.00047556087,0.0003294502,0.0005183954],"domain_scores_gemma":[0.99803776,0.0010549427,0.0002343901,0.00041356147,0.0000827839,0.00017654423],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00038429874,0.00041324366,0.0008377672,0.00023857995,0.000314151,0.00014664097,0.0002700644,0.0001552444,0.0004948416],"category_scores_gemma":[0.0002715872,0.00028236993,0.00019005283,0.00024074629,0.00023528222,0.0002098897,0.00013768027,0.00038777394,0.0000031589984],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.003542504,0.00027068343,0.0781718,0.00092895475,0.0011661802,0.00032398463,0.011675228,0.00012423999,0.0015144191,0.7260953,0.011325896,0.1648608],"study_design_scores_gemma":[0.023217358,0.00003165498,0.032549497,0.00006981068,0.000053152504,0.00008678267,0.00056269363,0.0013236867,0.00051013153,0.9409136,0.0002572734,0.00042435343],"about_ca_topic_score_codex":0.00023545435,"about_ca_topic_score_gemma":0.00009346172,"teacher_disagreement_score":0.2148183,"about_ca_system_score_codex":0.000018100309,"about_ca_system_score_gemma":0.000013582511,"threshold_uncertainty_score":0.99996287},"labels":[],"label_agreement":null},{"id":"W2030362910","doi":"10.1017/s0963548309990216","title":"The <i>t</i>-Improper Chromatic Number of Random Graphs","year":2009,"lang":"en","type":"article","venue":"Combinatorics Probability Computing","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":27,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Chromatic scale; Combinatorics; Mathematics; Random graph; Graph; Constant (computer programming); Discrete mathematics; Degree (music); Computer science; Physics","score_opus":0.023055607890313284,"score_gpt":0.29374503954948333,"score_spread":0.27068943165917003,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2030362910","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9881447,0.00022589872,0.0015539594,0.00017745621,0.0007167091,0.00064689515,0.0000012777398,0.00014257591,0.008390548],"genre_scores_gemma":[0.9962257,0.00001003454,0.0035859512,0.00006264638,0.00003884615,0.0000038817448,7.8661446e-7,0.00001786885,0.00005424396],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977491,0.00033043534,0.0007880466,0.00030700222,0.00042404563,0.0004013855],"domain_scores_gemma":[0.99650574,0.0018495888,0.00036812952,0.0009034031,0.00029342427,0.00007972932],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023190824,0.00023846154,0.00045965656,0.00003726874,0.0007980138,0.000053440854,0.00065507204,0.00011347058,0.000011475632],"category_scores_gemma":[0.0015184142,0.00015042952,0.00024928313,0.0004674512,0.00029072154,0.000073575495,0.0002135107,0.00033208416,0.000002667752],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000037224087,0.0001864555,0.0030296163,0.00014489883,0.000029263605,0.0000011022206,0.0009413445,0.0000084529875,0.000073486146,0.9904514,0.00023439294,0.004862339],"study_design_scores_gemma":[0.0010099867,0.0000789395,0.002456296,0.000050800856,0.000037240105,0.000014478333,0.00004812031,0.0009214389,0.0005653103,0.99447495,0.00016092506,0.00018151729],"about_ca_topic_score_codex":0.0000036353433,"about_ca_topic_score_gemma":6.224062e-7,"teacher_disagreement_score":0.008336304,"about_ca_system_score_codex":0.00005899493,"about_ca_system_score_gemma":0.000043029624,"threshold_uncertainty_score":0.61377573},"labels":[],"label_agreement":null},{"id":"W2030901166","doi":"","title":"The Acyclic Edge Chromatic Number of a Random d-Regular Graph is d + 1","year":2001,"lang":"en","type":"article","venue":"","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":47,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Combinatorics; Mathematics; Edge coloring; Discrete mathematics; Chromatic scale; Conjecture; Brooks' theorem; Windmill graph; Graph coloring; Foster graph; Wheel graph; Friendship graph; Graph; List coloring; Critical graph; Random graph; Graph power; Line graph","score_opus":0.019989005174651825,"score_gpt":0.2994730386400654,"score_spread":0.2794840334654136,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2030901166","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9219659,0.00019835001,0.0016017813,0.00034533048,0.00024576366,0.00030482357,0.000004187509,0.00007077665,0.07526309],"genre_scores_gemma":[0.99146515,0.00017592871,0.002584835,0.00023579708,0.00007427483,0.00001723708,7.36196e-7,0.0000239146,0.005422155],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988694,0.00009766538,0.00038611208,0.0001442077,0.00025818648,0.00024442677],"domain_scores_gemma":[0.99820554,0.0008795947,0.00014121829,0.00066281727,0.000058915968,0.00005191561],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0004747797,0.00015196664,0.0002851123,0.00003770385,0.00029094412,0.000026000249,0.0003630246,0.000078481055,0.001198556],"category_scores_gemma":[0.0002028697,0.00007922365,0.00023739105,0.00022496356,0.00024477582,0.00005650522,0.00009273034,0.000102001286,0.000018972856],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000103348444,0.000069226066,0.002094655,0.000079856014,0.00021934204,0.0000046505793,0.0019584051,3.421029e-7,0.00022815919,0.970134,0.02198633,0.0031216762],"study_design_scores_gemma":[0.0011250323,0.000015485126,0.00053785706,0.000027098647,0.00006218493,0.000052864994,0.00026121407,0.00006306996,0.0017521858,0.98863256,0.0073503824,0.00012004796],"about_ca_topic_score_codex":0.000012019007,"about_ca_topic_score_gemma":0.000009898073,"teacher_disagreement_score":0.06984094,"about_ca_system_score_codex":0.000008115393,"about_ca_system_score_gemma":0.000011754314,"threshold_uncertainty_score":0.9997145},"labels":[],"label_agreement":null},{"id":"W2032005618","doi":"10.1016/j.disc.2009.05.029","title":"Adaptable chromatic number of graph products","year":2009,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Council","keywords":"Mathematics; Combinatorics; Chromatic scale; Conjecture; Hypergraph; Vertex (graph theory); Graph; Discrete mathematics; Critical graph; Graph power; Line graph","score_opus":0.02673794540202884,"score_gpt":0.30292517599615304,"score_spread":0.2761872305941242,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2032005618","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9068669,0.0001693347,0.007903092,0.00029256355,0.00026717264,0.00073863973,0.000028984652,0.00023929673,0.083494],"genre_scores_gemma":[0.8514998,0.000018918267,0.14736114,0.00006546926,0.000080474165,0.000009192501,0.000005166703,0.000038152546,0.0009216718],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981124,0.000056984274,0.0007204261,0.00026434005,0.00047358518,0.00037228758],"domain_scores_gemma":[0.9981464,0.00026674068,0.00039984993,0.0009527333,0.00014842716,0.00008583211],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050149666,0.00029359947,0.000603884,0.000096130636,0.00015816135,0.000029046256,0.0004279227,0.00011749166,0.00025409274],"category_scores_gemma":[0.00063754234,0.00021884592,0.0001904325,0.0004106288,0.0001496219,0.00014553705,0.00008372267,0.00017131167,0.000021050479],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010908204,0.00020472055,0.00008097412,0.00072020805,0.00007093988,0.000004745106,0.0038614958,0.00000315522,0.0011334643,0.9915797,0.001857216,0.00047247045],"study_design_scores_gemma":[0.00030326462,0.00007341333,0.0002167474,0.0002060636,0.00011500147,0.000053104075,0.00047598017,0.0002984787,0.006862981,0.9909119,0.00020956226,0.00027350395],"about_ca_topic_score_codex":0.0000022572624,"about_ca_topic_score_gemma":7.0778816e-7,"teacher_disagreement_score":0.13945806,"about_ca_system_score_codex":0.000018774617,"about_ca_system_score_gemma":0.000030146102,"threshold_uncertainty_score":0.89242774},"labels":[],"label_agreement":null},{"id":"W2032160258","doi":"10.1017/s096354831200034x","title":"(<i>k</i>+1)-Cores Have <i>k</i>-Factors","year":2012,"lang":"en","type":"article","venue":"Combinatorics Probability Computing","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Conjecture; Mathematics; Combinatorics; Core (optical fiber); Discrete mathematics; Computer science; Telecommunications","score_opus":0.07341463199734996,"score_gpt":0.31347880665337574,"score_spread":0.24006417465602578,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2032160258","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98408693,0.00031353434,0.0025628079,0.000038940678,0.0023568722,0.00043954645,0.0000040562095,0.0003906824,0.009806634],"genre_scores_gemma":[0.99473816,0.0000030591348,0.0047675944,0.00007502078,0.0002549279,0.000005226577,0.0000043523555,0.0000502886,0.00010134551],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99741477,0.0002817058,0.0005949259,0.0003954436,0.0004504376,0.00086270354],"domain_scores_gemma":[0.99692446,0.0014930515,0.0002629227,0.00085090735,0.00018246504,0.0002861948],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0017635144,0.00036520557,0.00046925552,0.000099855715,0.0007286094,0.00005422688,0.00052912266,0.00019535163,0.000043406133],"category_scores_gemma":[0.0016297124,0.00030417833,0.00023392844,0.00031968582,0.00020682458,0.0002496072,0.0006418033,0.00048498565,0.000007437027],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000056423514,0.00026003,0.2825788,0.00012489005,0.000028557604,6.8773556e-7,0.0029924691,0.000004245609,0.000024005723,0.71295667,0.00044723632,0.00057673943],"study_design_scores_gemma":[0.00032632996,0.00004459967,0.024368,0.000031205993,0.000038397666,0.000008824364,0.00022323556,0.0001964527,0.0014111033,0.9717069,0.0012626152,0.0003823175],"about_ca_topic_score_codex":0.000010352138,"about_ca_topic_score_gemma":0.0000012344098,"teacher_disagreement_score":0.25875023,"about_ca_system_score_codex":0.00017736247,"about_ca_system_score_gemma":0.00003164248,"threshold_uncertainty_score":0.99994105},"labels":[],"label_agreement":null},{"id":"W2032275177","doi":"10.1007/s003730200034","title":"Extension of Turán's Theorem to the 2-Stability Number","year":2002,"lang":"en","type":"article","venue":"Graphs and Combinatorics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Combinatorics; Mathematics; Stability theorem; Disjoint sets; Upper and lower bounds; Discrete mathematics; Graph; Induced subgraph; Vertex (graph theory)","score_opus":0.04106609175210166,"score_gpt":0.2630655757629958,"score_spread":0.22199948401089412,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2032275177","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9877978,0.00032949765,0.000102633996,0.00030346142,0.00041198326,0.00022028016,0.0000074260392,0.000039082868,0.010787848],"genre_scores_gemma":[0.999219,0.00012484593,0.00029528953,0.00016163148,0.000013606178,0.000008216159,3.7735566e-7,0.00001367174,0.00016338698],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990698,0.00009099286,0.00022997533,0.00020021488,0.00022837282,0.00018062374],"domain_scores_gemma":[0.9988143,0.0003542729,0.00007990406,0.00056312256,0.000111738154,0.0000766595],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045066388,0.00013573881,0.00021245613,0.000038628626,0.00024642874,0.000017577153,0.00021596198,0.000074794385,0.00019773777],"category_scores_gemma":[0.00021457384,0.00007956089,0.00009770409,0.00033395443,0.0001468098,0.000038161852,0.00015164108,0.00014488958,0.0000037703637],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000103213915,0.00008177925,0.0038867928,0.00003498475,0.000016623751,0.0000012668538,0.0017099296,1.9297026e-7,0.00003820929,0.98936665,0.0030272363,0.0018260026],"study_design_scores_gemma":[0.00020164697,0.000058943373,0.0037557224,0.000013964087,0.00002712566,0.0000099057725,0.00025847548,0.00005493328,0.0004822325,0.99262506,0.002400691,0.000111286274],"about_ca_topic_score_codex":0.0000065456015,"about_ca_topic_score_gemma":0.0000021594078,"teacher_disagreement_score":0.011421188,"about_ca_system_score_codex":0.000007526304,"about_ca_system_score_gemma":0.0000027659962,"threshold_uncertainty_score":0.32443988},"labels":[],"label_agreement":null},{"id":"W2033204100","doi":"10.7151/dmgt.1781","title":"Fractional aspects of the Erd\\H{o}s-Faber-Lov\\'asz Conjecture","year":2014,"lang":"en","type":"article","venue":"Discussiones Mathematicae Graph Theory","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Royal Military College of Canada","funders":"","keywords":"Mathematics; Combinatorics; Conjecture","score_opus":0.014632726829855083,"score_gpt":0.26535394602674345,"score_spread":0.2507212191968884,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2033204100","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7478067,0.00038968588,0.05720258,0.0022517391,0.002870219,0.0017842569,0.00010476774,0.0005043521,0.18708569],"genre_scores_gemma":[0.99516773,0.000009550179,0.0029270453,0.0002649591,0.00019736636,0.000046495876,0.000004524863,0.00008032866,0.0013019942],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99666053,0.00080915476,0.0008107129,0.00044895583,0.00081481785,0.0004558248],"domain_scores_gemma":[0.994874,0.0026482448,0.00064549886,0.0015580893,0.00012797455,0.00014616337],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0017809493,0.0004598865,0.00070852315,0.00020287835,0.00067982945,0.00003815949,0.0009869606,0.00026024575,0.001073114],"category_scores_gemma":[0.0020084328,0.00021625236,0.000689583,0.0005164281,0.00081180135,0.00014702689,0.00038927025,0.00049421226,0.000024063187],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006055313,0.00021569757,0.00021701188,0.00032639096,0.0001583348,0.0000012661776,0.0020977904,0.000007009234,0.00068603765,0.99395436,0.0011839587,0.0010915841],"study_design_scores_gemma":[0.00053580076,0.00005576376,0.0018998763,0.00030973804,0.00018371864,0.000053744512,0.0006794285,0.00006873265,0.0040930524,0.99067247,0.0011109503,0.00033674343],"about_ca_topic_score_codex":0.0000015337653,"about_ca_topic_score_gemma":0.000004240823,"teacher_disagreement_score":0.24736102,"about_ca_system_score_codex":0.000024329926,"about_ca_system_score_gemma":0.000049147322,"threshold_uncertainty_score":0.99984},"labels":[],"label_agreement":null},{"id":"W2033949361","doi":"10.1016/j.jcta.2012.07.010","title":"Subsets of products of finite sets of positive upper density","year":2012,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Sequence (biology); Combinatorics; Mathematics; Physics; Chemistry","score_opus":0.018095933409191654,"score_gpt":0.2742560461828031,"score_spread":0.25616011277361145,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2033949361","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99406016,0.00046838465,0.000078488,0.000048187212,0.0040020477,0.00015863204,0.00002998604,0.00000562571,0.0011485195],"genre_scores_gemma":[0.99752253,0.000046875237,0.0019740278,0.000012333013,0.0003648879,6.414718e-7,0.0000010173542,0.000022385442,0.00005532343],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977373,0.00049214077,0.0009612074,0.000088341374,0.0004895162,0.00023149305],"domain_scores_gemma":[0.99563557,0.0011612343,0.0016656088,0.00034841575,0.0010943527,0.00009483388],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024291852,0.00018582332,0.0007986517,0.00016704666,0.000070107206,0.000005824506,0.0003229683,0.00013885381,0.00007501008],"category_scores_gemma":[0.0021090813,0.00013768328,0.00027271497,0.00022365029,0.0004187603,0.00039338286,0.00013395636,0.00026490906,3.49527e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002655289,0.00038714625,0.0028666975,0.00028462618,0.00034325957,0.00000463354,0.0066042305,0.0000016837105,0.006803037,0.9795683,0.00024757985,0.00023349226],"study_design_scores_gemma":[0.00078032236,0.0005046486,0.003279309,0.00016007252,0.00016155983,0.00006851311,0.00057921564,3.2074863e-7,0.23175663,0.76245874,0.00014860691,0.00010207494],"about_ca_topic_score_codex":0.0000019752827,"about_ca_topic_score_gemma":2.136264e-7,"teacher_disagreement_score":0.22495358,"about_ca_system_score_codex":0.000025322224,"about_ca_system_score_gemma":0.000090979265,"threshold_uncertainty_score":0.56145614},"labels":[],"label_agreement":null},{"id":"W2036786740","doi":"10.1002/jgt.20445","title":"On the minimum degree of minimal Ramsey graphs","year":2009,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Combinatorics; Mathematics; Bipartite graph; Degree (music); Discrete mathematics; Cograph; Graph; Pathwidth; Chordal graph; 1-planar graph; Line graph","score_opus":0.040269359185450715,"score_gpt":0.2881943755700647,"score_spread":0.247925016384614,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2036786740","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9839441,0.0005732601,0.00053987425,0.00053338817,0.00051758514,0.00014871295,0.000007481992,0.000015436035,0.013720124],"genre_scores_gemma":[0.99732804,0.00008215741,0.0015688525,0.00073674717,0.00013070965,9.600363e-7,2.207872e-7,0.000020664917,0.00013167124],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976686,0.00050369126,0.0008490773,0.00013417895,0.0005719902,0.000272463],"domain_scores_gemma":[0.9952603,0.002897571,0.0009821497,0.00051552604,0.00024016293,0.000104265644],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002971503,0.00023658662,0.00050616346,0.00040675575,0.00020403195,0.000022415907,0.00078389386,0.00013616128,0.0002045043],"category_scores_gemma":[0.0012013407,0.00012628017,0.0007087154,0.0003555746,0.00037301306,0.000103821876,0.000042120915,0.00054139964,0.0000016319416],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00086148846,0.00018842297,0.000104469116,0.0000191229,0.00018777675,0.000025385149,0.0012164918,0.0000026109778,0.0013813736,0.98565215,0.0053313314,0.0050294017],"study_design_scores_gemma":[0.0006143682,0.0009851656,0.002660909,0.00014104942,0.00013453307,0.00012287051,0.0005901766,0.0000025512659,0.0031691133,0.9912556,0.0001823205,0.00014138312],"about_ca_topic_score_codex":3.2847583e-7,"about_ca_topic_score_gemma":4.5845476e-7,"teacher_disagreement_score":0.013588453,"about_ca_system_score_codex":0.0000142580275,"about_ca_system_score_gemma":0.000040256273,"threshold_uncertainty_score":0.5149556},"labels":[],"label_agreement":null},{"id":"W2037348464","doi":"10.4153/cjm-2009-035-3","title":"Generalized Polynomials and Mild Mixing","year":2009,"lang":"en","type":"article","venue":"Canadian Journal of Mathematics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Mathematics; Invertible matrix; Mixing (physics); Conjecture; Iterated function; Integer (computer science); Combinatorics; Constant (computer programming); Set (abstract data type); Measure (data warehouse); Function (biology); Zero (linguistics); Discrete mathematics; Pure mathematics; Mathematical analysis","score_opus":0.03787753018992517,"score_gpt":0.2797262018427537,"score_spread":0.24184867165282853,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2037348464","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9940305,0.0011326027,0.00094667054,0.0006665214,0.00029319443,0.00010557627,0.0000073649726,0.000008933162,0.0028086756],"genre_scores_gemma":[0.9108727,0.000042981013,0.0881333,0.0004648388,0.00024725412,3.7094543e-7,2.7597096e-7,0.000019677,0.00021862969],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99890524,0.000047506986,0.00054587395,0.00007989494,0.00015499291,0.00026646082],"domain_scores_gemma":[0.99864995,0.00022284097,0.00034656838,0.00020581925,0.00011115145,0.00046363613],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006842098,0.00014770935,0.0003893064,0.0002519308,0.00021281895,0.00006750061,0.00023623084,0.00009416619,0.00008713995],"category_scores_gemma":[0.0006066451,0.00011429051,0.00011543323,0.00009370529,0.00008557134,0.00009787429,0.000010418144,0.00018987447,0.0000012102792],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009307157,0.000029286557,0.00032516697,0.0001000384,0.000097017124,0.00012358947,0.006450437,0.0000044805925,0.0005343559,0.9768978,0.0121867005,0.0032418657],"study_design_scores_gemma":[0.00052284106,0.00009448473,0.00048909395,0.00015928123,0.000088132816,0.00060268864,0.0004526812,0.000056330537,0.00076035113,0.99428064,0.002322824,0.00017066639],"about_ca_topic_score_codex":0.00005169367,"about_ca_topic_score_gemma":0.00042380727,"teacher_disagreement_score":0.08718663,"about_ca_system_score_codex":0.000047893158,"about_ca_system_score_gemma":0.0001899344,"threshold_uncertainty_score":0.46606317},"labels":[],"label_agreement":null},{"id":"W2037695996","doi":"10.1016/j.ejc.2006.05.009","title":"Product representations of polynomials","year":2006,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Combinatorics; Product (mathematics); Class (philosophy); Set (abstract data type); Value (mathematics); Discrete mathematics; Statistics; Geometry","score_opus":0.023255380985091462,"score_gpt":0.27947357936633116,"score_spread":0.2562181983812397,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2037695996","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9230574,0.00055640884,0.001634137,0.00016568348,0.001257783,0.000089178415,0.000003996827,0.000016758851,0.073218696],"genre_scores_gemma":[0.9963186,0.000022421513,0.002579741,0.000012801988,0.00030228402,1.4010692e-7,4.8065516e-7,0.0000258901,0.00073768466],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983441,0.00040265944,0.0007553726,0.00008215116,0.00029827718,0.00011744084],"domain_scores_gemma":[0.9982564,0.0002381536,0.00082606764,0.00029145073,0.00034198252,0.000045987766],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013348527,0.00009723339,0.00025707678,0.00014791892,0.00008839622,0.000016287551,0.00032298284,0.00001344343,0.000028371882],"category_scores_gemma":[0.000562031,0.00007558174,0.00015308548,0.00020888576,0.00008136986,0.00009602102,0.000067612265,0.0001766739,0.0000019983192],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000033338692,0.00019196977,0.0031469623,0.000043607604,0.000052996023,0.00007380293,0.00039085062,0.000026148507,0.0015685934,0.9703263,0.023580847,0.00056457054],"study_design_scores_gemma":[0.00087292056,0.0001935241,0.017672498,0.00005289789,0.00008071252,0.00014347238,0.00008996034,0.0000025227,0.008785829,0.965344,0.006639499,0.0001221532],"about_ca_topic_score_codex":0.000001462641,"about_ca_topic_score_gemma":1.4641881e-7,"teacher_disagreement_score":0.0732612,"about_ca_system_score_codex":0.000017414655,"about_ca_system_score_gemma":0.000029277271,"threshold_uncertainty_score":0.30821338},"labels":[],"label_agreement":null},{"id":"W2037774402","doi":"10.1093/imrn/rnm007","title":"Sum-product Estimates in Finite Fields via Kloosterman Sums","year":2007,"lang":"en","type":"article","venue":"International Mathematics Research Notices","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":58,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; Hungarian Scientific Research Fund; National Science Foundation","keywords":"Kloosterman sum; Mathematics; Finite field; Product (mathematics); Pure mathematics; Discrete mathematics; Geometry","score_opus":0.1318274109231465,"score_gpt":0.45161490386466996,"score_spread":0.3197874929415234,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2037774402","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.91037935,0.00017203548,0.013852203,0.0010192859,0.0010112047,0.0005834776,0.00001718149,0.00011328951,0.072852],"genre_scores_gemma":[0.96974134,0.000025142379,0.02863556,0.000062060186,0.00031555284,0.000021560974,0.000009936639,0.000040331855,0.0011484964],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99681556,0.00010170897,0.00071654,0.0003781961,0.0013448879,0.0006430755],"domain_scores_gemma":[0.99174523,0.006977327,0.00017135187,0.0005570706,0.00042445716,0.00012454932],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005024167,0.00022185151,0.00030373264,0.000809053,0.00021668395,0.00015658016,0.0010810088,0.00013686894,0.0004700597],"category_scores_gemma":[0.0045146216,0.00018230102,0.00010212131,0.00037783055,0.0002796051,0.00029104206,0.00049554004,0.0006914683,0.000072710565],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017463835,0.00092012406,0.010320519,0.0007900071,0.00023925904,0.000313664,0.010968819,0.00023009638,0.0010916248,0.9634922,0.0017710598,0.009687964],"study_design_scores_gemma":[0.00042334292,0.00006201012,0.002839556,0.00024136732,0.000012146973,0.000024562487,0.00071815716,0.009214735,0.00510477,0.9801134,0.000996057,0.00024990397],"about_ca_topic_score_codex":0.00007773533,"about_ca_topic_score_gemma":0.00047226623,"teacher_disagreement_score":0.0717035,"about_ca_system_score_codex":0.00011339181,"about_ca_system_score_gemma":0.000035465688,"threshold_uncertainty_score":0.743402},"labels":[],"label_agreement":null},{"id":"W2040953949","doi":"10.1016/j.indag.2011.11.002","title":"Squares from blocks of consecutive integers: A problem of Erdős and Graham","year":2012,"lang":"en","type":"article","venue":"Indagationes Mathematicae","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Mathematics; Integer (computer science); Property (philosophy); Combinatorics; Construct (python library); Square (algebra); Product (mathematics); Square number; Discrete mathematics; Arithmetic; Computer science","score_opus":0.03327035439797041,"score_gpt":0.3003684734607686,"score_spread":0.26709811906279823,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2040953949","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98993886,0.00030383977,0.0047838707,0.00006436782,0.000075620796,0.0003747984,0.000071936716,0.00003706932,0.0043496285],"genre_scores_gemma":[0.95397884,0.000010288243,0.045835,0.000018662453,0.00004814772,0.000020102589,0.000005064212,0.000020551515,0.0000633244],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986924,0.00008769632,0.0006168715,0.00014137466,0.00026477524,0.00019688481],"domain_scores_gemma":[0.9974715,0.0014965134,0.00048134694,0.00031736802,0.00015804311,0.00007524257],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045305135,0.0001745291,0.00045641782,0.00011833856,0.00007839257,0.000010382496,0.00015774886,0.00011601751,0.00022158082],"category_scores_gemma":[0.00045174075,0.00013183623,0.00008866362,0.00014130735,0.00038384358,0.00015795093,0.00011902955,0.000114097355,0.0000022918784],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000036997873,0.00023356105,0.0048937867,0.00059572083,0.00020867467,5.15951e-7,0.046500113,6.89659e-7,0.0020676486,0.9440763,0.00035920378,0.0010268148],"study_design_scores_gemma":[0.0003423151,0.000051918974,0.0016863862,0.00032174977,0.00012147406,0.000010800126,0.0035225484,0.00006480708,0.025273899,0.9683946,0.00006368433,0.00014584615],"about_ca_topic_score_codex":0.000022647215,"about_ca_topic_score_gemma":0.000004019825,"teacher_disagreement_score":0.042977564,"about_ca_system_score_codex":0.000011783364,"about_ca_system_score_gemma":0.000021055963,"threshold_uncertainty_score":0.53761256},"labels":[],"label_agreement":null},{"id":"W2042502099","doi":"10.1017/s0963548308009097","title":"On the Maximum Degree of a Random Planar Graph","year":2008,"lang":"en","type":"article","venue":"Combinatorics Probability Computing","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":36,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Combinatorics; Mathematics; Planar graph; Random regular graph; Degree (music); Random graph; Vertex (graph theory); Graph; Discrete mathematics; Planar; 1-planar graph; Outerplanar graph; Independent set; Chordal graph; Pathwidth; Line graph; Computer science; Physics","score_opus":0.07886002661000079,"score_gpt":0.270923936666516,"score_spread":0.19206391005651519,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2042502099","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9865431,0.00008749656,0.004851475,0.00014265247,0.000564273,0.000605008,0.0000042911356,0.000109815664,0.0070918687],"genre_scores_gemma":[0.99776316,0.000006876902,0.0020571207,0.000085492626,0.000034996912,0.0000063705174,0.0000011406847,0.000022365408,0.000022504679],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99798876,0.00036101244,0.00056379795,0.00032094738,0.0004453437,0.00032016542],"domain_scores_gemma":[0.9943497,0.00420139,0.00030123763,0.0008880423,0.00019271376,0.00006687265],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015943933,0.00023054259,0.00044009712,0.00008736229,0.0007307311,0.000012316249,0.0006148842,0.000114745075,0.000018893263],"category_scores_gemma":[0.0021662484,0.00014936994,0.00024259252,0.00044638602,0.0004207324,0.000036514997,0.00020095498,0.00040762933,0.0000022734584],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007669261,0.00022476351,0.0032513652,0.00011772513,0.000048108268,0.000006051359,0.0017650184,0.00002873223,0.000016540615,0.9932721,0.00069096487,0.0005019391],"study_design_scores_gemma":[0.0010062448,0.00012402226,0.0018435965,0.00005529795,0.000020691077,0.000022958795,0.000058695663,0.0003711779,0.00049481017,0.99578995,0.00004851571,0.00016406806],"about_ca_topic_score_codex":0.000009501488,"about_ca_topic_score_gemma":0.0000012413486,"teacher_disagreement_score":0.011220012,"about_ca_system_score_codex":0.000054511296,"about_ca_system_score_gemma":0.000045910212,"threshold_uncertainty_score":0.609113},"labels":[],"label_agreement":null},{"id":"W2043437898","doi":"10.1016/j.ffa.2013.09.005","title":"A note on the real densities of homogeneous systems in function fields","year":2013,"lang":"en","type":"article","venue":"Finite Fields and Their Applications","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of Waterloo; National Natural Science Foundation of China","keywords":"Mathematics; Homogeneous; Formal power series; Series (stratigraphy); Power series; Field (mathematics); Finite field; Homogeneous function; Function (biology); Pure mathematics; Discrete mathematics; Mathematical analysis; Combinatorics","score_opus":0.021416204091962262,"score_gpt":0.24281830313070668,"score_spread":0.22140209903874442,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2043437898","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9424942,0.0002483302,0.036420677,0.00077332184,0.00014082479,0.0010163836,0.000037408776,0.000042968564,0.018825892],"genre_scores_gemma":[0.99901736,0.000082784594,0.000114228664,0.0001598097,0.00006705236,0.00030369588,0.0000033320298,0.0000073534616,0.0002444035],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995132,0.00004217298,0.0001857289,0.000108178276,0.000056286393,0.00009443843],"domain_scores_gemma":[0.9983921,0.0011584421,0.00007062319,0.00031430207,0.000044176653,0.000020366973],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012420968,0.00008541995,0.00012746631,0.000050457365,0.00013481617,0.000020987658,0.000101745536,0.00011101843,0.00004756685],"category_scores_gemma":[0.000033598957,0.000049283353,0.000038904815,0.00009248674,0.0000586919,0.000023042505,0.00003848105,0.00014188452,0.0000039891206],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009733665,0.000029457038,0.00012655911,0.000045049896,0.000018189126,1.5713118e-7,0.0019682983,0.000052279185,0.00009687549,0.99245346,0.0005080602,0.004691866],"study_design_scores_gemma":[0.00011983402,0.00009146157,0.0013538476,0.000040668674,0.000013522933,0.0000035901237,0.0011712282,0.0021899077,0.00029385884,0.9926134,0.0020083818,0.00010030055],"about_ca_topic_score_codex":0.00021818238,"about_ca_topic_score_gemma":0.00006434548,"teacher_disagreement_score":0.056523144,"about_ca_system_score_codex":0.0000048578922,"about_ca_system_score_gemma":0.0000072645335,"threshold_uncertainty_score":0.20097168},"labels":[],"label_agreement":null},{"id":"W2043514463","doi":"10.1016/j.aam.2005.03.006","title":"Counting unrooted maps on the plane","year":2005,"lang":"en","type":"article","venue":"Advances in Applied Mathematics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Mathematics; Planar graph; Combinatorics; Embedding; Dual polyhedron; Planar; Plane (geometry); Separable space; Geometry; Graph; Mathematical analysis","score_opus":0.01954950902446868,"score_gpt":0.2824597931664688,"score_spread":0.26291028414200013,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2043514463","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2712713,0.00082500605,0.009016029,0.0009576544,0.0005070541,0.00168583,0.00003740383,0.0004347618,0.715265],"genre_scores_gemma":[0.89620614,0.00012892016,0.102385625,0.00065388106,0.00022672773,0.00008645606,0.0000045123465,0.0000568676,0.00025084603],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984226,0.00002660537,0.0005256039,0.0002539444,0.0003936045,0.00037760285],"domain_scores_gemma":[0.9962564,0.0027809662,0.00025351744,0.0006464149,0.000021421838,0.000041259307],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00075025513,0.0002663716,0.00033521687,0.0000970815,0.00024257487,0.000034008226,0.0004922306,0.0001054006,0.00011991069],"category_scores_gemma":[0.00039175097,0.00016727345,0.000062788065,0.00025253152,0.00015536991,0.00008769919,0.00011409986,0.00039047594,0.000059489055],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018259087,0.00011107468,0.000033891014,0.00013323034,0.00001113754,0.0000024023284,0.0014408978,0.00015159167,0.00008508096,0.99097854,0.0006872076,0.0063466607],"study_design_scores_gemma":[0.0003446234,0.000018007817,0.000015659616,0.00010551609,0.000015840647,0.000009113137,0.0007239286,0.00048570597,0.0017851894,0.9696849,0.026585154,0.00022637151],"about_ca_topic_score_codex":4.4449905e-7,"about_ca_topic_score_gemma":0.000021908822,"teacher_disagreement_score":0.7150141,"about_ca_system_score_codex":0.000059242888,"about_ca_system_score_gemma":0.000011890682,"threshold_uncertainty_score":0.68212134},"labels":[],"label_agreement":null},{"id":"W2044637983","doi":"10.1006/jcta.1999.3007","title":"Independent Arithmetic Progressions in Clique-Free Graphs on the Natural Numbers","year":2001,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Van der Waerden's theorem; Generalization; Mathematics; Clique; Combinatorics; Independent set; Graph; Set (abstract data type); Natural number; Arithmetic progression; Discrete mathematics; Arithmetic; Computer science","score_opus":0.017421382214355567,"score_gpt":0.2850047353484325,"score_spread":0.26758335313407694,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2044637983","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98486143,0.00029184218,0.000019055315,0.001357543,0.007191181,0.0003108384,0.0000030681858,0.000026223814,0.005938824],"genre_scores_gemma":[0.99857163,0.00012210454,0.00038491367,0.00019634042,0.0004058664,0.000009879201,3.398505e-7,0.000030758423,0.00027817753],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972751,0.00081603427,0.0007372222,0.00015448526,0.00068224914,0.00033488864],"domain_scores_gemma":[0.9967666,0.0017704712,0.0005835709,0.0005687356,0.00020611449,0.0001044639],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028798804,0.0002496356,0.00044840405,0.00024366505,0.00030797214,0.000078186764,0.00097295566,0.00016016216,0.00016399026],"category_scores_gemma":[0.0022209527,0.00013899815,0.00030179985,0.00041181827,0.00031503293,0.00026211003,0.00020398373,0.001153523,0.0000014240951],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0020092032,0.00022329223,0.0008218987,0.000013831482,0.000102889295,0.00016437465,0.0014930214,0.0000026695802,0.0000440639,0.9932311,0.0012798292,0.0006137829],"study_design_scores_gemma":[0.0016507872,0.00048689893,0.0007626392,0.00019675755,0.000044998127,0.0003757756,0.0014242309,0.0000021737058,0.00039203418,0.99191695,0.0025759637,0.000170781],"about_ca_topic_score_codex":0.0000024816031,"about_ca_topic_score_gemma":0.000009085907,"teacher_disagreement_score":0.013710196,"about_ca_system_score_codex":0.00008319803,"about_ca_system_score_gemma":0.00008366091,"threshold_uncertainty_score":0.566818},"labels":[],"label_agreement":null},{"id":"W2044674112","doi":"10.1007/s11590-006-0001-x","title":"A counterexample to the dominating set conjecture","year":2006,"lang":"en","type":"article","venue":"Optimization Letters","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Conjecture; Combinatorics; Counterexample; Mathematics; Polytope; Vertex (graph theory); Polyhedron; Convex polytope; Discrete mathematics; Regular polygon; Graph; Convex set; Geometry","score_opus":0.016348271983206406,"score_gpt":0.2627674421359366,"score_spread":0.2464191701527302,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2044674112","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20108062,0.000020701951,0.78197396,0.012340152,0.00044981515,0.00047280677,0.000032795175,0.00012752404,0.0035016232],"genre_scores_gemma":[0.8792127,0.0000012671261,0.109492116,0.010389001,0.00042458906,0.000031931697,0.000032713386,0.00003835836,0.0003773368],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992338,0.000070659364,0.00018979845,0.00015953973,0.00017165368,0.00017455261],"domain_scores_gemma":[0.99933416,0.0002426806,0.00008595595,0.00027387874,0.000037798058,0.00002550779],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023542787,0.00011742257,0.00011040625,0.00005492792,0.00032228103,0.000072528615,0.00019521973,0.000042105716,0.00020385657],"category_scores_gemma":[0.00008784896,0.00007646812,0.000050441537,0.00017940908,0.000043058288,0.000059784772,0.000057281333,0.00009529805,0.000005918879],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018428385,0.000015118307,0.00022325481,0.000023135628,0.000026684776,0.0000050343415,0.0018139724,0.65032,0.0004809477,0.17274484,0.1740695,0.00025908192],"study_design_scores_gemma":[0.0067480234,0.0003125441,0.0035388218,0.00039618908,0.0005399094,0.00032690514,0.0031520887,0.34243917,0.0058549135,0.35374764,0.27914345,0.0038003149],"about_ca_topic_score_codex":0.000026777825,"about_ca_topic_score_gemma":0.00001546198,"teacher_disagreement_score":0.67813206,"about_ca_system_score_codex":0.000027998865,"about_ca_system_score_gemma":0.0000057198768,"threshold_uncertainty_score":0.31182796},"labels":[],"label_agreement":null},{"id":"W2046240182","doi":"10.1017/s0963548314000169","title":"The First<i>k</i>-Regular Subgraph is Large","year":2014,"lang":"en","type":"article","venue":"Combinatorics Probability Computing","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; University of New Brunswick","funders":"","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Graph; Integer (computer science); Discrete mathematics; Computer science","score_opus":0.01952974264315668,"score_gpt":0.26406210588842854,"score_spread":0.24453236324527186,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2046240182","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9681852,0.0005320336,0.01874886,0.001433661,0.0024636283,0.0007967008,0.000005144348,0.00047219553,0.0073626125],"genre_scores_gemma":[0.997595,0.000011927829,0.001693585,0.00040645406,0.00013922504,0.000009064489,0.0000013133591,0.000038905666,0.00010448263],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997443,0.00029841936,0.00059239165,0.00050208677,0.00047395163,0.00069015275],"domain_scores_gemma":[0.9955146,0.0024385878,0.00026640997,0.0013906959,0.00027071065,0.00011905274],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.003963622,0.00029849308,0.0003664803,0.00005520151,0.0026391058,0.00013682665,0.00093281694,0.00016257835,0.0000137045445],"category_scores_gemma":[0.0017336477,0.00020875754,0.00026336528,0.0004734307,0.00026209975,0.00007578986,0.0007289639,0.00044801476,0.000008139883],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008195186,0.00011608601,0.010644002,0.00013279075,0.000035189056,6.231832e-7,0.0010209061,0.000004369986,0.0000020821317,0.9825617,0.0033389193,0.0021351422],"study_design_scores_gemma":[0.0004874914,0.000058889327,0.0019481583,0.000032830394,0.000025741483,0.000005092199,0.00003897196,0.0043254322,0.00020149545,0.93886656,0.053754583,0.0002547582],"about_ca_topic_score_codex":0.000004300218,"about_ca_topic_score_gemma":0.000008084166,"teacher_disagreement_score":0.050415665,"about_ca_system_score_codex":0.00008637063,"about_ca_system_score_gemma":0.000026264916,"threshold_uncertainty_score":0.9986593},"labels":[],"label_agreement":null},{"id":"W2046546000","doi":"10.1016/j.disc.2012.01.028","title":"Two results on the digraph chromatic number","year":2012,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":37,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Fonds Québécois de la Recherche sur la Nature et les Technologies","keywords":"Mathematics; Combinatorics; Digraph; Girth (graph theory); Chromatic scale; Integer (computer science); Discrete mathematics; Graph; Computer science","score_opus":0.043220335193595145,"score_gpt":0.32276929236353363,"score_spread":0.2795489571699385,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2046546000","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6701391,0.000057478075,0.0010587068,0.0005962798,0.0005451947,0.0006303856,0.000060866605,0.000222291,0.3266897],"genre_scores_gemma":[0.9824758,0.000011252429,0.015364068,0.00038748953,0.00036003627,0.000052146188,0.00000772124,0.00007545112,0.0012659979],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977487,0.00016864942,0.00065521814,0.00022192065,0.00058379624,0.00062174135],"domain_scores_gemma":[0.99554086,0.0025959304,0.00033987837,0.001314255,0.000050637133,0.00015842372],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014557906,0.00036306115,0.00039729715,0.000063703155,0.0004986005,0.00007608496,0.0005631874,0.000104859864,0.00040803527],"category_scores_gemma":[0.0014122218,0.00019515409,0.00027047045,0.0002707393,0.00022936358,0.00014945702,0.0001928493,0.0003363626,0.00028692678],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018759809,0.00014255842,0.00018008544,0.00012094263,0.00009330907,0.0000018821562,0.007745728,8.0535796e-7,0.000043708515,0.9837901,0.0077593653,0.000102768514],"study_design_scores_gemma":[0.0005266566,0.00003506179,0.00025205206,0.00018548862,0.00012053634,0.00004436766,0.0024990083,0.00025824615,0.0011490649,0.9926099,0.001962574,0.0003570527],"about_ca_topic_score_codex":0.00000446222,"about_ca_topic_score_gemma":0.0000026760904,"teacher_disagreement_score":0.32542372,"about_ca_system_score_codex":0.000047698548,"about_ca_system_score_gemma":0.000011671548,"threshold_uncertainty_score":0.7958153},"labels":[],"label_agreement":null},{"id":"W2046903283","doi":"10.1007/s00605-007-0471-7","title":"Geometric progressions in sumsets over finite fields","year":2007,"lang":"de","type":"article","venue":"Monatshefte für Mathematik","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Invertible matrix; Combinatorics; Mathematics; Finite field; Field (mathematics); Algebraic number; Matrix (chemical analysis); Physics; Discrete mathematics; Pure mathematics; Mathematical analysis; Chemistry","score_opus":0.024031980780758373,"score_gpt":0.32958903416489727,"score_spread":0.3055570533841389,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2046903283","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.91448456,0.019753613,0.015175365,0.00055124745,0.0050529297,0.002734228,0.00019587779,0.00044439943,0.04160779],"genre_scores_gemma":[0.9841275,0.0006517158,0.010025381,0.000425977,0.00069546624,0.000060970015,0.00003377238,0.00018352077,0.0037957],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9941619,0.00021878268,0.0019382571,0.00090540084,0.0011848544,0.0015907856],"domain_scores_gemma":[0.9929823,0.0041315104,0.00075775804,0.0015598646,0.00016530571,0.0004032398],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0032665825,0.0008678878,0.0011850256,0.0019002251,0.00049937726,0.0001643457,0.0010493115,0.0010208919,0.0025565191],"category_scores_gemma":[0.0024693178,0.0007352336,0.0005231347,0.0024325578,0.00031790833,0.00029226491,0.00077720004,0.0014790357,0.00035237736],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007164989,0.004834206,0.029669547,0.0057937955,0.0012453943,0.002544121,0.037209295,0.00019521803,0.00016886434,0.78596216,0.04342638,0.0882345],"study_design_scores_gemma":[0.0028363306,0.00032186843,0.022911841,0.00182427,0.00039159082,0.000054923305,0.0010137553,0.002406538,0.001347014,0.93321556,0.03186205,0.0018142544],"about_ca_topic_score_codex":0.00003901328,"about_ca_topic_score_gemma":0.00008548908,"teacher_disagreement_score":0.14725338,"about_ca_system_score_codex":0.00021532748,"about_ca_system_score_gemma":0.00009436504,"threshold_uncertainty_score":0.9995099},"labels":[],"label_agreement":null},{"id":"W2047567341","doi":"10.1016/s0012-365x(99)00370-2","title":"Bipartite Ramsey numbers and Zarankiewicz numbers","year":2000,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":31,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"","keywords":"Mathematics; Ramsey's theorem; Combinatorics; Bipartite graph; Discrete mathematics; Ramsey theory; Graph","score_opus":0.020216719679944057,"score_gpt":0.2899892336094061,"score_spread":0.26977251392946205,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2047567341","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8558282,0.00020174589,0.0010025526,0.0001769275,0.00016739633,0.00039899698,0.00003160016,0.00024096298,0.14195159],"genre_scores_gemma":[0.927148,0.00028481972,0.062077906,0.0003699047,0.00018187973,0.000038249113,0.000011555601,0.00012896917,0.009758736],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982098,0.00007324766,0.000534366,0.0003448439,0.00037369927,0.00046409102],"domain_scores_gemma":[0.9985194,0.00041116774,0.0001512606,0.00068963843,0.000039556908,0.0001889711],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00043967285,0.00034878473,0.00048715697,0.00007076859,0.0003456749,0.00010315258,0.00030740723,0.00016491409,0.0019098892],"category_scores_gemma":[0.00017434036,0.00027251692,0.00016670283,0.00020950344,0.00031179967,0.000172742,0.00010184939,0.00024532323,0.000093101014],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000048687718,0.00012840005,0.0008523222,0.00063746434,0.00022742822,0.0000278731,0.015954753,0.000010061019,0.00009754755,0.96835476,0.0062776213,0.0073830658],"study_design_scores_gemma":[0.00062987435,0.0000473339,0.00022748655,0.00015584019,0.00013135448,0.00011065108,0.00085717655,0.0007167815,0.00023372746,0.9855864,0.010800743,0.0005026191],"about_ca_topic_score_codex":0.000014669151,"about_ca_topic_score_gemma":0.000014368151,"teacher_disagreement_score":0.13219287,"about_ca_system_score_codex":0.000023001505,"about_ca_system_score_gemma":0.000015916428,"threshold_uncertainty_score":0.9999727},"labels":[],"label_agreement":null},{"id":"W2047917450","doi":"10.1016/j.aim.2014.10.009","title":"Polynomial-time perfect matchings in dense hypergraphs","year":2014,"lang":"en","type":"article","venue":"Advances in Mathematics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":29,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"European Research Council; Engineering and Physical Sciences Research Council","keywords":"Mathematics; Combinatorics; Hypergraph; Matching (statistics); Time complexity; Discrete mathematics; Perfect power; Graph; Lattice (music)","score_opus":0.008178733419701174,"score_gpt":0.27233595694427837,"score_spread":0.2641572235245772,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2047917450","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96173275,0.00067218876,0.0016154078,0.00007289142,0.00032324967,0.00039398175,0.000005091851,0.00013146046,0.035053007],"genre_scores_gemma":[0.9153672,0.0003088146,0.08336942,0.0001420923,0.0001044876,0.000039306255,0.000002213405,0.00007511476,0.00059138343],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979764,0.00016694563,0.00071640406,0.00034688402,0.00031231818,0.00048100488],"domain_scores_gemma":[0.9972043,0.0018164344,0.00022946094,0.0006422195,0.000033305354,0.00007428591],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012473649,0.0003215853,0.00062801765,0.0003346753,0.00011278716,0.00003343032,0.00047290188,0.00015171325,0.0001443875],"category_scores_gemma":[0.0011574993,0.00026824194,0.00013468767,0.00039652284,0.00016152584,0.0003194414,0.00015379651,0.00035361323,0.000042433418],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000104620594,0.00075991225,0.009953558,0.0016051979,0.000050075727,0.000053238266,0.013706769,0.00038656546,0.0019059754,0.9461632,0.0016100177,0.023700878],"study_design_scores_gemma":[0.0007367897,0.000057566805,0.0003934458,0.00028173652,0.000020362722,0.0000388272,0.00030424522,0.0033025898,0.00046987564,0.9904719,0.0035374437,0.00038520273],"about_ca_topic_score_codex":0.0000062941563,"about_ca_topic_score_gemma":0.000041981508,"teacher_disagreement_score":0.08175401,"about_ca_system_score_codex":0.000058734637,"about_ca_system_score_gemma":0.00001540085,"threshold_uncertainty_score":0.999977},"labels":[],"label_agreement":null},{"id":"W2047936368","doi":"10.1016/j.ejc.2007.02.010","title":"Fractional coloring and the odd Hadwiger’s conjecture","year":2007,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Mathematics; Conjecture; Combinatorics; Pure mathematics","score_opus":0.020669284174452397,"score_gpt":0.270061181899496,"score_spread":0.2493918977250436,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2047936368","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9292872,0.0013317966,0.01848447,0.00069444894,0.0030016976,0.00012643343,0.0000013185836,0.00002573186,0.047046892],"genre_scores_gemma":[0.9982806,0.00009416731,0.00079271046,0.00019987865,0.00036108372,1.140317e-7,1.209062e-7,0.00002390027,0.00024745477],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986056,0.0003391148,0.00047199233,0.00007663449,0.0003419783,0.00016464414],"domain_scores_gemma":[0.9977492,0.0013510964,0.00046883052,0.00015821258,0.00017831016,0.00009435016],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0046906644,0.000120305966,0.00022872661,0.000091469956,0.0002988546,0.000047790054,0.00027383622,0.000029458948,0.000025170846],"category_scores_gemma":[0.00070687593,0.000069153335,0.00011563557,0.00012859264,0.00020385739,0.00009240193,0.000095759555,0.0005533112,0.0000017405404],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021084755,0.000029109555,0.00068900146,0.000014016272,0.00007591024,0.00017315855,0.0010757482,0.0000039719434,0.00002065381,0.9945107,0.0020575004,0.0011393981],"study_design_scores_gemma":[0.0031009114,0.00017298386,0.0073444587,0.000041722335,0.00007710949,0.00088538567,0.00034696748,0.000010347296,0.00017197223,0.9499865,0.037736535,0.00012509062],"about_ca_topic_score_codex":2.730783e-7,"about_ca_topic_score_gemma":2.1897908e-7,"teacher_disagreement_score":0.06899336,"about_ca_system_score_codex":0.000027913482,"about_ca_system_score_gemma":0.000019545605,"threshold_uncertainty_score":0.28199914},"labels":[],"label_agreement":null},{"id":"W2048001701","doi":"10.4153/cjm-2012-003-8","title":"Optimal Polynomial Recurrence","year":2012,"lang":"en","type":"article","venue":"Canadian Journal of Mathematics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"National Science Foundation","keywords":"Mathematics; Interval (graph theory); Set (abstract data type); Fourier transform; Polynomial; Combinatorics; Fourier series; Natural (archaeology); Discrete mathematics; Applied mathematics; Mathematical analysis; Computer science","score_opus":0.0423736558303947,"score_gpt":0.2844206020243473,"score_spread":0.24204694619395262,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2048001701","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98671514,0.0008830854,0.0032813416,0.0001313792,0.0018262644,0.00010092715,0.000015635958,0.00000959786,0.0070366017],"genre_scores_gemma":[0.9106386,0.000009819122,0.08837798,0.00006899257,0.0006887952,8.857736e-7,3.3740187e-7,0.000025887708,0.00018875836],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99868613,0.000051479394,0.00053400756,0.000058494712,0.00021310846,0.00045679582],"domain_scores_gemma":[0.99809927,0.00032689827,0.00039571064,0.00025160424,0.00014476416,0.0007817373],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010344686,0.00015060365,0.00032703014,0.00022890787,0.00020078989,0.0000380891,0.00039038577,0.00010186717,0.00033042266],"category_scores_gemma":[0.0010945095,0.000116976116,0.00016222523,0.00012742639,0.00013393357,0.00022172126,0.00002335678,0.00030442807,0.000013091888],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017311417,0.00017106225,0.008190529,0.00032002822,0.0002568089,0.00009669026,0.03140842,0.000019670424,0.00009751059,0.8602086,0.09536487,0.0038485392],"study_design_scores_gemma":[0.0022208642,0.00055019226,0.0044087674,0.0011309328,0.00077218056,0.00801627,0.010615141,0.00028597354,0.004075331,0.82415664,0.14205961,0.0017081036],"about_ca_topic_score_codex":0.00004257903,"about_ca_topic_score_gemma":0.00021036464,"teacher_disagreement_score":0.085096635,"about_ca_system_score_codex":0.00009017196,"about_ca_system_score_gemma":0.00032735622,"threshold_uncertainty_score":0.47701475},"labels":[],"label_agreement":null},{"id":"W2049622061","doi":"10.1016/j.disc.2007.08.006","title":"Small maximally disjoint union-free families","year":2007,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Mathematics; Disjoint sets; Disjoint union (topology); Combinatorics; Discrete mathematics","score_opus":0.03713383757873842,"score_gpt":0.27907554878819735,"score_spread":0.24194171120945893,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2049622061","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.54003364,0.00016800307,0.25211558,0.00035069784,0.000711933,0.00075416284,0.00007556316,0.000576396,0.20521407],"genre_scores_gemma":[0.6017075,0.00008587816,0.395448,0.00023951937,0.0003059481,0.000019795129,0.000017745253,0.00015618966,0.0020194023],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976244,0.00006573355,0.0008208081,0.00034501843,0.0004980915,0.00064592354],"domain_scores_gemma":[0.99687076,0.0010158155,0.0002996723,0.0015013214,0.00011964287,0.00019280496],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0018005156,0.00040622713,0.0005170708,0.00023109795,0.00034364106,0.000074303534,0.0009051026,0.00019575184,0.00016199242],"category_scores_gemma":[0.0012345416,0.0003044025,0.0002798412,0.00031085234,0.00027198612,0.00010548593,0.0005896543,0.00031837114,0.000029177228],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020663909,0.000108357635,0.0002327565,0.0003847068,0.00008848579,0.000030060091,0.005484945,0.000002297112,0.00019422773,0.98992306,0.0010478185,0.0024825928],"study_design_scores_gemma":[0.00054239016,0.00007091985,0.000561655,0.00012932644,0.0000967345,0.000049957824,0.003977159,0.00022098862,0.0015911795,0.9897961,0.0025105837,0.0004530326],"about_ca_topic_score_codex":0.000011445454,"about_ca_topic_score_gemma":0.00009515085,"teacher_disagreement_score":0.20319466,"about_ca_system_score_codex":0.00005516352,"about_ca_system_score_gemma":0.00002643611,"threshold_uncertainty_score":0.9999408},"labels":[],"label_agreement":null},{"id":"W2051389005","doi":"10.1016/j.disc.2012.05.011","title":"A class of graphs with depression three","year":2012,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Enhanced Data Rates for GSM Evolution; Graph; Discrete mathematics; Integer (computer science); Path (computing); Class (philosophy); Degree (music); Physics; Computer science","score_opus":0.027368966003536815,"score_gpt":0.28358906149630747,"score_spread":0.25622009549277064,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2051389005","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9453147,0.00024711524,0.025353016,0.000020753023,0.0001443157,0.0003534022,0.00001860247,0.00009419023,0.028453927],"genre_scores_gemma":[0.92154133,0.00000610929,0.07820936,0.00002123425,0.000051476436,0.00001784283,0.0000029148512,0.000047949852,0.000101756494],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986578,0.000036928388,0.0003958057,0.00014417112,0.00040562113,0.00035967323],"domain_scores_gemma":[0.9984325,0.00039211087,0.0003105,0.0006762681,0.00006989608,0.00011869714],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042219152,0.0002269012,0.00039732226,0.00009673623,0.00013213827,0.000013307898,0.0002787529,0.0001087394,0.000104486],"category_scores_gemma":[0.00016268942,0.00013549294,0.00013435399,0.00019590397,0.000188763,0.00015462702,0.00014069362,0.00015578211,0.000004509702],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030355495,0.00014365857,0.015778603,0.0004780585,0.00010062224,0.0000013692081,0.0039660693,0.0000016327955,0.00030332347,0.97853446,0.00028063302,0.00038122846],"study_design_scores_gemma":[0.00042738437,0.00006876895,0.0021027422,0.00024375731,0.0001709024,0.000040532694,0.0007348351,0.00026487876,0.0045151925,0.9909864,0.00018025421,0.00026432972],"about_ca_topic_score_codex":0.0000028275715,"about_ca_topic_score_gemma":0.000007274779,"teacher_disagreement_score":0.05285635,"about_ca_system_score_codex":0.000011420388,"about_ca_system_score_gemma":0.000011648252,"threshold_uncertainty_score":0.5525242},"labels":[],"label_agreement":null},{"id":"W2051763890","doi":"10.1007/s00012-005-1906-4","title":"Which posets have a scattered MacNeille completion?","year":2005,"lang":"en","type":"article","venue":"Algebra Universalis","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Mathematics; Partially ordered set; Combinatorics; Pairwise comparison; Star product; Order (exchange); Bracket; Statistics","score_opus":0.023109000545497662,"score_gpt":0.2762324781545813,"score_spread":0.25312347760908366,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2051763890","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8865097,0.000066761815,0.0009030406,0.002991703,0.00024628596,0.00027176336,0.00006771853,0.00025561915,0.1086874],"genre_scores_gemma":[0.9902946,0.000014591404,0.0062456625,0.00064378156,0.0002008245,0.000002789455,0.000026751175,0.00003496503,0.0025360652],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988689,0.000092184746,0.00021837848,0.00027338887,0.00024407996,0.00030307745],"domain_scores_gemma":[0.99895287,0.00019781901,0.000102515056,0.0005087482,0.0001275567,0.00011049924],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00016885003,0.00019126308,0.00023620948,0.00014368146,0.00030009702,0.00003596567,0.00034971838,0.00010983894,0.0012495316],"category_scores_gemma":[0.00008202266,0.00017389905,0.00010921709,0.00019544993,0.00010060606,0.00019587061,0.00015589445,0.00016967446,0.00006571405],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000035307985,0.00006911827,0.00086460786,0.000021767217,0.000105415456,0.000008794429,0.0027188265,0.000006786245,0.0002760677,0.95578957,0.038741153,0.0013625708],"study_design_scores_gemma":[0.0040459456,0.00020351687,0.01040288,0.000119029464,0.000324824,0.00016600343,0.002572139,0.0014115593,0.0060500856,0.7675328,0.20574348,0.0014277132],"about_ca_topic_score_codex":0.00005937489,"about_ca_topic_score_gemma":0.0002884668,"teacher_disagreement_score":0.18825677,"about_ca_system_score_codex":0.00007490452,"about_ca_system_score_gemma":0.000024076433,"threshold_uncertainty_score":0.9996635},"labels":[],"label_agreement":null},{"id":"W2052325621","doi":"10.1016/j.aim.2005.04.011","title":"On the Turán number for the hexagon","year":2005,"lang":"en","type":"article","venue":"Advances in Mathematics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":51,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Combinatorics; Conjecture; Counterexample; Upper and lower bounds; Bipartite graph; Graph; Vertex (graph theory); Quadrilateral; Discrete mathematics","score_opus":0.02735860851489594,"score_gpt":0.33866687607038337,"score_spread":0.3113082675554874,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2052325621","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49815646,0.006922334,0.13402352,0.016709724,0.0035610443,0.0083071515,0.000107794556,0.00055455894,0.3316574],"genre_scores_gemma":[0.91113687,0.00056754105,0.08354784,0.0014511348,0.00046660355,0.00034747843,0.0000013868396,0.00007327631,0.0024078565],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988388,0.000050067436,0.00038273362,0.0001746248,0.00026063685,0.00029318134],"domain_scores_gemma":[0.9895342,0.009539588,0.00016861598,0.0006889586,0.00004312989,0.000025495478],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008940641,0.00019747911,0.00022628608,0.000029628492,0.00034122315,0.000034782595,0.0005762931,0.000070547954,0.00028093136],"category_scores_gemma":[0.0013454033,0.0000905434,0.00012944796,0.00014668876,0.0001692111,0.00013369793,0.00008008836,0.00024627332,0.000032507574],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015020468,0.00008326603,0.000026505382,0.000081480364,0.00001781835,4.475322e-7,0.002096892,0.00020876288,0.000003943798,0.986506,0.0021860937,0.00877379],"study_design_scores_gemma":[0.00023640554,0.000020103607,0.000020888576,0.00007255877,0.000024933235,0.000008783016,0.00068483886,0.002804352,0.00026844064,0.9459547,0.049772378,0.00013163408],"about_ca_topic_score_codex":4.727699e-7,"about_ca_topic_score_gemma":0.000021750197,"teacher_disagreement_score":0.41298044,"about_ca_system_score_codex":0.00003733316,"about_ca_system_score_gemma":0.000010166976,"threshold_uncertainty_score":0.36922526},"labels":[],"label_agreement":null},{"id":"W2052356014","doi":"10.1090/s0273-0979-07-01189-5","title":"From harmonic analysis to arithmetic combinatorics","year":2007,"lang":"en","type":"article","venue":"Bulletin of the American Mathematical Society","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":28,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Arithmetic; Combinatorics; Algebra over a field; Pure mathematics","score_opus":0.016222295405804756,"score_gpt":0.28937754753456757,"score_spread":0.2731552521287628,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2052356014","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9369602,0.00003519746,0.055928223,0.002275204,0.00012590954,0.0003263068,0.000027692715,0.00007644913,0.004244815],"genre_scores_gemma":[0.89446163,0.0000065854656,0.10358663,0.0011717849,0.000076433265,0.000008474054,0.00000114595,0.00003214463,0.00065519725],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978792,0.00011737241,0.000633109,0.00031644217,0.0006384344,0.00041541443],"domain_scores_gemma":[0.9958329,0.0024300914,0.00046275416,0.000989654,0.000107055086,0.00017753744],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012794657,0.00023912109,0.0007825696,0.000058175276,0.0002244068,0.000022356628,0.00085024635,0.000076817094,0.00058139086],"category_scores_gemma":[0.00093560107,0.00015377608,0.00110568,0.0012774545,0.00063387223,0.0000084062485,0.00050764007,0.00028100325,0.000032165328],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000121808385,0.00094688067,0.0039456105,0.00019516055,0.0050132927,0.0000054508,0.011012333,0.000030506133,0.0010989852,0.900212,0.07476504,0.0026529378],"study_design_scores_gemma":[0.00021679541,0.00006777369,0.0091242725,0.000033104134,0.001103059,0.0000021439625,0.0015695662,0.00015299572,0.0021246893,0.98130715,0.00404196,0.00025649977],"about_ca_topic_score_codex":0.00013404718,"about_ca_topic_score_gemma":0.0000027757394,"teacher_disagreement_score":0.08109515,"about_ca_system_score_codex":0.00007607432,"about_ca_system_score_gemma":0.000015246171,"threshold_uncertainty_score":0.6365822},"labels":[],"label_agreement":null},{"id":"W2053523467","doi":"10.4153/cmb-2011-165-0","title":"Structure in Sets with Logarithmic Doubling","year":2011,"lang":"en","type":"article","venue":"Canadian Mathematical Bulletin","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Engineering and Physical Sciences Research Council","keywords":"Abelian group; Logarithm; Structured program theorem; Set (abstract data type); Finite set","score_opus":0.04215964605312174,"score_gpt":0.24550092556037176,"score_spread":0.20334127950725,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2053523467","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.90800256,0.000043577587,0.0005748799,0.00053529727,0.00009956463,0.00049658935,0.000035306253,0.00007810874,0.09013412],"genre_scores_gemma":[0.96797717,0.0000016139284,0.030987836,0.00046525092,0.00003794531,0.000017371087,0.0000034225563,0.0000511411,0.00045825855],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984633,0.00006929797,0.0003521118,0.00030926545,0.00020707141,0.0005989984],"domain_scores_gemma":[0.9987496,0.00021529285,0.00007427038,0.0004766406,0.000053632426,0.0004305263],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00030512945,0.00025560858,0.00035810203,0.0002895459,0.00015151649,0.000033105804,0.00036482094,0.0002002865,0.020561608],"category_scores_gemma":[0.0002925774,0.00018660506,0.000059372283,0.00022210428,0.0001864326,0.000037019585,0.00004931572,0.00040002284,0.0002843505],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034710527,0.000036101246,0.00069506245,0.00015077417,0.00003413897,0.0002769319,0.0035091233,0.0000013019887,0.000008737276,0.9926009,0.00210891,0.00054331607],"study_design_scores_gemma":[0.00049526297,0.000053568467,0.0008109077,0.00014879073,0.000026655796,0.00014672076,0.0003557516,0.0000530797,0.00017387643,0.9944179,0.0029971832,0.00032027194],"about_ca_topic_score_codex":0.00087127497,"about_ca_topic_score_gemma":0.007803129,"teacher_disagreement_score":0.08967586,"about_ca_system_score_codex":0.000113840964,"about_ca_system_score_gemma":0.000119157856,"threshold_uncertainty_score":0.98033375},"labels":[],"label_agreement":null},{"id":"W2053725458","doi":"10.1007/s11083-010-9149-1","title":"Prime Orders All of Whose Prime Suborders Are Selfdual","year":2010,"lang":"en","type":"article","venue":"Order","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa; Royal Military College of Canada","funders":"","keywords":"Mathematics; Prime (order theory); Combinatorics; Prime power; Set (abstract data type); Element (criminal law); Order (exchange); Discrete mathematics; Prime element; Computer science","score_opus":0.02122968024905074,"score_gpt":0.3047966964348104,"score_spread":0.28356701618575963,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2053725458","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9868322,0.000050787596,0.0005340892,0.00036479946,0.0006891351,0.00027659917,0.000016773514,0.00010911959,0.011126468],"genre_scores_gemma":[0.98025495,0.000010781953,0.018127171,0.00026378152,0.00011237788,0.000009210017,0.0000059610697,0.000054880304,0.0011608893],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99874836,0.00005392924,0.00032156354,0.00026195135,0.0002912284,0.00032297955],"domain_scores_gemma":[0.9985792,0.00022160678,0.00023979954,0.00065809366,0.00021008067,0.00009119395],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00033392775,0.00021462559,0.00031968192,0.000099181794,0.0001121486,0.000020242154,0.00034490158,0.00021539503,0.0010068543],"category_scores_gemma":[0.0005381581,0.00017272831,0.00010964027,0.00022299303,0.00023261509,0.000093982235,0.00013416146,0.0003933834,0.000019059442],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002472057,0.0009586371,0.02349571,0.00047411045,0.0008861153,0.000033698245,0.011229034,0.000010294354,0.03918368,0.86424446,0.04522235,0.0140147265],"study_design_scores_gemma":[0.0032335527,0.00025455217,0.014006495,0.00010379567,0.00034540764,0.000060143662,0.0014073895,0.00026341528,0.040899016,0.76826924,0.16974309,0.0014139207],"about_ca_topic_score_codex":0.000029478339,"about_ca_topic_score_gemma":0.00008032014,"teacher_disagreement_score":0.12452075,"about_ca_system_score_codex":0.0000089861405,"about_ca_system_score_gemma":0.000059579696,"threshold_uncertainty_score":0.99990636},"labels":[],"label_agreement":null},{"id":"W2053790252","doi":"10.1016/j.jctb.2007.06.003","title":"Fourier analysis and large independent sets in powers of complete graphs","year":2007,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; University of Waterloo","funders":"","keywords":"Statement (logic); Mathematics; Graph; Combinatorics; Independent set; Fourier transform; Set (abstract data type); Constant (computer programming); Fourier analysis; Maximal independent set; Discrete mathematics; Computer science; 1-planar graph; Mathematical analysis; Chordal graph","score_opus":0.014069872128002835,"score_gpt":0.28627842000547965,"score_spread":0.27220854787747684,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2053790252","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9948713,0.00024700465,0.0014830757,0.000030085836,0.0017640163,0.00010083929,0.000015171888,0.000007143654,0.0014813528],"genre_scores_gemma":[0.99820626,0.000054263626,0.0015722566,0.00003117699,0.00008452176,4.3028075e-7,9.5278176e-7,0.000016080008,0.00003404608],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978397,0.00030517252,0.00094828417,0.00012515047,0.00050342013,0.0002783052],"domain_scores_gemma":[0.9976688,0.00093297154,0.0007784787,0.0002593613,0.00023938138,0.000121009536],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0054714377,0.00017848774,0.0007265977,0.0007845373,0.00010225353,0.000021707194,0.00028415717,0.00014719047,0.000112775415],"category_scores_gemma":[0.00049057766,0.00013947973,0.00030579348,0.00065816625,0.00022123949,0.00023533813,0.00012026868,0.00037852573,1.3216572e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015565066,0.00013460247,0.015941063,0.000038895283,0.0007164662,0.000065693705,0.0025647564,0.0000018818973,0.00018960063,0.9783332,0.000043363263,0.0004139865],"study_design_scores_gemma":[0.0018141633,0.00030775918,0.014517616,0.00003769542,0.00034599303,0.000052903797,0.0015029425,0.0000031005743,0.0008957523,0.9797149,0.00066803984,0.00013914965],"about_ca_topic_score_codex":0.0000034116538,"about_ca_topic_score_gemma":0.000022951606,"teacher_disagreement_score":0.0049808603,"about_ca_system_score_codex":0.000036097517,"about_ca_system_score_gemma":0.00003354994,"threshold_uncertainty_score":0.5687818},"labels":[],"label_agreement":null},{"id":"W2054908111","doi":"10.4153/cmb-2000-017-7","title":"On the Entire Coloring Conjecture","year":2000,"lang":"en","type":"article","venue":"Canadian Mathematical Bulletin","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":23,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Colored; Combinatorics; Conjecture; Plane (geometry); Graph; Simple graph; Fractional coloring; Edge coloring; Brooks' theorem; Discrete mathematics; Graph power; Geometry; Line graph","score_opus":0.020674530666449083,"score_gpt":0.23827551802094543,"score_spread":0.21760098735449634,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2054908111","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.64964914,0.000032238993,0.000054967008,0.010465334,0.00010919991,0.0004125884,0.000021668508,0.000079199184,0.3391757],"genre_scores_gemma":[0.9793834,0.0000050596977,0.00059994846,0.0039271694,0.00012388492,0.000042563963,0.0000017999919,0.00004251275,0.01587364],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99864364,0.00011304832,0.0002705806,0.00023615488,0.00024251624,0.0004940412],"domain_scores_gemma":[0.9974665,0.0015410152,0.000040719686,0.00058155385,0.000024528475,0.00034568761],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00044818586,0.00021871843,0.00024835617,0.00006762827,0.0005552901,0.00006993984,0.0004314966,0.00014569955,0.2027396],"category_scores_gemma":[0.00077996764,0.00013194057,0.00013416809,0.00012361634,0.00019880146,0.000012489903,0.000025343614,0.00036990544,0.0060598864],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000793254,0.000015882742,0.0000037484567,0.000030166148,0.000025227611,0.000032015174,0.00046271295,0.0000024381757,0.0000020931498,0.9208292,0.07723773,0.0013508823],"study_design_scores_gemma":[0.00012707368,0.000034135224,0.000022342796,0.000070298884,0.00002070121,0.00003328646,0.00008304902,0.00003852761,0.0000599395,0.8389257,0.16042313,0.00016179585],"about_ca_topic_score_codex":0.00010827113,"about_ca_topic_score_gemma":0.00022178167,"teacher_disagreement_score":0.3297343,"about_ca_system_score_codex":0.0000829761,"about_ca_system_score_gemma":0.00005691546,"threshold_uncertainty_score":0.994714},"labels":[],"label_agreement":null},{"id":"W2055241129","doi":"10.3934/amc.2009.3.13","title":"Combinatorial batch codes","year":2009,"lang":"en","type":"article","venue":"Advances in Mathematics of Communications","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":77,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Lakehead University; University of Waterloo","funders":"Engineering and Physical Sciences Research Council; Natural Sciences and Engineering Research Council of Canada","keywords":"Server; Code (set theory); Mathematics; Discrete mathematics; Combinatorics; Probabilistic logic; Theoretical computer science; Computer science; Operating system; Statistics; Programming language","score_opus":0.031144836569571337,"score_gpt":0.3625640533067013,"score_spread":0.33141921673712993,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2055241129","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25597134,0.014322223,0.01657238,0.002186832,0.0009098747,0.0016130379,0.000059099228,0.00036114783,0.70800406],"genre_scores_gemma":[0.834378,0.0016513261,0.16385804,0.000030567862,0.00001725117,0.000013129214,0.0000038209696,0.000011139671,0.000036750695],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988029,0.00009856663,0.0006063935,0.00011072958,0.00021273197,0.00016867848],"domain_scores_gemma":[0.99610454,0.0016560286,0.0002913305,0.0018072448,0.00010609989,0.000034778233],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005360453,0.0001361955,0.0003625376,0.0001226666,0.00015613768,0.000010791641,0.0012503292,0.00007427182,0.000022005968],"category_scores_gemma":[0.0006959185,0.00012053322,0.00008353555,0.0002838393,0.00026711304,0.00022757005,0.00019875621,0.00022093438,0.000002030621],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000060208095,0.00039466098,0.00014314814,0.00006488595,0.000008709065,3.0170173e-7,0.0018163237,0.000009544981,0.00010790508,0.99502796,0.000050390994,0.002370139],"study_design_scores_gemma":[0.0003410454,0.000054346976,0.00015917167,0.00013230268,0.000019087784,0.0000033315237,0.00041316552,0.0004180931,0.00050616433,0.9958242,0.0020046777,0.00012437992],"about_ca_topic_score_codex":0.0000015698731,"about_ca_topic_score_gemma":0.000016385044,"teacher_disagreement_score":0.70796734,"about_ca_system_score_codex":0.00002328471,"about_ca_system_score_gemma":0.000018724324,"threshold_uncertainty_score":0.49152023},"labels":[],"label_agreement":null},{"id":"W2055253799","doi":"10.1007/s10623-009-9268-0","title":"A generalization of Meshulam’s theorem on subsets of finite abelian groups with no 3-term arithmetic progression","year":2009,"lang":"en","type":"article","venue":"Designs Codes and Cryptography","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Abelian group; Cardinality (data modeling); Mathematics; Combinatorics; Finite set; Discrete mathematics; Additive group; Arithmetic progression; Generalization; Group (periodic table); Physics; Mathematical analysis","score_opus":0.023754865245260878,"score_gpt":0.284586878016114,"score_spread":0.2608320127708531,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2055253799","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96577,0.00033537354,0.031465773,0.000030149291,0.000054715467,0.00042977088,0.000026205797,0.00005046226,0.0018375135],"genre_scores_gemma":[0.96710855,0.0001838465,0.032550484,0.000078846126,0.000029436249,0.000009887456,0.000012878019,0.000019560606,0.00000650572],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987988,0.00012498365,0.00033719026,0.00024071892,0.00029826653,0.00020006704],"domain_scores_gemma":[0.9989705,0.00020299785,0.0002770933,0.0003277769,0.0001530238,0.00006859137],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028875022,0.00022143431,0.00036137132,0.00030193105,0.00013192493,0.000022328848,0.00014902481,0.000107845466,0.00003056259],"category_scores_gemma":[0.000041318144,0.00014223752,0.00012090462,0.0004047367,0.00025019964,0.00006355837,0.000019963849,0.00009777287,2.5292542e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00048819566,0.00027669405,0.0063779047,0.00020156012,0.000099424615,0.0000061523765,0.0012263029,0.000021676216,0.0065925694,0.9762645,0.000098516364,0.008346529],"study_design_scores_gemma":[0.0013245736,0.0028155711,0.017526207,0.00066701276,0.00018359651,0.000013133321,0.00011608081,0.0005843109,0.020502556,0.9558234,0.00006595817,0.00037757223],"about_ca_topic_score_codex":0.0000018078258,"about_ca_topic_score_gemma":0.0000019815973,"teacher_disagreement_score":0.020441048,"about_ca_system_score_codex":0.0000038860344,"about_ca_system_score_gemma":0.000010892074,"threshold_uncertainty_score":0.58002776},"labels":[],"label_agreement":null},{"id":"W2056191455","doi":"10.1002/rsa.20543","title":"Sandwiching a densest subgraph by consecutive cores","year":2014,"lang":"en","type":"article","venue":"Random Structures and Algorithms","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Combinatorics; Vertex (graph theory); Core (optical fiber); Mathematics; Induced subgraph; Graph; Set (abstract data type); Induced subgraph isomorphism problem; Random graph; Integer (computer science); Discrete mathematics; Computer science; Line graph","score_opus":0.011963355358640543,"score_gpt":0.2657602499152009,"score_spread":0.2537968945565604,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2056191455","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9753753,0.0015762136,0.018916387,0.00012469362,0.0006385767,0.00041323656,0.000099506695,0.00015833831,0.0026977765],"genre_scores_gemma":[0.99171597,0.0001640186,0.007263009,0.00035267134,0.00026186506,0.000012946956,0.000013667208,0.000039706843,0.00017614856],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983485,0.0002268612,0.00035116295,0.00040814557,0.00027610437,0.000389238],"domain_scores_gemma":[0.997962,0.0013210995,0.00016918356,0.00031499227,0.00006343056,0.00016928218],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043730723,0.0003374609,0.00056254043,0.000099496196,0.0006120253,0.00011145242,0.00021086985,0.00016193837,0.000086135704],"category_scores_gemma":[0.00042522745,0.00023522293,0.00015244758,0.00011828142,0.00035947256,0.00008466164,0.00010995613,0.00028866835,8.244367e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00076900236,0.000049692677,0.0033722513,0.00020427843,0.00043689957,0.000021074882,0.004074463,0.0000057839907,0.0019239557,0.9127183,0.016675998,0.05974831],"study_design_scores_gemma":[0.0054881927,0.000112799906,0.0019430388,0.00003987356,0.000113836475,0.00013224458,0.00026107917,0.00080372184,0.0017486318,0.9825357,0.006381934,0.0004389352],"about_ca_topic_score_codex":0.000051293566,"about_ca_topic_score_gemma":0.000011990191,"teacher_disagreement_score":0.069817424,"about_ca_system_score_codex":0.000010003827,"about_ca_system_score_gemma":0.000012360059,"threshold_uncertainty_score":0.9592113},"labels":[],"label_agreement":null},{"id":"W2056838769","doi":"10.1016/s0012-365x(03)00154-7","title":"Bipartite rainbow Ramsey numbers","year":2003,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"","keywords":"Rainbow; Bipartite graph; Combinatorics; Monochromatic color; Mathematics; Ramsey's theorem; Edge coloring; Discrete mathematics; Colored; Complete bipartite graph; Graph; Graph power; Line graph; Physics","score_opus":0.03297050843445634,"score_gpt":0.3058187435489176,"score_spread":0.2728482351144612,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2056838769","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5567172,0.00025268426,0.028821949,0.00020549801,0.0011075176,0.0009512422,0.0000430249,0.00059028476,0.41131058],"genre_scores_gemma":[0.86397153,0.000025957648,0.13064845,0.00024130273,0.0000997199,0.00004005003,0.0000061014994,0.00011172149,0.0048551387],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981003,0.000131709,0.000550277,0.00030091067,0.00041753007,0.0004993046],"domain_scores_gemma":[0.9980895,0.0005786485,0.0002327553,0.00085964164,0.00007129847,0.00016814936],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007934343,0.00032856822,0.00044782407,0.000098180375,0.0003297146,0.000076383985,0.0003431383,0.00015717284,0.0007657899],"category_scores_gemma":[0.0012971989,0.0002517771,0.0002472423,0.00027286063,0.00019062197,0.00012376235,0.0000930389,0.00024596072,0.00008171345],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000049854843,0.000068928064,0.00022553401,0.00018975582,0.00007882562,0.000009669006,0.0038500852,0.0000035583705,0.000119980694,0.99166036,0.0036448475,0.00014345738],"study_design_scores_gemma":[0.00041768365,0.000030291649,0.00002437917,0.00006979264,0.00008308984,0.00005340285,0.0011285556,0.00020272072,0.0018544853,0.9822412,0.01352491,0.000369477],"about_ca_topic_score_codex":0.0000020092555,"about_ca_topic_score_gemma":0.0000035990497,"teacher_disagreement_score":0.40645543,"about_ca_system_score_codex":0.00003494692,"about_ca_system_score_gemma":0.000030473155,"threshold_uncertainty_score":0.99999344},"labels":[],"label_agreement":null},{"id":"W2058108962","doi":"10.1007/s004930170003","title":"Integer and Fractional Packings in Dense Graphs","year":2001,"lang":"en","type":"article","venue":"COMBINATORICA","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":92,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Combinatorics; Mathematics; Graph; Disjoint sets; Integer (computer science); Pairwise comparison; Discrete mathematics; Statistics","score_opus":0.024759626505838645,"score_gpt":0.28694245928115264,"score_spread":0.262182832775314,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2058108962","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9878965,0.00024289032,0.00017469576,0.00016402028,0.00036122397,0.000084330204,8.438802e-7,0.000045207533,0.011030269],"genre_scores_gemma":[0.99910605,0.000111019,0.0003082935,0.00013126656,0.000020131449,0.000007963655,6.908156e-7,0.000013259809,0.000301296],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999337,0.000047300735,0.00015896917,0.00015917947,0.00013354058,0.00016397815],"domain_scores_gemma":[0.9993671,0.00031506334,0.00005031257,0.00017552637,0.000037223224,0.00005473072],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019718122,0.00010264709,0.00014913072,0.0001266523,0.0001079557,0.000018750095,0.00009761569,0.00007846775,0.00009989089],"category_scores_gemma":[0.00021204204,0.00008627402,0.00003987169,0.00023036455,0.00006970917,0.00007847054,0.0000747913,0.00020433305,0.0000037028503],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020170326,0.00006449544,0.030846708,0.000011930991,0.000010957442,0.0000306201,0.00043480622,1.4102348e-7,0.000021941712,0.96585524,0.0017565101,0.0009464782],"study_design_scores_gemma":[0.0003977663,0.000028164446,0.016794631,0.000016659103,0.00000746595,0.000052993964,0.00007951596,0.00002748749,0.00005047086,0.97507477,0.0073619676,0.000108126886],"about_ca_topic_score_codex":0.000009852841,"about_ca_topic_score_gemma":0.0000035858168,"teacher_disagreement_score":0.014052078,"about_ca_system_score_codex":0.000030906926,"about_ca_system_score_gemma":0.000008696253,"threshold_uncertainty_score":0.35181522},"labels":[],"label_agreement":null},{"id":"W2059134409","doi":"10.1016/j.ejc.2012.01.009","title":"Induced subgraphs in sparse random graphs with given degree sequences","year":2012,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs; Alexander von Humboldt-Stiftung","keywords":"Mathematics; Combinatorics; Random regular graph; Random graph; Degree (music); Discrete mathematics; Graph; Line graph; Pathwidth","score_opus":0.06554242911777086,"score_gpt":0.2757763514326202,"score_spread":0.21023392231484933,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2059134409","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.982625,0.00064901327,0.00039532603,0.00006445507,0.0009962544,0.00012265134,0.0000012321913,0.000019927607,0.01512616],"genre_scores_gemma":[0.99825543,0.00009783423,0.0013823451,0.000052121322,0.00011939588,7.318837e-7,3.370212e-7,0.000046761073,0.00004503216],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974455,0.00090538926,0.00066699064,0.00011419904,0.0004881084,0.00037979384],"domain_scores_gemma":[0.9982429,0.00041055892,0.00064270623,0.00028561242,0.00020122936,0.0002169653],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003133853,0.00022655338,0.00044672046,0.00039869366,0.00012727974,0.000037673442,0.00051195937,0.000044644396,0.0000257373],"category_scores_gemma":[0.00034612007,0.00014985596,0.00016096683,0.00056056416,0.00011707048,0.00035684678,0.00007654536,0.00059909764,0.0000036914912],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00070963183,0.0005045427,0.12610155,0.00008402507,0.00022950373,0.0007453388,0.0069122026,0.000008584862,0.00035580216,0.8605305,0.001210447,0.0026078946],"study_design_scores_gemma":[0.0095955925,0.0012117889,0.08833508,0.00038005377,0.00018691442,0.0009135805,0.0010354368,0.000005001249,0.0011479615,0.89413536,0.002473498,0.0005797509],"about_ca_topic_score_codex":0.000001717904,"about_ca_topic_score_gemma":0.0000018585125,"teacher_disagreement_score":0.037766464,"about_ca_system_score_codex":0.00004049415,"about_ca_system_score_gemma":0.0000399751,"threshold_uncertainty_score":0.61109483},"labels":[],"label_agreement":null},{"id":"W2060031821","doi":"10.1016/j.jctb.2014.01.005","title":"Removable paths and cycles with parity constraints","year":2014,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Conjecture; Combinatorics; Mathematics; Parity (physics); Bipartite graph; Vertex (graph theory); Graph; Integer (computer science); Connectivity; Discrete mathematics; Physics; Computer science","score_opus":0.011393454643920681,"score_gpt":0.24868694295070454,"score_spread":0.23729348830678385,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2060031821","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98375356,0.00013586335,0.00142952,0.00012972942,0.0023243502,0.000103221195,0.0000035350306,0.000026902006,0.012093289],"genre_scores_gemma":[0.99455595,0.000044267625,0.0047497866,0.000058354308,0.00046783598,8.428508e-7,2.4253478e-7,0.000020930855,0.000101765996],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986057,0.00037921252,0.00041078823,0.00011367958,0.00029634603,0.00019425777],"domain_scores_gemma":[0.99807554,0.0008966886,0.00044993614,0.00022890617,0.00022369537,0.00012524558],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021046058,0.00017155883,0.00044020536,0.00007435292,0.00023727055,0.000061652245,0.00021689241,0.00010499981,0.0000901618],"category_scores_gemma":[0.00080541515,0.000111189205,0.00008123134,0.00008062097,0.00065247895,0.00028752122,0.00007292368,0.00031220115,4.4649994e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00096678187,0.000050170696,0.00059235917,0.000045413784,0.00009979353,0.000021124555,0.00068176305,7.0276366e-7,0.00011431539,0.9941637,0.00023446529,0.0030294182],"study_design_scores_gemma":[0.0014281479,0.0006927435,0.00040328095,0.0000903067,0.00007810875,0.0005600122,0.0004954839,0.0000018705606,0.0012875965,0.99088806,0.0039233575,0.00015104073],"about_ca_topic_score_codex":5.68528e-7,"about_ca_topic_score_gemma":6.7490936e-7,"teacher_disagreement_score":0.011991523,"about_ca_system_score_codex":0.000017001747,"about_ca_system_score_gemma":0.00004551447,"threshold_uncertainty_score":0.4534164},"labels":[],"label_agreement":null},{"id":"W2061886541","doi":"10.1016/j.aim.2012.06.022","title":"A measure-theoretic approach to the theory of dense hypergraphs","year":2012,"lang":"en","type":"article","venue":"Advances in Mathematics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":80,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Mathematics; Hypergraph; Lemma (botany); Measure (data warehouse); Lebesgue measure; Discrete mathematics; Mathematical proof; Ultraproduct; Pure mathematics; Lebesgue integration","score_opus":0.027882147458859908,"score_gpt":0.28753380617195373,"score_spread":0.2596516587130938,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2061886541","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4800009,0.02249939,0.22577983,0.0001308649,0.0013792854,0.0025435004,0.00003118086,0.00020350805,0.26743153],"genre_scores_gemma":[0.8951003,0.00024506293,0.10419059,0.00010659265,0.00009852252,0.00007785139,6.2819663e-7,0.000044267712,0.00013621364],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979464,0.00027724684,0.0006319414,0.00019672593,0.0004664725,0.0004812566],"domain_scores_gemma":[0.9968777,0.0017911694,0.00025268676,0.0008954676,0.000080415884,0.00010261686],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030518011,0.00025985707,0.0004789985,0.00017475366,0.00013633334,0.000012675591,0.0006664599,0.00009911416,0.000041337848],"category_scores_gemma":[0.0017351172,0.00015376006,0.00016021628,0.000531697,0.00032070794,0.00021257976,0.00018624183,0.00024618962,0.000009486428],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031798994,0.00033493165,0.000704619,0.0003947597,0.000030862873,4.5292293e-7,0.012983543,0.00004997479,0.00004356693,0.98138255,0.00008432586,0.003958597],"study_design_scores_gemma":[0.00021886335,0.000028437536,0.00021760033,0.0001514057,0.00006657945,0.00003251572,0.0034516181,0.000105826264,0.0005667977,0.99393314,0.0010163801,0.00021085909],"about_ca_topic_score_codex":5.8852015e-7,"about_ca_topic_score_gemma":0.0000022075205,"teacher_disagreement_score":0.41509935,"about_ca_system_score_codex":0.000027926377,"about_ca_system_score_gemma":0.000014209132,"threshold_uncertainty_score":0.62701535},"labels":[],"label_agreement":null},{"id":"W2062486876","doi":"10.1017/s096354831400056x","title":"An Alternative Proof of the Linearity of the Size-Ramsey Number of Paths","year":2014,"lang":"en","type":"article","venue":"Combinatorics Probability Computing","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":46,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Combinatorics; Ramsey's theorem; Mathematics; Monochromatic color; Graph; Linearity; Integer (computer science); Discrete mathematics; Upper and lower bounds; Computer science; Physics","score_opus":0.024372395465655682,"score_gpt":0.296762292521978,"score_spread":0.2723898970563223,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2062486876","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99481195,0.000012333961,0.0018667384,0.00004366006,0.0008974982,0.0006058029,0.0000092663895,0.000021593363,0.0017311386],"genre_scores_gemma":[0.9966392,3.9917614e-7,0.0032600139,0.000020511905,0.000044645745,0.0000025560978,3.4092074e-7,0.00001748254,0.000014874053],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974286,0.00083417416,0.0007557051,0.0002709005,0.0005022931,0.00020832894],"domain_scores_gemma":[0.9952974,0.0017474385,0.0009348403,0.001379138,0.00059785286,0.000043356857],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022796476,0.00018152352,0.00046576295,0.000017548042,0.0002202598,0.000009895136,0.0011512068,0.00012296,0.000008657107],"category_scores_gemma":[0.0041421773,0.00010517426,0.00025276342,0.00040250242,0.00057116925,0.00005371336,0.0007446563,0.0003710541,1.01787506e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013955551,0.0005061454,0.09961752,0.0005843995,0.00003789696,6.94603e-8,0.0034027973,0.00019960332,0.00019715338,0.89408255,0.000011349185,0.0013465809],"study_design_scores_gemma":[0.0003595606,0.000076262375,0.016674817,0.00012613366,0.000036484907,0.0000024807139,0.00006506275,0.0074145044,0.028766155,0.9463587,0.000014802301,0.000105036794],"about_ca_topic_score_codex":0.000038713813,"about_ca_topic_score_gemma":0.0000040562004,"teacher_disagreement_score":0.0829427,"about_ca_system_score_codex":0.00004836243,"about_ca_system_score_gemma":0.00006733276,"threshold_uncertainty_score":0.49588725},"labels":[],"label_agreement":null},{"id":"W2062699618","doi":"10.4153/cmb-2013-041-8","title":"On Convolutions of Convex Sets and Related Problems","year":2013,"lang":"en","type":"article","venue":"Canadian Mathematical Bulletin","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Regular polygon; Combinatorics; Property (philosophy); Constant (computer programming); Set (abstract data type); Discrete mathematics; Pure mathematics; Geometry","score_opus":0.015038541434914239,"score_gpt":0.23096907907396366,"score_spread":0.21593053763904943,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2062699618","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8695562,0.000103433886,0.00016074406,0.0038239902,0.000111339876,0.00090778375,0.000040685663,0.000064241765,0.12523162],"genre_scores_gemma":[0.995407,0.0000049920495,0.0016727678,0.00031825525,0.00000924168,0.00003986993,0.0000023518553,0.0000262847,0.002519281],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989,0.00006664937,0.0003850592,0.00018650052,0.00014783825,0.0003139446],"domain_scores_gemma":[0.9983475,0.0007523884,0.0000919679,0.00033025586,0.00008375936,0.00039408501],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00025236997,0.00015720124,0.00031022346,0.00013406468,0.00015338566,0.000022729031,0.00015079876,0.00015513941,0.023877928],"category_scores_gemma":[0.00089067593,0.00012375037,0.000065363696,0.00009520285,0.0003329349,0.000020694402,0.000036534824,0.00019518899,0.0011233867],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000010929043,0.000024687379,0.000029805335,0.00017073606,0.000034875826,0.000003234277,0.0005884346,8.3543455e-7,0.000027214512,0.9752179,0.023663532,0.00023766581],"study_design_scores_gemma":[0.00024552745,0.00005752936,0.00028286918,0.00014131702,0.000025641435,0.00003454742,0.00011796655,0.00023006157,0.000044768098,0.9963464,0.0023274736,0.00014586907],"about_ca_topic_score_codex":0.00038400432,"about_ca_topic_score_gemma":0.0000880222,"teacher_disagreement_score":0.1258508,"about_ca_system_score_codex":0.000039870072,"about_ca_system_score_gemma":0.000049305672,"threshold_uncertainty_score":0.99965435},"labels":[],"label_agreement":null},{"id":"W2062920840","doi":"10.1007/s00493-005-0031-5","title":"Small Forbidden Configurations IV: The 3 Rowed Case","year":2005,"lang":"en","type":"article","venue":"COMBINATORICA","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":20,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.06555081426316522,"score_gpt":0.2961509496191087,"score_spread":0.23060013535594348,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2062920840","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.835652,0.00058058155,0.0018525743,0.003998009,0.0013177727,0.0007690662,0.00001773898,0.00033048683,0.15548179],"genre_scores_gemma":[0.9954605,0.000011278359,0.0012035756,0.00031787853,0.00015234403,0.00003128204,0.0000017234767,0.000021742899,0.0027996583],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99916637,0.00010419442,0.00022490867,0.00015610128,0.00012986576,0.00021857065],"domain_scores_gemma":[0.9986696,0.00052861194,0.000085427295,0.00056460936,0.000082208026,0.00006951935],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029202495,0.00013434251,0.00015035439,0.000040992312,0.0006439707,0.00004729415,0.0002995751,0.00007783489,0.00023141016],"category_scores_gemma":[0.00025627538,0.000085334475,0.00009943806,0.00016219853,0.00009089879,0.000060637045,0.00009502028,0.00020584474,0.00003104847],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000046501345,0.000055186923,0.000030993415,0.000008879597,0.00002998565,0.00005911992,0.0012576038,0.0000016556522,0.000025899066,0.9839996,0.011583756,0.0029426664],"study_design_scores_gemma":[0.0004219533,0.000037284073,0.000089303096,0.0000064204846,0.000052373005,0.0005089093,0.00024964332,0.00027054903,0.0004349132,0.91310006,0.084675096,0.00015346844],"about_ca_topic_score_codex":0.000009985623,"about_ca_topic_score_gemma":0.000020883652,"teacher_disagreement_score":0.15980853,"about_ca_system_score_codex":0.000042329775,"about_ca_system_score_gemma":0.000023347493,"threshold_uncertainty_score":0.49529672},"labels":[],"label_agreement":null},{"id":"W2063346456","doi":"10.1016/j.jcta.2014.06.003","title":"Measurable events indexed by words","year":2014,"lang":"en","type":"preprint","venue":"Journal of Combinatorial Theory Series A","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Combinatorics; Integer (computer science); Dimension (graph theory); Tree (set theory); Mathematics; Omega; Space (punctuation); Constant (computer programming); Discrete mathematics; Physics; Quantum mechanics","score_opus":0.01850507248785363,"score_gpt":0.27761987846084285,"score_spread":0.2591148059729892,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2063346456","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.90329474,0.0021505454,0.0052832905,0.00043068282,0.07696559,0.00078901945,0.00008687442,0.0001347363,0.010864543],"genre_scores_gemma":[0.99451417,0.0002118353,0.0013904445,0.00009030593,0.0023262673,0.00001069414,0.0000061192304,0.00010706976,0.0013430811],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9953908,0.0013225584,0.0014419274,0.00030697955,0.0011039001,0.0004338878],"domain_scores_gemma":[0.99478906,0.0010354825,0.0024147038,0.0008473441,0.00066623307,0.00024715002],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0053121834,0.0005673485,0.0014607055,0.00023845841,0.0002984983,0.0001186905,0.001430502,0.0007566829,0.00029452305],"category_scores_gemma":[0.0020292557,0.000440874,0.0007275298,0.00014445971,0.00023208132,0.0002554003,0.00083554635,0.0020406449,0.0000027391172],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0019349639,0.00019260123,0.00008853569,0.00029062698,0.0007190516,0.000018624345,0.001192716,0.000014836705,0.00011224542,0.97695124,0.017536942,0.00094762904],"study_design_scores_gemma":[0.0015247867,0.0004019367,0.0000235277,0.0004845114,0.00028549682,0.00009507139,0.00020575209,0.0000029122239,0.0014157427,0.9751712,0.019948374,0.0004407042],"about_ca_topic_score_codex":0.0000023043901,"about_ca_topic_score_gemma":5.212606e-7,"teacher_disagreement_score":0.09121946,"about_ca_system_score_codex":0.00016951954,"about_ca_system_score_gemma":0.00024889418,"threshold_uncertainty_score":0.9998043},"labels":[],"label_agreement":null},{"id":"W2063719452","doi":"10.4153/cmb-2011-116-2","title":"Improved Range in the Return Times Theorem","year":2011,"lang":"en","type":"article","venue":"Canadian Mathematical Bulletin","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"University of Cambridge; National Science Foundation","keywords":"Range (aeronautics); Comparison theorem; Calculus (dental); Simple (philosophy)","score_opus":0.03238380654556575,"score_gpt":0.24118614762660312,"score_spread":0.20880234108103737,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2063719452","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23360376,0.00016854808,0.00064254587,0.0040380848,0.00022167669,0.0011966951,0.000032413893,0.00010596825,0.75999033],"genre_scores_gemma":[0.99077284,0.0000046356063,0.0053179185,0.001898184,0.000088250286,0.00006242421,0.0000017868473,0.000041373212,0.0018125686],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983572,0.00023517181,0.00039826217,0.00024842154,0.00019752399,0.00056346285],"domain_scores_gemma":[0.9981532,0.00076898513,0.00007552507,0.00070742663,0.00004016068,0.0002546673],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0013661972,0.0002294715,0.00030662733,0.0001497151,0.00020405874,0.00004106824,0.0007266416,0.00017357271,0.02417231],"category_scores_gemma":[0.0010698829,0.00013886679,0.00013408002,0.0001830147,0.00025779987,0.000026912821,0.000053752967,0.0003798871,0.00061944214],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014342216,0.000040286275,0.000083131505,0.00006002471,0.000016754511,0.000062080064,0.007844506,1.1467266e-8,0.0000055033674,0.9786105,0.012893907,0.00036891937],"study_design_scores_gemma":[0.00025965323,0.000037661463,0.00026388952,0.000050216837,0.0000279504,0.0000569826,0.0010325846,0.00006389016,0.000060657472,0.98806715,0.009871791,0.00020760055],"about_ca_topic_score_codex":0.00068661664,"about_ca_topic_score_gemma":0.0017717037,"teacher_disagreement_score":0.75817776,"about_ca_system_score_codex":0.000061266466,"about_ca_system_score_gemma":0.00006680898,"threshold_uncertainty_score":0.97671974},"labels":[],"label_agreement":null},{"id":"W2063922980","doi":"10.1093/qmath/hav012","title":"GAPS BETWEEN FRACTIONAL PARTS, AND ADDITIVE COMBINATORICS","year":2015,"lang":"en","type":"preprint","venue":"The Quarterly Journal of Mathematics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia; Université de Montréal","funders":"","keywords":"Combinatorics; Mathematics","score_opus":0.052473979644646604,"score_gpt":0.3194275809481163,"score_spread":0.2669536013034697,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2063922980","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9728389,0.0033653928,0.015156516,0.00091891194,0.0028937438,0.00077959895,0.00032932617,0.000070971204,0.0036466545],"genre_scores_gemma":[0.9843256,0.0003075038,0.013395936,0.00005606365,0.0015395456,0.000010810675,0.000010991813,0.0000920353,0.0002615216],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9968518,0.00034572344,0.0013178707,0.00019910932,0.0009929837,0.00029252647],"domain_scores_gemma":[0.99294525,0.0028934062,0.0024738512,0.0006599985,0.0008046375,0.00022287891],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0031430083,0.00043705152,0.0010809783,0.00019133881,0.00026767942,0.0001517141,0.0008450025,0.00038512406,0.00005653587],"category_scores_gemma":[0.00059292745,0.00026656734,0.000328728,0.000102119666,0.00032817305,0.00013972384,0.00029218453,0.0018526514,0.0000051372385],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000075314274,0.0005029499,0.000263632,0.0014019572,0.0021458878,0.000079355385,0.067357786,0.000021078582,0.0000064242313,0.8711665,0.049751207,0.007227872],"study_design_scores_gemma":[0.0005192341,0.00041374651,0.000119061595,0.00052817044,0.0007173814,0.00037440812,0.0047779297,0.00008682845,0.00003027557,0.99049616,0.0016523113,0.00028448],"about_ca_topic_score_codex":0.000002372355,"about_ca_topic_score_gemma":0.0000011843306,"teacher_disagreement_score":0.11932964,"about_ca_system_score_codex":0.00010477514,"about_ca_system_score_gemma":0.00021092032,"threshold_uncertainty_score":0.99997866},"labels":[],"label_agreement":null},{"id":"W2065653857","doi":"10.1007/s00493-009-2267-y","title":"On the edge-density of 4-critical graphs","year":2009,"lang":"en","type":"article","venue":"COMBINATORICA","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; Brock University","funders":"Kempe Foundation","keywords":"Mathematics; Combinatorics; Conjecture; Graph; Enhanced Data Rates for GSM Evolution; Discrete mathematics; Computer science","score_opus":0.027806760855781033,"score_gpt":0.29770400574462824,"score_spread":0.2698972448888472,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2065653857","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95030946,0.00009939226,0.00020106167,0.001863261,0.0007228981,0.00016590412,0.0000029305804,0.0000804658,0.04655463],"genre_scores_gemma":[0.99927026,0.000005542304,0.00020680239,0.00039564853,0.000020008125,0.0000020524576,2.652789e-7,0.000007970212,0.00009142477],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999172,0.00010710605,0.00018345178,0.00013497619,0.00023223866,0.00017027277],"domain_scores_gemma":[0.99790496,0.0013927381,0.00005435033,0.00051349687,0.00008418866,0.000050259616],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029364956,0.00011081008,0.00019249997,0.000047457383,0.00021392004,0.000010184213,0.00029834284,0.00007008816,0.000069225665],"category_scores_gemma":[0.0012333795,0.00006632514,0.00011920179,0.00019160935,0.00018306577,0.000023479122,0.0000495028,0.00020390662,0.0000055367127],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001557299,0.00019544529,0.00007148026,0.000013502482,0.00000919677,0.0000035022636,0.00022805735,5.2063992e-8,0.000074515854,0.9896837,0.0091364635,0.0005685167],"study_design_scores_gemma":[0.00014566765,0.00019065886,0.0019580235,0.000016799682,0.000020800393,0.0000036763852,0.000029068002,0.000007766638,0.002744391,0.994571,0.00023048813,0.00008171167],"about_ca_topic_score_codex":8.4060713e-7,"about_ca_topic_score_gemma":9.015247e-8,"teacher_disagreement_score":0.048960827,"about_ca_system_score_codex":0.000014098882,"about_ca_system_score_gemma":0.000009703784,"threshold_uncertainty_score":0.2704661},"labels":[],"label_agreement":null},{"id":"W2067086851","doi":"10.1016/j.ejc.2013.05.027","title":"Roth-type theorems in finite groups","year":2013,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Mathematics; Lemma (botany); Type (biology); Combinatorics; Discrete mathematics","score_opus":0.02469061789435342,"score_gpt":0.25309649037574905,"score_spread":0.22840587248139563,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2067086851","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9499155,0.00045326012,0.0011439832,0.00014778998,0.0018790074,0.00012784294,5.8343676e-7,0.000022210286,0.04630978],"genre_scores_gemma":[0.99823165,0.000118539014,0.00097359996,0.00012432411,0.00016006951,3.8520338e-7,2.766157e-7,0.00004482652,0.00034635753],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981006,0.0006107173,0.00065133057,0.0000994724,0.00031304095,0.00022484023],"domain_scores_gemma":[0.998342,0.00054290984,0.00042641358,0.00028039116,0.0002924219,0.000115906354],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016981752,0.00015605945,0.00029124832,0.00021194135,0.00008328196,0.000056938134,0.0005242994,0.000035658122,0.00019226549],"category_scores_gemma":[0.00097371306,0.00011380522,0.00011749851,0.0003308851,0.00007476677,0.00021155544,0.00011920559,0.00051836256,0.00004486987],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000035326815,0.00014114936,0.003470324,0.000039300627,0.000038417318,0.00021500685,0.0016391955,0.000019054132,0.000089473186,0.98770106,0.004631857,0.001979808],"study_design_scores_gemma":[0.0009024817,0.0003160209,0.008131589,0.00007671929,0.000016346206,0.000076962824,0.0001794193,0.000041042116,0.00007994589,0.9857724,0.004258209,0.00014889163],"about_ca_topic_score_codex":8.409532e-7,"about_ca_topic_score_gemma":1.9085635e-7,"teacher_disagreement_score":0.04831608,"about_ca_system_score_codex":0.000037872713,"about_ca_system_score_gemma":0.000022877126,"threshold_uncertainty_score":0.4640842},"labels":[],"label_agreement":null},{"id":"W2067467106","doi":"10.1007/pl00001685","title":"An improved bound for the Minkowski dimension of Besicovitch sets in medium dimension","year":2001,"lang":"en","type":"article","venue":"Geometric and Functional Analysis","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":40,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Mathematics; Dimension (graph theory); Minkowski space; Combinatorics; Minkowski–Bouligand dimension; Constant (computer programming); Packing dimension; Arithmetic progression; Hausdorff dimension; Discrete mathematics; Mathematical analysis; Geometry; Fractal dimension; Fractal","score_opus":0.025311797681872864,"score_gpt":0.27830632048696735,"score_spread":0.2529945228050945,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2067467106","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97428185,0.0017577163,0.023140417,0.00023806383,0.00024572227,0.00020540244,0.000025978323,0.000017619108,0.00008724601],"genre_scores_gemma":[0.998288,0.00017097741,0.001033998,0.00008229895,0.00008244936,0.000019002307,0.000037022033,0.000010729279,0.0002755457],"study_design_codex":"observational","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99892056,0.00004202531,0.00032799476,0.00026845743,0.0002629986,0.00017795007],"domain_scores_gemma":[0.9980763,0.0013553229,0.000115973926,0.0002654092,0.00013076075,0.000056196208],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008083951,0.0001338618,0.00031217767,0.0011472219,0.00021909038,0.000024872177,0.00008956886,0.00009393325,0.000115032344],"category_scores_gemma":[0.00025061404,0.00007897513,0.00020810547,0.0031528042,0.00009340319,0.00008229926,0.000056191995,0.00010460468,6.970426e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0046660793,0.0028468498,0.46436712,0.0010497115,0.021303654,0.000042262855,0.005298242,0.0074867187,0.016232979,0.29896456,0.01421781,0.163524],"study_design_scores_gemma":[0.0016116007,0.00050928415,0.3401233,0.00002783019,0.0064521823,0.000024996936,0.00094630395,0.10389239,0.00053504034,0.5432848,0.0021225815,0.0004697334],"about_ca_topic_score_codex":0.00009409995,"about_ca_topic_score_gemma":0.00011193254,"teacher_disagreement_score":0.2443202,"about_ca_system_score_codex":0.00002170508,"about_ca_system_score_gemma":0.000018731987,"threshold_uncertainty_score":0.32205123},"labels":[],"label_agreement":null},{"id":"W2068023471","doi":"10.4064/aa129-2-4","title":"A quadratic lower bound for subset sums","year":2007,"lang":"en","type":"article","venue":"Acta Arithmetica","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; Univerza v Ljubljani; Javna Agencija za Raziskovalno Dejavnost RS; Univerzita Karlova v Praze","keywords":"Mathematics; Combinatorics; Sigma; Abelian group; Prime (order theory); Constant (computer programming); Upper and lower bounds; Group (periodic table); Quadratic equation; Set (abstract data type); Discrete mathematics; Geometry; Physics; Mathematical analysis","score_opus":0.03561180794295817,"score_gpt":0.32903027249344613,"score_spread":0.293418464550488,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2068023471","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9412085,0.0001259143,0.029630195,0.0007229976,0.0013841704,0.0008723446,0.000047802994,0.0001925802,0.025815513],"genre_scores_gemma":[0.96269196,0.0000056418025,0.03550685,0.00040897366,0.00023538912,0.000019980793,0.000007021141,0.000043387954,0.0010808024],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998642,0.0000316983,0.00035541403,0.00026048877,0.00023421856,0.000476169],"domain_scores_gemma":[0.9975551,0.0016150189,0.00009596567,0.0005132593,0.00009571201,0.00012496329],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009655849,0.00019091263,0.00026955307,0.00010723224,0.00028744515,0.000060046517,0.00028318827,0.00014301836,0.00022553976],"category_scores_gemma":[0.0009054179,0.00015133082,0.00016695767,0.00015274862,0.00017173696,0.00008481332,0.00007726099,0.00016071409,0.000009179869],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015055043,0.00015718718,0.00023590383,0.00010686485,0.00010084709,0.000017310438,0.00089803606,1.1283468e-7,0.00091181585,0.98176515,0.013005865,0.002650335],"study_design_scores_gemma":[0.0006010206,0.00017495207,0.00087132375,0.000024215708,0.000097887,0.000025916126,0.00015199823,0.00009006398,0.0023210486,0.95149386,0.043873273,0.00027446303],"about_ca_topic_score_codex":0.000005190185,"about_ca_topic_score_gemma":0.000040044953,"teacher_disagreement_score":0.030867407,"about_ca_system_score_codex":0.0000310049,"about_ca_system_score_gemma":0.000026681635,"threshold_uncertainty_score":0.6171092},"labels":[],"label_agreement":null},{"id":"W2068865948","doi":"10.1016/j.ejc.2006.07.001","title":"Minimal paths and cycles in set systems","year":2006,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":27,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"National Science Foundation","keywords":"Combinatorics; Mathematics; Disjoint sets; Conjecture; Modulo; Disjoint union (topology); Family of sets; Set (abstract data type); Discrete mathematics","score_opus":0.022415123895904207,"score_gpt":0.2542392567298244,"score_spread":0.23182413283392017,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2068865948","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98518646,0.001319312,0.0002364617,0.000038740247,0.0007490324,0.00005352982,0.0000028161232,0.000010940807,0.012402689],"genre_scores_gemma":[0.9992159,0.00005817023,0.00038320106,0.000013036718,0.00016663013,1.7453182e-7,3.2487165e-7,0.000026054926,0.00013652463],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985405,0.00042422855,0.0005689033,0.00008323995,0.00023119929,0.0001519312],"domain_scores_gemma":[0.99912095,0.00023127193,0.0003591072,0.00013530505,0.00009384612,0.000059526483],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013721993,0.000117963005,0.00025631394,0.00015533975,0.00006930649,0.000050476705,0.00020138513,0.00002635467,0.0000036942897],"category_scores_gemma":[0.00014612632,0.00009084856,0.000059038324,0.00012675766,0.0000556452,0.00009129508,0.000070955786,0.00024897367,0.0000012375109],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003696327,0.0000945849,0.016441995,0.000088440414,0.000020662388,0.0007446987,0.0007081102,0.000022311888,0.00008598697,0.97754437,0.0038125282,0.0003993222],"study_design_scores_gemma":[0.0022611741,0.00039963707,0.07285468,0.00025342772,0.000049361675,0.0007906482,0.00062256615,0.00009016542,0.000090647,0.9132333,0.009072917,0.0002815164],"about_ca_topic_score_codex":0.0000017714697,"about_ca_topic_score_gemma":4.505444e-7,"teacher_disagreement_score":0.06431114,"about_ca_system_score_codex":0.000024793613,"about_ca_system_score_gemma":0.0000131922425,"threshold_uncertainty_score":0.3704697},"labels":[],"label_agreement":null},{"id":"W2069337358","doi":"10.1007/s00373-011-1068-4","title":"The Maximum Chromatic Index of Multigraphs with Given Δ and μ","year":2011,"lang":"en","type":"article","venue":"Graphs and Combinatorics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Multigraph; Mathematics; Combinatorics; Multiplicity (mathematics); Edge coloring; Upper and lower bounds; Chromatic scale; Index (typography); Discrete mathematics; Graph; Geometry; Mathematical analysis; Computer science","score_opus":0.022317484597639804,"score_gpt":0.2248478408948655,"score_spread":0.2025303562972257,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2069337358","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9948843,0.0009686342,0.00012985975,0.000019294417,0.00012438906,0.00019064451,0.000003298877,0.00003191644,0.0036476385],"genre_scores_gemma":[0.9989095,0.00040987725,0.0005897527,0.000015585298,0.0000032282228,0.000010873614,2.8191334e-7,0.000015421963,0.00004551596],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992466,0.000046259276,0.00020579083,0.00015083062,0.00017027877,0.00018026511],"domain_scores_gemma":[0.9991716,0.000245704,0.000142542,0.00030341826,0.000067700894,0.00006900418],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024071315,0.00014802645,0.00021124487,0.00007681523,0.00033226743,0.000019563966,0.00016266441,0.00007069032,0.000005505252],"category_scores_gemma":[0.000039140978,0.00008182176,0.000044965014,0.00022148769,0.00044521329,0.000053088334,0.00008879548,0.00012726257,9.828412e-8],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000043217555,0.000049861123,0.03772143,0.000097800024,0.00008002077,0.0000035503483,0.002286309,2.0148539e-8,0.000008765706,0.9574419,0.000078572964,0.002188524],"study_design_scores_gemma":[0.00056011317,0.00021506859,0.04348479,0.0000336563,0.000050057828,0.000019333484,0.0007031747,0.000030347697,0.00017016749,0.95446974,0.00014293012,0.00012061347],"about_ca_topic_score_codex":0.000029192945,"about_ca_topic_score_gemma":0.000012990905,"teacher_disagreement_score":0.0057633575,"about_ca_system_score_codex":0.0000031971986,"about_ca_system_score_gemma":0.000009181896,"threshold_uncertainty_score":0.33365944},"labels":[],"label_agreement":null},{"id":"W2071386577","doi":"10.1017/s0963548313000540","title":"Conflict-Free Colouring of Graphs","year":2013,"lang":"en","type":"article","venue":"Combinatorics Probability Computing","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":29,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Freie Universität Berlin; Hungarian Scientific Research Fund; Deutsche Forschungsgemeinschaft","keywords":"Chromatic scale; Critical graph; Combinatorics; Mathematics; Vertex (graph theory); Random graph; Graph; Probabilistic logic; Discrete mathematics; Line graph; Voltage graph; Statistics","score_opus":0.04105905275934962,"score_gpt":0.2772389971211725,"score_spread":0.23617994436182288,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2071386577","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.989962,0.00012304826,0.0011799135,0.000082995255,0.0006642141,0.000721945,0.0000028281338,0.00017924988,0.0070838397],"genre_scores_gemma":[0.9889431,0.0000037162952,0.010898281,0.00003505383,0.000030051713,0.000010983408,0.0000010575786,0.000026791582,0.00005094334],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980205,0.00017804159,0.0007001856,0.00035480986,0.00035562823,0.0003907866],"domain_scores_gemma":[0.99675214,0.001167237,0.0003539726,0.0011612895,0.00045083807,0.00011449492],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010083066,0.00022925845,0.00046996295,0.000113342416,0.00031154932,0.000037783328,0.00085032097,0.00014649997,0.00006178704],"category_scores_gemma":[0.0018607925,0.00020544013,0.00018475429,0.000420768,0.00026536486,0.000116426214,0.00091606716,0.00031755606,0.0000038956246],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004909613,0.00016636042,0.015418585,0.0003619761,0.000039867784,8.49607e-7,0.0012310877,0.000013749268,0.00016747662,0.9808998,0.0006674598,0.0010278686],"study_design_scores_gemma":[0.00058054196,0.00008372244,0.007122727,0.00005833235,0.000021562257,0.000005455424,0.000089765104,0.0010133825,0.0016449232,0.9890675,0.00009986203,0.00021222747],"about_ca_topic_score_codex":0.00003657052,"about_ca_topic_score_gemma":0.0000011505854,"teacher_disagreement_score":0.009718367,"about_ca_system_score_codex":0.00006856329,"about_ca_system_score_gemma":0.00003478611,"threshold_uncertainty_score":0.8377605},"labels":[],"label_agreement":null},{"id":"W2073677433","doi":"10.1002/rsa.20416","title":"Asymptotic enumeration of strongly connected digraphs by vertices and edges","year":2012,"lang":"en","type":"article","venue":"Random Structures and Algorithms","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Digraph; Combinatorics; Enumeration; Mathematics; Strongly connected component; Discrete mathematics","score_opus":0.01617367823140158,"score_gpt":0.26665309169573986,"score_spread":0.2504794134643383,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2073677433","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9908822,0.006155638,0.0020689706,0.00003102683,0.00032690543,0.0002506974,0.00006091994,0.00003684235,0.00018677497],"genre_scores_gemma":[0.99548674,0.0003064171,0.0039434982,0.000027575876,0.00015733793,0.0000070912142,0.00001339201,0.00001919001,0.000038735405],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989198,0.00011058484,0.00030837336,0.0001913108,0.00019306563,0.0002768548],"domain_scores_gemma":[0.99892247,0.000562282,0.000161569,0.00017538316,0.00005158212,0.0001267113],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000257476,0.00021215773,0.0004024431,0.00007350921,0.00022541003,0.000041887903,0.00008897598,0.00011629171,0.000052118758],"category_scores_gemma":[0.00017926804,0.0001493285,0.000066048546,0.00008673273,0.0002220171,0.00019839605,0.00006194412,0.00012582281,1.2868574e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013462628,0.00024465506,0.050706122,0.0011758143,0.0012964397,0.000004032367,0.023908626,0.000010961684,0.022526305,0.76008767,0.0034945714,0.1351985],"study_design_scores_gemma":[0.015552567,0.00043350845,0.09113844,0.00012978191,0.0007435116,0.00012817017,0.0016435832,0.0014256721,0.03533602,0.8501966,0.0021903433,0.0010817704],"about_ca_topic_score_codex":0.000021660746,"about_ca_topic_score_gemma":0.000002494166,"teacher_disagreement_score":0.13411674,"about_ca_system_score_codex":0.0000053935887,"about_ca_system_score_gemma":0.0000067832825,"threshold_uncertainty_score":0.60894394},"labels":[],"label_agreement":null},{"id":"W2074813456","doi":"10.1007/s00493-014-2880-2","title":"Measurable events indexed by products of trees","year":2014,"lang":"en","type":"article","venue":"COMBINATORICA","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Mathematics; Cartesian product; Combinatorics; Homogeneous; Tree (set theory); Product (mathematics); Sequence (biology); Discrete mathematics; Integer (computer science); Lebesgue integration; Finite set; Mathematical analysis","score_opus":0.020607426182429462,"score_gpt":0.2553691899771304,"score_spread":0.2347617637947009,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2074813456","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9749636,0.0003154989,0.00033024154,0.00019712125,0.0009287855,0.0002744493,0.000006849508,0.00010357077,0.022879874],"genre_scores_gemma":[0.9980269,0.000009008284,0.00054848194,0.000026367936,0.000028531009,0.000008645969,0.0000021692254,0.000021215526,0.0013286432],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989662,0.00013003322,0.00024300913,0.0001887117,0.00028313743,0.00018886667],"domain_scores_gemma":[0.99896055,0.00020446842,0.00015191223,0.00049764273,0.00013102451,0.00005440741],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045379743,0.00012694589,0.00027150387,0.000051890725,0.00011113853,0.0000058609353,0.00030283706,0.00007638967,0.000030396106],"category_scores_gemma":[0.0008722534,0.00010093387,0.000057787554,0.00021979892,0.000055146356,0.00005411663,0.000083838626,0.00011425823,0.0000042146917],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002105774,0.0002508405,0.003000721,0.00013123103,0.000049460057,3.5151874e-7,0.00034313483,3.1670697e-7,0.0028040993,0.9512592,0.039657194,0.002482395],"study_design_scores_gemma":[0.0005046626,0.000099092445,0.0014899313,0.000024712712,0.000023782333,0.000001586458,0.00001507425,0.0000148616355,0.02784672,0.95820475,0.011644362,0.0001304425],"about_ca_topic_score_codex":0.000004540883,"about_ca_topic_score_gemma":5.165667e-7,"teacher_disagreement_score":0.02801283,"about_ca_system_score_codex":0.000022860953,"about_ca_system_score_gemma":0.000015120807,"threshold_uncertainty_score":0.4115964},"labels":[],"label_agreement":null},{"id":"W2074959750","doi":"10.1007/s10288-004-0043-9","title":"Variations on the Roy-Gallai theorem","year":2005,"lang":"en","type":"article","venue":"4OR","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Generalization; Mathematics; Chromatic scale; Simple (philosophy); Combinatorics; Graph; Extension (predicate logic); Elementary proof; Discrete mathematics; Computer science; Mathematical analysis","score_opus":0.032770678829612626,"score_gpt":0.2873123825077866,"score_spread":0.25454170367817397,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2074959750","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3035161,0.00009682719,0.0039473125,0.0132511025,0.0006363608,0.0005051017,0.000027001886,0.00024717493,0.677773],"genre_scores_gemma":[0.9917047,0.0000049606874,0.0031437564,0.0014490088,0.00036150456,0.000012952899,8.657077e-7,0.000014529028,0.003307697],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99946684,0.00006233554,0.000115372895,0.000097396696,0.00013052508,0.00012752635],"domain_scores_gemma":[0.9989072,0.000614903,0.000044217282,0.00038412338,0.000023943188,0.000025605077],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00029591983,0.000079890626,0.000075736454,0.000025572888,0.0002716579,0.00002426874,0.00020801435,0.000044481993,0.0012860959],"category_scores_gemma":[0.00030110942,0.00004212222,0.00006314107,0.00006685759,0.000048899903,0.000029287054,0.00004164544,0.00012006727,0.00010330762],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005931725,0.000025831216,0.00001747263,0.000002718216,0.000019332145,3.9814856e-7,0.00092678564,0.0000073691767,0.000031097636,0.9856867,0.010367742,0.002908583],"study_design_scores_gemma":[0.000099089375,0.00001726829,0.00038559063,0.000007743612,0.000015509255,0.0000025142037,0.000056332552,0.00023161847,0.00048281765,0.95022136,0.04841205,0.000068106085],"about_ca_topic_score_codex":0.0000011035742,"about_ca_topic_score_gemma":0.0000049467144,"teacher_disagreement_score":0.6881886,"about_ca_system_score_codex":0.0000149425605,"about_ca_system_score_gemma":0.000008930089,"threshold_uncertainty_score":0.9996269},"labels":[],"label_agreement":null},{"id":"W2075056990","doi":"10.1007/s00373-012-1132-8","title":"On Graphs Having Maximal Independent Sets of Exactly t Distinct Cardinalities","year":2012,"lang":"en","type":"article","venue":"Graphs and Combinatorics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Saint Mary's University","funders":"","keywords":"Combinatorics; Mathematics; Maximal independent set; Integer (computer science); Degree (music); Independent set; Discrete mathematics; Indifference graph; Chordal graph; Graph; 1-planar graph; Computer science","score_opus":0.030485153982711413,"score_gpt":0.2755864075653491,"score_spread":0.24510125358263768,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2075056990","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9907526,0.0008273598,0.000054801978,0.000011941874,0.00085539423,0.00014909383,0.000028058656,0.00006470762,0.007256084],"genre_scores_gemma":[0.9995476,0.00007444904,0.00016496878,0.000032737284,0.000017697468,0.000011880047,0.0000038529506,0.000028101089,0.000118692304],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985656,0.00009587255,0.0003298012,0.00020314468,0.00041327055,0.0003922808],"domain_scores_gemma":[0.9988093,0.0003998744,0.00018077534,0.00037648974,0.000077745666,0.00015581903],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005354372,0.00024357332,0.0003812197,0.00018964092,0.00027440875,0.00002787602,0.00019081715,0.00013783132,0.000028839715],"category_scores_gemma":[0.00012738959,0.000195163,0.0001803525,0.00023659426,0.00017093663,0.00012562722,0.00014819425,0.00024793865,7.7191163e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030816183,0.00014230555,0.08482332,0.0001334389,0.00006946857,0.0000034555171,0.0012544311,1.5279625e-7,0.00001548491,0.9124277,0.00036151978,0.0007378819],"study_design_scores_gemma":[0.00042889404,0.00014889122,0.058402583,0.000046973288,0.000078628036,0.000019815703,0.00045443198,0.000004189295,0.00033521425,0.9396325,0.00022362989,0.00022428324],"about_ca_topic_score_codex":0.00002292903,"about_ca_topic_score_gemma":0.0000016994986,"teacher_disagreement_score":0.027204737,"about_ca_system_score_codex":0.000020908314,"about_ca_system_score_gemma":0.000011206394,"threshold_uncertainty_score":0.79585165},"labels":[],"label_agreement":null},{"id":"W2075304772","doi":"10.1007/s11856-007-0003-0","title":"Amenable groups, stationary measures and partitions with independent iterates","year":2007,"lang":"en","type":"article","venue":"Israel Journal of Mathematics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Mathematics; Combinatorics; Partition (number theory); Subsequence; Iterated function; Probability measure; Order (exchange); Group (periodic table); Discrete mathematics; Mathematical analysis","score_opus":0.029812578186240946,"score_gpt":0.28858120414663196,"score_spread":0.258768625960391,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2075304772","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9381928,0.00045956156,0.05932264,0.000101117505,0.000113961345,0.00013136596,0.0000073314704,0.000019447378,0.0016517777],"genre_scores_gemma":[0.8986475,0.00007142504,0.1009154,0.00009315482,0.000117607306,0.0000016003537,7.5543477e-7,0.000025463922,0.00012707883],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984693,0.000043181317,0.00063395663,0.000094022165,0.0005392436,0.00022030713],"domain_scores_gemma":[0.9980435,0.0007741914,0.000536634,0.0001785307,0.0003357246,0.00013146191],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015080749,0.00016050064,0.00031132798,0.00018613235,0.00019541763,0.000063686544,0.00016058727,0.0000690133,0.000029102763],"category_scores_gemma":[0.00025289285,0.00010322504,0.00006789113,0.00012985017,0.0001266888,0.00018666433,0.000044784065,0.0002477345,0.0000011802921],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014843064,0.0005183036,0.0047898917,0.00040933865,0.00042037756,0.00023728212,0.011951439,0.000049914852,0.00085288065,0.9765343,0.001126371,0.0029614773],"study_design_scores_gemma":[0.0007646641,0.0002811967,0.0016707077,0.00026838706,0.00015470544,0.0013582836,0.007506682,0.000047992104,0.0016025469,0.9856167,0.00054628844,0.00018184593],"about_ca_topic_score_codex":0.0000016349981,"about_ca_topic_score_gemma":0.000020147167,"teacher_disagreement_score":0.041592766,"about_ca_system_score_codex":0.00003191509,"about_ca_system_score_gemma":0.000038449813,"threshold_uncertainty_score":0.42093948},"labels":[],"label_agreement":null},{"id":"W2076011470","doi":"10.1006/jctb.1999.1938","title":"The Maximum Size of 3-Uniform Hypergraphs Not Containing a Fano Plane","year":2000,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":80,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada; Hungarian Science Foundation; Hungarian Scientific Research Fund; National Security Agency; National Science Foundation","keywords":"Fano plane; Projective plane; Conjecture; Plane (geometry); Mathematics; Combinatorics; Constant (computer programming); Set (abstract data type); Order (exchange); Discrete mathematics; Geometry; Computer science","score_opus":0.012225524026858696,"score_gpt":0.25182557406397077,"score_spread":0.23960005003711207,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2076011470","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.973737,0.00034063729,0.000033226755,0.00021674832,0.0044505983,0.00016671729,0.000013543891,0.000025150921,0.021016393],"genre_scores_gemma":[0.99758554,0.00032660476,0.000696117,0.000077149554,0.0005452199,0.0000022921272,4.0336008e-7,0.000031347536,0.0007353119],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976677,0.00037734,0.0009820182,0.0001111762,0.0005518879,0.0003099172],"domain_scores_gemma":[0.9947706,0.003669848,0.00076412683,0.00040700662,0.00027987402,0.00010856914],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026245671,0.00022979354,0.00059397484,0.0000762627,0.0004673243,0.000058269332,0.000701185,0.0001465803,0.0005480182],"category_scores_gemma":[0.0010968935,0.00013787535,0.00034644033,0.00018425514,0.0004888367,0.00027888647,0.000071974726,0.00045947215,0.0000016442847],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0072864136,0.00006887874,0.000059844795,0.000029204823,0.00026293585,0.00002738498,0.0016661197,0.0000038725175,0.00041340076,0.9837077,0.00034103176,0.0061331787],"study_design_scores_gemma":[0.0016402865,0.0010654042,0.0001210309,0.00007799426,0.00010082396,0.00024973688,0.0014521921,0.000001103935,0.0042350795,0.9735577,0.017340414,0.00015825062],"about_ca_topic_score_codex":0.000002060079,"about_ca_topic_score_gemma":0.0000013623815,"teacher_disagreement_score":0.023848569,"about_ca_system_score_codex":0.000031704214,"about_ca_system_score_gemma":0.00008689216,"threshold_uncertainty_score":0.6000415},"labels":[],"label_agreement":null},{"id":"W2076107705","doi":"10.4153/cmb-2000-046-9","title":"Infinite Classes of Covering Numbers","year":2000,"lang":"en","type":"article","venue":"Canadian Mathematical Bulletin","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"University of Regina; University of Northern British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Block (permutation group theory); Block size; Set (abstract data type); Discrete mathematics; Key (lock)","score_opus":0.018271377423938414,"score_gpt":0.25394460853534734,"score_spread":0.23567323111140892,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2076107705","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.62845165,0.000032276235,0.00014879479,0.00066186127,0.00006050361,0.00018410993,0.000032004446,0.00004917737,0.3703796],"genre_scores_gemma":[0.9874046,0.000014703237,0.0062635704,0.00048170603,0.000058070458,0.00001036976,0.0000023949615,0.00003726069,0.005727369],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99873745,0.000056615685,0.00042041464,0.00018307338,0.00020838296,0.00039405006],"domain_scores_gemma":[0.99849737,0.00060649356,0.00006835403,0.00041876995,0.00004522424,0.0003637716],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00029438216,0.00017603172,0.00034595685,0.00010896858,0.00014027196,0.00002385514,0.00028243658,0.00013366953,0.09147982],"category_scores_gemma":[0.0005289583,0.00015282062,0.0001293018,0.00014381354,0.00020390943,0.000025659478,0.000026871123,0.00017693717,0.0010930466],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015383634,0.000035486803,0.000094481125,0.00028255055,0.000056496378,0.000027765556,0.0009930453,0.000007690385,0.00002959554,0.9692915,0.027227027,0.0019389971],"study_design_scores_gemma":[0.00023310234,0.000030907275,0.00014439237,0.0001348683,0.000036316185,0.000038284958,0.00012816295,0.0000573468,0.0001779477,0.8098496,0.1889401,0.00022894228],"about_ca_topic_score_codex":0.00039837754,"about_ca_topic_score_gemma":0.0004046224,"teacher_disagreement_score":0.36465225,"about_ca_system_score_codex":0.000055936835,"about_ca_system_score_gemma":0.00008168508,"threshold_uncertainty_score":0.9996847},"labels":[],"label_agreement":null},{"id":"W2076127955","doi":"10.1093/imrn/rnt041","title":"A Simple Proof of the Density Hales–Jewett Theorem","year":2013,"lang":"en","type":"article","venue":"International Mathematics Research Notices","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":24,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Simple (philosophy); Library science; Mathematics; Classics; Mathematics education; Computer science; History; Philosophy; Epistemology","score_opus":0.09577013348359627,"score_gpt":0.3975051757312102,"score_spread":0.30173504224761394,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2076127955","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95645636,0.000027247837,0.0012600184,0.0010572406,0.00034402177,0.00084899244,0.00002006231,0.00003451367,0.03995155],"genre_scores_gemma":[0.99074155,0.0000046527593,0.007337172,0.00005265381,0.00013702747,0.000064498774,0.0000019565807,0.00002887505,0.0016315973],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99703324,0.00026648043,0.0005190812,0.00023110048,0.0015977982,0.0003522764],"domain_scores_gemma":[0.99497175,0.002809297,0.00027845378,0.0007375053,0.0011245741,0.000078433615],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0018380805,0.00016146628,0.0002533271,0.00018889163,0.00031827818,0.00012303608,0.0015772108,0.00009946985,0.0010086619],"category_scores_gemma":[0.004398021,0.000094033785,0.00017379891,0.0002654802,0.00063702476,0.00021997506,0.00088668865,0.00043181152,0.000036347203],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011286901,0.00025043977,0.0018558943,0.000265196,0.00013585048,0.0000019704287,0.0023034136,0.000015230037,0.001095746,0.9893061,0.0037392417,0.0010196592],"study_design_scores_gemma":[0.00017703092,0.000028628483,0.0022893,0.00012102849,0.000014586408,0.0000084707435,0.00079502125,0.004389711,0.022335988,0.9692534,0.00048204005,0.000104800514],"about_ca_topic_score_codex":0.00006938515,"about_ca_topic_score_gemma":0.000043152562,"teacher_disagreement_score":0.038319957,"about_ca_system_score_codex":0.000063509746,"about_ca_system_score_gemma":0.00006013544,"threshold_uncertainty_score":0.9999046},"labels":[],"label_agreement":null},{"id":"W2077882202","doi":"10.1007/s00493-014-2862-4","title":"The edge density of critical digraphs","year":2014,"lang":"ceb","type":"article","venue":"COMBINATORICA","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Quest University Canada","funders":"","keywords":"Combinatorics; Mathematics; Digraph; Critical graph; Graph; Corollary; Discrete mathematics; Graph power; Line graph","score_opus":0.01392579734803384,"score_gpt":0.2806488513578588,"score_spread":0.26672305400982493,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2077882202","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.80851257,0.007624532,0.004716403,0.0036266858,0.020631261,0.0010712415,0.000041589483,0.00026188817,0.15351382],"genre_scores_gemma":[0.9986406,0.00018099819,0.00027108102,0.000101216654,0.00015904022,0.0000065678423,9.278875e-7,0.000039264134,0.00060029817],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974541,0.00057740306,0.00061505433,0.00032627062,0.0004899632,0.000537218],"domain_scores_gemma":[0.9920705,0.0058415662,0.00023047962,0.0013106116,0.00035983266,0.00018700048],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013031687,0.0002998086,0.0005387713,0.00007271362,0.0011020873,0.000069771886,0.0008412211,0.00025599016,0.00006165656],"category_scores_gemma":[0.0045091636,0.00020094162,0.0003450233,0.00034587222,0.0012779549,0.00006281111,0.00047238037,0.0004917571,0.000025027939],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034743716,0.0002680216,0.001510306,0.0003087681,0.000074369396,0.0000030511346,0.0008539459,9.8363905e-8,0.000045196506,0.98717237,0.0063507333,0.003378416],"study_design_scores_gemma":[0.00042723754,0.00023325619,0.003157936,0.000067358815,0.00017838864,0.00000957824,0.00016740129,0.00017765912,0.001528589,0.9744638,0.0193455,0.00024327454],"about_ca_topic_score_codex":0.000008362223,"about_ca_topic_score_gemma":0.0000022006088,"teacher_disagreement_score":0.19012803,"about_ca_system_score_codex":0.00003988321,"about_ca_system_score_gemma":0.000043835866,"threshold_uncertainty_score":0.8476476},"labels":[],"label_agreement":null},{"id":"W2078027397","doi":"10.1016/s0012-365x(01)00440-x","title":"Isomorphism certificates for undirected graphs","year":2002,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Mathematics; Combinatorics; Subgraph isomorphism problem; Graph isomorphism; Induced subgraph isomorphism problem; Discrete mathematics; Isomorphism (crystallography); Graph; Grid; Line graph; Voltage graph","score_opus":0.08590900831975816,"score_gpt":0.3012478759326275,"score_spread":0.2153388676128693,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2078027397","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.70891416,0.002240555,0.1364126,0.0045541674,0.0030023477,0.0066224067,0.0006274447,0.003138661,0.13448767],"genre_scores_gemma":[0.87765276,0.00006235883,0.11749576,0.00017904976,0.0001289133,0.00016086893,0.000021084312,0.00012949703,0.0041697193],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99838644,0.0000429956,0.000547405,0.00030921315,0.00027796274,0.00043599465],"domain_scores_gemma":[0.9978086,0.0010101256,0.00024260298,0.0007116968,0.00011077223,0.0001162207],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003060779,0.00030589252,0.00044815976,0.00013680769,0.00040043864,0.00006760979,0.00041176495,0.00015335274,0.00060603954],"category_scores_gemma":[0.00069962954,0.0002331838,0.00030210777,0.00024113119,0.00018079847,0.00009446784,0.00008750152,0.00015054541,0.000036029316],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009009067,0.00013910735,0.0000480691,0.00031710562,0.00011710704,0.0000028521113,0.0038117373,0.000001082862,0.0004642609,0.9708507,0.023511399,0.00072758965],"study_design_scores_gemma":[0.00044436892,0.00005942123,0.000022573387,0.000064880056,0.00013227596,0.000018969982,0.00035306808,0.006142127,0.001870981,0.98546124,0.005083029,0.00034706006],"about_ca_topic_score_codex":0.0000013208332,"about_ca_topic_score_gemma":0.000002719256,"teacher_disagreement_score":0.16873862,"about_ca_system_score_codex":0.000023663591,"about_ca_system_score_gemma":0.0000045947204,"threshold_uncertainty_score":0.95089597},"labels":[],"label_agreement":null},{"id":"W2078612831","doi":"10.2140/involve.2015.8.119","title":"An Erdős–Ko–Rado theorem for subset partitions","year":2015,"lang":"en","type":"article","venue":"Involve a Journal of Mathematics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Partition (number theory); Mathematics; Type (biology); Biology","score_opus":0.13387400126944243,"score_gpt":0.36445169753403783,"score_spread":0.2305776962645954,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2078612831","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8713312,0.0006264307,0.12329187,0.00031219062,0.0010123028,0.0005314551,0.00008257387,0.0000737737,0.0027381552],"genre_scores_gemma":[0.7739649,0.00003231716,0.22512412,0.00017269452,0.0005249169,0.000012965807,0.0000047014673,0.00006109972,0.00010230587],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980066,0.00011907501,0.0009309309,0.00013155113,0.00050381874,0.00030803194],"domain_scores_gemma":[0.99641377,0.0011294651,0.00082105095,0.0005209073,0.00077904516,0.00033575183],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023338655,0.00022629242,0.0005329527,0.000174418,0.00017672795,0.0000789787,0.000580577,0.00013752081,0.000053523443],"category_scores_gemma":[0.001933842,0.00016004813,0.00031249397,0.00015166716,0.00016514647,0.00032359213,0.000055354332,0.00025674715,0.0000051500333],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008336139,0.00058441487,0.0001080173,0.0002023353,0.00018484535,0.000019825147,0.012657286,0.00006794488,0.00026646096,0.96960145,0.01572731,0.00049677317],"study_design_scores_gemma":[0.0010061732,0.00061771524,0.0000099040235,0.00014451076,0.00021708131,0.0002670884,0.005059307,0.0008449338,0.0012907034,0.98767173,0.0026712578,0.00019959349],"about_ca_topic_score_codex":8.351606e-7,"about_ca_topic_score_gemma":0.0000060821076,"teacher_disagreement_score":0.10183224,"about_ca_system_score_codex":0.000058195554,"about_ca_system_score_gemma":0.00013439031,"threshold_uncertainty_score":0.6526574},"labels":[],"label_agreement":null},{"id":"W2079177402","doi":"10.1002/1097-0118(200006)34:2<113::aid-jgt1>3.0.co;2-0","title":"Partitioning infinite trees","year":2000,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Combinatorics; Mathematics; Monochromatic color; Degree (music); Graph; Discrete mathematics; Upper and lower bounds; Tree (set theory); Colored","score_opus":0.022902301243572076,"score_gpt":0.2836758935797546,"score_spread":0.2607735923361825,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2079177402","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.965255,0.00061895064,0.0009253093,0.00008902725,0.00034454433,0.000053063326,0.000003846753,0.000029316734,0.032680918],"genre_scores_gemma":[0.99505764,0.00022947983,0.0031533074,0.0002597056,0.00030871664,0.0000012263994,3.6878154e-7,0.000021696342,0.00096786354],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99863344,0.00026484337,0.0005411032,0.00008680742,0.00027528085,0.00019854115],"domain_scores_gemma":[0.9985628,0.0007037568,0.00030770947,0.0002254492,0.00010171756,0.0000985686],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0014548907,0.0001360183,0.00028663973,0.00021833238,0.0002279188,0.000034309378,0.00027456597,0.00007851925,0.0027694616],"category_scores_gemma":[0.0002510437,0.00009585149,0.00032001064,0.00020085582,0.00017323976,0.00020571481,0.000021106647,0.00030867112,0.000009739278],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002798048,0.00006762529,0.00083800644,0.00001656546,0.000159793,0.000042516294,0.0016707904,0.000039867176,0.00014550622,0.96899706,0.0020117168,0.025730735],"study_design_scores_gemma":[0.00044716976,0.00013261833,0.0020407655,0.000084309904,0.000081587146,0.00021907625,0.00023076701,0.000003848355,0.00039824384,0.9901043,0.0061391857,0.00011810413],"about_ca_topic_score_codex":5.599269e-7,"about_ca_topic_score_gemma":0.0000015328151,"teacher_disagreement_score":0.031713054,"about_ca_system_score_codex":0.000012524,"about_ca_system_score_gemma":0.000021520169,"threshold_uncertainty_score":0.9981421},"labels":[],"label_agreement":null},{"id":"W2079449107","doi":"10.1016/j.disc.2012.02.018","title":"Almost all cop-win graphs contain a universal vertex","year":2012,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada; Mitacs","keywords":"Mathematics; Combinatorics; Vertex (graph theory); Discrete mathematics; Graph","score_opus":0.03664615384126237,"score_gpt":0.3029478184586781,"score_spread":0.2663016646174157,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2079449107","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.91562814,0.000409302,0.008496595,0.00023290387,0.0010908007,0.0008606381,0.0001102257,0.0004360106,0.072735384],"genre_scores_gemma":[0.9706813,0.000044016677,0.027413035,0.00030092703,0.00012515491,0.000019570278,0.000024221994,0.000097012795,0.0012947319],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978786,0.00012214643,0.0005237271,0.00025049565,0.00046659732,0.00075842015],"domain_scores_gemma":[0.99786353,0.0007002616,0.0002594323,0.0008059933,0.00007414144,0.000296666],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00073521596,0.0003956245,0.00053751294,0.00014505233,0.00026853336,0.000053166226,0.00043278618,0.00020399368,0.0004914752],"category_scores_gemma":[0.0004104892,0.00031050062,0.00029291576,0.00022955205,0.00022498051,0.0002852716,0.00025883655,0.00030053873,0.000075188356],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022572554,0.00015676695,0.0010726887,0.00023089707,0.0001976035,0.000010151335,0.010873909,6.495973e-7,0.00014855646,0.98020613,0.006879218,0.00020087439],"study_design_scores_gemma":[0.0007886225,0.00007080748,0.00046406468,0.000118385346,0.00028826518,0.000067558394,0.0024370763,0.00047076997,0.00064312725,0.9854288,0.008654241,0.00056828966],"about_ca_topic_score_codex":0.000017212,"about_ca_topic_score_gemma":0.000008425587,"teacher_disagreement_score":0.07144065,"about_ca_system_score_codex":0.00006826408,"about_ca_system_score_gemma":0.00002471714,"threshold_uncertainty_score":0.99993473},"labels":[],"label_agreement":null},{"id":"W2079465187","doi":"10.1016/j.disc.2006.06.035","title":"Large forbidden trade volumes and edge packings of random graphs","year":2007,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Combinatorics; Mathematics; Disjoint sets; Disjoint union (topology); Discrete mathematics; Graph; Pairwise comparison","score_opus":0.018677608037279168,"score_gpt":0.28845611920286046,"score_spread":0.26977851116558127,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2079465187","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9494697,0.00042797037,0.036842834,0.00006807303,0.00018344383,0.00049324485,0.00006148274,0.000101708625,0.012351575],"genre_scores_gemma":[0.97428983,0.00005254655,0.025256345,0.000057495294,0.000056526653,0.0000061543965,0.0000053714493,0.00005229834,0.00022340895],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982767,0.000040975152,0.0006812712,0.0002224178,0.00035097156,0.0004276464],"domain_scores_gemma":[0.9980551,0.00096457754,0.00033683414,0.00047946768,0.000044693967,0.00011933384],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014308055,0.00026262834,0.00058258115,0.00015900187,0.00019271563,0.00002953789,0.00025970725,0.00015662804,0.00006291204],"category_scores_gemma":[0.000481041,0.00019616717,0.00021664325,0.00019594324,0.00024023831,0.00010510926,0.00015153206,0.00018275602,0.0000013702495],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005280759,0.00009261499,0.00093790493,0.00074885384,0.00011781553,0.000007491775,0.015757151,9.801549e-8,0.0004445613,0.98028475,0.0007271484,0.0008287832],"study_design_scores_gemma":[0.0015452086,0.00006362017,0.00073991646,0.00015054234,0.00015268501,0.000033099648,0.0036491253,0.00030440706,0.0035167863,0.9888994,0.00067856413,0.0002666143],"about_ca_topic_score_codex":0.000002140846,"about_ca_topic_score_gemma":0.000012484402,"teacher_disagreement_score":0.024820184,"about_ca_system_score_codex":0.000011262679,"about_ca_system_score_gemma":0.000010942342,"threshold_uncertainty_score":0.7999465},"labels":[],"label_agreement":null},{"id":"W2080401458","doi":"10.4310/joc.2013.v4.n4.a4","title":"A Sidon-type condition on set systems","year":2013,"lang":"en","type":"preprint","venue":"Journal of Combinatorics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Lambda; Constant (computer programming); Combinatorics; Type (biology); Upper and lower bounds; Closure (psychology); Probabilistic logic; Set (abstract data type); Value (mathematics); Discrete mathematics; Physics; Statistics; Mathematical analysis; Computer science; Quantum mechanics","score_opus":0.05795207938737249,"score_gpt":0.3350437176936293,"score_spread":0.27709163830625677,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2080401458","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96703297,0.0012203553,0.00036218413,0.00013877625,0.02454075,0.00044242092,0.00003006809,0.00004510127,0.006187385],"genre_scores_gemma":[0.9980608,0.00030697515,0.0002218996,0.00007214078,0.000644484,0.0000051151455,0.0000077726345,0.00005388688,0.000626887],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99751943,0.0002679446,0.00097442383,0.00018416514,0.0008200467,0.00023398675],"domain_scores_gemma":[0.99561006,0.000638173,0.0019820286,0.000573456,0.001035865,0.00016043734],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00087517936,0.0003353574,0.0008318736,0.00033962063,0.0001331617,0.00015118299,0.0006345869,0.0005344982,0.00006907602],"category_scores_gemma":[0.0006306821,0.00025040234,0.00032787322,0.00014781194,0.000060845923,0.00009929247,0.00029174864,0.0016732835,0.0000148264335],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005556529,0.00013985837,0.00010314037,0.00059241353,0.00027171895,0.000061189,0.00059360795,0.00019536642,0.000016514383,0.93256813,0.065339126,0.000063353575],"study_design_scores_gemma":[0.0005445245,0.0004504341,0.00017028842,0.0007307364,0.00017492007,0.0001485114,0.00015303856,0.00013179592,0.00009111322,0.99214256,0.0050020423,0.0002600137],"about_ca_topic_score_codex":0.000004841086,"about_ca_topic_score_gemma":1.3097234e-7,"teacher_disagreement_score":0.06033708,"about_ca_system_score_codex":0.00023234976,"about_ca_system_score_gemma":0.00015916923,"threshold_uncertainty_score":0.9999948},"labels":[],"label_agreement":null},{"id":"W2081711724","doi":"10.7151/dmgt.1221","title":"Generalised irredundance in graphs: Nordhaus-Gaddum bounds","year":2004,"lang":"en","type":"article","venue":"Discussiones Mathematicae Graph Theory","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.027726365848837992,"score_gpt":0.29879046669518233,"score_spread":0.27106410084634436,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2081711724","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9703621,0.000609667,0.0112215625,0.0007365323,0.0008913622,0.0010094037,0.00004165166,0.000479843,0.014647862],"genre_scores_gemma":[0.9794958,0.00008951191,0.018601723,0.00035452953,0.000112874186,0.00020613948,0.000015835643,0.00014518666,0.0009783644],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99601924,0.0004109247,0.001162165,0.0007788885,0.00070453493,0.00092421524],"domain_scores_gemma":[0.99710816,0.00067481736,0.0003858155,0.0014711501,0.00009330511,0.0002667777],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0018935209,0.0006825735,0.0009248909,0.00074603106,0.0006195897,0.00011488415,0.00097259873,0.00030572084,0.00043567154],"category_scores_gemma":[0.0006951554,0.0004376683,0.0005593724,0.0011608308,0.00074087706,0.00039005268,0.0003159858,0.00054246915,0.000048991125],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013177255,0.00053005625,0.0003468777,0.0003066841,0.00009782943,0.000046098907,0.0072198426,0.000031525684,0.0006938295,0.98945713,0.00029746655,0.0008409097],"study_design_scores_gemma":[0.0017017453,0.00007034572,0.001314247,0.00054324744,0.00008404303,0.000057476725,0.0017764298,0.000017600953,0.0011485505,0.99236774,0.00022539169,0.00069320237],"about_ca_topic_score_codex":0.000011089865,"about_ca_topic_score_gemma":0.00004261563,"teacher_disagreement_score":0.013669498,"about_ca_system_score_codex":0.00009581473,"about_ca_system_score_gemma":0.00007685172,"threshold_uncertainty_score":0.99980754},"labels":[],"label_agreement":null},{"id":"W2081849480","doi":"10.1016/j.jnt.2009.09.018","title":"Sets whose sumset avoids a thin sequence","year":2009,"lang":"en","type":"article","venue":"Journal of Number Theory","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Mathematics; Sequence (biology); Combinatorics; Discrete mathematics; Chemistry","score_opus":0.0443526848391799,"score_gpt":0.3522663174946456,"score_spread":0.3079136326554657,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2081849480","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95566577,0.00030177063,0.0011969177,0.00069535174,0.0009361646,0.00014017706,0.0000655741,0.000061807244,0.040936477],"genre_scores_gemma":[0.9875259,0.000045529036,0.009638681,0.0013278752,0.0003677672,7.632712e-7,0.0000017498481,0.00002349298,0.0010682351],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99817675,0.00038577078,0.0006040496,0.00012990985,0.00042898257,0.00027454566],"domain_scores_gemma":[0.9978278,0.000941678,0.00052594434,0.0003609791,0.00019100221,0.00015254023],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00203473,0.00019850436,0.00039193805,0.00009872239,0.0001728405,0.0000465279,0.0004936175,0.00013419407,0.0019680685],"category_scores_gemma":[0.0009597973,0.00013772979,0.0002875699,0.00015082277,0.00012796269,0.00027811533,0.000051502262,0.0005773288,0.000026648622],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025702608,0.00013078503,0.00025617704,0.000027755124,0.000110188994,0.00025694654,0.003445952,0.000005997277,0.00050458265,0.9410135,0.04602829,0.007962765],"study_design_scores_gemma":[0.00044103348,0.00013083273,0.0005284063,0.00013633567,0.00006770375,0.0013375469,0.0003302764,0.000016290083,0.00049701636,0.99070287,0.005639891,0.00017178779],"about_ca_topic_score_codex":4.801914e-7,"about_ca_topic_score_gemma":5.837484e-7,"teacher_disagreement_score":0.049689345,"about_ca_system_score_codex":0.000056458553,"about_ca_system_score_gemma":0.000066880566,"threshold_uncertainty_score":0.9989443},"labels":[],"label_agreement":null},{"id":"W2081918372","doi":"10.1016/j.jcta.2008.01.005","title":"Bounds on some van der Waerden numbers","year":2008,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Van der Waerden's theorem; Mathematics; Combinatorics","score_opus":0.022948755705174434,"score_gpt":0.27580125580153364,"score_spread":0.2528525000963592,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2081918372","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97097534,0.00023600069,0.00005746731,0.00021854417,0.010424799,0.00012415009,0.0000044075955,0.000042729414,0.017916586],"genre_scores_gemma":[0.99553776,0.00012858845,0.00071216567,0.00024158064,0.00163281,0.0000021556245,5.337516e-7,0.000047683436,0.0016967093],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99792564,0.0003564802,0.00065770943,0.00014343552,0.0006091524,0.0003075747],"domain_scores_gemma":[0.9978437,0.0008032986,0.0005677615,0.0003773213,0.00023988754,0.00016802938],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011607587,0.00025342737,0.0005448133,0.00016155338,0.00051270705,0.000044343735,0.00049778534,0.00017181871,0.00039382515],"category_scores_gemma":[0.0007269182,0.00018528958,0.00034893173,0.00014712551,0.00037798678,0.00048826094,0.00009596659,0.000536706,0.000009699871],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016940057,0.0001485156,0.000105284096,0.000021487167,0.00023192681,0.00016826813,0.0024310814,0.000004167267,0.00009917659,0.9882178,0.006660174,0.00021811936],"study_design_scores_gemma":[0.0015146522,0.00083157344,0.00010471264,0.00005627595,0.00007484019,0.000723182,0.0003819864,4.3714996e-7,0.0019411395,0.97475183,0.01940602,0.00021335755],"about_ca_topic_score_codex":8.2837784e-7,"about_ca_topic_score_gemma":2.3672291e-7,"teacher_disagreement_score":0.02456246,"about_ca_system_score_codex":0.00008398317,"about_ca_system_score_gemma":0.00011026334,"threshold_uncertainty_score":0.75558895},"labels":[],"label_agreement":null},{"id":"W2083414707","doi":"10.1017/s0963548313000175","title":"The Entropy of Random-Free Graphons and Properties","year":2013,"lang":"en","type":"preprint","venue":"Combinatorics Probability Computing","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Conjecture; Random graph; Combinatorics; Mathematics; Entropy (arrow of time); Graph; Discrete mathematics; Physics; Thermodynamics","score_opus":0.041066510418671716,"score_gpt":0.2611840604611839,"score_spread":0.2201175500425122,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2083414707","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99126965,0.0028894024,0.00085240864,0.00031175025,0.001960939,0.001872023,0.00001027127,0.00014436824,0.0006892077],"genre_scores_gemma":[0.99616706,0.00017334639,0.0034257402,0.000014036986,0.00007713174,0.00004391756,0.000002072626,0.000041008443,0.00005570636],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9969223,0.00056866807,0.0010113769,0.00058320386,0.00047706667,0.0004373423],"domain_scores_gemma":[0.9942911,0.0022846072,0.0007647667,0.0020109236,0.00054527906,0.00010327482],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0023253292,0.00043644075,0.0008333851,0.000088174085,0.000850288,0.00016126625,0.0013778321,0.00033543032,0.000004279861],"category_scores_gemma":[0.003979037,0.00027332167,0.00029877247,0.00018039101,0.0009539772,0.00004882607,0.00544829,0.0010193066,4.5270167e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004789553,0.00011660958,0.002285562,0.0017663055,0.00015842349,6.228964e-7,0.0022860772,0.00003152807,0.00003548518,0.9912259,0.0004521981,0.001593382],"study_design_scores_gemma":[0.0009716253,0.00005230576,0.00064418436,0.00028745545,0.00009192908,0.0000049963933,0.00011314648,0.0027138938,0.00047290087,0.9942458,0.000106956526,0.0002947957],"about_ca_topic_score_codex":0.00004466515,"about_ca_topic_score_gemma":0.0000040326613,"teacher_disagreement_score":0.0048974105,"about_ca_system_score_codex":0.000081348284,"about_ca_system_score_gemma":0.00010512376,"threshold_uncertainty_score":0.9999719},"labels":[],"label_agreement":null},{"id":"W2084490360","doi":"10.1016/j.ejc.2003.10.006","title":"Stable sets of maximal size in Kneser-type graphs","year":2003,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":123,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Mathematics; Combinatorics; Automorphism; Transitive relation; Vertex (graph theory); Indifference graph; Chordal graph; Maximal independent set; Discrete mathematics; 1-planar graph; Graph","score_opus":0.027114038223941424,"score_gpt":0.2683398913297358,"score_spread":0.24122585310579436,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2084490360","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9593793,0.00048258432,0.00012917716,0.000020229385,0.001186396,0.00006679782,0.0000017318382,0.000009013558,0.038724758],"genre_scores_gemma":[0.99677306,0.0001144147,0.0027801797,0.000030108287,0.000019081133,1.11010586e-7,1.4801272e-7,0.000038621718,0.0002442996],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99771947,0.00078173523,0.00078644435,0.000102220285,0.0003809416,0.00022919306],"domain_scores_gemma":[0.9982037,0.000479925,0.00059494586,0.00028232238,0.00033774553,0.00010138601],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024376586,0.00015703669,0.00039484826,0.00019752524,0.00006471826,0.000017748851,0.00038128145,0.000037307,0.000097909506],"category_scores_gemma":[0.0017774131,0.0001261513,0.00014282526,0.0005298095,0.00007520247,0.00012793513,0.00006258879,0.00040309242,0.0000025937225],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009686145,0.00026597784,0.01290081,0.00008540968,0.00005753293,0.0003123891,0.00093274727,0.000015332196,0.0002973953,0.9831287,0.0016151137,0.00029168],"study_design_scores_gemma":[0.0015525664,0.00049636594,0.010147518,0.00009860331,0.000037189242,0.00012818267,0.00022058189,0.0000034329173,0.0011957467,0.98183554,0.004124432,0.00015985442],"about_ca_topic_score_codex":4.880527e-7,"about_ca_topic_score_gemma":2.3396183e-7,"teacher_disagreement_score":0.038480457,"about_ca_system_score_codex":0.000032361208,"about_ca_system_score_gemma":0.000059057795,"threshold_uncertainty_score":0.51443005},"labels":[],"label_agreement":null},{"id":"W2084966456","doi":"10.1016/j.jda.2012.10.005","title":"On a conjecture of Erdős for multiplicities of cliques","year":2012,"lang":"fr","type":"article","venue":"Journal of Discrete Algorithms","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Combinatorics; Mathematics; Upper and lower bounds; Conjecture; Complement (music); Order (exchange); Graph; Counterexample; Limit (mathematics); Discrete mathematics","score_opus":0.032779831028874655,"score_gpt":0.3383146528657846,"score_spread":0.30553482183690994,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2084966456","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.88639563,0.04628395,0.051971324,0.0013172716,0.00842006,0.0009528885,0.0014257905,0.00001752703,0.0032155665],"genre_scores_gemma":[0.9189276,0.00074067886,0.07770365,0.00010749632,0.001530081,0.000004005531,0.0000033166423,0.000056909183,0.0009262663],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997506,0.00019468818,0.0012938055,0.00010986486,0.00047459846,0.00042103365],"domain_scores_gemma":[0.9953035,0.0018230715,0.0019044678,0.0003082437,0.00048102497,0.00017968452],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012264879,0.00029371234,0.000985723,0.0002225634,0.00009320268,0.0000151900795,0.00035144782,0.00030241272,0.00015015875],"category_scores_gemma":[0.00078604365,0.00020819683,0.0008024313,0.00012060909,0.00042396816,0.00028190538,0.000078115634,0.0004257389,6.6676427e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00090913527,0.0005990372,0.00084036146,0.0024287635,0.0014518234,0.000008071279,0.018129202,0.000090132526,0.001192997,0.9445655,0.006763344,0.023021631],"study_design_scores_gemma":[0.003759199,0.004630536,0.0012293729,0.0027284103,0.0013034835,0.00029048033,0.004332203,0.000961659,0.05690874,0.911788,0.011545019,0.00052291533],"about_ca_topic_score_codex":0.000014887985,"about_ca_topic_score_gemma":0.0000019910185,"teacher_disagreement_score":0.055715743,"about_ca_system_score_codex":0.00005260999,"about_ca_system_score_gemma":0.00007656108,"threshold_uncertainty_score":0.84900206},"labels":[],"label_agreement":null},{"id":"W2085045539","doi":"10.1016/j.disc.2008.01.023","title":"Measure preserving homomorphisms and independent sets in tensor graph powers","year":2008,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Amirkabir University of Technology","keywords":"Mathematics; Homomorphism; Measure (data warehouse); Tensor (intrinsic definition); Discrete mathematics; Graph; Combinatorics; Upper and lower bounds; Pure mathematics; Mathematical analysis; Data mining; Computer science","score_opus":0.03993079443253282,"score_gpt":0.2781595298436143,"score_spread":0.23822873541108147,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2085045539","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9860052,0.0003264025,0.0016914472,0.00012042692,0.00014595385,0.0005133297,0.00002587569,0.000110216635,0.01106119],"genre_scores_gemma":[0.97766346,0.00010189255,0.02171569,0.000077851364,0.00003188667,0.000028386385,0.0000043587706,0.000062959116,0.0003135469],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980172,0.00009612563,0.00055901863,0.00034448018,0.00055631646,0.0004268748],"domain_scores_gemma":[0.99852777,0.00040942538,0.00020363578,0.0006437822,0.00007385121,0.00014156036],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00060589676,0.00032472078,0.00051272905,0.00023457216,0.00029641486,0.00003918169,0.00037382854,0.0001904939,0.000091757785],"category_scores_gemma":[0.0005545279,0.00025372958,0.00012938205,0.0002645432,0.00025970477,0.00016411107,0.00028803875,0.0003609263,0.0000049695964],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000756511,0.00036110074,0.022121172,0.001155539,0.0002515252,0.0004138674,0.056680724,0.00002670202,0.00046427286,0.91596586,0.0019739016,0.0005096817],"study_design_scores_gemma":[0.00085554784,0.00005586714,0.008335775,0.00023580636,0.00005548742,0.00033801232,0.0021380696,0.00074735284,0.00033380568,0.9864043,0.000068206115,0.00043179796],"about_ca_topic_score_codex":0.000012247442,"about_ca_topic_score_gemma":0.000026189084,"teacher_disagreement_score":0.07043841,"about_ca_system_score_codex":0.00003742871,"about_ca_system_score_gemma":0.000025690655,"threshold_uncertainty_score":0.9999915},"labels":[],"label_agreement":null},{"id":"W2085975956","doi":"10.1016/j.jcta.2015.02.006","title":"Differential calculus on graphon space","year":2015,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Air Force Office of Scientific Research; Natural Sciences and Engineering Research Council of Canada; Defense Advanced Research Projects Agency; UPS Foundation; National Science Foundation","keywords":"Homomorphism; Mathematics; Combinatorics; Multigraph; Discrete mathematics; Graph","score_opus":0.0310953572690605,"score_gpt":0.28821467349880814,"score_spread":0.25711931622974765,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2085975956","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9697005,0.00010312786,0.00089553226,0.00024301953,0.020077651,0.0001333527,0.000005321104,0.00003970503,0.0088017685],"genre_scores_gemma":[0.99728304,0.000017754212,0.0004726127,0.00005472414,0.0016008123,0.0000016561065,4.4292096e-7,0.00003439985,0.0005345531],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979692,0.00044985375,0.00053725106,0.00013021017,0.00065523235,0.00025825252],"domain_scores_gemma":[0.99803174,0.000470082,0.0005384452,0.00033620824,0.00036270032,0.00026083618],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011875435,0.00023363956,0.0005098461,0.00018638687,0.00016479882,0.000060824288,0.00042708206,0.00015213566,0.00015203899],"category_scores_gemma":[0.0011309906,0.00016076582,0.00030062709,0.00017663794,0.00020187839,0.00022903491,0.00010962446,0.00045688025,0.0000035808164],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0039510126,0.00014560382,0.0000499919,0.000016678187,0.00014174063,0.00005778648,0.0019382492,0.0000035172295,0.00015846796,0.98810923,0.005114026,0.00031367343],"study_design_scores_gemma":[0.0023830417,0.0015359072,0.00004774632,0.000058984115,0.0000883208,0.0001475415,0.00082049245,0.0000019240279,0.005354549,0.9818045,0.007573436,0.00018358762],"about_ca_topic_score_codex":0.0000010166963,"about_ca_topic_score_gemma":3.2796387e-7,"teacher_disagreement_score":0.027582524,"about_ca_system_score_codex":0.000072257615,"about_ca_system_score_gemma":0.00008951263,"threshold_uncertainty_score":0.655584},"labels":[],"label_agreement":null},{"id":"W2086013184","doi":"10.1016/j.disc.2010.12.006","title":"The quasi order of graphs on an ordinal","year":2011,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"National Science Foundation","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Graph; Discrete mathematics; Order (exchange)","score_opus":0.053423251499947096,"score_gpt":0.305496046871558,"score_spread":0.2520727953716109,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2086013184","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.87034816,0.00007483492,0.0076016216,0.000058029233,0.00043859362,0.0005439627,0.00003725559,0.00014428637,0.12075324],"genre_scores_gemma":[0.9545577,0.000024793511,0.04479291,0.00004843176,0.000041869505,0.000019741447,0.000002921203,0.000053997483,0.00045761504],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985259,0.00010565243,0.0005091017,0.0001921004,0.00037347837,0.00029375317],"domain_scores_gemma":[0.99786544,0.0005927735,0.00030569156,0.0010146998,0.00013589248,0.00008550925],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00071987626,0.00022878604,0.00031978596,0.0000737864,0.00035681995,0.000025989933,0.0006027419,0.00009704544,0.00015153774],"category_scores_gemma":[0.00047185106,0.00012569217,0.00015700636,0.00022036945,0.0003334304,0.00008128723,0.000106649306,0.00019077225,0.0000082380875],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004579589,0.00021186913,0.00010581731,0.000104749655,0.00007196717,0.0000026067923,0.008428253,3.5061467e-7,0.000036373844,0.9897998,0.0002721244,0.0009203189],"study_design_scores_gemma":[0.0002048287,0.00034014328,0.00017738991,0.00006026215,0.000067162844,0.000010442922,0.0021026372,0.0002917584,0.0015077,0.99483585,0.00022304503,0.00017877332],"about_ca_topic_score_codex":0.0000071586983,"about_ca_topic_score_gemma":0.000013588632,"teacher_disagreement_score":0.12029563,"about_ca_system_score_codex":0.00000947257,"about_ca_system_score_gemma":0.000019246485,"threshold_uncertainty_score":0.5125578},"labels":[],"label_agreement":null},{"id":"W2088312182","doi":"10.1016/j.jctb.2008.08.004","title":"The Erdös–Pósa property for matroid circuits","year":2008,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Matroid; Disjoint sets; Combinatorics; Rank (graph theory); Graphic matroid; Mathematics; Matroid partitioning; Constant (computer programming); Bounded function; Discrete mathematics; Computer science; Mathematical analysis","score_opus":0.03265438713067384,"score_gpt":0.2751685194414888,"score_spread":0.24251413231081495,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2088312182","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9115217,0.0026135463,0.004608215,0.0019230534,0.051325236,0.0017412893,0.00004246652,0.00015683654,0.026067683],"genre_scores_gemma":[0.99292606,0.00027225123,0.0009994076,0.000085648695,0.0020823462,0.000014599623,5.962347e-7,0.000049823502,0.0035692952],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99807525,0.00032437666,0.000721024,0.00012067682,0.00043397426,0.00032470934],"domain_scores_gemma":[0.996464,0.0018474658,0.0006436129,0.0003805755,0.00055300567,0.000111326626],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023266526,0.00021022589,0.00043710534,0.00006841396,0.0012550482,0.000060565515,0.0006828363,0.00012458503,0.000041338284],"category_scores_gemma":[0.0018433781,0.00009888888,0.00037592047,0.00012555024,0.0004622248,0.00031639313,0.00009298916,0.00034827844,0.0000014434949],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012595055,0.00006753155,0.000030568706,0.00003612585,0.0001685359,0.000020860054,0.0015422946,9.62801e-7,0.0002607785,0.9851287,0.009903983,0.0015801813],"study_design_scores_gemma":[0.0012462537,0.00062664197,0.00003536714,0.000031168383,0.00006162518,0.00062194513,0.00046462717,0.0000013485975,0.0024160799,0.8893031,0.105048224,0.00014363368],"about_ca_topic_score_codex":3.6733582e-7,"about_ca_topic_score_gemma":4.0329465e-7,"teacher_disagreement_score":0.09582559,"about_ca_system_score_codex":0.000052193664,"about_ca_system_score_gemma":0.00014539632,"threshold_uncertainty_score":0.9652943},"labels":[],"label_agreement":null},{"id":"W2088620080","doi":"10.1016/j.jcta.2011.03.004","title":"Enumerating isodiametric and isoperimetric polygons","year":2011,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Simon Fraser University","keywords":"Combinatorics; Mathematics; Isoperimetric inequality; Perimeter; Regular polygon; Integer (computer science); Upper and lower bounds; Geometry; Mathematical analysis","score_opus":0.039581387715692355,"score_gpt":0.27047583634923983,"score_spread":0.23089444863354747,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2088620080","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97568196,0.0024897424,0.0008187007,0.00003321619,0.0058760005,0.00013843359,0.0000036506085,0.000032615422,0.01492568],"genre_scores_gemma":[0.99105453,0.00015732105,0.008029675,0.00004616304,0.00050795934,0.0000013520415,1.09563956e-7,0.00002838629,0.00017451405],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984566,0.00032485326,0.00059555547,0.00011958757,0.00027971185,0.00022371905],"domain_scores_gemma":[0.99804735,0.0008181191,0.0005458339,0.00022652982,0.00022258858,0.00013955319],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017312235,0.00018584017,0.00044572575,0.0004699621,0.00027468818,0.0000489661,0.00030183903,0.00011756238,0.00027211578],"category_scores_gemma":[0.0019872747,0.0001364245,0.0001582201,0.0005468525,0.00020649747,0.00040087505,0.00013716509,0.00035434472,0.0000010100517],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005187514,0.00008614427,0.0004981811,0.00002609332,0.00012427564,0.000026642521,0.0034286636,6.531524e-8,0.00018313111,0.99150807,0.0002201673,0.0033797887],"study_design_scores_gemma":[0.0008128525,0.0007685926,0.0004707348,0.00003280935,0.000094566174,0.00032272685,0.0009625949,9.5052354e-7,0.0038580592,0.9914237,0.0010923834,0.00016003218],"about_ca_topic_score_codex":0.000002745065,"about_ca_topic_score_gemma":2.0950726e-7,"teacher_disagreement_score":0.0153725585,"about_ca_system_score_codex":0.000025442652,"about_ca_system_score_gemma":0.00004832227,"threshold_uncertainty_score":0.55632293},"labels":[],"label_agreement":null},{"id":"W2089189975","doi":"10.1016/j.aim.2009.08.006","title":"On the chromatic number of random d-regular graphs","year":2009,"lang":"en","type":"article","venue":"Advances in Mathematics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":27,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Combinatorics; Chromatic scale; Random graph; Integer (computer science); Discrete mathematics; Value (mathematics); Graph; Statistics","score_opus":0.01292752373686247,"score_gpt":0.3047185920263187,"score_spread":0.2917910682894562,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2089189975","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9300378,0.00060119265,0.0037945085,0.00023634473,0.00022826185,0.00070697657,0.0000068534005,0.000075712014,0.064312354],"genre_scores_gemma":[0.971005,0.00022390462,0.02833946,0.00019286634,0.000025417276,0.00001987703,8.209806e-7,0.000023133007,0.0001694704],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983909,0.00011105932,0.0006478166,0.00017872483,0.00040885524,0.00026261638],"domain_scores_gemma":[0.99608034,0.0027573765,0.00033079775,0.00074806676,0.00004825808,0.000035135723],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00079803145,0.00023072181,0.00049786625,0.000089501766,0.000119673256,0.0000141204855,0.00048536144,0.000083381514,0.00023848297],"category_scores_gemma":[0.0010424508,0.00013397651,0.00016849845,0.00034155545,0.00020531776,0.00013613868,0.000043338776,0.00021395179,0.000010998427],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028297476,0.00020081748,0.00007609829,0.00019056589,0.000018733663,0.0000038627963,0.0018350909,0.000038132817,0.00006822108,0.99566627,0.00018576847,0.0016881601],"study_design_scores_gemma":[0.00070689217,0.000055945322,0.00011499523,0.0003459516,0.000030499916,0.000015872996,0.0003661302,0.00042614742,0.001064818,0.9965563,0.0001580923,0.00015840259],"about_ca_topic_score_codex":4.26519e-7,"about_ca_topic_score_gemma":0.0000018026864,"teacher_disagreement_score":0.06414288,"about_ca_system_score_codex":0.000019797772,"about_ca_system_score_gemma":0.000010383364,"threshold_uncertainty_score":0.54634035},"labels":[],"label_agreement":null},{"id":"W2089589410","doi":"10.1016/j.dam.2012.07.001","title":"Distance edge-colourings and matchings","year":2012,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Engineering and Physical Sciences Research Council","keywords":"Mathematics; Combinatorics; Random graph; Upper and lower bounds; Counterexample; Bounded function; Conjecture; Chromatic scale; Matching (statistics); Discrete mathematics; Edge coloring; Graph; Line graph; Statistics; Graph power","score_opus":0.018994174500257012,"score_gpt":0.2721251010885043,"score_spread":0.25313092658824726,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2089589410","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8440434,0.00035494706,0.04226127,0.00010515414,0.00028315367,0.00065809395,0.000014225357,0.0003039509,0.111975856],"genre_scores_gemma":[0.86999756,0.00002884116,0.1290324,0.00014241472,0.000167257,0.000056078563,0.0000034943141,0.00006997673,0.0005019646],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99848825,0.000015954674,0.0004139466,0.00023598428,0.00030174706,0.0005441114],"domain_scores_gemma":[0.9985875,0.0004401245,0.00022239285,0.00051999674,0.000024975938,0.00020504296],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054835243,0.00031118907,0.00041639846,0.00006575129,0.0003327286,0.000057091383,0.00025899382,0.00013282784,0.00008471284],"category_scores_gemma":[0.00012344142,0.00024000244,0.00008430571,0.000121794605,0.00020239704,0.00016094073,0.00028251874,0.0002381613,0.000021539592],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011740864,0.00006882618,0.00024826906,0.00042672982,0.000043674267,9.108802e-7,0.00964825,1.9990208e-7,0.0005683349,0.98729897,0.00085783587,0.0008262645],"study_design_scores_gemma":[0.00032095716,0.000012808418,0.00030388436,0.000052739793,0.000092981325,0.000029763436,0.0011493523,0.00009558077,0.0014249872,0.99200594,0.0041362927,0.0003747098],"about_ca_topic_score_codex":0.0000018432236,"about_ca_topic_score_gemma":9.576011e-7,"teacher_disagreement_score":0.11147389,"about_ca_system_score_codex":0.000027752094,"about_ca_system_score_gemma":0.0000074334266,"threshold_uncertainty_score":0.97870153},"labels":[],"label_agreement":null},{"id":"W2089905104","doi":"10.1016/j.ejc.2013.06.034","title":"On the number of monochromatic solutions of integer linear systems on abelian groups","year":2013,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Mathematics; Monochromatic color; Integer (computer science); Abelian group; Combinatorics; Exponent; Natural number; Homogeneous; Integer matrix; Discrete mathematics; Matrix (chemical analysis); Physics; Symmetric matrix; Nonnegative matrix; Quantum mechanics","score_opus":0.03894188381614987,"score_gpt":0.2681822148189683,"score_spread":0.22924033100281843,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2089905104","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97217506,0.00011640893,0.001730078,0.0001671355,0.0011901144,0.00018328027,0.0000043149357,0.000011190767,0.024422416],"genre_scores_gemma":[0.99929184,0.000026025928,0.00029896703,0.00004673356,0.000085835534,0.0000010339594,2.352781e-7,0.000036019737,0.00021332206],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976979,0.0007352678,0.00086835324,0.0000785976,0.00045184922,0.00016803636],"domain_scores_gemma":[0.9969761,0.0010601641,0.001011549,0.00043583463,0.00043926813,0.000077134035],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015926892,0.00015475304,0.00036989758,0.00011701309,0.00012507311,0.000022076189,0.00053769903,0.00003476033,0.00010345479],"category_scores_gemma":[0.00078880397,0.00008756788,0.00020232031,0.00021253567,0.0001318545,0.00007680855,0.00008476567,0.00041049634,0.00003854011],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018296378,0.00021536452,0.00014045868,0.000105839456,0.00011226407,0.000010397085,0.00084134657,0.000058754104,0.000121606936,0.99141407,0.006867833,0.000093779265],"study_design_scores_gemma":[0.00083932513,0.00078875973,0.0017300317,0.0009037456,0.00010248568,0.00010598697,0.0008113158,0.0005754751,0.0004511129,0.9931688,0.00035106848,0.00017191052],"about_ca_topic_score_codex":0.0000021521757,"about_ca_topic_score_gemma":3.9992482e-8,"teacher_disagreement_score":0.027116766,"about_ca_system_score_codex":0.00003320084,"about_ca_system_score_gemma":0.000022108923,"threshold_uncertainty_score":0.35709146},"labels":[],"label_agreement":null},{"id":"W2090115063","doi":"10.1090/s0002-9939-2010-10543-9","title":"A strengthening and a multipartite generalization of the Alon-Boppana-Serre theorem","year":2010,"lang":"en","type":"article","venue":"Proceedings of the American Mathematical Society","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; Javna Agencija za Raziskovalno Dejavnost RS","keywords":"Multipartite; Vertex (graph theory); Bounded function; Eigenvalues and eigenvectors; Degree (music); Mathematical proof; Graph; Generalization","score_opus":0.01224536013766228,"score_gpt":0.2638609149420292,"score_spread":0.2516155548043669,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2090115063","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99754685,0.000015300662,0.00022481778,0.00050238374,0.00007418681,0.0003001947,0.00000700632,0.000032473963,0.0012968034],"genre_scores_gemma":[0.9605902,0.000013461907,0.039059978,0.00013736392,0.000055840228,0.000014226495,1.5109595e-7,0.000027789218,0.000101016885],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99871296,0.000020387264,0.0004511558,0.0002017776,0.00038891236,0.00022479666],"domain_scores_gemma":[0.99830097,0.00038920957,0.0007971441,0.00027874383,0.00017481585,0.000059103302],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006300159,0.00018694662,0.0004080776,0.000017113225,0.00027337196,0.000026611822,0.0005830934,0.00007395145,0.000022696879],"category_scores_gemma":[0.0011869476,0.000094092684,0.00035262044,0.00037033416,0.0016227647,0.00007775226,0.00046772617,0.00033410764,2.200653e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013735543,0.000074098236,0.007819184,0.00035102366,0.000097001524,1.7057792e-8,0.0076409187,0.0000012426484,0.06647468,0.9164249,0.0004331078,0.0006701371],"study_design_scores_gemma":[0.00024893222,0.000036484013,0.0048420574,0.0001339962,0.000152653,0.000013521286,0.0021303603,0.0043532164,0.033777144,0.95401675,0.0001287648,0.00016613216],"about_ca_topic_score_codex":0.000008975001,"about_ca_topic_score_gemma":0.0000016864655,"teacher_disagreement_score":0.03883516,"about_ca_system_score_codex":0.000011395293,"about_ca_system_score_gemma":0.000015850816,"threshold_uncertainty_score":0.5979144},"labels":[],"label_agreement":null},{"id":"W2090286607","doi":"10.1007/s00453-006-0103-y","title":"Asymptotics of Largest Components in Combinatorial Structures","year":2006,"lang":"en","type":"article","venue":"Algorithmica","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; University of Waterloo","funders":"","keywords":"Mathematics; Combinatorics; Theory of computation; Term (time); Function (biology); Combinatorial analysis; Discrete mathematics; Generating function; Algorithm; Physics","score_opus":0.023833828769084613,"score_gpt":0.26715760124772714,"score_spread":0.24332377247864254,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2090286607","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99351233,0.000070399175,0.00038646694,0.00003309321,0.0010657259,0.00017395419,0.000035183268,0.000040893774,0.0046819784],"genre_scores_gemma":[0.9901336,0.0000029418031,0.00951988,0.000018103927,0.00023157033,0.000003035232,0.0000146300135,0.000022558032,0.00005371614],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99882585,0.000075912474,0.00041393065,0.00017587024,0.00026804258,0.00024041622],"domain_scores_gemma":[0.99919456,0.00027207524,0.00014453319,0.00029846962,0.000057052584,0.00003332913],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019240232,0.0001532482,0.00031402847,0.00012355547,0.00006881821,0.0000107031665,0.0002543192,0.00013153527,0.000050373215],"category_scores_gemma":[0.00008123362,0.00013217048,0.00008162531,0.00017044794,0.00012281277,0.000047507503,0.00010261224,0.00017912616,0.0000016111602],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023774626,0.00013687531,0.0045266375,0.000039352137,0.000020409676,0.00000995213,0.00012392738,0.00001165324,0.00059294055,0.9933528,0.00064359163,0.00051809003],"study_design_scores_gemma":[0.0010194262,0.000037239275,0.02482859,0.000020344765,0.000018117431,0.0000068201766,0.000022040233,0.000227863,0.0052780663,0.96783465,0.0005605333,0.00014632773],"about_ca_topic_score_codex":0.00014209497,"about_ca_topic_score_gemma":0.000014287059,"teacher_disagreement_score":0.025518166,"about_ca_system_score_codex":0.000027261574,"about_ca_system_score_gemma":0.000015189276,"threshold_uncertainty_score":0.53897554},"labels":[],"label_agreement":null},{"id":"W2091166220","doi":"10.1016/j.jctb.2007.02.006","title":"Large independent sets in regular graphs of large girth","year":2007,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":45,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Girth (graph theory); Combinatorics; Discrete mathematics; Independence (probability theory); Differential equation; Independent set; Strongly regular graph; Graph; Statistics; Pathwidth; Mathematical analysis; Line graph","score_opus":0.011854564236731115,"score_gpt":0.2906598480540324,"score_spread":0.2788052838173013,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2091166220","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9907446,0.00039835653,0.00073802896,0.00003570052,0.0051360265,0.00016592767,0.000016913149,0.000015710257,0.0027487706],"genre_scores_gemma":[0.998706,0.00007799448,0.00075297523,0.000047809583,0.00026106442,9.102031e-7,0.0000011196688,0.000033147295,0.000119005446],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970094,0.00041970186,0.0012534552,0.00014665078,0.00070959167,0.0004611903],"domain_scores_gemma":[0.9973812,0.00075602654,0.0009936376,0.00038902095,0.00034370535,0.00013640674],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008898954,0.00023367528,0.00070210366,0.00046473657,0.00013482622,0.000020368567,0.0005294762,0.00024820757,0.00018201269],"category_scores_gemma":[0.0006707676,0.00018394699,0.0003240693,0.00038970643,0.00015892902,0.0003515452,0.00013603862,0.0006042636,6.531975e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0022472618,0.0004178401,0.0025968824,0.00008305936,0.00013664663,0.00014289338,0.004189818,0.0000010602533,0.00048174808,0.9892388,0.00028387655,0.00018011432],"study_design_scores_gemma":[0.0034414004,0.0004755576,0.0022363784,0.00012554995,0.00005408105,0.0001134333,0.002582171,6.601508e-7,0.009074561,0.9784443,0.003269552,0.00018238426],"about_ca_topic_score_codex":9.107331e-7,"about_ca_topic_score_gemma":0.000011331701,"teacher_disagreement_score":0.010794529,"about_ca_system_score_codex":0.0000638493,"about_ca_system_score_gemma":0.000070109745,"threshold_uncertainty_score":0.750114},"labels":[],"label_agreement":null},{"id":"W2093635261","doi":"10.1016/j.jctb.2014.06.005","title":"The inducibility of blow-up graphs","year":2014,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":37,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada; Fonds Québécois de la Recherche sur la Nature et les Technologies","keywords":"Combinatorics; Vertex (graph theory); Mathematics; Graph; Discrete mathematics","score_opus":0.016463360356692252,"score_gpt":0.2747567065996173,"score_spread":0.25829334624292505,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2093635261","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9818374,0.00021067659,0.00019543285,0.00014767496,0.012938316,0.000115319075,0.0000028668235,0.000015176363,0.0045371307],"genre_scores_gemma":[0.99881077,0.00006183171,0.00038010723,0.000028281283,0.0005093608,0.0000013322285,1.594637e-7,0.000019659943,0.00018849637],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99738,0.0009196979,0.0008840107,0.00011609992,0.00048444944,0.0002157338],"domain_scores_gemma":[0.99473447,0.0030545052,0.00098619,0.0006227424,0.0005108845,0.00009122339],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0070151156,0.00017157725,0.00048541982,0.00008489394,0.00036720058,0.00003915505,0.00070130546,0.00013145899,0.00008821542],"category_scores_gemma":[0.0041397945,0.00009732579,0.0003418435,0.00018552181,0.0006286783,0.00021420006,0.00013178684,0.0004250525,5.13417e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012013662,0.00006420742,0.000226881,0.000036628582,0.00013695851,0.0000014330259,0.0010247804,6.1210613e-7,0.00030397397,0.9931528,0.0007087898,0.003141557],"study_design_scores_gemma":[0.0009443925,0.0005496603,0.00031972738,0.000041100957,0.00007783648,0.000041743268,0.0005030872,0.0000013134236,0.007922568,0.9811414,0.008351223,0.0001059708],"about_ca_topic_score_codex":8.4958936e-7,"about_ca_topic_score_gemma":9.025756e-7,"teacher_disagreement_score":0.016973365,"about_ca_system_score_codex":0.00002238342,"about_ca_system_score_gemma":0.0000622679,"threshold_uncertainty_score":0.49560195},"labels":[],"label_agreement":null},{"id":"W2093788800","doi":"10.1002/malq.201110037","title":"Conjectures of Rado and Chang and special Aronszajn trees","year":2012,"lang":"en","type":"article","venue":"Mathematical logic quarterly","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Mathematics; Conjecture; Combinatorics; Square (algebra); Geometry","score_opus":0.03163157865390188,"score_gpt":0.28557650544306257,"score_spread":0.2539449267891607,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2093788800","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98142445,0.00047434997,0.0024956504,0.00013435679,0.00017568943,0.0002654558,0.000011563413,0.000048709848,0.014969802],"genre_scores_gemma":[0.98979324,0.000008778692,0.009469777,0.00007400709,0.0005107649,0.000009017353,8.7103956e-7,0.0000170767,0.000116476745],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988801,0.00009049939,0.00035482808,0.00016466156,0.00019551747,0.00031440583],"domain_scores_gemma":[0.9986479,0.000816143,0.00012324481,0.00024742022,0.000024840218,0.00014044496],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045401885,0.00019774809,0.0004498952,0.000073916,0.00011016045,0.000024235955,0.00011044358,0.00012834462,0.00037846345],"category_scores_gemma":[0.0002012211,0.00013050657,0.00007030747,0.000062053434,0.0003866176,0.00009820311,0.000051114992,0.00012921065,0.000005623373],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021042486,0.000094971336,0.00046493695,0.00023909254,0.000037472844,0.0000018638564,0.010830045,1.7051484e-8,0.0002311057,0.9821687,0.000363819,0.0055469605],"study_design_scores_gemma":[0.00032360837,0.0002667924,0.0026065002,0.000046633155,0.00006670207,0.00007884658,0.0013554989,0.000031788448,0.00021842914,0.9946795,0.00016215,0.00016355679],"about_ca_topic_score_codex":0.0000011256468,"about_ca_topic_score_gemma":0.0000023332238,"teacher_disagreement_score":0.014853326,"about_ca_system_score_codex":0.000006816213,"about_ca_system_score_gemma":0.000004335741,"threshold_uncertainty_score":0.5321903},"labels":[],"label_agreement":null},{"id":"W2094138124","doi":"10.1017/s0963548315000061","title":"On the Chromatic Thresholds of Hypergraphs","year":2015,"lang":"en","type":"article","venue":"Combinatorics Probability Computing","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"University of Illinois at Urbana-Champaign; Hungarian Scientific Research Fund; European Commission; National Science Foundation","keywords":"Combinatorics; Chromatic scale; Mathematics; Infimum and supremum; Hypergraph; Dimension (graph theory); Bounded function; Upper and lower bounds; Bipartite graph; Discrete mathematics; Graph","score_opus":0.11248120240182265,"score_gpt":0.30672770137783945,"score_spread":0.1942464989760168,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2094138124","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9861866,0.00008770342,0.000791927,0.00019051421,0.0007252663,0.00045476886,0.0000017204627,0.00010494044,0.011456539],"genre_scores_gemma":[0.998109,9.704617e-7,0.0017240056,0.00008039687,0.000034386325,0.0000052584137,6.9030574e-7,0.000021012933,0.000024271736],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981697,0.00028947432,0.0005065775,0.00026559582,0.0004987328,0.00026989574],"domain_scores_gemma":[0.99618536,0.0022306824,0.00026842183,0.00093905546,0.0002803105,0.000096183874],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00247299,0.00019885223,0.00035183757,0.00006843982,0.000269914,0.000024434301,0.0006112594,0.00009913415,0.0000106667385],"category_scores_gemma":[0.0032799256,0.00012532977,0.00014970127,0.00045826336,0.00027163498,0.00004390886,0.000352524,0.00029755523,0.0000031274808],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012596442,0.0001982592,0.0035459942,0.00012885162,0.000030107793,0.0000010392517,0.0016751772,0.000082015766,0.00001532238,0.99322706,0.000820228,0.00026331402],"study_design_scores_gemma":[0.0003588218,0.00016983456,0.00055385765,0.00007089737,0.000021223306,0.0000061622804,0.00015722794,0.0022345837,0.00048023358,0.99576366,0.000044346954,0.0001391437],"about_ca_topic_score_codex":0.000005047144,"about_ca_topic_score_gemma":7.403538e-7,"teacher_disagreement_score":0.011922387,"about_ca_system_score_codex":0.00008611435,"about_ca_system_score_gemma":0.000063157386,"threshold_uncertainty_score":0.51107997},"labels":[],"label_agreement":null},{"id":"W2094651847","doi":"10.1007/s00039-011-0141-8","title":"Higher-Order Fourier Analysis Of $${\\mathbb{F}_{p}^n}$$ And The Complexity Of Systems Of Linear Forms","year":2011,"lang":"en","type":"article","venue":"Geometric and Functional Analysis","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Mathematics; Order (exchange); Fourier transform; Combinatorics; Function (biology); Fourier series; Norm (philosophy); Constant (computer programming); Degree (music); Analytic function; Mathematical analysis; Physics","score_opus":0.07770629874753229,"score_gpt":0.25977657441374,"score_spread":0.18207027566620773,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2094651847","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9503985,0.0027224224,0.0434674,0.000033816483,0.00013448286,0.00015210261,0.00017746078,0.000014220026,0.0028995967],"genre_scores_gemma":[0.9974094,0.00013612436,0.0019723019,0.000011415762,0.00002760252,0.000005777205,0.000017454864,0.0000070448364,0.000412888],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9985552,0.00007953158,0.00063173776,0.00020325536,0.00040590324,0.00012440982],"domain_scores_gemma":[0.99817747,0.00065598625,0.00043318325,0.00033504007,0.00034941043,0.000048920534],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00094982726,0.00014169067,0.00092053,0.0021733607,0.000115144365,0.000007696154,0.00011169079,0.0000864626,0.0003791715],"category_scores_gemma":[0.00018667695,0.00007593025,0.00049784494,0.008160052,0.00096785335,0.00005340437,0.000115608134,0.00009442375,3.2955805e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021775,0.000085610925,0.04165354,0.00022472788,0.024075722,4.6196155e-7,0.00067456637,0.00027461108,0.000006653972,0.93233794,0.000060798848,0.00038763342],"study_design_scores_gemma":[0.0010845825,0.0001269857,0.4758966,0.000019703073,0.051650405,0.000003915773,0.0009285101,0.04236542,0.000056705267,0.42748785,0.0001444818,0.00023486628],"about_ca_topic_score_codex":0.00047257746,"about_ca_topic_score_gemma":0.00002415312,"teacher_disagreement_score":0.5048501,"about_ca_system_score_codex":0.0000068121303,"about_ca_system_score_gemma":0.000011001765,"threshold_uncertainty_score":0.4151662},"labels":[],"label_agreement":null},{"id":"W2094948820","doi":"10.1002/rsa.20394","title":"The scaling window for a random graph with a given degree sequence","year":2012,"lang":"en","type":"article","venue":"Random Structures and Algorithms","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":39,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Random graph; Combinatorics; Giant component; Scaling; Mathematics; Degree (music); Graph; Sequence (biology); Random sequence; Component (thermodynamics); Window (computing); Discrete mathematics; Physics; Geometry; Computer science; Mathematical analysis; Quantum mechanics","score_opus":0.04942200943055145,"score_gpt":0.3026302775420053,"score_spread":0.2532082681114538,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2094948820","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8425766,0.011117552,0.13791317,0.0006631045,0.0018631442,0.0039916732,0.00021667445,0.0002667817,0.0013913044],"genre_scores_gemma":[0.9644755,0.00024876604,0.034137357,0.00012595615,0.0006957818,0.00013086708,0.000007031369,0.000052392163,0.000126347],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99825025,0.00014246267,0.00034780952,0.00029312153,0.00030998825,0.00065635284],"domain_scores_gemma":[0.9968,0.002323768,0.0002009461,0.00038621714,0.00010141533,0.00018767425],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00097631745,0.00033838855,0.0005000936,0.000066581895,0.001422144,0.00014066111,0.00028810542,0.0001273481,0.000013954608],"category_scores_gemma":[0.00031559545,0.0001657147,0.00019902909,0.00014593473,0.00043310065,0.0001736622,0.000084591156,0.00023958263,2.6792355e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.010103948,0.00006902581,0.0027899777,0.00044095374,0.0012543307,0.000014158342,0.008705371,0.000051021343,0.00073330686,0.6976423,0.0013916702,0.27680394],"study_design_scores_gemma":[0.020713361,0.00015626769,0.0019544342,0.00008166797,0.00032814595,0.00028539012,0.00077367236,0.000693521,0.0011514076,0.96672976,0.0065907044,0.0005416773],"about_ca_topic_score_codex":0.00001596553,"about_ca_topic_score_gemma":0.000011522756,"teacher_disagreement_score":0.27626225,"about_ca_system_score_codex":0.000015901705,"about_ca_system_score_gemma":0.00002336635,"threshold_uncertainty_score":0.99987787},"labels":[],"label_agreement":null},{"id":"W2095784445","doi":"10.1017/s096354830800967x","title":"The Ramsey Number for 3-Uniform Tight Hypergraph Cycles","year":2009,"lang":"en","type":"article","venue":"Combinatorics Probability Computing","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":33,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Banff International Research Station for Mathematical Innovation and Discovery; Conselho Nacional de Desenvolvimento Científico e Tecnológico; Fundação de Amparo à Pesquisa do Estado de São Paulo; National Science Foundation","keywords":"Hypergraph; Combinatorics; Mathematics; Ramsey's theorem; Lemma (botany); Monochromatic color; Integer (computer science); Discrete mathematics; Physics; Graph; Computer science","score_opus":0.03560432321952448,"score_gpt":0.31526380230338485,"score_spread":0.27965947908386035,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2095784445","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9745559,0.0002066185,0.010657784,0.00092905655,0.001626099,0.0013235979,0.000006069541,0.00037725357,0.0103176255],"genre_scores_gemma":[0.98695844,0.00001200892,0.012565159,0.00014365336,0.00014877433,0.000012701011,0.0000034514792,0.000026022653,0.00012980023],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99798226,0.00013555061,0.0005824168,0.0004062664,0.00031795548,0.0005755763],"domain_scores_gemma":[0.9961788,0.0023251486,0.00024460742,0.0008326486,0.00030925873,0.000109545894],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0019142028,0.00027716544,0.00034660555,0.000038152266,0.0018875937,0.0001329919,0.00070983,0.00015878573,0.0000063756092],"category_scores_gemma":[0.0013217763,0.00018830149,0.00028286767,0.00034151383,0.0001975668,0.0000927912,0.00019408508,0.0003312991,0.0000030550032],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002753108,0.00013988171,0.0020784964,0.00006834811,0.000029244982,7.1782887e-7,0.00055709225,0.0000106694815,0.000013579534,0.9808204,0.001067784,0.015186233],"study_design_scores_gemma":[0.00053579407,0.00009562647,0.0025765086,0.000029357374,0.000030347546,0.000010656169,0.000063067644,0.001876562,0.00023044346,0.9898412,0.0044540893,0.0002563454],"about_ca_topic_score_codex":0.0000020187565,"about_ca_topic_score_gemma":0.0000018956783,"teacher_disagreement_score":0.014929888,"about_ca_system_score_codex":0.000108775836,"about_ca_system_score_gemma":0.000044014214,"threshold_uncertainty_score":0.9994118},"labels":[],"label_agreement":null},{"id":"W2097770061","doi":"10.1016/j.ejc.2016.03.002","title":"A characterization of functions with vanishing averages over products of disjoint sets","year":2016,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"National Science Foundation of Sri Lanka; Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Disjoint sets; Mathematics; Characterization (materials science); Randomness; Combinatorics; Relation (database); Integrable system; Discrete mathematics; Pure mathematics; Statistics; Computer science; Data mining","score_opus":0.01870007576703975,"score_gpt":0.2319187107806285,"score_spread":0.21321863501358876,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2097770061","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98838955,0.000030473426,0.009343195,0.00011478882,0.00055965135,0.000073473704,0.000011341847,0.000009338861,0.001468202],"genre_scores_gemma":[0.9989439,0.000045307934,0.00063320925,0.000010346013,0.00007340849,1.8462617e-7,7.3055213e-7,0.00003010817,0.00026276556],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986797,0.00025991185,0.0005381951,0.000086984284,0.00033051686,0.00010467419],"domain_scores_gemma":[0.9980077,0.0001477106,0.001048071,0.00024163973,0.0005037117,0.000051123054],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008060024,0.000110810746,0.0002643913,0.000119802135,0.00006111378,0.000011887421,0.00019913256,0.000018103432,0.000027612776],"category_scores_gemma":[0.0004249674,0.00006118446,0.000073342846,0.00018913657,0.000078614365,0.00023145282,0.000060950584,0.00012576701,7.361389e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005671084,0.00075450423,0.014614908,0.0006004371,0.0005175712,0.00013593427,0.004887807,0.000007000531,0.30604443,0.6628324,0.0013380777,0.0076998738],"study_design_scores_gemma":[0.008794454,0.00505971,0.31503397,0.0034970192,0.00068889913,0.00062739104,0.0004132541,0.000013739609,0.18170656,0.47385395,0.009435963,0.000875097],"about_ca_topic_score_codex":1.283015e-7,"about_ca_topic_score_gemma":6.8964574e-8,"teacher_disagreement_score":0.30041906,"about_ca_system_score_codex":0.000022350716,"about_ca_system_score_gemma":0.000036778732,"threshold_uncertainty_score":0.24950299},"labels":[],"label_agreement":null},{"id":"W2098200304","doi":"10.1145/1374376.1374487","title":"Logconcave random graphs","year":2008,"lang":"en","type":"preprint","venue":"","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Combinatorics; Random graph; Mathematics; Random regular graph; Bounded function; Unit cube; Discrete mathematics; Graph; Chordal graph; 1-planar graph","score_opus":0.048145318484214474,"score_gpt":0.3051358758723333,"score_spread":0.2569905573881188,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2098200304","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31410223,0.00079293933,0.012996378,0.00020148826,0.0043691243,0.0012931114,0.00006501857,0.00082754105,0.66535217],"genre_scores_gemma":[0.9613993,0.0012836693,0.028819092,0.0004911329,0.0003752754,0.000066962384,0.000024776913,0.0000893563,0.007450439],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983633,0.00013168695,0.0004550386,0.00045199794,0.00030271336,0.00029525082],"domain_scores_gemma":[0.99797606,0.0005997782,0.00021483337,0.0010205859,0.00009116864,0.00009759408],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00030172608,0.00037874104,0.00066128786,0.00016417555,0.00020861054,0.00003312315,0.00054659264,0.000533513,0.0006182036],"category_scores_gemma":[0.00025644933,0.00027115617,0.0005293623,0.00006956286,0.00021668737,0.00002660405,0.0009775154,0.00079138734,0.000016596105],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000062010804,0.00003814028,0.00012497898,0.00018403349,0.00024568549,0.00003953302,0.0011095362,0.000012726044,0.000006498298,0.9581931,0.038779527,0.0012041881],"study_design_scores_gemma":[0.0008219502,0.000013701721,0.00007546569,0.000049798164,0.00007518641,0.000038358285,0.000042920372,0.0000809487,0.00026420577,0.9952495,0.0029290915,0.00035886467],"about_ca_topic_score_codex":0.00001951568,"about_ca_topic_score_gemma":0.000006554123,"teacher_disagreement_score":0.6579017,"about_ca_system_score_codex":0.000026749703,"about_ca_system_score_gemma":0.00005878081,"threshold_uncertainty_score":0.9999741},"labels":[],"label_agreement":null},{"id":"W2100004673","doi":"10.1002/jgt.20618","title":"Bounded transversals in multipartite graphs","year":2011,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Japan Society for the Promotion of Science","keywords":"Mathematics; Combinatorics; Bounded function; Multipartite; Discrete mathematics; Extremal graph theory; Transversal (combinatorics); Degree (music); Graph; 1-planar graph; Strong perfect graph theorem; Chordal graph; Line graph; Voltage graph","score_opus":0.06671613521167737,"score_gpt":0.2927243006039696,"score_spread":0.22600816539229224,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2100004673","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9873919,0.0004905267,0.001726574,0.000025162644,0.00069163466,0.00013324468,0.000004196276,0.000023922486,0.009512841],"genre_scores_gemma":[0.991529,0.00013873023,0.008032677,0.00012731536,0.00005806924,0.000002491609,1.9152354e-7,0.000030081615,0.000081452854],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99798375,0.0004310042,0.0008254798,0.00013950045,0.00031072722,0.00030954837],"domain_scores_gemma":[0.9984266,0.00053825,0.0004735605,0.00030547712,0.00012586583,0.00013021273],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002649757,0.00020171993,0.0004653863,0.0006857503,0.00011184375,0.000017105056,0.00046379928,0.0001372628,0.00036930337],"category_scores_gemma":[0.00032720822,0.0001469694,0.00045722615,0.0003748354,0.00028603364,0.0002671423,0.000034338933,0.00045918458,0.0000023690352],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00064443704,0.00020568183,0.0035847793,0.00003870777,0.00016271687,0.00012041713,0.013552893,0.0000010393718,0.0005494733,0.9795044,0.0002188285,0.0014166211],"study_design_scores_gemma":[0.0012066544,0.00018265245,0.006094872,0.000097597615,0.00008507201,0.0001239906,0.0010728199,0.0000022956492,0.0026262987,0.9881301,0.00020468204,0.00017296708],"about_ca_topic_score_codex":0.0000052893133,"about_ca_topic_score_gemma":0.000016566266,"teacher_disagreement_score":0.012480073,"about_ca_system_score_codex":0.000022891238,"about_ca_system_score_gemma":0.000033907407,"threshold_uncertainty_score":0.5993238},"labels":[],"label_agreement":null},{"id":"W2100090688","doi":"10.37236/3285","title":"Packing Tree Factors in Random and Pseudo-Random Graphs","year":2014,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"Israel Science Foundation; National Science Foundation","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Disjoint sets; Random graph; Random regular graph; Graph; Divisibility rule; Discrete mathematics; 1-planar graph; Chordal graph","score_opus":0.011325572189483928,"score_gpt":0.2509437857393936,"score_spread":0.23961821354990964,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2100090688","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.992944,0.0014539876,0.0036743463,0.0001708845,0.0004183966,0.00013689067,3.4552068e-7,0.000012751494,0.0011884035],"genre_scores_gemma":[0.9990609,0.00072746177,0.000027615255,0.000040840507,0.00006570661,0.0000013738121,1.871014e-7,0.000024474944,0.000051429794],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99809456,0.00042723108,0.0005377748,0.00010996956,0.0003530881,0.00047740698],"domain_scores_gemma":[0.9970736,0.0020658607,0.0004396787,0.00025520442,0.0000952103,0.00007042735],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029783281,0.00019562563,0.0005099674,0.00019972186,0.00020284406,0.000039746654,0.00041997794,0.000098015626,0.0000074248474],"category_scores_gemma":[0.00077145745,0.00011136075,0.00017592766,0.00028990218,0.00011479531,0.00011821397,0.000063578285,0.00090972526,2.2705981e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023646967,0.000047795325,0.0043188506,0.000018432413,0.00008130856,0.0000025514355,0.0013693387,0.000005073162,0.000092317496,0.9931581,0.000071078015,0.0005986571],"study_design_scores_gemma":[0.005544504,0.00029416406,0.0015948425,0.000042985837,0.000088538596,0.00009673419,0.00022806953,0.00007394618,0.00048387566,0.9909665,0.00045329003,0.00013257047],"about_ca_topic_score_codex":0.000004867328,"about_ca_topic_score_gemma":0.00001827444,"teacher_disagreement_score":0.0061169164,"about_ca_system_score_codex":0.00008912009,"about_ca_system_score_gemma":0.000082069215,"threshold_uncertainty_score":0.45411596},"labels":[],"label_agreement":null},{"id":"W2101123180","doi":"10.1090/s0002-9947-2013-06022-9","title":"An inverse theorem: When the measure of the sumset is the sum of the measures in a locally compact abelian group","year":2013,"lang":"en","type":"article","venue":"Transactions of the American Mathematical Society","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"University of British Columbia","keywords":"Algorithm; Artificial intelligence; Annotation; Computer science; Mathematics","score_opus":0.023158112386195077,"score_gpt":0.2649351660294457,"score_spread":0.24177705364325064,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2101123180","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97421956,0.000073323514,0.0118815405,0.01021912,0.00017461092,0.0019430162,0.00011715368,0.000039271305,0.0013323877],"genre_scores_gemma":[0.99675125,0.000023863377,0.0020922855,0.0009214198,0.000023733366,0.000040820534,3.021395e-7,0.000039863426,0.000106451334],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99652857,0.0010429767,0.0008214572,0.00024160615,0.000993297,0.00037209617],"domain_scores_gemma":[0.99510473,0.001595893,0.00077258557,0.0022514132,0.00020557415,0.00006979699],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0017407767,0.00031832219,0.0006546784,0.000027478376,0.00064186775,0.000034447643,0.0026005553,0.00011410046,0.00026747969],"category_scores_gemma":[0.0002717981,0.000110668305,0.0012599918,0.0008380526,0.0053521004,0.00012089206,0.00009756165,0.00075839576,0.000002303996],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003613348,0.0040790127,0.013784004,0.0017487685,0.0037980918,4.1942928e-7,0.27458835,0.0016590406,0.028982865,0.6361379,0.025710925,0.009149265],"study_design_scores_gemma":[0.000522566,0.00011360012,0.016570237,0.00030587357,0.000497568,0.000012154605,0.018864525,0.0033238018,0.005184878,0.9542452,0.000121953075,0.00023764487],"about_ca_topic_score_codex":0.0009413894,"about_ca_topic_score_gemma":0.00029468792,"teacher_disagreement_score":0.31810728,"about_ca_system_score_codex":0.000060007194,"about_ca_system_score_gemma":0.00009056214,"threshold_uncertainty_score":0.99735475},"labels":[],"label_agreement":null},{"id":"W2102027040","doi":"10.1016/s0012-365x(00)00265-x","title":"Using simulated annealing to construct extremal graphs","year":2001,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"St. Francis Xavier University","funders":"","keywords":"Combinatorics; Mathematics; Girth (graph theory); Discrete mathematics; Graph","score_opus":0.08826871707175327,"score_gpt":0.3565440002992728,"score_spread":0.26827528322751953,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2102027040","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9484906,0.00005935825,0.0367939,0.00004801109,0.0003145661,0.0005019087,0.000026620524,0.00023114304,0.013533859],"genre_scores_gemma":[0.84969777,0.000007081334,0.14973058,0.000119645876,0.00009639926,0.0000027474937,0.000004797713,0.00008290483,0.0002580626],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978155,0.00007710233,0.00070319464,0.0003721909,0.00044904393,0.0005829631],"domain_scores_gemma":[0.99810076,0.00050478266,0.00023821443,0.0007764795,0.00013657434,0.00024321752],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00048438006,0.00038551947,0.0005581796,0.0002501196,0.0004400328,0.00009712257,0.00042339033,0.000167057,0.00034974565],"category_scores_gemma":[0.0005867972,0.00031393868,0.00023522307,0.00058105675,0.00015603895,0.00013496025,0.0002402116,0.00022586933,0.000018453535],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000049394483,0.0000751806,0.0015037733,0.0002540737,0.0001655808,0.00012690767,0.006243571,0.001497704,0.0015232512,0.987731,0.00025582852,0.0005737309],"study_design_scores_gemma":[0.0004638618,0.000050674527,0.000045158413,0.0002261897,0.0001387204,0.0004052346,0.0013838884,0.035049655,0.00086755765,0.9604837,0.0003494753,0.00053591083],"about_ca_topic_score_codex":0.000010003222,"about_ca_topic_score_gemma":0.000002837662,"teacher_disagreement_score":0.112936676,"about_ca_system_score_codex":0.00004678111,"about_ca_system_score_gemma":0.000026673477,"threshold_uncertainty_score":0.9999313},"labels":[],"label_agreement":null},{"id":"W2102470573","doi":"10.1002/jgt.20072","title":"Unavoidable cycle lengths in graphs","year":2005,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Combinatorics; Conjecture; Graph; Degree (music); Discrete mathematics; Constant (computer programming); Computer science","score_opus":0.015900240928032175,"score_gpt":0.2874960107239288,"score_spread":0.2715957697958966,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2102470573","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9825434,0.0014627733,0.0006459681,0.00023937387,0.0004994781,0.00012110559,0.0000035143719,0.000026400276,0.014457965],"genre_scores_gemma":[0.99236387,0.00024041458,0.0065300097,0.00029633605,0.00023650443,0.0000023624766,2.2653659e-7,0.000033083157,0.00029720023],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979626,0.00036600395,0.00081646716,0.00014405693,0.00037196046,0.00033891195],"domain_scores_gemma":[0.998019,0.00091235107,0.00048555038,0.00033004023,0.00012798497,0.00012510017],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029940454,0.00020025724,0.00044632592,0.00070128596,0.00014928309,0.000028982617,0.0004889944,0.00013718268,0.00030642425],"category_scores_gemma":[0.0004916011,0.00014803174,0.00037557594,0.0004397981,0.00018077092,0.0003368378,0.000069580106,0.0005955024,0.000005531335],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002398838,0.00018886247,0.0013496042,0.000030666713,0.00009538408,0.000042596115,0.0017107353,0.00010266954,0.00031621833,0.9848743,0.001363147,0.009685896],"study_design_scores_gemma":[0.0009856981,0.000117061936,0.0014673251,0.00009726229,0.000049628496,0.00016687602,0.00053363165,0.00001850077,0.0010606133,0.99247277,0.0028543656,0.00017625437],"about_ca_topic_score_codex":0.0000020232044,"about_ca_topic_score_gemma":0.000015873129,"teacher_disagreement_score":0.014160765,"about_ca_system_score_codex":0.00005129078,"about_ca_system_score_gemma":0.000044109063,"threshold_uncertainty_score":0.60365593},"labels":[],"label_agreement":null},{"id":"W2102693912","doi":"10.1016/j.disc.2005.02.007","title":"Altitude of regular graphs with girth at least five","year":2005,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Mathematics; Combinatorics; Girth (graph theory); Altitude (triangle); Discrete mathematics; Graph; Geometry","score_opus":0.015220925666949678,"score_gpt":0.26418970163527294,"score_spread":0.24896877596832326,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2102693912","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97018725,0.00019242716,0.0048606927,0.00016219649,0.00007228234,0.00046662224,0.00006124023,0.00012165875,0.02387565],"genre_scores_gemma":[0.8541795,0.000027702214,0.14272518,0.000062583305,0.0000690959,0.000017942393,0.000009133292,0.00006950742,0.0028393464],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99825174,0.000050476025,0.00055513525,0.00027111318,0.0005236525,0.00034788807],"domain_scores_gemma":[0.9981886,0.00029266003,0.00040350397,0.0008843743,0.00011861385,0.00011225444],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033095694,0.00031110502,0.00054435886,0.00012212046,0.00021130283,0.000020645743,0.00040598857,0.00011841309,0.00026036036],"category_scores_gemma":[0.00013178439,0.00020794838,0.00019716397,0.00021424466,0.0003460682,0.0001174333,0.00021384709,0.00016436962,0.000015765301],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005933059,0.00013696097,0.00035923268,0.0005372076,0.00020933856,0.0000073179367,0.007965587,0.00005599425,0.00046179688,0.9883361,0.0014361179,0.00043505867],"study_design_scores_gemma":[0.0010887714,0.0002036419,0.00033854364,0.00036348638,0.00027823445,0.00009778583,0.0015664961,0.0012475314,0.011231961,0.98107046,0.001972839,0.0005402264],"about_ca_topic_score_codex":0.0000033327435,"about_ca_topic_score_gemma":0.000042031686,"teacher_disagreement_score":0.13786449,"about_ca_system_score_codex":0.00004367832,"about_ca_system_score_gemma":0.000018702778,"threshold_uncertainty_score":0.8479889},"labels":[],"label_agreement":null},{"id":"W2102747227","doi":"10.1016/j.jcta.2004.04.001","title":"Asymptotics of combinatorial structures with large smallest component","year":2004,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; University of Waterloo","funders":"","keywords":"Component (thermodynamics); Mathematics; Combinatorics; Physics; Quantum mechanics","score_opus":0.012771638754875275,"score_gpt":0.25502157571622674,"score_spread":0.24224993696135147,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2102747227","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9856673,0.00024220388,0.0015664981,0.000112410395,0.010266283,0.00027736876,0.000029313176,0.000033035692,0.0018056165],"genre_scores_gemma":[0.99375963,0.000046771293,0.0050356095,0.00003948317,0.0010259842,0.0000020337272,0.0000024131275,0.000057253124,0.0000308094],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970241,0.00032922116,0.0011214244,0.00019303783,0.00091510464,0.00041707506],"domain_scores_gemma":[0.99650955,0.0006464464,0.0014185735,0.00049626624,0.00072978606,0.0001993808],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0015778654,0.00038460293,0.0010068882,0.00021927198,0.00030558437,0.000055254688,0.0007116759,0.00023716125,0.00013309176],"category_scores_gemma":[0.0005298394,0.00026419276,0.00033291415,0.0002709311,0.000479582,0.00027756343,0.00019190808,0.0006226224,6.026053e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00468697,0.00041625646,0.00031058525,0.00011051541,0.00046830229,0.00008144336,0.0021660188,0.000078731915,0.00043205556,0.99104995,0.00013948891,0.00005968027],"study_design_scores_gemma":[0.008502204,0.002336527,0.00039827643,0.00019507922,0.00023709393,0.0003620944,0.0011262686,5.6130006e-7,0.009232344,0.975917,0.0013919915,0.00030059097],"about_ca_topic_score_codex":0.0000033580143,"about_ca_topic_score_gemma":0.0000023145847,"teacher_disagreement_score":0.015132982,"about_ca_system_score_codex":0.00011314118,"about_ca_system_score_gemma":0.00025536562,"threshold_uncertainty_score":0.99998105},"labels":[],"label_agreement":null},{"id":"W2103315245","doi":"10.1007/s00493-014-2952-3","title":"An analogue of the Erdős-Stone theorem for finite geometries","year":2014,"lang":"en","type":"article","venue":"COMBINATORICA","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Combinatorics; Disjoint sets; Integer (computer science); Rank (graph theory); Equivalence (formal languages); Discrete mathematics","score_opus":0.02408680668586328,"score_gpt":0.28996538134667854,"score_spread":0.26587857466081527,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2103315245","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.959761,0.00021413981,0.023873918,0.00037417494,0.0020230727,0.0007270696,0.00006866232,0.00013136984,0.012826586],"genre_scores_gemma":[0.9984841,0.0000060595453,0.0010751645,0.00012819577,0.000057984966,0.000016305235,0.0000035441658,0.000023226821,0.00020544976],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99908555,0.0001225498,0.00024396129,0.00016563208,0.00018741122,0.00019489264],"domain_scores_gemma":[0.9973209,0.0015392165,0.00017773235,0.0007843358,0.00012631547,0.000051486524],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064527,0.00012839213,0.00026065015,0.00008526379,0.00027356768,0.000015733167,0.0005747885,0.000089022775,0.000023324978],"category_scores_gemma":[0.001395977,0.000078220684,0.0001527755,0.00032138597,0.00020897805,0.00005303485,0.00010724179,0.00008633415,8.798681e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021345082,0.00008245713,0.00080066104,0.00006121433,0.000027509717,9.391232e-8,0.00042471974,0.000004390023,0.0001579564,0.9956926,0.0013214066,0.0014056079],"study_design_scores_gemma":[0.00043400994,0.00018426123,0.0015818989,0.000015203878,0.00004258106,0.0000011088896,0.00006139171,0.00025053305,0.005535424,0.9832253,0.008558553,0.00010972216],"about_ca_topic_score_codex":0.0000030410504,"about_ca_topic_score_gemma":0.0000013562939,"teacher_disagreement_score":0.038723063,"about_ca_system_score_codex":0.000016828675,"about_ca_system_score_gemma":0.000015699552,"threshold_uncertainty_score":0.3189747},"labels":[],"label_agreement":null},{"id":"W2103626912","doi":"10.37236/278","title":"Large Bounded Degree Trees in Expanding Graphs","year":2010,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":46,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"University of Illinois at Urbana-Champaign; Hungarian Scientific Research Fund; National Science Foundation","keywords":"Mathematics; Bounded function; Combinatorics; Degree (music); Embedding; Dense graph; Random graph; Discrete mathematics; Graph; Spanning tree; Spectral gap; 1-planar graph; Chordal graph; Computer science","score_opus":0.01994977074148044,"score_gpt":0.29448391381877775,"score_spread":0.2745341430772973,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2103626912","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99485815,0.0008170702,0.0010568867,0.00020599471,0.0010970988,0.00010395078,7.285439e-7,0.00001552205,0.001844617],"genre_scores_gemma":[0.9993958,0.00023864211,0.000055011405,0.00004671391,0.00010399718,0.000002029495,2.090396e-7,0.000025500123,0.00013208597],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982143,0.00015206964,0.0005079175,0.00009788157,0.00039357625,0.0006342765],"domain_scores_gemma":[0.9984417,0.00060961215,0.00041340847,0.00034922292,0.00012130652,0.00006474091],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026971686,0.0001675557,0.00032951345,0.00022995722,0.00026597138,0.00004149857,0.00072156946,0.00011915826,0.00003698967],"category_scores_gemma":[0.00046786442,0.000102930775,0.00018998835,0.00042193325,0.00009280108,0.00014228393,0.00008341784,0.0017960508,9.5050814e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000054603457,0.00011988339,0.0016122081,0.0000071394556,0.00005874528,0.000010802298,0.0012697072,6.61981e-7,0.00072724273,0.9957668,0.00016463801,0.00020754604],"study_design_scores_gemma":[0.00125639,0.00019035552,0.001249818,0.00002105971,0.00004701947,0.00020902374,0.00036248416,0.000014772216,0.001137078,0.9940065,0.0013817698,0.00012370238],"about_ca_topic_score_codex":0.000002578086,"about_ca_topic_score_gemma":0.00015347783,"teacher_disagreement_score":0.0045376797,"about_ca_system_score_codex":0.00010730925,"about_ca_system_score_gemma":0.00017651008,"threshold_uncertainty_score":0.7803047},"labels":[],"label_agreement":null},{"id":"W2104176064","doi":"10.46298/dmtcs.427","title":"On-line Ramsey numbers for paths and stars","year":2008,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":34,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Statistics Canada; Dalhousie University","funders":"","keywords":"Combinatorics; Ramsey's theorem; Clique; Joins; Monochromatic color; Graph; Mathematics; Enhanced Data Rates for GSM Evolution; Upper and lower bounds; Line (geometry); Discrete mathematics; Computer science; Physics; Geometry; Artificial intelligence","score_opus":0.030219040816852144,"score_gpt":0.2993518997009093,"score_spread":0.26913285888405714,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2104176064","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40915594,0.000014276321,0.58609074,0.00018520615,0.00029146994,0.00048589113,0.000023160681,0.00010534434,0.0036479658],"genre_scores_gemma":[0.706103,0.000009135956,0.29342833,0.00029274085,0.00008411267,0.000019086496,0.0000016309551,0.000028788156,0.000033111945],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975644,0.000057595433,0.000477544,0.00059760624,0.00069236953,0.0006105072],"domain_scores_gemma":[0.9964436,0.002194925,0.00014814902,0.00074758724,0.00017020831,0.00029552245],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0013665278,0.00032443707,0.0004515974,0.00014588943,0.0010981992,0.000118829856,0.0007956492,0.00009653907,0.000062811196],"category_scores_gemma":[0.00088884996,0.00022615114,0.00014734169,0.00033085953,0.004677358,0.0001610235,0.00047373673,0.000222801,0.000006260239],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031682626,0.00008379113,0.000012325808,0.00009649176,0.000017315511,0.000009055257,0.0033500078,0.000013636544,0.000076611184,0.9953329,0.00028445583,0.00069171464],"study_design_scores_gemma":[0.0004388351,0.0003495461,0.00002109407,0.000078203106,0.000026800466,0.00008782714,0.000085415195,0.10294998,0.0006518431,0.8949773,0.00004172072,0.00029145932],"about_ca_topic_score_codex":5.4805093e-7,"about_ca_topic_score_gemma":2.8338636e-7,"teacher_disagreement_score":0.29694712,"about_ca_system_score_codex":0.00002899228,"about_ca_system_score_gemma":0.000051656218,"threshold_uncertainty_score":0.9980313},"labels":[],"label_agreement":null},{"id":"W2104655172","doi":"10.4153/cmb-2011-149-9","title":"An Extension of the Dirichlet Density for Sets of Gaussian Integers","year":2011,"lang":"en","type":"article","venue":"Canadian Mathematical Bulletin","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Foreign Affairs and International Trade Canada; Conselho Nacional de Desenvolvimento Científico e Tecnológico","keywords":"Mathematics; Natural density; Extension (predicate logic); Dirichlet distribution; Gaussian integer; Gaussian; Discrete mathematics; Combinatorics; Pure mathematics; Mathematical analysis","score_opus":0.048056319277999374,"score_gpt":0.2768983460954946,"score_spread":0.22884202681749521,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2104655172","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98178285,0.000021088936,0.0030473908,0.00047759316,0.00017524807,0.00067047804,0.000076023345,0.000023089973,0.013726245],"genre_scores_gemma":[0.98015684,0.0000010546647,0.019360121,0.00024245806,0.000020591982,0.000012642305,0.000001782014,0.000028275143,0.00017622973],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99880314,0.00009986744,0.000431037,0.00019678364,0.00017472405,0.00029442436],"domain_scores_gemma":[0.9982345,0.00037352956,0.0001879653,0.00078405475,0.00015264643,0.00026729985],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0005964917,0.00015804065,0.00036465967,0.000090789814,0.0001456966,0.000006132628,0.00045902818,0.00014056532,0.001996293],"category_scores_gemma":[0.0011639418,0.000100180376,0.00018946864,0.00010850084,0.00034358405,0.000019458557,0.00005216382,0.00013142798,0.000018026834],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000033332977,0.000081666905,0.00023486454,0.00033418182,0.000037181846,0.000003349852,0.0028754657,2.6186498e-7,0.00035705633,0.99036956,0.0051324205,0.00054064055],"study_design_scores_gemma":[0.00020458699,0.00009121133,0.0019108681,0.00014786076,0.00007696434,0.000016352726,0.00048089918,0.00010824524,0.006700921,0.9892271,0.0008888473,0.00014614906],"about_ca_topic_score_codex":0.0004338423,"about_ca_topic_score_gemma":0.00071734644,"teacher_disagreement_score":0.01631273,"about_ca_system_score_codex":0.000036365087,"about_ca_system_score_gemma":0.00008684622,"threshold_uncertainty_score":0.99891603},"labels":[],"label_agreement":null},{"id":"W2106210406","doi":"10.1016/j.disc.2007.07.029","title":"Graphs with the n-e.c. adjacency property constructed from affine planes","year":2007,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University; Wilfrid Laurier University; Sackville Memorial Hospital","funders":"Natural Sciences and Engineering Research Council of Canada; Hungarian Scientific Research Fund","keywords":"Mathematics; Adjacency list; Affine transformation; Combinatorics; Property (philosophy); Discrete mathematics; Affine plane (incidence geometry); Pure mathematics; Geometry; Plane (geometry)","score_opus":0.02013294716597633,"score_gpt":0.2593920561754373,"score_spread":0.23925910900946099,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2106210406","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94075704,0.00014671331,0.014399902,0.0003980957,0.00024464325,0.0008668921,0.00011186599,0.00030583478,0.042769004],"genre_scores_gemma":[0.9384572,0.000012026354,0.059810784,0.00016463653,0.0001612156,0.00002092362,0.0000307947,0.00008309861,0.001259359],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980855,0.0000645406,0.0005116203,0.00031488808,0.0005423804,0.00048106912],"domain_scores_gemma":[0.9972829,0.0012482685,0.00031514166,0.0009170964,0.000117275755,0.000119314114],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000635132,0.00038041707,0.00044864704,0.0000882528,0.0004576646,0.00007700493,0.0005882211,0.00014205297,0.00042399485],"category_scores_gemma":[0.0002281197,0.00015454213,0.0001324619,0.00031654554,0.0005265361,0.00009983675,0.00015250118,0.0003353855,0.000013554359],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016726828,0.00013309182,0.0025956037,0.00023543517,0.0003818638,0.00006383259,0.012143415,0.0000024227763,0.0007572281,0.9757962,0.005668203,0.0020553852],"study_design_scores_gemma":[0.0009144082,0.00012701313,0.001513923,0.00020400515,0.00028216807,0.000118043405,0.008951076,0.00017632192,0.0028570348,0.98142844,0.0028626283,0.0005649554],"about_ca_topic_score_codex":0.00004079305,"about_ca_topic_score_gemma":0.00014959883,"teacher_disagreement_score":0.04541088,"about_ca_system_score_codex":0.000021405414,"about_ca_system_score_gemma":0.000032011514,"threshold_uncertainty_score":0.6302045},"labels":[],"label_agreement":null},{"id":"W2108020523","doi":"10.37236/351","title":"On the Possible Orders of a Basis for a Finite Cyclic Group","year":2010,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada; Vetenskapsrådet","keywords":"Mathematics; Combinatorics; Basis (linear algebra); Cyclic group; Order (exchange); Integer (computer science); Group (periodic table); Constant (computer programming); Graph; Discrete mathematics; Geometry","score_opus":0.014115936398471156,"score_gpt":0.2691865574192624,"score_spread":0.25507062102079125,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2108020523","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9903806,0.00029787736,0.005799156,0.0012602773,0.0007991137,0.00029179564,0.000003523076,0.000010090408,0.0011576051],"genre_scores_gemma":[0.9993758,0.00010227656,0.00010614485,0.000159759,0.00009273708,0.000007205971,1.9807015e-7,0.000026663407,0.00012922383],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985973,0.00013237764,0.00043951513,0.000081322,0.00035787723,0.000391578],"domain_scores_gemma":[0.99372107,0.0049606166,0.00061769603,0.00043366218,0.00022491688,0.00004201513],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023820861,0.00014874862,0.00029066933,0.00010027437,0.00029086124,0.000022349857,0.0008046996,0.000090049456,0.00003692677],"category_scores_gemma":[0.0019442897,0.00007138445,0.000287107,0.00028479964,0.00014737301,0.000055150544,0.000049275415,0.0010173549,5.752128e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016111137,0.00011869063,0.000030622803,0.00002194289,0.00015240604,5.9194394e-7,0.0005764843,0.0000066680946,0.00062839495,0.99714804,0.00090723264,0.00024783835],"study_design_scores_gemma":[0.0006713745,0.0008341821,0.000058256333,0.000029453908,0.00011777205,0.000038739763,0.00016319074,0.000084928535,0.0022666554,0.9939577,0.0016930449,0.000084716565],"about_ca_topic_score_codex":0.0000022898803,"about_ca_topic_score_gemma":0.000009118193,"teacher_disagreement_score":0.008995229,"about_ca_system_score_codex":0.00005166549,"about_ca_system_score_gemma":0.00015631082,"threshold_uncertainty_score":0.44199574},"labels":[],"label_agreement":null},{"id":"W2109408352","doi":"10.1016/j.disc.2015.10.008","title":"Triangle-free graphs with the maximum number of cycles","year":2015,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Mathematics; Combinatorics; Bipartite graph; Upper and lower bounds; Triangle-free graph; Pancyclic graph; Discrete mathematics; Graph; Complete bipartite graph; 1-planar graph; Chordal graph","score_opus":0.0421209842775522,"score_gpt":0.30227501331117884,"score_spread":0.26015402903362667,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2109408352","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.87781227,0.00014358247,0.010072349,0.00075250707,0.00022448177,0.0007244594,0.000078072124,0.00015683232,0.11003545],"genre_scores_gemma":[0.9200686,0.000009587447,0.0788122,0.000096632895,0.00007993138,0.000035278885,0.0000049316363,0.00008271702,0.00081010046],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983333,0.00010409391,0.00046159208,0.00019036543,0.0006195038,0.00029119416],"domain_scores_gemma":[0.99730897,0.00068762526,0.00038472554,0.0013352546,0.00016684606,0.00011659479],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008723985,0.00026561628,0.00050024857,0.000060585415,0.00014820475,0.000039382496,0.0008285863,0.00009908743,0.00009104258],"category_scores_gemma":[0.0006361687,0.00013222637,0.00018770741,0.00028550095,0.00042118246,0.00009453583,0.00026523403,0.0001914151,0.0000107325195],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006062939,0.00007964447,0.0004426718,0.00020445723,0.00015347413,0.0000064869937,0.00901692,0.000003679088,0.000015675036,0.98256415,0.007189318,0.00026291222],"study_design_scores_gemma":[0.0010102192,0.00007136691,0.000056422312,0.00008852394,0.00016964476,0.00006728832,0.0056241564,0.00011543767,0.0005056315,0.9913797,0.0007008444,0.00021076942],"about_ca_topic_score_codex":0.000008172171,"about_ca_topic_score_gemma":0.000014609032,"teacher_disagreement_score":0.10922535,"about_ca_system_score_codex":0.000016854758,"about_ca_system_score_gemma":0.0000415113,"threshold_uncertainty_score":0.53920346},"labels":[],"label_agreement":null},{"id":"W2109725035","doi":"10.37236/401","title":"List Coloring Hypergraphs","year":2010,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":21,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; University of California, Los Angeles; National Science Foundation","keywords":"Combinatorics; Hypergraph; Mathematics; Chromatic scale; Discrete mathematics","score_opus":0.010698217182173017,"score_gpt":0.2714133043577276,"score_spread":0.2607150871755546,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2109725035","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9916436,0.00066806015,0.0006368899,0.00040012592,0.002125911,0.000084143416,4.430482e-7,0.000021574646,0.0044192728],"genre_scores_gemma":[0.9990195,0.00021592087,0.000075642834,0.000064180116,0.00027451295,0.0000014399511,9.849644e-8,0.000024867188,0.00032381923],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985902,0.000094150455,0.00040116382,0.000080140795,0.00038153082,0.00045286736],"domain_scores_gemma":[0.99831015,0.0006172798,0.00040908108,0.00036183943,0.00022816047,0.00007346515],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017912876,0.0001437758,0.00026140097,0.00010504791,0.00033838724,0.00003561537,0.00076620583,0.000094672025,0.00004377389],"category_scores_gemma":[0.00048841443,0.00008502356,0.00020095281,0.00029375814,0.00013327682,0.000104195584,0.00008111253,0.0016870011,0.0000013944515],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000036306777,0.000057965513,0.00039005216,0.000008576137,0.000087270215,0.0000055528685,0.0003425382,7.702874e-7,0.0015662491,0.9965253,0.00069909135,0.00028032262],"study_design_scores_gemma":[0.00047260147,0.00022948002,0.00021303215,0.000009572665,0.00008000614,0.00040124592,0.000096547694,0.000009288687,0.0020320609,0.9841586,0.012193539,0.00010402199],"about_ca_topic_score_codex":0.0000021207063,"about_ca_topic_score_gemma":0.000010022459,"teacher_disagreement_score":0.012366702,"about_ca_system_score_codex":0.00006293226,"about_ca_system_score_gemma":0.00016862371,"threshold_uncertainty_score":0.73292744},"labels":[],"label_agreement":null},{"id":"W2109903705","doi":"10.1090/crmp/043/07","title":"Ergodic methods in additive combinatorics","year":2007,"lang":"en","type":"book-chapter","venue":"CRM proceedings & lecture notes","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":22,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Ergodic theory; Mathematical proof; Mathematics; Stationary ergodic process; Ramsey theory; Combinatorics; Discrete mathematics; Measure (data warehouse); Number theory; Extremal combinatorics; Pure mathematics; Invariant measure; Computer science","score_opus":0.06091780074700206,"score_gpt":0.36445887711427866,"score_spread":0.3035410763672766,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2109903705","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00050427334,0.0018445762,0.008406643,0.00010718626,0.00095250487,0.00069999456,0.000043194406,0.00026921707,0.9871724],"genre_scores_gemma":[0.9001006,0.0016688254,0.068178646,0.0028528285,0.0046701115,0.00016167315,0.00015332966,0.0016663296,0.020547653],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971244,0.0000211604,0.00079835864,0.0008322874,0.00056591,0.0006579295],"domain_scores_gemma":[0.9965154,0.0018902568,0.0006285881,0.0003224253,0.00046970515,0.00017363999],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0012226935,0.0009078324,0.0011563249,0.000778355,0.00026366807,0.000088361056,0.0006001156,0.0017146507,0.0005011426],"category_scores_gemma":[0.0022302754,0.000771494,0.00038118154,0.00022276641,0.00030124464,0.00011548373,0.0002873627,0.0022418858,0.000013184916],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005957388,0.00002743606,0.00003143273,0.00031021232,0.0001227977,0.000026886566,0.0020131962,2.6774444e-7,0.000082991006,0.9722603,0.00035396,0.024710933],"study_design_scores_gemma":[0.00037979742,0.00012394162,0.00003398286,0.0005166324,0.00019177239,0.000050476836,0.000036729245,0.000009182841,0.0035320814,0.94627637,0.048052467,0.0007965809],"about_ca_topic_score_codex":0.000004587444,"about_ca_topic_score_gemma":0.000010644509,"teacher_disagreement_score":0.96662474,"about_ca_system_score_codex":0.00026373254,"about_ca_system_score_gemma":0.000081748614,"threshold_uncertainty_score":0.99958134},"labels":[],"label_agreement":null},{"id":"W2110985552","doi":"10.1016/j.ejc.2010.09.008","title":"A generalization of Meshulam’s theorem on subsets of finite abelian groups with no 3-term arithmetic progression (II)","year":2010,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Mathematics; Abelian group; Combinatorics; Cardinality (data modeling); Arithmetic progression; Generalization; Upper and lower bounds; Term (time); Matrix (chemical analysis); Group (periodic table); Discrete mathematics; Mathematical analysis","score_opus":0.013728264792289873,"score_gpt":0.2610165575834548,"score_spread":0.24728829279116496,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2110985552","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99134696,0.0000687904,0.0014456648,0.00003761019,0.00095667184,0.00013910796,0.000005213783,0.000014551751,0.0059854616],"genre_scores_gemma":[0.99507684,0.000046697543,0.0045821853,0.000025287873,0.00012100225,4.8655625e-7,0.000002069441,0.000054857606,0.00009054979],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979522,0.00039691984,0.0007512512,0.00012819184,0.00059993,0.00017150836],"domain_scores_gemma":[0.9971866,0.00024534666,0.0013556897,0.00040074316,0.00070528314,0.000106320476],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014838896,0.00020026405,0.0004013856,0.00025052062,0.00013301443,0.000019153793,0.00045842523,0.000055578166,0.000048837006],"category_scores_gemma":[0.00048428835,0.00012696408,0.00013975211,0.00028600634,0.00018586247,0.000103648235,0.00009458605,0.0004664939,0.000001540279],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00041443782,0.0006255805,0.0041879187,0.00021768283,0.00012105694,0.00010887102,0.0020071187,0.000033455206,0.0059925923,0.983785,0.00038297227,0.0021233202],"study_design_scores_gemma":[0.00702823,0.009732114,0.02188448,0.0019182806,0.00043392414,0.0003754718,0.00014601025,0.00039470335,0.04072801,0.91459405,0.0020433983,0.0007213076],"about_ca_topic_score_codex":1.6581025e-7,"about_ca_topic_score_gemma":3.2074288e-7,"teacher_disagreement_score":0.06919093,"about_ca_system_score_codex":0.0000142284935,"about_ca_system_score_gemma":0.000039157192,"threshold_uncertainty_score":0.5177445},"labels":[],"label_agreement":null},{"id":"W2111430057","doi":"10.1007/s00493-005-0036-0","title":"Proof Of A Conjecture Of Erdős On Triangles In Set-Systems","year":2005,"lang":"en","type":"article","venue":"COMBINATORICA","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":50,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Microsoft Research","keywords":"Conjecture; Combinatorics; Mathematics; Element (criminal law); Set (abstract data type); Discrete mathematics; Law; Computer science","score_opus":0.03945362164017345,"score_gpt":0.30515233261533936,"score_spread":0.2656987109751659,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2111430057","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9637302,0.021620592,0.000085119515,0.000088850764,0.0005821958,0.000989951,0.00002486099,0.00005281928,0.012825369],"genre_scores_gemma":[0.99946606,0.00015605852,0.00019975458,0.000008282302,0.000026828271,0.000015194228,7.8392395e-7,0.000015812713,0.00011124264],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99897826,0.00012501855,0.00043282658,0.00013581489,0.00018422295,0.00014383248],"domain_scores_gemma":[0.99888784,0.00045222102,0.00023195622,0.0003519605,0.00004296748,0.00003306588],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002865261,0.00012592322,0.00048583097,0.00015693234,0.000028272685,0.000004276228,0.00021867889,0.00011381812,0.00001727587],"category_scores_gemma":[0.00021367194,0.00009210276,0.000098251854,0.00026779695,0.00006134832,0.000030473626,0.000048184127,0.00013927132,7.948347e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000043597458,0.00023546534,0.00016874797,0.00039892897,0.000031257423,0.0000028469174,0.0013213594,0.000028853732,0.000022979088,0.9898502,0.00041131058,0.007484427],"study_design_scores_gemma":[0.002508785,0.00052725285,0.00018391128,0.00051617937,0.000056365774,0.000011828307,0.00026646847,0.00021236097,0.0067162067,0.9670172,0.021716489,0.0002669529],"about_ca_topic_score_codex":0.0000043564887,"about_ca_topic_score_gemma":0.0000016794729,"teacher_disagreement_score":0.0357358,"about_ca_system_score_codex":0.000042551394,"about_ca_system_score_gemma":0.000025240455,"threshold_uncertainty_score":0.37558416},"labels":[],"label_agreement":null},{"id":"W2112241312","doi":"10.1017/s0305004113000157","title":"Extremal sequences of polynomial complexity","year":2013,"lang":"en","type":"article","venue":"Mathematical Proceedings of the Cambridge Philosophical Society","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Polynomial; Combinatorics; Mathematical analysis","score_opus":0.05878327624221276,"score_gpt":0.279125477526927,"score_spread":0.22034220128471427,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2112241312","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9750656,0.00003980574,0.00017095899,0.0053184917,0.00011314004,0.0006427047,0.000025299409,0.00007158376,0.018552432],"genre_scores_gemma":[0.9778748,0.000004522087,0.021438891,0.00023415768,0.0002446542,0.000031607327,5.343179e-7,0.000033796667,0.0001370138],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976194,0.000026208547,0.00089811004,0.00031846168,0.0007470557,0.000390798],"domain_scores_gemma":[0.99809664,0.00052057643,0.0005479382,0.00031182443,0.00037341536,0.00014961249],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064397085,0.00030362915,0.00073153386,0.000027705139,0.00026873837,0.000035776793,0.0010005019,0.0002578788,0.0002567688],"category_scores_gemma":[0.000677924,0.0001800676,0.00085818814,0.00028115223,0.002075044,0.00020468485,0.0006743244,0.0004722322,0.000009354382],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001733296,0.00021318535,0.00041430665,0.00094682275,0.00009529481,9.799767e-8,0.00069292646,2.2057789e-7,0.018349128,0.9714057,0.007788223,0.00007678547],"study_design_scores_gemma":[0.00032537602,0.000067133675,0.0011408275,0.00016502773,0.00009254514,0.000019521762,0.0002910692,0.0006155099,0.018343745,0.9787105,0.000024751804,0.0002040089],"about_ca_topic_score_codex":0.000009573535,"about_ca_topic_score_gemma":6.281914e-8,"teacher_disagreement_score":0.021267932,"about_ca_system_score_codex":0.0000463833,"about_ca_system_score_gemma":0.000026045574,"threshold_uncertainty_score":0.7645586},"labels":[],"label_agreement":null},{"id":"W2112317227","doi":"10.1017/s0963548312000107","title":"Non-Three-Colourable Common Graphs Exist","year":2012,"lang":"en","type":"article","venue":"Combinatorics Probability Computing","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":55,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Engineering and Physical Sciences Research Council","keywords":"Combinatorics; Mathematics; Conjecture; Discrete mathematics; Graph","score_opus":0.049415272058111956,"score_gpt":0.3042241545118432,"score_spread":0.25480888245373123,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2112317227","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9760177,0.00025709663,0.0013825377,0.000060190447,0.002379173,0.00068175944,0.0000029773983,0.00031732305,0.01890123],"genre_scores_gemma":[0.99342436,0.0000028099855,0.0062479246,0.000078285244,0.000108499924,0.000012871238,0.0000042009124,0.00005056982,0.00007047091],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973768,0.00018076252,0.0006813574,0.00041540686,0.00043568478,0.0009099808],"domain_scores_gemma":[0.9972179,0.0009751764,0.00030956493,0.0010244383,0.0001947954,0.00027811655],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0025438603,0.00036343202,0.0005691124,0.00011842241,0.0009725147,0.00006666311,0.00064714195,0.00022616303,0.000030547148],"category_scores_gemma":[0.0005512604,0.00032940172,0.00024132416,0.00060140586,0.00024191203,0.0002324693,0.00067810225,0.0005995775,0.00001452428],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011314292,0.00038999203,0.18429963,0.0002307496,0.00003575948,0.0000015854044,0.0011292673,0.0000096557005,0.000020730033,0.8120182,0.0005832817,0.001269813],"study_design_scores_gemma":[0.00048894755,0.00007284405,0.021167872,0.00005218774,0.0000433811,0.000017731207,0.000058229292,0.00074995897,0.00037697263,0.97620463,0.00038133372,0.00038591024],"about_ca_topic_score_codex":0.000029996825,"about_ca_topic_score_gemma":0.000007972046,"teacher_disagreement_score":0.16418642,"about_ca_system_score_codex":0.00020323157,"about_ca_system_score_gemma":0.0000367249,"threshold_uncertainty_score":0.9999158},"labels":[],"label_agreement":null},{"id":"W2112951078","doi":"10.1017/s0963548313000072","title":"Revolutionaries and Spies on Random Graphs","year":2013,"lang":"en","type":"preprint","venue":"Combinatorics Probability Computing","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Pursuit-evasion; Random graph; Combinatorics; Graph; Mathematics; Sigma; Computer science; Discrete mathematics; Physics; Mathematical optimization","score_opus":0.04521792821767961,"score_gpt":0.28755479641766407,"score_spread":0.24233686819998446,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2112951078","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98894435,0.001290809,0.0015094867,0.00025287553,0.0027649803,0.001583979,0.000015736912,0.00039217647,0.0032455912],"genre_scores_gemma":[0.99067456,0.0000787435,0.008845733,0.00007363611,0.00013076334,0.00004133438,0.00001278296,0.00005357784,0.0000888602],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99681896,0.00042418778,0.00082355086,0.0009574112,0.00049830443,0.00047760937],"domain_scores_gemma":[0.99535215,0.0023312757,0.00053080625,0.001241689,0.00039316638,0.00015093658],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0016582077,0.0005927436,0.0009567231,0.00019902927,0.00083747145,0.00019512796,0.0006093335,0.000542094,0.000019907706],"category_scores_gemma":[0.0025755912,0.000511171,0.00028502694,0.00020709368,0.00058261683,0.000071174356,0.002755256,0.001412806,0.0000036870988],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000037383164,0.00015621865,0.0037874395,0.0014590464,0.00009807865,0.0000023678786,0.0014395392,0.000086933054,0.000001701722,0.9904891,0.0009713902,0.0014707935],"study_design_scores_gemma":[0.00083104416,0.00008297441,0.0031440745,0.00041500447,0.00007183462,0.000007642112,0.000054243894,0.0019878861,0.000029911205,0.9926482,0.00021250253,0.0005147143],"about_ca_topic_score_codex":0.000027745717,"about_ca_topic_score_gemma":0.0000015863702,"teacher_disagreement_score":0.007336246,"about_ca_system_score_codex":0.00018084106,"about_ca_system_score_gemma":0.00008477529,"threshold_uncertainty_score":0.999734},"labels":[],"label_agreement":null},{"id":"W2114702003","doi":"10.1016/j.disc.2013.01.011","title":"Oriented trees in digraphs","year":2013,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":38,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Agence Nationale de la Recherche","keywords":"Digraph; Combinatorics; Conjecture; Mathematics; Order (exchange); Tree (set theory); Integer (computer science); Chromatic scale; Discrete mathematics; Computer science","score_opus":0.018996780892726,"score_gpt":0.27824834799511794,"score_spread":0.25925156710239194,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2114702003","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95928735,0.00006592972,0.0034279188,0.0001433965,0.00018193384,0.0006040042,0.000009783992,0.00015296128,0.03612673],"genre_scores_gemma":[0.96564543,0.000015155003,0.03311587,0.00008099414,0.000047379704,0.00008787178,0.0000054996535,0.000048744598,0.00095304626],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984781,0.00005633978,0.000539345,0.00023721368,0.00029967222,0.0003892888],"domain_scores_gemma":[0.9986246,0.0004501202,0.00015482314,0.00061219267,0.00006157151,0.00009669129],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027531225,0.00025084402,0.0003864426,0.00019310719,0.000119759454,0.000053835956,0.0003204561,0.00011767446,0.00062634825],"category_scores_gemma":[0.00042343666,0.00018056031,0.00014702333,0.00034883316,0.0001317664,0.0001835201,0.00014514533,0.00020656132,0.00006293467],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000041474914,0.00011447955,0.0018017519,0.00011475391,0.00003453156,0.000006083423,0.0056821066,0.000002711876,0.0002807859,0.98984313,0.0015205344,0.00059499475],"study_design_scores_gemma":[0.00039164876,0.000032028438,0.0023436863,0.00010070655,0.000022586815,0.000009904398,0.0018109515,0.0013491012,0.00042352255,0.99286205,0.0003930224,0.0002607966],"about_ca_topic_score_codex":0.000025374678,"about_ca_topic_score_gemma":0.000038568178,"teacher_disagreement_score":0.035173684,"about_ca_system_score_codex":0.00002539797,"about_ca_system_score_gemma":0.000011113313,"threshold_uncertainty_score":0.73630357},"labels":[],"label_agreement":null},{"id":"W2115768818","doi":"10.1007/s10474-015-0529-2","title":"Exact Kronecker constants of three element sets","year":2015,"lang":"en","type":"article","venue":"Acta Mathematica Academiae Scientiarum Hungaricae","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Kronecker delta; Element (criminal law); Kronecker product; Upper and lower bounds; Binary number; Constant (computer programming)","score_opus":0.07703521517883734,"score_gpt":0.33327248395132947,"score_spread":0.25623726877249214,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2115768818","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.929736,0.00030052918,0.0065847686,0.0010975149,0.001136642,0.0012402291,0.000096079144,0.00022124605,0.05958698],"genre_scores_gemma":[0.9573536,0.000017048953,0.041616306,0.00014553168,0.000073672476,0.000029003719,0.000006894583,0.00006152643,0.0006964128],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9955327,0.00018653665,0.0012467992,0.0006344683,0.0015639595,0.00083552627],"domain_scores_gemma":[0.9964654,0.0007653931,0.00076471124,0.0012243013,0.00030594622,0.00047426336],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0035633482,0.00044446788,0.0008362817,0.0003357399,0.0003004391,0.000067746536,0.0012628548,0.0003957228,0.00068890065],"category_scores_gemma":[0.0023177296,0.00034001886,0.0002621016,0.00072675943,0.0007440599,0.00038783767,0.0007836753,0.0006785579,0.00007045251],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000110265784,0.0006725756,0.0033156283,0.00062063726,0.00048267315,0.000017882969,0.008596864,0.0000049372557,0.0055651395,0.8956109,0.08212595,0.0028765213],"study_design_scores_gemma":[0.0010727695,0.0001322244,0.00064560614,0.00019792566,0.00023892472,0.00005450394,0.0008134285,0.0009699394,0.008215222,0.9820274,0.005127726,0.00050433533],"about_ca_topic_score_codex":0.000004495615,"about_ca_topic_score_gemma":0.000006681958,"teacher_disagreement_score":0.08641647,"about_ca_system_score_codex":0.000110551635,"about_ca_system_score_gemma":0.00018528651,"threshold_uncertainty_score":0.99990517},"labels":[],"label_agreement":null},{"id":"W2117446874","doi":"10.1016/j.jcta.2005.04.006","title":"Erdős–Szekeres theorem with forbidden order types","year":2005,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Combinatorics; General position; Mathematics; Regular polygon; Position (finance); Order (exchange); Plane (geometry); Type (biology); Graph; Order type; Discrete mathematics; Geometry","score_opus":0.012300289041590208,"score_gpt":0.26267693494356215,"score_spread":0.25037664590197195,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2117446874","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95960265,0.00085971947,0.0014207496,0.0007748514,0.004510173,0.00028638323,0.000008169654,0.000081981496,0.032455307],"genre_scores_gemma":[0.9869637,0.00006616029,0.009719448,0.00013443122,0.0019437502,0.0000028603536,5.283526e-7,0.00005300165,0.0011161029],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99822867,0.00028652154,0.0005666448,0.00013777071,0.00048576528,0.0002946276],"domain_scores_gemma":[0.9977036,0.00072927534,0.0005730856,0.0003502803,0.0005154699,0.00012825578],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00140331,0.0002526568,0.00050884625,0.00013729543,0.000256311,0.000075492775,0.00049323804,0.00013570122,0.0005799583],"category_scores_gemma":[0.00059263664,0.00015394716,0.00017276248,0.00022565445,0.00030690656,0.00052984117,0.00010036051,0.0004069122,0.0000044552507],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0028170135,0.000109544184,0.00010083324,0.000028198892,0.00029375032,0.0000291349,0.0017491938,0.000015756283,0.00008418003,0.99049526,0.0017799613,0.0024971485],"study_design_scores_gemma":[0.0015609652,0.00078898645,0.000048510992,0.00007994897,0.00013990821,0.00037529424,0.0007411408,0.0000026091204,0.0024428756,0.9597669,0.033838477,0.00021437324],"about_ca_topic_score_codex":6.79203e-7,"about_ca_topic_score_gemma":0.0000031822553,"teacher_disagreement_score":0.032058515,"about_ca_system_score_codex":0.000051666066,"about_ca_system_score_gemma":0.00011603392,"threshold_uncertainty_score":0.6350137},"labels":[],"label_agreement":null},{"id":"W2117625341","doi":"10.48550/arxiv.1304.1829","title":"On Double 3-Term Arithmetic Progressions","year":2013,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Arithmetic; Scripting language; Term (time); Arithmetic progression; Sequence (biology); Mathematics; Bounded function; Discrete mathematics; Computer science; Programming language; Physics","score_opus":0.12438999773915078,"score_gpt":0.23863614693267735,"score_spread":0.11424614919352656,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2117625341","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9734334,0.000037862614,0.00240827,0.00003485573,0.00089980627,0.0007383627,0.000025039833,0.00026897533,0.022153437],"genre_scores_gemma":[0.9915301,0.00005885757,0.00091997045,0.000062234394,0.00011958444,0.000005170849,0.000015485668,0.000053325286,0.0072352323],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99830484,0.00011911228,0.00023450598,0.0008224331,0.000121128876,0.0003979703],"domain_scores_gemma":[0.99768794,0.00031444657,0.0002927343,0.0013820382,0.00012644878,0.00019641391],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00017919064,0.00042253992,0.0004498931,0.00027665705,0.00034618357,0.00007339765,0.00090845744,0.0004968344,0.000605561],"category_scores_gemma":[0.000070094065,0.00037372814,0.00032920393,0.00021980374,0.00023458336,0.00009154835,0.00132564,0.00095540506,0.000114059454],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008601204,0.00016127556,0.000734614,0.00018783595,0.00014944607,0.00012965169,0.0002802571,0.0012608622,0.000005633591,0.9949248,0.0018704545,0.0002091509],"study_design_scores_gemma":[0.0007403146,0.00005718125,0.00046974653,0.00029845032,0.00018508194,0.000004815571,0.00006197182,0.0026372888,0.000097688746,0.994798,0.0001920446,0.00045743657],"about_ca_topic_score_codex":0.000023855757,"about_ca_topic_score_gemma":0.000007362797,"teacher_disagreement_score":0.018096749,"about_ca_system_score_codex":0.00012118352,"about_ca_system_score_gemma":0.00006809969,"threshold_uncertainty_score":0.9998715},"labels":[],"label_agreement":null},{"id":"W2118601530","doi":"10.48550/arxiv.math/0401069","title":"Random subgraphs of finite graphs: I. The scaling window under the triangle condition","year":2004,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":89,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; Technische Universiteit Delft; Microsoft Research","keywords":"Window (computing); Scaling; Combinatorics; Mathematics; Computer science; Discrete mathematics; Geometry; World Wide Web","score_opus":0.06438459522841702,"score_gpt":0.31053456570470395,"score_spread":0.24614997047628692,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2118601530","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9896597,0.0013328758,0.0037374366,0.0006726909,0.0014368779,0.0011744784,0.00009579058,0.00009971438,0.0017904274],"genre_scores_gemma":[0.9983368,0.00032207463,0.00027019856,0.0004746305,0.00025437487,0.00009606134,0.000045028115,0.000064289256,0.00013655351],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99731654,0.00055317534,0.00083825045,0.000452659,0.00047278008,0.00036659365],"domain_scores_gemma":[0.9944954,0.002933177,0.0008118918,0.0015185926,0.00017925649,0.000061708255],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016963271,0.00044121753,0.0007286978,0.00018381405,0.00057098886,0.000062420804,0.0010178296,0.00043566056,0.0001589642],"category_scores_gemma":[0.00060477736,0.00023297087,0.0008908623,0.0003034306,0.0007714389,0.00006483735,0.0005307787,0.0011323872,0.000008176638],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00068137574,0.0002760803,0.022189876,0.00090902904,0.0020101483,0.000017461236,0.009851565,0.0065218536,0.00046394946,0.9552615,0.0011418146,0.0006752901],"study_design_scores_gemma":[0.002249408,0.000031638152,0.020638414,0.00035357042,0.0004638329,0.000008320289,0.00086741196,0.000046900775,0.0017196818,0.9731672,0.00015700937,0.00029663678],"about_ca_topic_score_codex":0.000071148635,"about_ca_topic_score_gemma":0.00003166404,"teacher_disagreement_score":0.017905619,"about_ca_system_score_codex":0.000044116627,"about_ca_system_score_gemma":0.00012333115,"threshold_uncertainty_score":0.95002764},"labels":[],"label_agreement":null},{"id":"W2122388370","doi":"10.1016/j.tcs.2007.03.003","title":"Bounds on the bisection width for random d -regular graphs","year":2007,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":32,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Generalitat de Catalunya","keywords":"Bisection; Mathematics; Upper and lower bounds; Asymptotically optimal algorithm; Combinatorics; Bisection method; Random graph; Discrete mathematics; Value (mathematics); Graph; Algorithm; Statistics; Geometry; Mathematical analysis","score_opus":0.022499315483579776,"score_gpt":0.2983433027230205,"score_spread":0.27584398723944076,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2122388370","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32676908,0.0000084203875,0.6670584,0.00040348695,0.00084994955,0.00035988036,0.000001590401,0.00007554454,0.004473636],"genre_scores_gemma":[0.97354037,0.0000012809477,0.025444074,0.0007496388,0.0002221246,0.0000097615775,3.5894394e-7,0.00001261357,0.000019765428],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998372,0.00007972091,0.00024325858,0.0003453978,0.00049567776,0.0004639399],"domain_scores_gemma":[0.9964117,0.002749469,0.00006719267,0.0005560385,0.00009836094,0.0001172791],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0052915914,0.00015336329,0.00017091559,0.0001439605,0.0012186251,0.0001309035,0.0007750884,0.000059320148,0.000035566034],"category_scores_gemma":[0.0004862887,0.00008243805,0.00013860689,0.00052269374,0.0035741848,0.00008610866,0.00016297936,0.0001675177,0.0000038576304],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001725548,0.00003143715,0.000011378028,0.000006978835,0.0000079356705,0.000001163152,0.0003934057,0.000004175745,0.00029405576,0.99179,0.00020363815,0.007083295],"study_design_scores_gemma":[0.00048410002,0.00023042607,0.0002566615,0.000019773484,0.000014274053,0.0000116008805,0.00001782191,0.006552978,0.0075314436,0.98445344,0.00029906543,0.00012843088],"about_ca_topic_score_codex":4.830711e-7,"about_ca_topic_score_gemma":5.766488e-7,"teacher_disagreement_score":0.6467713,"about_ca_system_score_codex":0.000030120944,"about_ca_system_score_gemma":0.000023132367,"threshold_uncertainty_score":0.9991375},"labels":[],"label_agreement":null},{"id":"W2122491543","doi":"10.1016/j.jalgor.2004.04.005","title":"Estimating the maximum","year":2004,"lang":"en","type":"article","venue":"Journal of Algorithms","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Mathematics; Combinatorics; Graph; Sample (material); Property (philosophy); Sampling (signal processing); Maximum likelihood; Discrete mathematics; Sample complexity; Algorithm; Statistics; Computer science; Artificial intelligence","score_opus":0.02866371422076207,"score_gpt":0.30652404181212844,"score_spread":0.27786032759136636,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2122491543","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.78645045,0.0005018664,0.20299786,0.002304927,0.0034548321,0.00014625688,0.0000030764415,0.00003320968,0.004107541],"genre_scores_gemma":[0.55989516,0.0000092534865,0.43868947,0.00021993394,0.0011056062,6.8850034e-7,8.50498e-8,0.000017546072,0.00006228042],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99910617,0.00003650102,0.0003663852,0.00005380968,0.00029751295,0.00013960837],"domain_scores_gemma":[0.9991069,0.00020041542,0.00035000427,0.00017506426,0.00011649593,0.000051113784],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007297564,0.000087537344,0.00017097553,0.000054304797,0.00020805423,0.00003363773,0.0003154139,0.000043475822,0.000035377],"category_scores_gemma":[0.0003391358,0.000044420707,0.0001494527,0.00009934973,0.00007556829,0.00010116661,0.000051280436,0.00030339626,0.0000024005096],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010280137,0.00031980805,0.00036349185,0.00013531778,0.00065440073,0.0004912749,0.016576966,0.0070841624,0.00054573617,0.77539253,0.004776479,0.19355701],"study_design_scores_gemma":[0.0004486416,0.00009090692,0.00022312219,0.000056968343,0.00004124227,0.00073598756,0.00021943774,0.00031493686,0.0004599354,0.99678767,0.0005578065,0.000063354295],"about_ca_topic_score_codex":0.00000236282,"about_ca_topic_score_gemma":5.233372e-7,"teacher_disagreement_score":0.2356916,"about_ca_system_score_codex":0.000034084504,"about_ca_system_score_gemma":0.000041613323,"threshold_uncertainty_score":0.18114239},"labels":[],"label_agreement":null},{"id":"W2122813432","doi":"10.1016/j.disc.2008.09.009","title":"Acyclic improper colourings of graphs with bounded maximum degree","year":2008,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Fonds Québécois de la Recherche sur la Nature et les Technologies; Commonwealth Scholarship Commission","keywords":"Mathematics; Combinatorics; Infimum and supremum; Degree (music); Bipartite graph; Bounded function; Discrete mathematics; Graph","score_opus":0.05244063705834468,"score_gpt":0.273282174174059,"score_spread":0.2208415371157143,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2122813432","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9756485,0.000074136595,0.0043145968,0.000047824607,0.00009245971,0.00047960135,0.000023070726,0.00012636755,0.019193422],"genre_scores_gemma":[0.90691715,0.000037847785,0.092031755,0.000049091628,0.000033513123,0.000028775461,0.000004289782,0.00008259621,0.00081496296],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998074,0.000050489045,0.00061932736,0.00028826142,0.0005539006,0.00041404186],"domain_scores_gemma":[0.9981107,0.00031523977,0.00042175033,0.0008745393,0.00015564213,0.00012214629],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030531478,0.00034825507,0.0006366924,0.00015284849,0.00035045005,0.000023138551,0.00048695045,0.00014572935,0.00013608525],"category_scores_gemma":[0.0002069443,0.00022247751,0.00021307959,0.00030612483,0.00063474965,0.00013278231,0.00018034354,0.00024273958,0.000008353795],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000119635595,0.000281151,0.0019982385,0.00096990395,0.00033857315,0.00006315821,0.0138729755,0.0000030084532,0.0011116791,0.98001117,0.0009220992,0.00030839263],"study_design_scores_gemma":[0.0009077826,0.00024898016,0.0009459308,0.00017221172,0.00015380385,0.00028314156,0.00083713065,0.00016037788,0.006206435,0.98940605,0.00026873033,0.00040940082],"about_ca_topic_score_codex":0.000010765231,"about_ca_topic_score_gemma":0.000008933928,"teacher_disagreement_score":0.08771716,"about_ca_system_score_codex":0.00002509044,"about_ca_system_score_gemma":0.000050185685,"threshold_uncertainty_score":0.90723693},"labels":[],"label_agreement":null},{"id":"W2123221405","doi":"10.37236/1659","title":"The Number of Labeled 2-Connected Planar Graphs","year":2002,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":89,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Australian Research Council; Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Planar graph; Chordal graph; 1-planar graph; Clique-sum; Discrete mathematics; Indifference graph; Graph","score_opus":0.016423206286779457,"score_gpt":0.2645024867667231,"score_spread":0.24807928047994365,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2123221405","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.988877,0.0049046227,0.0003304895,0.0007622265,0.00070139946,0.00014028167,0.00000159607,0.000018646606,0.004263746],"genre_scores_gemma":[0.99715704,0.0020827393,0.000028332175,0.00004684695,0.000064163134,0.000001578325,1.4153957e-7,0.000024289338,0.0005948835],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998008,0.00029637912,0.0006218314,0.00007855947,0.0005045128,0.00049070927],"domain_scores_gemma":[0.996682,0.0017465121,0.0007634301,0.00043738307,0.00031688975,0.000053808708],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001543184,0.00016365814,0.00033878372,0.000057955982,0.00042263157,0.000024690245,0.00090523117,0.000084542546,0.000074078984],"category_scores_gemma":[0.00052968157,0.0000802781,0.00023829883,0.00043856894,0.00019398071,0.00007105669,0.00004725749,0.00082122284,0.0000031794311],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000604631,0.00008915253,0.00031063095,0.0000125595225,0.0002725389,0.0000037925572,0.00064696535,9.391431e-7,0.00009711909,0.99552333,0.0026626028,0.0003199095],"study_design_scores_gemma":[0.00082136097,0.00020969455,0.000107161904,0.000021564556,0.00012612656,0.00029325276,0.00018594532,0.000031940683,0.0008861713,0.9940214,0.0031976476,0.000097732496],"about_ca_topic_score_codex":0.0000020247028,"about_ca_topic_score_gemma":0.00000308952,"teacher_disagreement_score":0.008280034,"about_ca_system_score_codex":0.00008203099,"about_ca_system_score_gemma":0.00006385277,"threshold_uncertainty_score":0.35678503},"labels":[],"label_agreement":null},{"id":"W2125752997","doi":"10.1007/s00493-009-2362-0","title":"Hamilton cycles in highly connected and expanding graphs","year":2009,"lang":"en","type":"article","venue":"COMBINATORICA","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":58,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Mathematics; Combinatorics; Disjoint sets; Cograph; Indifference graph; Random graph; Enhanced Data Rates for GSM Evolution; Discrete mathematics; Pathwidth; Graph; Variety (cybernetics); Chordal graph; 1-planar graph; Line graph; Computer science; Artificial intelligence","score_opus":0.022547729658570406,"score_gpt":0.29615728101104155,"score_spread":0.27360955135247117,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2125752997","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9925133,0.00050016504,0.000028705526,0.000105597,0.00024404621,0.00013344007,0.0000013005919,0.00010106109,0.0063723847],"genre_scores_gemma":[0.9992325,0.000108825036,0.00045052107,0.000110628345,0.000014787739,0.00000458808,0.000001212442,0.000011889896,0.000065084125],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99916124,0.00006900541,0.00021436643,0.00020350495,0.00012662407,0.00022526177],"domain_scores_gemma":[0.9993289,0.00027566717,0.00006379882,0.00023937394,0.000025985071,0.00006627045],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019042144,0.00013996163,0.00023736178,0.00017240978,0.00014746575,0.000027119633,0.00014374252,0.000093230236,0.000010581493],"category_scores_gemma":[0.00014980248,0.000118970835,0.000042120053,0.0002860044,0.000054933906,0.00007620491,0.000037777263,0.00016190573,9.827257e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016143582,0.00006790925,0.0028175376,0.000017212922,0.000007913251,0.000015947435,0.0011458468,1.7694754e-7,0.00042846586,0.99329287,0.00046138404,0.0017285823],"study_design_scores_gemma":[0.00070035394,0.000091265116,0.028819803,0.000037628044,0.000010233145,0.000008152142,0.00009199074,0.000027029786,0.0008473497,0.9688726,0.0003369795,0.00015659396],"about_ca_topic_score_codex":0.0000049029895,"about_ca_topic_score_gemma":0.0000016801581,"teacher_disagreement_score":0.026002266,"about_ca_system_score_codex":0.0000303815,"about_ca_system_score_gemma":0.0000061417772,"threshold_uncertainty_score":0.48514897},"labels":[],"label_agreement":null},{"id":"W2126679330","doi":"10.46298/dmtcs.459","title":"Ore and Erdős type conditions for long cycles in balanced bipartite graphs","year":2009,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"Akademia Górniczo-Hutnicza im. Stanislawa Staszica","keywords":"Bipartite graph; Conjecture; Combinatorics; Mathematics; Type (biology); Graph; Order (exchange); Discrete mathematics; Geology; Business","score_opus":0.019825292058108228,"score_gpt":0.31279358187684275,"score_spread":0.2929682898187345,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2126679330","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.80276704,0.00004999918,0.1938258,0.00044680672,0.00022898144,0.0006123616,0.000019122203,0.00010399017,0.0019458922],"genre_scores_gemma":[0.877762,0.0000101714795,0.12191047,0.00023499377,0.000043490956,0.000012187587,0.00000359941,0.000014818257,0.000008230336],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99818206,0.000049799477,0.00043562433,0.00045015902,0.00036180316,0.0005205618],"domain_scores_gemma":[0.99825996,0.0008086797,0.000112216876,0.0005024734,0.00013764646,0.0001790497],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010521279,0.00023792872,0.00037667112,0.0002261937,0.00045219282,0.00017632215,0.0005679213,0.00008312607,0.00003349358],"category_scores_gemma":[0.00046238597,0.00017556011,0.00008791866,0.00062135427,0.0019579467,0.00020802623,0.00019905843,0.00017044638,0.0000023352798],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016903565,0.000066233086,0.00023941603,0.00006733357,0.0000070697465,0.0000045241536,0.0015379087,0.00000937991,0.00030750735,0.9967558,0.00004742335,0.00094051554],"study_design_scores_gemma":[0.0003403193,0.00015829894,0.002781671,0.00013714051,0.000024301084,0.000024258012,0.00007570302,0.06192377,0.00046779367,0.9338245,0.0000070465735,0.00023519823],"about_ca_topic_score_codex":3.2538657e-7,"about_ca_topic_score_gemma":0.0000015200468,"teacher_disagreement_score":0.07499498,"about_ca_system_score_codex":0.00002057121,"about_ca_system_score_gemma":0.000032155123,"threshold_uncertainty_score":0.7214137},"labels":[],"label_agreement":null},{"id":"W2127274797","doi":"10.1017/s0963548306007760","title":"Rainbow Turán Problems","year":2006,"lang":"en","type":"article","venue":"Combinatorics Probability Computing","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":78,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"National Science Foundation","keywords":"Combinatorics; Bipartite graph; Rainbow; Mathematics; Graph; Complete bipartite graph; Discrete mathematics; Physics","score_opus":0.03322687722485506,"score_gpt":0.2691535873263459,"score_spread":0.23592671010149086,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2127274797","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9718006,0.0002286392,0.0059921904,0.00014355629,0.0012152237,0.0007405848,0.0000031330594,0.0005612157,0.019314816],"genre_scores_gemma":[0.9898849,0.0000013417298,0.009523256,0.00004404484,0.00020431828,0.000009378255,0.0000054091793,0.00004041722,0.0002869151],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976746,0.00020798921,0.00066091673,0.00052013225,0.00040079822,0.00053557305],"domain_scores_gemma":[0.99786735,0.000795099,0.00025757926,0.0007515493,0.00024176131,0.00008663705],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014905289,0.00029575228,0.00040128487,0.00009211451,0.0006431299,0.0000784458,0.0004992655,0.00017326775,0.000024664792],"category_scores_gemma":[0.00060700753,0.00026166983,0.00018532437,0.00047395847,0.00018973669,0.000098789846,0.00045111033,0.0004077055,0.000006351567],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004852942,0.0002565474,0.011614068,0.00026873607,0.00001602967,0.0000035388925,0.0004305629,0.00016972207,0.00005320627,0.9851656,0.0009932732,0.0010238419],"study_design_scores_gemma":[0.00049784646,0.000051199575,0.0034710693,0.00004837302,0.000020246562,0.000014208052,0.000020059753,0.0017244545,0.00031127204,0.9920498,0.0014762096,0.00031523907],"about_ca_topic_score_codex":0.000030396966,"about_ca_topic_score_gemma":0.000004744877,"teacher_disagreement_score":0.019027902,"about_ca_system_score_codex":0.0001667735,"about_ca_system_score_gemma":0.000043355405,"threshold_uncertainty_score":0.99998355},"labels":[],"label_agreement":null},{"id":"W2131538623","doi":"10.48550/arxiv.1508.02350","title":"Approximate Polynomial Structure in Additively Large Sets","year":2015,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"York University; National Science Foundation","keywords":"Natural density; Logarithm; Natural number; Mathematics; Polynomial; Set (abstract data type); Geometric progression; Banach space; Natural (archaeology); Discrete mathematics; Arithmetic; Pure mathematics; Computer science; Mathematical analysis","score_opus":0.09290400996201294,"score_gpt":0.23069514902709282,"score_spread":0.1377911390650799,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2131538623","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9873798,0.00007294957,0.001467272,0.000019366486,0.0009435431,0.00054509914,0.001547426,0.0001686139,0.007855951],"genre_scores_gemma":[0.9977173,0.000040431638,0.0008199893,0.0000662252,0.00018313763,0.0000011745843,0.00012524921,0.00006295612,0.0009834991],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976767,0.00028863744,0.00033123678,0.0009675932,0.00014004981,0.00059578475],"domain_scores_gemma":[0.99807364,0.00019784304,0.00036517694,0.0009915665,0.00016138676,0.00021036701],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00044435504,0.0005246202,0.00068374845,0.0004071101,0.00016927673,0.00004758513,0.00096381706,0.0007848786,0.0003597529],"category_scores_gemma":[0.00021311897,0.00053260947,0.00024871086,0.00035654154,0.00017780683,0.00015504597,0.0018959976,0.0012951541,0.000011097488],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00048281212,0.0002308283,0.005353937,0.000510801,0.00032661884,0.00092124206,0.0031168016,0.004967455,0.000023097582,0.9691562,0.014654553,0.00025566533],"study_design_scores_gemma":[0.0014986169,0.00003461798,0.0010424368,0.00014527513,0.0001332655,0.000010157405,0.00048364096,0.010945221,0.00006539452,0.98363197,0.001325872,0.0006835196],"about_ca_topic_score_codex":0.000055481414,"about_ca_topic_score_gemma":0.00023659877,"teacher_disagreement_score":0.014475793,"about_ca_system_score_codex":0.00032417988,"about_ca_system_score_gemma":0.00020858577,"threshold_uncertainty_score":0.9997125},"labels":[],"label_agreement":null},{"id":"W2132073309","doi":"10.1016/s0012-365x(03)00197-3","title":"Coloring the hypergraph of maximal cliques of a graph with no long path","year":2003,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":80,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University","funders":"","keywords":"Combinatorics; Hypergraph; Mathematics; Graph; Discrete mathematics; Fractional coloring; Graph coloring; Graph power; Line graph","score_opus":0.01983438949883126,"score_gpt":0.2645574246920283,"score_spread":0.24472303519319705,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2132073309","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96037126,0.0001807808,0.009593562,0.000020727228,0.00011459529,0.0004901582,0.000026854252,0.000051474253,0.029150564],"genre_scores_gemma":[0.938718,0.000048177877,0.06096557,0.000021288139,0.00002175875,0.000023534052,0.000001569577,0.00004774001,0.0001523098],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99831903,0.00012579978,0.0006320896,0.00019151645,0.00044543738,0.0002861281],"domain_scores_gemma":[0.9977267,0.0007096579,0.0005254144,0.0007640027,0.0002175485,0.00005672225],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00076667673,0.00026092326,0.0005426381,0.00010285179,0.00015762389,0.000018869454,0.00038658272,0.000095073134,0.00006837171],"category_scores_gemma":[0.00047241306,0.00014030647,0.00022659721,0.00032398143,0.00047710098,0.000078118945,0.00008088152,0.00019310163,0.0000014173652],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000045167915,0.000115977244,0.0024464624,0.0008516118,0.0001942669,0.000005380145,0.0039880914,0.0000065579857,0.00041531515,0.99178046,0.00009015909,0.000060569233],"study_design_scores_gemma":[0.0004617232,0.00033094516,0.00048808928,0.00043524508,0.00025372667,0.000053260148,0.0022729845,0.00012659395,0.014566562,0.98057973,0.0001419806,0.0002891724],"about_ca_topic_score_codex":0.000005016496,"about_ca_topic_score_gemma":0.000006680158,"teacher_disagreement_score":0.05137201,"about_ca_system_score_codex":0.000010134231,"about_ca_system_score_gemma":0.00003460034,"threshold_uncertainty_score":0.57215315},"labels":[],"label_agreement":null},{"id":"W2133964621","doi":"10.1016/s0012-365x(00)00309-5","title":"On an adjacency property of almost all graphs","year":2001,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University","funders":"","keywords":"Mathematics; Adjacency list; Combinatorics; Property (philosophy); Discrete mathematics","score_opus":0.04621793690242231,"score_gpt":0.31474598516234925,"score_spread":0.26852804825992693,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2133964621","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.93495154,0.00004208688,0.0020906986,0.00009494427,0.00018990833,0.0005194897,0.000034041102,0.00014810049,0.061929207],"genre_scores_gemma":[0.96913487,0.00008766312,0.028814591,0.00017245227,0.000054008957,0.000023723811,0.00001533449,0.00008385354,0.0016135095],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981708,0.00009375111,0.00060595723,0.00029152905,0.0004784828,0.00035948848],"domain_scores_gemma":[0.9980959,0.0003162953,0.00030540116,0.0010389333,0.00010319073,0.00014023682],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048166947,0.00030768974,0.00048306058,0.00013868224,0.00014753395,0.000027512908,0.00045347435,0.00014119835,0.00036964667],"category_scores_gemma":[0.0003982657,0.00017651904,0.00020833852,0.00023162493,0.00018402997,0.0001379239,0.000112833215,0.00020800742,0.000014518439],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000049751045,0.0003822846,0.00029221684,0.00031193413,0.000089405024,0.000014562601,0.005138301,0.0000058836276,0.00035831158,0.9911204,0.0012145176,0.0010224249],"study_design_scores_gemma":[0.00037246125,0.00029832768,0.00016000544,0.00016354308,0.000092821014,0.000035936202,0.00041872042,0.0007199432,0.0011274191,0.9952772,0.001035806,0.00029778696],"about_ca_topic_score_codex":0.000014542732,"about_ca_topic_score_gemma":0.0000127367475,"teacher_disagreement_score":0.0603157,"about_ca_system_score_codex":0.000018596782,"about_ca_system_score_gemma":0.000018362203,"threshold_uncertainty_score":0.7198237},"labels":[],"label_agreement":null},{"id":"W2139177710","doi":"10.1007/s00493-015-2662-5","title":"Counting flags in triangle-free digraphs","year":2016,"lang":"en","type":"article","venue":"COMBINATORICA","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":23,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada; Univerzita Karlova v Praze; National Science Foundation","keywords":"Digraph; Flag (linear algebra); FLAGS register; Upper and lower bounds; Backslash","score_opus":0.02876470606477036,"score_gpt":0.2769097246493653,"score_spread":0.24814501858459495,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2139177710","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9553766,0.00038343505,0.00040564116,0.00067107775,0.0012764527,0.00028591522,0.00000954926,0.00019634022,0.041394964],"genre_scores_gemma":[0.9983598,0.000039096136,0.0004980836,0.000066524095,0.00005471369,0.00001776299,3.500978e-7,0.000027088407,0.00093657133],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99879795,0.00009561287,0.0003206386,0.00023244243,0.00023336158,0.0003199694],"domain_scores_gemma":[0.9981804,0.00091627345,0.000112906324,0.00067344913,0.000051722145,0.00006524744],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005394027,0.00015423588,0.00028751462,0.00016661473,0.00012323423,0.000019292158,0.00051617785,0.000106887645,0.000106887856],"category_scores_gemma":[0.0014513361,0.00009682389,0.00011076509,0.00033196443,0.00008224456,0.00011288971,0.00021813034,0.0001255423,0.0000126285595],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021185422,0.00006784812,0.008060409,0.000024809542,0.000015442516,0.00001528017,0.00028235582,1.7239906e-8,0.0002106089,0.9792902,0.006922529,0.00508931],"study_design_scores_gemma":[0.001846789,0.000039941006,0.0028029047,0.00007363006,0.000010945274,0.0000046492332,0.000034222117,0.0000029379805,0.0006470815,0.9852376,0.00912793,0.00017139627],"about_ca_topic_score_codex":0.000006238297,"about_ca_topic_score_gemma":0.000005227669,"teacher_disagreement_score":0.04298318,"about_ca_system_score_codex":0.00006984391,"about_ca_system_score_gemma":0.000019334624,"threshold_uncertainty_score":0.39483637},"labels":[],"label_agreement":null},{"id":"W2139746216","doi":"10.1016/j.jcta.2005.02.005","title":"The Ramsey number for hypergraph cycles I","year":2005,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":62,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Hypergraph; Combinatorics; Mathematics; Monochromatic color; Ramsey's theorem; Discrete mathematics; Graph; Physics","score_opus":0.016230243126950247,"score_gpt":0.29848306450790657,"score_spread":0.2822528213809563,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2139746216","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96351427,0.0012456105,0.0016535652,0.002548127,0.018330256,0.0005676415,0.000016854645,0.00007019696,0.0120534515],"genre_scores_gemma":[0.99042356,0.00021354263,0.0050700633,0.0001262358,0.0031364725,0.000010382055,3.7814382e-7,0.000041668623,0.0009776993],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983738,0.00025376427,0.0006515559,0.000100863675,0.00033378636,0.00028619543],"domain_scores_gemma":[0.99608135,0.0025816003,0.0005608351,0.00031343522,0.00036632526,0.00009644907],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002551462,0.00018530864,0.0003629862,0.000050327144,0.00070656836,0.00010191613,0.0005643207,0.000119174976,0.000083151055],"category_scores_gemma":[0.001202929,0.00010621118,0.00041152723,0.00011263785,0.0002913286,0.00031660855,0.000079290425,0.0002880373,0.0000021267547],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0017315528,0.00006430627,0.00006413922,0.000016722026,0.0001879509,0.000002736144,0.00069731165,0.000002591167,0.00008013212,0.9841582,0.0069768173,0.0060175355],"study_design_scores_gemma":[0.001095348,0.0001974117,0.000032104097,0.000024035884,0.000074799726,0.00012873113,0.00051830045,0.0000020638333,0.0013318574,0.8122138,0.18426554,0.00011604052],"about_ca_topic_score_codex":2.513207e-7,"about_ca_topic_score_gemma":0.000001146919,"teacher_disagreement_score":0.17728873,"about_ca_system_score_codex":0.000038153095,"about_ca_system_score_gemma":0.000056886027,"threshold_uncertainty_score":0.54344237},"labels":[],"label_agreement":null},{"id":"W2139757566","doi":"10.1017/s0963548302005254","title":"Random Regular Graphs of Non-Constant Degree: Independence and Chromatic Number","year":2002,"lang":"en","type":"article","venue":"Combinatorics Probability Computing","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":35,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Trinity College","funders":"","keywords":"Mathematics; Combinatorics; Chromatic scale; Vertex (graph theory); Constant (computer programming); Independence number; Random graph; Degree (music); Discrete mathematics; Graph; Random regular graph; Chordal graph; 1-planar graph; Physics","score_opus":0.041858826617103745,"score_gpt":0.2727915680550093,"score_spread":0.23093274143790557,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2139757566","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9882004,0.000306347,0.003976853,0.00003349477,0.00038291235,0.0006271898,0.000003008465,0.000092041206,0.006377735],"genre_scores_gemma":[0.9885236,0.00002368831,0.0113511775,0.000018403282,0.000018894818,0.0000054467137,6.287436e-7,0.000024652116,0.000033529348],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977479,0.00023206523,0.00075622957,0.0004319802,0.0004731087,0.0003587218],"domain_scores_gemma":[0.99730617,0.0012159054,0.0003864436,0.000722592,0.00025123445,0.00011768109],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016036783,0.00027065317,0.00063326326,0.00008455788,0.00035231456,0.000036468387,0.0003796426,0.00018909652,0.000055376688],"category_scores_gemma":[0.0010244113,0.0002357312,0.00014910928,0.00045443757,0.00045417124,0.00011007327,0.00041283807,0.0003724901,0.0000022398392],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023981831,0.00030751113,0.03401946,0.0011697956,0.00008195661,0.000009488201,0.0032180946,0.000010551784,0.00014972326,0.9560513,0.00015419623,0.0048039444],"study_design_scores_gemma":[0.001623713,0.00006377481,0.0026160504,0.00018345693,0.000053691132,0.000050351246,0.000086687,0.009089033,0.00063266535,0.98533285,0.000012280321,0.00025542942],"about_ca_topic_score_codex":0.000008548182,"about_ca_topic_score_gemma":0.0000013782072,"teacher_disagreement_score":0.031403407,"about_ca_system_score_codex":0.000058978938,"about_ca_system_score_gemma":0.000021683412,"threshold_uncertainty_score":0.961284},"labels":[],"label_agreement":null},{"id":"W2139855799","doi":"10.1017/s0963548315000073","title":"Forcing a sparse minor","year":2015,"lang":"en","type":"article","venue":"Combinatorics Probability Computing","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Graph; Focus (optics); Forcing (mathematics); Minor (academic); Degree (music); Variation (astronomy)","score_opus":0.135359305568294,"score_gpt":0.32419449488056934,"score_spread":0.18883518931227533,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2139855799","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97735786,0.00014075685,0.008050636,0.00009198101,0.0015931614,0.00044705885,0.0000015234268,0.00033193332,0.011985111],"genre_scores_gemma":[0.9828599,6.839853e-7,0.016773801,0.000064848566,0.00013274488,0.0000051269626,0.000001720258,0.0000314729,0.00012967859],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980093,0.00020615982,0.00050172437,0.00042194143,0.00040720924,0.00045366623],"domain_scores_gemma":[0.9978553,0.000638964,0.00020493768,0.00072371156,0.00033725583,0.00023982019],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020843453,0.000240693,0.00037376146,0.0000827787,0.00034836834,0.00005842521,0.000457458,0.0001330916,0.000008788966],"category_scores_gemma":[0.0025756352,0.00021537229,0.00013349496,0.00038224307,0.00012879597,0.00011281807,0.00059421855,0.0003269948,0.000007998065],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015613448,0.00015158567,0.013065217,0.00013717542,0.000022219489,0.0000067770493,0.002738713,0.00005435577,0.000009459444,0.98082936,0.0009920789,0.0019774577],"study_design_scores_gemma":[0.0006771969,0.00008605918,0.0005047823,0.00003991181,0.000024322668,0.000019765295,0.00018693315,0.0036433414,0.00022996221,0.99358505,0.00074263406,0.00026002774],"about_ca_topic_score_codex":0.000012068129,"about_ca_topic_score_gemma":0.0000023843224,"teacher_disagreement_score":0.012755716,"about_ca_system_score_codex":0.00022492686,"about_ca_system_score_gemma":0.00009262979,"threshold_uncertainty_score":0.8782627},"labels":[],"label_agreement":null},{"id":"W2139991023","doi":"10.1002/rsa.10065","title":"The shortest disjunctive normal form of a random Boolean function","year":2003,"lang":"en","type":"article","venue":"Random Structures and Algorithms","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Mathematics; Combinatorics; Upper and lower bounds; Boolean function; Logarithm; Function (biology); Discrete mathematics; Parity function; Disjunctive normal form; Binary logarithm; Mathematical proof; Boolean expression","score_opus":0.012298840770661462,"score_gpt":0.2507774985054351,"score_spread":0.23847865773477367,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2139991023","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.93041545,0.004910425,0.047350824,0.00010859487,0.0025468776,0.0015812931,0.00008399004,0.00012255013,0.012879996],"genre_scores_gemma":[0.9973463,0.00023247709,0.001847031,0.000051017683,0.00017495171,0.000023792005,0.0000045458814,0.000028508388,0.00029139465],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99843985,0.00018038329,0.00045665982,0.0002638102,0.0003165405,0.00034276038],"domain_scores_gemma":[0.9979519,0.0012682182,0.0002263153,0.00035320385,0.00010408144,0.000096283045],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00073988846,0.0002715954,0.00046929857,0.000062440726,0.0007930304,0.00006391481,0.00017048516,0.00012227034,0.00007183974],"category_scores_gemma":[0.00046284942,0.00014711666,0.00021418581,0.00014053589,0.00035470974,0.000118657474,0.00006244923,0.0002446493,3.4634814e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0024412428,0.000033381344,0.0010642473,0.00007198027,0.000411076,0.0000046474656,0.0019236628,0.000013054966,0.00020813617,0.9474118,0.00063167466,0.045785103],"study_design_scores_gemma":[0.009309184,0.0001684351,0.003420918,0.000020824275,0.00019594419,0.000060683764,0.0007796978,0.00034122172,0.00118918,0.9798094,0.004466471,0.00023804014],"about_ca_topic_score_codex":0.000012748667,"about_ca_topic_score_gemma":0.000020347974,"teacher_disagreement_score":0.06693083,"about_ca_system_score_codex":0.000013574014,"about_ca_system_score_gemma":0.000025569147,"threshold_uncertainty_score":0.6099429},"labels":[],"label_agreement":null},{"id":"W2140299153","doi":"10.46298/dmtcs.3426","title":"Pairwise Intersections and Forbidden Configurations","year":2005,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Conjecture; Intersection (aeronautics); Bar (unit); Stability theorem; Mathematical analysis; Physics","score_opus":0.019685718830021712,"score_gpt":0.2905213732298639,"score_spread":0.27083565439984214,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2140299153","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2174613,0.000023685445,0.755322,0.0009890284,0.00028973253,0.0003575997,0.000011846925,0.00020030467,0.025344515],"genre_scores_gemma":[0.7643785,0.000004401539,0.2352014,0.0001936426,0.00015051037,0.000012491366,8.859374e-7,0.000016917218,0.000041242936],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982162,0.000058602425,0.00042132306,0.0004206845,0.00045769685,0.0004255089],"domain_scores_gemma":[0.9982066,0.00069124723,0.00010832731,0.0006084026,0.00014285509,0.00024255055],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0010220852,0.000228973,0.00027561514,0.0001756436,0.0009168018,0.00025611694,0.0006080017,0.00007016879,0.00027715942],"category_scores_gemma":[0.00038190372,0.00016673814,0.0000976503,0.00035978976,0.00329579,0.00033582165,0.00052095274,0.00022398097,0.000017522809],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003830277,0.000050676805,0.000011870129,0.00003255654,0.000013786656,0.0000015723055,0.0043607666,0.0000044277376,0.0002615205,0.9923724,0.00015426624,0.0027323442],"study_design_scores_gemma":[0.00017493506,0.000072062096,0.00006558066,0.000053577874,0.000035033372,0.000075510994,0.0002932256,0.1187637,0.00074545783,0.8793339,0.00017095206,0.00021606318],"about_ca_topic_score_codex":8.325736e-7,"about_ca_topic_score_gemma":0.0000028448521,"teacher_disagreement_score":0.5469172,"about_ca_system_score_codex":0.000033695367,"about_ca_system_score_gemma":0.000034915225,"threshold_uncertainty_score":0.99941665},"labels":[],"label_agreement":null},{"id":"W2140423070","doi":"10.1002/jgt.20575","title":"The chromatic Ramsey number of odd wheels","year":2011,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Royal Military College of Canada","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Chromatic scale; Conjecture; Monochromatic color; Friendship graph; Graph; Windmill graph; Critical graph; Ramsey's theorem; Discrete mathematics; Graph power; Line graph; Physics","score_opus":0.0401793681449592,"score_gpt":0.29804219593713077,"score_spread":0.25786282779217157,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2140423070","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9616263,0.00089305645,0.0019934822,0.000044238546,0.0010298274,0.00014022127,0.0000040053055,0.000017927478,0.03425093],"genre_scores_gemma":[0.9935913,0.0002191511,0.005592877,0.00007050008,0.00013518395,0.0000018461022,9.618275e-8,0.000029335135,0.00035968257],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978887,0.00048233962,0.00089289516,0.00008959391,0.0004040692,0.00024241663],"domain_scores_gemma":[0.9964891,0.0015780211,0.0011043119,0.0004752506,0.00025880805,0.00009448593],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034715622,0.00017401719,0.0004220196,0.00012710728,0.00025396977,0.000019002737,0.0007148056,0.00010329627,0.00049391197],"category_scores_gemma":[0.0007451104,0.00009229571,0.00047698012,0.00020550872,0.0005169226,0.00014841794,0.000088736815,0.0003565001,0.0000049891764],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027229765,0.00009468562,0.0011288237,0.00006612505,0.0003626582,0.000016010288,0.0043690326,2.4436923e-7,0.0002389381,0.9891183,0.0013824961,0.00295042],"study_design_scores_gemma":[0.00042840024,0.00012324553,0.0022462162,0.00012136008,0.00015796382,0.00030313537,0.0009871831,0.0000016131479,0.0025230513,0.9925692,0.00042825166,0.00011039302],"about_ca_topic_score_codex":0.0000017313776,"about_ca_topic_score_gemma":0.0000013638482,"teacher_disagreement_score":0.033891246,"about_ca_system_score_codex":0.000014674671,"about_ca_system_score_gemma":0.000043162152,"threshold_uncertainty_score":0.54079896},"labels":[],"label_agreement":null},{"id":"W2143139971","doi":"10.4171/jems/484","title":"A density version of the Carlson–Simpson theorem","year":2014,"lang":"en","type":"preprint","venue":"Journal of the European Mathematical Society","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Integer (computer science); Combinatorics; Mathematics; Sequence (biology); Set (abstract data type); Word (group theory); Discrete mathematics; Geometry; Computer science; Chemistry","score_opus":0.020634303590439194,"score_gpt":0.2628445947252015,"score_spread":0.2422102911347623,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2143139971","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9641631,0.00015765947,0.007124498,0.0013246242,0.0024207619,0.00052939344,0.000025066045,0.0000333106,0.02422158],"genre_scores_gemma":[0.98809814,0.00006019727,0.010124886,0.00029314696,0.00091335154,7.2343056e-7,3.4170256e-7,0.000080797756,0.00042843464],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99523026,0.0018926619,0.0012517254,0.00022595585,0.0011144397,0.00028498672],"domain_scores_gemma":[0.99434084,0.0011252267,0.0025815547,0.001468732,0.00036974842,0.00011388753],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0059739067,0.0003812349,0.00089585787,0.000028527054,0.00039433385,0.000060168448,0.0025435819,0.00025554546,0.0000914882],"category_scores_gemma":[0.0017851345,0.00016838674,0.0029701018,0.00014197569,0.00062860333,0.000044401317,0.0034890294,0.0019964902,0.000006763555],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016922652,0.00094245124,0.0015016182,0.007338232,0.0030105172,0.000021133466,0.036867395,0.00045999011,0.0015457956,0.8112503,0.13321824,0.0036750762],"study_design_scores_gemma":[0.00043681604,0.00004156643,0.0017648208,0.0013353146,0.0007034022,0.000108369866,0.00044377224,0.0004521585,0.0010199321,0.99206483,0.0014113367,0.00021768418],"about_ca_topic_score_codex":0.000001286463,"about_ca_topic_score_gemma":2.8353583e-7,"teacher_disagreement_score":0.1808145,"about_ca_system_score_codex":0.00011832925,"about_ca_system_score_gemma":0.00008839369,"threshold_uncertainty_score":0.86738676},"labels":[],"label_agreement":null},{"id":"W2143482081","doi":"10.1016/j.ejc.2014.09.009","title":"Decomposition of bounded degree graphs into <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.gif\" display=\"inline\" overflow=\"scroll\"><mml:msub><mml:mrow><mml:mi>C</mml:mi></mml:mrow><mml:mrow><mml:mn>4</mml:mn></mml:mrow></mml:msub></mml:math>-free subgraphs","year":2014,"lang":"lv","type":"article","venue":"European Journal of Combinatorics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek","keywords":"Mathematics; Partition (number theory); Combinatorics; Bounded function; Iterated function; Degree (music); Graph; Discrete mathematics; Mathematical analysis; Physics","score_opus":0.01790779142924023,"score_gpt":0.24446387120057606,"score_spread":0.22655607977133582,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2143482081","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6342117,0.0014201814,0.0016184378,0.00031391886,0.0043919594,0.000035221132,0.00011562115,0.00009971522,0.3577932],"genre_scores_gemma":[0.9900359,0.0017273722,0.004579564,0.00084958476,0.0015134445,0.00007655305,0.00026870423,0.000778973,0.00016991603],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9901006,0.001286297,0.0028137162,0.0011312783,0.0028834855,0.0017845749],"domain_scores_gemma":[0.9894375,0.0021105208,0.004183508,0.0026690513,0.00045656553,0.0011428212],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.004458934,0.00091482635,0.0005319621,0.00084537506,0.0016359064,0.0011201076,0.0032581275,0.0012674965,0.085972145],"category_scores_gemma":[0.0027894452,0.0015279804,0.0024414188,0.0013108571,0.0016788467,0.0012827368,0.0020082043,0.0022617262,0.00043059717],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015416156,0.00050190906,0.000040410778,0.0013844083,0.0017302891,0.001406999,0.0027021917,0.00034603543,0.0013783062,0.8299032,0.15740685,0.0016577854],"study_design_scores_gemma":[0.0057872594,0.005421116,0.00055168377,0.0028612236,0.0032198909,0.003153915,0.0017215076,0.021611398,0.92583936,0.02208249,0.005559462,0.0021906663],"about_ca_topic_score_codex":0.00020169652,"about_ca_topic_score_gemma":0.00024258964,"teacher_disagreement_score":0.92446107,"about_ca_system_score_codex":0.000023086473,"about_ca_system_score_gemma":0.0008524816,"threshold_uncertainty_score":0.99991685},"labels":[],"label_agreement":null},{"id":"W2143653091","doi":"10.1007/s00605-014-0646-y","title":"On cycles for the doubling map which are disjoint from an interval","year":2014,"lang":"en","type":"article","venue":"Monatshefte für Mathematik","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Disjoint sets; Interval (graph theory); Integer (computer science); Set (abstract data type); Constant (computer programming)","score_opus":0.04301246350305047,"score_gpt":0.33631099908416023,"score_spread":0.29329853558110974,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2143653091","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.86763465,0.00024280086,0.12018265,0.002866349,0.0016636308,0.0013868544,0.00019795573,0.00047391554,0.0053511914],"genre_scores_gemma":[0.98169166,0.000007252242,0.016408807,0.00060959323,0.0005739975,0.0001591747,0.000022338385,0.00010689464,0.00042029584],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99798423,0.0001500326,0.0005459989,0.00048789717,0.00042000087,0.00041185578],"domain_scores_gemma":[0.9944531,0.0036900612,0.00037168272,0.0012243612,0.00014486811,0.00011592485],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010733139,0.00037633613,0.0005089276,0.00009651898,0.0005951407,0.00017398296,0.0008372858,0.00017068232,0.00024501255],"category_scores_gemma":[0.0011471334,0.000225196,0.0002641417,0.00011498701,0.00010762033,0.00016461748,0.00021258855,0.00033104737,0.000032319447],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013288594,0.00017024577,0.0000746529,0.00019309974,0.0001356763,0.0000013615236,0.003560171,0.0000893078,0.0000942219,0.9850954,0.0055858125,0.0048671984],"study_design_scores_gemma":[0.00061468687,0.00012905915,0.000671544,0.00021526356,0.000090539485,0.0000037487746,0.00085561554,0.015269866,0.0009196093,0.97756326,0.003346677,0.00032012493],"about_ca_topic_score_codex":0.00002038276,"about_ca_topic_score_gemma":0.00007926133,"teacher_disagreement_score":0.114057,"about_ca_system_score_codex":0.00003971473,"about_ca_system_score_gemma":0.000011828595,"threshold_uncertainty_score":0.9183226},"labels":[],"label_agreement":null},{"id":"W2145092624","doi":"10.1112/s0024609304003650","title":"THE CAMERON–ERDOS CONJECTURE","year":2004,"lang":"en","type":"article","venue":"Bulletin of the London Mathematical Society","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":76,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Trinity College","funders":"","keywords":"Mathematics; Conjecture; Combinatorics; Mathematics Subject Classification; Subject (documents); Discrete mathematics","score_opus":0.013476864155932898,"score_gpt":0.25404926049936144,"score_spread":0.24057239634342853,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2145092624","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8589497,0.0017565185,0.014550422,0.08032665,0.0015084874,0.003037406,0.000056454544,0.00041731834,0.039397016],"genre_scores_gemma":[0.9555059,0.00011781229,0.036884688,0.0017356013,0.00024484083,0.000054882148,8.815725e-7,0.000082793624,0.005372602],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981593,0.0001263171,0.0005282804,0.00022406763,0.0005646824,0.0003973413],"domain_scores_gemma":[0.9970136,0.001576665,0.00029613136,0.0009612989,0.00007540668,0.000076893426],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00092742394,0.00025189616,0.000375313,0.000007776625,0.00086137187,0.00004340832,0.0009853735,0.00019486627,0.00043372568],"category_scores_gemma":[0.0009479726,0.00011391237,0.00079208286,0.0001380781,0.0009370446,0.000012264055,0.0004507218,0.00046126236,0.000038397495],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014950117,0.00008747007,0.00002485448,0.00018162519,0.00012514768,7.048494e-7,0.0016810993,0.000018720168,0.000110558925,0.9644991,0.03293331,0.0003224722],"study_design_scores_gemma":[0.0006201992,0.000034926852,0.00009058266,0.00010951449,0.00008364711,0.000028701552,0.00042543432,0.00001730661,0.0025841254,0.95968795,0.036163907,0.00015368203],"about_ca_topic_score_codex":0.000011858749,"about_ca_topic_score_gemma":0.000002187211,"teacher_disagreement_score":0.096556164,"about_ca_system_score_codex":0.00006153234,"about_ca_system_score_gemma":0.000039365954,"threshold_uncertainty_score":0.66250634},"labels":[],"label_agreement":null},{"id":"W2146689185","doi":"10.1007/s11856-010-0056-3","title":"Turán-type results for partial orders and intersection graphs of convex sets","year":2010,"lang":"en","type":"article","venue":"Israel Journal of Mathematics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":25,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Mathematics; Combinatorics; Intersection graph; Bipartite graph; Complete bipartite graph; Monotone polygon; Discrete mathematics; Intersection (aeronautics); Complement (music); Regular polygon; Graph; Line graph","score_opus":0.03240362717170021,"score_gpt":0.32044736172765315,"score_spread":0.28804373455595295,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2146689185","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9940865,0.000048201735,0.003738617,0.0001074778,0.001295621,0.00021094517,0.000020878053,0.000012704449,0.000479032],"genre_scores_gemma":[0.92945015,0.00002692988,0.070309006,0.000035465706,0.00011539221,0.0000014344519,9.849535e-7,0.000023496565,0.000037129394],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99851614,0.000039556973,0.00090999313,0.00010540665,0.00026239947,0.00016647884],"domain_scores_gemma":[0.9971528,0.0010167577,0.0010259424,0.00024878528,0.00046632037,0.00008938859],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012757903,0.00015742805,0.00045020727,0.00017819028,0.00009382192,0.000024444395,0.00021079186,0.00014918177,0.000011521799],"category_scores_gemma":[0.0021538131,0.00011374086,0.0001750785,0.00011419122,0.00019708907,0.000095388714,0.000050115068,0.00032848935,3.4700096e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00089170295,0.00039003877,0.0004186679,0.001110651,0.0004536206,0.000011108932,0.011576055,0.0000069228363,0.01738586,0.96039665,0.004018567,0.0033401768],"study_design_scores_gemma":[0.0018967845,0.00055633095,0.00010229898,0.00018151944,0.00021598641,0.0003669915,0.0022421873,0.00067298807,0.011502157,0.9810547,0.0010451907,0.00016286249],"about_ca_topic_score_codex":0.0000026914852,"about_ca_topic_score_gemma":0.000014727911,"teacher_disagreement_score":0.066570394,"about_ca_system_score_codex":0.000008552768,"about_ca_system_score_gemma":0.000039925817,"threshold_uncertainty_score":0.46382177},"labels":[],"label_agreement":null},{"id":"W2148534827","doi":"10.1016/j.disc.2005.11.002","title":"Contributions to zero-sum problems","year":2005,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":63,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Subsequence; Modulo; Mathematics; Generalization; Zero (linguistics); Sequence (biology); Integer (computer science); Combinatorics; Discrete mathematics; Computer science","score_opus":0.023228310909942266,"score_gpt":0.31802018887315664,"score_spread":0.2947918779632144,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2148534827","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33706233,0.00030668272,0.5347832,0.0064419406,0.0007475275,0.0030356927,0.0006237915,0.0011017335,0.115897104],"genre_scores_gemma":[0.85087067,0.000010776137,0.14501163,0.00048887864,0.00028862926,0.000095654264,0.000012634349,0.00006992583,0.003151224],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982825,0.000047168392,0.0005589822,0.00026740786,0.00036700658,0.00047696862],"domain_scores_gemma":[0.9983507,0.0003715132,0.00015643168,0.00073641445,0.00016243529,0.00022250303],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052220863,0.0002736009,0.0004002511,0.00011909019,0.0003531983,0.000072295414,0.00041800423,0.00012754227,0.0002564249],"category_scores_gemma":[0.00088752137,0.00020876648,0.00017933197,0.00025249296,0.00008970249,0.00012252065,0.00022552085,0.00020817918,0.00018869514],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005215744,0.00009952343,0.000023927863,0.00012571462,0.00005808517,0.0000017713121,0.0045971116,0.000057483623,0.00043082435,0.9829172,0.010955387,0.00072775857],"study_design_scores_gemma":[0.0003481743,0.000053822656,0.000025881216,0.00011178659,0.00007619552,0.000023584123,0.00024080469,0.0010750748,0.0018599425,0.96602684,0.029821694,0.00033621676],"about_ca_topic_score_codex":0.0000020853122,"about_ca_topic_score_gemma":0.000010841924,"teacher_disagreement_score":0.5138083,"about_ca_system_score_codex":0.00008187464,"about_ca_system_score_gemma":0.00002573141,"threshold_uncertainty_score":0.851325},"labels":[],"label_agreement":null},{"id":"W2148713750","doi":"10.37236/1708","title":"A Discontinuity in the Distribution of Fixed Point Sums","year":2003,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Classification of discontinuities; Combinatorics; Discontinuity (linguistics); Fixed point; Graph; Set (abstract data type); Distribution (mathematics); Discrete mathematics; Mathematical analysis","score_opus":0.013936505854175243,"score_gpt":0.26983294129258945,"score_spread":0.2558964354384142,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2148713750","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.992359,0.0013007156,0.0045196633,0.00037889372,0.00026475865,0.00015197197,0.0000021635176,0.000003732951,0.0010191373],"genre_scores_gemma":[0.99968755,0.00019203134,0.000011212466,0.000027415814,0.000027221467,0.0000017028574,5.355783e-7,0.000008590767,0.0000437214],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981391,0.0005810265,0.00050923973,0.0000615852,0.00037657862,0.00033249514],"domain_scores_gemma":[0.9982622,0.00077477744,0.00049882405,0.00030955108,0.00013138498,0.000023217195],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0041157585,0.0001129264,0.00027104936,0.00004548571,0.00011544118,0.000015824782,0.00053244934,0.000055790708,0.000009602992],"category_scores_gemma":[0.000896491,0.000054481094,0.00016579461,0.00034715416,0.0001028184,0.00007709877,0.000029609886,0.0007081913,2.3014974e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000038954156,0.00013409091,0.00059482106,0.0000130379885,0.000040896455,0.000002890982,0.0014180155,0.0000044559883,0.000039683015,0.9972394,0.00037223275,0.00010150982],"study_design_scores_gemma":[0.00065378944,0.0002475506,0.0013739385,0.000025010004,0.000059781116,0.00013862993,0.00070459367,0.00000823962,0.0011526676,0.9945929,0.0009792417,0.00006366582],"about_ca_topic_score_codex":0.0000036131416,"about_ca_topic_score_gemma":0.000008765205,"teacher_disagreement_score":0.0073286053,"about_ca_system_score_codex":0.0001431814,"about_ca_system_score_gemma":0.00014705567,"threshold_uncertainty_score":0.3076778},"labels":[],"label_agreement":null},{"id":"W2148892386","doi":"10.1016/j.disc.2014.01.013","title":"A new proof for the Erdős–Ko–Rado theorem for the alternating group","year":2014,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":18,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Coset; Alternating group; Group (periodic table); Discrete mathematics; Combinatorial proof; Algebraic number; Symmetric group","score_opus":0.03293154812879251,"score_gpt":0.30649463699279755,"score_spread":0.27356308886400504,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2148892386","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0040097893,0.00027398395,0.98700523,0.00134132,0.00064793945,0.0027898862,0.00004812958,0.00011476506,0.003768949],"genre_scores_gemma":[0.5950759,0.000032562624,0.39745617,0.00071183656,0.0021420566,0.00088194414,0.000015056741,0.00024858786,0.0034358783],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998097,0.0000754081,0.00060743024,0.0003112697,0.00039219522,0.00051670393],"domain_scores_gemma":[0.98676455,0.0114483945,0.0004377166,0.0011523645,0.00010685529,0.00009013708],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021479784,0.0003569612,0.00042657513,0.00004496007,0.0010444369,0.00019129213,0.0011597401,0.00011778886,0.00005509704],"category_scores_gemma":[0.0026065265,0.00016582393,0.0004563571,0.00012685145,0.0001833309,0.00009029103,0.00022853399,0.00022422992,0.0000031487918],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000036740134,0.000027557942,0.000008784297,0.00040771134,0.00019658808,1.6948174e-7,0.005224709,0.00002902559,0.000055107303,0.9750901,0.0046861037,0.0142374],"study_design_scores_gemma":[0.00072672026,0.00011348023,0.00001175637,0.0001066317,0.00032966613,0.000011975392,0.0013004304,0.070001885,0.0005739219,0.9118727,0.014700538,0.00025033444],"about_ca_topic_score_codex":0.000007082509,"about_ca_topic_score_gemma":0.000018261528,"teacher_disagreement_score":0.5910661,"about_ca_system_score_codex":0.000026022326,"about_ca_system_score_gemma":0.000026096404,"threshold_uncertainty_score":0.803307},"labels":[],"label_agreement":null},{"id":"W2150983673","doi":"10.1016/j.disc.2005.09.026","title":"The well-covered dimension of random graphs","year":2006,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Mathematics; Combinatorics; Corollary; Dimension (graph theory); Vector space; Discrete mathematics; Graph; Constant (computer programming); Pure mathematics","score_opus":0.01158243144290393,"score_gpt":0.25639333638352607,"score_spread":0.24481090494062213,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2150983673","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9118672,0.00057887984,0.008231471,0.00016758156,0.00050224276,0.00079524517,0.00003490677,0.00014221716,0.07768025],"genre_scores_gemma":[0.9861513,0.00005177681,0.0121760955,0.000023017697,0.00006484673,0.00001688445,0.0000068998725,0.000046805875,0.0014623882],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99828786,0.0000906438,0.00070162315,0.00017621327,0.00044308932,0.00030057013],"domain_scores_gemma":[0.99704427,0.0016373742,0.00041111742,0.00076989626,0.00009598581,0.00004135579],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007198059,0.00023011756,0.000411336,0.00006504076,0.0004294401,0.000042033724,0.00038593638,0.00010111653,0.00005662724],"category_scores_gemma":[0.00030438643,0.00012800639,0.00028954807,0.00019436402,0.00030247026,0.000060918865,0.00014835395,0.00014698006,0.000008127497],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005276061,0.000061165694,0.00010844959,0.00015780808,0.000059329905,0.000002126058,0.0006450764,0.000015964366,0.0006556885,0.9944651,0.0036631627,0.000113357586],"study_design_scores_gemma":[0.0008577871,0.000033390883,0.000118204916,0.000076798526,0.00009692669,0.000010926004,0.00041889676,0.0010663086,0.00519657,0.9906993,0.0012527101,0.00017221825],"about_ca_topic_score_codex":0.00001240868,"about_ca_topic_score_gemma":0.0000116186175,"teacher_disagreement_score":0.07621786,"about_ca_system_score_codex":0.000013570423,"about_ca_system_score_gemma":0.000013977416,"threshold_uncertainty_score":0.5219949},"labels":[],"label_agreement":null},{"id":"W2151182440","doi":"10.1017/s0963548313000515","title":"Semi-Strong Colouring of Intersecting Hypergraphs","year":2013,"lang":"en","type":"article","venue":"Combinatorics Probability Computing","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Artificial Intelligence in Medicine (Canada)","funders":"","keywords":"Hypergraph; Combinatorics; Mathematics; Enhanced Data Rates for GSM Evolution; Discrete mathematics; Computer science; Artificial intelligence","score_opus":0.03626950082489224,"score_gpt":0.27890582867761643,"score_spread":0.24263632785272418,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2151182440","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98880327,0.000072534305,0.0037140138,0.000036687623,0.00084675715,0.0005754358,0.0000012023188,0.00018407436,0.0057660276],"genre_scores_gemma":[0.99197865,0.0000015035574,0.007873922,0.000018603816,0.00005393293,0.00000949604,9.772411e-7,0.000031291867,0.000031637795],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979252,0.00019750517,0.0007476947,0.00038957654,0.00030426896,0.00043575457],"domain_scores_gemma":[0.9973101,0.0012026451,0.00039948348,0.0006144045,0.00036875653,0.00010463784],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010797675,0.00024505734,0.00046862065,0.00012930976,0.00036548448,0.00004391588,0.00049019215,0.00013688074,0.000045123295],"category_scores_gemma":[0.0013107699,0.0002246182,0.0002035903,0.00042822916,0.0001929312,0.00015162547,0.0006316177,0.00041629063,0.0000031220554],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006892999,0.00019217971,0.054395184,0.00054422556,0.00006720711,0.000001312648,0.0026693346,0.00008410259,0.00058913603,0.938328,0.00012838274,0.0029940277],"study_design_scores_gemma":[0.0003689459,0.00008528464,0.0038680066,0.0001301607,0.000023905175,0.000009521064,0.0005207091,0.0043173865,0.0025380105,0.9878859,0.000019688658,0.00023250448],"about_ca_topic_score_codex":0.000043302396,"about_ca_topic_score_gemma":0.0000018630756,"teacher_disagreement_score":0.050527178,"about_ca_system_score_codex":0.00011674984,"about_ca_system_score_gemma":0.000032115364,"threshold_uncertainty_score":0.91596645},"labels":[],"label_agreement":null},{"id":"W2151383643","doi":"10.4153/cmb-2008-050-2","title":"Expected Norms of Zero-One Polynomials","year":2008,"lang":"en","type":"article","venue":"Canadian Mathematical Bulletin","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"York University; Simon Fraser University","funders":"","keywords":"Mathematics; Combinatorics; Zero (linguistics); Degree (music); Norm (philosophy); Discrete mathematics; Physics","score_opus":0.0490591805731886,"score_gpt":0.2529851587072512,"score_spread":0.2039259781340626,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2151383643","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9247577,0.00010215605,0.0017412656,0.0010170348,0.0001323233,0.00041911035,0.00005468578,0.00008901352,0.071686685],"genre_scores_gemma":[0.98204327,0.000012004581,0.014527507,0.0003456062,0.00009236484,0.000021064652,0.000004301586,0.000048987265,0.002904913],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982384,0.000081079896,0.00061801396,0.00024795366,0.0003077751,0.0005068045],"domain_scores_gemma":[0.9979616,0.0006269812,0.00015314264,0.0006129431,0.00010976166,0.00053560507],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00032624224,0.00022705531,0.00057819183,0.00021846787,0.00026799593,0.000011594082,0.00038900418,0.00019420632,0.016689604],"category_scores_gemma":[0.0014171691,0.00019008646,0.00017889013,0.00018897738,0.00040024283,0.000024508015,0.00006475149,0.00020295795,0.00077266176],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021016582,0.000103859966,0.0002681261,0.000222762,0.00009541198,0.00006915397,0.0022957337,6.379766e-7,0.0004891545,0.9464388,0.049734116,0.00026125103],"study_design_scores_gemma":[0.0004868192,0.000066711495,0.00064078916,0.00011544594,0.00005083699,0.00014602745,0.00015205753,0.000012777564,0.0028996815,0.9845367,0.0105382055,0.00035392385],"about_ca_topic_score_codex":0.00046501393,"about_ca_topic_score_gemma":0.00018023953,"teacher_disagreement_score":0.06878178,"about_ca_system_score_codex":0.00008173427,"about_ca_system_score_gemma":0.00015381414,"threshold_uncertainty_score":0.99312615},"labels":[],"label_agreement":null},{"id":"W2151612990","doi":"10.1016/j.disc.2005.12.030","title":"On an adjacency property of almost all tournaments","year":2006,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Tournament; Combinatorics; Mathematics; Vertex (graph theory); Adjacency list; Discrete mathematics; Property (philosophy); Integer (computer science); Graph; Computer science","score_opus":0.03215702963553921,"score_gpt":0.3041861461422333,"score_spread":0.27202911650669415,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2151612990","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9407735,0.000031093532,0.0023556256,0.00006687494,0.00017324682,0.00045265412,0.000047151487,0.000098173914,0.056001674],"genre_scores_gemma":[0.9596329,0.000010811449,0.03776312,0.000086704895,0.000097355376,0.000016496591,0.000019631569,0.00006782819,0.002305179],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982706,0.00007509252,0.0006247788,0.00023937286,0.00048027883,0.00030989357],"domain_scores_gemma":[0.9985035,0.0002116388,0.00034757613,0.0007705319,0.000084438834,0.00008232316],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038155227,0.00026730128,0.0004159002,0.00009507323,0.0001288365,0.00003158886,0.0003631948,0.0001143417,0.00023135386],"category_scores_gemma":[0.00019099678,0.00015368004,0.00015727476,0.000119111064,0.000121458914,0.00011862477,0.000101641665,0.00016821397,0.00001142748],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030518677,0.00053653476,0.00025186792,0.00037206704,0.00006467932,0.000008745508,0.002592772,0.000019569932,0.0007765375,0.9918061,0.0030641502,0.00047649222],"study_design_scores_gemma":[0.0004039289,0.00021270567,0.00026219338,0.00016960928,0.00008063584,0.000012824015,0.0001687184,0.00076770986,0.003306471,0.9936214,0.0007356331,0.00025815496],"about_ca_topic_score_codex":0.000035723937,"about_ca_topic_score_gemma":0.000015016396,"teacher_disagreement_score":0.053696495,"about_ca_system_score_codex":0.00003016792,"about_ca_system_score_gemma":0.000016981176,"threshold_uncertainty_score":0.626689},"labels":[],"label_agreement":null},{"id":"W2151957880","doi":"10.1007/s00453-008-9164-4","title":"Note on the Structure of Kruskal’s Algorithm","year":2008,"lang":"en","type":"article","venue":"Algorithmica","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":18,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Combinatorics; Mathematics; Kruskal's algorithm; Graph; Discrete mathematics; Euclidean geometry; Binary tree; Algorithm; Spanning tree","score_opus":0.02474790281183501,"score_gpt":0.27140896362348016,"score_spread":0.24666106081164516,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2151957880","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96724296,0.0001828249,0.015210721,0.0011992193,0.0016342078,0.0008517862,0.00038222957,0.00022713533,0.013068936],"genre_scores_gemma":[0.9527676,0.000022733637,0.045943163,0.00045368928,0.00032428151,0.0000033861056,0.000004549264,0.000038449703,0.00044214076],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99865425,0.00010588665,0.00032161438,0.00023896727,0.0004088168,0.0002704825],"domain_scores_gemma":[0.9981122,0.0008494737,0.00016860955,0.0007174874,0.00009164757,0.00006058717],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014971397,0.00021619583,0.00029509887,0.00007724639,0.00038430694,0.000007785011,0.00047690477,0.00014094979,0.0003640308],"category_scores_gemma":[0.0002320321,0.00012525963,0.00016432845,0.00021054097,0.00034349516,0.0000455962,0.0001175665,0.00034299016,0.000009846543],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000052138636,0.00014343958,0.000075367716,0.000045656165,0.00020880446,0.000054650856,0.004888979,0.000008665574,0.002584357,0.8981498,0.018767692,0.07502047],"study_design_scores_gemma":[0.00044208133,0.0001544556,0.00062585034,0.000034535202,0.0000462985,0.00013687386,0.000115446965,0.0009835729,0.0628492,0.9288651,0.005461892,0.00028470778],"about_ca_topic_score_codex":0.000012034802,"about_ca_topic_score_gemma":0.0000017511435,"teacher_disagreement_score":0.07473576,"about_ca_system_score_codex":0.000021896605,"about_ca_system_score_gemma":0.000035361456,"threshold_uncertainty_score":0.5107939},"labels":[],"label_agreement":null},{"id":"W2152427009","doi":"10.1006/jctb.2002.2110","title":"Asymptotically the List Colouring Constants Are 1","year":2002,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":40,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Combinatorics; Conjecture; Vertex (graph theory); Mathematics; Graph; Discrete mathematics","score_opus":0.02972296561971398,"score_gpt":0.26133577630400334,"score_spread":0.23161281068428935,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2152427009","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94386494,0.0009892341,0.00032508263,0.0016352219,0.01509396,0.000281716,0.000011854402,0.00006269937,0.037735283],"genre_scores_gemma":[0.9974197,0.000106449275,0.00044777282,0.0001814636,0.0010490927,0.0000017382422,8.729263e-8,0.000028413091,0.0007652761],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99790835,0.0005228225,0.0006744304,0.000112401016,0.0005054555,0.0002765352],"domain_scores_gemma":[0.9964993,0.0018973164,0.00075775577,0.00036697544,0.00035779443,0.000120886994],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019298845,0.00020198025,0.00045424933,0.00008023482,0.00051024463,0.00010411655,0.0006466375,0.00013234797,0.00086530304],"category_scores_gemma":[0.0021001087,0.00011910486,0.00024823257,0.00017359955,0.0005350004,0.00027321654,0.0001418373,0.00057499774,0.000004321275],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00041001645,0.00010205463,0.00026039683,0.000023920244,0.00016161992,0.0000727628,0.0012609935,0.0000017543774,0.0000722701,0.99269146,0.004550979,0.0003917531],"study_design_scores_gemma":[0.0009537853,0.00030152456,0.00013807873,0.0000948638,0.00009745801,0.0003832648,0.0010008892,0.0000051848665,0.00073209003,0.98396766,0.012175023,0.00015018563],"about_ca_topic_score_codex":2.4588977e-7,"about_ca_topic_score_gemma":6.1706004e-7,"teacher_disagreement_score":0.05355476,"about_ca_system_score_codex":0.00005032394,"about_ca_system_score_gemma":0.000028122358,"threshold_uncertainty_score":0.9474461},"labels":[],"label_agreement":null},{"id":"W2152948900","doi":"10.1017/s0963548313000059","title":"Towards a Weighted Version of the Hajnal–Szemerédi Theorem","year":2013,"lang":"en","type":"preprint","venue":"Combinatorics Probability Computing","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"University of Illinois at Urbana-Champaign; Hungarian Scientific Research Fund; Samsung; National Science Foundation","keywords":"Combinatorics; Mathematics; Conjecture; Graph; Disjoint sets; Degree (music); Vertex (graph theory); Integer (computer science); Discrete mathematics; Physics; Computer science","score_opus":0.031864506738924346,"score_gpt":0.277325883666447,"score_spread":0.24546137692752265,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2152948900","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98244363,0.00030169924,0.002014053,0.00022357871,0.0049035517,0.0017229854,0.000027422002,0.00020299196,0.008160105],"genre_scores_gemma":[0.99185884,0.000013321634,0.0077819554,0.000046582518,0.00013067543,0.00001738666,0.000009281351,0.00006197732,0.000079984624],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99579585,0.00082623446,0.0011633976,0.0008166848,0.0008868869,0.00051095954],"domain_scores_gemma":[0.9943062,0.0010023209,0.0012224233,0.0025216981,0.0008288489,0.00011851148],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0021879717,0.0005819865,0.0009754973,0.00012373507,0.0005966839,0.0000782751,0.0022095728,0.000653636,0.00008211471],"category_scores_gemma":[0.0016379103,0.00039388996,0.0007196872,0.00047590712,0.0005795197,0.00006054778,0.007591271,0.001684282,0.0000041747135],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018354505,0.0002781128,0.0024115662,0.0017477077,0.00014166972,9.051989e-7,0.0027544394,0.000068578694,0.000022876025,0.9886827,0.0008861389,0.002986938],"study_design_scores_gemma":[0.00042269586,0.000047689733,0.0022245625,0.0005438052,0.00013350295,0.0000043064133,0.00008211769,0.0059099183,0.0010531779,0.98896205,0.00021156942,0.00040460622],"about_ca_topic_score_codex":0.00006869571,"about_ca_topic_score_gemma":0.0000015449679,"teacher_disagreement_score":0.009415221,"about_ca_system_score_codex":0.00037864136,"about_ca_system_score_gemma":0.00030730112,"threshold_uncertainty_score":0.9998513},"labels":[],"label_agreement":null},{"id":"W2155233457","doi":"10.1016/j.jcta.2009.03.015","title":"Some Ramsey-type results for the n-cube","year":2009,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Cube (algebra); Type (biology); Ramsey's theorem; Combinatorics; Mathematics; Geology","score_opus":0.02540676515078403,"score_gpt":0.2997708149569002,"score_spread":0.2743640498061162,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2155233457","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.81759465,0.011062592,0.0036097062,0.018705117,0.13069822,0.0028421208,0.0001023222,0.00027458873,0.015110698],"genre_scores_gemma":[0.9916219,0.00029516648,0.0018409129,0.00042920126,0.0048443684,0.0000025652516,9.4296996e-7,0.00002641737,0.000938537],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99828404,0.00022494806,0.0007413897,0.00011976644,0.0003606257,0.00026925103],"domain_scores_gemma":[0.9957089,0.0026512577,0.00067417725,0.00040834877,0.00046823974,0.000089071305],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031484563,0.00019602274,0.00042393903,0.00008047844,0.00045282202,0.00008087116,0.0006386514,0.00013325954,0.000021257056],"category_scores_gemma":[0.0030087486,0.000110668065,0.0003236572,0.00015957047,0.00017276913,0.0003721361,0.000054085467,0.00035618595,9.021717e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.008491023,0.00008100062,0.0000014899849,0.000013769983,0.00013517881,0.000009294395,0.001065864,0.0000060785796,0.00021944326,0.9752443,0.012829768,0.0019027849],"study_design_scores_gemma":[0.0023387354,0.0017270441,0.0000439338,0.000040670784,0.00012929214,0.00009868859,0.00040855515,0.0000042508223,0.0016713538,0.9378117,0.055588655,0.00013716138],"about_ca_topic_score_codex":2.4310575e-7,"about_ca_topic_score_gemma":1.3192651e-7,"teacher_disagreement_score":0.17402725,"about_ca_system_score_codex":0.000037465452,"about_ca_system_score_gemma":0.00008023825,"threshold_uncertainty_score":0.45129126},"labels":[],"label_agreement":null},{"id":"W2158786496","doi":"10.37236/133","title":"Rate of Convergence of the Short Cycle Distribution in Random Regular Graphs Generated by Pegging","year":2009,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mixing (physics); Combinatorics; Mathematics; Distribution (mathematics); Limiting; Random graph; Convergence (economics); Upper and lower bounds; Discrete mathematics; Graph; Physics; Mathematical analysis; Engineering; Quantum mechanics","score_opus":0.006845715348464086,"score_gpt":0.24323822253586894,"score_spread":0.23639250718740484,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2158786496","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99347615,0.0025273236,0.0032015422,0.00026794718,0.00026955886,0.0001567955,0.0000048273114,0.000004868956,0.00009097569],"genre_scores_gemma":[0.99913245,0.00077584083,0.0000076252213,0.000027715236,0.000016150549,7.3904977e-7,0.0000012896699,0.000008828207,0.000029344606],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99819624,0.00041560328,0.0006804013,0.000079305064,0.0003189711,0.0003094748],"domain_scores_gemma":[0.9985581,0.00027994908,0.0005873483,0.00030647786,0.00023814024,0.000029978715],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00232288,0.00013152516,0.0003807961,0.000057709625,0.00011749405,0.000007843579,0.0005778959,0.000072209245,0.000005587597],"category_scores_gemma":[0.0002810082,0.00007347587,0.00019622192,0.0005747408,0.00012663602,0.00007609002,0.000037103917,0.0005271026,4.9557432e-8],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020439034,0.000113892085,0.00056348037,0.0000156479,0.00006930924,0.000001269487,0.00030453387,0.000104341176,0.010526516,0.9874198,0.00047988503,0.00019695896],"study_design_scores_gemma":[0.0011525273,0.00020217863,0.0009917602,0.000053165357,0.00007889973,0.00002754836,0.00006923643,0.00029329804,0.06932508,0.9276409,0.00009150704,0.000073858806],"about_ca_topic_score_codex":0.000004211821,"about_ca_topic_score_gemma":0.0000017170389,"teacher_disagreement_score":0.05977884,"about_ca_system_score_codex":0.00011442089,"about_ca_system_score_gemma":0.00015918833,"threshold_uncertainty_score":0.2996259},"labels":[],"label_agreement":null},{"id":"W2163453622","doi":"10.1002/rsa.10058","title":"On characterizing hypergraph regularity","year":2002,"lang":"en","type":"article","venue":"Random Structures and Algorithms","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Hypergraph; Lemma (botany); Verifiable secret sharing; Mathematics; Bipartite graph; Discrete mathematics; Combinatorics; Graph; Randomness; Computer science","score_opus":0.029155839348809075,"score_gpt":0.26107007061866516,"score_spread":0.23191423126985608,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2163453622","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9924388,0.00084705977,0.0005517511,0.0003209671,0.0007404829,0.00032611884,0.000037773367,0.0001525728,0.004584471],"genre_scores_gemma":[0.9937751,0.00027847022,0.0046419105,0.00047174943,0.000343491,0.000010952747,0.000004149138,0.000035365967,0.00043879726],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99855196,0.00010599519,0.00029049674,0.00037357234,0.00028051384,0.00039748268],"domain_scores_gemma":[0.99884,0.00046221167,0.00011822913,0.00038782976,0.000034722503,0.00015703261],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002758988,0.0002866463,0.0004376887,0.00011795324,0.00052723003,0.00008109763,0.0001839881,0.00015309497,0.0004285537],"category_scores_gemma":[0.00022712146,0.00020049982,0.00015973432,0.00012470467,0.00016383143,0.00009176335,0.00008301184,0.0002942935,0.0000027040217],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018465712,0.00004758693,0.00032095445,0.00008604346,0.0001309058,0.00003222499,0.0010345386,0.0000018437252,0.0005861997,0.9391757,0.002162949,0.056236386],"study_design_scores_gemma":[0.0034107731,0.00010358269,0.0029884826,0.00003780416,0.000054779837,0.00010545744,0.000037484428,0.0012479167,0.0008807263,0.98582137,0.004957921,0.00035373413],"about_ca_topic_score_codex":0.000016776783,"about_ca_topic_score_gemma":0.0000028246543,"teacher_disagreement_score":0.05588265,"about_ca_system_score_codex":0.000012940346,"about_ca_system_score_gemma":0.0000031992101,"threshold_uncertainty_score":0.81761456},"labels":[],"label_agreement":null},{"id":"W2167009466","doi":"10.1017/s0963548314000601","title":"Extremal Numbers for Odd Cycles","year":2014,"lang":"en","type":"article","venue":"Combinatorics Probability Computing","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":44,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Bipartite graph; Graph; Upper and lower bounds; Extremal graph theory; Value (mathematics); Graph theory","score_opus":0.05537113575030009,"score_gpt":0.3171983033842709,"score_spread":0.26182716763397085,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2167009466","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.89021665,0.000045487584,0.09974447,0.00012184323,0.0014526013,0.0007242071,0.0000037914342,0.0003320495,0.0073588826],"genre_scores_gemma":[0.96391034,8.434356e-7,0.035692763,0.00007538443,0.00019015651,0.00001370383,0.0000034669345,0.000038965623,0.00007435853],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981086,0.0001984071,0.00049981935,0.00047191404,0.0002577092,0.00046352597],"domain_scores_gemma":[0.99635065,0.0024146533,0.00021831515,0.0006715556,0.00022858122,0.00011622355],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020333386,0.00024706902,0.0004002882,0.000060521306,0.00064414024,0.000057418813,0.00046026168,0.00015108948,0.000010861987],"category_scores_gemma":[0.0027500903,0.00022425642,0.00021991183,0.0002075488,0.00015339907,0.000076669705,0.00031090953,0.0002328607,0.0000025163897],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015669471,0.0001246808,0.005449578,0.00033819664,0.000023562052,3.1658664e-7,0.00068255066,0.00003182885,0.00002186823,0.98613316,0.0004759245,0.0067026597],"study_design_scores_gemma":[0.0006540859,0.00008865806,0.0010759393,0.000039828792,0.00002948346,0.0000052499895,0.000044777797,0.009121793,0.00028851596,0.9867526,0.001625859,0.00027315988],"about_ca_topic_score_codex":0.00000451179,"about_ca_topic_score_gemma":0.0000023644532,"teacher_disagreement_score":0.07369369,"about_ca_system_score_codex":0.00010184561,"about_ca_system_score_gemma":0.00002818127,"threshold_uncertainty_score":0.9144911},"labels":[],"label_agreement":null},{"id":"W2167472711","doi":"10.1112/s0024609305004261","title":"ON THE NUMBER OF SUMS AND PRODUCTS","year":2005,"lang":"en","type":"article","venue":"Bulletin of the London Mathematical Society","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":76,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Mathematics; Mathematics Subject Classification; Subject (documents); Set (abstract data type); Finite set; Combinatorics; Discrete mathematics; Mathematical analysis; Computer science; Library science","score_opus":0.01865851947645158,"score_gpt":0.26442176520445754,"score_spread":0.24576324572800595,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2167472711","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9649127,0.000083718114,0.00014684896,0.017307153,0.00007001372,0.00048030305,0.000009229896,0.000027099215,0.016962903],"genre_scores_gemma":[0.97077596,0.000028202116,0.025129654,0.0008566145,0.0000922597,0.000014113231,2.1447381e-7,0.000026933187,0.0030760781],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987395,0.0001232337,0.00039154608,0.00017020623,0.00038828133,0.00018724585],"domain_scores_gemma":[0.9970556,0.0019467961,0.00023521604,0.0006524357,0.000075963064,0.000033976252],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0009536892,0.00015937367,0.0003093095,0.000005918744,0.00018100633,0.000011155109,0.00041532062,0.0000986095,0.0011405676],"category_scores_gemma":[0.0013448413,0.00007208241,0.00027100937,0.00009501523,0.000600064,0.000009580858,0.00027765584,0.00023467513,0.000020910613],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014993903,0.00013430075,0.000089607434,0.00032866726,0.00006546072,7.2366404e-8,0.0014626159,0.0000015263906,0.00017452809,0.9407186,0.056748893,0.0002607728],"study_design_scores_gemma":[0.00027787455,0.000020791122,0.00022605192,0.0001467203,0.00006449938,0.000013918059,0.00020164515,0.00007796752,0.008417531,0.9807966,0.009650533,0.00010586752],"about_ca_topic_score_codex":0.0000023159,"about_ca_topic_score_gemma":1.816808e-7,"teacher_disagreement_score":0.047098357,"about_ca_system_score_codex":0.000013540474,"about_ca_system_score_gemma":0.000010687245,"threshold_uncertainty_score":0.99977255},"labels":[],"label_agreement":null},{"id":"W2167682233","doi":"10.37236/310","title":"On a Rado Type Problem for Homogeneous Second Order Linear Recurrences","year":2010,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Simon Fraser University","keywords":"Mathematics; Combinatorics; Homogeneous; Monochromatic color; Type (biology); Order (exchange); Class (philosophy); Sequence (biology); Function (biology); Generating function; Discrete mathematics; Physics; Computer science","score_opus":0.014624137019942968,"score_gpt":0.29164984536154404,"score_spread":0.27702570834160106,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2167682233","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99140483,0.0010814945,0.0023030401,0.00032234183,0.0024172345,0.00036702733,0.0000038486605,0.000021206455,0.0020789623],"genre_scores_gemma":[0.9980617,0.00014044385,0.00070100214,0.00008454162,0.0002650528,0.0000043313707,5.568515e-7,0.000028802442,0.0007135629],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998716,0.00008161067,0.00038404597,0.00010595038,0.00028844815,0.00042393344],"domain_scores_gemma":[0.99766636,0.0010345385,0.00043512808,0.00029655287,0.00050746446,0.000059979622],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014425599,0.00016126799,0.00027599797,0.00008625511,0.00027704355,0.000027387723,0.0006017533,0.000111090856,0.00008000441],"category_scores_gemma":[0.0007129251,0.00009256138,0.00014243257,0.00027467957,0.00008464689,0.000055979042,0.000038924518,0.0011216853,0.0000020122463],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018464967,0.00010404572,0.000015032413,0.000029406525,0.00010871015,0.000002111529,0.00046363758,0.00000706181,0.00024950155,0.9957757,0.0022067137,0.00085341826],"study_design_scores_gemma":[0.0006927426,0.0014191329,0.0000056979657,0.000018921555,0.00007416623,0.0002058772,0.000045747624,0.000058957892,0.0016071411,0.9770371,0.01871446,0.000120055505],"about_ca_topic_score_codex":4.587531e-7,"about_ca_topic_score_gemma":0.000010529614,"teacher_disagreement_score":0.01873861,"about_ca_system_score_codex":0.000052041927,"about_ca_system_score_gemma":0.00034036455,"threshold_uncertainty_score":0.48732266},"labels":[],"label_agreement":null},{"id":"W2167858467","doi":"10.1002/rsa.10075","title":"Integer and fractional packings in dense 3‐uniform hypergraphs","year":2003,"lang":"en","type":"article","venue":"Random Structures and Algorithms","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; Natural Sciences and Engineering Research Council of Canada","funders":"","keywords":"Hypergraph; Mathematics; Lemma (botany); Combinatorics; Disjoint sets; Integer (computer science); Function (biology); Discrete mathematics; Computer science","score_opus":0.015432795212788257,"score_gpt":0.26914049053799227,"score_spread":0.25370769532520404,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2167858467","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.992441,0.0013336163,0.0022697612,0.00006271986,0.00041519824,0.00028035708,0.000016735743,0.00004205061,0.003138583],"genre_scores_gemma":[0.9886584,0.00037836697,0.010520295,0.0001715912,0.00008622906,0.000010970944,0.0000028202517,0.000024296085,0.00014698798],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988081,0.000102533515,0.000300617,0.00030688362,0.00020054266,0.00028136134],"domain_scores_gemma":[0.99905586,0.0005245196,0.000092831615,0.00017968025,0.00004103887,0.000106041334],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040456184,0.00023989817,0.00037858187,0.0001703207,0.0002511959,0.00006480385,0.00007987475,0.00015130104,0.00013220364],"category_scores_gemma":[0.00031289228,0.00017092486,0.00007790333,0.00014496893,0.00019409262,0.00012778163,0.000050285853,0.00031207295,3.5184223e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021907102,0.000026176049,0.0054332744,0.00007683368,0.00008406666,0.000032913442,0.0013129775,0.0000074292993,0.00015113092,0.9798912,0.00023113501,0.012533815],"study_design_scores_gemma":[0.0041305367,0.000039361566,0.006621542,0.00002882155,0.000033051452,0.00030922628,0.00037254125,0.00027155364,0.00038812056,0.9837642,0.0037800716,0.00026099276],"about_ca_topic_score_codex":0.000025662252,"about_ca_topic_score_gemma":0.000020552008,"teacher_disagreement_score":0.012272823,"about_ca_system_score_codex":0.000014737389,"about_ca_system_score_gemma":0.000016365084,"threshold_uncertainty_score":0.69701135},"labels":[],"label_agreement":null},{"id":"W2168548367","doi":"","title":"Acyclic and Frugal Colourings of Graphs.","year":2008,"lang":"en","type":"article","venue":"Data Archiving and Networked Services (DANS)","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada; Commonwealth Scholarship Commission; Technische Universiteit Eindhoven; University of Oxford","keywords":"Combinatorics; Neighbourhood (mathematics); Bipartite graph; Bounded function; Vertex (graph theory); Mathematics; Degree (music); Directed acyclic graph; Graph; Discrete mathematics; Physics","score_opus":0.04191199731879315,"score_gpt":0.2749429843966824,"score_spread":0.23303098707788927,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2168548367","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.997385,0.0005750035,0.00022427735,0.000026202648,0.00010367411,0.00012155267,0.00013817425,0.0000556805,0.0013704165],"genre_scores_gemma":[0.99399114,0.0011003455,0.0045497944,0.00009413119,0.00009635115,0.0000032700443,0.00007919282,0.000024133316,0.00006164598],"study_design_codex":"observational","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987781,0.00010504333,0.00029967393,0.00037076138,0.00017331076,0.0002731153],"domain_scores_gemma":[0.9983993,0.0005477149,0.000157683,0.00076915685,0.000017414231,0.00010870743],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036068464,0.00019323328,0.00032381172,0.000082101935,0.00043164688,0.00002189195,0.00067036285,0.00006363082,0.000008279863],"category_scores_gemma":[0.0000235772,0.00015172827,0.000036754507,0.00013407979,0.00032347778,0.00018724211,0.0009877908,0.00018586773,3.9233822e-7],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00068387506,0.000359207,0.6645048,0.004155891,0.000936341,0.00014107747,0.09460926,0.000069555404,0.0033020114,0.20182602,0.004344106,0.025067832],"study_design_scores_gemma":[0.0014652059,0.00019420315,0.3970097,0.00071306975,0.00026570394,0.0004431995,0.001660067,0.023322523,0.00033237704,0.5696293,0.004174741,0.0007898971],"about_ca_topic_score_codex":0.00013739134,"about_ca_topic_score_gemma":0.00015245538,"teacher_disagreement_score":0.36780328,"about_ca_system_score_codex":0.0000029204925,"about_ca_system_score_gemma":0.000009140578,"threshold_uncertainty_score":0.6187299},"labels":[],"label_agreement":null},{"id":"W2168678076","doi":"10.1109/ismvl.2000.848649","title":"On the intersection of maximal partial clones and the join of minimal partial clones","year":2002,"lang":"en","type":"article","venue":"","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal; Royal Military College of Canada","funders":"","keywords":"Cardinality (data modeling); Intersection (aeronautics); Combinatorics; Join (topology); Mathematics; Set (abstract data type); clone (Java method); Partial function; Discrete mathematics; Computer science; Biology; Genetics; DNA","score_opus":0.03891173371883731,"score_gpt":0.2575810356907059,"score_spread":0.21866930197186857,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2168678076","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9900653,0.000063237654,0.00041096925,0.0006768356,0.0003188948,0.00020888489,0.0000058992223,0.000017151153,0.00823287],"genre_scores_gemma":[0.9991843,0.00001901682,0.00028555343,0.00010001074,0.00013357385,0.000010692621,2.6469849e-7,0.000009923273,0.00025666488],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999032,0.00018636178,0.00033615477,0.0001241303,0.0001900031,0.00013130248],"domain_scores_gemma":[0.99846625,0.0010292636,0.00016565602,0.0002786335,0.000038536622,0.000021673537],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046504513,0.000116507705,0.00023242284,0.000030085142,0.00013134789,0.000013040972,0.00014618438,0.000063309955,0.00049815135],"category_scores_gemma":[0.00030859114,0.000051081173,0.000121939,0.00007244937,0.0005844362,0.000031787473,0.00008444685,0.000121250996,0.0000017722514],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00047579486,0.00006325266,0.00023069416,0.00003200023,0.00006493158,6.484378e-7,0.0033717637,0.0000019059377,0.0004141712,0.99193794,0.0015124922,0.0018944044],"study_design_scores_gemma":[0.0020201113,0.00046782364,0.0013139587,0.000054914788,0.00015090675,0.0000301554,0.0022193165,0.0042802603,0.04676999,0.94201493,0.0004968613,0.00018078578],"about_ca_topic_score_codex":0.000028573713,"about_ca_topic_score_gemma":0.000018310846,"teacher_disagreement_score":0.049923025,"about_ca_system_score_codex":0.000004896594,"about_ca_system_score_gemma":0.0000036950605,"threshold_uncertainty_score":0.5454408},"labels":[],"label_agreement":null},{"id":"W2168989363","doi":"10.1142/s1793042108001195","title":"ON DAVENPORT'S CONSTANT","year":2008,"lang":"en","type":"article","venue":"International Journal of Number Theory","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Mathematics; Exponent; Constant (computer programming); Sequence (biology); Combinatorics; Abelian group; Group (periodic table); Upper and lower bounds; Discrete mathematics; Mathematical analysis; Physics","score_opus":0.03471486967437191,"score_gpt":0.3272558679075407,"score_spread":0.29254099823316876,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2168989363","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8409474,0.00005074126,0.0029032715,0.00028698286,0.0030399633,0.000060034003,0.000068510475,0.000025891655,0.15261723],"genre_scores_gemma":[0.99507815,0.000046981615,0.0024407145,0.00062276406,0.0005046889,9.856976e-7,0.0000021676603,0.000018211322,0.0012853692],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99859077,0.00012494555,0.0004581895,0.00008829907,0.0006197854,0.000117987816],"domain_scores_gemma":[0.99761367,0.0013499946,0.00042772095,0.00015359203,0.00038155334,0.00007345681],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0005933867,0.000116864496,0.00019769484,0.00011943116,0.00009493115,0.000015035786,0.0004977324,0.000056838973,0.005798281],"category_scores_gemma":[0.00094922783,0.00008372728,0.00021130375,0.000046468616,0.00019348848,0.00011868885,0.00006375273,0.00027087002,0.00003493931],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003795999,0.00010914582,0.0006293102,0.0000025858535,0.00027097214,0.00074110704,0.0007287654,0.0000045742777,0.00003823178,0.9647322,0.030993747,0.0013697401],"study_design_scores_gemma":[0.0005659206,0.000056645982,0.00045581497,0.00007329075,0.000017879462,0.0040245703,0.00010662701,0.000003132475,0.00033291633,0.98400426,0.010264148,0.000094777075],"about_ca_topic_score_codex":5.0912047e-7,"about_ca_topic_score_gemma":2.4131572e-7,"teacher_disagreement_score":0.15413074,"about_ca_system_score_codex":0.000058063128,"about_ca_system_score_gemma":0.00006231187,"threshold_uncertainty_score":0.9951106},"labels":[],"label_agreement":null},{"id":"W2174315020","doi":"10.1016/j.endm.2009.07.049","title":"On distance edge-colourings and matchings","year":2009,"lang":"en","type":"article","venue":"Electronic Notes in Discrete Mathematics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Combinatorics; Mathematics; Enhanced Data Rates for GSM Evolution; Discrete mathematics; Computer science; Telecommunications","score_opus":0.010402237647939024,"score_gpt":0.2762150895915916,"score_spread":0.26581285194365256,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2174315020","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9768452,0.00040215792,0.014296411,0.00065769284,0.00008057967,0.0004421715,0.0000058893897,0.0001405888,0.0071292906],"genre_scores_gemma":[0.9876025,0.00008542921,0.011541763,0.00032992943,0.000055676417,0.000015231303,0.0000020355096,0.00004155488,0.00032591453],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980992,0.00005441567,0.00047536593,0.00036939583,0.0003102154,0.0006914024],"domain_scores_gemma":[0.9980395,0.001129344,0.00018735723,0.0005387358,0.000023779361,0.00008130912],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006001477,0.00033494996,0.000455478,0.00014118552,0.00019525203,0.000061556195,0.00034314924,0.00013738906,0.000047634643],"category_scores_gemma":[0.0008181497,0.0002671048,0.00009502616,0.00021306991,0.00012163662,0.00011372051,0.00008657601,0.0005444686,0.0000056980207],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000037821443,0.00010524282,0.00006424124,0.00010620845,0.000018363979,0.00000796138,0.0023993878,0.000010666505,0.00012863093,0.9948586,0.00011608799,0.0021467835],"study_design_scores_gemma":[0.00049104774,0.00026369782,0.00031088036,0.000201549,0.000025926694,0.000027202566,0.00007441797,0.00085768173,0.00091521867,0.99627924,0.00022891887,0.0003242033],"about_ca_topic_score_codex":0.0000027132378,"about_ca_topic_score_gemma":0.00001694667,"teacher_disagreement_score":0.010757246,"about_ca_system_score_codex":0.00013078154,"about_ca_system_score_gemma":0.000029790239,"threshold_uncertainty_score":0.9999781},"labels":[],"label_agreement":null},{"id":"W2174692193","doi":"10.1007/s00454-013-9559-0","title":"Colourful and Fractional (p,q)-theorems","year":2013,"lang":"en","type":"article","venue":"Discrete & Computational Geometry","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":17,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"National Institutes of Health; Magyar Tudományos Akadémia","keywords":"Combinatorics; Mathematics; Element (criminal law); Zero (linguistics); Class (philosophy); Idempotence; Regular polygon; Fraction (chemistry); Discrete mathematics; Geometry","score_opus":0.015857367499309744,"score_gpt":0.28325509917332425,"score_spread":0.2673977316740145,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2174692193","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96472216,0.00017504564,0.026122672,0.00044607118,0.0002684276,0.00024420983,0.000029238909,0.00008644337,0.007905712],"genre_scores_gemma":[0.9782875,0.000007141694,0.02064312,0.0004447299,0.00014462265,0.000022584465,0.000036253463,0.000021345893,0.00039266504],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988785,0.000060359685,0.00025537753,0.00024816598,0.00034918365,0.00020843318],"domain_scores_gemma":[0.99844736,0.0010399658,0.00010865969,0.0001453431,0.00014621436,0.00011247412],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00020468749,0.00016179815,0.00018627285,0.00016963942,0.00031331397,0.000080579084,0.0001356641,0.00008728163,0.0013152234],"category_scores_gemma":[0.0002148199,0.00013291709,0.00007617542,0.00022242594,0.00019901658,0.00021573387,0.00012305305,0.00018623869,0.00005750025],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013422825,0.000029795214,0.004995676,0.000028696963,0.00007502792,0.000002246574,0.00024714088,0.00040998406,0.000022464588,0.9880013,0.0032111183,0.0029631634],"study_design_scores_gemma":[0.00028114233,0.000034323595,0.07190086,0.00001174383,0.000015832442,0.000026170503,0.00016327621,0.0046909223,0.000014939775,0.9216112,0.0010795172,0.00017009335],"about_ca_topic_score_codex":0.0000133381645,"about_ca_topic_score_gemma":6.5047004e-7,"teacher_disagreement_score":0.06690518,"about_ca_system_score_codex":0.000021152648,"about_ca_system_score_gemma":0.000021939313,"threshold_uncertainty_score":0.9995977},"labels":[],"label_agreement":null},{"id":"W2174920527","doi":"10.1016/j.endm.2015.06.074","title":"Uniform Linear Embeddings of Spatial Random Graphs","year":2015,"lang":"en","type":"article","venue":"Electronic Notes in Discrete Mathematics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Mathematics; Embedding; Combinatorics; Vertex (graph theory); Random graph; Discrete mathematics; Random regular graph; Space (punctuation); Link (geometry); Graph; Chordal graph; 1-planar graph; Computer science","score_opus":0.02620108249101816,"score_gpt":0.304088283036715,"score_spread":0.2778872005456968,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2174920527","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8816075,0.0003345665,0.10897296,0.00010831461,0.0002636373,0.00073854864,0.000020531927,0.00012917609,0.00782478],"genre_scores_gemma":[0.9600451,0.000046640198,0.039578333,0.00002434064,0.000079093435,0.000023422268,0.000008189016,0.00006559001,0.00012930566],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99746174,0.000102429905,0.00091025815,0.00028632712,0.00055365864,0.00068560673],"domain_scores_gemma":[0.9975196,0.0011039522,0.00041866594,0.00069666345,0.00013507363,0.00012605483],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0015936902,0.0003383395,0.0007509411,0.00025727085,0.00008006513,0.000019500316,0.0005467663,0.00019257894,0.000074178],"category_scores_gemma":[0.0021988414,0.0002644613,0.00022849842,0.00038976426,0.00023695879,0.00012846403,0.00021257726,0.0004611904,0.000006024371],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018487658,0.00017233992,0.0005819798,0.000305889,0.000104517596,0.0000048383804,0.0060953116,0.00014740728,0.00020611825,0.9914044,0.00008084599,0.0007114487],"study_design_scores_gemma":[0.0023573549,0.00023026827,0.000022820253,0.00014285224,0.00007625845,0.000023570094,0.00041600474,0.010680942,0.006484752,0.97911596,0.00014128453,0.0003079396],"about_ca_topic_score_codex":0.000057842615,"about_ca_topic_score_gemma":0.0001596454,"teacher_disagreement_score":0.078437604,"about_ca_system_score_codex":0.00013078157,"about_ca_system_score_gemma":0.00015611855,"threshold_uncertainty_score":0.99998075},"labels":[],"label_agreement":null},{"id":"W2177899233","doi":"10.1016/j.ejc.2006.05.002","title":"Pairwise intersections and forbidden configurations","year":2006,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Pairwise comparison; Mathematics; Combinatorics; Discrete mathematics; Statistics","score_opus":0.019082775710059684,"score_gpt":0.2491467423438832,"score_spread":0.23006396663382353,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2177899233","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8973769,0.000290758,0.012213437,0.00023316647,0.0012412681,0.00007406076,0.0000036084598,0.000033440647,0.08853335],"genre_scores_gemma":[0.9982348,0.000023116281,0.0009276913,0.000032822507,0.00018671254,2.1683117e-7,4.5570386e-7,0.000020584981,0.00057358],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99907863,0.00021440724,0.00039032867,0.000063456806,0.0001513111,0.000101894395],"domain_scores_gemma":[0.9991629,0.0001867358,0.00027987134,0.00012922245,0.00018032533,0.000060943312],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006137497,0.000090866895,0.000149075,0.00011865611,0.0001923057,0.000043583976,0.00014703785,0.000017770044,0.00002875168],"category_scores_gemma":[0.00017750108,0.000071563896,0.000083728846,0.00011002054,0.000072315685,0.00011159302,0.000047308833,0.00021108714,0.0000021703686],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011332269,0.000061832456,0.00072238164,0.000013911374,0.00002991029,0.000068335394,0.0004267724,0.0000026023615,0.00016780617,0.98593926,0.012058236,0.00049758854],"study_design_scores_gemma":[0.0007494211,0.00022489918,0.008982309,0.000039880968,0.000063180254,0.00036567744,0.00026113255,0.000017924503,0.00018813703,0.973827,0.015166376,0.00011403459],"about_ca_topic_score_codex":9.659107e-7,"about_ca_topic_score_gemma":8.766241e-7,"teacher_disagreement_score":0.10085791,"about_ca_system_score_codex":0.000019234596,"about_ca_system_score_gemma":0.000013755943,"threshold_uncertainty_score":0.2918291},"labels":[],"label_agreement":null},{"id":"W2187209261","doi":"10.1002/jgt.22206","title":"Complete graph immersions and minimum degree","year":2017,"lang":"en","type":"preprint","venue":"Journal of Graph Theory","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"European Research Council","keywords":"Combinatorics; Mathematics; Graph; Disjoint sets; Immersion (mathematics); Simple graph; Degree (music); Discrete mathematics; Physics; Geometry","score_opus":0.08929580787713443,"score_gpt":0.3280443678562582,"score_spread":0.23874855997912375,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2187209261","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95083714,0.012731448,0.008859094,0.0007392202,0.0072395946,0.0006326253,0.00032224713,0.00006491893,0.018573718],"genre_scores_gemma":[0.98685515,0.002408028,0.009331856,0.00019851256,0.0006910845,0.0000058069504,0.000006050849,0.00009234435,0.00041117673],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9969137,0.00059677026,0.0011032122,0.00037562344,0.0005938288,0.00041690876],"domain_scores_gemma":[0.9938319,0.0015164082,0.0026581928,0.0012756798,0.00040421693,0.0003136176],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0032396212,0.00054600334,0.0012457741,0.00083309255,0.00081921363,0.00017794452,0.001503772,0.00053610175,0.00012293266],"category_scores_gemma":[0.0008246969,0.00040013887,0.0010912094,0.00008814956,0.0010360808,0.0001635592,0.0012558962,0.0019600473,0.0000017299501],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005855669,0.00014470275,0.0009403745,0.00059608766,0.0017054984,0.00023046989,0.0026610573,0.000004906194,0.0004953422,0.9746209,0.008666843,0.00934825],"study_design_scores_gemma":[0.00078122603,0.00015228953,0.0020322462,0.0007524364,0.0006971448,0.00045604268,0.00048906315,0.000007447099,0.000070251066,0.99261147,0.0015219552,0.00042840623],"about_ca_topic_score_codex":0.00000485868,"about_ca_topic_score_gemma":0.000004729853,"teacher_disagreement_score":0.036018007,"about_ca_system_score_codex":0.00003235744,"about_ca_system_score_gemma":0.00012140144,"threshold_uncertainty_score":0.999845},"labels":[],"label_agreement":null},{"id":"W2188313695","doi":"10.3384/lic.diva-123044","title":"Generalised Ramsey numbers and Bruhat order on involutions","year":2015,"lang":"en","type":"book","venue":"Linköping University Electronic Press eBooks","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Engineering Link (Canada)","funders":"","keywords":"Mathematics; Combinatorics; Conjecture; Ramsey theory; Ramsey's theorem; Order (exchange); Rank (graph theory); Discrete mathematics; Graph","score_opus":0.043539570492679196,"score_gpt":0.25044958298915887,"score_spread":0.20691001249647967,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2188313695","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002536168,0.0007429668,0.0004534877,0.00004412838,0.00032263092,0.00061850814,0.00007787325,0.00031580613,0.9948884],"genre_scores_gemma":[0.003397934,0.00031313737,0.0007117021,0.00019819685,0.00030612876,0.0000022212137,0.00006289712,0.00009550072,0.99491227],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9979265,0.0001888825,0.00023459013,0.00060224393,0.0003796839,0.0006681553],"domain_scores_gemma":[0.9983474,0.00026792925,0.00027915466,0.00070092035,0.0001978583,0.00020671084],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00029997271,0.00048667434,0.0005569015,0.0002320246,0.0005537149,0.00005143721,0.00055906817,0.00071289163,0.000017035798],"category_scores_gemma":[0.000074751944,0.0005114495,0.00016817664,0.000035226054,0.0003420327,0.00007329598,0.00041713702,0.0013040905,0.000003195519],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010868326,0.000016306281,0.000001550129,0.000109200984,0.0003388117,0.000023790904,0.00086959964,0.000012778168,0.000006799169,0.9479329,0.050038625,0.00054094574],"study_design_scores_gemma":[0.0008469052,0.000116234696,0.0000012361785,0.00017311782,0.00030810744,0.00001544039,0.000035656023,0.00008626989,0.000022314845,0.45041078,0.5475067,0.00047725372],"about_ca_topic_score_codex":0.00013890353,"about_ca_topic_score_gemma":0.00024175234,"teacher_disagreement_score":0.49752212,"about_ca_system_score_codex":0.00087545253,"about_ca_system_score_gemma":0.00086822495,"threshold_uncertainty_score":0.9997337},"labels":[],"label_agreement":null},{"id":"W2204554537","doi":"10.1016/j.jctb.2016.11.001","title":"Small cores in 3-uniform hypergraphs","year":2016,"lang":"en","type":"preprint","venue":"Journal of Combinatorial Theory Series B","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia; University of Toronto","funders":"European Research Council; Natural Sciences and Engineering Research Council of Canada","keywords":"Hypergraph; Combinatorics; Conjecture; Mathematics; Set (abstract data type); Core (optical fiber); Discrete mathematics; Computer science","score_opus":0.03283367440446975,"score_gpt":0.27851336671257326,"score_spread":0.24567969230810352,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2204554537","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9395182,0.001184275,0.00065957406,0.00032381725,0.03813961,0.0004632882,0.000048203106,0.000061240025,0.019601772],"genre_scores_gemma":[0.99436927,0.00056360493,0.0021438207,0.000058542082,0.0021986666,0.000010158451,0.000002050026,0.00008881064,0.00056509953],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9965615,0.0006658964,0.0015018105,0.0002800175,0.0005608589,0.00042987647],"domain_scores_gemma":[0.9953957,0.0015042183,0.0017051685,0.0007444718,0.00047840172,0.0001720041],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0033189992,0.000513348,0.0012890901,0.00060145755,0.00015188548,0.00009168269,0.001316001,0.00067066564,0.0001914457],"category_scores_gemma":[0.0014684249,0.00034045757,0.00066249224,0.00017216877,0.00041559298,0.00024296754,0.00089933927,0.0015521557,0.0000017923697],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0021698112,0.00014226076,0.00043296977,0.00022106743,0.00028320245,0.00013845351,0.001333522,0.000004753714,0.00009107605,0.99327844,0.00073030597,0.0011741269],"study_design_scores_gemma":[0.0017498205,0.0003803934,0.000197452,0.00087303447,0.00012567049,0.00015338068,0.00031768525,7.4381785e-7,0.0010793183,0.9910985,0.0036141265,0.00040986857],"about_ca_topic_score_codex":0.0000023525683,"about_ca_topic_score_gemma":0.000005304249,"teacher_disagreement_score":0.054851025,"about_ca_system_score_codex":0.00016144822,"about_ca_system_score_gemma":0.0002871803,"threshold_uncertainty_score":0.99990475},"labels":[],"label_agreement":null},{"id":"W2219887110","doi":"10.1016/j.ejc.2016.02.005","title":"An Erdős–Ko–Rado theorem for finite 2-transitive groups","year":2016,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":35,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"National Science Foundation of Sri Lanka; Natural Sciences and Engineering Research Council of Canada; Simons Foundation","keywords":"Mathematics; Combinatorics; Transitive relation; Cardinality (data modeling); Finite set; Discrete mathematics; Set (abstract data type)","score_opus":0.026531212264782104,"score_gpt":0.27791283433286507,"score_spread":0.25138162206808295,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2219887110","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5734902,0.000258379,0.40901616,0.0005216453,0.0029207438,0.0003004401,0.000048866958,0.00007644917,0.013367128],"genre_scores_gemma":[0.99592954,0.000071140676,0.003122332,0.00013491254,0.00042239163,8.498538e-7,7.5701365e-7,0.00008000491,0.000238059],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978985,0.00068954495,0.00063006394,0.00016357357,0.00033218123,0.0002861338],"domain_scores_gemma":[0.99700207,0.0014013395,0.00054339576,0.00037620886,0.00047585834,0.0002011568],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024597493,0.00021439003,0.00035415133,0.00015230115,0.00021681021,0.00004464397,0.00056703424,0.000045296056,0.00004355436],"category_scores_gemma":[0.00079993444,0.00012615933,0.00027692298,0.00013583757,0.00013797109,0.00028857487,0.000049465627,0.00022662882,0.000005606129],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023521628,0.00014846715,0.00018047578,0.000032283133,0.00009584158,0.00010615521,0.0016547622,0.0000021477817,0.0008413489,0.9886978,0.0013746369,0.0066308426],"study_design_scores_gemma":[0.0024270588,0.0012480604,0.00096703006,0.0001418236,0.00009517585,0.00009824269,0.00020916124,0.000017729672,0.0011464325,0.986043,0.0073791905,0.00022710621],"about_ca_topic_score_codex":5.9843316e-8,"about_ca_topic_score_gemma":1.0678345e-7,"teacher_disagreement_score":0.42243937,"about_ca_system_score_codex":0.000045969053,"about_ca_system_score_gemma":0.0000337161,"threshold_uncertainty_score":0.51446277},"labels":[],"label_agreement":null},{"id":"W2223734161","doi":"10.1016/j.ejc.2016.09.004","title":"Uniform linear embeddings of graphons","year":2016,"lang":"en","type":"preprint","venue":"European Journal of Combinatorics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Embedding; Combinatorics; Mathematics; Vertex (graph theory); Random graph; Space (punctuation); Discrete mathematics; Random element; Graph; Random variable; Statistics; Computer science","score_opus":0.03627176269484287,"score_gpt":0.29721844590930135,"score_spread":0.26094668321445846,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2223734161","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8411982,0.0014234725,0.033757925,0.00032889377,0.012450144,0.0003659088,0.00009958287,0.00008844093,0.11028741],"genre_scores_gemma":[0.9929487,0.000479545,0.005479568,0.000032591786,0.0004352183,3.8128863e-7,0.0000013582287,0.0001089659,0.0005136441],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99683076,0.000546886,0.0014734244,0.00019933424,0.00067818735,0.00027139997],"domain_scores_gemma":[0.99487007,0.00047677572,0.0028319154,0.0007294034,0.0009035811,0.0001882684],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002681229,0.00036311315,0.0008567095,0.00045733093,0.00011313393,0.000028530587,0.0013544552,0.0001410059,0.00005411818],"category_scores_gemma":[0.00085692905,0.00024576255,0.00069577293,0.0001955253,0.00020844284,0.0000896803,0.0009891829,0.0012078217,0.000004489279],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000094847666,0.00018969734,0.00042716038,0.00050203764,0.00043888262,0.00024713785,0.0015791296,0.000016448132,0.00013620904,0.9875106,0.007797804,0.001060007],"study_design_scores_gemma":[0.000931186,0.00031533095,0.00031211047,0.0009845231,0.00020621829,0.000114279035,0.00007955695,0.000011836228,0.0009936191,0.9886004,0.0071633486,0.0002876412],"about_ca_topic_score_codex":3.0953072e-7,"about_ca_topic_score_gemma":6.369241e-8,"teacher_disagreement_score":0.1517505,"about_ca_system_score_codex":0.000064338885,"about_ca_system_score_gemma":0.0001236711,"threshold_uncertainty_score":0.99999946},"labels":[],"label_agreement":null},{"id":"W2226875859","doi":"10.1016/j.jctb.2017.04.001","title":"Tournaments, 4-uniform hypergraphs, and an exact extremal result","year":2017,"lang":"en","type":"preprint","venue":"Journal of Combinatorial Theory Series B","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Connection (principal bundle); Combinatorics; Mathematics; Quadratic equation; Set (abstract data type); Subject (documents); Discrete mathematics; Computer science; Geometry","score_opus":0.0358942755046791,"score_gpt":0.32392821689909135,"score_spread":0.28803394139441224,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2226875859","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95948106,0.0017778458,0.0002301301,0.00023248029,0.026739262,0.00041574912,0.000070534035,0.00006140388,0.010991527],"genre_scores_gemma":[0.9895653,0.0014980998,0.004144523,0.000045851924,0.003924948,0.0000058208643,0.0000069738776,0.00009949212,0.0007089758],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9963601,0.0007158749,0.0013090402,0.00038403357,0.0008030624,0.00042788865],"domain_scores_gemma":[0.99407494,0.00060436217,0.0029691537,0.0013595808,0.0006157829,0.00037615703],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0041930606,0.00061145175,0.0013424343,0.00035630725,0.0008217483,0.0005221543,0.0015958284,0.000695763,0.00012095902],"category_scores_gemma":[0.0015604775,0.00046436614,0.00049730664,0.000059853526,0.0006496039,0.0008825331,0.0011465222,0.0019131693,5.7685435e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0029166203,0.00019273799,0.0001975927,0.00022735393,0.00057210954,0.00017279695,0.0022410355,0.0000039309534,0.000104687984,0.9888496,0.0011591479,0.0033623825],"study_design_scores_gemma":[0.0018277593,0.00084866694,0.00027275315,0.0005008378,0.00037457232,0.0004435271,0.0006391407,0.0000040981818,0.00048725103,0.98740375,0.006701963,0.0004956908],"about_ca_topic_score_codex":0.0000058700966,"about_ca_topic_score_gemma":0.00000313635,"teacher_disagreement_score":0.030084247,"about_ca_system_score_codex":0.00010076597,"about_ca_system_score_gemma":0.00025063174,"threshold_uncertainty_score":0.99978083},"labels":[],"label_agreement":null},{"id":"W2234277256","doi":"10.1112/s0025579315000388","title":"KAKEYA‐TYPE SETS IN LOCAL FIELDS WITH FINITE RESIDUE FIELD","year":2016,"lang":"en","type":"article","venue":"Mathematika","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Residue field; Mathematics; Finite field; Discrete valuation; Measure (data warehouse); Residue (chemistry); Local field; Pure mathematics; Field (mathematics); Discrete mathematics; Mathematical analysis; Geometry; Computer science; Data mining","score_opus":0.024512072801543994,"score_gpt":0.2821161062619627,"score_spread":0.2576040334604187,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2234277256","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9019041,0.000087464134,0.064907916,0.001603948,0.00026574885,0.00038588548,0.000009018659,0.00016960692,0.030666329],"genre_scores_gemma":[0.9894928,0.000020342059,0.007586518,0.0003516856,0.000052433425,0.00001855857,7.5016516e-7,0.000033307628,0.0024436533],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99881524,0.000065780936,0.00031376255,0.00025403337,0.0002387291,0.00031245468],"domain_scores_gemma":[0.99745756,0.0017599561,0.00009953144,0.0005641764,0.000052549796,0.00006619495],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032238726,0.0002006325,0.00030069254,0.00011344767,0.00008173046,0.000018939481,0.0002729364,0.00017719036,0.0007947813],"category_scores_gemma":[0.0005330802,0.000107239364,0.000057144567,0.00019525892,0.00010285862,0.00010222504,0.00010404272,0.00017850335,0.000044528333],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035898667,0.0001634923,0.0035867419,0.0003510875,0.00007865047,0.00015494545,0.004683176,0.0000132514015,0.0001735362,0.9555264,0.011503804,0.023405943],"study_design_scores_gemma":[0.0007631042,0.00019980552,0.00055702135,0.00041457234,0.00001809971,0.000036035795,0.00017884465,0.00007056952,0.003689196,0.9928187,0.0009884142,0.00026560976],"about_ca_topic_score_codex":0.00001446441,"about_ca_topic_score_gemma":0.00014285349,"teacher_disagreement_score":0.08758867,"about_ca_system_score_codex":0.000027348551,"about_ca_system_score_gemma":0.000028396433,"threshold_uncertainty_score":0.87022984},"labels":[],"label_agreement":null},{"id":"W2252453087","doi":"10.1016/j.dam.2017.07.001","title":"Almost all regular graphs are normal","year":2017,"lang":"en","type":"preprint","venue":"Discrete Applied Mathematics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Javna Agencija za Raziskovalno Dejavnost RS; Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Combinatorics; Mathematics; Conjecture; Vertex (graph theory); Degree (music); Bounded function; Graph; Discrete mathematics; Clique; Independent set; Cover (algebra); Vertex cover; Physics","score_opus":0.04600697440737298,"score_gpt":0.31025328435300903,"score_spread":0.264246309945636,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2252453087","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49989012,0.0013257551,0.025562828,0.00086839363,0.004523886,0.007211038,0.0015441912,0.0021042682,0.45696953],"genre_scores_gemma":[0.72267085,0.0007843266,0.270199,0.00044643352,0.0009884251,0.00075101457,0.00041169737,0.0007227928,0.0030254303],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99559623,0.000059692273,0.0012628112,0.001073561,0.0010611002,0.00094660575],"domain_scores_gemma":[0.9917622,0.0004155943,0.0023781017,0.0049617128,0.00017070712,0.00031165007],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010270021,0.001206867,0.0017790938,0.0002100453,0.0008510437,0.0004259893,0.0023704306,0.0011659553,0.00020280776],"category_scores_gemma":[0.00039611483,0.0010068283,0.0008163725,0.000093340976,0.00059137505,0.00010587767,0.0036918956,0.0016532635,0.00005647151],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000374283,0.0001545146,0.00005026805,0.0038197122,0.00069922337,0.000049848648,0.003673367,0.000022351043,0.00015201134,0.98087573,0.009991035,0.00047449034],"study_design_scores_gemma":[0.00050572783,0.000020049207,0.000117850745,0.0006808117,0.0007298403,0.00002724592,0.0004475006,0.00032701672,0.0011462925,0.991457,0.0033237573,0.0012169231],"about_ca_topic_score_codex":0.000013923049,"about_ca_topic_score_gemma":0.00002024846,"teacher_disagreement_score":0.4539441,"about_ca_system_score_codex":0.0000843271,"about_ca_system_score_gemma":0.00008779506,"threshold_uncertainty_score":0.9992382},"labels":[],"label_agreement":null},{"id":"W2255180715","doi":"10.37236/5642","title":"Symmetric Graphs with Respect to Graph Entropy","year":2017,"lang":"en","type":"preprint","venue":"The Electronic Journal of Combinatorics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Google (Canada); Simon Fraser University","funders":"","keywords":"Combinatorics; Mathematics; Windmill graph; Circulant graph; Vertex (graph theory); Discrete mathematics; Regular graph; Symmetric graph; Graph power; Graph; Line graph; Voltage graph","score_opus":0.021390075938804196,"score_gpt":0.29134162780386147,"score_spread":0.26995155186505726,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2255180715","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9615182,0.012958139,0.010763153,0.0022794334,0.0044101896,0.0011881863,0.000014103016,0.000085050495,0.006783545],"genre_scores_gemma":[0.9964724,0.0022939146,0.00025260638,0.00010444136,0.00031098616,0.00001234135,0.0000010535917,0.000095002215,0.0004572173],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9961143,0.00040422214,0.0008611136,0.0003414562,0.0012824856,0.0009964127],"domain_scores_gemma":[0.9940786,0.00086671795,0.0022091186,0.001859406,0.0007614355,0.00022472914],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0031979177,0.0005597249,0.001076079,0.0009163404,0.000724857,0.00022852425,0.0033531468,0.00031069136,0.000016617209],"category_scores_gemma":[0.001058418,0.00031418097,0.00061245926,0.0006541607,0.00022226744,0.00010151898,0.00080834766,0.003906203,0.0000025860911],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00039856348,0.00009334468,0.00018250302,0.00008844234,0.00087465515,0.000049380407,0.00065954623,0.00003759438,0.000014804719,0.99497765,0.0022861725,0.00033734037],"study_design_scores_gemma":[0.00093705446,0.0012601556,0.00024012283,0.0002747317,0.0006106043,0.00038643682,0.000086764485,0.0000062170643,0.0004096851,0.9932162,0.0021625445,0.00040944596],"about_ca_topic_score_codex":0.000010693736,"about_ca_topic_score_gemma":0.000010541576,"teacher_disagreement_score":0.03495424,"about_ca_system_score_codex":0.00047194635,"about_ca_system_score_gemma":0.00087246683,"threshold_uncertainty_score":0.99993104},"labels":[],"label_agreement":null},{"id":"W2267246357","doi":"10.1016/j.tcs.2016.02.030","title":"To catch a falling robber","year":2016,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada; State Administration of Foreign Experts Affairs; Ryerson University","keywords":"Falling (accident); Mathematics; Psychology","score_opus":0.021773099119165425,"score_gpt":0.2934336035943495,"score_spread":0.2716605044751841,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2267246357","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41091374,0.0000029524658,0.5833275,0.0009834628,0.0003731438,0.00010152364,0.0000013853319,0.00008617508,0.004210155],"genre_scores_gemma":[0.8812785,8.8502105e-7,0.117918134,0.0005754174,0.00016250869,0.000003873774,2.9222813e-8,0.0000099314375,0.000050694773],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984736,0.000053743777,0.00018816328,0.00039906046,0.00043211432,0.00045333355],"domain_scores_gemma":[0.99843603,0.00061974215,0.00002899857,0.00054544676,0.00011131542,0.0002584798],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011183762,0.0001275308,0.00015602623,0.00010735495,0.00034936625,0.000068108246,0.0009107585,0.000038198817,0.00019582937],"category_scores_gemma":[0.00036784192,0.00006681273,0.000052898846,0.0003975205,0.0017105609,0.00012457813,0.00066009624,0.00007644496,0.000068972564],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009737724,0.000013256714,0.000060702514,0.000003652635,0.0000026494074,0.000003155149,0.0005351087,0.000002061707,0.0014079988,0.9751105,0.00013229415,0.022718929],"study_design_scores_gemma":[0.00011997294,0.00007740558,0.0002720715,0.000047041685,0.0000045689485,0.000013757481,0.0000046741184,0.00071450847,0.00582242,0.9925704,0.00020217779,0.0001509957],"about_ca_topic_score_codex":6.924964e-7,"about_ca_topic_score_gemma":4.1243638e-7,"teacher_disagreement_score":0.47036478,"about_ca_system_score_codex":0.00003790912,"about_ca_system_score_gemma":0.000030189807,"threshold_uncertainty_score":0.63026327},"labels":[],"label_agreement":null},{"id":"W2285073523","doi":"10.1090/mcom/3221","title":"Every positive integer is a sum of three palindromes","year":2017,"lang":"en","type":"preprint","venue":"Mathematics of Computation","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Sheridan College","funders":"National Research Foundation","keywords":"Integer (computer science); Palindrome; Combinatorics; Mathematics; Computer science; Biology; Genetics; Programming language; CRISPR","score_opus":0.059115241507991,"score_gpt":0.3393724487026204,"score_spread":0.2802572071946294,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2285073523","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.74791396,0.00023145533,0.24376494,0.000104380204,0.0006839419,0.0008307277,0.00024909797,0.000056861893,0.0061646174],"genre_scores_gemma":[0.8906598,0.000021134287,0.109034196,0.000016007329,0.000065375694,0.000014191089,0.000033677967,0.000052058993,0.00010352959],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99779934,0.00006924444,0.001043384,0.00031270622,0.0005856741,0.00018966755],"domain_scores_gemma":[0.9949979,0.0010119796,0.002372911,0.0009768896,0.0005920008,0.00004828585],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006760915,0.00036397428,0.0010740387,0.00025865767,0.00012619668,0.000049289472,0.00069555826,0.00039194987,0.000047281093],"category_scores_gemma":[0.00055509876,0.0003117951,0.00042417628,0.000060412774,0.00029114223,0.000080093276,0.00088106823,0.0004012185,0.0000029072396],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010714755,0.00088841276,0.00053516007,0.01742372,0.0019636725,0.000013441408,0.046615824,0.0008929387,0.0003191127,0.92100334,0.0027511474,0.0074860593],"study_design_scores_gemma":[0.00027521924,0.00006674021,0.0007750285,0.0018155486,0.00023294047,0.000008735912,0.0001905157,0.0118677365,0.0038659822,0.9806267,0.0000051320694,0.0002697269],"about_ca_topic_score_codex":0.000023005088,"about_ca_topic_score_gemma":0.0000068599334,"teacher_disagreement_score":0.14274584,"about_ca_system_score_codex":0.00003705376,"about_ca_system_score_gemma":0.00009628673,"threshold_uncertainty_score":0.9999334},"labels":[],"label_agreement":null},{"id":"W2287236900","doi":"10.1002/rsa.20717","title":"Rainbow perfect matchings and Hamilton cycles in the random geometric graph","year":2017,"lang":"en","type":"preprint","venue":"Random Structures and Algorithms","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada; Ryerson University; Simons Foundation","keywords":"Combinatorics; Mathematics; Rainbow; Vertex (graph theory); Graph; Hamiltonian path; Discrete mathematics","score_opus":0.028198398681098653,"score_gpt":0.30371194710728594,"score_spread":0.2755135484261873,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2287236900","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9807177,0.013112905,0.0015040329,0.00031620197,0.0012890128,0.0018236438,0.00017700685,0.00008686399,0.0009726322],"genre_scores_gemma":[0.987339,0.0068160864,0.004672195,0.00021112143,0.000631442,0.00010457671,0.000034512228,0.0000774673,0.000113550675],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.996508,0.0006087373,0.0007193411,0.0009345227,0.0006299927,0.0005993846],"domain_scores_gemma":[0.99544615,0.0025186287,0.0006143117,0.0012089616,0.00007096292,0.0001409626],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0024260997,0.0008229341,0.001528877,0.00064740994,0.0011752809,0.0007609293,0.0010417276,0.0006365134,0.000032891363],"category_scores_gemma":[0.0007896335,0.00048127348,0.0004210914,0.0001981313,0.0006645493,0.00013079437,0.00080455776,0.0016472817,3.3159168e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.008685864,0.00040543676,0.014614144,0.009966677,0.003637802,0.00095886574,0.11248297,0.00043851018,0.00023240256,0.2794453,0.007565269,0.56156677],"study_design_scores_gemma":[0.011290395,0.000058751135,0.015200737,0.00025279517,0.00028739887,0.00022475593,0.00044713475,0.0005501266,0.00005849047,0.9702073,0.0007472861,0.0006748685],"about_ca_topic_score_codex":0.00031168634,"about_ca_topic_score_gemma":0.000044791268,"teacher_disagreement_score":0.690762,"about_ca_system_score_codex":0.00002532371,"about_ca_system_score_gemma":0.000039670867,"threshold_uncertainty_score":0.9997639},"labels":[],"label_agreement":null},{"id":"W2289102318","doi":"10.1016/j.jctb.2016.12.006","title":"A proof of the Barát–Thomassen conjecture","year":2017,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"European Research Council; Centre International de Mathématiques et Informatique de Toulouse; Fonds Québécois de la Recherche sur la Nature et les Technologies; Agence Nationale de la Recherche","keywords":"Mathematics; Conjecture; Combinatorics; Bar (unit); Discrete mathematics","score_opus":0.019120371912559903,"score_gpt":0.2882693660115007,"score_spread":0.26914899409894083,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2289102318","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9732065,0.00021991911,0.00017348523,0.00070328475,0.01399433,0.00026380128,0.000010200424,0.000011292259,0.011417192],"genre_scores_gemma":[0.9980633,0.000011542061,0.0005007249,0.000029506547,0.0008507471,0.000001476338,8.8109935e-8,0.000023567463,0.00051904377],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998273,0.00037938342,0.00060371665,0.0000964373,0.00046436358,0.00018308942],"domain_scores_gemma":[0.99636185,0.0005235212,0.0017828892,0.0009052018,0.00035616837,0.000070365655],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018077082,0.00017250018,0.0005107542,0.000056367688,0.00065583613,0.000079456324,0.0013982212,0.00015578986,0.000089695684],"category_scores_gemma":[0.0023894496,0.00009789036,0.00038256773,0.000059905924,0.0006543037,0.00034028923,0.00032593936,0.0004450014,2.1847174e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007003228,0.000067353125,0.00050758244,0.00006248714,0.00017052551,0.000012179937,0.0011062558,0.0000014897315,0.0005123012,0.99521,0.00081166916,0.00083781144],"study_design_scores_gemma":[0.0012079529,0.00030963737,0.0011092507,0.00012217827,0.000111850386,0.0001475705,0.00022180303,6.116799e-7,0.031351097,0.9610955,0.004212196,0.00011035767],"about_ca_topic_score_codex":8.8512684e-7,"about_ca_topic_score_gemma":0.0000011510643,"teacher_disagreement_score":0.034114525,"about_ca_system_score_codex":0.000026369173,"about_ca_system_score_gemma":0.00012366122,"threshold_uncertainty_score":0.5044228},"labels":[],"label_agreement":null},{"id":"W2289474823","doi":"10.1017/s0963548317000165","title":"Fractional Clique Decompositions of Dense Partite Graphs","year":2017,"lang":"en","type":"preprint","venue":"Combinatorics Probability Computing","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Trinity College","funders":"European Commission","keywords":"Mathematics; Clique; Simple (philosophy); Degree (music); Decomposition; Graph; Combinatorics; Simple graph; Discrete mathematics; Physics","score_opus":0.06869011615742723,"score_gpt":0.3495413971274826,"score_spread":0.2808512809700554,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2289474823","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9767555,0.00040895146,0.014537711,0.00014868763,0.00361737,0.00093820825,0.000061451596,0.00021542535,0.0033166842],"genre_scores_gemma":[0.9818439,0.000033517474,0.01783167,0.00002555176,0.00013313543,0.000024682035,0.000026948159,0.000049997776,0.00003061616],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9966002,0.00044657776,0.0011878795,0.00078468514,0.0005498729,0.00043079033],"domain_scores_gemma":[0.99351096,0.0016749699,0.0016609513,0.0021599077,0.0008378963,0.00015531365],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0020610439,0.0004775569,0.0009836978,0.00021050454,0.0010703356,0.000118046824,0.0011806106,0.00061595155,0.000024983527],"category_scores_gemma":[0.002168657,0.0004775633,0.0006389872,0.00014936402,0.0004994975,0.00009362227,0.0026965702,0.001538228,0.0000020051527],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028933859,0.0004830896,0.013472185,0.0014820666,0.00019525767,0.0000064640953,0.0007474798,0.00040487555,0.000030136565,0.98214895,0.0002859561,0.0007145834],"study_design_scores_gemma":[0.00035809196,0.000053630698,0.00588645,0.00057217176,0.00013317385,0.000015090271,0.000016098,0.0018830991,0.0005336521,0.9900314,0.00009219784,0.000424928],"about_ca_topic_score_codex":0.000036738573,"about_ca_topic_score_gemma":0.000007791145,"teacher_disagreement_score":0.007882444,"about_ca_system_score_codex":0.00020565395,"about_ca_system_score_gemma":0.0002645922,"threshold_uncertainty_score":0.9997676},"labels":[],"label_agreement":null},{"id":"W2293176046","doi":"10.1016/j.jctb.2016.05.007","title":"On the Corrádi–Hajnal theorem and a question of Dirac","year":2016,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"National Security Agency; Russian Foundation for Basic Research; National Science Foundation","keywords":"Combinatorics; Disjoint sets; Mathematics; Graph; Vertex (graph theory); Independence number; Discrete mathematics","score_opus":0.013864062301766466,"score_gpt":0.2627733450029747,"score_spread":0.24890928270120827,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2293176046","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99074703,0.00015278399,0.0007535975,0.000553151,0.0033836248,0.00012417312,0.000007990688,0.000012770053,0.0042648776],"genre_scores_gemma":[0.9990121,0.00010015529,0.00020692497,0.000057568857,0.00038188422,0.0000015388971,7.2471146e-8,0.000017932409,0.00022179035],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982438,0.00065916387,0.00050243567,0.000090165886,0.00036086846,0.00014353826],"domain_scores_gemma":[0.99466246,0.004086634,0.00066351757,0.00026889937,0.00025492418,0.00006354263],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029241932,0.00015288967,0.00035581365,0.00008638264,0.00016254126,0.000021818782,0.00030100593,0.00009421556,0.00017516196],"category_scores_gemma":[0.002638269,0.00006546959,0.0001448504,0.000084045445,0.0005280745,0.00020380736,0.00008009331,0.00020735528,7.4771356e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002802001,0.000060700877,0.00006737156,0.000018648803,0.00009153955,0.0000063134353,0.00087217696,1.8584848e-7,0.0011889713,0.9923263,0.00050708797,0.0020586585],"study_design_scores_gemma":[0.00090302905,0.0010455318,0.00013938558,0.00023141775,0.000058736667,0.000095538795,0.0003249916,4.2079702e-7,0.006842692,0.98943186,0.0008346045,0.00009177056],"about_ca_topic_score_codex":3.811244e-7,"about_ca_topic_score_gemma":2.1469351e-7,"teacher_disagreement_score":0.008265101,"about_ca_system_score_codex":0.000028438995,"about_ca_system_score_gemma":0.000042560263,"threshold_uncertainty_score":0.3158445},"labels":[],"label_agreement":null},{"id":"W2293828016","doi":"10.1016/j.jctb.2017.09.010","title":"Characterizing 4-critical graphs with Ore-degree at most seven","year":2017,"lang":"en","type":"preprint","venue":"Journal of Combinatorial Theory Series B","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Conjecture; Graph; Degree (music); Discrete mathematics; Generalization; Physics","score_opus":0.03701311694568272,"score_gpt":0.3034976166614376,"score_spread":0.2664844997157549,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2293828016","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9448269,0.00083692657,0.00042043978,0.0008342415,0.037394766,0.0005426904,0.00012838497,0.00010781734,0.014907813],"genre_scores_gemma":[0.9927802,0.00024989006,0.0031723396,0.00009149814,0.0026999828,0.000012725233,0.000009547931,0.00014714358,0.0008366926],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9961268,0.00069447217,0.0012006306,0.00041240608,0.0010176783,0.00054806174],"domain_scores_gemma":[0.99349207,0.0015018692,0.0023364527,0.0014128598,0.00093131786,0.0003254386],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0027095128,0.00070325093,0.0016001486,0.00029521738,0.0009998304,0.00036213337,0.0017777963,0.0006978715,0.00025792044],"category_scores_gemma":[0.0025302817,0.0004934887,0.0005887582,0.00009545069,0.0011506857,0.00054028817,0.0016664692,0.0021290837,0.0000028134334],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0047191987,0.00014292893,0.00018135952,0.0004445759,0.0007249095,0.00032783247,0.0025609613,0.0000013327692,0.00029917786,0.9888987,0.0008756452,0.0008234074],"study_design_scores_gemma":[0.001321095,0.0007255299,0.00022440894,0.0010812253,0.00052291976,0.00090114743,0.00028829832,0.00000104301,0.0016595507,0.9856064,0.0070712604,0.0005971522],"about_ca_topic_score_codex":0.000002172082,"about_ca_topic_score_gemma":0.0000028565166,"teacher_disagreement_score":0.04795326,"about_ca_system_score_codex":0.00018677575,"about_ca_system_score_gemma":0.00034953194,"threshold_uncertainty_score":0.9997517},"labels":[],"label_agreement":null},{"id":"W2294714952","doi":"10.1017/s0963548312000533","title":"Expanders Are Universal for the Class of All Spanning Trees","year":2013,"lang":"en","type":"article","venue":"Combinatorics Probability Computing","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Trinity College","funders":"Deutscher Akademischer Austauschdienst","keywords":"Combinatorics; Mathematics; Random regular graph; Discrete mathematics; Vertex (graph theory); Random graph; Graph; Line graph; Pathwidth","score_opus":0.060476734388830486,"score_gpt":0.2922448994312497,"score_spread":0.2317681650424192,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2294714952","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9626635,0.00015441593,0.033965323,0.00041808275,0.00072464824,0.0011816343,0.000003564615,0.00010723146,0.00078161375],"genre_scores_gemma":[0.99425006,0.0000031820543,0.0055340496,0.00005605702,0.00005283176,0.000014185216,0.0000013133553,0.000023055241,0.00006527469],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99862486,0.00012108913,0.0004204483,0.00027826577,0.00022831833,0.0003270099],"domain_scores_gemma":[0.9954753,0.003175672,0.0003684969,0.0005727515,0.00034686914,0.00006092365],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00088539894,0.00018628921,0.00033226478,0.00005232069,0.00040526057,0.00005408367,0.0005286051,0.00010833334,0.0000103978855],"category_scores_gemma":[0.0010139624,0.00013107879,0.00019321514,0.00019933083,0.00023954752,0.00013581761,0.00030783305,0.00022114898,5.976351e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013578995,0.0001094869,0.007758133,0.00026857876,0.00009626487,3.7224729e-7,0.0026081516,0.00028276283,0.0000572859,0.9852792,0.0007850108,0.0027411708],"study_design_scores_gemma":[0.0005511424,0.00007165856,0.004645447,0.000053362495,0.000053506727,0.0000018156584,0.0015536541,0.01652546,0.00029457014,0.97576123,0.00032800497,0.00016014896],"about_ca_topic_score_codex":0.00002669101,"about_ca_topic_score_gemma":0.000004680226,"teacher_disagreement_score":0.031586565,"about_ca_system_score_codex":0.000090305904,"about_ca_system_score_gemma":0.000032217926,"threshold_uncertainty_score":0.5345238},"labels":[],"label_agreement":null},{"id":"W2295702520","doi":"10.1016/j.jcta.2016.12.006","title":"Constructions and nonexistence results for suitable sets of permutations","year":2017,"lang":"en","type":"preprint","venue":"Journal of Combinatorial Theory Series A","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Permutation (music); Combinatorics; Mathematics; Set (abstract data type); Discrete mathematics; Computer science; Physics","score_opus":0.04575628242448536,"score_gpt":0.3403808837993896,"score_spread":0.2946246013749042,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2295702520","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9411282,0.0013965302,0.002962359,0.000575113,0.03292552,0.0013349619,0.0016644893,0.00004490157,0.017967908],"genre_scores_gemma":[0.97584665,0.00026422358,0.022877809,0.000007955064,0.00052025827,0.000014146548,0.000008214404,0.00003415464,0.00042661375],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99792135,0.00024423713,0.0011030668,0.00020757299,0.0003167817,0.00020696808],"domain_scores_gemma":[0.99347186,0.0019939295,0.0027866077,0.0006211713,0.001017195,0.00010923599],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024392921,0.0002652583,0.00089477375,0.00018663077,0.0005551874,0.000115902694,0.0005945572,0.0003544856,0.000013462457],"category_scores_gemma":[0.004789605,0.00021734678,0.00035981645,0.000045136872,0.00081000547,0.00023504971,0.00042942804,0.00063275266,8.533435e-8],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0020338881,0.00006488524,0.00002728605,0.0004502705,0.00036128028,0.0000069462044,0.0029667313,0.000015434605,0.00007152047,0.99278015,0.0008073416,0.0004142937],"study_design_scores_gemma":[0.0019353343,0.00042731586,0.000072902105,0.000475018,0.0003812933,0.00023005664,0.0012706151,0.000009929924,0.0006742336,0.99207985,0.0022393025,0.00020412491],"about_ca_topic_score_codex":0.0000034398793,"about_ca_topic_score_gemma":0.0000019286886,"teacher_disagreement_score":0.03471841,"about_ca_system_score_codex":0.000041158364,"about_ca_system_score_gemma":0.00030969863,"threshold_uncertainty_score":0.8863144},"labels":[],"label_agreement":null},{"id":"W2296193615","doi":"10.1016/j.ejc.2016.12.001","title":"Cycles in graphs of fixed girth with large size","year":2017,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; Hungarian Scientific Research Fund","keywords":"Mathematics; Combinatorics; Girth (graph theory); Infinity; Upper and lower bounds; Constant (computer programming); Discrete mathematics; Mathematical analysis","score_opus":0.023530214582149284,"score_gpt":0.2812424542988576,"score_spread":0.2577122397167083,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2296193615","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9788693,0.00015227994,0.00029704068,0.00006782974,0.00048984593,0.00006113399,0.0000041098615,0.00000751135,0.020050943],"genre_scores_gemma":[0.99802274,0.0000757118,0.0016661835,0.000022004735,0.00004516426,1.5687854e-7,1.1927015e-7,0.000033997956,0.00013395362],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99851257,0.0003041978,0.00054891297,0.000092816146,0.00034822032,0.00019330937],"domain_scores_gemma":[0.99768907,0.00031723917,0.0011754305,0.00051379343,0.0002210691,0.00008340081],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017066941,0.0001423969,0.0003762254,0.00012947054,0.00020331745,0.00004441627,0.00078083295,0.000027600387,0.000022934617],"category_scores_gemma":[0.0010191464,0.00009743818,0.00012512803,0.00010055085,0.00013872572,0.00017347226,0.00014597122,0.00034952012,9.073534e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018047402,0.00027323476,0.07816758,0.00008710193,0.00008964946,0.00051149196,0.0013473843,0.000003334104,0.00009659102,0.9179483,0.0006712649,0.00062360236],"study_design_scores_gemma":[0.0034513304,0.0005426947,0.22480968,0.0002862639,0.000053275042,0.00009620511,0.00025101262,0.0000050203357,0.0004990998,0.7685847,0.0012448922,0.00017578462],"about_ca_topic_score_codex":7.55719e-7,"about_ca_topic_score_gemma":0.0000018258228,"teacher_disagreement_score":0.14936355,"about_ca_system_score_codex":0.000015736165,"about_ca_system_score_gemma":0.00003006942,"threshold_uncertainty_score":0.39734134},"labels":[],"label_agreement":null},{"id":"W2306909249","doi":"10.46298/dmtcs.3504","title":"Random assignment and shortest path problems","year":2006,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Mathematics; Combinatorics; Shortest path problem; Mathematical proof; Path (computing); Discrete mathematics; Random assignment; Random graph; Assignment problem; Limit (mathematics); Similarity (geometry); Distance; Graph; Computer science; Statistics; Artificial intelligence","score_opus":0.012975761289917552,"score_gpt":0.25492737676690247,"score_spread":0.2419516154769849,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2306909249","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15615147,0.00006890779,0.82571673,0.0002062586,0.00026224926,0.0005935492,0.000010043433,0.00016724944,0.016823541],"genre_scores_gemma":[0.812032,0.0000058742535,0.18766934,0.00007771711,0.00013287611,0.00002039459,0.0000017564416,0.000026541144,0.00003351626],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971721,0.0000926717,0.000600755,0.0006068358,0.0008947461,0.00063287636],"domain_scores_gemma":[0.9978398,0.00093733857,0.00016729646,0.00072019483,0.00011979226,0.00021559252],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0020768195,0.0003399682,0.0004672066,0.00013653819,0.0007500113,0.00035104956,0.0007642848,0.000088846915,0.00009642481],"category_scores_gemma":[0.0002072655,0.00022717637,0.00011583229,0.00038123268,0.0037331623,0.00020444287,0.0007415911,0.00022928989,0.0000065036675],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008606218,0.00010170181,0.00009480739,0.000074132084,0.000011238453,0.0000074469353,0.0009927503,0.000035991867,0.00038631336,0.997557,0.000114610375,0.00061539246],"study_design_scores_gemma":[0.00049796957,0.00010201285,0.00014049599,0.000113801216,0.000042378826,0.000057449477,0.000057135177,0.102921456,0.00053133833,0.89517885,0.00005231874,0.00030480413],"about_ca_topic_score_codex":0.000002421551,"about_ca_topic_score_gemma":8.8218707e-7,"teacher_disagreement_score":0.6558805,"about_ca_system_score_codex":0.000034613884,"about_ca_system_score_gemma":0.000034729714,"threshold_uncertainty_score":0.9989781},"labels":[],"label_agreement":null},{"id":"W230946936","doi":"","title":"Ramsey Set Numbers in Balanced Complete Multipartite Graphs","year":2011,"lang":"en","type":"article","venue":"Journal of Combinatorial Mathematics and Combinatorial Computing","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Multipartite; Mathematics; Combinatorics; Set (abstract data type); Discrete mathematics; Computer science","score_opus":0.04267547196392783,"score_gpt":0.28352834531755744,"score_spread":0.2408528733536296,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W230946936","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98473936,0.00013597854,0.0009180358,0.000024185727,0.010822239,0.00033879158,0.000004708517,0.00004688676,0.0029698054],"genre_scores_gemma":[0.9819044,0.000033386645,0.017487895,0.000031574586,0.0004794292,0.0000025269924,9.107506e-7,0.000054814678,0.0000050935673],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99654603,0.00024327637,0.0017359536,0.00027879453,0.0006705337,0.0005254189],"domain_scores_gemma":[0.9963496,0.00121199,0.0014192092,0.00038547762,0.00038676593,0.00024697933],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0024245472,0.00041422862,0.0011771474,0.0003665028,0.00030452342,0.000092938,0.0006181937,0.00024836845,0.000029951176],"category_scores_gemma":[0.0009275683,0.00035148763,0.00029253773,0.0004491621,0.00020556297,0.00024603645,0.00032664818,0.00078387564,0.0000016767018],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021819415,0.00046508442,0.0024477402,0.00021166081,0.000129581,0.000066619585,0.009547465,0.0000030753645,0.00019774876,0.9861648,0.00018762716,0.00036041718],"study_design_scores_gemma":[0.0053875796,0.00045470984,0.0008380245,0.0004190067,0.000094031355,0.00013457837,0.0008560448,0.00085753115,0.0003681753,0.99000746,0.00019763992,0.00038519723],"about_ca_topic_score_codex":0.000025691885,"about_ca_topic_score_gemma":0.000002495651,"teacher_disagreement_score":0.016569858,"about_ca_system_score_codex":0.0000742996,"about_ca_system_score_gemma":0.00007030127,"threshold_uncertainty_score":0.9998937},"labels":[],"label_agreement":null},{"id":"W2321973861","doi":"10.1515/integ.2010.049","title":"Sums and Products of Distinct Sets and Distinct Elements in ℂ","year":2010,"lang":"en","type":"article","venue":"Integers","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Mathematics; Algebra over a field; Pure mathematics","score_opus":0.018118862229890193,"score_gpt":0.2935586034755586,"score_spread":0.27543974124566845,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2321973861","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99678826,0.000039579983,0.000010232967,0.00008524047,0.00022044686,0.00014703276,0.0000148415165,0.000012920088,0.0026814274],"genre_scores_gemma":[0.9977634,0.0000046158584,0.0020847386,0.000014701057,0.000024561696,0.0000046208033,0.0000018999709,0.000010706109,0.00009076557],"study_design_codex":"observational","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99935144,0.00002699236,0.00022107354,0.00017102588,0.000097911136,0.00013153233],"domain_scores_gemma":[0.99946564,0.00017768965,0.00008265429,0.00019972755,0.000034719145,0.00003955413],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031936797,0.000099904886,0.00016664152,0.00006200322,0.000039695,0.000011025168,0.00008675854,0.000051959327,0.000031862895],"category_scores_gemma":[0.00080616155,0.00007391367,0.000016484428,0.0000735681,0.0002162562,0.000045507557,0.00008882075,0.00018580836,3.5518087e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013736467,0.000190499,0.5473189,0.0007681436,0.000085352614,0.000024571285,0.0076718763,1.0785772e-7,0.0114090415,0.3945582,0.0015023305,0.036333665],"study_design_scores_gemma":[0.00095970393,0.00012414054,0.23718363,0.00012202464,0.000042025753,0.00003679349,0.00050987996,0.00010452109,0.008818628,0.75027484,0.0015131292,0.0003106868],"about_ca_topic_score_codex":0.000039358834,"about_ca_topic_score_gemma":0.0002438532,"teacher_disagreement_score":0.35571665,"about_ca_system_score_codex":0.0000053521544,"about_ca_system_score_gemma":0.000010016325,"threshold_uncertainty_score":0.30141118},"labels":[],"label_agreement":null},{"id":"W2322988435","doi":"10.4310/joc.2014.v5.n1.a6","title":"Cops and Robbers playing on edges","year":2014,"lang":"en","type":"article","venue":"Journal of Combinatorics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada; Western Michigan University","keywords":"Mathematics; Combinatorics","score_opus":0.02471838052824164,"score_gpt":0.2767811090525798,"score_spread":0.25206272852433814,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2322988435","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98751616,0.00018575181,0.0011273728,0.00021122846,0.0013849232,0.000039606533,3.976211e-7,0.000011955461,0.009522585],"genre_scores_gemma":[0.99860436,0.00006300863,0.00089574244,0.00016120987,0.0001486031,2.5357832e-7,6.4024e-8,0.000013919871,0.00011285428],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992025,0.00007751265,0.0002794773,0.00006371156,0.00025719524,0.000119600416],"domain_scores_gemma":[0.99850476,0.0008628718,0.00029780949,0.00013510513,0.000111911206,0.000087551096],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006746397,0.000098350916,0.00023780794,0.00010905574,0.00014892202,0.000029159564,0.00015177923,0.000067819834,0.0000089590985],"category_scores_gemma":[0.0007451053,0.000070093236,0.00007054545,0.00007893278,0.000045002307,0.000072606534,0.00004122975,0.00027605554,7.35756e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029534604,0.00004356707,0.0018408395,0.00003074753,0.000033197895,0.000007092164,0.00046805487,0.000004205424,0.00004965954,0.99185926,0.0037943497,0.0018395134],"study_design_scores_gemma":[0.0006466296,0.00033797635,0.0017371636,0.00006475,0.00003568751,0.00008109967,0.00008858815,0.000045127643,0.00043883972,0.9914476,0.004987446,0.000089074245],"about_ca_topic_score_codex":2.9914696e-7,"about_ca_topic_score_gemma":1.7608365e-7,"teacher_disagreement_score":0.0110881645,"about_ca_system_score_codex":0.000026367255,"about_ca_system_score_gemma":0.000013278613,"threshold_uncertainty_score":0.28583193},"labels":[],"label_agreement":null},{"id":"W2332235355","doi":"10.1515/integ.2010.051","title":"Upper and Lower Bounds for a Function Related to Brown's Lemma","year":2010,"lang":"en","type":"article","venue":"Integers","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Lemma (botany); Mathematics; Integer (computer science); Combinatorics; Function (biology); Discrete mathematics; Upper and lower bounds; Mathematical analysis; Botany; Computer science","score_opus":0.013370000718982776,"score_gpt":0.2859663436503139,"score_spread":0.27259634293133117,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2332235355","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.982246,0.0000148111485,0.0016551443,0.0004597623,0.0020505874,0.00027265053,0.000008478651,0.00007636867,0.013216236],"genre_scores_gemma":[0.99100494,0.0000010692129,0.0046756933,0.00040470518,0.00007934648,0.000025879544,0.000001761326,0.000023999133,0.003782581],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994085,0.000013042568,0.00015187476,0.00017664584,0.00008567518,0.0001642819],"domain_scores_gemma":[0.9993725,0.00021872496,0.000038227172,0.00023104505,0.000063884625,0.00007563696],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002478145,0.0001048348,0.00012121696,0.00007608971,0.00013840482,0.00003692908,0.00008751105,0.00013143405,0.0002167652],"category_scores_gemma":[0.0004343142,0.000079925696,0.00007296078,0.000071684735,0.000076001306,0.000064222324,0.00005597379,0.000200859,0.000008414041],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018217051,0.000022122904,0.00028292253,0.000028454058,0.00005952393,0.0000014275163,0.0015069939,5.260056e-7,0.0064144144,0.96396726,0.01780046,0.009733734],"study_design_scores_gemma":[0.00034707086,0.00017168731,0.0004856967,0.000016852315,0.000037505084,0.00001601763,0.00018561042,0.000061567756,0.0009070846,0.9408504,0.056775354,0.00014514798],"about_ca_topic_score_codex":0.000006738557,"about_ca_topic_score_gemma":0.000024099449,"teacher_disagreement_score":0.038974892,"about_ca_system_score_codex":0.000010083918,"about_ca_system_score_gemma":0.00001019594,"threshold_uncertainty_score":0.32592753},"labels":[],"label_agreement":null},{"id":"W2337358905","doi":"10.1016/j.jcta.2016.11.001","title":"An upper bound for the size of a k-uniform intersecting family with covering number k","year":2016,"lang":"en","type":"preprint","venue":"Journal of Combinatorial Theory Series A","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"National Science Foundation","keywords":"Combinatorics; Upper and lower bounds; Mathematics; Geometry; Mathematical analysis","score_opus":0.019286416900040262,"score_gpt":0.29779499393241077,"score_spread":0.27850857703237053,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2337358905","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9690431,0.00020565666,0.013774246,0.00011282832,0.013114057,0.000664198,0.00006597259,0.0000296226,0.002990345],"genre_scores_gemma":[0.9942699,0.00007266999,0.00358595,0.000047262998,0.0017647374,0.000018774599,7.311149e-7,0.000085911815,0.00015402562],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99762243,0.00030167142,0.0010197387,0.00021904158,0.0005201684,0.0003169347],"domain_scores_gemma":[0.9916254,0.0046321875,0.0021034076,0.00072837865,0.00080893026,0.000101671205],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003096728,0.00040026032,0.00094507943,0.00008514258,0.00033856236,0.0001400616,0.0010602536,0.0003030273,0.000092956994],"category_scores_gemma":[0.0012459052,0.0002026097,0.0005306825,0.00008254659,0.00046351412,0.0003718114,0.00040630376,0.0008056026,2.269248e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0074341507,0.000096533106,0.00017948801,0.00037828338,0.001017451,0.000009254614,0.0051344717,0.000021722512,0.00046938474,0.9842627,0.00019749954,0.00079904555],"study_design_scores_gemma":[0.001821572,0.0009046792,0.000086708846,0.0009454296,0.00040149645,0.00015313072,0.0044312254,0.000009446216,0.0016619428,0.9877271,0.001572979,0.00028429768],"about_ca_topic_score_codex":0.0000039930637,"about_ca_topic_score_gemma":0.0000020304917,"teacher_disagreement_score":0.025226863,"about_ca_system_score_codex":0.00010936943,"about_ca_system_score_gemma":0.00026575715,"threshold_uncertainty_score":0.8262184},"labels":[],"label_agreement":null},{"id":"W2341255395","doi":"","title":"Another 3-Part Sperner Theorem","year":2005,"lang":"en","type":"article","venue":"","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Cardinality (data modeling); Combinatorics; Mathematics; Set (abstract data type); Discrete mathematics; Set theory; Order (exchange); Computer science","score_opus":0.031782562091085126,"score_gpt":0.28681666300137676,"score_spread":0.25503410091029166,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2341255395","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17836197,0.000062330735,0.0016869776,0.0005766096,0.00022258182,0.000102937454,0.0000025195845,0.00017416634,0.8188099],"genre_scores_gemma":[0.91539,0.00000986058,0.021293765,0.0020007973,0.0006327277,0.0000039168294,5.6948977e-7,0.00003044189,0.060637906],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99940026,0.000030477695,0.0001448756,0.00013058263,0.00012392823,0.0001698955],"domain_scores_gemma":[0.99947435,0.00011661306,0.00003165941,0.0003249782,0.000020096864,0.000032332682],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00019734491,0.00010081882,0.000112579895,0.00003193067,0.00008899422,0.000016557295,0.00015531314,0.000057925183,0.00998181],"category_scores_gemma":[0.000052339583,0.00006257583,0.00007383687,0.000049862807,0.00006965668,0.00006286483,0.00005306454,0.00007598712,0.0001450327],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006470362,0.000023233117,0.00013405645,0.000004231501,0.00001714934,8.6286377e-7,0.00040390634,0.0000010015807,0.00008503659,0.9502952,0.042642914,0.006385949],"study_design_scores_gemma":[0.00015277737,0.000009578814,0.00007721379,0.000004601758,0.000009282434,0.0000073682713,0.0000487484,0.00004725794,0.0033672515,0.7113887,0.28478113,0.0001060445],"about_ca_topic_score_codex":0.00000143213,"about_ca_topic_score_gemma":0.000009433612,"teacher_disagreement_score":0.758172,"about_ca_system_score_codex":0.000011330484,"about_ca_system_score_gemma":0.0000052267605,"threshold_uncertainty_score":0.9909232},"labels":[],"label_agreement":null},{"id":"W2389971405","doi":"","title":"Threshold for Matching-covered Graphs","year":2014,"lang":"en","type":"article","venue":"Gongcheng shuxue xuebao","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Thompson Rivers University","funders":"","keywords":"Combinatorics; Bipartite graph; Mathematics; Matching (statistics); Chordal graph; Indifference graph; Discrete mathematics; Graph; Cograph; 1-planar graph; Statistics","score_opus":0.02831606438008274,"score_gpt":0.2891979859743229,"score_spread":0.2608819215942402,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2389971405","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.923208,0.00016105412,0.031595595,0.00025877022,0.0014542689,0.00078498677,0.000056116674,0.00042900708,0.04205222],"genre_scores_gemma":[0.97797763,0.000008311475,0.01917279,0.0005088182,0.00036041116,0.00007444778,0.0000140481725,0.00007966233,0.0018038843],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99838394,0.000068722715,0.00038653958,0.00040190783,0.0002572059,0.0005016817],"domain_scores_gemma":[0.9980811,0.0007989563,0.0001575109,0.0007529915,0.000088106375,0.000121344216],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00083422137,0.0002899194,0.00039858243,0.00012614012,0.0004397662,0.0000798121,0.00046909682,0.00019541898,0.00009640132],"category_scores_gemma":[0.0004173414,0.00023908723,0.00030898894,0.00015880859,0.00010833894,0.00015091225,0.00012672013,0.00024790908,0.000015828069],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005680242,0.00004316583,0.00038441934,0.00015551159,0.00007186974,0.0000010845919,0.0009815183,0.000015108755,0.00048025104,0.9896952,0.006427557,0.00168752],"study_design_scores_gemma":[0.000835253,0.00008209049,0.00040403614,0.00004228955,0.00006842141,0.000009610512,0.00009822006,0.00039666044,0.0015650752,0.9795418,0.016627511,0.00032903184],"about_ca_topic_score_codex":0.000013929094,"about_ca_topic_score_gemma":0.000021562544,"teacher_disagreement_score":0.054769646,"about_ca_system_score_codex":0.000033653057,"about_ca_system_score_gemma":0.0000213292,"threshold_uncertainty_score":0.97496945},"labels":[],"label_agreement":null},{"id":"W2396539498","doi":"","title":"Asymptotic upper bounds for K 1, m, k complete graph Ramsey Numbers.","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Ramsey's theorem; Combinatorics; Graph; Discrete mathematics","score_opus":0.02442332463205251,"score_gpt":0.27251566112010167,"score_spread":0.24809233648804915,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2396539498","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98228455,0.00009969656,0.0002757435,0.00032508586,0.0037787007,0.0010183384,0.000021748692,0.0002138698,0.011982271],"genre_scores_gemma":[0.993295,0.000008360003,0.005023559,0.0004142348,0.000037061513,0.00016945218,0.000015039796,0.000068646834,0.00096862705],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99839455,0.000081866245,0.0003912421,0.0003406664,0.00027476271,0.0005169019],"domain_scores_gemma":[0.9980789,0.0007573173,0.00015095128,0.0006545013,0.00020353941,0.00015478392],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031900435,0.00027942998,0.0003964604,0.00010607527,0.0004666494,0.00012091591,0.00045612044,0.00017423778,0.00043763654],"category_scores_gemma":[0.0002842189,0.00023676129,0.0002721618,0.00019783681,0.00018426611,0.00020154375,0.00013698745,0.00020859756,0.00007930868],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013939202,0.00007727805,0.0018796221,0.00007425507,0.000102216865,0.0000011542716,0.00048375566,3.633285e-7,0.00013750776,0.95795894,0.03893068,0.00034031319],"study_design_scores_gemma":[0.0012597784,0.00011261345,0.0022196681,0.000028281298,0.000059322912,0.000009805982,0.00011744794,0.00010530283,0.00018250103,0.988961,0.0066234586,0.00032081734],"about_ca_topic_score_codex":0.000037748825,"about_ca_topic_score_gemma":0.0000031311188,"teacher_disagreement_score":0.03230722,"about_ca_system_score_codex":0.000044492568,"about_ca_system_score_gemma":0.000024913537,"threshold_uncertainty_score":0.96548456},"labels":[],"label_agreement":null},{"id":"W2396731731","doi":"","title":"P r -free colorings of Sierpinski-like graphs.","year":2012,"lang":"de","type":"article","venue":"Ars Combinatoria","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Sierpinski triangle; Combinatorics; Mathematical analysis; Fractal","score_opus":0.0177325541123651,"score_gpt":0.25510739386005626,"score_spread":0.23737483974769116,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2396731731","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95110637,0.0096406145,0.0000057698808,0.00008500795,0.021071631,0.000507807,0.00010372806,0.00010472928,0.017374316],"genre_scores_gemma":[0.99758226,0.00054659136,0.00087659265,0.00014847424,0.00007754702,0.000022067352,0.000010404932,0.00010246697,0.0006336001],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9967757,0.00025679206,0.0009025054,0.0003686819,0.00070982846,0.000986511],"domain_scores_gemma":[0.9961133,0.000808236,0.00061873347,0.0018596197,0.00021881783,0.00038126702],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011334551,0.00051104167,0.00086496025,0.00025634395,0.00035257085,0.000038075872,0.0011873124,0.00047370497,0.0003664448],"category_scores_gemma":[0.00070423295,0.00048212483,0.00045397118,0.00059041864,0.00053874747,0.00032085594,0.0008927227,0.0005649231,0.000069486494],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000090087466,0.0006324614,0.0136574935,0.0004950618,0.00054443756,0.0000061779187,0.0044890638,3.3756723e-7,0.00017731932,0.9625736,0.017121883,0.00021210779],"study_design_scores_gemma":[0.001835904,0.00024087186,0.0045388406,0.00016728701,0.0005161906,0.000008121664,0.0003242477,0.000007853145,0.0027841204,0.96751106,0.021556782,0.0005087433],"about_ca_topic_score_codex":0.000021023869,"about_ca_topic_score_gemma":0.0000010592614,"teacher_disagreement_score":0.04647586,"about_ca_system_score_codex":0.000083718915,"about_ca_system_score_gemma":0.00006532214,"threshold_uncertainty_score":0.9997631},"labels":[],"label_agreement":null},{"id":"W2397650992","doi":"","title":"A note on the independence number of strong products of odd cycles.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Independence (probability theory); Independence number; Combinatorics; Statistics","score_opus":0.028981487079609805,"score_gpt":0.30218417687945553,"score_spread":0.27320268979984574,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2397650992","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9842919,0.000050868086,0.0000075408147,0.000088584995,0.0011577365,0.00020699261,0.0000058279516,0.00001804812,0.014172467],"genre_scores_gemma":[0.99929833,0.000005307582,0.00050996145,0.000028938442,0.000021570817,0.000006975773,5.4264484e-7,0.000018538214,0.00010984214],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988783,0.00011723584,0.00026782067,0.00012351474,0.00038627902,0.0002268594],"domain_scores_gemma":[0.99841315,0.00057290896,0.0002298961,0.00061986514,0.00012254622,0.000041632822],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000730268,0.00012563467,0.00022172407,0.000031015537,0.00008238338,0.0000051778256,0.00033182072,0.000089446185,0.00009063569],"category_scores_gemma":[0.00067497225,0.00007959812,0.000069052236,0.00016628196,0.00016087567,0.00008828636,0.00012720299,0.00022654833,0.000008282275],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023057513,0.00015072664,0.009766396,0.000069453155,0.000034218196,3.9227413e-7,0.0017251614,4.126923e-7,0.00034269848,0.98697037,0.0006860743,0.0002310684],"study_design_scores_gemma":[0.00024688704,0.000035029156,0.0061714444,0.00005317716,0.000028618226,0.0000042514966,0.00012522629,0.000004619457,0.029743198,0.9633471,0.00014856749,0.00009190119],"about_ca_topic_score_codex":0.0000107531905,"about_ca_topic_score_gemma":5.958221e-7,"teacher_disagreement_score":0.0294005,"about_ca_system_score_codex":0.000018124823,"about_ca_system_score_gemma":0.000026355638,"threshold_uncertainty_score":0.3245917},"labels":[],"label_agreement":null},{"id":"W2398727723","doi":"","title":"A degree sum condition for the existence of a path-factor","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Degree (music); Path (computing); Factor (programming language); Combinatorics; Computer science","score_opus":0.04822089883231394,"score_gpt":0.2995773083264982,"score_spread":0.25135640949418425,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2398727723","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99342954,0.000086288266,0.001533883,0.00010763557,0.0018293147,0.00044883994,0.000034492572,0.000045830944,0.0024842024],"genre_scores_gemma":[0.9984509,0.0000063628963,0.0012916711,0.000055540662,0.000018467917,0.00004076211,0.0000026428895,0.000016953303,0.00011672386],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99926823,0.00006585532,0.00021293589,0.00013072813,0.0001632175,0.00015900815],"domain_scores_gemma":[0.99744874,0.0018159585,0.00016038422,0.00042636282,0.00011531953,0.000033254182],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003667276,0.000106299376,0.00018748664,0.000026250751,0.000183321,0.000013349316,0.0002862109,0.00007001318,0.00003130957],"category_scores_gemma":[0.000729556,0.00006755362,0.0001150101,0.00007376621,0.00012979607,0.000048529215,0.00005469002,0.000085945634,0.0000016270099],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023217419,0.00003345308,0.00035032575,0.000069012916,0.000032253203,1.9299868e-7,0.0005738889,2.1239134e-7,0.00020985639,0.9960673,0.0012471322,0.0013931413],"study_design_scores_gemma":[0.0005921525,0.00012263806,0.0027966604,0.000029299421,0.000040523064,0.0000021617684,0.00008281007,0.0002462959,0.0017069741,0.9926514,0.001638879,0.00009022848],"about_ca_topic_score_codex":0.0000049589976,"about_ca_topic_score_gemma":0.000002521066,"teacher_disagreement_score":0.0050213626,"about_ca_system_score_codex":0.0000129250575,"about_ca_system_score_gemma":0.000013535432,"threshold_uncertainty_score":0.27547568},"labels":[],"label_agreement":null},{"id":"W2398748959","doi":"","title":"Hypercube-Anti-Ramsey Numbers of Q 5 .","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Hypercube; Combinatorics; Arithmetic","score_opus":0.017972778090773557,"score_gpt":0.26186913092722447,"score_spread":0.24389635283645092,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2398748959","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9740333,0.000052191783,0.000006727853,0.00007158941,0.0014122596,0.00021553841,0.0000022472975,0.00006719507,0.024138976],"genre_scores_gemma":[0.99799377,0.000011431126,0.0014797351,0.0000742416,0.000009472501,0.000013592832,0.0000015343097,0.000027624155,0.0003886088],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989982,0.000064171705,0.00030323758,0.00016995915,0.00023325962,0.00023113652],"domain_scores_gemma":[0.99889165,0.00028302553,0.00012814598,0.0004953476,0.00012385816,0.00007794158],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019317275,0.00014679556,0.0002961676,0.000058471647,0.00010177974,0.00001891261,0.00031232904,0.00011342491,0.00056182366],"category_scores_gemma":[0.00022198944,0.00011971074,0.00011725917,0.0001571822,0.0001313521,0.00012438107,0.00011915313,0.00015100914,0.00005636857],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000029881162,0.000068932946,0.006044197,0.00004715641,0.00005055854,0.000001692214,0.00057202915,3.5519128e-7,0.0007272183,0.9822552,0.009746972,0.000482688],"study_design_scores_gemma":[0.00039865027,0.000038821687,0.005701741,0.0000222724,0.000026174986,0.000006641595,0.00015600228,0.000018097082,0.0027624045,0.99020696,0.0005182467,0.00014399143],"about_ca_topic_score_codex":0.00007066843,"about_ca_topic_score_gemma":0.0000010707398,"teacher_disagreement_score":0.023960486,"about_ca_system_score_codex":0.000016938855,"about_ca_system_score_gemma":0.000016556432,"threshold_uncertainty_score":0.61515754},"labels":[],"label_agreement":null},{"id":"W2400370104","doi":"","title":"Upper bounds for the vertex Folkman number F v (3, 3, 3;4) and F v (3, 3, 3;5).","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Vertex (graph theory); Combinatorics; Graph","score_opus":0.016558539029801412,"score_gpt":0.2756444797928111,"score_spread":0.25908594076300967,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2400370104","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9892594,0.00021584812,0.000064867934,0.00067681976,0.0022462602,0.00070992234,0.000004949109,0.00007611933,0.00674582],"genre_scores_gemma":[0.9968311,0.000029232542,0.0010581013,0.0003611391,0.000023861177,0.00014872177,0.0000018359593,0.00003783789,0.0015081594],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99907833,0.000045008615,0.00020781814,0.00021272976,0.00016219029,0.00029394365],"domain_scores_gemma":[0.99801385,0.00126859,0.000072575596,0.00046884496,0.000098901975,0.00007722943],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029264478,0.00017337207,0.00019960408,0.000024751036,0.00054618163,0.00010691238,0.00028264447,0.00010513236,0.00033685548],"category_scores_gemma":[0.00025182107,0.000107944594,0.00010461813,0.00007748124,0.00017097378,0.00014244104,0.00014277635,0.0001447264,0.00003622323],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009132527,0.000029304256,0.0030276855,0.000028904093,0.000070227754,3.8131296e-7,0.00059920916,4.692695e-8,0.000028241235,0.94847214,0.046297446,0.0014373079],"study_design_scores_gemma":[0.0007368451,0.000042121508,0.0058194017,0.000011760832,0.000056442466,0.000011316834,0.00018718038,0.0001491331,0.0001661495,0.9821724,0.01048387,0.00016332928],"about_ca_topic_score_codex":0.000035208464,"about_ca_topic_score_gemma":0.0000026119246,"teacher_disagreement_score":0.035813577,"about_ca_system_score_codex":0.000017857677,"about_ca_system_score_gemma":0.0000136979925,"threshold_uncertainty_score":0.44018528},"labels":[],"label_agreement":null},{"id":"W2401037690","doi":"","title":"Lower Bounds on Ramsey Numbers R(6, 8), R(7, 9) and R(8, 17).","year":2010,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Ramsey's theorem; Mathematics; Combinatorics; Graph; Integer (computer science); Clique; Constructive; Order (exchange); Independent set; Discrete mathematics; Upper and lower bounds","score_opus":0.012180932634087574,"score_gpt":0.2683329110728982,"score_spread":0.2561519784388106,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2401037690","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9402092,0.000021455184,0.0000021826284,0.00014873978,0.004858516,0.00013938038,0.0000038537423,0.00010177768,0.05451487],"genre_scores_gemma":[0.99728316,0.000008608161,0.000664994,0.00032200018,0.000035594556,0.000008613907,0.0000017512666,0.00003592755,0.0016393331],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989825,0.000042038966,0.00020110581,0.00027069953,0.00023223714,0.00027141077],"domain_scores_gemma":[0.9987919,0.0003880659,0.00008583827,0.0005519927,0.000049676783,0.00013255668],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034086074,0.00019447751,0.00022311747,0.00006178016,0.00029460565,0.000064248605,0.00022815706,0.0001868015,0.00025374745],"category_scores_gemma":[0.00029433717,0.00016160577,0.000076345634,0.00010699294,0.00020653447,0.00008500724,0.00011147278,0.00048015095,0.00001963787],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000344995,0.00008034408,0.001597034,0.000015362377,0.00003187311,0.000011176713,0.00041175136,5.7268366e-8,0.0002810419,0.98200184,0.015017717,0.00051729905],"study_design_scores_gemma":[0.00067529624,0.000117838594,0.001841045,0.000015035958,0.000021735423,0.000016345375,0.000034068707,0.000008222026,0.0004986205,0.9782181,0.018346444,0.00020724372],"about_ca_topic_score_codex":0.000009789852,"about_ca_topic_score_gemma":0.000015261296,"teacher_disagreement_score":0.05707395,"about_ca_system_score_codex":0.000013945482,"about_ca_system_score_gemma":0.000017617996,"threshold_uncertainty_score":0.65900916},"labels":[],"label_agreement":null},{"id":"W2401243555","doi":"","title":"A sufficient condition for a graph to be fractional (a, b, n)-critical deleted graph.","year":2015,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Graph; Combinatorics; Discrete mathematics","score_opus":0.050684068179913,"score_gpt":0.3378844152356486,"score_spread":0.2872003470557356,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2401243555","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9865142,0.00005305562,0.0057359817,0.0012083416,0.0040874975,0.0006342594,0.00009992739,0.00015693321,0.0015097974],"genre_scores_gemma":[0.9939039,0.0000013271207,0.005004107,0.00075793103,0.00003701409,0.00014996954,0.00003256234,0.0000339484,0.00007929087],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99849,0.00008842949,0.0003157006,0.00031129172,0.00043226485,0.00036230922],"domain_scores_gemma":[0.9978516,0.0009692258,0.00007094021,0.0003413878,0.00045342743,0.00031341228],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000570246,0.0001918951,0.00025886818,0.0002020219,0.00028322465,0.000046950903,0.00022066815,0.0001392753,0.000055645356],"category_scores_gemma":[0.0019105406,0.00017575978,0.00016682292,0.00032384187,0.0001295595,0.00011487213,0.000080236816,0.00017276505,0.000009983058],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012068044,0.00022027997,0.00012675383,0.000029754325,0.000043652166,0.000004641591,0.00090066245,0.00000891833,0.000092611066,0.94941646,0.048984636,0.00005096002],"study_design_scores_gemma":[0.001205795,0.00038867953,0.00021063711,0.000019686137,0.000057048233,0.00001643981,0.00040287434,0.00013302929,0.00048367685,0.9898441,0.00700464,0.00023339032],"about_ca_topic_score_codex":0.000008191312,"about_ca_topic_score_gemma":0.0000046293467,"teacher_disagreement_score":0.041979995,"about_ca_system_score_codex":0.00006929204,"about_ca_system_score_gemma":0.00006098442,"threshold_uncertainty_score":0.71672755},"labels":[],"label_agreement":null},{"id":"W2403839750","doi":"","title":"On The First Unknown Value Of Two Functions For Convex Lattice v-Gons.","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Regular polygon; Lattice (music); Pure mathematics; Geometry; Physics","score_opus":0.020792921145311585,"score_gpt":0.27504887352015694,"score_spread":0.2542559523748454,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2403839750","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97528565,0.000029607076,0.00087108254,0.0010313119,0.0031999932,0.00050926395,0.000016948265,0.00006904041,0.018987114],"genre_scores_gemma":[0.9983448,0.0000021226517,0.0005592204,0.00042631812,0.000027093185,0.000046887963,0.000002412672,0.000026705724,0.00056443294],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99912006,0.000097827775,0.0002449407,0.00016846262,0.00017785694,0.00019085886],"domain_scores_gemma":[0.9946796,0.0044280333,0.00014313785,0.0005903199,0.00011794474,0.000040979183],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00067756925,0.00013983625,0.00022793798,0.000045384746,0.0003930066,0.000017079925,0.00030179942,0.00007142235,0.00007099689],"category_scores_gemma":[0.0009239912,0.00009077091,0.00014121138,0.00012625015,0.00014683549,0.000036069832,0.00006919339,0.00014972463,0.00001070719],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028720797,0.000078719575,0.00016849062,0.00005143822,0.0000638772,1.3512168e-7,0.0003619091,0.000008088391,0.000016702681,0.9842634,0.014839342,0.00011914569],"study_design_scores_gemma":[0.0009002588,0.00017619622,0.0002202404,0.000034590346,0.00008079711,0.0000014057027,0.00004426148,0.00062052463,0.0007410107,0.98110914,0.015960388,0.000111213485],"about_ca_topic_score_codex":0.000006150504,"about_ca_topic_score_gemma":0.000004902717,"teacher_disagreement_score":0.023059167,"about_ca_system_score_codex":0.000018020508,"about_ca_system_score_gemma":0.000015566106,"threshold_uncertainty_score":0.37015304},"labels":[],"label_agreement":null},{"id":"W2404602741","doi":"","title":"Rainbow connection numbers of line graphs.","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Rainbow; Combinatorics; Mathematics; Edge coloring; Colored; Connection (principal bundle); Discrete mathematics; Graph; Line graph; Graph power; Geometry; Physics; Optics","score_opus":0.0388968721380673,"score_gpt":0.27240514713112196,"score_spread":0.23350827499305465,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2404602741","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9713287,0.000048594815,0.000029448973,0.000012235729,0.0021212522,0.00014049937,0.000003903503,0.000079538746,0.026235862],"genre_scores_gemma":[0.9980767,0.000015548165,0.0016543184,0.000038079208,0.000006824737,0.000006617676,0.0000018716493,0.00002211115,0.00017796959],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991585,0.000071222275,0.00028050214,0.00015714337,0.00016324267,0.00016935951],"domain_scores_gemma":[0.9991239,0.00018083792,0.00016636682,0.00036865522,0.00010299604,0.00005726114],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031827026,0.00012823677,0.00023111828,0.00009067579,0.0001026859,0.000004733268,0.00019930968,0.000106968175,0.00025310606],"category_scores_gemma":[0.00021779489,0.00011035998,0.0001217937,0.00020398013,0.00013306167,0.000072886236,0.000065580774,0.00013146963,0.000004668076],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004184548,0.00010891715,0.0028648241,0.000041779727,0.00006397054,0.00000305584,0.0021478739,1.0370624e-7,0.00015534865,0.9930364,0.0011957709,0.0003400956],"study_design_scores_gemma":[0.0006114973,0.00013024759,0.001435241,0.000021225906,0.00003946584,0.0000068575264,0.00018046385,0.000008838782,0.009077483,0.9881626,0.00020000416,0.00012611096],"about_ca_topic_score_codex":0.000041499326,"about_ca_topic_score_gemma":0.0000042878078,"teacher_disagreement_score":0.026747994,"about_ca_system_score_codex":0.000013216468,"about_ca_system_score_gemma":0.0000129584305,"threshold_uncertainty_score":0.45003495},"labels":[],"label_agreement":null},{"id":"W2406090923","doi":"","title":"The Graham's pebbling conjecture for K -k1 r, s x K -k2 m, n .","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Conjecture; Combinatorics; Discrete mathematics","score_opus":0.03070349463851688,"score_gpt":0.3037449742684744,"score_spread":0.2730414796299575,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2406090923","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9792582,0.0016982832,0.00026235433,0.00048090384,0.010409337,0.0006929033,0.000010283634,0.00016356769,0.007024197],"genre_scores_gemma":[0.99756044,0.000028376173,0.0012213552,0.00014250625,0.00011514583,0.00005888106,0.0000032108082,0.00004123292,0.00082884444],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988071,0.0000808969,0.00024665965,0.00015253513,0.00020241378,0.00051043305],"domain_scores_gemma":[0.9974326,0.0017573357,0.00012655811,0.00049442897,0.000081180086,0.000107918786],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000886269,0.00018322318,0.00020510679,0.000035979676,0.0009136782,0.000060178005,0.00036209886,0.00013134303,0.000030823456],"category_scores_gemma":[0.00066327973,0.000113284674,0.00016304103,0.000119409386,0.00011493114,0.00011738941,0.00011014195,0.00021247762,0.000008641677],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026838094,0.000038056907,0.00082821614,0.000030056191,0.000058534915,4.0637516e-7,0.00097516575,2.4892782e-7,0.000040535087,0.98362994,0.013413933,0.00095807255],"study_design_scores_gemma":[0.0006262111,0.000046482022,0.00030223542,0.000012242202,0.000047905316,0.000006747,0.00019598789,0.000021071217,0.0008552411,0.9465809,0.05114219,0.0001628288],"about_ca_topic_score_codex":0.0000024906585,"about_ca_topic_score_gemma":0.0000015222943,"teacher_disagreement_score":0.037728257,"about_ca_system_score_codex":0.00003057924,"about_ca_system_score_gemma":0.000018715382,"threshold_uncertainty_score":0.7027367},"labels":[],"label_agreement":null},{"id":"W2406123407","doi":"","title":"Generalization of the Erdos-Gallai Inequality.","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Generalization; Inequality; Combinatorics; Mathematical analysis","score_opus":0.04687713431653109,"score_gpt":0.275436888416087,"score_spread":0.2285597540995559,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2406123407","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9841061,0.000037940426,0.00006004188,0.000024257086,0.001578153,0.00013679314,0.0000031940465,0.000033464494,0.014020043],"genre_scores_gemma":[0.99881357,0.000005815275,0.00085259986,0.00007851253,0.00000783702,0.000004894908,8.724039e-7,0.00001577269,0.00022013277],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991782,0.00013983744,0.00025792047,0.00011140203,0.00019025408,0.00012239892],"domain_scores_gemma":[0.99911535,0.00008318646,0.00016826783,0.000516013,0.00008912328,0.000028046503],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030203196,0.00009505219,0.00014952736,0.000031193795,0.00012132913,0.000005250461,0.00033371514,0.00007500539,0.00013620897],"category_scores_gemma":[0.00021406317,0.000061159604,0.000089581874,0.00017261987,0.00009497889,0.000050515806,0.0001483115,0.00008733856,0.000002141883],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008315441,0.000056112724,0.013104193,0.00003081147,0.00002619182,4.0704526e-7,0.0023191806,2.9086289e-7,0.00022734908,0.98320585,0.00092274963,0.000098567005],"study_design_scores_gemma":[0.0002566451,0.000025679228,0.0141707575,0.00001586497,0.000025768177,0.0000015951256,0.00004810144,0.000015918395,0.009742886,0.97540617,0.00021185413,0.00007873217],"about_ca_topic_score_codex":0.00002871104,"about_ca_topic_score_gemma":0.0000046301634,"teacher_disagreement_score":0.01470745,"about_ca_system_score_codex":0.000013078204,"about_ca_system_score_gemma":0.000016821594,"threshold_uncertainty_score":0.24940164},"labels":[],"label_agreement":null},{"id":"W2406207104","doi":"","title":"The number of independent sets in bicyclic graphs.","year":2013,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Discrete mathematics","score_opus":0.014718971238258537,"score_gpt":0.2827254303497995,"score_spread":0.268006459111541,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2406207104","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98574156,0.000074559866,5.7589745e-7,0.00010546056,0.0010325288,0.0002506686,0.0000014020812,0.000023956123,0.012769319],"genre_scores_gemma":[0.9994498,0.00003524225,0.000175696,0.000039900588,0.0000029596024,0.000034753462,6.3484583e-7,0.000017930792,0.00024310611],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988998,0.0001174178,0.00034211297,0.00014222591,0.00025685475,0.00024156473],"domain_scores_gemma":[0.998683,0.00059346773,0.0001337193,0.000472298,0.00006990257,0.000047610945],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039594842,0.00012424297,0.000197781,0.000055064313,0.00013328982,0.00002639845,0.00037232926,0.00009790001,0.0001869419],"category_scores_gemma":[0.00020039573,0.000079584526,0.00008620308,0.00022850114,0.0001343047,0.0000848318,0.00014325176,0.0002110631,0.000034951536],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006038308,0.000056491666,0.044273473,0.000017056345,0.000025925456,0.000001707443,0.00053070835,1.085387e-7,0.00005026677,0.95203775,0.0020986656,0.0009018084],"study_design_scores_gemma":[0.00045821586,0.000014677032,0.043844935,0.000018845272,0.0000076646875,0.0000052256905,0.00012593303,0.000013440485,0.00041296732,0.9547954,0.00020883307,0.000093834606],"about_ca_topic_score_codex":0.0000911937,"about_ca_topic_score_gemma":0.000013174822,"teacher_disagreement_score":0.013708248,"about_ca_system_score_codex":0.000020597798,"about_ca_system_score_gemma":0.0000147465935,"threshold_uncertainty_score":0.3245363},"labels":[],"label_agreement":null},{"id":"W2408117154","doi":"","title":"A Note On Off-Diagonal Small On-Line Ramsey Numbers For Paths.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Diagonal; Mathematics; Line (geometry); Combinatorics; Ramsey's theorem; Arithmetic; Geometry","score_opus":0.04508002687629247,"score_gpt":0.31045422223413716,"score_spread":0.2653741953578447,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2408117154","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98271185,0.00009250749,0.0001282812,0.00021535865,0.0062365043,0.0005540788,0.00004683023,0.00013261253,0.009881969],"genre_scores_gemma":[0.9957934,0.000011822647,0.0025617483,0.0007614905,0.00015089667,0.0000664872,0.000015171584,0.00006561726,0.00057337974],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99856395,0.00008232443,0.00030220594,0.000254203,0.000268035,0.00052929803],"domain_scores_gemma":[0.99763435,0.0014187095,0.00014592904,0.0005352332,0.000078983794,0.00018677776],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000610678,0.00026796342,0.0003227257,0.000080350175,0.00024714082,0.000025223731,0.00029817974,0.00019076392,0.00007188233],"category_scores_gemma":[0.0006563618,0.0002191473,0.00021289666,0.000113783084,0.00007583541,0.000071737995,0.000082202525,0.00027913327,0.000042653384],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018098581,0.0003728036,0.0004635034,0.000049442413,0.00005816447,0.0000025026054,0.0009329571,0.000003902935,0.000035915902,0.98661524,0.007930371,0.0033542102],"study_design_scores_gemma":[0.0016161855,0.00037713573,0.0003998633,0.000050255316,0.00005010579,0.0000050817107,0.000042916537,0.000111668334,0.0017792506,0.9808102,0.014471534,0.00028577834],"about_ca_topic_score_codex":0.000003975522,"about_ca_topic_score_gemma":0.0000023391353,"teacher_disagreement_score":0.013081528,"about_ca_system_score_codex":0.000070134556,"about_ca_system_score_gemma":0.000027060081,"threshold_uncertainty_score":0.8936568},"labels":[],"label_agreement":null},{"id":"W2408529511","doi":"","title":"A survey of some open questions in reconstruction numbers.","year":2010,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":20,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Mathematics education; Statistics","score_opus":0.03189819742781417,"score_gpt":0.3159702688083731,"score_spread":0.2840720713805589,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2408529511","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9912349,0.00001749811,0.0000022106688,0.000033297718,0.0030854982,0.0002292248,0.000014405869,0.000023017528,0.0053599346],"genre_scores_gemma":[0.99829876,0.0000079196825,0.0015394046,0.000017346549,0.000006381283,0.000013115082,0.000004200738,0.000015288244,0.00009755414],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99907875,0.00017292664,0.00032113597,0.00016653146,0.00011383664,0.00014680898],"domain_scores_gemma":[0.99882096,0.00045555452,0.00014758586,0.0004204317,0.0001092562,0.00004618506],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010823822,0.00009998293,0.00024802954,0.00009421952,0.000085740816,0.000025982563,0.00041263876,0.0001309582,0.00011053168],"category_scores_gemma":[0.0010352348,0.00009233588,0.000037374546,0.00024589608,0.00012870373,0.00023099985,0.00018746518,0.00031100176,0.0000035386686],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017067667,0.0000784609,0.066643834,0.000014306932,0.00001418304,0.0000012293875,0.00025819772,1.6811677e-7,0.00027596258,0.9312342,0.00032759944,0.0011347886],"study_design_scores_gemma":[0.00052863796,0.00002338933,0.12897749,0.000025230402,0.000006864499,0.000009020648,0.000029200251,0.000019370204,0.0005339198,0.8697037,0.000048666763,0.000094515875],"about_ca_topic_score_codex":0.0012121123,"about_ca_topic_score_gemma":0.0014172537,"teacher_disagreement_score":0.06233366,"about_ca_system_score_codex":0.000017489434,"about_ca_system_score_gemma":0.000053177755,"threshold_uncertainty_score":0.3765348},"labels":[],"label_agreement":null},{"id":"W2408648542","doi":"","title":"The First Nontrivial Hales-Jewett Number is Four.","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.016063517316452166,"score_gpt":0.26055557302704396,"score_spread":0.2444920557105918,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2408648542","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9256414,0.00007440436,0.000082776125,0.0019327068,0.0066219633,0.00031320716,0.0000066853095,0.00016709835,0.065159716],"genre_scores_gemma":[0.9974315,0.0000208688,0.00032474534,0.00058309856,0.000091440874,0.000019067407,8.8631515e-7,0.000040085746,0.0014882981],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986295,0.000111331705,0.0002908594,0.00024082864,0.00034189495,0.00038558972],"domain_scores_gemma":[0.99749166,0.0013920749,0.00013734808,0.0007983398,0.000094412586,0.0000861634],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007203197,0.00020584307,0.00024260806,0.000023600345,0.0010007009,0.000093824805,0.00056155375,0.00013552562,0.00013866356],"category_scores_gemma":[0.0005706203,0.00013365441,0.00016859896,0.00013539816,0.00017623194,0.00007361398,0.00019982476,0.00025678924,0.00011113105],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018307175,0.000029363679,0.0035438703,0.000017190117,0.000047687787,0.000002751863,0.000500707,1.2932377e-7,0.0000026936411,0.9136855,0.08104602,0.0011057964],"study_design_scores_gemma":[0.00063612714,0.000031464195,0.0014910224,0.000016546646,0.000029985133,0.00001266782,0.00002138472,0.000082168124,0.00020523503,0.855276,0.14202979,0.00016762393],"about_ca_topic_score_codex":0.000012729566,"about_ca_topic_score_gemma":0.000021664317,"teacher_disagreement_score":0.07179007,"about_ca_system_score_codex":0.000033579247,"about_ca_system_score_gemma":0.000015971395,"threshold_uncertainty_score":0.76966834},"labels":[],"label_agreement":null},{"id":"W2466652589","doi":"10.1002/jgt.22511","title":"A variant of the Erdős‐Sós conjecture","year":2019,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Australian Research Council; Agence Nationale de la Recherche","keywords":"Conjecture; Degree (music); Graph; Tree (set theory); Collatz conjecture; Lonely runner conjecture","score_opus":0.010660904886134916,"score_gpt":0.2508092513133372,"score_spread":0.24014834642720229,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2466652589","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9873172,0.0006465527,0.00088425906,0.00018802936,0.001854331,0.00019699911,0.000009964951,0.000009998558,0.008892635],"genre_scores_gemma":[0.99784064,0.000035235615,0.0011819334,0.0002340292,0.00014418025,6.0768866e-7,1.0510413e-7,0.00002344148,0.0005398143],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982424,0.00042850827,0.0006126216,0.000103548555,0.00042424852,0.00018869733],"domain_scores_gemma":[0.9973278,0.0009565399,0.0009325326,0.000540582,0.00018079745,0.000061755665],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019164394,0.00016280275,0.0004433923,0.00016828146,0.000104331215,0.000014435062,0.0007006448,0.00012919813,0.00043773316],"category_scores_gemma":[0.0004281109,0.00008189696,0.00059162814,0.00026130912,0.00022254832,0.00009212339,0.00012246342,0.0004872372,0.0000022707677],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021081943,0.000059230533,0.0014692835,0.00008272803,0.0002627867,0.000012824539,0.0016625316,0.000015191962,0.0017506934,0.99278265,0.0010876477,0.0006036146],"study_design_scores_gemma":[0.0006859191,0.00016246088,0.0024127702,0.00015629042,0.00013678978,0.00041669898,0.00042377203,0.0000036787949,0.002558311,0.9917917,0.001146975,0.00010458797],"about_ca_topic_score_codex":9.231763e-7,"about_ca_topic_score_gemma":8.622593e-7,"teacher_disagreement_score":0.010523423,"about_ca_system_score_codex":0.000016774951,"about_ca_system_score_gemma":0.00006977837,"threshold_uncertainty_score":0.47928712},"labels":[],"label_agreement":null},{"id":"W2473022082","doi":"10.48550/arxiv.1606.09343","title":"A Variant of the Erdős-Sós Conjecture","year":2016,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Conjecture; Combinatorics; Mathematics; Degree (music); Graph; Tree (set theory); Discrete mathematics; Physics","score_opus":0.075099871527848,"score_gpt":0.19889458540913812,"score_spread":0.12379471388129012,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2473022082","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94407165,0.00008608262,0.02388124,0.00018251743,0.0018580654,0.00064847904,0.00022541822,0.00011876853,0.028927784],"genre_scores_gemma":[0.99599266,0.00004541957,0.0002153595,0.00006197808,0.00011853232,5.2207196e-7,0.0000018352157,0.000031186242,0.0035325242],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986327,0.0002339047,0.00024226705,0.00052382896,0.00010642297,0.0002608697],"domain_scores_gemma":[0.9973836,0.0003937318,0.00046630102,0.0015625884,0.00011895095,0.000074808486],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002610757,0.00030648464,0.00043670458,0.00010761972,0.00018985,0.00001398779,0.001269426,0.00044875583,0.0002287368],"category_scores_gemma":[0.00018282064,0.00018837363,0.00046571207,0.00020403806,0.000376214,0.000046101726,0.0018636028,0.0005669396,0.000005577319],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000046264264,0.00003650164,0.0009172778,0.00018768807,0.00022550662,0.000058367852,0.00040991048,0.0004227154,0.000049133854,0.9966597,0.0009175424,0.00006937228],"study_design_scores_gemma":[0.00042324085,0.000019266352,0.00059799326,0.0002454478,0.0002481519,0.000011013096,0.00006276537,0.00043233306,0.00042695415,0.9965837,0.00069115823,0.00025795758],"about_ca_topic_score_codex":0.000020093043,"about_ca_topic_score_gemma":0.000016120226,"teacher_disagreement_score":0.051921,"about_ca_system_score_codex":0.00008115382,"about_ca_system_score_gemma":0.00013020007,"threshold_uncertainty_score":0.76816535},"labels":[],"label_agreement":null},{"id":"W2499901585","doi":"10.1017/fms.2019.47","title":"A DISTRIBUTION ON TRIPLES WITH MAXIMUM ENTROPY MARGINAL","year":2019,"lang":"en","type":"article","venue":"Forum of Mathematics Sigma","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":23,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Conjecture; Mathematics; Combinatorics; Distribution (mathematics); Principle of maximum entropy; Entropy (arrow of time); Probability distribution; Discrete mathematics; Statistics; Physics; Mathematical analysis; Quantum mechanics","score_opus":0.013347277764581687,"score_gpt":0.24594093065354117,"score_spread":0.23259365288895947,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2499901585","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9733129,0.00003145089,0.015587002,0.00021063082,0.00019418521,0.0006317641,0.000115072915,0.00008119672,0.009835794],"genre_scores_gemma":[0.98172724,0.0000069122775,0.017287105,0.000041829106,0.000036213314,0.000015543372,0.000024595973,0.000040347393,0.00082023814],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984809,0.0000400759,0.0004193835,0.00022683904,0.0004934355,0.00033935532],"domain_scores_gemma":[0.99831724,0.000522197,0.00035087086,0.00065171113,0.000091159236,0.00006681833],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003228783,0.00024261387,0.0004598493,0.000079762445,0.0001006049,0.000021592381,0.00029953322,0.00010819494,0.0003888695],"category_scores_gemma":[0.00016806032,0.00016091493,0.00014760315,0.0001526125,0.00010543731,0.000075373166,0.00008686556,0.00016957079,0.000034235643],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001601882,0.00028858383,0.0010032626,0.0004900717,0.000088132154,0.0000039974652,0.0005678247,0.000017945962,0.00036972502,0.99488944,0.0017750992,0.00034570906],"study_design_scores_gemma":[0.0012120878,0.0007588781,0.00028297032,0.00033769637,0.00007383389,0.00003202992,0.0010511945,0.00058429065,0.007081803,0.9864299,0.0018828742,0.000272398],"about_ca_topic_score_codex":0.0000021438861,"about_ca_topic_score_gemma":0.0000024872127,"teacher_disagreement_score":0.0090155555,"about_ca_system_score_codex":0.000040608615,"about_ca_system_score_gemma":0.000026354068,"threshold_uncertainty_score":0.65619206},"labels":[],"label_agreement":null},{"id":"W2506307253","doi":"10.37236/6410","title":"Majority Colourings of Digraphs","year":2017,"lang":"en","type":"preprint","venue":"The Electronic Journal of Combinatorics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Kootenay Association for Science & Technology","funders":"","keywords":"Digraph; Conjecture; Combinatorics; Vertex (graph theory); Mathematics; Discrete mathematics; Graph","score_opus":0.028599359921106047,"score_gpt":0.3161045587006525,"score_spread":0.28750519877954644,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2506307253","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98101324,0.00902896,0.0018046072,0.0004770928,0.0031464833,0.00035082377,0.00000935432,0.000022258633,0.004147167],"genre_scores_gemma":[0.99635446,0.002892656,0.00007245255,0.000017526258,0.00023641852,0.0000033280198,7.224437e-7,0.000043600478,0.00037882477],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971998,0.00028318094,0.00097465824,0.00017855184,0.00079184066,0.0005720229],"domain_scores_gemma":[0.99371386,0.0007082327,0.0037133526,0.00129038,0.0004893087,0.00008487454],"candidate_categories":["research_integrity"],"consensus_categories":[],"category_scores_codex":[0.003357435,0.0003457432,0.0009935565,0.00020112682,0.00038884627,0.00006348391,0.0027511583,0.00036627214,0.0000136083745],"category_scores_gemma":[0.0008891611,0.0002198644,0.0007170337,0.00011345032,0.0003470752,0.00008255956,0.00087526935,0.0032918977,4.6132376e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000115391886,0.00014214763,0.00036935534,0.00021789358,0.0006156178,0.000010022452,0.00093700987,0.0000073079987,0.000022680142,0.99613136,0.0011551861,0.00027600484],"study_design_scores_gemma":[0.0006381719,0.00034502454,0.00032699434,0.0002274692,0.00047027195,0.00012496115,0.000075382,0.000011568476,0.0011458704,0.9944017,0.002023667,0.00020890974],"about_ca_topic_score_codex":0.000013511442,"about_ca_topic_score_gemma":0.000005262445,"teacher_disagreement_score":0.015341218,"about_ca_system_score_codex":0.00024241248,"about_ca_system_score_gemma":0.0007700084,"threshold_uncertainty_score":0.9990075},"labels":[],"label_agreement":null},{"id":"W2513477623","doi":"10.1002/jgt.22233","title":"Orientations of graphs with uncountable chromatic number","year":2017,"lang":"en","type":"preprint","venue":"Journal of Graph Theory","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Austrian Science Fund; Pacific Institute for the Mathematical Sciences","keywords":"Uncountable set; Combinatorics; Mathematics; Countable set; Discrete mathematics; Conjecture; Digraph; Graph; Chromatic scale","score_opus":0.0312692883517813,"score_gpt":0.3294263890046287,"score_spread":0.2981571006528474,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2513477623","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9706929,0.0008066751,0.0060118916,0.00005425162,0.0022838411,0.00039747043,0.00008603638,0.00002970521,0.01963728],"genre_scores_gemma":[0.98018754,0.0003239609,0.018672958,0.000039730414,0.00022730006,0.000010181531,0.0000047549784,0.00007508097,0.00045849432],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970476,0.00038109595,0.0012032663,0.00024676084,0.0008241304,0.00029712103],"domain_scores_gemma":[0.99261516,0.00094165065,0.004230245,0.0012421857,0.0008252616,0.00014548408],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0024453306,0.00042275494,0.0011850711,0.0004875341,0.0003796822,0.00009164385,0.0012290315,0.00032338288,0.00034658978],"category_scores_gemma":[0.0005671202,0.00027841685,0.00073808036,0.00018057825,0.00077681715,0.00023768863,0.00034622065,0.0011169234,0.0000019289955],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004362531,0.00021653096,0.0037895974,0.0010540508,0.0016661636,0.00006279186,0.0034155995,0.000073226955,0.00007153926,0.98649615,0.0022544803,0.0004636141],"study_design_scores_gemma":[0.00082453445,0.0001747021,0.001301554,0.0015046337,0.00096550735,0.0003261246,0.00070903695,0.0000037871932,0.00052841794,0.99315864,0.00019770327,0.00030535835],"about_ca_topic_score_codex":0.000012599223,"about_ca_topic_score_gemma":0.0000120191135,"teacher_disagreement_score":0.019178785,"about_ca_system_score_codex":0.00004998686,"about_ca_system_score_gemma":0.00030925625,"threshold_uncertainty_score":0.9999668},"labels":[],"label_agreement":null},{"id":"W2513820396","doi":"10.1016/j.disc.2018.04.008","title":"Size-Ramsey numbers of cycles versus a path","year":2018,"lang":"en","type":"preprint","venue":"Discrete Mathematics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada; Simons Foundation","keywords":"Combinatorics; Ramsey's theorem; Graph; Mathematics; Integer (computer science); Path (computing); Discrete mathematics; Computer science","score_opus":0.046524698944634665,"score_gpt":0.335014328802336,"score_spread":0.2884896298577013,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2513820396","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.91098297,0.00023755217,0.0053332527,0.00007812227,0.0029191894,0.0011904462,0.000563622,0.0003308424,0.078363985],"genre_scores_gemma":[0.7929088,0.000108117114,0.20552404,0.000035064797,0.0005006915,0.0000674718,0.000042429925,0.00020921775,0.0006041793],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9966683,0.00014276923,0.0012473873,0.0005959521,0.0008253579,0.00052023854],"domain_scores_gemma":[0.9939806,0.0021631464,0.0013105783,0.0021182548,0.00026513226,0.00016231714],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008131896,0.0007132383,0.0013289102,0.00013164805,0.0001926995,0.000079639554,0.0012112987,0.0007002697,0.0004958142],"category_scores_gemma":[0.0024189942,0.0005706811,0.000704732,0.00016697627,0.000643598,0.000064621745,0.0018844763,0.0007233231,0.000022463048],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002340912,0.00030828096,0.00012545999,0.007644574,0.0012157877,0.000028104008,0.020550584,0.000016061605,0.000087843655,0.96234024,0.007028849,0.0004201503],"study_design_scores_gemma":[0.00076354446,0.00011935928,0.00004934942,0.0010575907,0.0005353634,0.000010972195,0.0014177698,0.0006885511,0.0008583439,0.9935822,0.00026846505,0.00064848416],"about_ca_topic_score_codex":0.000019669518,"about_ca_topic_score_gemma":0.000011324397,"teacher_disagreement_score":0.2001908,"about_ca_system_score_codex":0.000075398646,"about_ca_system_score_gemma":0.000112570684,"threshold_uncertainty_score":0.99967444},"labels":[],"label_agreement":null},{"id":"W2517245760","doi":"10.1017/s0963548318000202","title":"The Probability of Non-Existence of a Subgraph in a Moderately Sparse Random Graph","year":2018,"lang":"en","type":"preprint","venue":"Combinatorics Probability Computing","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of Waterloo; Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Combinatorics; Mathematics; Random graph; Random regular graph; Exponential random graph models; Graph; Discrete mathematics; Exponential function; Degree (music); Line graph; Pathwidth; Physics","score_opus":0.058814826800336964,"score_gpt":0.3086478649535586,"score_spread":0.24983303815322166,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2517245760","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98720896,0.00049520837,0.0060190344,0.00005155069,0.0016294643,0.0031148102,0.000027025922,0.000084704945,0.0013692338],"genre_scores_gemma":[0.98646957,0.000056456956,0.0132842325,0.000008042868,0.00005705794,0.000059581864,0.0000056526337,0.000049899012,0.000009493029],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99353224,0.0011136822,0.0026515867,0.0011278362,0.000856964,0.0007176803],"domain_scores_gemma":[0.9897258,0.0038948474,0.0020207667,0.0028150878,0.001419672,0.00012380171],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.008967,0.00067342556,0.00178711,0.00027846763,0.0004717018,0.000072137256,0.0020326008,0.00062589935,0.0000046068794],"category_scores_gemma":[0.004261957,0.0005066519,0.0007451496,0.0010066911,0.0019154077,0.00007352141,0.003197462,0.0014776688,3.7261012e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009590078,0.0015548399,0.041435257,0.008970797,0.0002910162,0.0000055920973,0.008499239,0.0016585253,0.000049984526,0.93449557,0.00008720044,0.0019929453],"study_design_scores_gemma":[0.0015401269,0.00016339433,0.007069183,0.0008524246,0.000081588994,0.0000037576972,0.000090213696,0.013537806,0.00093362073,0.9752927,0.000006170996,0.00042902847],"about_ca_topic_score_codex":0.00013377413,"about_ca_topic_score_gemma":0.00006783741,"teacher_disagreement_score":0.04079709,"about_ca_system_score_codex":0.00022547929,"about_ca_system_score_gemma":0.00041642573,"threshold_uncertainty_score":0.9997385},"labels":[],"label_agreement":null},{"id":"W2522092831","doi":"10.1017/s001309151500053x","title":"On Systems of Complexity One in the Primes","year":2016,"lang":"en","type":"preprint","venue":"Proceedings of the Edinburgh Mathematical Society","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"Agence Nationale de la Recherche","keywords":"Mathematics; Integer (computer science); Invariant (physics); Discrete mathematics; Matrix (chemical analysis); Translation (biology); System of linear equations; Combinatorics; Work (physics); Physics; Mathematical analysis; Computer science; Mathematical physics; Quantum mechanics","score_opus":0.06903070145365937,"score_gpt":0.3057919835403397,"score_spread":0.23676128208668035,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2522092831","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95569855,0.00018961859,0.00048258065,0.0015497998,0.0008127642,0.0024858352,0.000094856965,0.00007555111,0.03861042],"genre_scores_gemma":[0.99378115,0.000037419733,0.005175885,0.0000960984,0.0003571879,0.00012951197,8.6087766e-7,0.0000456343,0.00037627152],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9964317,0.000053444353,0.0012548134,0.00044817541,0.0013880397,0.0004238432],"domain_scores_gemma":[0.99514925,0.0023602853,0.0013658755,0.000707659,0.00035672964,0.000060174058],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003343173,0.0004619428,0.001224749,0.000058772363,0.00018783975,0.000060393922,0.0023576554,0.000552669,0.0001052913],"category_scores_gemma":[0.0020034758,0.00021031733,0.0010088247,0.00025622087,0.00115259,0.000063661675,0.001661611,0.0011159537,8.484103e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031194693,0.000414381,0.00027199707,0.0038328615,0.00022141039,9.565648e-8,0.0077282307,0.000001609903,0.00029898155,0.9707466,0.016423354,0.000029297626],"study_design_scores_gemma":[0.00033971807,0.0000545922,0.00026527527,0.0037458623,0.00018228093,0.0000049528476,0.0013968023,0.00030406858,0.001669689,0.99175245,0.000042225165,0.00024207603],"about_ca_topic_score_codex":0.000007508744,"about_ca_topic_score_gemma":1.960591e-7,"teacher_disagreement_score":0.03823415,"about_ca_system_score_codex":0.00010579553,"about_ca_system_score_gemma":0.000054105265,"threshold_uncertainty_score":0.8576492},"labels":[],"label_agreement":null},{"id":"W2523214650","doi":"10.37236/6460","title":"A Note on Intersecting Hypergraphs with Large Cover Number","year":2017,"lang":"en","type":"preprint","venue":"The Electronic Journal of Combinatorics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Conjecture; Cover (algebra); Combinatorics; Mathematics; Value (mathematics); Discrete mathematics; Statistics; Engineering","score_opus":0.017122847585079985,"score_gpt":0.3065194671261294,"score_spread":0.2893966195410494,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2523214650","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9615959,0.0011913708,0.012050175,0.00064624933,0.0038309982,0.00046440033,0.000011922471,0.000051124305,0.020157864],"genre_scores_gemma":[0.9981462,0.00051379047,0.00007533407,0.00012544515,0.00037272408,0.0000052898286,0.0000011246697,0.00008581064,0.0006743317],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99720913,0.00029465114,0.00062452565,0.0002518476,0.00082699204,0.00079287257],"domain_scores_gemma":[0.9952865,0.0008371988,0.0021562104,0.0012045288,0.000421353,0.00009416603],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0025473505,0.00045630476,0.000791434,0.00014925694,0.0006636366,0.00015222849,0.0017788268,0.00031609496,0.0000457318],"category_scores_gemma":[0.00059810246,0.00025369172,0.00047954387,0.00011706558,0.00015217549,0.00009888586,0.00057426136,0.0048063938,0.0000061247674],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004161077,0.00017664528,0.0003777748,0.000096672215,0.000656258,0.00004346156,0.0017075568,0.000043733216,0.0000051259713,0.99500483,0.0012863966,0.00018546339],"study_design_scores_gemma":[0.001306089,0.0005545062,0.00008392969,0.00052658806,0.00038991854,0.00047377532,0.00013898815,0.000051848794,0.00021466937,0.992121,0.003824714,0.00031401194],"about_ca_topic_score_codex":0.0000049278483,"about_ca_topic_score_gemma":0.000008799936,"teacher_disagreement_score":0.036550254,"about_ca_system_score_codex":0.00043759434,"about_ca_system_score_gemma":0.0005988085,"threshold_uncertainty_score":0.99999154},"labels":[],"label_agreement":null},{"id":"W2527337933","doi":"10.1090/btran/26","title":"Hyperbolic families and coloring graphs on surfaces","year":2018,"lang":"en","type":"preprint","venue":"Transactions of the American Mathematical Society Series B","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs; National Science Foundation","keywords":"Combinatorics; Mathematics; Omega; Graph; List coloring; Complete coloring; Discrete mathematics; Physics; Graph power; Line graph","score_opus":0.024811106765467404,"score_gpt":0.28157118198727965,"score_spread":0.25676007522181227,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2527337933","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9936522,0.00006680512,0.0030062727,0.00056448486,0.0003116824,0.00050305197,0.00010758901,0.0001308756,0.0016570111],"genre_scores_gemma":[0.9598949,0.00073037087,0.038651332,0.00015382122,0.00005621494,0.00005898003,0.0000011680555,0.00006432252,0.0003889042],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981522,0.00014810909,0.0005402089,0.0004020396,0.00043759757,0.00031985316],"domain_scores_gemma":[0.99739367,0.00087388366,0.0005141016,0.0010268405,0.000103404585,0.00008813069],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.00037166505,0.00042189876,0.0009299925,0.000050848605,0.0005770324,0.00004778116,0.0006457427,0.00018389616,0.00008683642],"category_scores_gemma":[0.00011232542,0.00027617914,0.0007833776,0.00029569268,0.0039542224,0.00006919794,0.00025093538,0.0007083197,0.0000023080954],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005737536,0.0010789889,0.0007135488,0.008370746,0.0042430903,0.0000020439227,0.04768,0.0007253054,0.0014985459,0.92607844,0.002983993,0.006051564],"study_design_scores_gemma":[0.00014374027,0.00022017804,0.0008021957,0.0003320466,0.00035972663,0.000013828923,0.0042347955,0.00033476323,0.0023323235,0.99074936,0.00014798818,0.00032907745],"about_ca_topic_score_codex":0.00004233273,"about_ca_topic_score_gemma":0.000008979769,"teacher_disagreement_score":0.06467091,"about_ca_system_score_codex":0.000041897874,"about_ca_system_score_gemma":0.00004600357,"threshold_uncertainty_score":0.99996907},"labels":[],"label_agreement":null},{"id":"W2527966071","doi":"10.1002/jgt.10044","title":"On splittable colorings of graphs and hypergraphs","year":2002,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Hungarian Science Foundation; Hungarian Scientific Research Fund; Fields Institute for Research in Mathematical Sciences; National Science Foundation","keywords":"Mathematics; Combinatorics; Greedy coloring; Graph coloring; Generalization; Ramsey theory; Discrete mathematics; List coloring; Graph; Edge coloring; Line graph; Graph power","score_opus":0.02728294482362184,"score_gpt":0.25678364156245603,"score_spread":0.2295006967388342,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2527966071","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97830105,0.0018801524,0.00011303151,0.000066418805,0.0003027454,0.000098871606,0.0000064159312,0.000017833938,0.019213462],"genre_scores_gemma":[0.99695057,0.0007093092,0.0017799131,0.00014139168,0.000031140127,0.0000014850374,1.0743347e-7,0.000026943128,0.00035913882],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99838704,0.00020096981,0.00065349194,0.00014315725,0.00038148076,0.00023384238],"domain_scores_gemma":[0.99742854,0.0013211424,0.00065435155,0.0003015604,0.0001644902,0.00012992883],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013831502,0.00020006328,0.00051410816,0.00059170515,0.000161666,0.000018451738,0.00030220274,0.00011670553,0.00027392217],"category_scores_gemma":[0.00046011794,0.00014132436,0.00034194262,0.00034329802,0.00039015253,0.00015057062,0.000057449553,0.00036083866,0.0000010734319],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002536283,0.0001528731,0.0008990516,0.00008014842,0.00020361286,0.00002097867,0.0008331962,0.0000030276803,0.0007569254,0.99362516,0.0015064913,0.0016648974],"study_design_scores_gemma":[0.0007995719,0.0006038188,0.0008486735,0.00014019577,0.00012477228,0.00017485423,0.0002905706,0.000004759125,0.0017701447,0.9945706,0.00052637764,0.00014567799],"about_ca_topic_score_codex":0.0000010080149,"about_ca_topic_score_gemma":4.6059438e-7,"teacher_disagreement_score":0.018854324,"about_ca_system_score_codex":0.000010900821,"about_ca_system_score_gemma":0.000007986271,"threshold_uncertainty_score":0.576304},"labels":[],"label_agreement":null},{"id":"W2528371477","doi":"10.1002/jgt.10036","title":"Extremal problems for chromatic neighborhood sets","year":2002,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; Fields Institute for Research in Mathematical Sciences","funders":"","keywords":"Combinatorics; Mathematics; Chromatic scale; Multiplicity (mathematics); Graph; Critical graph; Upper and lower bounds; Discrete mathematics; Friendship graph; Sequence (biology); Graph theory; Line graph; Graph power; Geometry","score_opus":0.059156885046753524,"score_gpt":0.2906379110013115,"score_spread":0.23148102595455794,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2528371477","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8596638,0.008911577,0.0991288,0.0007893121,0.0034067968,0.0014800851,0.00005171626,0.00015873525,0.026409192],"genre_scores_gemma":[0.98849225,0.00012541091,0.0103417095,0.00018586894,0.00032585912,0.0000107361875,5.2226824e-7,0.00005174719,0.00046591763],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99812716,0.00022073628,0.00080861244,0.000148684,0.0003589452,0.00033584272],"domain_scores_gemma":[0.99721104,0.0013240854,0.0007627964,0.00034158444,0.00021774412,0.00014272545],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017310092,0.00023229091,0.00050290715,0.00032185297,0.0002560416,0.000042933247,0.00045945274,0.00013273049,0.0005405376],"category_scores_gemma":[0.0007025525,0.00015984595,0.0005696494,0.00020879772,0.0001611699,0.0002248095,0.000049331295,0.00030056862,0.000003863565],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000108753244,0.00021315466,0.00018348776,0.0002742967,0.00032300118,0.000019186275,0.002731589,0.000009077924,0.0004608483,0.98067206,0.006499668,0.00850489],"study_design_scores_gemma":[0.0011952085,0.00040789388,0.00016437717,0.00018179772,0.00019958307,0.00036966376,0.00026522455,0.0002796933,0.00026262508,0.9955063,0.0009679605,0.00019969126],"about_ca_topic_score_codex":1.473488e-7,"about_ca_topic_score_gemma":4.2493068e-7,"teacher_disagreement_score":0.12882844,"about_ca_system_score_codex":0.000027989512,"about_ca_system_score_gemma":0.000016337655,"threshold_uncertainty_score":0.6518328},"labels":[],"label_agreement":null},{"id":"W2528549426","doi":"10.1002/jgt.10032","title":"A Ramsey‐type problem and the Turán numbers*","year":2002,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Royal College of Physicians and Surgeons of Canada; University of Toronto; Mount Royal University; University of Calgary","funders":"","keywords":"Combinatorics; Mathematics; Ramsey's theorem; Omega; Graph; Constant (computer programming); Type (biology); Asymptotically optimal algorithm; Discrete mathematics; Physics; Algorithm","score_opus":0.023970450040739267,"score_gpt":0.25824839360078417,"score_spread":0.2342779435600449,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2528549426","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9028156,0.013906374,0.0013743007,0.0020913132,0.0015303069,0.00053942495,0.000004790099,0.00006104912,0.077676855],"genre_scores_gemma":[0.99366856,0.0009097892,0.0036396957,0.00046374323,0.00025676537,0.000002034625,8.834222e-8,0.000026603811,0.0010327195],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983592,0.00050111,0.0005121379,0.00011023194,0.00030778054,0.00020955407],"domain_scores_gemma":[0.9974791,0.0014997594,0.00046929668,0.0002876892,0.00017076038,0.000093394825],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027013295,0.00016859084,0.00038266307,0.00014396847,0.0002844605,0.00005374645,0.00036038592,0.000094283016,0.00035300953],"category_scores_gemma":[0.0005898055,0.00008509702,0.00026295273,0.00023220389,0.0006190526,0.00014075768,0.00008207694,0.00047522763,0.0000034744396],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00043923056,0.00004719657,0.000161027,0.000036904825,0.00021875423,0.000021611822,0.004683301,0.0000014089998,0.000041064297,0.9846625,0.005683714,0.0040032878],"study_design_scores_gemma":[0.0016558319,0.00011904103,0.00008981614,0.00006451033,0.00015757233,0.00068462867,0.00056530687,0.00001601908,0.000054663084,0.99327826,0.0032001676,0.00011414898],"about_ca_topic_score_codex":0.0000011158961,"about_ca_topic_score_gemma":0.0000010894227,"teacher_disagreement_score":0.090852976,"about_ca_system_score_codex":0.000011445899,"about_ca_system_score_gemma":0.000009869171,"threshold_uncertainty_score":0.38652068},"labels":[],"label_agreement":null},{"id":"W2529549915","doi":"10.1016/j.ejc.2018.04.008","title":"Random 4-regular graphs have 3-star decompositions asymptotically almost surely","year":2018,"lang":"en","type":"preprint","venue":"European Journal of Combinatorics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Counterexample; Combinatorics; Conjecture; Star (game theory); Graph; Discrete mathematics; Random graph; Asymptotically optimal algorithm; Planar graph; Random regular graph; Chordal graph; 1-planar graph","score_opus":0.029508806626674208,"score_gpt":0.28489483296535684,"score_spread":0.2553860263386826,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2529549915","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8919234,0.0023459222,0.04030445,0.0006582424,0.014026034,0.00079272286,0.00011147218,0.00018553832,0.049652196],"genre_scores_gemma":[0.9815994,0.0003786842,0.016482012,0.00016395428,0.000812695,0.0000018905083,0.000014387998,0.000207034,0.00033997165],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99378663,0.0023384735,0.0018752031,0.00041670573,0.0010834219,0.00049955776],"domain_scores_gemma":[0.9938593,0.00096988596,0.0019950178,0.001115132,0.0016276513,0.00043303837],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.004855225,0.00064301316,0.0012238135,0.00052070816,0.0005006876,0.00023208199,0.0017850928,0.0002537166,0.0001286709],"category_scores_gemma":[0.0011529337,0.0005271044,0.001089824,0.00023014408,0.00044761642,0.00013001495,0.0011525395,0.0022160986,0.00002037831],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006686601,0.0007889237,0.0009240384,0.0004768964,0.0017509422,0.0017139124,0.0021356854,0.00010414996,0.00011175552,0.9496494,0.04120629,0.00046935058],"study_design_scores_gemma":[0.003143229,0.00058769254,0.0013896164,0.00071975874,0.00068295066,0.00044447367,0.000076440534,0.00006554791,0.00025210303,0.98557174,0.006480901,0.0005855605],"about_ca_topic_score_codex":8.0769206e-7,"about_ca_topic_score_gemma":5.534018e-7,"teacher_disagreement_score":0.08967595,"about_ca_system_score_codex":0.00012379153,"about_ca_system_score_gemma":0.0001899712,"threshold_uncertainty_score":0.99971807},"labels":[],"label_agreement":null},{"id":"W2529837827","doi":"10.1017/9781108332699.009","title":"Robustness of graph properties","year":2017,"lang":"en","type":"book-chapter","venue":"Cambridge University Press eBooks","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":31,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"Schweizerischer Nationalfonds zur Förderung der Wissenschaftlichen Forschung","keywords":"Computer science; Robustness (evolution); Graph; Theoretical computer science; Chemistry","score_opus":0.05851805285497589,"score_gpt":0.22745253713990635,"score_spread":0.16893448428493046,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2529837827","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012932246,0.0001872239,0.00052321795,0.0000039928073,0.00046248653,0.00040375005,0.00018220796,0.00009115051,0.99685276],"genre_scores_gemma":[0.009489642,0.00009056992,0.00042745718,0.000006480858,0.00013513508,5.3791183e-7,0.000006977944,0.0000631671,0.98978],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99879104,0.000039552924,0.0002516584,0.00037823856,0.00030663147,0.00023289176],"domain_scores_gemma":[0.9976904,0.000085485146,0.0006090562,0.0012625067,0.00025284654,0.000099723715],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00014465707,0.00039405862,0.00066438585,0.00020309769,0.00044437093,0.00002800258,0.0010285751,0.00045923822,0.000006812005],"category_scores_gemma":[0.000043554937,0.0003639573,0.00039354723,0.000002776737,0.00089119247,0.0000797238,0.0006667606,0.0004212732,6.040239e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012062246,0.0000087596245,9.4538706e-7,0.00055450946,0.0002932076,0.0000598951,0.0001072807,0.0000050995163,0.000028028133,0.98644,0.0118859885,0.0004956606],"study_design_scores_gemma":[0.001533613,0.00015462555,0.000013264525,0.002024612,0.001535621,0.00005670204,0.00011503369,0.00010340947,0.0030902512,0.01416066,0.9756015,0.001610715],"about_ca_topic_score_codex":0.000030947056,"about_ca_topic_score_gemma":0.000002025994,"teacher_disagreement_score":0.97227937,"about_ca_system_score_codex":0.000047581972,"about_ca_system_score_gemma":0.00006929758,"threshold_uncertainty_score":0.99988127},"labels":[],"label_agreement":null},{"id":"W2547423554","doi":"10.4153/cmb-2018-024-5","title":"Squared Chromatic Number Without Claws or Large Cliques","year":2018,"lang":"en","type":"article","venue":"Canadian Mathematical Bulletin","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek","keywords":"Unicode; Mathematics; Combinatorics; Discrete mathematics; Computer science","score_opus":0.031412351314964865,"score_gpt":0.32411231306504,"score_spread":0.2926999617500752,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2547423554","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6061291,0.00004175221,0.0059813997,0.0038542654,0.0005804638,0.0012693616,0.00012796433,0.00049768144,0.38151798],"genre_scores_gemma":[0.9579229,0.0000044022195,0.025802664,0.0026354566,0.00056340266,0.000062603576,0.000007489315,0.00011226508,0.012888838],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997353,0.00019159552,0.0006631336,0.0004269466,0.0003694919,0.000995827],"domain_scores_gemma":[0.99728405,0.0006709112,0.00014843557,0.0008892198,0.00017542047,0.0008319659],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0008649292,0.0003860081,0.0006189127,0.00014178846,0.0006054782,0.000111758265,0.0005498312,0.0003052617,0.123349406],"category_scores_gemma":[0.0020943196,0.00027574252,0.00017750447,0.00022942043,0.00045945216,0.00005195897,0.00011855248,0.00031350512,0.011895062],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003945339,0.00007546115,0.0002989156,0.00031371944,0.00007567189,0.00006730344,0.0019674231,2.1462192e-8,0.000010501115,0.8752171,0.12166765,0.0002668117],"study_design_scores_gemma":[0.00053229637,0.00011068765,0.00011850628,0.00024287748,0.00007449925,0.00016278008,0.00032749734,0.00015195386,0.00017176471,0.8119223,0.18573965,0.00044520735],"about_ca_topic_score_codex":0.00023707627,"about_ca_topic_score_gemma":0.003805583,"teacher_disagreement_score":0.36862913,"about_ca_system_score_codex":0.00016823487,"about_ca_system_score_gemma":0.00022300848,"threshold_uncertainty_score":0.9999695},"labels":[],"label_agreement":null},{"id":"W2548691895","doi":"10.1090/tran/7186","title":"The densest matroids in minor-closed classes with exponential growth rate","year":2017,"lang":"lv","type":"article","venue":"Transactions of the American Mathematical Society","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Office of Naval Research; Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Matroid; Exponential growth; Minor (academic); Exponential function; Combinatorics; Growth rate; Pure mathematics; Mathematical analysis; Geometry; Humanities","score_opus":0.016187162103958926,"score_gpt":0.27295241194878644,"score_spread":0.2567652498448275,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2548691895","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9659237,0.000103590304,0.027523337,0.00336589,0.0003539227,0.00089758873,0.000075374664,0.000049374325,0.0017072248],"genre_scores_gemma":[0.9880171,0.0003437175,0.010138778,0.00011643103,0.00009203807,0.00006125852,6.251146e-7,0.00008021951,0.0011498573],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9968104,0.00044823895,0.00091531506,0.00043216083,0.0006768606,0.00071701885],"domain_scores_gemma":[0.9936782,0.0023223162,0.0013648252,0.0023113447,0.00018038548,0.00014294407],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":["sts"],"category_scores_codex":[0.0011541477,0.0005070646,0.00095962506,0.000038903014,0.003205752,0.000291466,0.0021346465,0.00015793047,0.00013117354],"category_scores_gemma":[0.00040141176,0.00026591134,0.001058651,0.00034946928,0.00694627,0.00021528671,0.00015173721,0.00088755426,0.000012376474],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00335069,0.0054978095,0.011559142,0.005878196,0.007813744,0.000056769324,0.049181163,0.00032947355,0.009079053,0.8884734,0.004025689,0.014754889],"study_design_scores_gemma":[0.0033229445,0.00077549764,0.0661175,0.0011930639,0.002191071,0.0001158125,0.01663321,0.0041701025,0.0075406353,0.8963596,0.00032295746,0.0012575542],"about_ca_topic_score_codex":0.000324109,"about_ca_topic_score_gemma":0.00022030913,"teacher_disagreement_score":0.054558363,"about_ca_system_score_codex":0.00011300495,"about_ca_system_score_gemma":0.00014891909,"threshold_uncertainty_score":0.9999793},"labels":[],"label_agreement":null},{"id":"W2549740858","doi":"10.1016/j.disc.2016.08.027","title":"Graph-intersecting set systems and LYM inequalities","year":2016,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Digraph; Mathematics; Vertex (graph theory); Graph; Limiting; Upper and lower bounds; Complete graph; Set (abstract data type); Discrete mathematics; Computer science","score_opus":0.05286349505153703,"score_gpt":0.30653047238653497,"score_spread":0.25366697733499793,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2549740858","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9514832,0.0002757155,0.035880223,0.00014865621,0.0005556249,0.00038353654,0.0000976813,0.00025331185,0.010922068],"genre_scores_gemma":[0.99235314,0.000044527453,0.005963564,0.00003533306,0.00013167952,0.000025694413,0.0000018215552,0.00005427161,0.00138999],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99850696,0.000100149795,0.00052537635,0.00025029122,0.0002817629,0.00033545823],"domain_scores_gemma":[0.9977817,0.0012932734,0.00025151178,0.00050637824,0.00006487865,0.000102234335],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006812308,0.0002624671,0.00042044919,0.000121760946,0.00023620842,0.00008572555,0.00022531323,0.00011062441,0.000055189346],"category_scores_gemma":[0.0006729337,0.00014697328,0.00011147233,0.00009872853,0.0001660337,0.00015245966,0.00020643369,0.00009871196,0.000007612451],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007884809,0.000013529498,0.00036698524,0.0006191654,0.00008333785,0.000005395488,0.009401662,2.5342337e-7,0.00032792185,0.9882968,0.00057150045,0.00030557634],"study_design_scores_gemma":[0.00042564477,0.000052267173,0.00004071598,0.00061341375,0.000068072455,0.0000876706,0.010060635,0.00021999826,0.0005070727,0.98718524,0.00041710038,0.00032215103],"about_ca_topic_score_codex":0.0000085208285,"about_ca_topic_score_gemma":0.0000040281975,"teacher_disagreement_score":0.040869936,"about_ca_system_score_codex":0.000025520787,"about_ca_system_score_gemma":0.000009954879,"threshold_uncertainty_score":0.59933966},"labels":[],"label_agreement":null},{"id":"W2556067267","doi":"10.1016/j.disc.2016.10.016","title":"The strong chromatic index of <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" id=\"mml1\" display=\"inline\" overflow=\"scroll\" altimg=\"si1.gif\"><mml:mrow><mml:mo>(</mml:mo><mml:mn>3</mml:mn><mml:mo>,</mml:mo><mml:mi>Δ</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math>-bipartite graphs","year":2016,"lang":"lv","type":"article","venue":"Discrete Mathematics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Fundamental Research Funds for the Central Universities; Wuhan University of Technology; National Sanitarium Association","keywords":"Edge coloring; Bipartite graph; Combinatorics; Mathematics; Conjecture; Partition (number theory); Graph; Discrete mathematics; Line graph; Graph power","score_opus":0.01711307893769829,"score_gpt":0.2487024743155098,"score_spread":0.2315893953778115,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2556067267","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9292507,0.0022541368,0.0047716447,0.0006831265,0.003171943,0.00031635005,0.0016640791,0.0005348949,0.05735312],"genre_scores_gemma":[0.983832,0.0020606082,0.007331044,0.0008534805,0.001967778,0.0013137974,0.00061784056,0.0014265188,0.00059692096],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9833346,0.00085198664,0.004600904,0.0025823598,0.0046297773,0.004000368],"domain_scores_gemma":[0.9830365,0.0053456025,0.0051341886,0.0044573997,0.00048172157,0.0015445912],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","research_integrity","insufficient_payload"],"consensus_categories":["metaepi_narrow","sts","research_integrity","insufficient_payload"],"category_scores_codex":[0.0043892,0.00213432,0.0012580364,0.0008096705,0.0032077965,0.0020173062,0.004484141,0.0033188052,0.010599583],"category_scores_gemma":[0.0042144097,0.0026034277,0.0036210886,0.0016405674,0.004097804,0.0018529542,0.0036881045,0.0026086273,0.0017052168],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011982254,0.0007086482,0.000027054257,0.00484594,0.0038599216,0.00052667566,0.0067079915,0.0005232401,0.0028357818,0.9466039,0.029802417,0.0023601805],"study_design_scores_gemma":[0.006204624,0.0036748103,0.00014743373,0.009526705,0.0073090754,0.0026075847,0.010851377,0.37269884,0.45063746,0.12614504,0.0048130597,0.005384004],"about_ca_topic_score_codex":0.0004909271,"about_ca_topic_score_gemma":0.00057068624,"teacher_disagreement_score":0.8204589,"about_ca_system_score_codex":0.00006470559,"about_ca_system_score_gemma":0.0012635962,"threshold_uncertainty_score":0.9996924},"labels":[],"label_agreement":null},{"id":"W2557998963","doi":"10.4153/cmb-2015-057-5","title":"Ramsey Number of Wheels Versus Cycles and Trees","year":2015,"lang":"en","type":"article","venue":"Canadian Mathematical Bulletin","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Ramsey's theorem; Conjecture; Vertex (graph theory); Graph; Disjoint sets; Discrete mathematics","score_opus":0.056982726147584,"score_gpt":0.30864276202806623,"score_spread":0.25166003588048225,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2557998963","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.88219565,0.000100671474,0.0002185364,0.0012276166,0.00017883713,0.00021182655,0.00003200467,0.000042305994,0.11579253],"genre_scores_gemma":[0.9868723,0.000005900572,0.0117932325,0.00014107511,0.000069753994,0.000009723238,0.0000020397968,0.00003132408,0.0010746262],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988731,0.000076824486,0.0003232247,0.00018540584,0.00022054302,0.0003209083],"domain_scores_gemma":[0.9981192,0.0007129633,0.00008019441,0.00034610595,0.00008440448,0.00065713807],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00048196214,0.000170399,0.00034950778,0.00007876586,0.00008605703,0.000027686581,0.00020386178,0.00013881325,0.0038269218],"category_scores_gemma":[0.0017272545,0.00013800769,0.000070163005,0.00008335977,0.00029090184,0.00002479544,0.00006704784,0.00013594494,0.0003545437],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003908868,0.000023359236,0.00034216171,0.0001019163,0.00004695013,0.00001641354,0.0012825466,3.6728622e-7,0.000005821995,0.97805506,0.019295724,0.0007905697],"study_design_scores_gemma":[0.0007961193,0.000045925684,0.00017802343,0.00006738965,0.000052025483,0.000040618026,0.0006358633,0.000033309752,0.00010032115,0.9821148,0.015743544,0.00019208567],"about_ca_topic_score_codex":0.00038405295,"about_ca_topic_score_gemma":0.0006965961,"teacher_disagreement_score":0.1147179,"about_ca_system_score_codex":0.000052438314,"about_ca_system_score_gemma":0.00009747229,"threshold_uncertainty_score":0.9970837},"labels":[],"label_agreement":null},{"id":"W2559261669","doi":"","title":"Rainbow K-Connection in Dense Graphs","year":2015,"lang":"en","type":"article","venue":"Journal of Combinatorial Mathematics and Combinatorial Computing","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Combinatorics; Mathematics; Rainbow; Multipartite; Bipartite graph; Vertex (graph theory); Edge coloring; Discrete mathematics; Graph; Connection (principal bundle); Graph power; Line graph; Physics","score_opus":0.029713542900335146,"score_gpt":0.2851789709057531,"score_spread":0.255465428005418,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2559261669","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98074955,0.00026839852,0.00092692,0.00007838645,0.016173251,0.00024008894,8.5331567e-7,0.000037526526,0.0015250513],"genre_scores_gemma":[0.99113065,0.00002080218,0.007816157,0.00002361964,0.0009585202,0.0000014844987,4.27588e-7,0.000041382464,0.0000069776024],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970786,0.0002415347,0.0013595971,0.00021052797,0.00074385543,0.00036588503],"domain_scores_gemma":[0.99647653,0.0012946491,0.0010776626,0.00027545146,0.0005948032,0.00028093124],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.003977028,0.0003088494,0.00089371036,0.00043742658,0.00021270673,0.00012716562,0.0003779189,0.00022812808,0.000005189138],"category_scores_gemma":[0.002675031,0.00025930844,0.00020600295,0.00046070095,0.00011824077,0.00023646338,0.0002448619,0.0006365541,8.4447345e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016856089,0.00036085554,0.00071286503,0.000113776725,0.00007133958,0.0000540004,0.0039379965,0.000015267455,0.00006868291,0.9933388,0.0004703515,0.000687489],"study_design_scores_gemma":[0.0057247053,0.0005932769,0.00011045409,0.00026675017,0.00007450145,0.0002712754,0.0013267337,0.0008462708,0.00026275523,0.9899291,0.0003170942,0.0002771112],"about_ca_topic_score_codex":0.000009674048,"about_ca_topic_score_gemma":0.0000010772114,"teacher_disagreement_score":0.015214731,"about_ca_system_score_codex":0.00012502432,"about_ca_system_score_gemma":0.00013419469,"threshold_uncertainty_score":0.99998593},"labels":[],"label_agreement":null},{"id":"W2567969683","doi":"10.4310/joc.2019.v10.n2.a1","title":"On the boundary of the region defined by homomorphism densities","year":2019,"lang":"en","type":"preprint","venue":"Journal of Combinatorics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Homomorphism; Boundary (topology); Differentiable function; Countable set; Combinatorics; Discrete mathematics; Algebraic number; Pure mathematics; Mathematical analysis","score_opus":0.02879365904522159,"score_gpt":0.2551754724325314,"score_spread":0.22638181338730984,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2567969683","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98318845,0.0018914589,0.00049018255,0.0019989507,0.008508252,0.0003330334,0.000022231183,0.000011378225,0.0035560608],"genre_scores_gemma":[0.9980932,0.00032806737,0.000089356996,0.00029479258,0.00011734946,0.0000021321885,8.883162e-7,0.00004010471,0.0010341302],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99760884,0.00040081676,0.0007947488,0.00013710497,0.0008745066,0.00018398238],"domain_scores_gemma":[0.99409467,0.002061024,0.0022724257,0.001008589,0.0005162446,0.00004706889],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008962753,0.00028159225,0.00065866706,0.00011411327,0.0002496934,0.000066344706,0.0012602102,0.0003353782,0.0000172687],"category_scores_gemma":[0.001097471,0.00013796268,0.0006034763,0.00014196,0.0002876757,0.000043136093,0.0006267959,0.0017593696,9.919288e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000060156435,0.00012507857,0.00021501366,0.00020221336,0.00019756725,0.000009776825,0.00092627807,0.000029237066,0.000028352728,0.8655383,0.13262096,0.000047042773],"study_design_scores_gemma":[0.00038440706,0.00016226262,0.00035878315,0.0005386995,0.0001899001,0.00011167846,0.00017713832,0.00002092777,0.00068198744,0.99337447,0.003848275,0.00015148682],"about_ca_topic_score_codex":0.0000036508507,"about_ca_topic_score_gemma":4.778552e-7,"teacher_disagreement_score":0.12877268,"about_ca_system_score_codex":0.000136833,"about_ca_system_score_gemma":0.00026522763,"threshold_uncertainty_score":0.76436836},"labels":[],"label_agreement":null},{"id":"W2572578888","doi":"","title":"Probability Of Mutually Commuting Two Finite Subsets Of A Finite Group.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Group (periodic table); Finite group; Pure mathematics; Physics","score_opus":0.03775758239761942,"score_gpt":0.28125427524910174,"score_spread":0.24349669285148232,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2572578888","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9955859,0.00005950251,0.00023245998,0.00005558022,0.00066804595,0.00028245547,0.000035660185,0.00005479931,0.0030255618],"genre_scores_gemma":[0.99688464,0.0000105491945,0.0029793498,0.000023172835,0.0000086836435,0.000010830798,0.0000022100455,0.0000268185,0.000053735203],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982534,0.00025707445,0.0006636951,0.00023448077,0.00031532024,0.00027604718],"domain_scores_gemma":[0.9947665,0.0036560413,0.00044695553,0.000848211,0.00021404478,0.000068258494],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010822961,0.0001934276,0.00046795094,0.00008514483,0.00010620066,0.000007007834,0.0004652426,0.00010777443,0.000094328054],"category_scores_gemma":[0.0021493256,0.00013008944,0.0001765097,0.000212807,0.00034531162,0.00010678141,0.0002800218,0.00014330617,0.0000032865119],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006881754,0.00020325121,0.015263795,0.00019561383,0.00006776945,0.0000021570884,0.0012351653,0.0000014125723,0.0018038256,0.979472,0.0001260908,0.0015600969],"study_design_scores_gemma":[0.001582156,0.00015401327,0.0030565462,0.00020079249,0.000039517457,0.00000204394,0.000049408096,0.00003463479,0.006563647,0.9880488,0.00010435096,0.00016412645],"about_ca_topic_score_codex":0.00001995204,"about_ca_topic_score_gemma":0.000011967486,"teacher_disagreement_score":0.012207248,"about_ca_system_score_codex":0.000031731754,"about_ca_system_score_gemma":0.000033010103,"threshold_uncertainty_score":0.5304893},"labels":[],"label_agreement":null},{"id":"W2578013412","doi":"","title":"The number of maximal independent sets in trees and forests.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Forestry; Geography","score_opus":0.014894386235573483,"score_gpt":0.27956692447406134,"score_spread":0.26467253823848785,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2578013412","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99659127,0.000077264645,0.000003763455,0.0001380059,0.00044259333,0.000102751466,0.000003631171,0.0000124597,0.0026282812],"genre_scores_gemma":[0.9996179,0.00004688578,0.00011876795,0.000009890714,0.000003360719,0.000007932057,1.5528485e-7,0.000011653835,0.00018349382],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99927497,0.000067580135,0.0002113459,0.00011758207,0.00016431643,0.00016422459],"domain_scores_gemma":[0.99888945,0.00069718785,0.000083237326,0.00026562746,0.000031054533,0.00003343696],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036912246,0.0000905539,0.00014687,0.00002697256,0.00008482547,0.0000110536985,0.00017801639,0.00006757416,0.000026360838],"category_scores_gemma":[0.00021395701,0.000044895405,0.000037055168,0.00006304984,0.00015811424,0.000057047546,0.00013394345,0.00007555512,0.000002117309],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002805172,0.000023717117,0.16062224,0.000009395391,0.000015079254,0.0000030987997,0.00028845173,1.6379978e-8,0.00004771593,0.8354325,0.00023273045,0.0032969806],"study_design_scores_gemma":[0.0007229883,0.000021017606,0.1421605,0.000031225063,0.00000641748,0.0000083613,0.000054334287,0.0000028527948,0.00045323567,0.8563021,0.00017572117,0.00006127297],"about_ca_topic_score_codex":0.000010962591,"about_ca_topic_score_gemma":0.00007981688,"teacher_disagreement_score":0.02086954,"about_ca_system_score_codex":0.000017001916,"about_ca_system_score_gemma":0.0000119771685,"threshold_uncertainty_score":0.18307814},"labels":[],"label_agreement":null},{"id":"W2581287304","doi":"10.1017/s0963548318000147","title":"A Stability Theorem for Matchings in Tripartite 3-Graphs","year":2018,"lang":"en","type":"preprint","venue":"Combinatorics Probability Computing","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Hypergraph; Combinatorics; Mathematics; Matching (statistics); Stability (learning theory); Degree (music); Statement (logic); Class (philosophy); Discrete mathematics; Upper and lower bounds; Computer science; Physics; Law","score_opus":0.07684350629081063,"score_gpt":0.32599971682115114,"score_spread":0.2491562105303405,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2581287304","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97732264,0.00020903046,0.012816744,0.00012321104,0.003553257,0.0039010905,0.00006657451,0.00040337717,0.0016041006],"genre_scores_gemma":[0.97402364,0.0000076126157,0.025419272,0.00006228134,0.00019462172,0.00014656688,0.000028240547,0.000100301084,0.000017484179],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99442434,0.00074934156,0.0017249126,0.0016015909,0.0005469034,0.00095292204],"domain_scores_gemma":[0.99256694,0.0034874785,0.0008965706,0.002166017,0.0007022895,0.00018068276],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.008336224,0.0007726485,0.0014127115,0.00028868628,0.0005538864,0.00016456854,0.0014389592,0.00083136,0.000027911256],"category_scores_gemma":[0.0038794884,0.00072498235,0.0006868952,0.00054510025,0.00056349643,0.00009673458,0.003157026,0.001577707,0.0000017776247],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013441553,0.0006223534,0.012405472,0.0036318724,0.00008020335,0.000002319541,0.006718708,0.000042436463,0.000009477102,0.974975,0.00023948913,0.0011382762],"study_design_scores_gemma":[0.0011114964,0.00013648017,0.0016513035,0.00045027694,0.00007277226,0.0000030920928,0.000128846,0.0068200952,0.000361128,0.9884186,0.0001303438,0.0007155652],"about_ca_topic_score_codex":0.000040056337,"about_ca_topic_score_gemma":0.000028702318,"teacher_disagreement_score":0.013443624,"about_ca_system_score_codex":0.00060023065,"about_ca_system_score_gemma":0.00025988754,"threshold_uncertainty_score":0.9995201},"labels":[],"label_agreement":null},{"id":"W2581376465","doi":"10.37236/6762","title":"Linear Bound for Majority Colourings of Digraphs","year":2018,"lang":"en","type":"preprint","venue":"The Electronic Journal of Combinatorics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Combinatorics; Digraph; Mathematics; Constant (computer programming); Upper and lower bounds; Discrete mathematics; Computer science","score_opus":0.02842287939724369,"score_gpt":0.32021916566133807,"score_spread":0.2917962862640944,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2581376465","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97747535,0.0044131833,0.0133230155,0.00031319982,0.0030677302,0.00067681936,0.00002264624,0.000023713272,0.00068435335],"genre_scores_gemma":[0.997567,0.0010346165,0.00046026008,0.000032802498,0.0005719414,0.000009945157,0.0000019728295,0.00005903712,0.00026243768],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972714,0.00021349998,0.0010820878,0.0001981594,0.00061279134,0.0006220172],"domain_scores_gemma":[0.994753,0.001213681,0.0023442789,0.00074291264,0.0008643506,0.000081750426],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035904013,0.0003447815,0.00092396396,0.00020706256,0.0002888927,0.000036723646,0.0015825481,0.0003798388,0.000012649221],"category_scores_gemma":[0.0008334311,0.0002256285,0.0007722321,0.00021098721,0.00035296238,0.000059436083,0.0004781201,0.0018830396,3.6929728e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003125547,0.0001766699,0.00011949649,0.00038057362,0.0007211677,0.0000018546425,0.00094974344,0.0000074646514,0.00003318395,0.9945136,0.0026865834,0.000097137214],"study_design_scores_gemma":[0.0009408782,0.0010274987,0.000052976047,0.000173092,0.0005725187,0.000066976885,0.000080560916,0.000066859066,0.0026550896,0.98977286,0.004371776,0.0002189411],"about_ca_topic_score_codex":0.000005297989,"about_ca_topic_score_gemma":0.0000042033885,"teacher_disagreement_score":0.020091647,"about_ca_system_score_codex":0.00026174044,"about_ca_system_score_gemma":0.00078131334,"threshold_uncertainty_score":0.92008626},"labels":[],"label_agreement":null},{"id":"W2588376139","doi":"10.37236/7159","title":"Clique Colourings of Geometric Graphs","year":2018,"lang":"en","type":"preprint","venue":"The Electronic Journal of Combinatorics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Clique number; Chromatic scale; Vertex (graph theory); Euclidean geometry; Clique; Discrete mathematics; Graph; Random graph; Clique graph; Graph power; Line graph; Geometry","score_opus":0.02056167142032056,"score_gpt":0.29325566807325076,"score_spread":0.2726939966529302,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2588376139","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9827061,0.0068044243,0.005467831,0.00021685351,0.0026020752,0.00035915748,0.000007858187,0.000025242685,0.0018104388],"genre_scores_gemma":[0.99634355,0.0029317313,0.00014230722,0.000041317482,0.0002590344,0.00000435116,0.0000010850349,0.000060199036,0.00021639754],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.996556,0.0004041468,0.0012808774,0.000205699,0.0008841922,0.0006691158],"domain_scores_gemma":[0.99372053,0.0012169098,0.0030202891,0.00088427926,0.0010614716,0.000096523385],"candidate_categories":["research_integrity"],"consensus_categories":[],"category_scores_codex":[0.004376589,0.00037938662,0.0010169402,0.00073073053,0.0002053768,0.000035922516,0.0020527856,0.00043609724,0.000039748003],"category_scores_gemma":[0.0010869266,0.00024243651,0.0007122534,0.00083572225,0.00034639335,0.0000635701,0.0007960182,0.0030209923,0.000001104897],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012843603,0.00016635798,0.0002566669,0.00023972282,0.00065135764,0.000006325804,0.0005961085,0.00001597059,0.00001840442,0.9955589,0.0022070685,0.00015464223],"study_design_scores_gemma":[0.0006234136,0.0008845145,0.0002330342,0.00018435925,0.0004430767,0.0001674547,0.000067182686,0.000011721512,0.0024180054,0.9935962,0.0011397717,0.00023125726],"about_ca_topic_score_codex":0.000006562237,"about_ca_topic_score_gemma":0.0000019815222,"teacher_disagreement_score":0.013637458,"about_ca_system_score_codex":0.000343028,"about_ca_system_score_gemma":0.0008214332,"threshold_uncertainty_score":0.9992791},"labels":[],"label_agreement":null},{"id":"W2590370139","doi":"10.1007/978-3-319-33930-6_3","title":"Random Graph Models","year":2016,"lang":"en","type":"book-chapter","venue":"SpringerBriefs in quantitative finance","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Random graph; Mathematics; Graph; Discrete mathematics; Combinatorics; Computer science","score_opus":0.06652608942803916,"score_gpt":0.3041542741730542,"score_spread":0.23762818474501501,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2590370139","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017797967,0.0048468118,0.019659905,0.000105147905,0.0010372814,0.00082268217,0.00018990149,0.0001378382,0.97142065],"genre_scores_gemma":[0.06995835,0.008556029,0.06045025,0.00030914415,0.00044483755,0.00015710085,0.000011890045,0.0005296587,0.8595827],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99720544,0.00007617701,0.00087596674,0.00084292435,0.00046412522,0.0005353428],"domain_scores_gemma":[0.9967714,0.0014202159,0.00062760414,0.0009397564,0.000177307,0.00006372614],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007176724,0.00070376805,0.0011599809,0.00043136263,0.00019483539,0.000029375711,0.0006395913,0.0005331348,0.0002379948],"category_scores_gemma":[0.0003472593,0.000558489,0.00043202034,0.00009025457,0.0006236524,0.00023890866,0.00029394723,0.000744227,0.00006165314],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025194444,0.00001900228,0.00001069535,0.0001605237,0.00009592168,0.000075753014,0.0008343516,0.000029690833,0.000011111855,0.99551773,0.00087384577,0.0021194406],"study_design_scores_gemma":[0.001343147,0.00008601016,0.000034136192,0.0017191968,0.000042642463,0.000006624514,0.000009809745,0.00006909291,0.000060747945,0.9574512,0.038448494,0.00072885],"about_ca_topic_score_codex":0.000006527499,"about_ca_topic_score_gemma":0.00004317661,"teacher_disagreement_score":0.11183789,"about_ca_system_score_codex":0.000114672606,"about_ca_system_score_gemma":0.00007267635,"threshold_uncertainty_score":0.99968666},"labels":[],"label_agreement":null},{"id":"W2591779083","doi":"10.1002/jgt.21733","title":"The Inducibility of Graphs on Four Vertices","year":2013,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":42,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Multipartite; Discrete mathematics; Graph","score_opus":0.03695414308635255,"score_gpt":0.28918859946700176,"score_spread":0.25223445638064923,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2591779083","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99326646,0.0005201106,0.00015442647,0.00025475325,0.0007486463,0.00017430847,0.000002508303,0.000011248869,0.0048675206],"genre_scores_gemma":[0.9988002,0.00014823022,0.0006881992,0.00013937154,0.000091426984,0.0000035876546,7.415048e-8,0.00001831969,0.00011055427],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977788,0.0005871104,0.00079334626,0.00012751296,0.00047952717,0.00023370156],"domain_scores_gemma":[0.99448425,0.0035551938,0.00086427917,0.00061416853,0.00038196455,0.000100150064],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037255962,0.0001682222,0.00036101826,0.00020960848,0.0002984197,0.000039320283,0.000668961,0.0001019371,0.00014064409],"category_scores_gemma":[0.0017485387,0.00008461224,0.000460554,0.00024290233,0.00049098796,0.00018545697,0.00007202878,0.0004559679,0.0000032041894],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002784306,0.00010152261,0.0013050613,0.000038056307,0.00023947562,0.0000038346566,0.0008485988,0.0000027333338,0.0008179429,0.9852557,0.0016917035,0.009416942],"study_design_scores_gemma":[0.00036392696,0.00033149126,0.011703598,0.00007362196,0.00007393814,0.00003470844,0.00073842896,0.0000029763585,0.002876566,0.9834331,0.00027292976,0.00009468408],"about_ca_topic_score_codex":0.0000037305526,"about_ca_topic_score_gemma":0.000002351593,"teacher_disagreement_score":0.010398537,"about_ca_system_score_codex":0.000015870239,"about_ca_system_score_gemma":0.00003427065,"threshold_uncertainty_score":0.3450387},"labels":[],"label_agreement":null},{"id":"W2592011129","doi":"10.1002/rsa.20415","title":"Asymptotic enumeration of sparse 2‐connected graphs","year":2012,"lang":"en","type":"article","venue":"Random Structures and Algorithms","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; Natural Sciences and Engineering Research Council of Canada; Toronto Metropolitan University","funders":"","keywords":"Combinatorics; Mathematics; Enumeration; Social connectedness; Degree (music); Sequence (biology); Simple (philosophy); Discrete mathematics; Kernel (algebra); Wright; struct; Computer science; Physics","score_opus":0.024462672049415806,"score_gpt":0.28026428087793304,"score_spread":0.2558016088285172,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2592011129","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9933965,0.0015187253,0.003064423,0.00002751782,0.000729079,0.00031182708,0.000028728995,0.000057759822,0.00086544006],"genre_scores_gemma":[0.989308,0.00011155157,0.010180762,0.000048368707,0.00025467452,0.000007997528,0.000009353833,0.000023735416,0.000055532793],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99877405,0.00012869928,0.00037023498,0.00018185274,0.00023105953,0.0003140902],"domain_scores_gemma":[0.9989006,0.0004559345,0.00018874613,0.00026138863,0.00006663419,0.00012670513],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037735145,0.0002159108,0.0004304954,0.00011882913,0.00021738607,0.000023228158,0.000117280375,0.00012927719,0.0001525331],"category_scores_gemma":[0.00023703589,0.00015273705,0.0001289894,0.00014912614,0.00015569245,0.00015801174,0.000064912114,0.0001495507,5.647013e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022122078,0.00005128719,0.0038613172,0.00015802067,0.00020236467,0.0000020095197,0.0027070325,0.0000070533342,0.0020805881,0.9700331,0.00034270267,0.020333268],"study_design_scores_gemma":[0.0039425925,0.00007407178,0.0152678825,0.00003197707,0.00016770072,0.00007484091,0.00021064383,0.00036971137,0.008473088,0.9705859,0.0004991076,0.00030252992],"about_ca_topic_score_codex":0.000014437757,"about_ca_topic_score_gemma":0.0000021199285,"teacher_disagreement_score":0.020030739,"about_ca_system_score_codex":0.00000759636,"about_ca_system_score_gemma":0.000009545435,"threshold_uncertainty_score":0.6228436},"labels":[],"label_agreement":null},{"id":"W2592616259","doi":"10.1002/jcd.21330","title":"Sperner Partition Systems","year":2012,"lang":"en","type":"article","venue":"Journal of Combinatorial Designs","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina; University of Manitoba","funders":"","keywords":"Partition (number theory); Combinatorics; Mathematics; Class (philosophy); Upper and lower bounds; Set (abstract data type); Discrete mathematics; Computer science","score_opus":0.07791015228074148,"score_gpt":0.32123829879430965,"score_spread":0.24332814651356816,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2592616259","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94234765,0.0011631128,0.0077112503,0.000058257785,0.04090165,0.00020594063,0.000002787604,0.000033458422,0.007575913],"genre_scores_gemma":[0.99547064,0.000020933598,0.0008705129,0.000018793055,0.0034870633,0.000001570733,2.339389e-7,0.000018311917,0.00011192012],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99861264,0.00022959262,0.000482227,0.000049090882,0.00039424072,0.00023217691],"domain_scores_gemma":[0.99869496,0.00035752184,0.00043828125,0.00015759082,0.00019461827,0.00015704309],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014208452,0.00011119091,0.00028994866,0.00009402491,0.000113784256,0.00003703659,0.0001794345,0.000103606355,0.00007131574],"category_scores_gemma":[0.00038917686,0.000078103716,0.0001517485,0.000093235314,0.000041340023,0.00031593238,0.000028139313,0.00021993955,0.000007473653],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000074629264,0.00013476986,0.0015658389,0.00003140342,0.00006930411,0.000006375461,0.0005715694,0.0000039038487,0.0007761277,0.9869388,0.009728015,0.000099306155],"study_design_scores_gemma":[0.0009955118,0.00023397332,0.0007950582,0.00007062711,0.000121074,0.0001993264,0.00015263111,0.000012320571,0.0023651316,0.9815513,0.013356528,0.00014652849],"about_ca_topic_score_codex":0.0000013145952,"about_ca_topic_score_gemma":2.9090856e-8,"teacher_disagreement_score":0.05312303,"about_ca_system_score_codex":0.000055248005,"about_ca_system_score_gemma":0.000029323974,"threshold_uncertainty_score":0.31849772},"labels":[],"label_agreement":null},{"id":"W2592983029","doi":"10.7151/dmgt.1732","title":"On the Erd\\H{o}s-Gyárfás conjecture in claw-free graphs","year":2013,"lang":"en","type":"article","venue":"Discussiones Mathematicae Graph Theory","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Claw; Mathematics; Combinatorics; Conjecture; Biology","score_opus":0.020317075585290206,"score_gpt":0.26123493593084746,"score_spread":0.24091786034555726,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2592983029","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9456529,0.00025677006,0.0017236125,0.006289347,0.00065693934,0.0025495985,0.000040177707,0.0003968111,0.04243383],"genre_scores_gemma":[0.99400395,0.000031558226,0.0021064372,0.0015174954,0.000075943346,0.00056611875,0.000006187105,0.00012848571,0.0015638283],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99592674,0.0008980279,0.0009519682,0.00064657925,0.00075896026,0.00081773335],"domain_scores_gemma":[0.9910004,0.0057042814,0.00035814857,0.0026473599,0.00008934814,0.00020043299],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0020613915,0.00068223436,0.0007803942,0.0005076237,0.0006898651,0.00014528159,0.0017851036,0.00032849875,0.0040520644],"category_scores_gemma":[0.0026662722,0.00030588105,0.0005503695,0.00086428283,0.0007876466,0.00024276858,0.0005219617,0.00085489155,0.00019793378],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000641188,0.00030416486,0.00011077526,0.00015522256,0.00010371377,0.00001131481,0.005872422,0.000003147619,0.00014082798,0.98080266,0.011530186,0.0009014255],"study_design_scores_gemma":[0.0007663604,0.00008960297,0.0010449719,0.00039034724,0.00006181693,0.000028745604,0.0027973664,0.00005182187,0.00037145065,0.99369407,0.00019542634,0.0005080523],"about_ca_topic_score_codex":0.00000775709,"about_ca_topic_score_gemma":0.000010221595,"teacher_disagreement_score":0.048351035,"about_ca_system_score_codex":0.000037078273,"about_ca_system_score_gemma":0.000028148206,"threshold_uncertainty_score":0.9999393},"labels":[],"label_agreement":null},{"id":"W2594427453","doi":"","title":"Weighted Ramsey problem","year":2006,"lang":"en","type":"article","venue":"The Australasian Journal of Combinatorics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Mathematics; Combinatorics; Mathematical economics; Statistics","score_opus":0.015688198503357967,"score_gpt":0.26270673195593686,"score_spread":0.2470185334525789,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2594427453","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97027546,0.00031060365,0.0014853245,0.0015370579,0.0013464736,0.00022904873,0.0000031756692,0.000046025318,0.024766846],"genre_scores_gemma":[0.9956492,0.000018155213,0.0023218642,0.000033347496,0.00032205874,0.0000013082139,4.779555e-7,0.000027569024,0.0016259984],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99832135,0.00016713586,0.00066549145,0.000091007314,0.00046702518,0.00028798485],"domain_scores_gemma":[0.99836665,0.00031322322,0.0006453474,0.00033865432,0.00025330568,0.00008281386],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009105495,0.0001834096,0.00032301014,0.000117462245,0.0002648301,0.00005597016,0.00066801376,0.0001062273,0.00006516274],"category_scores_gemma":[0.00007021419,0.000104998966,0.0002219716,0.0003294602,0.00015208483,0.000141711,0.000064021,0.00055309787,0.0000039944644],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031138436,0.00010949461,0.0011796159,0.000026869822,0.000059517668,0.000041728556,0.0003317464,0.0000068782247,0.00007720633,0.98280936,0.014936007,0.0003904389],"study_design_scores_gemma":[0.0006965764,0.0001607243,0.0019414956,0.000045179382,0.00009861193,0.00040837564,0.00012762197,0.0000075435055,0.0011186318,0.98904145,0.0062284176,0.00012539707],"about_ca_topic_score_codex":0.0000031105023,"about_ca_topic_score_gemma":8.2385765e-7,"teacher_disagreement_score":0.025373776,"about_ca_system_score_codex":0.000052902407,"about_ca_system_score_gemma":0.000052152045,"threshold_uncertainty_score":0.42817336},"labels":[],"label_agreement":null},{"id":"W2603167390","doi":"10.1016/j.disc.2017.01.026","title":"Rainbow Hamilton cycles and lopsidependency","year":2017,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Lemma (botany); Combinatorics; Rainbow; Discrete mathematics; Hamiltonian path; Graph","score_opus":0.04443084468304953,"score_gpt":0.3372585884944339,"score_spread":0.2928277438113844,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2603167390","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9361178,0.0001481528,0.0021587573,0.0002150502,0.00028672122,0.0003212412,0.000025258785,0.00012642772,0.06060057],"genre_scores_gemma":[0.95656633,0.0000926899,0.04140936,0.000055272583,0.00011953123,0.000014066733,0.0000021938758,0.000052684223,0.0016878895],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99871355,0.000035929697,0.00036111337,0.0002748631,0.0003026859,0.00031183148],"domain_scores_gemma":[0.99782586,0.000341549,0.00036118756,0.0013012089,0.000051509516,0.00011870967],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004979707,0.00025970358,0.0003851075,0.00006196312,0.0011506084,0.0002659733,0.0005902122,0.00013429663,0.00009548653],"category_scores_gemma":[0.000924431,0.0001929843,0.00011562007,0.000027155946,0.00037718622,0.0002279716,0.0003519201,0.00019279763,0.000011487171],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000753868,0.00003659507,0.0008153122,0.0003510839,0.00006553648,0.000019781013,0.010581063,2.322988e-7,0.00015277413,0.98608905,0.00053162785,0.0013494123],"study_design_scores_gemma":[0.00035087086,0.000026870368,0.0021687695,0.00012202864,0.00007095413,0.000049437545,0.0011321082,0.0004250785,0.00054111733,0.9943944,0.00043771244,0.0002806224],"about_ca_topic_score_codex":0.000006449906,"about_ca_topic_score_gemma":0.0000129077425,"teacher_disagreement_score":0.058912683,"about_ca_system_score_codex":0.000013897595,"about_ca_system_score_gemma":0.000012334228,"threshold_uncertainty_score":0.8849666},"labels":[],"label_agreement":null},{"id":"W2604316954","doi":"10.37236/7148","title":"A Euclidean Ramsey Result in the Plane","year":2017,"lang":"en","type":"preprint","venue":"The Electronic Journal of Combinatorics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Euclidean geometry; Plane (geometry); Combinatorics; Unit (ring theory); Mathematics; Line (geometry); Euclidean distance; Ramsey theory; Geometry; Mathematics education","score_opus":0.038481450273841096,"score_gpt":0.3276938492511555,"score_spread":0.28921239897731443,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2604316954","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9585782,0.013782088,0.0011037978,0.0060403706,0.0045855106,0.0009634816,0.00001570022,0.00003519615,0.014895616],"genre_scores_gemma":[0.9964374,0.0025191328,0.000028059178,0.00014395498,0.00046976472,0.0000072793687,0.0000022191887,0.000042908297,0.000349307],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99633527,0.00086518395,0.00096584024,0.00020292646,0.00091089995,0.0007198717],"domain_scores_gemma":[0.9942978,0.0016664505,0.002104845,0.0016318859,0.0002422408,0.000056773635],"candidate_categories":["research_integrity"],"consensus_categories":[],"category_scores_codex":[0.00822462,0.00036724945,0.00073335186,0.00018621284,0.00048780613,0.00019374487,0.00429277,0.00034667738,0.000010971857],"category_scores_gemma":[0.0015573892,0.00018270036,0.0003997709,0.00014321276,0.00021026573,0.00007697465,0.0006149709,0.0057951924,0.0000017528786],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015040436,0.000114210576,0.00009301227,0.00007200891,0.00020560037,0.00006140829,0.0035067126,0.000024232073,0.000003851237,0.9914022,0.0039922227,0.00037411126],"study_design_scores_gemma":[0.00089165627,0.00025474516,0.0003267796,0.00021338156,0.0002046296,0.00043990999,0.0003277457,0.000022552947,0.000046228004,0.99074686,0.0063163633,0.00020915254],"about_ca_topic_score_codex":0.00002090527,"about_ca_topic_score_gemma":0.000031615535,"teacher_disagreement_score":0.037859134,"about_ca_system_score_codex":0.0003185408,"about_ca_system_score_gemma":0.00067731756,"threshold_uncertainty_score":0.99649847},"labels":[],"label_agreement":null},{"id":"W2605338013","doi":"10.1142/s1793042117501275","title":"The analog of the Erdös distance problem in finite fields","year":2017,"lang":"en","type":"article","venue":"International Journal of Number Theory","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Finite field; Mathematics; Kloosterman sum; Prime (order theory); Vector space; Field (mathematics); Pure mathematics; Discrete mathematics; Algebra over a field; Combinatorics","score_opus":0.020386345617964152,"score_gpt":0.3301244443810287,"score_spread":0.3097380987630646,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2605338013","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.82587296,0.00038249194,0.006444909,0.0063289916,0.0056336285,0.00029830998,0.0001085814,0.000011342414,0.1549188],"genre_scores_gemma":[0.9976487,0.000060550454,0.0006490026,0.0001158944,0.00021259203,0.0000020294653,2.816428e-7,0.000008613725,0.0013023138],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99876446,0.00016864807,0.00047606585,0.000065939654,0.00041723537,0.00010766011],"domain_scores_gemma":[0.9966531,0.0016932801,0.00096037256,0.00039388228,0.00027594066,0.000023446655],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012780608,0.00008488251,0.00015111845,0.000035237394,0.00023897002,0.00007220849,0.0018068838,0.000054770837,0.00022364264],"category_scores_gemma":[0.0019084088,0.000041831878,0.00018950665,0.000032434564,0.00032363334,0.00014336087,0.000232901,0.00032480096,0.0000013536165],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021825731,0.000042644482,0.014711172,0.000008816623,0.00014666578,0.000018446859,0.00094538846,0.000025462328,0.000015920183,0.97638804,0.002267076,0.0052121035],"study_design_scores_gemma":[0.00035859237,0.000012545737,0.014381935,0.00018158846,0.000014200487,0.000057461584,0.00014816562,0.000028980068,0.0001961454,0.9788515,0.0057186475,0.000050258917],"about_ca_topic_score_codex":0.00000739332,"about_ca_topic_score_gemma":0.00006530413,"teacher_disagreement_score":0.17177579,"about_ca_system_score_codex":0.000032906446,"about_ca_system_score_gemma":0.00004644681,"threshold_uncertainty_score":0.33576697},"labels":[],"label_agreement":null},{"id":"W2605561794","doi":"10.1016/j.jctb.2017.04.002","title":"Rainbow triangles in three-colored graphs","year":2017,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":32,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"National Science Foundation","keywords":"Rainbow; Combinatorics; Flag (linear algebra); Colored; Conjecture; Mathematics; Limit (mathematics); Discrete mathematics; Physics; Algebra over a field; Pure mathematics; Quantum mechanics","score_opus":0.03102249671856014,"score_gpt":0.30305261986703763,"score_spread":0.2720301231484775,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2605561794","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9818338,0.00023292878,0.00006204296,0.00030668956,0.010722444,0.00019692443,0.000004688568,0.000019651114,0.006620786],"genre_scores_gemma":[0.9979662,0.00006302432,0.0010142258,0.00003336302,0.0006805188,0.0000036795527,2.789334e-7,0.000030267194,0.00020850085],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980645,0.00033228353,0.0007743631,0.00013998458,0.00040030497,0.0002885344],"domain_scores_gemma":[0.99697673,0.00081729994,0.0012158955,0.0006545253,0.00022260795,0.000112931695],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003229754,0.00022402934,0.00066057825,0.00023813736,0.00056760025,0.00016477915,0.00109587,0.00019136837,0.0001386018],"category_scores_gemma":[0.0031971924,0.00016526181,0.00032823344,0.00009717693,0.00047977295,0.0006932296,0.00019871778,0.00049037515,0.0000011869116],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002741371,0.00011227477,0.0016544119,0.000028826544,0.00011815428,0.00011274298,0.0010512156,0.0000011540228,0.00013295205,0.9922227,0.0004426914,0.0013815018],"study_design_scores_gemma":[0.003470392,0.00044268067,0.00352319,0.00010072573,0.000056217068,0.00008844148,0.00031886494,0.0000014532985,0.0010120372,0.98887265,0.0019259888,0.00018737727],"about_ca_topic_score_codex":0.0000029835344,"about_ca_topic_score_gemma":0.000013044758,"teacher_disagreement_score":0.016132299,"about_ca_system_score_codex":0.00004988951,"about_ca_system_score_gemma":0.00008470912,"threshold_uncertainty_score":0.67391807},"labels":[],"label_agreement":null},{"id":"W2607184796","doi":"10.1137/1.9781611975062.2","title":"Quicksort Is Optimal For Many Equal Keys","year":2018,"lang":"en","type":"book-chapter","venue":"Society for Industrial and Applied Mathematics eBooks","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Quicksort; Combinatorics; Constant (computer programming); Mathematics; Sorting; Conjecture; Asymptotically optimal algorithm; Upper and lower bounds; Value (mathematics); Discrete mathematics; Sorting algorithm; Algorithm; Computer science; Statistics; Mathematical analysis","score_opus":0.10733605353377489,"score_gpt":0.29628557539750905,"score_spread":0.18894952186373415,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2607184796","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00426251,0.00016965962,0.066551864,0.00018114487,0.0018470018,0.012581714,0.0034740565,0.0005183067,0.91041374],"genre_scores_gemma":[0.00097404857,0.000051175222,0.32037616,0.0007193275,0.0070406366,0.00090658,0.00015270348,0.0006481543,0.6691312],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99712497,0.000004926477,0.0010438854,0.000741159,0.00044797783,0.0006370773],"domain_scores_gemma":[0.9969605,0.0011626804,0.00082222506,0.00067253236,0.00018045769,0.00020160968],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.00095490983,0.00085934094,0.0012987425,0.00007057546,0.0008352665,0.00012726594,0.0004632643,0.0019479572,0.00024332586],"category_scores_gemma":[0.00007695199,0.0007217708,0.0014219998,0.000016864944,0.0006791217,0.000029223334,0.0003516476,0.0006553649,0.0000074981226],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000114319446,0.000026694011,4.468687e-8,0.0009550607,0.00079969736,2.9451854e-7,0.0047300835,1.1742634e-7,0.00004410611,0.888288,0.10138934,0.0036522318],"study_design_scores_gemma":[0.0020876136,0.00022971537,7.2843114e-9,0.00023045322,0.00091178814,0.00000744183,0.00075953716,0.00010424252,0.00081980164,0.84968245,0.1444353,0.0007316745],"about_ca_topic_score_codex":6.989799e-7,"about_ca_topic_score_gemma":7.4231747e-7,"teacher_disagreement_score":0.2538243,"about_ca_system_score_codex":0.00007087724,"about_ca_system_score_gemma":0.000133012,"threshold_uncertainty_score":0.99952334},"labels":[],"label_agreement":null},{"id":"W2609420174","doi":"10.1090/crmp/043/06","title":"Montréal notes on quadratic Fourier analysis","year":2007,"lang":"en","type":"book-chapter","venue":"CRM proceedings & lecture notes","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":31,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Quadratic equation; Fourier transform; Mathematics; Calculus (dental); Mathematical analysis; Geometry; Medicine; Orthodontics","score_opus":0.04223336340490892,"score_gpt":0.28882638684456385,"score_spread":0.24659302343965495,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2609420174","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0051701227,0.002091285,0.009456692,0.00052012224,0.0005884767,0.0008523288,0.000072435214,0.0005100839,0.98073846],"genre_scores_gemma":[0.9861617,0.00017434331,0.0038718244,0.0015321174,0.0022027972,0.000028451444,0.000057068173,0.00039225232,0.005579449],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99630463,0.000010399557,0.00087433134,0.0010495135,0.0010520717,0.0007090271],"domain_scores_gemma":[0.99620837,0.0016392998,0.00079670886,0.00060923514,0.00049901725,0.00024738765],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.00061591784,0.0012016469,0.001582325,0.0012372303,0.00056096155,0.00019922177,0.00061469944,0.0014728896,0.000686533],"category_scores_gemma":[0.0018186454,0.0008901803,0.0011766586,0.00035654445,0.0002609877,0.00010845489,0.00018474407,0.0015826374,0.000057282406],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012994911,0.00003283751,0.00013927984,0.00027002543,0.0020536752,0.000026098818,0.0016461031,0.000019255209,0.00003700308,0.9870035,0.00024397078,0.008398319],"study_design_scores_gemma":[0.0002607027,0.00020955225,0.00006282892,0.00026974478,0.0037277555,0.000021847534,0.000021244015,0.00012140491,0.0008814025,0.98041135,0.013015975,0.0009962003],"about_ca_topic_score_codex":0.000025513447,"about_ca_topic_score_gemma":0.0001343607,"teacher_disagreement_score":0.9809916,"about_ca_system_score_codex":0.0001528054,"about_ca_system_score_gemma":0.000049498143,"threshold_uncertainty_score":0.9998234},"labels":[],"label_agreement":null},{"id":"W2611912062","doi":"10.1002/jgt.22579","title":"Generating simple near‐bipartite bricks","year":2020,"lang":"en","type":"preprint","venue":"Journal of Graph Theory","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Fundação de Apoio ao Desenvolvimento do Ensino, Ciência e Tecnologia do Estado de Mato Grosso do Sul; University of Waterloo; Conselho Nacional de Desenvolvimento Científico e Tecnológico","keywords":"Bipartite graph; Combinatorics; Brick; Mathematics; Matching (statistics); Vertex (graph theory); Complete bipartite graph; Simple (philosophy); Class (philosophy); Discrete mathematics; Graph; Computer science","score_opus":0.048188870101523194,"score_gpt":0.3168964226717651,"score_spread":0.2687075525702419,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2611912062","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9492852,0.0038440172,0.03799512,0.000480846,0.0038705359,0.00040743043,0.00007012597,0.00011570735,0.0039310018],"genre_scores_gemma":[0.95779735,0.00025968466,0.038761217,0.0009302613,0.0019831446,0.000006378095,0.0000069125213,0.00012132593,0.00013374943],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9963583,0.00077426195,0.001447909,0.0003505591,0.0006730852,0.00039590785],"domain_scores_gemma":[0.9955205,0.001046555,0.0020778442,0.0006833304,0.00038060496,0.00029119608],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0026968727,0.0004808393,0.0010996698,0.00027733843,0.00040851923,0.00022700494,0.0010593634,0.00042926418,0.00029838525],"category_scores_gemma":[0.0016256148,0.0003709991,0.0011837536,0.0002285723,0.00030064685,0.00012829383,0.0009261116,0.0022382601,0.000004522022],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005372421,0.00015206895,0.00065799215,0.0008052621,0.0017705285,0.00039444125,0.008666281,0.0016559983,0.0014949644,0.94994515,0.0242456,0.009674456],"study_design_scores_gemma":[0.00043839015,0.00013937784,0.00013422221,0.00025835756,0.00038568163,0.00015898849,0.00028907004,0.00038333455,0.0005046381,0.994162,0.0027617323,0.00038420424],"about_ca_topic_score_codex":0.000002996695,"about_ca_topic_score_gemma":0.0000018761114,"teacher_disagreement_score":0.044216834,"about_ca_system_score_codex":0.000053032076,"about_ca_system_score_gemma":0.0002271813,"threshold_uncertainty_score":0.9998742},"labels":[],"label_agreement":null},{"id":"W2614100071","doi":"","title":"Graham's pebbling conjecture on the middle graphs of even cycles.","year":2017,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Conjecture; Mathematics; Combinatorics; Discrete mathematics","score_opus":0.05865490777786407,"score_gpt":0.294526556268843,"score_spread":0.2358716484909789,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2614100071","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9785055,0.0000901723,0.0000037070486,0.00042386889,0.0018390864,0.00024367434,0.000010878705,0.000042078784,0.018841049],"genre_scores_gemma":[0.9993842,0.000019081523,0.00015773883,0.00010889591,0.000017840508,0.000010888482,9.674176e-7,0.000030035742,0.0002703321],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998857,0.00010403351,0.00026628506,0.0002149186,0.00031536628,0.00024238585],"domain_scores_gemma":[0.9973254,0.0007244666,0.00037394871,0.0014387966,0.00008182465,0.000055569886],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056039536,0.00019316691,0.00029532518,0.0000639461,0.0009105914,0.0000685381,0.0009612321,0.00013229133,0.00010452286],"category_scores_gemma":[0.0008671161,0.000119595345,0.00019431111,0.00007077994,0.00033166684,0.000080157566,0.00021344783,0.0003115493,0.000007426656],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002414551,0.00005844412,0.0014905363,0.000040206833,0.00007552019,0.0000048241336,0.0011050774,9.1916576e-7,0.000113468515,0.9945665,0.0022386147,0.0002817653],"study_design_scores_gemma":[0.00052615325,0.00008149555,0.0043196967,0.000097597294,0.000039203045,0.000004073447,0.00016026253,0.000015519923,0.003447323,0.9906896,0.00047164698,0.00014746767],"about_ca_topic_score_codex":0.000021472184,"about_ca_topic_score_gemma":0.000005575767,"teacher_disagreement_score":0.020878734,"about_ca_system_score_codex":0.000015567433,"about_ca_system_score_gemma":0.000021454458,"threshold_uncertainty_score":0.7003625},"labels":[],"label_agreement":null},{"id":"W2618333023","doi":"10.1007/s00373-017-1798-z","title":"Fractional $$K_{4}$$ K 4 -Covers","year":2017,"lang":"en","type":"article","venue":"Graphs and Combinatorics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Combinatorics; Mathematics; Disjoint sets; Graph; Pairwise comparison; Discrete mathematics","score_opus":0.03590228704043262,"score_gpt":0.3080626051655043,"score_spread":0.2721603181250717,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2618333023","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9551798,0.00020319496,0.00019930782,0.0002106907,0.0015297399,0.000102871025,0.000009912017,0.00007150457,0.04249294],"genre_scores_gemma":[0.9987353,0.00015287206,0.00026833353,0.00008328966,0.000032323172,0.000005648285,0.000001140305,0.000013933549,0.0007071526],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99930584,0.000018840212,0.00012976369,0.0001784934,0.0001944219,0.00017266104],"domain_scores_gemma":[0.99909353,0.0001323946,0.00014232632,0.000496075,0.000054208638,0.00008146364],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00018505569,0.00012470155,0.00015693637,0.000057263373,0.0013551845,0.00012430822,0.0002604654,0.000093974726,0.000043578242],"category_scores_gemma":[0.00018597135,0.000103477854,0.00008054529,0.000042346976,0.00017300317,0.00016510139,0.00015364209,0.00016832403,0.0000023219634],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010667213,0.00003240936,0.012683302,0.000015551406,0.000031688258,0.0000061113683,0.00012074388,9.18916e-8,0.000011294524,0.9836492,0.002500633,0.0009383188],"study_design_scores_gemma":[0.00043643045,0.000036341058,0.022279352,0.00000933612,0.000024110619,0.000012218314,0.000053275206,0.000020881802,0.00007472484,0.968858,0.008056957,0.00013835813],"about_ca_topic_score_codex":0.000014589013,"about_ca_topic_score_gemma":0.0000021198696,"teacher_disagreement_score":0.04355547,"about_ca_system_score_codex":0.00001051683,"about_ca_system_score_gemma":0.000011645412,"threshold_uncertainty_score":0.9999449},"labels":[],"label_agreement":null},{"id":"W2621129476","doi":"10.1016/j.jctb.2018.11.006","title":"Balanced independent sets in graphs omitting large cliques","year":2018,"lang":"en","type":"preprint","venue":"Journal of Combinatorial Theory Series B","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"H2020 European Research Council; Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada; Austrian Science Fund","keywords":"Combinatorics; Bipartite graph; Mathematics; Countable set; Conjecture; Discrete mathematics; Partition (number theory); Graph; Homogeneous; Independent set","score_opus":0.020525847306395707,"score_gpt":0.3118381453852428,"score_spread":0.29131229807884707,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2621129476","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96754116,0.0006301661,0.0002774846,0.000092487106,0.026678786,0.00039744197,0.00003975565,0.00006019664,0.0042825006],"genre_scores_gemma":[0.9950855,0.00033363324,0.0024750235,0.00008797781,0.0018094487,0.00001020087,0.0000050858766,0.00008508494,0.00010808968],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99503255,0.0013715499,0.0018331329,0.00037081636,0.0008337867,0.00055815204],"domain_scores_gemma":[0.99498564,0.0010817723,0.0023600906,0.0007381923,0.0006607285,0.00017358913],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0074790632,0.0005547998,0.0014477036,0.0005609231,0.00023876649,0.00014732147,0.0012389829,0.0008404495,0.00022834587],"category_scores_gemma":[0.0020056963,0.00044694796,0.00063998246,0.00021860018,0.000292364,0.00034424383,0.0012782529,0.002351819,0.0000017824581],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0019810237,0.00024058638,0.0021741218,0.00029786973,0.0003385814,0.00013658602,0.0037636845,0.0000043100654,0.00004304671,0.9895995,0.0011178802,0.00030276924],"study_design_scores_gemma":[0.002145272,0.00043713723,0.0008482881,0.00087296613,0.00012377911,0.00010673177,0.0007111244,0.0000048502043,0.0012087593,0.9916353,0.0014608019,0.00044494035],"about_ca_topic_score_codex":0.0000030178562,"about_ca_topic_score_gemma":0.0000067044093,"teacher_disagreement_score":0.027544275,"about_ca_system_score_codex":0.00019067437,"about_ca_system_score_gemma":0.00027644186,"threshold_uncertainty_score":0.9999498},"labels":[],"label_agreement":null},{"id":"W266553198","doi":"10.1007/978-3-642-04016-0_24","title":"The Method of Conditional Expectations","year":2002,"lang":"en","type":"book-chapter","venue":"Algorithms and combinatorics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; University of Toronto; University of New Brunswick","funders":"","keywords":"Monochromatic color; Combinatorics; Mathematics; Discrete mathematics; Algorithm; Computer science; Physics; Optics","score_opus":0.03138488878495698,"score_gpt":0.2907482514235906,"score_spread":0.25936336263863363,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W266553198","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00007285645,0.0077971946,0.01590563,0.00021083554,0.0017060777,0.0005527207,0.00028597846,0.00008643357,0.9733823],"genre_scores_gemma":[0.017966151,0.005517308,0.037393607,0.00012116479,0.0005112552,0.0000658089,0.00007825322,0.0002238113,0.93812263],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998947,0.000031274696,0.00035809728,0.00019787294,0.00032423323,0.00014150364],"domain_scores_gemma":[0.9977565,0.0013680928,0.00029893435,0.00033431072,0.00018547178,0.000056703397],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020687046,0.00022315497,0.00032578243,0.000068883775,0.0004698373,0.000026551214,0.00020491243,0.00022546688,0.00012322221],"category_scores_gemma":[0.000056970064,0.00015399524,0.00014653805,0.000034509118,0.00023481276,0.00003092916,0.00011520144,0.00030244963,0.0000026815433],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000022960076,0.000014868256,0.0000014024032,0.000030983185,0.00013016824,0.000003649339,0.00029446936,1.13969506e-7,3.5692926e-7,0.9892556,0.002961103,0.0073049716],"study_design_scores_gemma":[0.00020954854,0.000058248446,0.000007634963,0.00002627304,0.00010632523,0.000027825166,0.00008159562,0.00015736501,0.00001356782,0.94030935,0.05883349,0.00016880115],"about_ca_topic_score_codex":0.0000014216288,"about_ca_topic_score_gemma":4.950308e-7,"teacher_disagreement_score":0.05587239,"about_ca_system_score_codex":0.000020663754,"about_ca_system_score_gemma":0.000019120573,"threshold_uncertainty_score":0.62797433},"labels":[],"label_agreement":null},{"id":"W2730819323","doi":"10.1016/j.ejc.2017.05.005","title":"Erdős–Ko–Rado for perfect matchings","year":2017,"lang":"hu","type":"article","venue":"European Journal of Combinatorics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":17,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Combinatorics; Mathematics; Algebraic number; Graph; Discrete mathematics","score_opus":0.05007146253368222,"score_gpt":0.3229423109075511,"score_spread":0.2728708483738689,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2730819323","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8741712,0.0037821282,0.014087786,0.0018766373,0.02509122,0.0007443873,0.00007163233,0.000059362465,0.08011565],"genre_scores_gemma":[0.9913107,0.0005196197,0.0028783125,0.00014987397,0.0014895871,7.846312e-7,0.0000011309347,0.00019247361,0.0034575083],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9962949,0.0007495018,0.0013811081,0.0002911213,0.0007029826,0.0005803978],"domain_scores_gemma":[0.9930757,0.0007790971,0.003591623,0.0013548719,0.0008298639,0.00036881352],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0054852064,0.000492632,0.0009252388,0.000220378,0.0022095433,0.00072662573,0.0026260726,0.00011737966,0.00010095984],"category_scores_gemma":[0.0032111506,0.00040310266,0.00089651387,0.000081904065,0.00032989195,0.0004990314,0.0005881195,0.0010662797,0.000033690867],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00041977383,0.00041441072,0.0013778037,0.00073164864,0.0006166265,0.0006803525,0.005480144,0.000007428394,0.00018572163,0.9469059,0.0338941,0.009286077],"study_design_scores_gemma":[0.005607665,0.0021459335,0.0057810484,0.0008869893,0.000764624,0.00057262654,0.000449611,0.00011392718,0.000515532,0.8738875,0.108560555,0.0007140343],"about_ca_topic_score_codex":0.0000011356285,"about_ca_topic_score_gemma":2.446919e-7,"teacher_disagreement_score":0.11713952,"about_ca_system_score_codex":0.00011037421,"about_ca_system_score_gemma":0.000121166006,"threshold_uncertainty_score":0.9998421},"labels":[],"label_agreement":null},{"id":"W2732577140","doi":"10.1016/j.jcta.2019.105185","title":"Exponential bounds for the Erdős-Ginzburg-Ziv constant","year":2020,"lang":"en","type":"preprint","venue":"Journal of Combinatorial Theory Series A","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"European Research Council; Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Subsequence; Mathematics; Conjecture; Abelian group; Constant (computer programming); Partition (number theory); Exponential function; Rank (graph theory); Upper and lower bounds; Discrete mathematics; Bounded function; Mathematical analysis","score_opus":0.044113817173430846,"score_gpt":0.310377205515471,"score_spread":0.26626338834204016,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2732577140","genre_codex":"editorial","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26791808,0.016399058,0.19134875,0.024396187,0.47458553,0.008891961,0.0012782782,0.00057993137,0.014602233],"genre_scores_gemma":[0.98562086,0.0004901782,0.003842643,0.00038057208,0.009070058,0.00005417477,0.0000081290855,0.00014213742,0.0003912618],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9963332,0.0006127581,0.001488253,0.00033122444,0.0007988171,0.0004357624],"domain_scores_gemma":[0.9919891,0.0041098176,0.0021526248,0.00079410034,0.0007430605,0.00021134675],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0034692378,0.00056106376,0.0012965938,0.00014405587,0.00067909755,0.00032524843,0.0016662721,0.00050326664,0.0002294553],"category_scores_gemma":[0.0025273277,0.0003544859,0.0012758164,0.0001382728,0.0007156669,0.00020594281,0.0010616634,0.0017212647,0.0000010208317],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0053531607,0.000095404605,0.000005057951,0.00031088846,0.0012552297,0.000046065277,0.002796056,0.000019015522,0.00016891657,0.97507834,0.014180285,0.0006915942],"study_design_scores_gemma":[0.0018448555,0.0005916696,0.000004584142,0.00022292764,0.0008301543,0.00014666405,0.0012122069,0.0000231114,0.00091004453,0.9288399,0.064999394,0.00037446446],"about_ca_topic_score_codex":0.0000016311285,"about_ca_topic_score_gemma":7.50607e-7,"teacher_disagreement_score":0.71770275,"about_ca_system_score_codex":0.000118507116,"about_ca_system_score_gemma":0.0005231587,"threshold_uncertainty_score":0.9998907},"labels":[],"label_agreement":null},{"id":"W2735150787","doi":"10.4153/s0008439520001010","title":"Plongements polyédraux tendus et nombre chromatique relatif des surfaces à bord","year":2020,"lang":"fr","type":"article","venue":"Canadian Mathematical Bulletin","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Humanities; Mathematics; Combinatorics; Art","score_opus":0.04710387859854432,"score_gpt":0.27368209383436126,"score_spread":0.22657821523581695,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2735150787","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.58145523,0.008478312,0.0044354335,0.18659449,0.0012310239,0.0022834237,0.0010350592,0.00041030682,0.21407671],"genre_scores_gemma":[0.9087794,0.0003900486,0.045397487,0.017460255,0.00063960237,0.000078586076,0.000054151045,0.00035914942,0.026841363],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99539965,0.0006044796,0.0011669286,0.0007674561,0.0005729246,0.0014885445],"domain_scores_gemma":[0.99497163,0.0012092881,0.00029962897,0.0008130715,0.00018463958,0.0025217575],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0009480769,0.0007830056,0.0010320357,0.00018213916,0.0007168216,0.00029290534,0.00090475375,0.0007352672,0.06566286],"category_scores_gemma":[0.0035192943,0.0007432521,0.0003715887,0.0004611867,0.0010574694,0.00016597418,0.00030448518,0.0011276364,0.011150015],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002848579,0.00013795665,0.00026162056,0.0028227298,0.00036840088,0.00043671322,0.015840555,0.000028388067,0.000058616344,0.8522712,0.124672726,0.0030725887],"study_design_scores_gemma":[0.0007946497,0.00026045518,0.0008712513,0.001261953,0.0003351752,0.00013432703,0.0015462012,0.0014954547,0.00015530904,0.66831356,0.3238028,0.0010288561],"about_ca_topic_score_codex":0.0032296132,"about_ca_topic_score_gemma":0.0039498867,"teacher_disagreement_score":0.32732412,"about_ca_system_score_codex":0.00042136217,"about_ca_system_score_gemma":0.0005356936,"threshold_uncertainty_score":0.9995018},"labels":[],"label_agreement":null},{"id":"W2736557199","doi":"10.46298/dmtcs.3437","title":"Chromatic Turán problems and a new upper bound for the Turán density of $\\mathcal{K}_4^-$","year":2005,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Mathematics; Combinatorics; Hypergraph; Graph; Upper and lower bounds; Chromatic scale; Integer (computer science); Discrete mathematics; Mathematical analysis","score_opus":0.02749814079494463,"score_gpt":0.28490334829153824,"score_spread":0.2574052074965936,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2736557199","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33423606,0.00019255967,0.662132,0.0011506082,0.000227765,0.0010568452,0.000011533856,0.000080772894,0.0009118565],"genre_scores_gemma":[0.68710387,0.000013482553,0.31241515,0.00018848962,0.00018682671,0.000020127049,7.465071e-7,0.000027929551,0.00004335764],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972075,0.000071364964,0.0007665519,0.0005379381,0.0007888843,0.00062772917],"domain_scores_gemma":[0.9953771,0.0027792614,0.0003061366,0.0010428947,0.00022093976,0.00027366236],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0023690555,0.0003656998,0.00059047074,0.0001315651,0.00083262095,0.00028229886,0.00126729,0.000117887656,0.000074607815],"category_scores_gemma":[0.0008369365,0.00020906622,0.00021941184,0.0004088802,0.0043850215,0.00025830802,0.00080226426,0.0002535646,0.000004494726],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014784413,0.00007315301,0.00002577103,0.0003422151,0.000043645432,6.486187e-7,0.00842684,0.000021649006,0.0004602685,0.986791,0.00015147729,0.0036485216],"study_design_scores_gemma":[0.0003606337,0.00012915382,0.00013304967,0.00018056958,0.00010941274,0.00006263268,0.00015065276,0.1879961,0.0017555619,0.80874753,0.00013135225,0.00024335802],"about_ca_topic_score_codex":0.0000032284124,"about_ca_topic_score_gemma":0.00000430738,"teacher_disagreement_score":0.3528678,"about_ca_system_score_codex":0.000036244408,"about_ca_system_score_gemma":0.00009052409,"threshold_uncertainty_score":0.99832445},"labels":[],"label_agreement":null},{"id":"W2741373429","doi":"","title":"A construction of a class of graphs with depression three.","year":2014,"lang":"en","type":"article","venue":"Australas. J Comb.","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Combinatorics; Enhanced Data Rates for GSM Evolution; Mathematics; Class (philosophy); Graph; Path (computing); Discrete mathematics; Set (abstract data type); Computer science; Artificial intelligence","score_opus":0.019508305485154705,"score_gpt":0.2614906472667648,"score_spread":0.2419823417816101,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2741373429","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9917773,0.000016894981,0.002483148,0.000023703447,0.00014294,0.00016081912,0.000007269194,0.00003616749,0.005351772],"genre_scores_gemma":[0.9852974,0.0000041828816,0.014593464,0.0000111055715,0.000021231554,0.000005328475,0.000002020181,0.00001659987,0.000048684375],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990476,0.00006502291,0.00031799602,0.00016630472,0.00024319503,0.00015991794],"domain_scores_gemma":[0.9988572,0.0002582767,0.00030005857,0.00042775986,0.00010624049,0.00005044663],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021512168,0.0001399006,0.00032136246,0.00010301174,0.00006612621,0.0000055591327,0.00018057201,0.000110623216,0.000071307026],"category_scores_gemma":[0.00008105615,0.000095831325,0.00009173649,0.00017047786,0.0003714523,0.00006468023,0.00005306916,0.0001428882,6.6403845e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011568226,0.00006065033,0.099392235,0.00018553439,0.00007901951,8.6988706e-7,0.00023295941,0.000010710788,0.001485904,0.8941743,0.00023404456,0.0040281257],"study_design_scores_gemma":[0.0009141134,0.0002837489,0.029049614,0.0001856672,0.00010242035,0.000036731282,0.00011003257,0.000116924486,0.022666976,0.9461534,0.0002279832,0.0001523595],"about_ca_topic_score_codex":0.000021460175,"about_ca_topic_score_gemma":0.00003075064,"teacher_disagreement_score":0.07034262,"about_ca_system_score_codex":0.0000060266866,"about_ca_system_score_gemma":0.0000151777,"threshold_uncertainty_score":0.3907888},"labels":[],"label_agreement":null},{"id":"W2742569245","doi":"10.1016/j.endm.2017.06.067","title":"The codegree threshold of<mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.gif\" overflow=\"scroll\"><mml:msubsup><mml:mrow><mml:mi>K</mml:mi></mml:mrow><mml:mrow><mml:mn>4</mml:mn></mml:mrow><mml:mrow><mml:mo>−</mml:mo></mml:mrow></mml:msubsup></mml:math>","year":2017,"lang":"lv","type":"article","venue":"Electronic Notes in Discrete Mathematics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"H2020 European Research Council; Engineering and Physical Sciences Research Council; Schweizerischer Nationalfonds zur Förderung der Wissenschaftlichen Forschung","keywords":"Combinatorics; Tournament; Conjecture; Mathematics; Graph; Vertex (graph theory); Discrete mathematics","score_opus":0.020446806103293816,"score_gpt":0.2575681564522261,"score_spread":0.23712135034893228,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2742569245","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46942258,0.0034227192,0.0019036914,0.00083249965,0.0028213141,0.00012381325,0.00048539197,0.0002876297,0.5207004],"genre_scores_gemma":[0.9827391,0.003930768,0.005415565,0.0010521944,0.0025025858,0.0013960629,0.0006784422,0.0015111996,0.0007740745],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.98388743,0.00074602617,0.003732071,0.0025354652,0.004273519,0.004825457],"domain_scores_gemma":[0.9820335,0.005382974,0.004851809,0.006135985,0.0003338011,0.0012619308],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science","research_integrity","insufficient_payload"],"consensus_categories":["metaepi_narrow","sts","research_integrity","insufficient_payload"],"category_scores_codex":[0.005241715,0.0017325581,0.0008526125,0.00075212517,0.00375229,0.0026817254,0.0061123744,0.0038189858,0.31080264],"category_scores_gemma":[0.006664936,0.0028040656,0.0033313937,0.001353796,0.004332877,0.0018892499,0.0045096986,0.0039404733,0.0014048988],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014672831,0.00047722357,0.000023964787,0.0028665324,0.0030701298,0.00080652663,0.0053943926,0.0010226887,0.0014507532,0.8268029,0.15439603,0.0022215596],"study_design_scores_gemma":[0.0030602373,0.0021783374,0.00008759742,0.0029674515,0.002995797,0.0016457433,0.0031494545,0.108831786,0.85911363,0.010089616,0.0030880356,0.0027922967],"about_ca_topic_score_codex":0.0010075399,"about_ca_topic_score_gemma":0.0026675256,"teacher_disagreement_score":0.8576629,"about_ca_system_score_codex":0.000057048925,"about_ca_system_score_gemma":0.0026867532,"threshold_uncertainty_score":0.99954206},"labels":[],"label_agreement":null},{"id":"W2743005347","doi":"10.1016/j.ejc.2018.10.008","title":"Cycle reversions and dichromatic number in tournaments","year":2018,"lang":"en","type":"preprint","venue":"European Journal of Combinatorics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Nemzeti Kutatási Fejlesztési és Innovációs Hivatal; Austrian Science Fund; Pacific Institute for the Mathematical Sciences","keywords":"Tournament; Reversing; Conjecture; Mathematics; Sequence (biology); Combinatorics; Finite set; Discrete mathematics; Mathematical analysis; Biology; Genetics; Engineering","score_opus":0.02735657926617593,"score_gpt":0.29884590660661003,"score_spread":0.27148932734043413,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2743005347","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9768851,0.00032715034,0.0004143808,0.00012919641,0.0025092268,0.00012644191,0.0000052445384,0.000015080956,0.019588185],"genre_scores_gemma":[0.9954432,0.00039245802,0.0035124375,0.00007962175,0.00024342969,4.3339995e-7,7.9592587e-7,0.000060698534,0.0002669035],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99741906,0.000812414,0.00093243533,0.00018348118,0.00043228394,0.00022031229],"domain_scores_gemma":[0.9978461,0.00028533489,0.0010732121,0.00041266636,0.00021617462,0.00016650787],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021889608,0.00025960695,0.0005550213,0.00021457385,0.00012758904,0.00007591148,0.0006096181,0.00009541149,0.00009376285],"category_scores_gemma":[0.0006763897,0.00021169234,0.00016826022,0.00013898403,0.00013004223,0.000093152696,0.0010239843,0.0011222409,0.000010006937],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00043622113,0.0023277092,0.068693005,0.003963299,0.0017917762,0.0077105956,0.032677233,0.000090315785,0.00009077889,0.6869914,0.18938218,0.0058455016],"study_design_scores_gemma":[0.0010578162,0.00013691334,0.007315637,0.0009815928,0.000113826805,0.0002647431,0.00011429313,0.000029140921,0.000016572174,0.98799026,0.0017417817,0.00023743638],"about_ca_topic_score_codex":0.000001060186,"about_ca_topic_score_gemma":3.215357e-7,"teacher_disagreement_score":0.30099887,"about_ca_system_score_codex":0.00010265882,"about_ca_system_score_gemma":0.000054363496,"threshold_uncertainty_score":0.86325634},"labels":[],"label_agreement":null},{"id":"W2743143360","doi":"10.1007/s00454-018-0027-8","title":"Lower Bounds for the Measurable Chromatic Number of the Hyperbolic Plane","year":2018,"lang":"en","type":"article","venue":"Discrete & Computational Geometry","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Lady Davis Fellowship Trust, Hebrew University of Jerusalem; European Research Council","keywords":"Mathematics; Chromatic scale; Hyperbolic geometry; Combinatorics; Euclidean geometry; Vertex (graph theory); Graph; Plane (geometry); Upper and lower bounds; Hyperbolic triangle; Euclidean distance; Geometry; Mathematical analysis; Algebraic geometry","score_opus":0.02733506430932519,"score_gpt":0.3130590862465464,"score_spread":0.2857240219372212,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2743143360","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9740372,0.00016443407,0.017485483,0.00038833334,0.0010905236,0.00049535243,0.00011301836,0.00003786113,0.006187814],"genre_scores_gemma":[0.992592,0.0000025048396,0.006281013,0.00030459338,0.00030130238,0.00002306031,0.000010851829,0.000025188065,0.00045949113],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998766,0.000063735555,0.0003256683,0.00017117195,0.00045706407,0.00021635412],"domain_scores_gemma":[0.99741864,0.0017229847,0.00019695827,0.00039496247,0.00023063867,0.0000357884],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045936552,0.00015030026,0.00021172516,0.000048579514,0.0005791867,0.000038536586,0.00046854423,0.00006497873,0.00030946173],"category_scores_gemma":[0.00043469813,0.00007809893,0.00020112668,0.00036028013,0.00046424108,0.00006245101,0.00012542817,0.000114862385,0.000013239168],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000117029675,0.000090208945,0.0045735836,0.0002066572,0.00042273043,6.1457695e-7,0.0015603788,0.00070748036,0.0000931212,0.98235095,0.008301556,0.0015756701],"study_design_scores_gemma":[0.00046753202,0.00005898414,0.022461554,0.000057179484,0.000102554426,0.000024073546,0.00015895462,0.005910611,0.00027563068,0.966902,0.0034249476,0.0001559523],"about_ca_topic_score_codex":0.000010059529,"about_ca_topic_score_gemma":0.0000043661203,"teacher_disagreement_score":0.018554814,"about_ca_system_score_codex":0.000021383037,"about_ca_system_score_gemma":0.00005148916,"threshold_uncertainty_score":0.44546947},"labels":[],"label_agreement":null},{"id":"W2745779757","doi":"10.1016/j.ejc.2018.04.007","title":"Ramsey-nice families of graphs","year":2018,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Freie Universität Berlin; Israel Science Foundation; Tel Aviv University; German-Israeli Foundation for Scientific Research and Development","keywords":"Mathematics; Combinatorics; Nice; Discrete mathematics; Computer science","score_opus":0.027906012423889768,"score_gpt":0.2779638504698694,"score_spread":0.2500578380459796,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2745779757","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9348226,0.0003318108,0.0015890496,0.000034392833,0.0019077822,0.000049818656,0.0000023786,0.000018670575,0.061243463],"genre_scores_gemma":[0.9972696,0.00013839618,0.0021359536,0.000047290207,0.0001966895,8.280168e-8,1.583881e-7,0.00003583495,0.00017603849],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99819964,0.0004346569,0.00070872204,0.00009012707,0.0003950246,0.00017182081],"domain_scores_gemma":[0.99784505,0.0002965592,0.0007776133,0.00033180887,0.00065195985,0.000096978765],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016780816,0.00014352436,0.00035266904,0.00021076138,0.00012994769,0.000018250168,0.000579712,0.000030077412,0.00004817957],"category_scores_gemma":[0.00061692833,0.00010725806,0.00020825911,0.0003121169,0.0002781983,0.00011172337,0.00013176117,0.00026902594,0.000006395897],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000076725264,0.000120479155,0.0015591494,0.00005920617,0.000109580884,0.00006124794,0.0025320926,6.4906646e-7,0.0003384405,0.98902404,0.003883618,0.0022347728],"study_design_scores_gemma":[0.0010413466,0.0010375562,0.0040392377,0.000112039146,0.000088105095,0.0000904572,0.000603566,0.0000054206225,0.0027919058,0.9791909,0.010842722,0.00015674152],"about_ca_topic_score_codex":3.8126936e-7,"about_ca_topic_score_gemma":2.3172097e-7,"teacher_disagreement_score":0.062446922,"about_ca_system_score_codex":0.000015716154,"about_ca_system_score_gemma":0.000028348337,"threshold_uncertainty_score":0.43738568},"labels":[],"label_agreement":null},{"id":"W2749343700","doi":"10.1007/s00373-018-1907-7","title":"A Meyniel-Type Condition for Bipancyclicity in Balanced Bipartite Digraphs","year":2018,"lang":"en","type":"article","venue":"Graphs and Combinatorics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Digraph; Bipartite graph; Order (exchange); Strongly connected component; Directed graph; Complete bipartite graph","score_opus":0.03134306007140081,"score_gpt":0.3202403442278282,"score_spread":0.2888972841564274,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2749343700","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9964691,0.00027380482,0.00025034635,0.000050056122,0.0008486085,0.00035791445,0.000019411476,0.0000792642,0.0016515225],"genre_scores_gemma":[0.9989557,0.00016339285,0.00054005714,0.00012512229,0.00004107938,0.000041111838,0.000008209832,0.000021225302,0.00010407066],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989472,0.000045933743,0.00027796515,0.00027415698,0.00014297802,0.0003117887],"domain_scores_gemma":[0.9991417,0.0002551696,0.000107004234,0.00026975828,0.00014438904,0.00008198844],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031051217,0.00017608388,0.0002791719,0.00021050443,0.00028003746,0.000033289496,0.0001433099,0.00013825817,0.000018106273],"category_scores_gemma":[0.00017031262,0.00015059582,0.000084317646,0.00058354525,0.00020047199,0.000099509016,0.00005865867,0.00012660441,0.0000011235746],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000075763266,0.00008063454,0.019497834,0.00006723343,0.00002571262,0.0000015210506,0.00066378084,8.9670245e-8,0.00017181532,0.9774439,0.0013824147,0.000589299],"study_design_scores_gemma":[0.0010795691,0.00031985788,0.013063464,0.000036094225,0.000028527922,0.0000040015784,0.000093168324,0.00014791432,0.0007281124,0.98128414,0.0030115275,0.00020362338],"about_ca_topic_score_codex":0.000012840496,"about_ca_topic_score_gemma":0.00003108901,"teacher_disagreement_score":0.00643437,"about_ca_system_score_codex":0.000014348239,"about_ca_system_score_gemma":0.000013577234,"threshold_uncertainty_score":0.61411196},"labels":[],"label_agreement":null},{"id":"W2751658478","doi":"10.1017/s0963548320000620","title":"Full rainbow matchings in graphs and hypergraphs","year":2021,"lang":"en","type":"article","venue":"Combinatorics Probability Computing","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Rainbow; Counterexample; Conjecture; Generalization; Matching (statistics); Bounded function; Simple (philosophy)","score_opus":0.028745771658093888,"score_gpt":0.2781035584465096,"score_spread":0.2493577867884157,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2751658478","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99577385,0.00056820444,0.00038595076,0.00020166514,0.00059650035,0.00026889748,0.0000021590402,0.00015601216,0.0020467462],"genre_scores_gemma":[0.9895587,0.000025321064,0.010218223,0.000106352396,0.000018987124,0.0000047810304,0.0000026782036,0.000027611957,0.00003733472],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978734,0.00030203315,0.00054986466,0.0005775403,0.0002737857,0.0004233344],"domain_scores_gemma":[0.99795437,0.0010326394,0.000144523,0.0005708437,0.00018292449,0.00011468904],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013805673,0.00025310312,0.00045256704,0.00014142085,0.00034936282,0.00007415094,0.00025573932,0.00015914696,0.000012979504],"category_scores_gemma":[0.0012447591,0.0002470283,0.00012642557,0.0007688041,0.00017666994,0.000100583864,0.0006166239,0.0004878402,7.9546635e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014781876,0.00018328488,0.035720576,0.00030872173,0.000020450983,0.000030341651,0.0020456898,0.000008431703,0.00013092611,0.9589866,0.000054025248,0.0024962148],"study_design_scores_gemma":[0.00067022134,0.00004936538,0.009498664,0.00008495265,0.000015611875,0.000064161875,0.00020116745,0.00071480626,0.00025950006,0.98806083,0.00011018254,0.00027050634],"about_ca_topic_score_codex":0.0000108826525,"about_ca_topic_score_gemma":0.000013675135,"teacher_disagreement_score":0.029074304,"about_ca_system_score_codex":0.00007639457,"about_ca_system_score_gemma":0.000057210047,"threshold_uncertainty_score":0.9999982},"labels":[],"label_agreement":null},{"id":"W2751759068","doi":"10.1016/j.disc.2018.09.013","title":"A lower bound on the size of an absorbing set in an arc-coloured tournament","year":2018,"lang":"en","type":"preprint","venue":"Discrete Mathematics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal; McGill University","funders":"","keywords":"Tournament; Combinatorics; Vertex (graph theory); Monochromatic color; Mathematics; Integer (computer science); Upper and lower bounds; Arc (geometry); Path (computing); Discrete mathematics; Physics; Graph; Computer science; Geometry; Optics; Mathematical analysis","score_opus":0.054529297375144684,"score_gpt":0.3354209737109293,"score_spread":0.28089167633578466,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2751759068","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99220717,0.000043149234,0.00034997828,0.00018470528,0.0006347355,0.0012000755,0.00016285804,0.00007111479,0.005146225],"genre_scores_gemma":[0.9823587,0.000029156792,0.016728645,0.00018339323,0.00026334703,0.00009613016,0.000022551805,0.00012925643,0.00018879809],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9965701,0.00038862095,0.0011913447,0.00056545105,0.0007898508,0.00049461063],"domain_scores_gemma":[0.9946589,0.001569616,0.001007441,0.0024611263,0.00016177559,0.00014115703],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0021021175,0.0006093667,0.0009913832,0.0001745753,0.00023038939,0.00018758228,0.0014188039,0.00046852647,0.00043909176],"category_scores_gemma":[0.0011983548,0.000384834,0.00032943935,0.00015942285,0.0004111184,0.00009843955,0.0008665699,0.001005481,0.00000662913],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029777078,0.0013550451,0.00015526665,0.002703146,0.00045540548,0.00006910361,0.08568115,0.00017186916,0.00046516905,0.90666944,0.0016747903,0.00030185527],"study_design_scores_gemma":[0.00037877573,0.00037820832,0.0002155112,0.0012615641,0.00014130514,0.000010401143,0.0029776152,0.0041435957,0.0009264466,0.98902273,0.000069113594,0.00047473723],"about_ca_topic_score_codex":0.000017018301,"about_ca_topic_score_gemma":0.000078665274,"teacher_disagreement_score":0.08270353,"about_ca_system_score_codex":0.00012508972,"about_ca_system_score_gemma":0.00009605356,"threshold_uncertainty_score":0.99986035},"labels":[],"label_agreement":null},{"id":"W2754950191","doi":"10.1016/j.tcs.2017.09.007","title":"Finding modes with equality comparisons","year":2017,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Sorting; Mathematics; Element (criminal law); Generalization; Maximal element; Equivalence (formal languages); Combinatorics; Set (abstract data type); Upper and lower bounds; Contrast (vision); Order (exchange); Discrete mathematics; Algorithm; Computer science","score_opus":0.07704094708051623,"score_gpt":0.36278967107923105,"score_spread":0.2857487239987148,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2754950191","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45160964,0.0000036851168,0.5196603,0.00021767478,0.0001800768,0.00009333652,0.0000022537497,0.00006940876,0.028163627],"genre_scores_gemma":[0.86696506,6.0305626e-7,0.13282526,0.000090520625,0.00009224099,0.0000023157713,1.4649896e-7,0.000008320432,0.000015531221],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99845135,0.000069692316,0.0001776269,0.00038347204,0.00050230225,0.00041554877],"domain_scores_gemma":[0.9979968,0.00037158016,0.00012827759,0.0012356951,0.00009995555,0.0001676579],"candidate_categories":["sts"],"consensus_categories":["sts"],"category_scores_codex":[0.0015138929,0.00014848517,0.0002296454,0.000059920025,0.0027305915,0.00044138962,0.0017440034,0.000041500254,0.000060804123],"category_scores_gemma":[0.0002635322,0.000092695715,0.00004778634,0.00010564354,0.0077400515,0.00029378443,0.0009125005,0.00019657722,0.0000064775054],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021187621,0.00002698658,0.0010785928,0.000011489829,0.000006510986,0.000004170142,0.00039283506,0.000013730177,0.0000602774,0.99648595,0.00005470655,0.0018435938],"study_design_scores_gemma":[0.00019833304,0.0000874767,0.004216654,0.00004184355,0.000012385839,0.000017556567,0.000020280804,0.037189536,0.0017909572,0.9562132,0.000036003905,0.00017581623],"about_ca_topic_score_codex":0.0000033678364,"about_ca_topic_score_gemma":0.0000016910992,"teacher_disagreement_score":0.4153554,"about_ca_system_score_codex":0.000023601802,"about_ca_system_score_gemma":0.00004015346,"threshold_uncertainty_score":0.9985677},"labels":[],"label_agreement":null},{"id":"W2761467137","doi":"10.48550/arxiv.1710.03815","title":"Stability and exact Turan numbers for matroids","year":2017,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Bounding overwatch; Matroid; Combinatorics; Upper and lower bounds; Term (time); Type (biology); Class (philosophy); Set (abstract data type); Stability (learning theory); Discrete mathematics; Mathematical analysis; Physics","score_opus":0.1444889869290199,"score_gpt":0.24424012400229156,"score_spread":0.09975113707327166,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2761467137","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97830653,0.000058763282,0.012213893,0.000040354214,0.0006387212,0.00070202776,0.00018311151,0.000119438046,0.00773718],"genre_scores_gemma":[0.9969202,0.000106457075,0.001565041,0.000021863261,0.000118282864,0.0000020867533,0.00001549953,0.000037763064,0.0012128073],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985222,0.000102150036,0.00019680355,0.00079580466,0.00006619355,0.00031680518],"domain_scores_gemma":[0.99749047,0.0004773801,0.00033537246,0.0014241054,0.00012452102,0.00014815421],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00048118067,0.0003439973,0.0004927669,0.000087889995,0.00055182865,0.000088529276,0.0007284053,0.00040934552,0.0000909214],"category_scores_gemma":[0.00029551057,0.0003379042,0.00031068208,0.000044320223,0.00040377982,0.00013300218,0.0010073171,0.0004651016,0.0000021244107],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025598536,0.000060429888,0.00863352,0.001007145,0.0002733984,0.000036837057,0.0007876636,0.000110620436,0.000027239326,0.9876859,0.00080803584,0.00031319013],"study_design_scores_gemma":[0.0006552187,0.00003931963,0.0013764811,0.000076450015,0.00026862015,0.000004099807,0.00023874546,0.0023689824,0.00011821793,0.99376523,0.0006776003,0.00041101038],"about_ca_topic_score_codex":0.00005850557,"about_ca_topic_score_gemma":0.0000674785,"teacher_disagreement_score":0.018613689,"about_ca_system_score_codex":0.00010018058,"about_ca_system_score_gemma":0.00006422408,"threshold_uncertainty_score":0.9999073},"labels":[],"label_agreement":null},{"id":"W2762627162","doi":"10.1017/s1446788718000319","title":"THE DISTRIBUTION OF THE NUMBER OF SUBGROUPS OF THE MULTIPLICATIVE GROUP","year":2018,"lang":"en","type":"preprint","venue":"Journal of the Australian Mathematical Society","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge; University of British Columbia","funders":"","keywords":"Mathematics; Isomorphism (crystallography); Combinatorics; Multiplicative function; Group (periodic table); Distribution (mathematics); Limit (mathematics); Binary logarithm; Function (biology); Discrete mathematics; Mathematical analysis; Physics; Crystallography","score_opus":0.03660497737938606,"score_gpt":0.32808650886429935,"score_spread":0.2914815314849133,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2762627162","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99262136,0.000059067297,0.0018673989,0.0026991032,0.0011226275,0.00090054824,0.00026076945,0.0000083907735,0.0004607561],"genre_scores_gemma":[0.9946906,0.00005263939,0.0042190654,0.000041123956,0.00025867822,0.000009902365,0.0000012439531,0.000034756842,0.0006919836],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9955743,0.00067430566,0.001932567,0.00020800086,0.0012729992,0.000337819],"domain_scores_gemma":[0.99043053,0.0019261482,0.0050153052,0.0018629469,0.0006859723,0.00007908707],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0030670625,0.00037764577,0.0009396569,0.000010822249,0.00047937958,0.00003901707,0.003434718,0.00049869047,0.000097307],"category_scores_gemma":[0.0020199683,0.0001362233,0.0031709236,0.00030045607,0.002772445,0.000059717517,0.0019720274,0.0016445997,0.0000013245163],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017470754,0.00092359347,0.009172036,0.0036190846,0.0029953944,5.7366617e-7,0.014481179,0.00005757935,0.0015581815,0.92113996,0.045545366,0.00033233155],"study_design_scores_gemma":[0.00036874184,0.00003604873,0.017476624,0.0014184092,0.0007004769,0.000050624083,0.001234167,0.0001427573,0.0076845675,0.97039354,0.00033651583,0.00015751648],"about_ca_topic_score_codex":0.000009564207,"about_ca_topic_score_gemma":0.0000022721872,"teacher_disagreement_score":0.04925358,"about_ca_system_score_codex":0.00014852437,"about_ca_system_score_gemma":0.00012500594,"threshold_uncertainty_score":0.9999414},"labels":[],"label_agreement":null},{"id":"W2770029606","doi":"10.1016/j.disc.2017.10.015","title":"A result in asymmetric Euclidean Ramsey theory","year":2017,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Mathematics; Combinatorics; Euclidean geometry; Euclidean distance; Euclidean space; Euclidean distance matrix; Ramsey theory; Space (punctuation); Discrete mathematics; Geometry; Computer science","score_opus":0.04576559176547989,"score_gpt":0.34275639981443695,"score_spread":0.29699080804895706,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2770029606","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6106594,0.00022225855,0.00882862,0.00042110952,0.0007302254,0.0009271059,0.000058751008,0.00023491382,0.3779176],"genre_scores_gemma":[0.9665429,0.000041609655,0.03078537,0.00009091415,0.0001381013,0.000029710485,0.000004306976,0.00007889318,0.0022882079],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99780345,0.00015519092,0.00071824226,0.00036962554,0.0004433992,0.00051011756],"domain_scores_gemma":[0.9958269,0.0012566681,0.0005852728,0.002134747,0.00007151001,0.00012493109],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002217683,0.0003363959,0.000579193,0.00030013383,0.00071034965,0.00024675363,0.0012655356,0.00020201861,0.00011270597],"category_scores_gemma":[0.006793545,0.00025414806,0.00021745695,0.00019888804,0.00032358247,0.00024532274,0.00054551114,0.00040285254,0.000037885162],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000033572058,0.00009586946,0.0008376674,0.00021812179,0.000051227616,0.00003761447,0.003755117,0.0000012189807,0.000028430795,0.9909989,0.00062744913,0.003314793],"study_design_scores_gemma":[0.0007770616,0.0000389339,0.0024192827,0.00020062023,0.000055657052,0.00001963767,0.0009112309,0.00048670822,0.00036116355,0.9938516,0.000530352,0.0003477434],"about_ca_topic_score_codex":0.0000137078405,"about_ca_topic_score_gemma":0.0000268768,"teacher_disagreement_score":0.3756294,"about_ca_system_score_codex":0.000050859373,"about_ca_system_score_gemma":0.000028220815,"threshold_uncertainty_score":0.99999106},"labels":[],"label_agreement":null},{"id":"W2779754907","doi":"10.4153/s0008414x19000440","title":"The Genus of a Random Bipartite Graph","year":2019,"lang":"en","type":"article","venue":"Canadian Journal of Mathematics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Bipartite graph; Complete bipartite graph; Random graph; Edge-transitive graph; Genus; Random regular graph","score_opus":0.018401718599985004,"score_gpt":0.24565363443766916,"score_spread":0.22725191583768417,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2779754907","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99168926,0.0011812487,0.0010485365,0.00017607275,0.00081647304,0.00021853382,0.000012251818,0.0000047881304,0.004852806],"genre_scores_gemma":[0.9928489,0.000063750456,0.006457493,0.000047031695,0.00008831568,0.0000012718693,1.8981004e-7,0.000026082349,0.00046697046],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998593,0.00007421766,0.0007275088,0.00006457479,0.00026816447,0.0002725416],"domain_scores_gemma":[0.9973094,0.001076359,0.00067910884,0.0004201333,0.00026147187,0.00025351558],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013516294,0.00012982968,0.000402174,0.00019248184,0.00018963811,0.000039732295,0.00052270223,0.00007542453,0.00014132564],"category_scores_gemma":[0.0008517443,0.00007574884,0.00026950767,0.00018169015,0.00019074992,0.000067834895,0.000020548188,0.00022615802,0.000007689995],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000042092153,0.000035618927,0.0023878363,0.00034899614,0.00036284546,0.00003909371,0.0069735483,0.000039676623,0.00016783632,0.9811892,0.0064775413,0.0019357068],"study_design_scores_gemma":[0.0010607755,0.000118246906,0.00020859296,0.00023760671,0.00012108381,0.00027135835,0.001541464,0.00012067835,0.0007288079,0.9820654,0.013382429,0.00014358207],"about_ca_topic_score_codex":0.000058135607,"about_ca_topic_score_gemma":0.001052039,"teacher_disagreement_score":0.0069048884,"about_ca_system_score_codex":0.000032067583,"about_ca_system_score_gemma":0.0003129639,"threshold_uncertainty_score":0.30889478},"labels":[],"label_agreement":null},{"id":"W2781906402","doi":"10.1016/j.jcta.2018.08.003","title":"A bound on the inducibility of cycles","year":2018,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":25,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Engineering and Physical Sciences Research Council; Natural Sciences and Engineering Research Council of Canada; Horizon 2020 Framework Programme","keywords":"Combinatorics; Graph; Vertex (graph theory); Mathematics; Physics","score_opus":0.036263694401268004,"score_gpt":0.30648365309322384,"score_spread":0.2702199586919558,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2781906402","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9863007,0.000058969756,0.00005199687,0.0003035029,0.0049160025,0.0001206796,0.00000469461,0.000009926958,0.008233538],"genre_scores_gemma":[0.99836737,0.00001258342,0.00027220108,0.0000911742,0.0011410597,0.0000012087506,8.0919605e-8,0.000016279248,0.00009803467],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981301,0.00057397183,0.0006122405,0.00010601287,0.00041480327,0.00016287848],"domain_scores_gemma":[0.9963839,0.001856891,0.00072087155,0.00052596326,0.0004540894,0.000058262132],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003855247,0.00014687203,0.0003819683,0.000079236146,0.00027896915,0.00003214126,0.0005279239,0.00010354129,0.00030981077],"category_scores_gemma":[0.0027057969,0.00007898911,0.0002243786,0.00015997243,0.00090153713,0.00015801654,0.00010977353,0.00033425255,0.0000014298406],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0018359905,0.0001262527,0.000104460756,0.0000211914,0.00012998123,0.0000036015488,0.0024812026,1.6299653e-7,0.0005483636,0.9931224,0.0011577689,0.00046862086],"study_design_scores_gemma":[0.0005209668,0.0012654484,0.0003669938,0.00007443781,0.000050576764,0.000038233607,0.0008883923,4.1493365e-7,0.021433884,0.9727571,0.0025200946,0.00008347146],"about_ca_topic_score_codex":0.0000010428357,"about_ca_topic_score_gemma":8.233324e-7,"teacher_disagreement_score":0.020885522,"about_ca_system_score_codex":0.00003085095,"about_ca_system_score_gemma":0.00007694163,"threshold_uncertainty_score":0.3392211},"labels":[],"label_agreement":null},{"id":"W2783285849","doi":"10.5539/jmr.v10n1p110","title":"Edge-Maximal Graphs Containing No $r$ Vertex-Disjoint Triangles","year":2017,"lang":"en","type":"article","venue":"Journal of Mathematics Research","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Combinatorics; Mathematics; Omega; Disjoint sets; Vertex (graph theory); Graph; Upper and lower bounds; Discrete mathematics; Physics","score_opus":0.21902474092086516,"score_gpt":0.44973049664225856,"score_spread":0.2307057557213934,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2783285849","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.93047464,0.00042232405,0.0013409113,0.0006786522,0.0015002664,0.00046699742,0.0000117007,0.000032634398,0.06507189],"genre_scores_gemma":[0.9606971,0.0001801059,0.037188195,0.00002349909,0.00045265764,0.000007182539,4.0005702e-7,0.00006242571,0.0013884209],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99591815,0.00033013194,0.0011388628,0.00020120654,0.0017709497,0.0006407232],"domain_scores_gemma":[0.99283737,0.0028297012,0.0011952374,0.0012053599,0.0016430198,0.0002893245],"candidate_categories":["metaresearch","sts"],"consensus_categories":[],"category_scores_codex":[0.010041683,0.0002400409,0.00077785883,0.0005462099,0.0015675154,0.00046943608,0.0018292414,0.0001934875,0.0003844468],"category_scores_gemma":[0.017327348,0.00016569579,0.00044964193,0.00012754834,0.0006396989,0.0004015853,0.000609613,0.0012924529,0.000044942528],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033774675,0.00048890465,0.00055718585,0.0005764154,0.00038472496,0.00032117387,0.0045576445,0.0000012943902,0.0014097356,0.9714773,0.015781559,0.004106291],"study_design_scores_gemma":[0.0014481825,0.0006094509,0.0004713287,0.00055388245,0.00005869477,0.0003090121,0.0017626405,0.00032814106,0.0011633473,0.9909628,0.0021369988,0.00019553087],"about_ca_topic_score_codex":0.0000075336807,"about_ca_topic_score_gemma":0.000006941196,"teacher_disagreement_score":0.063683465,"about_ca_system_score_codex":0.000099543686,"about_ca_system_score_gemma":0.00019822411,"threshold_uncertainty_score":0.9997323},"labels":[],"label_agreement":null},{"id":"W2789246618","doi":"10.1007/s00454-020-00213-z","title":"Almost All String Graphs are Intersection Graphs of Plane Convex Sets","year":2020,"lang":"en","type":"preprint","venue":"Discrete & Computational Geometry","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Ministry of Education and Science of the Russian Federation; Austrian Science Fund; Schweizerischer Nationalfonds zur Förderung der Wissenschaftlichen Forschung; National Science Foundation","keywords":"Combinatorics; Mathematics; Corollary; Chordal graph; Intersection graph; Discrete mathematics; Indifference graph; Planar graph; Graph; Line graph","score_opus":0.05276311599847083,"score_gpt":0.3223841234176652,"score_spread":0.26962100741919437,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2789246618","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97650355,0.00040584695,0.017780952,0.00022720399,0.0017280359,0.0005973709,0.0013697026,0.00020514822,0.001182182],"genre_scores_gemma":[0.98862886,0.00005986904,0.009547832,0.00024208134,0.00012108128,0.000023032915,0.0012808638,0.00007371093,0.000022641854],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.996959,0.00017946359,0.00094542844,0.00074443343,0.00083345146,0.00033823945],"domain_scores_gemma":[0.9972013,0.0007580961,0.0010893801,0.00048419798,0.00028811098,0.00017891901],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00034833496,0.0005375229,0.00090714847,0.0007248548,0.00016594559,0.00007324058,0.0005563216,0.0004108375,0.00015841112],"category_scores_gemma":[0.0003049341,0.00051515957,0.00057713676,0.0005230008,0.00024410301,0.00009455586,0.0009958693,0.0010448294,0.0000063318644],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003858364,0.00017962635,0.021850554,0.0038481406,0.0026649374,0.00008260959,0.004071587,0.019908803,0.000074729396,0.94081604,0.0044104173,0.0017067029],"study_design_scores_gemma":[0.0004951454,0.00008322472,0.031100247,0.00046067624,0.00021765562,0.000018917173,0.00041214193,0.0040975143,0.00014539825,0.962304,0.0001515536,0.0005135456],"about_ca_topic_score_codex":0.00006312492,"about_ca_topic_score_gemma":0.000009504025,"teacher_disagreement_score":0.021487923,"about_ca_system_score_codex":0.0000660869,"about_ca_system_score_gemma":0.00007828838,"threshold_uncertainty_score":0.99973},"labels":[],"label_agreement":null},{"id":"W2791203798","doi":"","title":"On k-Ramsey Numbers of Unicyclic-Star Graphs.","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Star (game theory); Ramsey's theorem; Graph; Mathematical analysis","score_opus":0.019254972252138867,"score_gpt":0.2860173511421951,"score_spread":0.2667623788900563,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2791203798","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9565236,0.000021137486,0.0000051793972,0.00003867171,0.0021026782,0.00014769041,0.000007674813,0.00007554089,0.041077808],"genre_scores_gemma":[0.9986748,0.0000086396685,0.0008480193,0.00015542476,0.000016008049,0.0000048459406,0.000002011713,0.000032930348,0.00025729512],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99880874,0.00009485364,0.00030864315,0.00022792461,0.00030107956,0.00025876635],"domain_scores_gemma":[0.9984616,0.0004549247,0.00017060405,0.00069917395,0.00012962925,0.000084041196],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032667344,0.00017819459,0.00028385583,0.00011262921,0.00017854775,0.000011800326,0.00038263045,0.00013268313,0.00021733079],"category_scores_gemma":[0.00034652033,0.00014845496,0.00013647997,0.00028328766,0.00035273077,0.000059352686,0.000110035864,0.0001777671,0.0000252842],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000056337114,0.0001088402,0.0008046102,0.000029879053,0.00006777633,0.0000029591029,0.0009913064,1.1355416e-7,0.00014683546,0.99120414,0.0063710255,0.00021615352],"study_design_scores_gemma":[0.0006615482,0.0003099671,0.00077433354,0.00004619384,0.0000305664,0.000002882791,0.00010237629,0.000010323238,0.004745177,0.99218696,0.00096385396,0.00016583863],"about_ca_topic_score_codex":0.000016945089,"about_ca_topic_score_gemma":0.0000059269582,"teacher_disagreement_score":0.042151205,"about_ca_system_score_codex":0.000023708575,"about_ca_system_score_gemma":0.000020154863,"threshold_uncertainty_score":0.6053817},"labels":[],"label_agreement":null},{"id":"W2794278008","doi":"","title":"A Generalization of (2, w;d)-Cover Free Families.","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Cover (algebra); Generalization; Combinatorics; Mathematical analysis; Engineering","score_opus":0.01744284886968742,"score_gpt":0.26828093437085315,"score_spread":0.2508380855011657,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2794278008","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97229874,0.000048476082,0.00026944088,0.000025191302,0.0018305199,0.00011598824,0.000008354319,0.00005434379,0.025348939],"genre_scores_gemma":[0.9970767,0.000014670225,0.0023606755,0.000090770875,0.00003322281,0.000004198445,0.0000024682859,0.000020933549,0.00039639758],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992093,0.000053299183,0.00023590589,0.00014347257,0.0002086208,0.00014944244],"domain_scores_gemma":[0.99897,0.000113193775,0.0001209905,0.00059135264,0.00016788,0.000036629244],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020059347,0.000107111526,0.0001799306,0.000072335635,0.00011619103,0.000009351831,0.00030492005,0.00008789389,0.00021683855],"category_scores_gemma":[0.00035025843,0.00009064117,0.000065579836,0.00019416763,0.00017507187,0.00007212472,0.00015665656,0.00006249057,0.000011691046],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015575128,0.000043258653,0.0012201647,0.000027844811,0.00003137047,7.2564194e-7,0.0009819408,4.2758506e-7,0.0006007225,0.98007125,0.016787525,0.00021922255],"study_design_scores_gemma":[0.0006042179,0.00009510664,0.00089535245,0.000016710646,0.000023130042,0.0000018151867,0.00003720732,0.00008606875,0.01188605,0.983967,0.0022822844,0.00010507613],"about_ca_topic_score_codex":0.000016215741,"about_ca_topic_score_gemma":0.0000035425487,"teacher_disagreement_score":0.024952542,"about_ca_system_score_codex":0.000017723554,"about_ca_system_score_gemma":0.000018728531,"threshold_uncertainty_score":0.36962396},"labels":[],"label_agreement":null},{"id":"W2795534035","doi":"10.3390/axioms8010029","title":"Using Ramsey Theory to Measure Unavoidable Spurious Correlations in Big Data","year":2019,"lang":"en","type":"article","venue":"Axioms","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Transitive relation; Spurious relationship; Ramsey theory; Measure (data warehouse); Computer science; Big data; Range (aeronautics); Econometrics; Ramsey's theorem; Through-the-lens metering; Mathematical economics; Mathematics; Data mining; Theoretical computer science; Discrete mathematics; Machine learning; Combinatorics; Graph; Lens (geology)","score_opus":0.17724349932867395,"score_gpt":0.34273730548501985,"score_spread":0.1654938061563459,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2795534035","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9304756,0.00023062277,0.05323728,0.00010045185,0.001785395,0.0007651769,0.00005816902,0.00008682237,0.013260518],"genre_scores_gemma":[0.9938473,0.0000032023497,0.004448393,0.00023090027,0.00013861414,0.0000050537533,0.000013615191,0.00003526192,0.001277678],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987358,0.00015350268,0.00026578322,0.00032922238,0.00023586935,0.00027984966],"domain_scores_gemma":[0.9980457,0.0004646921,0.00007490384,0.001298213,0.000043153894,0.000073355994],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010015849,0.00014718123,0.00023064112,0.0001663625,0.00012770641,0.00003638547,0.0005817488,0.00011839279,0.00018179289],"category_scores_gemma":[0.00052021525,0.0001234346,0.000041866195,0.00039712063,0.000042989188,0.0001382059,0.00041618582,0.00022701388,0.000088757166],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006624537,0.00006907196,0.0021613566,0.000050297338,0.00005126422,0.000010644268,0.0030442222,0.00036971667,0.00093956926,0.98432374,0.00079954905,0.00811432],"study_design_scores_gemma":[0.0008409156,0.000055283537,0.0020898087,0.00020014159,0.00006349589,0.000029396055,0.00092971104,0.004991173,0.00018927925,0.98533547,0.004858614,0.00041670154],"about_ca_topic_score_codex":0.0000709629,"about_ca_topic_score_gemma":0.00008391391,"teacher_disagreement_score":0.06337172,"about_ca_system_score_codex":0.00004964387,"about_ca_system_score_gemma":0.000060342427,"threshold_uncertainty_score":0.5033517},"labels":[],"label_agreement":null},{"id":"W2795774886","doi":"10.1002/jgt.22457","title":"Rainbow triangles and the Caccetta‐Häggkvist conjecture","year":2019,"lang":"en","type":"preprint","venue":"Journal of Graph Theory","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Israel Science Foundation; United States-Israel Binational Science Foundation","keywords":"Combinatorics; Rainbow; Conjecture; Mathematics; Digraph; Generalization; Vertex (graph theory); Graph; Disjoint sets; Undirected graph; Discrete mathematics; Physics","score_opus":0.023339471299310167,"score_gpt":0.2911550788216821,"score_spread":0.26781560752237193,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2795774886","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9222729,0.039778583,0.0081552835,0.0035204063,0.011273383,0.0020754957,0.00015052549,0.00009454333,0.012678851],"genre_scores_gemma":[0.9945099,0.0014408022,0.0015123873,0.00068838045,0.0010501302,0.000008422323,0.0000025372544,0.00007961384,0.0007078619],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99603224,0.0016294763,0.0011278907,0.0003054578,0.00058108394,0.0003238585],"domain_scores_gemma":[0.9915916,0.0049910503,0.0020891568,0.000919872,0.00027637836,0.0001319919],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0068434747,0.0005096359,0.0014211993,0.00042599728,0.00031804066,0.00018856279,0.0011599569,0.0005374565,0.00014180428],"category_scores_gemma":[0.0017022813,0.00026053758,0.0011291846,0.0001445116,0.0011658535,0.00008978158,0.0007644308,0.0023808237,0.000001523317],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001735204,0.000041061223,0.00014331918,0.00039077955,0.0011718217,0.00004586124,0.004111501,0.000034020086,0.000012128069,0.98426294,0.0057768296,0.002274522],"study_design_scores_gemma":[0.0034828666,0.00009881195,0.0002997309,0.0004064061,0.00074705615,0.00048008212,0.0006973701,0.0000130546605,0.000063208296,0.9910072,0.0023933302,0.0003108507],"about_ca_topic_score_codex":0.0000037735801,"about_ca_topic_score_gemma":0.0000024295848,"teacher_disagreement_score":0.07223694,"about_ca_system_score_codex":0.00003868894,"about_ca_system_score_gemma":0.00015828326,"threshold_uncertainty_score":0.9999847},"labels":[],"label_agreement":null},{"id":"W2795859477","doi":"10.1093/imrn/rnz360","title":"On the Discretized Sum-Product Problem","year":2019,"lang":"en","type":"preprint","venue":"International Mathematics Research Notices","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Discretization; Product (mathematics); Mathematics; Ring (chemistry); Measure (data warehouse); Set (abstract data type); Combinatorics; Discrete mathematics; Pure mathematics; Computer science; Mathematical analysis; Geometry; Chemistry","score_opus":0.18483467207281426,"score_gpt":0.4424493674566397,"score_spread":0.2576146953838254,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2795859477","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.55875754,0.00035594453,0.002019166,0.019987594,0.005377545,0.005662397,0.00042411976,0.0003261069,0.40708956],"genre_scores_gemma":[0.96803147,0.00011721213,0.018312996,0.00016283068,0.0008741184,0.00038158445,0.00004770498,0.00014111522,0.011930942],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99346024,0.00068343506,0.00087375316,0.0008483617,0.0034694858,0.0006647387],"domain_scores_gemma":[0.983271,0.01288006,0.0005706726,0.0021184783,0.0010460304,0.00011374534],"candidate_categories":["metaresearch","metaepi_narrow","research_integrity","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0064468025,0.0005033921,0.000613999,0.00054616993,0.00050280173,0.00070829666,0.0039735627,0.00030083512,0.0014675816],"category_scores_gemma":[0.008850166,0.0002931611,0.00037699682,0.00022020577,0.00057391735,0.000118896955,0.0039043857,0.0029027504,0.00034633817],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007235965,0.00029999897,0.000035386947,0.0009944404,0.00049232144,0.000011580087,0.002723941,0.00035068006,0.000060623326,0.9736545,0.021077856,0.00022632077],"study_design_scores_gemma":[0.0002530566,0.00005803387,0.000036378766,0.0011570354,0.000043933855,0.000005762882,0.0005178911,0.006847416,0.0005559486,0.9873393,0.0028491577,0.00033605885],"about_ca_topic_score_codex":0.0000337283,"about_ca_topic_score_gemma":0.000022941027,"teacher_disagreement_score":0.40927392,"about_ca_system_score_codex":0.00023083,"about_ca_system_score_gemma":0.00020043922,"threshold_uncertainty_score":0.9999521},"labels":[],"label_agreement":null},{"id":"W2797572581","doi":"10.1016/j.jctb.2019.10.001","title":"k-regular subgraphs near the k-core threshold of a random graph","year":2019,"lang":"en","type":"preprint","venue":"Journal of Combinatorial Theory Series B","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University; University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; Université de Lyon; Agence Nationale de la Recherche","keywords":"Combinatorics; Mathematics; Graph; Core (optical fiber); Degree (music); Window (computing); Factor-critical graph; Induced subgraph; Discrete mathematics; Physics; Computer science; Line graph; Graph power","score_opus":0.024710718242157738,"score_gpt":0.2782392494595172,"score_spread":0.25352853121735947,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2797572581","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9609947,0.0038409897,0.00053591136,0.00021346753,0.03011133,0.0009623235,0.000057231722,0.000041258274,0.0032427972],"genre_scores_gemma":[0.9967992,0.00046096763,0.0010250573,0.000063993735,0.0012474137,0.0000108214435,0.0000040817117,0.00009845975,0.00029004953],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9954027,0.0008484818,0.0018322817,0.00031780338,0.0011879632,0.0004108],"domain_scores_gemma":[0.9918812,0.0022110564,0.003206668,0.0016231983,0.00094057375,0.00013733462],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0059278365,0.0006228831,0.001936839,0.00030738275,0.0004516284,0.00019883332,0.0021937226,0.0006849183,0.00018059563],"category_scores_gemma":[0.0010757325,0.00037006944,0.0018604094,0.000312006,0.0015622855,0.00023048167,0.0010268888,0.002126377,0.0000013278084],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0061490866,0.00015238892,0.00030396483,0.0004918777,0.0014030902,0.000029518193,0.0039738705,0.00023606668,0.000106893574,0.9844566,0.0025074,0.00018926263],"study_design_scores_gemma":[0.0034637414,0.0005084802,0.00007269125,0.0005681146,0.0007328432,0.000131889,0.0006983024,0.00001221213,0.0014851402,0.98848426,0.0034663363,0.000375975],"about_ca_topic_score_codex":0.0000038255403,"about_ca_topic_score_gemma":8.6134725e-7,"teacher_disagreement_score":0.035804465,"about_ca_system_score_codex":0.000051867864,"about_ca_system_score_gemma":0.00045568804,"threshold_uncertainty_score":0.9998751},"labels":[],"label_agreement":null},{"id":"W2801869801","doi":"10.1088/1742-6596/1722/1/012048","title":"Restricted size Ramsey number for 2K <sub>2</sub> versus disconnected graphs of order six","year":2021,"lang":"en","type":"article","venue":"Journal of Physics Conference Series","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Ramsey's theorem; Combinatorics; Graph; Mathematics; Algorithm","score_opus":0.03786586316903901,"score_gpt":0.2955788318326755,"score_spread":0.2577129686636365,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2801869801","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9918845,0.00004908541,0.0058900565,0.00019465032,0.0009225933,0.00014386082,0.00006378792,0.000018662216,0.0008327652],"genre_scores_gemma":[0.98925596,0.00016063121,0.010213904,0.000027326387,0.0002274983,0.0000051591624,0.000007646045,0.00003166193,0.000070217146],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984022,0.00012946733,0.00067245954,0.00016990313,0.0003693464,0.0002566741],"domain_scores_gemma":[0.99510443,0.0015575871,0.0008110819,0.00032931333,0.002105078,0.00009248865],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017937168,0.0002301283,0.0006379626,0.000044529985,0.00015230611,0.00006212525,0.00028448473,0.00012069134,0.00007734565],"category_scores_gemma":[0.0019243477,0.00018451299,0.0003214718,0.00046341756,0.00025668074,0.0003957432,0.000096265154,0.00030517034,7.5146835e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010160955,0.00016071877,0.00016522342,0.00019303252,0.00045203048,0.000030985502,0.0014131166,0.000009130066,0.08553934,0.9040022,0.0006079511,0.0064101736],"study_design_scores_gemma":[0.001280549,0.00020615401,0.000352524,0.00010492824,0.00016065402,0.000038508635,0.00092246727,0.000008552923,0.37513694,0.6215118,0.00012514049,0.00015179462],"about_ca_topic_score_codex":0.0000017154481,"about_ca_topic_score_gemma":0.00001649822,"teacher_disagreement_score":0.2895976,"about_ca_system_score_codex":0.000020823494,"about_ca_system_score_gemma":0.00036860153,"threshold_uncertainty_score":0.7524221},"labels":[],"label_agreement":null},{"id":"W2806119317","doi":"10.1007/s00373-023-02635-x","title":"Sieve Methods in Random Graph Theory","year":2023,"lang":"en","type":"article","venue":"Graphs and Combinatorics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Azrieli Foundation","keywords":"Mathematics; Combinatorics; Sieve (category theory); Corollary; Bipartite graph; Random graph; Discrete mathematics; Complement (music); Graph","score_opus":0.037174320559139766,"score_gpt":0.3555293950826113,"score_spread":0.3183550745234715,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2806119317","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9810023,0.0012935149,0.0031608788,0.00010931616,0.00137707,0.00040799813,0.000008946663,0.0004017782,0.01223821],"genre_scores_gemma":[0.9954202,0.00081004656,0.0029378997,0.000109380446,0.000015936019,0.000042780124,0.0000037531045,0.000038069626,0.00062194344],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99840856,0.00043192468,0.00032254637,0.0002865609,0.00019206479,0.0003583251],"domain_scores_gemma":[0.99759734,0.0018294461,0.000082830215,0.00035403046,0.000043618744,0.000092722374],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002390638,0.00020402655,0.00036945468,0.0004673989,0.00019189453,0.00003458646,0.00022037064,0.00015050964,0.000024198982],"category_scores_gemma":[0.00041812335,0.00016280357,0.00014147248,0.0014181882,0.00014838438,0.00007215325,0.00017315184,0.00027447252,0.0000026548435],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000055407043,0.000039159248,0.002656317,0.00005684634,0.00003761642,0.00001990421,0.0012190212,8.737019e-7,0.000053832107,0.98975354,0.0007472407,0.0053602406],"study_design_scores_gemma":[0.0015420733,0.000048397957,0.00443654,0.000022980052,0.000030212404,0.000007759636,0.00048901135,0.000054242508,0.00020947387,0.9919534,0.0009917101,0.00021422855],"about_ca_topic_score_codex":0.0000064158385,"about_ca_topic_score_gemma":0.0000026186533,"teacher_disagreement_score":0.0144179035,"about_ca_system_score_codex":0.00001137191,"about_ca_system_score_gemma":0.000015280624,"threshold_uncertainty_score":0.6638937},"labels":[],"label_agreement":null},{"id":"W2808421189","doi":"","title":"Random subgraphs of finite graphs. Part II: The lace expansion and the triangle condition","year":2003,"lang":"en","type":"article","venue":"TU/e Research Portal (Eindhoven University of Technology)","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Technische Universiteit Delft; Microsoft Research","keywords":"Combinatorics; Mathematics; Discrete mathematics","score_opus":0.033818888379907854,"score_gpt":0.29378501049455374,"score_spread":0.25996612211464587,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2808421189","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9891647,0.00075445964,0.000096577416,0.0012042748,0.000057394198,0.0007072059,0.000033777207,0.000052827872,0.00792878],"genre_scores_gemma":[0.9980296,0.0007387522,0.00038880546,0.000010674916,0.0000065762406,0.0000025655581,0.000003648473,0.000010511179,0.00080890243],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982407,0.000496962,0.00025468186,0.00023259652,0.00046295524,0.0003120728],"domain_scores_gemma":[0.99746704,0.0013436056,0.00023767648,0.0006452268,0.0002579695,0.00004849079],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.003069958,0.00013213932,0.00039856764,0.000498176,0.0009114583,0.000008058386,0.0005637016,0.00024011494,0.0002013265],"category_scores_gemma":[0.0014948497,0.000083756495,0.00019055282,0.0008886457,0.0034597227,0.00008647045,0.00033816605,0.00057249283,0.0000012014364],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00060830126,0.00009002472,0.0006906568,0.000056129582,0.00016227842,0.000028385388,0.0011757038,0.000002200269,0.000410699,0.9925168,0.003279298,0.0009795025],"study_design_scores_gemma":[0.005783596,0.00027341093,0.0002812626,0.00008922386,0.00009763271,0.000024378476,0.009865531,0.000025786712,0.006306253,0.9693997,0.007729382,0.0001238301],"about_ca_topic_score_codex":0.00006663956,"about_ca_topic_score_gemma":0.00006828283,"teacher_disagreement_score":0.023117106,"about_ca_system_score_codex":0.000012930387,"about_ca_system_score_gemma":0.000065233195,"threshold_uncertainty_score":0.9992523},"labels":[],"label_agreement":null},{"id":"W2811286152","doi":"","title":"Random subgraphs of finite graphs. Part I: The scaling window under the triangle condition","year":2003,"lang":"en","type":"article","venue":"Data Archiving and Networked Services (DANS)","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Technische Universiteit Delft; Microsoft Research","keywords":"Window (computing); Combinatorics; Mathematics; Scaling; Discrete mathematics; Random graph; Computer science; Graph; Geometry","score_opus":0.035594953796620664,"score_gpt":0.2798780242028072,"score_spread":0.24428307040618655,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2811286152","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9877537,0.0016435763,0.0058700684,0.0001644677,0.00051567255,0.00051851635,0.0003460122,0.00006538183,0.003122596],"genre_scores_gemma":[0.9979226,0.0006001003,0.0006746563,0.00036947223,0.00013233052,0.00001545688,0.00020927477,0.00002810495,0.000047977614],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99772227,0.00087653415,0.000455871,0.00034641055,0.0002660257,0.00033287736],"domain_scores_gemma":[0.9939499,0.0043359236,0.00029110158,0.0013254188,0.00003220766,0.000065432876],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002302806,0.00023253675,0.00034729004,0.00006899798,0.00089199696,0.000086028675,0.0010137004,0.00006912801,0.000031710977],"category_scores_gemma":[0.00009819207,0.00012056671,0.0001199019,0.0003022725,0.00039070236,0.00016594662,0.0003065547,0.00029392834,8.2788074e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00084555295,0.00020773742,0.01537104,0.0008760976,0.0012285159,0.000010373655,0.027136516,0.0033653483,0.0004567713,0.9384531,0.0031444044,0.008904551],"study_design_scores_gemma":[0.0021597175,0.00004596725,0.00777455,0.00039339814,0.00040230862,0.000032356907,0.0051865675,0.012309625,0.0001906773,0.9654704,0.0057115224,0.00032294716],"about_ca_topic_score_codex":0.000058340094,"about_ca_topic_score_gemma":0.00029151564,"teacher_disagreement_score":0.02701727,"about_ca_system_score_codex":0.0000039481884,"about_ca_system_score_gemma":0.00001740951,"threshold_uncertainty_score":0.68606097},"labels":[],"label_agreement":null},{"id":"W284364393","doi":"10.1002/jgt.22074","title":"The Game Saturation Number of a Graph","year":2016,"lang":"en","type":"preprint","venue":"Journal of Graph Theory","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"State Administration of Foreign Experts Affairs; National Science Foundation","keywords":"Combinatorics; Vertex (graph theory); Saturation (graph theory); Graph; Mathematics; Upper and lower bounds; Physics; Mathematical analysis","score_opus":0.022195361049930844,"score_gpt":0.31489483409880936,"score_spread":0.2926994730488785,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W284364393","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96649927,0.0043643424,0.010561952,0.0006052803,0.005816226,0.00057524844,0.0001060813,0.000048643018,0.011422979],"genre_scores_gemma":[0.9954605,0.0016918397,0.0016841821,0.00007269792,0.0006891607,0.000008115062,0.000001889976,0.000042446936,0.00034916613],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99623036,0.0009596889,0.0014935815,0.00022626683,0.0007670204,0.000323098],"domain_scores_gemma":[0.99165606,0.0034991775,0.003199885,0.0008075864,0.0007183286,0.00011897609],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0043596854,0.0003958283,0.0008206922,0.0002497571,0.0002495927,0.00007119265,0.0011736782,0.00044817623,0.0001370751],"category_scores_gemma":[0.0010919437,0.00017636476,0.0013054905,0.00018872898,0.00058240927,0.00012844086,0.00043793386,0.0012397643,0.0000021200017],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00069320214,0.0000688625,0.0003573296,0.00018331525,0.0008972155,0.000015437656,0.0012756183,0.0000031507143,0.0006421167,0.9849343,0.0021154836,0.008813985],"study_design_scores_gemma":[0.00045414013,0.000074594005,0.0008295533,0.0006941287,0.00032995045,0.00020411098,0.000238593,0.0000014671558,0.001139558,0.9944184,0.001376763,0.00023873213],"about_ca_topic_score_codex":0.0000012115446,"about_ca_topic_score_gemma":0.000003192786,"teacher_disagreement_score":0.028961254,"about_ca_system_score_codex":0.000046183097,"about_ca_system_score_gemma":0.00012323061,"threshold_uncertainty_score":0.7191946},"labels":[],"label_agreement":null},{"id":"W2889759063","doi":"10.4171/jems/1082","title":"Independent sets in algebraic hypergraphs","year":2021,"lang":"en","type":"preprint","venue":"Journal of the European Mathematical Society","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University; University of Waterloo","funders":"Engineering and Physical Sciences Research Council; Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Hypergraph; Generalization; Parameterized complexity; Mathematics; Algebraic number; Dimension (graph theory); Algebraically closed field; Field (mathematics); Transitive relation; Discrete mathematics; Combinatorics; Pure mathematics","score_opus":0.032034635298413876,"score_gpt":0.2875478739978487,"score_spread":0.2555132386994348,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2889759063","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9805199,0.0006795548,0.0019684478,0.00069233496,0.0015730276,0.0003454197,0.00000947297,0.000030720705,0.014181145],"genre_scores_gemma":[0.9695997,0.00019480842,0.028901588,0.0004193415,0.00045385546,0.000002604478,0.00000115286,0.000110635985,0.00031631725],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9951588,0.0014858184,0.0015983783,0.00031386712,0.0010619052,0.00038122814],"domain_scores_gemma":[0.9965019,0.0007280993,0.0013713321,0.0010151861,0.00022645506,0.00015698929],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0050251842,0.000429447,0.0009811172,0.00007786864,0.00018494124,0.00016862023,0.0017986299,0.00029924072,0.00018521049],"category_scores_gemma":[0.0013814605,0.000251396,0.0022691074,0.00025528172,0.00024237567,0.00008844243,0.0029341846,0.00308974,0.000005594684],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020677762,0.0061852853,0.009339436,0.016205374,0.008595573,0.0024696426,0.16869684,0.0012100827,0.0023218414,0.6816964,0.09137705,0.011695709],"study_design_scores_gemma":[0.0005965349,0.00002613283,0.0047468194,0.0018010641,0.00026276376,0.00037145702,0.001264283,0.0001714598,0.00014405505,0.99012667,0.00016428402,0.0003245021],"about_ca_topic_score_codex":0.000001033192,"about_ca_topic_score_gemma":0.0000017692546,"teacher_disagreement_score":0.30843025,"about_ca_system_score_codex":0.00015729446,"about_ca_system_score_gemma":0.00014048681,"threshold_uncertainty_score":0.9999938},"labels":[],"label_agreement":null},{"id":"W2891284405","doi":"10.4153/s0008439519000316","title":"Value Sets of Sparse Polynomials","year":2019,"lang":"en","type":"article","venue":"Canadian Mathematical Bulletin","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Monomial; Upper and lower bounds; Degree (music); Finite field; Field (mathematics); Value (mathematics)","score_opus":0.019647634113958833,"score_gpt":0.25980772792340556,"score_spread":0.24016009380944672,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2891284405","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8510034,0.000056903376,0.0001494611,0.0010787655,0.00022783023,0.00047739333,0.000051357958,0.000041413747,0.14691347],"genre_scores_gemma":[0.9866406,0.0000029794828,0.008570818,0.0005758054,0.000052890693,0.000009642403,0.000003012502,0.000044970122,0.004099328],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984557,0.00009772385,0.0004963614,0.00024352643,0.00025153035,0.00045517084],"domain_scores_gemma":[0.99798214,0.00073736545,0.00013449468,0.0006671971,0.000062315405,0.00041646522],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00060677674,0.00020397405,0.0005022471,0.00016933864,0.000085598724,0.000019837467,0.0003771803,0.00017648243,0.03568217],"category_scores_gemma":[0.00077940134,0.0001685543,0.00017000383,0.000120368364,0.00014273058,0.000021413709,0.000069818896,0.00018216776,0.0035230734],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009217065,0.000027301556,0.00016694731,0.00027373503,0.000042235206,0.000011673082,0.0004611862,0.0000023337027,0.00013550118,0.9806466,0.017912753,0.0003104772],"study_design_scores_gemma":[0.00033419492,0.00005127923,0.00022679067,0.00014065478,0.000041170108,0.000032630385,0.0001551194,0.000080078986,0.00087652396,0.97052854,0.027284775,0.00024823204],"about_ca_topic_score_codex":0.0003577504,"about_ca_topic_score_gemma":0.00012034736,"teacher_disagreement_score":0.14281413,"about_ca_system_score_codex":0.00007146104,"about_ca_system_score_gemma":0.0001283403,"threshold_uncertainty_score":0.9972528},"labels":[],"label_agreement":null},{"id":"W2893324291","doi":"10.37236/8193","title":"Non-Monochromatic Triangles in a 2-Edge-Coloured Graph","year":2019,"lang":"en","type":"preprint","venue":"The Electronic Journal of Combinatorics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; Dirección General de Asuntos del Personal Académico, Universidad Nacional Autónoma de México; National Science Foundation","keywords":"Combinatorics; Mathematics; Conjecture; Monochromatic color; Partition (number theory); Graph; Simple graph; Graph factorization; Generalization; Discrete mathematics; Graph power; Line graph; Physics","score_opus":0.018228233782680427,"score_gpt":0.28590507024476786,"score_spread":0.26767683646208745,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2893324291","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9829554,0.007935928,0.00281336,0.00048587684,0.0033751272,0.0008960481,0.0000039016736,0.000026156327,0.0015081802],"genre_scores_gemma":[0.9976069,0.0016164614,0.00008895083,0.00006263116,0.00021045173,0.0000151638615,0.0000016637612,0.00007715774,0.00032065378],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9962516,0.00048818093,0.001396196,0.0002636132,0.0007443486,0.00085605256],"domain_scores_gemma":[0.99535733,0.001271041,0.0019636666,0.0010219262,0.0002969263,0.00008909788],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0040145605,0.0004908183,0.0013189971,0.00055806874,0.0001541288,0.00008055312,0.002010804,0.00049605157,0.000024093897],"category_scores_gemma":[0.0006088229,0.0003165046,0.0006803791,0.00051449606,0.00013486283,0.00009213731,0.0005845749,0.004188079,0.000004041395],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024014588,0.00030303682,0.00032670336,0.0004379618,0.00060502806,0.00003595223,0.0029956293,0.00039911666,0.000029763856,0.992493,0.0019007719,0.0002329034],"study_design_scores_gemma":[0.002011919,0.00047950374,0.0004773591,0.00047719767,0.0003240176,0.00015525444,0.0002653609,0.00028328874,0.00018465682,0.9947616,0.00024736815,0.00033249735],"about_ca_topic_score_codex":0.0000074746326,"about_ca_topic_score_gemma":0.0000133726835,"teacher_disagreement_score":0.014651444,"about_ca_system_score_codex":0.00067689025,"about_ca_system_score_gemma":0.0011473052,"threshold_uncertainty_score":0.9999287},"labels":[],"label_agreement":null},{"id":"W2897990690","doi":"10.1142/s1793042119500349","title":"On subset sums of zero-sum free sets of abelian groups","year":2018,"lang":"en","type":"article","venue":"International Journal of Number Theory","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University","funders":"Brock University; China Scholarship Council","keywords":"Mathematics; Zero (linguistics); Combinatorics; Order (exchange); Abelian group; Group (periodic table); Physics","score_opus":0.022333322951596225,"score_gpt":0.3274169057785158,"score_spread":0.30508358282691955,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2897990690","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97870773,0.000038298065,0.0013259328,0.00014493908,0.0020187676,0.000060166225,0.0002807354,0.000009232575,0.017414207],"genre_scores_gemma":[0.9957516,0.000018496106,0.0033365437,0.00019636255,0.00039996725,8.264292e-7,0.000004628204,0.000024629122,0.00026691702],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980044,0.00018525678,0.0007743934,0.00011116538,0.0007817751,0.00014303181],"domain_scores_gemma":[0.99636936,0.0012956379,0.000984614,0.00034518773,0.00093549065,0.0000697265],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0011142945,0.00015078431,0.00033345242,0.00021498757,0.00004447215,0.000014034089,0.0010705616,0.0000979646,0.0028930763],"category_scores_gemma":[0.0013069246,0.00011172512,0.0002732874,0.000092845614,0.000379091,0.00013849963,0.00015944905,0.00023474894,0.000012792879],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008517211,0.00016981625,0.001480943,0.000026131038,0.00056954246,0.000028546787,0.0015244695,0.0000018886909,0.0011759481,0.97084135,0.021404468,0.0019251582],"study_design_scores_gemma":[0.00090129377,0.000227776,0.0015583625,0.00027870308,0.00004909226,0.0001891844,0.00015170318,0.000006087993,0.013601138,0.98206604,0.00086840976,0.00010223477],"about_ca_topic_score_codex":0.0000043012374,"about_ca_topic_score_gemma":0.0000046387577,"teacher_disagreement_score":0.020536058,"about_ca_system_score_codex":0.00004264834,"about_ca_system_score_gemma":0.000044429355,"threshold_uncertainty_score":0.99801844},"labels":[],"label_agreement":null},{"id":"W2902781708","doi":"10.1090/conm/775/15590","title":"Model theory and metric convergence II: Averages of unitary polynomial actions","year":2021,"lang":"en","type":"preprint","venue":"Contemporary mathematics - American Mathematical Society","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Banff International Research Station for Mathematical Innovation and Discovery; National Science Foundation","keywords":"Mathematics; Polynomial; Abelian group; Sequence (biology); Unitary state; Hilbert space; Pointwise; Discrete mathematics; Combinatorics; Pointwise convergence; Unitary matrix; Pure mathematics; Mathematical analysis","score_opus":0.08081506762404857,"score_gpt":0.3304413895864873,"score_spread":0.24962632196243872,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2902781708","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.77304584,0.0021911704,0.20869556,0.00023916816,0.0004029278,0.0015554425,0.00040900512,0.00036377652,0.013097119],"genre_scores_gemma":[0.7815214,0.000521336,0.21635275,0.00021143518,0.00011529132,0.00011328556,0.00004583144,0.00016260461,0.00095608237],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9945266,0.0005548256,0.0021494643,0.0010664068,0.0010328036,0.0006698526],"domain_scores_gemma":[0.98999745,0.0051651066,0.002004272,0.0019802472,0.0004333479,0.0004196059],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002644175,0.0010998407,0.0029153014,0.00025782658,0.0006697119,0.00012627232,0.0011038062,0.0006572094,0.0002864478],"category_scores_gemma":[0.0024123143,0.00094515923,0.0014051818,0.0007556212,0.0026791578,0.0002527619,0.0037773955,0.0016444679,0.000002995616],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011266073,0.0021033618,0.00019059138,0.012377877,0.0032781498,0.000028132112,0.065149166,0.00019845582,0.00091604405,0.90489054,0.00999494,0.00076005596],"study_design_scores_gemma":[0.00051094155,0.00014494015,0.00003451471,0.00092693843,0.00067856745,0.000046092628,0.016213808,0.039289802,0.00081596966,0.9402835,0.000048142138,0.0010068027],"about_ca_topic_score_codex":0.000026102174,"about_ca_topic_score_gemma":0.0000018438554,"teacher_disagreement_score":0.04893536,"about_ca_system_score_codex":0.00013549844,"about_ca_system_score_gemma":0.00062857213,"threshold_uncertainty_score":0.9992999},"labels":[],"label_agreement":null},{"id":"W2902948030","doi":"10.37236/8363","title":"Nearly-Regular Hypergraphs and Saturation of Berge Stars","year":2019,"lang":"en","type":"preprint","venue":"The Electronic Journal of Combinatorics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Hypergraph; Combinatorics; Mathematics; Vertex (graph theory); Graph; Saturation (graph theory)","score_opus":0.012966714581636384,"score_gpt":0.2614189277328903,"score_spread":0.24845221315125393,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2902948030","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98100793,0.0144599555,0.0020311894,0.00026545694,0.0014694721,0.00030521472,0.0000061816513,0.000011506686,0.00044307995],"genre_scores_gemma":[0.99577856,0.0037396667,0.00010979597,0.0000249887,0.000111036505,0.0000017631261,0.000001850546,0.00004019564,0.00019214461],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99774367,0.00029693395,0.0007903388,0.0001679592,0.0006117097,0.00038937447],"domain_scores_gemma":[0.9967944,0.0005381137,0.0015484683,0.00062871777,0.00043139284,0.000058898215],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018838001,0.00028646793,0.0007206979,0.00020111953,0.00013212,0.00004161196,0.0007338577,0.00029819677,0.000009575238],"category_scores_gemma":[0.00024933953,0.0001836003,0.00032399336,0.00018548779,0.00016456416,0.00009056534,0.00037379735,0.0019000352,3.1503123e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000105348976,0.00006279523,0.00026195438,0.00022381806,0.00046001907,0.0000022246586,0.0009766403,0.00007098696,0.0002283315,0.99680275,0.00045161287,0.00035349347],"study_design_scores_gemma":[0.0006023871,0.00040145326,0.00044039538,0.00015054904,0.0003770646,0.00009483474,0.0001496356,0.00008891169,0.0010773424,0.9959126,0.0005243599,0.00018043006],"about_ca_topic_score_codex":0.000005987682,"about_ca_topic_score_gemma":0.0000028127163,"teacher_disagreement_score":0.014770616,"about_ca_system_score_codex":0.0001503251,"about_ca_system_score_gemma":0.0004347131,"threshold_uncertainty_score":0.8254813},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.038242836403475665,"score_gpt":0.31036114916230245,"score_spread":0.2721183127588268,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2903461617","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9578785,0.0001273842,0.012881218,0.0015566477,0.0012196823,0.0009493126,0.0003594702,0.00009882305,0.024929019],"genre_scores_gemma":[0.9833841,0.00001441752,0.014576255,0.00085180684,0.0001665366,0.000027450022,0.000004571932,0.000075598706,0.0008993196],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997356,0.00022289822,0.00081319833,0.00023040164,0.0010322044,0.00034531334],"domain_scores_gemma":[0.9975823,0.0008812798,0.00062988617,0.0006144053,0.00010331699,0.0001888042],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0010795118,0.0003134885,0.0005890366,0.0002991422,0.0006596966,0.00007581028,0.0006668518,0.0000706772,0.0014321991],"category_scores_gemma":[0.0005993051,0.00022668143,0.00030804132,0.00025124883,0.00007840686,0.00006112303,0.00024593883,0.00076457666,0.000011552819],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019035587,0.00027159153,0.00003474249,0.00019063306,0.00019293325,0.00005309053,0.010193167,0.0009333635,0.00046755164,0.97468954,0.012325889,0.00045711],"study_design_scores_gemma":[0.0008289428,0.001569499,0.00006748175,0.0002745275,0.000099524696,0.00041376258,0.0032840553,0.0004579041,0.0020706698,0.98130345,0.0092484355,0.00038171877],"about_ca_topic_score_codex":0.0000017093502,"about_ca_topic_score_gemma":0.0000026002624,"teacher_disagreement_score":0.025505602,"about_ca_system_score_codex":0.0001263814,"about_ca_system_score_gemma":0.000062370375,"threshold_uncertainty_score":0.9994806},"labels":[],"label_agreement":null},{"id":"W2906816032","doi":"10.48550/arxiv.1812.11872","title":"A rainbow version of Mantel's Theorem","year":2018,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Combinatorics; Mathematics; Modulo; Vertex (graph theory); Rainbow; Graph; Simple (philosophy); Simple graph; Upper and lower bounds; Discrete mathematics; Physics; Quantum mechanics; Philosophy","score_opus":0.07663300934084757,"score_gpt":0.21397404042143964,"score_spread":0.13734103108059206,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2906816032","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96416014,0.000039700146,0.007174142,0.000015776926,0.00082781527,0.00030824594,0.000079766294,0.00011981513,0.027274588],"genre_scores_gemma":[0.9962791,0.0001135552,0.0010891138,0.000030672305,0.0001430273,3.2003013e-7,0.000013387198,0.000038287817,0.0022925073],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985168,0.000194466,0.0002619581,0.0006285482,0.00011576695,0.0002824396],"domain_scores_gemma":[0.99769247,0.0003419201,0.00043147444,0.0012173338,0.00021515528,0.000101626],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00043661727,0.00032846158,0.00049940374,0.00026251568,0.00018212257,0.000015291216,0.00095929834,0.00045132972,0.0005752514],"category_scores_gemma":[0.0001716399,0.00031296432,0.0004029579,0.00024272731,0.0005332687,0.00007395144,0.0016999193,0.00046644558,0.000027102276],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002683585,0.00008533318,0.0012375077,0.00039717124,0.0002512376,0.000077434794,0.0007399056,0.00037723078,0.00004152274,0.993526,0.002882884,0.000115460636],"study_design_scores_gemma":[0.00052076427,0.00007559992,0.00028952988,0.00023266795,0.0002464424,0.0000043033992,0.00026030684,0.002783515,0.0007325979,0.9938457,0.00067384663,0.00033471853],"about_ca_topic_score_codex":0.000022376393,"about_ca_topic_score_gemma":0.0000063913244,"teacher_disagreement_score":0.03211898,"about_ca_system_score_codex":0.00008695434,"about_ca_system_score_gemma":0.00007005106,"threshold_uncertainty_score":0.9999322},"labels":[],"label_agreement":null},{"id":"W2907170940","doi":"10.55016/ojs/cdm.v13i2.62730","title":"Loose Hamiltonian cycles forced by large (k-2)-degree - sharp version","year":2018,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Conselho Nacional de Desenvolvimento Científico e Tecnológico; Coordenação de Aperfeiçoamento de Pessoal de Nível Superior; Fundação de Amparo à Pesquisa do Estado de São Paulo; Deutscher Akademischer Austauschdienst","keywords":"Hypergraph; Mathematics; Combinatorics; Hamiltonian (control theory); Hamiltonian path; Degree (music); Upper and lower bounds; Discrete mathematics; Mathematical analysis; Physics; Graph","score_opus":0.0222772638909818,"score_gpt":0.32917001272122837,"score_spread":0.3068927488302466,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2907170940","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39925566,0.00046704043,0.537957,0.002553426,0.0012720141,0.002697898,0.009693929,0.0010265161,0.045076538],"genre_scores_gemma":[0.97395134,0.000014459472,0.021626513,0.0004682545,0.00035932666,0.00007137715,0.00014928888,0.00008520816,0.0032742217],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99752074,0.00009557219,0.0006549743,0.00043842918,0.0004726266,0.0008176341],"domain_scores_gemma":[0.9973563,0.0005006099,0.00023530738,0.0011010143,0.00045911164,0.00034766653],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007617291,0.0004016867,0.0005455475,0.00017625533,0.0012321016,0.00012453599,0.00066916656,0.0002452165,0.0008366462],"category_scores_gemma":[0.0020344655,0.00032787546,0.00025036503,0.00042827096,0.00026693055,0.00018845357,0.00051110703,0.0002522739,0.00039848837],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000041440017,0.00017483569,0.000055666904,0.00009778592,0.0001173291,0.0000047503004,0.0023327773,5.493972e-7,0.0021520113,0.8778206,0.11667119,0.00053102843],"study_design_scores_gemma":[0.0016631241,0.00027163958,0.00020262793,0.00026206477,0.00024590272,0.000024975829,0.0006722788,0.002058734,0.010160009,0.90952486,0.0741618,0.0007519764],"about_ca_topic_score_codex":0.0000047269477,"about_ca_topic_score_gemma":0.00002778578,"teacher_disagreement_score":0.5746957,"about_ca_system_score_codex":0.0001614504,"about_ca_system_score_gemma":0.00004689102,"threshold_uncertainty_score":0.9999173},"labels":[],"label_agreement":null},{"id":"W2912554854","doi":"10.1007/s00041-020-09780-4","title":"On Sets Containing an Affine Copy of Bounded Decreasing Sequences","year":2020,"lang":"en","type":"article","venue":"Journal of Fourier Analysis and Applications","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Bounded function; Affine transformation; Sequence (biology); Set (abstract data type); Fourier analysis; Affine combination","score_opus":0.041437819176624265,"score_gpt":0.3393119524142237,"score_spread":0.2978741332375994,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2912554854","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94726753,0.00013553056,0.051228873,0.00047920202,0.000010799424,0.000079474215,0.000013055744,0.000007566756,0.000777956],"genre_scores_gemma":[0.9755251,0.000045877125,0.024132753,0.00018165422,0.00009576128,0.0000025684615,0.000002790822,0.0000063655943,0.0000071763498],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990765,0.0000638781,0.00045203115,0.000108629974,0.00021748914,0.000081499136],"domain_scores_gemma":[0.9987121,0.0003003067,0.0005189007,0.00015550124,0.00016970764,0.00014344552],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003729036,0.000087268054,0.0003751119,0.00015586303,0.00017085607,0.00003582107,0.00015576615,0.000039656545,0.00006692005],"category_scores_gemma":[0.00013669977,0.00006278147,0.00018602127,0.0004611575,0.00008775865,0.00008860087,0.000020758805,0.00012796295,1.6526593e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019224761,0.00016233756,0.009364487,0.000052455693,0.0020717862,0.000006303402,0.0032109313,0.00029926372,0.0014894081,0.9650903,0.00019488823,0.017865589],"study_design_scores_gemma":[0.0006182071,0.0005076384,0.0040501105,0.00003819885,0.0028827577,0.000026530744,0.0012544037,0.003761754,0.0018530107,0.9834133,0.0014054544,0.00018863936],"about_ca_topic_score_codex":0.000007093343,"about_ca_topic_score_gemma":0.000008825671,"teacher_disagreement_score":0.028257512,"about_ca_system_score_codex":0.000009615901,"about_ca_system_score_gemma":0.00002698491,"threshold_uncertainty_score":0.25601542},"labels":[],"label_agreement":null},{"id":"W2916265538","doi":"10.1016/j.disc.2020.112025","title":"On the existence of dense substructures in finite groups","year":2020,"lang":"en","type":"preprint","venue":"Discrete Mathematics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Quadratic growth; Conjecture; Mathematics; Quadratic equation; Combinatorics; Span (engineering); Group (periodic table); Set (abstract data type); Upper and lower bounds; Finite set; Pure mathematics; Mathematical analysis; Geometry; Physics; Computer science","score_opus":0.06572966962262852,"score_gpt":0.30803539816314485,"score_spread":0.24230572854051632,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2916265538","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98054636,0.000265579,0.0042480077,0.00065478805,0.00054883695,0.0012569496,0.000221335,0.000103994425,0.012154136],"genre_scores_gemma":[0.98211557,0.00006432077,0.017239446,0.00024017844,0.00009958366,0.00006447164,0.000013728995,0.000089791916,0.00007292122],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99710345,0.00023549898,0.0011275891,0.0004971743,0.00067925657,0.00035704538],"domain_scores_gemma":[0.99316514,0.0041610734,0.00089069497,0.0016100759,0.00008777045,0.000085259926],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007522399,0.0005616056,0.0010414603,0.0001688249,0.00012628539,0.000063474814,0.001342508,0.00038844516,0.00015512179],"category_scores_gemma":[0.0036512194,0.00034170708,0.000433737,0.00024851202,0.0003693733,0.000031918116,0.0012000492,0.0012707843,0.000007240635],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000043309494,0.00005614348,0.0000550134,0.001967302,0.000105552885,0.000024011391,0.014906758,0.00015999873,0.000046847086,0.9821691,0.00039159824,0.00007435796],"study_design_scores_gemma":[0.00021153304,0.000050639806,0.00021292952,0.0011982112,0.00010174468,0.000006164848,0.0011615804,0.0033716308,0.000843914,0.99246335,0.00001682451,0.0003614656],"about_ca_topic_score_codex":0.000009175121,"about_ca_topic_score_gemma":0.000019179006,"teacher_disagreement_score":0.0137451785,"about_ca_system_score_codex":0.000046317877,"about_ca_system_score_gemma":0.000057228317,"threshold_uncertainty_score":0.9999035},"labels":[],"label_agreement":null},{"id":"W2917246580","doi":"10.37236/8451","title":"Concatenating Bipartite Graphs","year":2022,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Army Research Office; Office of Naval Research; Air Force Office of Scientific Research; Leverhulme Trust; National Science Foundation","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Bipartite graph; Disjoint sets; Neighbourhood (mathematics); Graph; Integer (computer science); Discrete mathematics","score_opus":0.018320853673882705,"score_gpt":0.27191957654834714,"score_spread":0.25359872287446444,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2917246580","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99155194,0.0031852962,0.0010433965,0.0006659011,0.0012376073,0.0001253328,0.0000016822802,0.000025343134,0.0021634772],"genre_scores_gemma":[0.9992436,0.00014663882,0.00002442325,0.00015623345,0.0000682107,0.0000050058306,2.7874754e-7,0.000023944238,0.0003316652],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980516,0.00036471235,0.00045956156,0.00008090742,0.00059029646,0.00045296169],"domain_scores_gemma":[0.99830383,0.00062293315,0.0006115766,0.00026509882,0.00014760844,0.00004895446],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027616106,0.00012390819,0.0002490953,0.00012787906,0.00085375085,0.00002142264,0.00077670236,0.000027818338,0.00009581106],"category_scores_gemma":[0.00025045255,0.00007944751,0.00020229397,0.000474917,0.00007606305,0.0000742021,0.00021575796,0.001220732,6.573515e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004351286,0.000063868654,0.00018622537,0.00000720846,0.000117894444,0.000009191811,0.0009538458,0.00004554093,0.00010706316,0.9968598,0.0013521628,0.00025368313],"study_design_scores_gemma":[0.0005779332,0.00046411567,0.000046428788,0.0000051703337,0.000077884055,0.0004536179,0.0006012507,0.000040522737,0.0003632845,0.98730135,0.009969884,0.00009857814],"about_ca_topic_score_codex":0.0000015549848,"about_ca_topic_score_gemma":6.2145386e-7,"teacher_disagreement_score":0.009558472,"about_ca_system_score_codex":0.0002295803,"about_ca_system_score_gemma":0.00019728534,"threshold_uncertainty_score":0.65664476},"labels":[],"label_agreement":null},{"id":"W2919026095","doi":"","title":"On the Erdos-Sos Conjecture for spiders in graphs having no path with 2k+1 vertices.","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Conjecture; Combinatorics; Path (computing); Computer science; Computer network","score_opus":0.018521022841210443,"score_gpt":0.2659698895284222,"score_spread":0.24744886668721178,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2919026095","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9927383,0.000033278633,0.000053368236,0.0002768763,0.0014599952,0.0006991118,0.000007811555,0.000062159095,0.0046690814],"genre_scores_gemma":[0.9983495,0.0000038281296,0.00072121836,0.0006796593,0.000028638091,0.00006636813,0.0000020797056,0.0000442384,0.00010448415],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99872595,0.00011057536,0.00024658215,0.00029695133,0.000249289,0.00037063393],"domain_scores_gemma":[0.99778277,0.0013162668,0.00013217285,0.000581265,0.00012773224,0.000059823287],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005830251,0.00023279493,0.00026331004,0.00008689093,0.00036112452,0.000051642626,0.00037920184,0.00012572513,0.00007766712],"category_scores_gemma":[0.0006663658,0.00013418781,0.000093860974,0.00023498342,0.00027447476,0.00007939369,0.0000670187,0.0002709221,0.000010057406],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016822717,0.000067355584,0.0013718157,0.00004386749,0.00005149572,0.0000055063774,0.0018029502,0.0000011319661,0.000059892212,0.9909812,0.0053067245,0.00013982461],"study_design_scores_gemma":[0.0013445102,0.00058064464,0.00096770865,0.00012923167,0.000037955444,0.000004103779,0.00022370133,0.00013005604,0.0008969346,0.99467677,0.00079419644,0.00021416336],"about_ca_topic_score_codex":0.00001779808,"about_ca_topic_score_gemma":0.000038073904,"teacher_disagreement_score":0.0056111678,"about_ca_system_score_codex":0.00004151612,"about_ca_system_score_gemma":0.00003464112,"threshold_uncertainty_score":0.547202},"labels":[],"label_agreement":null},{"id":"W2921552912","doi":"10.37236/8504","title":"On the Weight of Berge-$F$-Free Hypergraphs","year":2019,"lang":"en","type":"preprint","venue":"The Electronic Journal of Combinatorics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"National Research, Development and Innovation Office; Nemzeti Kutatási Fejlesztési és Innovációs Hivatal; Magyar Tudományos Akadémia; University of Montana","keywords":"Hypergraph; Combinatorics; Mathematics; Graph; Enhanced Data Rates for GSM Evolution; Discrete mathematics; Computer science","score_opus":0.01596647273150778,"score_gpt":0.2570298645835043,"score_spread":0.24106339185199652,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2921552912","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9643607,0.0110638505,0.0019454453,0.0031766242,0.0063716364,0.0007642753,0.000020412997,0.00002945057,0.012267586],"genre_scores_gemma":[0.9963807,0.0025332212,0.000031487776,0.00014338286,0.00024155166,0.000005294688,8.8195435e-7,0.00006554741,0.00059792784],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.996494,0.00058261893,0.0010158519,0.00020283254,0.0011038758,0.0006008415],"domain_scores_gemma":[0.99207777,0.003149539,0.0021349215,0.0020849598,0.00049169286,0.00006113236],"candidate_categories":["research_integrity"],"consensus_categories":[],"category_scores_codex":[0.003446749,0.0004177443,0.0008841685,0.00022555854,0.00023149383,0.0000364179,0.003727556,0.00033712643,0.00006870214],"category_scores_gemma":[0.0011406858,0.0001992629,0.0008240664,0.0003093427,0.0002375691,0.000045010023,0.0009213836,0.0039324267,0.0000026940922],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014382208,0.00015304278,0.00005541547,0.00011680913,0.0007555504,0.0000033765693,0.00061321043,0.00009796115,0.000026935657,0.986751,0.011195648,0.00008723668],"study_design_scores_gemma":[0.00069095416,0.0005445582,0.0000525461,0.00023547979,0.000403188,0.00007062029,0.00009334638,0.00004212098,0.0010702722,0.99467385,0.0019103718,0.00021271915],"about_ca_topic_score_codex":0.0000039545566,"about_ca_topic_score_gemma":0.0000020777345,"teacher_disagreement_score":0.032019988,"about_ca_system_score_codex":0.00023752116,"about_ca_system_score_gemma":0.00062166643,"threshold_uncertainty_score":0.9983655},"labels":[],"label_agreement":null},{"id":"W2921844982","doi":"10.1016/j.dam.2019.02.032","title":"Zero–one laws for <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" display=\"inline\" overflow=\"scroll\" id=\"d1e19\" altimg=\"si6.gif\"><mml:mi>k</mml:mi></mml:math>-variable first-order logic of sparse random graphs","year":2019,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"Russian Science Foundation","keywords":"Mathematics; Graph; Order (exchange); Zero (linguistics); Scroll; Algorithm; Discrete mathematics; Combinatorics; Philosophy; Theology","score_opus":0.020487086681146613,"score_gpt":0.2501845265000929,"score_spread":0.22969743981894625,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2921844982","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94112164,0.0001809202,0.040671557,0.000088345,0.00062976254,0.00074076303,0.00039586597,0.00022306344,0.015948096],"genre_scores_gemma":[0.8462014,0.00016453181,0.1515388,0.00034978878,0.00023999633,0.0006384206,0.00025440124,0.00031098907,0.00030166114],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9958635,0.000052741558,0.0014057109,0.00077001186,0.0009516631,0.00095638976],"domain_scores_gemma":[0.99454594,0.002017389,0.0012504696,0.0017981959,0.00014825579,0.00023976057],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013226201,0.0006811741,0.0009111467,0.00017627385,0.00057101686,0.00018198146,0.00095953577,0.0007415591,0.00017813257],"category_scores_gemma":[0.0006227368,0.0006550131,0.00068941835,0.00042959856,0.00045034933,0.00025994636,0.00062515476,0.0005331493,0.00021583392],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006724172,0.00035877968,0.000007294895,0.0034716695,0.0006708931,0.000011742861,0.002123512,0.00041988425,0.0026033244,0.9887653,0.00079204136,0.00010311598],"study_design_scores_gemma":[0.0035425613,0.00031697177,0.0000060071607,0.00051740033,0.0008211571,0.000052456304,0.0010130327,0.3519473,0.0049188114,0.63462245,0.0015286796,0.0007131936],"about_ca_topic_score_codex":0.000029750438,"about_ca_topic_score_gemma":0.00002543407,"teacher_disagreement_score":0.3541429,"about_ca_system_score_codex":0.00001952169,"about_ca_system_score_gemma":0.00014920683,"threshold_uncertainty_score":0.9995901},"labels":[],"label_agreement":null},{"id":"W2922085044","doi":"10.37236/8895","title":"Maximum $k$-Sum $\\mathbf{n}$-Free Sets of the 2-Dimensional Integer Lattice","year":2020,"lang":"en","type":"preprint","venue":"The Electronic Journal of Combinatorics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Kootenay Association for Science & Technology","funders":"Ministry of Science and ICT, South Korea; National Research Foundation of Korea; Ministry of Science, ICT and Future Planning; Hankuk University of Foreign Studies; National Research Foundation; University of Warwick","keywords":"Combinatorics; Integer (computer science); Lattice (music); Homogeneous; Integer lattice; Mathematics; Physics; Half-integer; Condensed matter physics","score_opus":0.02516353995218488,"score_gpt":0.2799450805489465,"score_spread":0.2547815405967616,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2922085044","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9572116,0.010913518,0.004184653,0.013154614,0.009328985,0.0010319683,0.00005720978,0.00006597465,0.004051485],"genre_scores_gemma":[0.9985154,0.00040563385,0.0002121551,0.0003073851,0.00026143144,0.000004245388,0.0000013690652,0.00007468204,0.00021768846],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99586457,0.00065822515,0.001246508,0.0002553422,0.001346311,0.00062902545],"domain_scores_gemma":[0.9939373,0.001327363,0.002392085,0.0015740108,0.00065678044,0.00011246109],"candidate_categories":["research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0024518794,0.00046394186,0.00096648384,0.00012356204,0.0002902289,0.00004333549,0.0038403233,0.00036898511,0.000045284934],"category_scores_gemma":[0.00169407,0.00024387315,0.00087716844,0.0003698341,0.0003243561,0.00006886686,0.0027591959,0.0048614964,0.0000020366897],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001536436,0.00013744431,0.00006637933,0.00023332874,0.0007281313,0.000008062968,0.0011603615,0.000091524686,0.000070742935,0.9893428,0.007863999,0.00014357004],"study_design_scores_gemma":[0.0008350487,0.0002447746,0.00015789983,0.00029295316,0.0006354206,0.00024920073,0.0001198677,0.00015635705,0.0011968213,0.99430686,0.0015588207,0.00024597187],"about_ca_topic_score_codex":0.0000057744533,"about_ca_topic_score_gemma":0.0000038495223,"teacher_disagreement_score":0.041303817,"about_ca_system_score_codex":0.00035119627,"about_ca_system_score_gemma":0.0011239424,"threshold_uncertainty_score":0.9974343},"labels":[],"label_agreement":null},{"id":"W2922964563","doi":"10.22108/toc.2019.112258.1579","title":"A lower bound on the $k$-conversion number of graphs of maximum degree $k+1$","year":2019,"lang":"en","type":"article","venue":"DOAJ (DOAJ: Directory of Open Access Journals)","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Mathematics; Combinatorics; Degree (music); Upper and lower bounds; Discrete mathematics; Physics; Mathematical analysis","score_opus":0.22586180238438944,"score_gpt":0.5081293171777996,"score_spread":0.28226751479341017,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2922964563","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9615816,0.00094644114,0.000037419686,0.00006782083,0.0009876637,0.00058911135,0.000042015155,0.000015423482,0.03573253],"genre_scores_gemma":[0.997832,0.0009830435,0.00030563425,0.00020414604,0.00005116802,0.000009046015,0.0000019623749,0.000053830267,0.0005591905],"study_design_codex":"observational","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970713,0.00034610502,0.000984083,0.00033307087,0.0009376976,0.00032773332],"domain_scores_gemma":[0.99547255,0.0015313057,0.0014183624,0.0010872461,0.0003717498,0.00011879843],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0017825577,0.00032933455,0.00091557944,0.00042096886,0.00020368167,0.00019219075,0.002887249,0.00016791893,0.024505697],"category_scores_gemma":[0.00043320676,0.00021053481,0.00046822627,0.00068627094,0.00035205574,0.00068274763,0.0009271171,0.0004613714,0.000020925081],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0018673154,0.0010063758,0.60736096,0.0010392038,0.0012527099,0.000029395242,0.0016199839,0.000027173915,0.0435509,0.2698699,0.06710342,0.00527268],"study_design_scores_gemma":[0.0007038901,0.000034205594,0.092477694,0.0006712864,0.00013425469,0.000015021799,0.00021015416,0.000016287748,0.04273868,0.8609402,0.0017471878,0.00031114643],"about_ca_topic_score_codex":0.00015097318,"about_ca_topic_score_gemma":0.0000075376324,"teacher_disagreement_score":0.5910703,"about_ca_system_score_codex":0.000037893537,"about_ca_system_score_gemma":0.00007216434,"threshold_uncertainty_score":0.976386},"labels":[],"label_agreement":null},{"id":"W2927674350","doi":"10.1016/j.jctb.2019.03.003","title":"Tools for counting odd cycles in graphs","year":2019,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia, Okanagan Campus; University of British Columbia","funders":"","keywords":"Combinatorics; Bipartite graph; Mathematics; Vertex (graph theory); Graph; Chordal graph; Discrete mathematics","score_opus":0.023085181156103293,"score_gpt":0.28879435769302014,"score_spread":0.26570917653691684,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2927674350","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98731536,0.00018178172,0.00017834318,0.00006742883,0.008213163,0.00031049756,0.000006550552,0.00001691089,0.0037099451],"genre_scores_gemma":[0.99736524,0.00003705279,0.0018643048,0.00005627375,0.00045098262,0.0000045487645,7.5764586e-7,0.00003156109,0.00018927334],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99840516,0.00019988079,0.0007119331,0.0001207665,0.00030142005,0.00026083805],"domain_scores_gemma":[0.99638397,0.0024788883,0.0005861506,0.0002398652,0.00025320242,0.00005790326],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002752072,0.00017392417,0.00052639813,0.00019749724,0.00011272695,0.00009317272,0.00039301484,0.00013678799,0.0001142395],"category_scores_gemma":[0.0014699018,0.00013406613,0.00027006798,0.00016289044,0.00009762105,0.000740396,0.00007039023,0.00030444548,0.0000013944878],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014516625,0.00006539734,0.001182833,0.00009764685,0.00007519547,0.000007418551,0.0009371593,0.000005995757,0.000519726,0.9943478,0.00025266025,0.0010564798],"study_design_scores_gemma":[0.00209368,0.0004216201,0.00043776282,0.00012556852,0.000036378824,0.000046048575,0.0010986414,0.0000031496077,0.0018779914,0.9886669,0.005028831,0.00016341692],"about_ca_topic_score_codex":5.623179e-7,"about_ca_topic_score_gemma":7.77381e-7,"teacher_disagreement_score":0.0100498665,"about_ca_system_score_codex":0.00004547214,"about_ca_system_score_gemma":0.00006079686,"threshold_uncertainty_score":0.5467058},"labels":[],"label_agreement":null},{"id":"W2930922866","doi":"10.4171/jca/51","title":"Words, permutations, and the nonsolvable length of a finite group","year":2021,"lang":"en","type":"preprint","venue":"Journal of Combinatorial Algebra","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Mathematics; Combinatorics; Bounded function; Conjecture; Word (group theory); Permutation (music); Group (periodic table); Finite group; Discrete mathematics; Geometry; Physics; Mathematical analysis","score_opus":0.017001273348454398,"score_gpt":0.2712576623402937,"score_spread":0.2542563889918393,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2930922866","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9799037,0.005225823,0.0015550321,0.0004861897,0.01116341,0.00037888583,0.000018630004,0.0000141594965,0.0012541492],"genre_scores_gemma":[0.99461424,0.00091738766,0.0034710045,0.000056150577,0.0008473552,0.0000069796124,0.0000036898869,0.000032753014,0.00005045295],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973208,0.00055480853,0.0011346376,0.00018180629,0.0006241488,0.00018381448],"domain_scores_gemma":[0.99431926,0.0028873172,0.0016910352,0.00047947268,0.00053402816,0.00008886663],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020673026,0.0002686611,0.0010335668,0.00017443932,0.00019214216,0.00013309444,0.0005645891,0.0002978454,0.00007359661],"category_scores_gemma":[0.0022064848,0.00016813177,0.00050823344,0.00015550216,0.00036854466,0.00012177367,0.00067299325,0.0012607392,2.0908135e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00042540033,0.00014452895,0.000107527085,0.00033178626,0.00060735265,0.000027117936,0.004744779,0.000021302205,0.000020297999,0.99245095,0.0006090142,0.000509924],"study_design_scores_gemma":[0.003240693,0.00011896212,0.00017892332,0.00046099126,0.00047780844,0.00007791881,0.00081128493,0.000080418125,0.00015815928,0.99373066,0.0004946577,0.00016950046],"about_ca_topic_score_codex":0.000014577252,"about_ca_topic_score_gemma":0.0000025483055,"teacher_disagreement_score":0.0147105055,"about_ca_system_score_codex":0.000037099064,"about_ca_system_score_gemma":0.00021751318,"threshold_uncertainty_score":0.68562144},"labels":[],"label_agreement":null},{"id":"W2939128356","doi":"10.4153/s000843951900016x","title":"The Shifted Turán Sieve Method on Tournaments","year":2019,"lang":"en","type":"article","venue":"Canadian Mathematical Bulletin","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Sieve (category theory); Combinatorics; Construct (python library); Discrete mathematics; Computer science","score_opus":0.01583760998133961,"score_gpt":0.28686725495095106,"score_spread":0.27102964496961146,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2939128356","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.51582557,0.00012321719,0.0018004465,0.017709805,0.001121566,0.0017318773,0.00005297895,0.00017298141,0.46146154],"genre_scores_gemma":[0.9366041,0.000011572584,0.023276115,0.005029919,0.00024997778,0.00006864528,0.000004754796,0.00012594294,0.034628965],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979909,0.00022715307,0.00041778947,0.00030770036,0.0003885099,0.00066794315],"domain_scores_gemma":[0.99564487,0.0028400437,0.000112004214,0.00084644667,0.00006390618,0.0004927288],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0011724287,0.00026147332,0.00034197647,0.00010398332,0.00040595053,0.00011988303,0.00060681166,0.00017232499,0.014915668],"category_scores_gemma":[0.0013813624,0.00015957518,0.00017494509,0.00013843551,0.00010628446,0.000018933335,0.00007702975,0.0004366556,0.0071447855],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019655467,0.000021957123,0.000031614894,0.00004804681,0.0000586937,0.000018337108,0.00041042533,0.0000015170714,0.000011514859,0.96459335,0.033094034,0.0016908648],"study_design_scores_gemma":[0.0002652672,0.00006512576,0.00012277477,0.000082621285,0.000024970797,0.000024346973,0.00022828583,0.00012764697,0.000117508964,0.83572537,0.16300465,0.00021142895],"about_ca_topic_score_codex":0.000115994015,"about_ca_topic_score_gemma":0.00022989171,"teacher_disagreement_score":0.42683256,"about_ca_system_score_codex":0.00016492762,"about_ca_system_score_gemma":0.00009044366,"threshold_uncertainty_score":0.99362826},"labels":[],"label_agreement":null},{"id":"W2939652507","doi":"10.19086/aic.12100","title":"Planar graphs have bounded nonrepetitive chromatic number","year":2020,"lang":"en","type":"article","venue":"Advances in Combinatorics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":25,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"Australian Research Council; Ontario Ministry of Research and Innovation; Natural Sciences and Engineering Research Council of Canada; Agence Nationale de la Recherche","keywords":"Bounded function; Sequence (biology); Complete coloring; Integer (computer science); Brooks' theorem; Fractional coloring; Fibonacci number; Binary number; Integer sequence","score_opus":0.02681826898518669,"score_gpt":0.31279177893014104,"score_spread":0.28597350994495435,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2939652507","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.79394954,0.0037114832,0.007253339,0.0010619228,0.0033422632,0.0013353216,0.00006286157,0.0005910684,0.18869218],"genre_scores_gemma":[0.99429196,0.00046085534,0.004453845,0.00054613216,0.00006261813,0.00002865793,0.000005814154,0.00004156047,0.00010855263],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983643,0.00011892367,0.00042853184,0.00036692878,0.00036269016,0.00035858515],"domain_scores_gemma":[0.99852306,0.00074686465,0.00018072565,0.0003431174,0.00006986378,0.00013636265],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021993488,0.00025781177,0.00041771505,0.00006417998,0.00017897988,0.00003252795,0.0003997602,0.00012146105,0.00011518476],"category_scores_gemma":[0.00064567337,0.00023269276,0.00011069201,0.00044555505,0.00016955742,0.0003357082,0.000110964356,0.00036916256,0.00002346115],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000033770786,0.00008212397,0.012048677,0.00019031946,0.000023956802,0.000064229134,0.0024050237,0.000004269362,0.000009083464,0.9842692,0.00044654642,0.00042278075],"study_design_scores_gemma":[0.0008272422,0.00009224771,0.0004232215,0.00006369188,0.000022183736,0.000013334161,0.0005346609,0.0001443416,0.00027911467,0.9901031,0.00720282,0.00029401033],"about_ca_topic_score_codex":0.000004529292,"about_ca_topic_score_gemma":0.000014445286,"teacher_disagreement_score":0.2003424,"about_ca_system_score_codex":0.000070927825,"about_ca_system_score_gemma":0.000027409784,"threshold_uncertainty_score":0.9488936},"labels":[],"label_agreement":null},{"id":"W2946174826","doi":"10.1017/s0963548322000281","title":"On mappings on the hypercube with small average stretch","year":2022,"lang":"en","type":"article","venue":"Combinatorics Probability Computing","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Bijection; Combinatorics; Hypercube; Physics; Mathematics","score_opus":0.05258960458816773,"score_gpt":0.2450905242325298,"score_spread":0.19250091964436208,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2946174826","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9902123,0.000022314916,0.0006749776,0.00056914875,0.0006106591,0.0007620816,0.000007403332,0.00019642955,0.006944687],"genre_scores_gemma":[0.9981216,7.546025e-7,0.001034719,0.0006229406,0.000043603803,0.00003165389,0.0000030802594,0.00004127657,0.00010034171],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975471,0.0005442082,0.00035705167,0.00052551465,0.0006104876,0.00041567572],"domain_scores_gemma":[0.9956302,0.0029395912,0.000215265,0.001031154,0.00011035712,0.000073411065],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0019141899,0.00028744683,0.00030949415,0.00007821356,0.0017632869,0.00005541827,0.0007958725,0.00005965218,0.00013529629],"category_scores_gemma":[0.0006881811,0.00018891558,0.00012470773,0.0004973219,0.00014438193,0.000026273141,0.00074067106,0.0010411964,0.0000036488186],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000064875094,0.00035220408,0.00084555824,0.000074666,0.000039916504,0.000011165176,0.0022388315,0.0013002583,0.000005744681,0.99299026,0.00037320773,0.0017033451],"study_design_scores_gemma":[0.00045854168,0.00057792134,0.0005650063,0.00004120633,0.000017077959,0.000018539284,0.00029216916,0.0030044501,0.000099250086,0.9940416,0.00062221254,0.00026201957],"about_ca_topic_score_codex":0.0000069221724,"about_ca_topic_score_gemma":0.0000011886249,"teacher_disagreement_score":0.0079093315,"about_ca_system_score_codex":0.000304098,"about_ca_system_score_gemma":0.00005545576,"threshold_uncertainty_score":0.9995363},"labels":[],"label_agreement":null},{"id":"W2948759546","doi":"10.48550/arxiv.1906.02886","title":"Sandwiching random regular graphs between binomial random graphs","year":2019,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Combinatorics; Mathematics; Conjecture; Random graph; Random regular graph; Discrete mathematics; Graph; Chordal graph; 1-planar graph","score_opus":0.06931662440603178,"score_gpt":0.2151615063260942,"score_spread":0.14584488192006242,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2948759546","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9644169,0.00021107883,0.024211148,0.00002878539,0.0019029445,0.0012842913,0.00014335796,0.00035706637,0.007444406],"genre_scores_gemma":[0.99656683,0.00030605108,0.0006841473,0.00005873121,0.00031094733,0.0000026415773,0.00007519978,0.000113911665,0.0018815337],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99621576,0.0006985449,0.0006450353,0.0014644702,0.00025131798,0.0007248917],"domain_scores_gemma":[0.99520546,0.0015028538,0.00073745736,0.0020909351,0.00018196073,0.00028133678],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011901341,0.0008452097,0.0015983359,0.0007976624,0.0005743048,0.0001225437,0.0016497257,0.0010152083,0.00016562224],"category_scores_gemma":[0.00026738655,0.00081909006,0.0014100246,0.0005531343,0.00040173045,0.0002243033,0.001746969,0.001618817,0.000034818975],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0017363424,0.000093932824,0.024067672,0.00066040875,0.0016909388,0.0002020737,0.0009982007,0.007350123,0.00005096943,0.9610328,0.0017877667,0.00032876802],"study_design_scores_gemma":[0.009620802,0.000056168115,0.001053324,0.0002764627,0.0012084374,0.0000057266075,0.00015859342,0.0019364068,0.00017767953,0.98395926,0.0005603715,0.0009867802],"about_ca_topic_score_codex":0.00008854622,"about_ca_topic_score_gemma":0.00001808073,"teacher_disagreement_score":0.032149915,"about_ca_system_score_codex":0.00013867492,"about_ca_system_score_gemma":0.00014378273,"threshold_uncertainty_score":0.999426},"labels":[],"label_agreement":null},{"id":"W2949184891","doi":"10.48550/arxiv.math/0612751","title":"Hamilton cycles in highly connected and expanding graphs","year":2006,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Disjoint sets; Combinatorics; Indifference graph; Random graph; Enhanced Data Rates for GSM Evolution; Mathematics; Cograph; Variety (cybernetics); Graph; Dense graph; Pathwidth; Chordal graph; Discrete mathematics; Computer science; 1-planar graph; Line graph; Artificial intelligence; Statistics","score_opus":0.052305834273447475,"score_gpt":0.30698404239752103,"score_spread":0.25467820812407355,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2949184891","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9946603,0.00079760834,0.00007437874,0.000054644275,0.0007057949,0.00038654302,0.000032562337,0.00017439494,0.0031137308],"genre_scores_gemma":[0.9978427,0.00022135877,0.001363658,0.00008263872,0.00014268432,0.00004080525,0.000036396115,0.00006325244,0.0002064578],"study_design_codex":"observational","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981164,0.00015229957,0.00055120693,0.0005958218,0.00020421698,0.00038005566],"domain_scores_gemma":[0.9984567,0.00049032347,0.00027007557,0.000656659,0.000051151772,0.000075096454],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00036815793,0.0004102985,0.00061221543,0.00035416064,0.00016882208,0.000055524102,0.00033329698,0.00048932433,0.000027182874],"category_scores_gemma":[0.00019948403,0.00035980964,0.00014835465,0.00016634441,0.00019564969,0.000066716464,0.0005500251,0.0007672238,0.0000030523408],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000048515125,0.00009274972,0.844247,0.00063150126,0.00012610797,0.00007578517,0.002850128,0.000026545124,0.00076345255,0.1497066,0.0008319045,0.0005997295],"study_design_scores_gemma":[0.00047012357,0.0000185057,0.35919252,0.00032409615,0.000056254656,0.00000776101,0.00010143735,0.00004632311,0.00091189286,0.6383208,0.00015335203,0.00039695355],"about_ca_topic_score_codex":0.00022182292,"about_ca_topic_score_gemma":0.00018979397,"teacher_disagreement_score":0.48861417,"about_ca_system_score_codex":0.000052365078,"about_ca_system_score_gemma":0.000025311567,"threshold_uncertainty_score":0.9998854},"labels":[],"label_agreement":null},{"id":"W2949316574","doi":"10.48550/arxiv.1209.5126","title":"Integral Cayley multigraphs over Abelian and Hamiltonian groups","year":2012,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Mathematics; Abelian group; Multigraph; Cayley graph; Converse; Cayley's theorem; Hamiltonian (control theory); Cayley transform; Combinatorics; Character (mathematics); Multiset; Discrete mathematics; Pure mathematics; Algebra over a field; Graph; Voltage graph; Line graph","score_opus":0.0840628881550292,"score_gpt":0.2174213999453035,"score_spread":0.1333585117902743,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2949316574","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99057454,0.00029197725,0.0025510406,0.000019045257,0.0009894393,0.00038316782,0.00008267268,0.0002014305,0.0049067033],"genre_scores_gemma":[0.9964891,0.00032129878,0.0015166168,0.000089206456,0.00018318335,0.0000013172673,0.000017846067,0.0000605823,0.001320815],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980457,0.00018066105,0.00027673115,0.00084344915,0.000110510744,0.00054298533],"domain_scores_gemma":[0.9979391,0.0002598933,0.0002904783,0.0011037657,0.000091767826,0.0003150123],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00035326518,0.0005413469,0.00056737283,0.0003519274,0.00032582573,0.00006166631,0.0006686721,0.0006403123,0.00016943619],"category_scores_gemma":[0.00009357138,0.0005133763,0.0003407447,0.00025761014,0.00043892628,0.00019480094,0.0014490284,0.0010645402,0.00001204799],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007863942,0.00009725278,0.031418387,0.00029112995,0.0003061058,0.000098125005,0.0019862908,0.00010551055,0.000036159174,0.9646635,0.000455932,0.0004629429],"study_design_scores_gemma":[0.00083908666,0.000035290297,0.023072997,0.00019224167,0.0004359093,0.000014312899,0.00045020963,0.003055636,0.000058462756,0.9701317,0.0008782156,0.0008359648],"about_ca_topic_score_codex":0.000275324,"about_ca_topic_score_gemma":0.00024756815,"teacher_disagreement_score":0.008345389,"about_ca_system_score_codex":0.00010481311,"about_ca_system_score_gemma":0.00004353518,"threshold_uncertainty_score":0.9997318},"labels":[],"label_agreement":null},{"id":"W2949588819","doi":"10.48550/arxiv.1303.5139","title":"The first k-regular subgraph is large","year":2013,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick; University of Toronto","funders":"","keywords":"Combinatorics; Mathematics; Sigma; Graph; Discrete mathematics; Physics","score_opus":0.061472398160331385,"score_gpt":0.19835311084942234,"score_spread":0.13688071268909097,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2949588819","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9768599,0.0005448963,0.0059501226,0.00041962642,0.0015962232,0.00084892346,0.00011381786,0.0002971629,0.013369326],"genre_scores_gemma":[0.99068,0.000779482,0.00018292251,0.00026722864,0.00016168978,0.0000029359355,0.000008429848,0.00005541817,0.007861885],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981118,0.00013321113,0.00027788497,0.00076672813,0.00013875436,0.000571646],"domain_scores_gemma":[0.9968529,0.000498168,0.00033860916,0.001978617,0.00018689054,0.00014485486],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00045184244,0.00044313943,0.00041367576,0.00015433671,0.0012168451,0.00012717364,0.0016036136,0.00050402933,0.00040003544],"category_scores_gemma":[0.00010081756,0.00033847147,0.000545534,0.00029826676,0.0003540488,0.00010927182,0.002000558,0.0008374425,0.00008512112],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028343427,0.000050146555,0.0017714726,0.00012912283,0.0002949302,0.00004504245,0.0005524185,0.00015818665,9.692299e-7,0.96860355,0.028290674,0.00007512587],"study_design_scores_gemma":[0.00036749608,0.00001887194,0.0006193705,0.00007369008,0.00019427219,0.000003106851,0.00022336462,0.0037721645,0.000048685153,0.94723725,0.047018275,0.00042345657],"about_ca_topic_score_codex":0.000056887784,"about_ca_topic_score_gemma":0.000108819026,"teacher_disagreement_score":0.02136632,"about_ca_system_score_codex":0.00009033551,"about_ca_system_score_gemma":0.00005350768,"threshold_uncertainty_score":0.9999067},"labels":[],"label_agreement":null},{"id":"W2949707381","doi":"10.48550/arxiv.1005.1285","title":"Asymptotic enumeration of strongly connected digraphs by vertices and edges","year":2010,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Digraph; Combinatorics; Enumeration; Mathematics; Strongly connected component; Discrete mathematics","score_opus":0.052962314212464404,"score_gpt":0.20203884902853725,"score_spread":0.14907653481607286,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2949707381","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9925304,0.00015328582,0.0054966095,0.0000137114685,0.00037919794,0.00025515578,0.00008279862,0.00007132303,0.001017528],"genre_scores_gemma":[0.998955,0.00016841647,0.00046681773,0.0000106151165,0.00004046272,6.0186414e-7,0.000028272663,0.000023013747,0.00030679873],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99888575,0.00012097062,0.00022946384,0.00048956164,0.00007808417,0.00019615538],"domain_scores_gemma":[0.9984616,0.0003975136,0.0003357595,0.00056774437,0.00014312234,0.00009426871],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00017454513,0.00026544914,0.0003920235,0.00016605074,0.00015621731,0.00003411447,0.00036862213,0.00041805016,0.000070515016],"category_scores_gemma":[0.00017185516,0.00026427276,0.00013262726,0.0001462055,0.00032111013,0.00011912594,0.00044772698,0.00054463645,0.0000011147671],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012645389,0.00012975457,0.010655792,0.0005507643,0.00040389426,0.000016255202,0.0012051936,0.00054311665,0.0021836858,0.9833072,0.000518806,0.0003590802],"study_design_scores_gemma":[0.0007822081,0.00010026405,0.0031153208,0.00013601613,0.00052880397,0.0000032013922,0.0003218511,0.007419981,0.0036339522,0.9832651,0.00020591186,0.00048737973],"about_ca_topic_score_codex":0.00005018272,"about_ca_topic_score_gemma":0.000050018716,"teacher_disagreement_score":0.0075404714,"about_ca_system_score_codex":0.00002179566,"about_ca_system_score_gemma":0.000041209354,"threshold_uncertainty_score":0.9999809},"labels":[],"label_agreement":null},{"id":"W2950131058","doi":"10.4153/cmb-2015-036-2","title":"Character Sums Over Bohr Sets","year":2015,"lang":"en","type":"article","venue":"Canadian Mathematical Bulletin","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"National Science Foundation","keywords":"Mathematics; Character (mathematics); Modulo; Bohr model; Prime (order theory); Combinatorics; Arithmetic; Pure mathematics; Geometry; Quantum mechanics","score_opus":0.053817502071482476,"score_gpt":0.2926646523264428,"score_spread":0.2388471502549603,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2950131058","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7352106,0.000115152034,0.0005169048,0.0059290985,0.0006618404,0.00061811716,0.00008760424,0.00020612044,0.2566546],"genre_scores_gemma":[0.9793708,0.0000032234313,0.0069893845,0.0033770017,0.00030659107,0.000039871567,0.000013437116,0.00009181045,0.0098078875],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99820274,0.000098578035,0.0003992513,0.0002961946,0.00035552558,0.00064772746],"domain_scores_gemma":[0.9975161,0.00036867728,0.000082827115,0.0006326226,0.00010301585,0.0012967809],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00070153596,0.00026490426,0.0003840722,0.00015902889,0.00018108291,0.00007685144,0.00038608036,0.00021389127,0.019454097],"category_scores_gemma":[0.0014734077,0.00021278206,0.00013665776,0.00013154116,0.00016692077,0.00004387792,0.00008813619,0.00029804744,0.005138983],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008806691,0.000030343002,0.00012463133,0.00006487171,0.000032940723,0.00007479751,0.0009715653,1.987186e-7,0.000005781186,0.77787447,0.22040246,0.00040913856],"study_design_scores_gemma":[0.0003219917,0.000027840353,0.00021217146,0.000048288417,0.000029729255,0.00005720782,0.00012991989,0.00005229356,0.000036334033,0.75304216,0.24577907,0.00026298946],"about_ca_topic_score_codex":0.00031026127,"about_ca_topic_score_gemma":0.00045300747,"teacher_disagreement_score":0.2468467,"about_ca_system_score_codex":0.00017436691,"about_ca_system_score_gemma":0.00017893767,"threshold_uncertainty_score":0.9956356},"labels":[],"label_agreement":null},{"id":"W2950211861","doi":"10.48550/arxiv.1501.01088","title":"Triangle-free graphs with the maximum number of cycles","year":2015,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Combinatorics; Mathematics","score_opus":0.09451073237587256,"score_gpt":0.22522059207263764,"score_spread":0.13070985969676507,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2950211861","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9599613,0.00006604908,0.0031462198,0.00008881392,0.0003169092,0.0004344449,0.00009978347,0.00010185312,0.035784625],"genre_scores_gemma":[0.99721646,0.000056206864,0.00096447446,0.000038520975,0.000065095,0.000001206768,0.000007693308,0.000044089742,0.0016062331],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99855626,0.00024253465,0.00023527605,0.0005177303,0.00016910184,0.00027907436],"domain_scores_gemma":[0.99672943,0.000415731,0.00048519278,0.0019883446,0.00026824523,0.00011302469],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054170965,0.0003537863,0.00056281855,0.00013778373,0.00017271,0.000025908,0.0016300152,0.00031462807,0.0001332837],"category_scores_gemma":[0.00014687469,0.00023527048,0.00032765136,0.00035991898,0.0005702665,0.000079105936,0.0014755689,0.00060718454,0.0000074414484],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003183735,0.00007753831,0.0037840619,0.00018760264,0.00043932608,0.00008617117,0.0008861452,0.0011844344,0.0000024827093,0.9874368,0.0054809786,0.00011611829],"study_design_scores_gemma":[0.0010608205,0.00004124535,0.0003339457,0.00010034725,0.00043295222,0.000012868718,0.0007762234,0.00033043785,0.00005093,0.99606395,0.00048298712,0.00031331927],"about_ca_topic_score_codex":0.00008250867,"about_ca_topic_score_gemma":0.00008965003,"teacher_disagreement_score":0.037255175,"about_ca_system_score_codex":0.00005983748,"about_ca_system_score_gemma":0.00012296833,"threshold_uncertainty_score":0.9594052},"labels":[],"label_agreement":null},{"id":"W2950225607","doi":"10.48550/arxiv.1406.2588","title":"The critical number of dense triangle-free binary matroids","year":2014,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Matroid; Combinatorics; Conjecture; Mathematics; Integer (computer science); Binary number; Simple (philosophy); Discrete mathematics; Arithmetic; Computer science","score_opus":0.07468916444716486,"score_gpt":0.24552674492625368,"score_spread":0.1708375804790888,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2950225607","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97029996,0.00015142253,0.0094179865,0.00017363964,0.0012933289,0.00032997713,0.00006704571,0.00012712814,0.018139483],"genre_scores_gemma":[0.99588734,0.0001591084,0.0012486754,0.00004445092,0.00018017669,0.0000011012929,0.0000034262794,0.000044527063,0.002431173],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980762,0.00044834384,0.0004084166,0.00054494204,0.00014702688,0.00037505792],"domain_scores_gemma":[0.99445736,0.002698139,0.0003210721,0.0021631825,0.00022758248,0.00013264192],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008082373,0.00033674247,0.000609366,0.00011117209,0.0003918909,0.000040316183,0.0016433779,0.00044124163,0.0001784743],"category_scores_gemma":[0.0016032521,0.00026455094,0.00057145476,0.00019393407,0.00079651613,0.000062005885,0.0022906205,0.0007208466,0.000022810216],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022276031,0.00006623361,0.0009690063,0.0003136929,0.00017096088,0.0000910166,0.00018158407,0.00030589759,0.000009381994,0.9937478,0.0038266003,0.00009510403],"study_design_scores_gemma":[0.00061638834,0.000043171713,0.0002700871,0.00014889496,0.00033015272,0.000015772352,0.00017698183,0.0032836343,0.00006242648,0.99393886,0.0008124356,0.0003012045],"about_ca_topic_score_codex":0.000025063608,"about_ca_topic_score_gemma":0.000013505881,"teacher_disagreement_score":0.025587372,"about_ca_system_score_codex":0.00007075953,"about_ca_system_score_gemma":0.00008069033,"threshold_uncertainty_score":0.9999807},"labels":[],"label_agreement":null},{"id":"W2950318982","doi":"10.37236/1020","title":"On Directed Triangles in Digraphs","year":2007,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":25,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Purdue University; American Institute of Mathematics; National Science Foundation","keywords":"Combinatorics; Digraph; Mathematics; Conjecture; Vertex (graph theory); Directed graph; Discrete mathematics; Graph","score_opus":0.013332598025477487,"score_gpt":0.2875840749563781,"score_spread":0.27425147693090063,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2950318982","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9923702,0.0015326588,0.0012984624,0.00018211176,0.0005875789,0.00011782229,3.1085372e-7,0.000023639732,0.0038872492],"genre_scores_gemma":[0.99939704,0.00025059225,0.000025447614,0.00007369031,0.00007877083,6.772296e-7,1.3738489e-7,0.000019848387,0.0001537775],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982908,0.00016823036,0.00053830293,0.00008088234,0.00040455378,0.00051726686],"domain_scores_gemma":[0.99734455,0.0018762493,0.00038604392,0.00025355362,0.00008512395,0.000054449145],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035183993,0.00014297444,0.00029433615,0.00028360868,0.00012743032,0.0000153829,0.0004848714,0.00008447139,0.000011309035],"category_scores_gemma":[0.0007420416,0.000083431,0.00016433441,0.00058570754,0.00006639655,0.00005991996,0.000031983585,0.00093531446,8.9674387e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029995514,0.00014202132,0.000288939,0.000005746329,0.000060153474,0.0000213308,0.0006020244,0.0000039009965,0.00003272755,0.997085,0.0004399441,0.001018261],"study_design_scores_gemma":[0.0012301682,0.00047878324,0.00108576,0.00003549997,0.00003381324,0.00008131108,0.00013810273,0.000008688366,0.0008055627,0.994861,0.0011440734,0.00009724327],"about_ca_topic_score_codex":0.000001880454,"about_ca_topic_score_gemma":0.000018011246,"teacher_disagreement_score":0.007026892,"about_ca_system_score_codex":0.0002089086,"about_ca_system_score_gemma":0.00009821714,"threshold_uncertainty_score":0.4063528},"labels":[],"label_agreement":null},{"id":"W2950345959","doi":"10.48550/arxiv.1401.2710","title":"The threshold for combs in random graphs","year":2014,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Combinatorics; Conjecture; Mathematics; Vertex (graph theory); Disjoint sets; Graph; Path (computing); Binary logarithm; Discrete mathematics; Computer science","score_opus":0.08695716559984906,"score_gpt":0.22295914113085444,"score_spread":0.13600197553100538,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2950345959","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96119654,0.00018247431,0.023020012,0.00009683836,0.0014044228,0.0014431379,0.00004245874,0.00013026528,0.012483857],"genre_scores_gemma":[0.9978788,0.00024634358,0.0002697413,0.00007358836,0.000084372834,0.0000065654585,0.000009582674,0.000038257866,0.0013927561],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984999,0.00017278278,0.0002912672,0.00057271024,0.00007726512,0.00038610472],"domain_scores_gemma":[0.9965857,0.0018584632,0.0002703188,0.0011054322,0.000100866135,0.00007921972],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00097255304,0.00031674324,0.00048410535,0.00017928188,0.00043561382,0.000057183956,0.0010884622,0.0003620424,0.000016140953],"category_scores_gemma":[0.00024505847,0.0002421515,0.00044623346,0.00019509395,0.000287919,0.000048630278,0.0007404639,0.0006236296,0.0000032054359],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00039552336,0.000034635428,0.001511662,0.00014177288,0.00011201498,0.000014616383,0.00020861247,0.003707079,0.0000018775996,0.9924874,0.0012766598,0.0001081944],"study_design_scores_gemma":[0.0021228944,0.00003279102,0.00021166528,0.0000855959,0.00012215723,0.0000012463282,0.00011847603,0.016350409,0.000022427512,0.9787179,0.0019164664,0.00029794854],"about_ca_topic_score_codex":0.000022939117,"about_ca_topic_score_gemma":0.00017149611,"teacher_disagreement_score":0.03668226,"about_ca_system_score_codex":0.000075806674,"about_ca_system_score_gemma":0.00005816111,"threshold_uncertainty_score":0.9874651},"labels":[],"label_agreement":null},{"id":"W2950365644","doi":"","title":"Rational decomposition of dense hypergraphs and some related eigenvalue estimates","year":2011,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Hypergraph; Eigenvalues and eigenvectors; Decomposition; Mathematics; Combinatorics; Scheme (mathematics); Discrete mathematics; Mathematical analysis; Physics","score_opus":0.07312652253199978,"score_gpt":0.22128160941890948,"score_spread":0.1481550868869097,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2950365644","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9940868,0.00027847363,0.0030120693,0.0000080734435,0.00029194338,0.00024161523,0.00003781198,0.00008018544,0.0019630052],"genre_scores_gemma":[0.99620306,0.0003327216,0.0031641105,0.000015436737,0.000026296999,6.591256e-7,0.000024962881,0.000025747939,0.000206985],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99887526,0.00011332427,0.0002896942,0.00047585837,0.000071669434,0.00017417503],"domain_scores_gemma":[0.99865043,0.0002909632,0.00035805936,0.0004822222,0.00013028755,0.000088022956],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00020615668,0.00026018437,0.00039543567,0.00026913692,0.00017565014,0.00001455831,0.00029220278,0.00036446276,0.00010118961],"category_scores_gemma":[0.00008311693,0.00026632947,0.00019470672,0.00013953875,0.0003193898,0.00013611869,0.00052334066,0.00034871243,0.00000325625],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009396774,0.00007007294,0.004084233,0.00021889881,0.0002709979,0.00004395019,0.00051566807,0.0015834377,0.00027791428,0.99273247,0.00005600872,0.00005237609],"study_design_scores_gemma":[0.00039634897,0.000043957996,0.0031818764,0.00014858072,0.0003401624,0.000015946856,0.0000568393,0.006433017,0.0013280945,0.987785,0.000004252273,0.0002659248],"about_ca_topic_score_codex":0.000034109078,"about_ca_topic_score_gemma":0.0000059222307,"teacher_disagreement_score":0.004947476,"about_ca_system_score_codex":0.00003748454,"about_ca_system_score_gemma":0.00004121055,"threshold_uncertainty_score":0.9999789},"labels":[],"label_agreement":null},{"id":"W2950451213","doi":"10.48550/arxiv.1505.08044","title":"Positive independence densities of finite rank countable hypergraphs are achieved by finite hypergraphs","year":2015,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Hypergraph; Countable set; Independence (probability theory); Mathematics; Independence number; Bounded function; Combinatorics; Rank (graph theory); Discrete mathematics; Set (abstract data type); Finite set; Independent set; Statistics; Graph; Computer science; Mathematical analysis","score_opus":0.06729027525054163,"score_gpt":0.2113944391232576,"score_spread":0.14410416387271596,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2950451213","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9816279,0.00064639066,0.0074765687,0.00003251721,0.0007838741,0.0006117943,0.0014339124,0.00018955003,0.007197484],"genre_scores_gemma":[0.995713,0.0006019265,0.00056970416,0.00013198282,0.00006952728,0.0000027235926,0.000109061926,0.00008206003,0.0027199895],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9968986,0.0004501634,0.00055935606,0.0011063338,0.00038764247,0.0005979004],"domain_scores_gemma":[0.99493843,0.0013652703,0.001018632,0.0014558467,0.00095134776,0.00027049892],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007471412,0.00074077013,0.0011885548,0.00052902853,0.0003494763,0.000063442116,0.0013144829,0.0009561656,0.000095252384],"category_scores_gemma":[0.00048799376,0.0007665726,0.0005565153,0.00066275493,0.0007496236,0.0002810893,0.0014483515,0.0013317064,0.000011924574],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0024912707,0.00090833154,0.03953854,0.0018960948,0.0033576323,0.0009595146,0.0074077793,0.05126039,0.000565398,0.8760531,0.0153745515,0.00018739223],"study_design_scores_gemma":[0.0016820345,0.00016467327,0.0008199921,0.0006658077,0.00085410726,0.00001512249,0.002788163,0.007318708,0.0011524973,0.9829757,0.0003683886,0.0011947801],"about_ca_topic_score_codex":0.00033944508,"about_ca_topic_score_gemma":0.00012607992,"teacher_disagreement_score":0.10692262,"about_ca_system_score_codex":0.0001906069,"about_ca_system_score_gemma":0.00025115043,"threshold_uncertainty_score":0.9994785},"labels":[],"label_agreement":null},{"id":"W2950530433","doi":"10.48550/arxiv.1611.09545","title":"New Bounds for Chromatic Polynomials and Chromatic Roots","year":2016,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Combinatorics; Chromatic polynomial; Upper and lower bounds; Graph; Chromatic scale; Order (exchange); Mathematics; Degree (music); Physics; Discrete mathematics; Mathematical analysis","score_opus":0.08582162994517248,"score_gpt":0.22826089986424092,"score_spread":0.14243926991906844,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2950530433","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8693706,0.00025613428,0.123342134,0.00011907446,0.00094672304,0.0011575695,0.00010863294,0.00022494764,0.004474202],"genre_scores_gemma":[0.9878366,0.000099690675,0.0043731583,0.00005872251,0.0003667841,0.000003348034,0.000009501236,0.00006962568,0.007182563],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982015,0.00011694431,0.00036556166,0.00078866247,0.00008994147,0.00043740182],"domain_scores_gemma":[0.99731606,0.0008794669,0.0004442631,0.0010209092,0.00008087053,0.0002584079],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00036049672,0.00046952764,0.00073726627,0.00024775154,0.00033348016,0.0000887769,0.0006702095,0.00047190857,0.0001700995],"category_scores_gemma":[0.00027120308,0.00040404574,0.00032408163,0.0001293943,0.00020764722,0.0001484211,0.00094198255,0.0002710365,0.0000111190175],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010860398,0.00004175776,0.0005143473,0.0014644855,0.00047787192,0.000037287147,0.00055735296,0.000070658156,0.00019216073,0.9887562,0.006836894,0.0009424151],"study_design_scores_gemma":[0.0011959912,0.000074812204,0.00062422163,0.0004725201,0.00045069537,0.000010880868,0.00006851753,0.0017835597,0.00019220324,0.99401575,0.0005815536,0.0005292873],"about_ca_topic_score_codex":0.000029114379,"about_ca_topic_score_gemma":0.000027507815,"teacher_disagreement_score":0.11896898,"about_ca_system_score_codex":0.00016067523,"about_ca_system_score_gemma":0.00019654784,"threshold_uncertainty_score":0.99984115},"labels":[],"label_agreement":null},{"id":"W2950545301","doi":"10.37236/5003","title":"On-line List Colouring of Random Graphs","year":2015,"lang":"en","type":"preprint","venue":"The Electronic Journal of Combinatorics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada; Deutscher Akademischer Austauschdienst; National Science Foundation","keywords":"Combinatorics; Line (geometry); Mathematics; Random graph; Computer science; Graph","score_opus":0.03752218687408864,"score_gpt":0.3135732293580333,"score_spread":0.27605104248394463,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2950545301","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98100376,0.007963748,0.003964525,0.0003580046,0.003123607,0.00044615337,0.000011042394,0.000027635147,0.0031015256],"genre_scores_gemma":[0.9979767,0.0014000407,0.00005224153,0.00004356406,0.0002023947,0.0000042834017,0.0000015401135,0.000057390607,0.00026184312],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9966506,0.000486904,0.0011693919,0.00018025572,0.0009648556,0.0005480029],"domain_scores_gemma":[0.99421716,0.0016653051,0.0023143657,0.00080956845,0.0008776927,0.00011590612],"candidate_categories":["research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0049578245,0.0003799364,0.0011349785,0.00029627365,0.00016668615,0.000035919566,0.00156417,0.0003136512,0.000020769936],"category_scores_gemma":[0.0013484529,0.00023267414,0.0006226683,0.00027545044,0.00020647244,0.000046194833,0.000495479,0.003215539,6.308737e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00077153556,0.00022085867,0.000023065715,0.00015879117,0.000621875,0.000011126098,0.0008240556,0.00071433885,0.000016025962,0.99439967,0.0021255966,0.00011308529],"study_design_scores_gemma":[0.0028176962,0.0009833195,0.000005954466,0.00029363215,0.0004336519,0.00011023797,0.00009253276,0.00011329942,0.0008947719,0.99360806,0.00043001497,0.00021683006],"about_ca_topic_score_codex":0.000005646975,"about_ca_topic_score_gemma":0.0000035174705,"teacher_disagreement_score":0.016972942,"about_ca_system_score_codex":0.00037336204,"about_ca_system_score_gemma":0.00088198663,"threshold_uncertainty_score":0.99908406},"labels":[],"label_agreement":null},{"id":"W2950741552","doi":"10.48550/arxiv.1210.6259","title":"Connectivity of inhomogeneous random graphs","year":2012,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Combinatorics; Separable space; Mathematics; Random graph; Metric space; Vertex (graph theory); Random regular graph; Graph; Space (punctuation); Discrete mathematics; Distribution (mathematics); Kernel (algebra); Enhanced Data Rates for GSM Evolution; Chordal graph; Computer science; 1-planar graph; Mathematical analysis","score_opus":0.09011787460641582,"score_gpt":0.21453863920641852,"score_spread":0.1244207646000027,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2950741552","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97993046,0.00020921079,0.010450425,0.0000056525882,0.00087079493,0.0004148955,0.00008121957,0.0001151044,0.007922215],"genre_scores_gemma":[0.9987623,0.0001606194,0.00044042623,0.0000182567,0.00008867371,9.3340407e-7,0.0000092519795,0.000039423874,0.00048009746],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99837524,0.00031470603,0.0002989847,0.0005511051,0.00010520289,0.00035473533],"domain_scores_gemma":[0.9973239,0.0007296251,0.0005037618,0.0011258189,0.00016708625,0.0001498531],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005475757,0.00036935706,0.0007395796,0.00025586606,0.00016721307,0.000012459505,0.00068800646,0.00048833084,0.00019739504],"category_scores_gemma":[0.00023105921,0.00036436482,0.0005501539,0.0002649809,0.0003411288,0.00008763166,0.0011372836,0.0005897034,0.000006130348],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003186119,0.00016383437,0.008181177,0.00040328884,0.0004181915,0.0000630998,0.00063071947,0.0016875952,0.00007298608,0.987674,0.00018827211,0.00019822542],"study_design_scores_gemma":[0.0011812531,0.000028686587,0.0010202501,0.0000868263,0.00045582672,0.000010189432,0.00009614544,0.000894574,0.00081739953,0.99489933,0.000103968305,0.00040553277],"about_ca_topic_score_codex":0.00006877309,"about_ca_topic_score_gemma":0.000031153602,"teacher_disagreement_score":0.018831834,"about_ca_system_score_codex":0.00006896322,"about_ca_system_score_gemma":0.00006651913,"threshold_uncertainty_score":0.99988085},"labels":[],"label_agreement":null},{"id":"W2950838439","doi":"10.48550/arxiv.1403.1617","title":"Odd circuits in dense binary matroids","year":2014,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Matroid; Lemma (botany); Integer (computer science); Combinatorics; Abelian group; Binary number; Mathematics; Simple (philosophy); Discrete mathematics; Alpha (finance); Computer science; Arithmetic; Statistics","score_opus":0.08595783319520273,"score_gpt":0.21511570597958513,"score_spread":0.1291578727843824,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2950838439","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9810996,0.00007450112,0.005678205,0.000023671131,0.00076219917,0.00034345587,0.000023588927,0.00017273564,0.011822038],"genre_scores_gemma":[0.99701273,0.00011740716,0.00032279344,0.00008707569,0.00014342833,0.0000012065426,0.000013003337,0.00005714702,0.0022451999],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979563,0.00030446073,0.00033158064,0.0008595756,0.00010533949,0.00044276923],"domain_scores_gemma":[0.99781096,0.00038387996,0.00028789853,0.001284753,0.00008750571,0.00014499325],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00050560303,0.0004220903,0.00061692356,0.0004922258,0.00015912658,0.00003563209,0.00095014815,0.0005897537,0.0001680627],"category_scores_gemma":[0.00016806566,0.0004523298,0.0003273241,0.00033349762,0.00019911217,0.00009072113,0.0013791436,0.00097187934,0.000042044794],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006456359,0.00011978425,0.0076972004,0.0005110715,0.00012575042,0.00072058523,0.00064706267,0.010947026,0.00004310779,0.9776882,0.0012018629,0.0002338187],"study_design_scores_gemma":[0.0006424703,0.000045633573,0.0029032482,0.00022483696,0.00013165659,0.000011620042,0.00013962132,0.009700846,0.00004424071,0.9852021,0.00039652403,0.00055720354],"about_ca_topic_score_codex":0.000049871167,"about_ca_topic_score_gemma":0.000050883587,"teacher_disagreement_score":0.015913133,"about_ca_system_score_codex":0.0001957772,"about_ca_system_score_gemma":0.000082518956,"threshold_uncertainty_score":0.9997929},"labels":[],"label_agreement":null},{"id":"W2950985047","doi":"10.48550/arxiv.1201.3670","title":"Roth type theorems in finite groups","year":2012,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Type (biology); Mathematics; Pure mathematics; Geology","score_opus":0.11899569783136724,"score_gpt":0.2197854563319299,"score_spread":0.10078975850056265,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2950985047","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96310204,0.00021324465,0.0057666227,0.000014639065,0.0013731775,0.00039272403,0.000026540354,0.00014615504,0.028964868],"genre_scores_gemma":[0.99728036,0.00023876461,0.00044625692,0.00005825789,0.00019596472,7.810557e-7,0.000016326665,0.000048631773,0.0017146377],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99843144,0.00022921401,0.00024507797,0.00057388423,0.0000840786,0.00043629593],"domain_scores_gemma":[0.9980283,0.0004949382,0.00023338506,0.0010316639,0.00008097426,0.00013078024],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005007747,0.00035710417,0.0004495414,0.00029557568,0.00012334739,0.000027131482,0.0007804111,0.00049994694,0.00038018782],"category_scores_gemma":[0.00020444948,0.00034811167,0.00021038888,0.00039457445,0.00018686347,0.00012451099,0.0011912327,0.00090354326,0.000049049406],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010147503,0.000091695416,0.008990617,0.00019133194,0.000085524065,0.00009631413,0.0010142362,0.0032691343,0.0000052534415,0.98583186,0.00020248431,0.00012010648],"study_design_scores_gemma":[0.0003876136,0.000021624288,0.0014989026,0.000111443915,0.00010822526,0.000002779816,0.00017548971,0.0031406074,0.00002674923,0.99352765,0.0005745076,0.00042437742],"about_ca_topic_score_codex":0.00004750286,"about_ca_topic_score_gemma":0.0000536427,"teacher_disagreement_score":0.03417835,"about_ca_system_score_codex":0.0001362915,"about_ca_system_score_gemma":0.000058239988,"threshold_uncertainty_score":0.99989706},"labels":[],"label_agreement":null},{"id":"W2951301993","doi":"10.48550/arxiv.0905.0135","title":"Sums and products along sparse graphs","year":2009,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Combinatorics; Mathematics; Disjoint sets; Upper and lower bounds; Matching (statistics); Product (mathematics); Discrete mathematics; Generalization; Mathematical proof","score_opus":0.07651435924864014,"score_gpt":0.3007603860183592,"score_spread":0.22424602676971905,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2951301993","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9923677,0.0014433112,0.00004397552,0.00039450577,0.0011042001,0.0005777776,0.000019781082,0.00020316061,0.003845606],"genre_scores_gemma":[0.993772,0.00047234847,0.004339768,0.000268887,0.0004098953,0.000023668883,0.000021341391,0.000063127256,0.00062901544],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979121,0.000135342,0.00047333693,0.00079350505,0.00027361346,0.000412079],"domain_scores_gemma":[0.9979788,0.0001734926,0.0002948136,0.0012954868,0.00012937101,0.00012805064],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00055636413,0.00047027736,0.0005959914,0.0001742862,0.00023046295,0.00006258582,0.00045999585,0.00042388192,0.000041556366],"category_scores_gemma":[0.00048511586,0.00038826553,0.00016445397,0.00014792585,0.00022826326,0.00007552736,0.0008003598,0.00088263344,0.00001230759],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008856826,0.0002467808,0.39352554,0.0018010584,0.0004933055,0.0001655414,0.004072673,0.000011276433,0.00048295996,0.5825164,0.009949554,0.0066463747],"study_design_scores_gemma":[0.00025029076,0.00004125369,0.15073729,0.00020406103,0.00015199672,0.00003065011,0.00005823327,0.0000068305544,0.0012026301,0.84535104,0.0014837882,0.00048193906],"about_ca_topic_score_codex":0.000030692845,"about_ca_topic_score_gemma":0.000020153402,"teacher_disagreement_score":0.2628347,"about_ca_system_score_codex":0.000025885472,"about_ca_system_score_gemma":0.00005887279,"threshold_uncertainty_score":0.99985695},"labels":[],"label_agreement":null},{"id":"W2951319419","doi":"10.48550/arxiv.math/0610089","title":"Geodesics and almost geodesic cycles in random regular graphs","year":2006,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Geodesic; Combinatorics; Mathematics; Distance; Wheel graph; Path graph; Graph; Random graph; Vertex (graph theory); Limiting; Shortest path problem; Discrete mathematics; Graph power; Geometry; Line graph","score_opus":0.044389020335018646,"score_gpt":0.28814950621619917,"score_spread":0.24376048588118052,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2951319419","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99287295,0.0018087062,0.000413291,0.00012318791,0.0005911188,0.000694972,0.000044658267,0.00014388659,0.0033072345],"genre_scores_gemma":[0.9954509,0.0004919026,0.0030521431,0.00014822233,0.00019138186,0.000069341746,0.000050489267,0.000099935976,0.00044564225],"study_design_codex":"observational","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99732953,0.00027143199,0.0007578741,0.0007855567,0.0003299431,0.00052564143],"domain_scores_gemma":[0.99772644,0.0006046586,0.00036216987,0.0011206428,0.00007660329,0.00010949613],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008831836,0.0005784022,0.00092079036,0.00031229272,0.00021867579,0.00007189185,0.0005258022,0.00065933855,0.000035208224],"category_scores_gemma":[0.00027461565,0.0005055681,0.00027817793,0.00019002252,0.00037899424,0.0000863852,0.0008753287,0.0010198886,0.000004984724],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026506485,0.00026563377,0.7965337,0.0013408184,0.00033154592,0.00018841102,0.0019131502,0.00023425475,0.00024081153,0.19284321,0.0030183655,0.0028250085],"study_design_scores_gemma":[0.0015070658,0.000019102165,0.16845243,0.0003075437,0.00013732354,0.000016132928,0.0000623345,0.00011457365,0.00042896668,0.8279687,0.0004324132,0.00055339665],"about_ca_topic_score_codex":0.00023779752,"about_ca_topic_score_gemma":0.00013564127,"teacher_disagreement_score":0.6351255,"about_ca_system_score_codex":0.000057549816,"about_ca_system_score_gemma":0.00007010526,"threshold_uncertainty_score":0.9997396},"labels":[],"label_agreement":null},{"id":"W2951346854","doi":"10.48550/arxiv.1603.03526","title":"Cycles in graphs of fixed girth with large size","year":2016,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Girth (graph theory); Mathematics; Combinatorics; Infinity; Upper and lower bounds; Constant (computer programming); Discrete mathematics; Odd graph; Graph; Chordal graph; 1-planar graph; Computer science; Mathematical analysis","score_opus":0.053418399035847566,"score_gpt":0.2052815750288443,"score_spread":0.15186317599299676,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2951346854","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9857792,0.00003980877,0.004402223,0.000017037797,0.00018604631,0.0003091415,0.000119664,0.000070157264,0.009076673],"genre_scores_gemma":[0.99811137,0.00010687589,0.00073467253,0.000021540385,0.000028502127,8.642032e-7,0.000003824704,0.000035612156,0.00095674983],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985594,0.00015959555,0.00026279682,0.0005778395,0.00010112301,0.0003392339],"domain_scores_gemma":[0.99790096,0.00061325915,0.00036636335,0.00092881673,0.000106316285,0.00008430484],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029745846,0.00031945488,0.000551814,0.00028172092,0.00008411879,0.000010250014,0.0006619202,0.00032764033,0.00016157393],"category_scores_gemma":[0.0001356229,0.00024494447,0.00021653551,0.00030922637,0.0002519092,0.00008635014,0.00073359505,0.0004251441,0.0000030258627],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002334238,0.00011958734,0.045786187,0.0002958172,0.00016378038,0.00014033001,0.00048078367,0.00026818906,0.00003185928,0.9523205,0.000110484245,0.000049056554],"study_design_scores_gemma":[0.00127009,0.00005123801,0.009606343,0.000415643,0.00010953221,0.0000025340064,0.00021361602,0.00022537255,0.0002653524,0.9874148,0.00007485081,0.00035065573],"about_ca_topic_score_codex":0.000029376255,"about_ca_topic_score_gemma":0.00016914416,"teacher_disagreement_score":0.036179844,"about_ca_system_score_codex":0.00006176257,"about_ca_system_score_gemma":0.000076059376,"threshold_uncertainty_score":0.9988546},"labels":[],"label_agreement":null},{"id":"W2951752012","doi":"10.48550/arxiv.0808.0418","title":"Counting squarefree discriminants of trinomials under abc","year":2008,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Square-free integer; Trinomial; Mathematics; Combinatorics; Conjecture; Integer (computer science); Computer science","score_opus":0.14506837833805145,"score_gpt":0.3415151262180816,"score_spread":0.19644674788003016,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2951752012","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9874758,0.0003527199,0.00064745,0.00006524419,0.0014520482,0.00043907604,0.000077628974,0.00010191767,0.009388124],"genre_scores_gemma":[0.9965134,0.000386722,0.0017364366,0.00009824135,0.0004175269,0.000026742106,0.000019635616,0.000088267865,0.0007129965],"study_design_codex":"observational","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99747056,0.00015133052,0.0009550109,0.00056905777,0.00042537798,0.00042866106],"domain_scores_gemma":[0.99694014,0.0005691614,0.00085105567,0.0013737502,0.00017780864,0.00008808051],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005198688,0.00046553576,0.00097504386,0.0001753669,0.00025294442,0.000022933276,0.000812147,0.0005279601,0.00012577782],"category_scores_gemma":[0.00048765942,0.0003804431,0.0004283244,0.00010904048,0.000335965,0.00007285334,0.0012201156,0.00070597837,0.000015695912],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002703417,0.00064325484,0.64436316,0.0050680805,0.0013740307,0.00012463144,0.011044502,0.00027056603,0.002035994,0.32313988,0.008926112,0.0027394332],"study_design_scores_gemma":[0.0009737072,0.00007187974,0.19803385,0.0007941344,0.00040442482,0.000035378573,0.00059838785,0.000042487613,0.009983754,0.787293,0.0008199391,0.00094905234],"about_ca_topic_score_codex":0.000103859,"about_ca_topic_score_gemma":0.000021205758,"teacher_disagreement_score":0.46415314,"about_ca_system_score_codex":0.00007331616,"about_ca_system_score_gemma":0.000121162135,"threshold_uncertainty_score":0.99986476},"labels":[],"label_agreement":null},{"id":"W2951784828","doi":"10.48550/arxiv.1301.2841","title":"Meyniel's conjecture holds for random graphs","year":2013,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Conjecture; Combinatorics; Mathematics; Graph; Discrete mathematics; Random graph; Random regular graph; Chordal graph; 1-planar graph","score_opus":0.09313481996811386,"score_gpt":0.21707290180011876,"score_spread":0.1239380818320049,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2951784828","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9347031,0.0001900137,0.053483278,0.00007667518,0.0017709866,0.0019855339,0.00020077536,0.0003400175,0.007249635],"genre_scores_gemma":[0.99279135,0.00017121264,0.0020388737,0.00013568532,0.00019753665,0.000010921418,0.000044368415,0.00007538688,0.004534638],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979948,0.0001694155,0.00031778036,0.0009348661,0.00010112899,0.00048205457],"domain_scores_gemma":[0.99704367,0.0008941467,0.0003965013,0.0012558941,0.00022303165,0.00018673284],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000377078,0.00054223323,0.0007782219,0.00029255036,0.0003700996,0.00007628695,0.0010239079,0.0008263203,0.00030890395],"category_scores_gemma":[0.00022109042,0.0004968242,0.00080734177,0.00022704693,0.000275147,0.000121491736,0.0008524548,0.0007449328,0.000014905624],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023547986,0.000054494474,0.00030019396,0.00040510565,0.00042999073,0.000036472236,0.0004041839,0.0019951437,0.000015154622,0.9882441,0.007725909,0.00015376674],"study_design_scores_gemma":[0.0025251692,0.000060383096,0.00007894666,0.00009908039,0.00048383506,0.0000055355868,0.00013134108,0.004831445,0.00013487336,0.988656,0.0023977542,0.0005956811],"about_ca_topic_score_codex":0.000046693247,"about_ca_topic_score_gemma":0.000021267419,"teacher_disagreement_score":0.05808829,"about_ca_system_score_codex":0.00008228015,"about_ca_system_score_gemma":0.00008203425,"threshold_uncertainty_score":0.99974835},"labels":[],"label_agreement":null},{"id":"W2952013250","doi":"10.48550/arxiv.1504.06657","title":"Intersection theorems for multisets","year":2015,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Multiset; Intersection (aeronautics); Homomorphism; Mathematics; Combinatorics; Graph; Set (abstract data type); Discrete mathematics; Structured program theorem; Family of sets; Intersection graph; Computer science; Line graph","score_opus":0.18705809236393256,"score_gpt":0.24778494891079064,"score_spread":0.06072685654685808,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2952013250","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8451968,0.00004099389,0.14149168,0.000018479595,0.0023354508,0.00081204146,0.00012759412,0.00024755273,0.0097294245],"genre_scores_gemma":[0.99558765,0.000024595352,0.0015844238,0.00003390526,0.0002342846,0.000003108131,0.000033350876,0.000047081005,0.0024516233],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987205,0.00011669586,0.00019807732,0.000628649,0.000064448766,0.00027159415],"domain_scores_gemma":[0.99827474,0.00031214513,0.0002637902,0.0007660897,0.00025331878,0.00012992533],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004649145,0.0003044511,0.00036737704,0.0001934825,0.00018852417,0.00003358848,0.00057309377,0.00042131377,0.000054245378],"category_scores_gemma":[0.00027968004,0.000298113,0.00033509635,0.00012658448,0.00016238472,0.000089599715,0.00076492154,0.00043630015,0.000008546347],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022941647,0.000059173613,0.000257755,0.00021316118,0.00019125045,0.000023522261,0.00095455395,0.0032977043,0.000012865351,0.990667,0.0037708057,0.00032281555],"study_design_scores_gemma":[0.00069967797,0.0000597308,0.000049601542,0.000082190876,0.00019937803,0.0000039399183,0.00037454872,0.024731899,0.000092912334,0.9723109,0.0010535371,0.0003417038],"about_ca_topic_score_codex":0.000029100878,"about_ca_topic_score_gemma":0.000038593116,"teacher_disagreement_score":0.15039085,"about_ca_system_score_codex":0.00021745826,"about_ca_system_score_gemma":0.00007260534,"threshold_uncertainty_score":0.9999471},"labels":[],"label_agreement":null},{"id":"W2952030496","doi":"10.48550/arxiv.1511.04356","title":"A refinement of theorems on vertex-disjoint chorded cycles","year":2015,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Combinatorics; Conjecture; Disjoint sets; Vertex (graph theory); Mathematics; Degree (music); Graph; Discrete mathematics; Physics","score_opus":0.1631709697472149,"score_gpt":0.23770544235588895,"score_spread":0.07453447260867405,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2952030496","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9336828,0.000060663955,0.0015394636,0.00003284369,0.00071973086,0.0004209352,0.00008856015,0.0001211305,0.0633339],"genre_scores_gemma":[0.99766994,0.00010819367,0.00048837974,0.00004828053,0.000067173605,0.0000012603368,0.000018358172,0.00004322365,0.0015552004],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99829435,0.00020365242,0.00034789732,0.000677562,0.00017821704,0.00029832087],"domain_scores_gemma":[0.99747366,0.00028036832,0.0004608007,0.0014114336,0.00022033809,0.00015341982],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00055055885,0.00039826706,0.00061963295,0.0002753281,0.00011727611,0.000017886727,0.0008344424,0.00036004794,0.00029812075],"category_scores_gemma":[0.000241668,0.00035800436,0.00035220693,0.00020678567,0.00027750028,0.000045994744,0.0011600623,0.00057466317,0.00001496202],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029225,0.00019640572,0.00028591175,0.00023898152,0.0002702779,0.00005590314,0.0006254278,0.00515752,0.00003077965,0.9898564,0.0027157567,0.000274366],"study_design_scores_gemma":[0.0007626533,0.00014084087,0.00023245154,0.00027056664,0.00021351108,0.0000018725269,0.0003262259,0.0031698823,0.00043867843,0.9936386,0.0004263568,0.00037836735],"about_ca_topic_score_codex":0.000059659997,"about_ca_topic_score_gemma":0.000022342925,"teacher_disagreement_score":0.06398715,"about_ca_system_score_codex":0.00017984983,"about_ca_system_score_gemma":0.000112641246,"threshold_uncertainty_score":0.99988717},"labels":[],"label_agreement":null},{"id":"W2952113795","doi":"10.48550/arxiv.1210.3989","title":"A stability result for balanced dictatorships in $S_{n}$","year":2012,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of Toronto; Hebrew University of Jerusalem; Weizmann Institute of Science","keywords":"Mathematics; Dictatorship; Corollary; Combinatorics; Fourier transform; Bounded function; Function (biology); Pure mathematics; Discrete mathematics; Mathematical analysis","score_opus":0.19682831065343792,"score_gpt":0.24059890296568653,"score_spread":0.04377059231224861,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2952113795","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9812996,0.00007057885,0.012988575,0.000028571041,0.00080445263,0.0009779352,0.00020523694,0.00013774677,0.0034873232],"genre_scores_gemma":[0.99784833,0.000044252036,0.0014477615,0.000035406836,0.00015719804,0.0000067463598,0.000030057914,0.000043903292,0.000386323],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99793154,0.00027853725,0.00036859114,0.0007953493,0.000087762346,0.0005381936],"domain_scores_gemma":[0.99722415,0.0009607319,0.00031648975,0.0011975804,0.00013375167,0.0001672988],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001037838,0.0003764196,0.0005805919,0.00019998377,0.00016476841,0.000024927538,0.0007398501,0.00054592686,0.000091854236],"category_scores_gemma":[0.00060666725,0.000382334,0.0003380679,0.00026882646,0.00020058936,0.0001304739,0.00083196006,0.00075007696,0.0000049620817],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00051581004,0.00019814615,0.027485773,0.00075416476,0.00011456635,0.000024954807,0.0019387915,0.00045461347,0.000030930565,0.9680599,0.00031551084,0.000106812266],"study_design_scores_gemma":[0.0010712406,0.00002890631,0.004185568,0.000119409866,0.0001364659,0.0000010871115,0.0003571473,0.0027419375,0.00020585154,0.9902926,0.0003879352,0.0004718284],"about_ca_topic_score_codex":0.000046147496,"about_ca_topic_score_gemma":0.0001486132,"teacher_disagreement_score":0.023300204,"about_ca_system_score_codex":0.00027365415,"about_ca_system_score_gemma":0.000093476825,"threshold_uncertainty_score":0.99986285},"labels":[],"label_agreement":null},{"id":"W2952143522","doi":"10.48550/arxiv.0810.4062","title":"A measure-theoretic approach to the theory of dense hypergraphs","year":2008,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Hypergraph; Lemma (botany); Mathematics; Measure (data warehouse); Lebesgue measure; Mathematical proof; Discrete mathematics; Ultraproduct; Pure mathematics; Lebesgue integration; Computer science","score_opus":0.07216658895959124,"score_gpt":0.27437900634893564,"score_spread":0.2022124173893444,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2952143522","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9541066,0.0013340673,0.0054598064,0.00015125085,0.00089104957,0.0011438319,0.000046547706,0.00014035503,0.036726434],"genre_scores_gemma":[0.9939078,0.00033109137,0.0041957977,0.00042568622,0.00031557173,0.00015487526,0.000008125031,0.00011157786,0.00054949016],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9965678,0.00080248725,0.0007723581,0.0007212827,0.0006496256,0.0004864482],"domain_scores_gemma":[0.9956876,0.00092578994,0.00045686748,0.0025020393,0.00027177762,0.00015591652],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0019309889,0.000575467,0.0008887315,0.00024740392,0.00034573692,0.000025874357,0.0016444469,0.0004972008,0.00005164841],"category_scores_gemma":[0.0014346803,0.00035649666,0.00067401235,0.0003295276,0.00071807916,0.00003325129,0.0013667648,0.0011075358,0.000023310895],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024837846,0.0002918323,0.012312386,0.0006565062,0.00065491936,0.000013618329,0.012804359,0.00016414205,0.0001661254,0.9684481,0.0028482028,0.0013914555],"study_design_scores_gemma":[0.00031955948,0.000059900813,0.008607999,0.00027288325,0.00035424405,0.00007294408,0.00063938013,0.00003953106,0.0011562768,0.987162,0.00075728213,0.0005580076],"about_ca_topic_score_codex":0.000013494154,"about_ca_topic_score_gemma":0.0000033608785,"teacher_disagreement_score":0.039801124,"about_ca_system_score_codex":0.000044710592,"about_ca_system_score_gemma":0.00011765811,"threshold_uncertainty_score":0.9998887},"labels":[],"label_agreement":null},{"id":"W2952413008","doi":"10.1184/r1/6479216","title":"Rainbow arborescence in random digraphs","year":2014,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University; University of Toronto","funders":"","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Rainbow; Binary logarithm; Random graph; Graph; Tree (set theory); Discrete mathematics; Physics","score_opus":0.06951409021550592,"score_gpt":0.2085170762224245,"score_spread":0.13900298600691857,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2952413008","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96961313,0.00008272878,0.016089402,0.000032195912,0.000756865,0.00053440256,0.000022814702,0.00017687197,0.012691597],"genre_scores_gemma":[0.9980204,0.00020212965,0.0005980756,0.000084024345,0.00010979998,0.0000017196535,0.000009327504,0.000041061063,0.0009334502],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99790555,0.0003486791,0.00032856181,0.00087330595,0.00011107201,0.00043280373],"domain_scores_gemma":[0.9975602,0.0006817617,0.00030410496,0.0012310498,0.0000832581,0.00013964987],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00065095746,0.00042067858,0.0006688555,0.00044134867,0.0001557941,0.000039911836,0.0010632775,0.0004920659,0.000096242795],"category_scores_gemma":[0.00033326182,0.00041865764,0.00037939282,0.0003925492,0.0002941846,0.000086006265,0.001036484,0.0009806958,0.000012090129],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029911564,0.000088998226,0.0102149155,0.0002982538,0.00010982611,0.00023000625,0.0006354691,0.00775261,0.000011127617,0.9796357,0.0005646799,0.00015927882],"study_design_scores_gemma":[0.0018265336,0.000023738588,0.0018076483,0.00024598942,0.00010674107,0.0000030211193,0.00008812885,0.011364694,0.000049613118,0.98353326,0.00044062536,0.000510004],"about_ca_topic_score_codex":0.00007782852,"about_ca_topic_score_gemma":0.000092339236,"teacher_disagreement_score":0.02840729,"about_ca_system_score_codex":0.00010238672,"about_ca_system_score_gemma":0.00008326728,"threshold_uncertainty_score":0.99982655},"labels":[],"label_agreement":null},{"id":"W2952484561","doi":"10.48550/arxiv.math/0612377","title":"Fourier analysis and large independent sets in powers of complete graphs","year":2006,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; University of Waterloo","funders":"","keywords":"Fourier transform; Fourier analysis; Mathematics; Computer science; Combinatorics; Mathematical analysis","score_opus":0.04252698775559846,"score_gpt":0.3029180633118086,"score_spread":0.2603910755562101,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2952484561","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99624544,0.0003302056,0.0006814136,0.00004118362,0.00024850102,0.00030068366,0.00025908233,0.000034131514,0.0018593745],"genre_scores_gemma":[0.9971625,0.00006462489,0.0024306264,0.00006906195,0.000027865153,0.000015110601,0.00007753076,0.000034582878,0.000118071446],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99786943,0.00018107447,0.0006986265,0.0005315355,0.00036949565,0.00034985298],"domain_scores_gemma":[0.9982158,0.00025544662,0.00046411605,0.00090189045,0.000086430526,0.000076323086],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00072375557,0.00034708797,0.0009273752,0.0007687165,0.00008704894,0.000021740962,0.00038506964,0.00040125198,0.000115252275],"category_scores_gemma":[0.00011903759,0.00030564677,0.0004076719,0.00045982152,0.00016065458,0.000041907613,0.0008894393,0.00067566923,0.0000014008034],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024676847,0.00009826249,0.9683272,0.00026043758,0.0008825912,0.00002576984,0.0010475877,0.00003589872,0.000028975466,0.028922278,0.00019000938,0.00015627228],"study_design_scores_gemma":[0.000440897,0.000016263602,0.6592927,0.00006928358,0.00059467857,0.0000021605072,0.00009051577,0.00021011443,0.000072576746,0.33877707,0.00016009185,0.00027363226],"about_ca_topic_score_codex":0.0003084421,"about_ca_topic_score_gemma":0.00086860114,"teacher_disagreement_score":0.3098548,"about_ca_system_score_codex":0.000037299433,"about_ca_system_score_gemma":0.000030466868,"threshold_uncertainty_score":0.99993956},"labels":[],"label_agreement":null},{"id":"W2952492560","doi":"10.48550/arxiv.1311.6555","title":"Lower bounds for the isoperimetric numbers of random regular graphs","year":2013,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Isoperimetric inequality; Combinatorics; Mathematics; Upper and lower bounds; Vertex (graph theory); Graph; Discrete mathematics; Mathematical analysis","score_opus":0.07715133963439116,"score_gpt":0.21886585500981617,"score_spread":0.141714515375425,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2952492560","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9463807,0.0005846198,0.042553622,0.00004731511,0.0018580079,0.0017536229,0.000087822365,0.000107837055,0.006626502],"genre_scores_gemma":[0.9943484,0.00033525404,0.0011402068,0.000047456673,0.00008710587,0.00000637657,0.000008515586,0.0000509561,0.0039757183],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99845934,0.00014734973,0.0003442344,0.000588043,0.00012562406,0.00033543695],"domain_scores_gemma":[0.9961166,0.0015324949,0.0004865332,0.0014732947,0.00029930435,0.00009176972],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00058881193,0.00036737375,0.0006197454,0.00032934052,0.00034495877,0.00004723959,0.0012340397,0.00041159074,0.00022302248],"category_scores_gemma":[0.0003309747,0.0002732847,0.0008359451,0.0005638289,0.000515624,0.0000969409,0.00077846437,0.00046333642,0.0000055385817],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035581697,0.000082233084,0.00038573256,0.00030498952,0.000660902,0.000009599754,0.00035260725,0.002046353,0.000023156248,0.9914554,0.0041425093,0.00018072638],"study_design_scores_gemma":[0.0015890838,0.00006216628,0.00013562765,0.00007516354,0.0006380435,0.000002233165,0.00024956398,0.005642533,0.00023031737,0.9890744,0.0019571672,0.00034367974],"about_ca_topic_score_codex":0.00012401868,"about_ca_topic_score_gemma":0.00001227434,"teacher_disagreement_score":0.047967758,"about_ca_system_score_codex":0.00006474988,"about_ca_system_score_gemma":0.00007574661,"threshold_uncertainty_score":0.9999719},"labels":[],"label_agreement":null},{"id":"W2952511945","doi":"10.48550/arxiv.math/0508081","title":"Eigenvalue bounds for independent sets","year":2005,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Eigenvalues and eigenvectors; Independence (probability theory); Combinatorics; Mathematics; Independence number; Independent set; Maximal independent set; Set (abstract data type); Polarity (international relations); Discrete mathematics; Graph; Chordal graph; 1-planar graph; Computer science; Physics; Statistics","score_opus":0.11142080801985933,"score_gpt":0.3603205522463768,"score_spread":0.2488997442265175,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2952511945","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98705024,0.0005556989,0.0019427385,0.00025565532,0.0025647762,0.0010435818,0.00016440454,0.00021745541,0.006205452],"genre_scores_gemma":[0.9849683,0.00010425645,0.009738709,0.0004442786,0.001251756,0.00021828701,0.000072017196,0.00012778374,0.003074633],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976411,0.00009717241,0.00062431354,0.0007178248,0.0003855855,0.0005339928],"domain_scores_gemma":[0.9975705,0.00040282405,0.00039297744,0.00133281,0.00015580167,0.00014507973],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00071505975,0.00050412095,0.00063735945,0.00015367362,0.0003548988,0.00007696317,0.00084427185,0.0007545906,0.00029909433],"category_scores_gemma":[0.00040118577,0.00043784015,0.0005151686,0.00006883553,0.00013151797,0.00006656089,0.0011278011,0.00088677206,0.0000383167],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00039431048,0.0007617984,0.16280472,0.0038351244,0.0024548904,0.00007178024,0.012251409,0.00036714197,0.0004925763,0.75170726,0.045235783,0.019623216],"study_design_scores_gemma":[0.00066503347,0.00006111847,0.023954475,0.00016145881,0.00026826363,0.000016964117,0.000109991364,0.00015895143,0.0012528851,0.95309037,0.01954295,0.0007175305],"about_ca_topic_score_codex":0.000016466322,"about_ca_topic_score_gemma":0.000042880296,"teacher_disagreement_score":0.20138313,"about_ca_system_score_codex":0.00014406079,"about_ca_system_score_gemma":0.00013935387,"threshold_uncertainty_score":0.99980736},"labels":[],"label_agreement":null},{"id":"W2952583369","doi":"10.48550/arxiv.math/0311535","title":"Independent sets in association schemes","year":2003,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Association (psychology); Association scheme; Computer science; Mathematics; Psychology; Combinatorics","score_opus":0.06552338105856378,"score_gpt":0.3259936985717624,"score_spread":0.2604703175131986,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2952583369","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9885146,0.0002562599,0.000060172613,0.00015351099,0.0014425342,0.00035625603,0.000020352947,0.000083436375,0.0091128955],"genre_scores_gemma":[0.996409,0.000104773935,0.0013462473,0.00023690728,0.0001316645,0.000046211404,0.000020258112,0.000048526003,0.0016564401],"study_design_codex":"observational","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997998,0.00023819057,0.00051473937,0.00046313912,0.00042087812,0.00036508197],"domain_scores_gemma":[0.9983957,0.0003122562,0.0004625628,0.0006688621,0.00009735231,0.00006330611],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009872066,0.00031142228,0.00047508432,0.0001690105,0.000099499644,0.000039693452,0.0003796015,0.00076867687,0.00022872192],"category_scores_gemma":[0.0011584747,0.00028831614,0.0001878455,0.00012518844,0.00003062583,0.000060288316,0.00055398885,0.001214342,0.000035935023],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009378615,0.000081070204,0.9586959,0.00018442451,0.00013400582,0.000016689415,0.0009601072,0.000010090641,0.000048148697,0.037800528,0.0018303479,0.00022932961],"study_design_scores_gemma":[0.00044889178,0.0000130459675,0.31701624,0.00016225889,0.000066186476,0.0000030109657,0.00009515139,0.000018633287,0.0009974071,0.6784575,0.0023081508,0.0004135003],"about_ca_topic_score_codex":0.000023892731,"about_ca_topic_score_gemma":0.000043326378,"teacher_disagreement_score":0.64167964,"about_ca_system_score_codex":0.00038900378,"about_ca_system_score_gemma":0.00008386514,"threshold_uncertainty_score":0.9999569},"labels":[],"label_agreement":null},{"id":"W2952749208","doi":"10.48550/arxiv.1311.5818","title":"Sparse halves in dense triangle-free graphs","year":2013,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Combinatorics; Conjecture; Mathematics; Degree (music); Graph; Trapezoid graph; Discrete mathematics; 1-planar graph; Chordal graph; Physics","score_opus":0.11423014024423439,"score_gpt":0.21372691153179285,"score_spread":0.09949677128755846,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2952749208","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98561895,0.00015050052,0.0010082382,0.00004620933,0.0008183849,0.00063815527,0.000049290145,0.00017802685,0.011492255],"genre_scores_gemma":[0.9949272,0.00027200545,0.0012723216,0.00007107387,0.00008976891,0.0000032376429,0.000011922451,0.00005773472,0.003294706],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99773926,0.0003234923,0.00040378628,0.0009170543,0.0001228826,0.0004935078],"domain_scores_gemma":[0.9967335,0.0005279581,0.00036377914,0.0020753173,0.00011863558,0.00018081325],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004599927,0.0004933074,0.0007391047,0.0006507875,0.00016400286,0.00006134049,0.0015691593,0.0006310741,0.00038321648],"category_scores_gemma":[0.00045469007,0.00049600773,0.0005015174,0.0004663238,0.00028918099,0.00016722573,0.0021027646,0.0009944782,0.00004194706],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000099315694,0.00012047641,0.0043183346,0.0002034001,0.00016188738,0.00039688795,0.0006639999,0.0014847189,0.000009104028,0.9893984,0.002980225,0.00016320114],"study_design_scores_gemma":[0.0013088691,0.00003194243,0.001718791,0.0001743451,0.00016398726,0.000006814376,0.00026708702,0.0025646733,0.00004887327,0.99288183,0.00028616714,0.0005466388],"about_ca_topic_score_codex":0.00025205515,"about_ca_topic_score_gemma":0.0002774285,"teacher_disagreement_score":0.00930829,"about_ca_system_score_codex":0.0001434358,"about_ca_system_score_gemma":0.00008670687,"threshold_uncertainty_score":0.9997492},"labels":[],"label_agreement":null},{"id":"W2952899752","doi":"","title":"Labeled packings of graphs","year":2013,"lang":"en","type":"preprint","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Statistics Canada; Dalhousie University","funders":"","keywords":"Combinatorics; Graph; Computer science; Mathematics","score_opus":0.02067769019712401,"score_gpt":0.2520322743325833,"score_spread":0.23135458413545928,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2952899752","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.87734836,0.00089335477,0.0149073955,0.0018021868,0.00043973373,0.00073605165,0.00009276574,0.0002785982,0.103501566],"genre_scores_gemma":[0.9210544,0.00035891184,0.073869824,0.000056257904,0.000017630928,0.00005800116,0.00009374021,0.000065447995,0.00442574],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9944701,0.0034071694,0.0007323952,0.00058420206,0.00047327537,0.00033285565],"domain_scores_gemma":[0.9914152,0.002550545,0.0009271855,0.0027009845,0.002267161,0.00013892054],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.004225129,0.0003702532,0.0006054868,0.0002441604,0.0002740221,0.00014205612,0.00147874,0.00041901154,0.00042048786],"category_scores_gemma":[0.0027271209,0.00034063702,0.00037213558,0.00028937942,0.00042337234,0.00008698915,0.00191149,0.000716294,0.000011857381],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000059081335,0.00021951541,0.00088971684,0.00041621304,0.0001313034,0.0000012302075,0.008860604,0.0000021036672,0.0010329226,0.9779998,0.0017748483,0.008665811],"study_design_scores_gemma":[0.000356666,2.8087538e-7,0.0012738527,0.0014264114,0.00008404181,0.000004769708,0.00009625621,0.0006549398,0.038782384,0.9552357,0.0017177054,0.0003669632],"about_ca_topic_score_codex":0.00047909742,"about_ca_topic_score_gemma":0.0001935798,"teacher_disagreement_score":0.09907583,"about_ca_system_score_codex":0.000043085267,"about_ca_system_score_gemma":0.00011363995,"threshold_uncertainty_score":0.9999046},"labels":[],"label_agreement":null},{"id":"W2952954986","doi":"10.48550/arxiv.1108.5699","title":"The inducibility of blow-up graphs","year":2011,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Combinatorics; Vertex (graph theory); Mathematics; Graph; Discrete mathematics","score_opus":0.15450062408789128,"score_gpt":0.22251859014728334,"score_spread":0.06801796605939206,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2952954986","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9834757,0.00010081254,0.0007626477,0.000010934779,0.0012169481,0.00035742202,0.000035989196,0.000082853774,0.013956695],"genre_scores_gemma":[0.9979602,0.00025702515,0.00020909407,0.000015479041,0.000040953826,8.113173e-7,0.00000354466,0.000027402157,0.0014854741],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998273,0.00028361313,0.00034349793,0.0006925358,0.00010310385,0.00030425342],"domain_scores_gemma":[0.9963057,0.0006169232,0.0005033002,0.0022526896,0.00022153261,0.0000998668],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00085433375,0.0003125142,0.00044239295,0.00013650495,0.0003578505,0.000019285306,0.0013767012,0.00042655,0.00017041044],"category_scores_gemma":[0.0003221785,0.00023720677,0.00047446485,0.0002722527,0.0007177276,0.0000625516,0.001579248,0.00078126247,0.000005101816],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011174909,0.00006151741,0.0028682302,0.00016418022,0.00024084072,0.000014499449,0.00080970814,0.00006922155,0.000010982904,0.9949455,0.0003769021,0.00032665837],"study_design_scores_gemma":[0.00026585988,0.000031662465,0.0016789885,0.00006180387,0.0002222608,0.0000016389876,0.0002707507,0.00031302642,0.00051424565,0.99619716,0.00018900704,0.00025356832],"about_ca_topic_score_codex":0.00010708119,"about_ca_topic_score_gemma":0.000077746154,"teacher_disagreement_score":0.014484519,"about_ca_system_score_codex":0.000053069485,"about_ca_system_score_gemma":0.00009444728,"threshold_uncertainty_score":0.96730113},"labels":[],"label_agreement":null},{"id":"W2953083941","doi":"10.48550/arxiv.1110.4898","title":"Two results on the digraph chromatic number","year":2011,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Digraph; Combinatorics; Mathematics; Girth (graph theory); Chromatic scale; Integer (computer science); Graph; Discrete mathematics; Computer science","score_opus":0.13767234396504638,"score_gpt":0.22760346452379138,"score_spread":0.089931120558745,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2953083941","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7934092,0.000012773576,0.0007122038,0.000061028906,0.0006820537,0.0004618347,0.00006639197,0.0001860867,0.20440838],"genre_scores_gemma":[0.9950898,0.00007710843,0.00033234322,0.00017269487,0.00014774849,0.0000020194693,0.000011407888,0.000050012157,0.0041168253],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980079,0.0003460987,0.00033119362,0.00079780386,0.00013450244,0.0003825002],"domain_scores_gemma":[0.9962,0.000999654,0.00044659484,0.002132568,0.0001002159,0.000120950324],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00057983847,0.0004554933,0.00044373347,0.0001430961,0.00041529915,0.000048533937,0.0013583368,0.00032384854,0.00045223415],"category_scores_gemma":[0.00030612104,0.00032803242,0.000454006,0.00030250062,0.00035626593,0.00006937161,0.0011166026,0.0009900304,0.00016008307],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016426033,0.000089853886,0.00034171462,0.00009421818,0.00025213737,0.00010359126,0.0011400527,0.00038879173,0.0000030998249,0.9938159,0.0035651126,0.00004128982],"study_design_scores_gemma":[0.00059281825,0.00003463697,0.0004677444,0.00021987663,0.00023278744,0.0000061039473,0.00022482904,0.00086894294,0.0001355057,0.99643576,0.00036679785,0.0004142031],"about_ca_topic_score_codex":0.0000992855,"about_ca_topic_score_gemma":0.00004456478,"teacher_disagreement_score":0.2016806,"about_ca_system_score_codex":0.000083872095,"about_ca_system_score_gemma":0.00005497187,"threshold_uncertainty_score":0.99991715},"labels":[],"label_agreement":null},{"id":"W2953118316","doi":"10.48550/arxiv.1109.1592","title":"The Inducibility of Graphs on Four Vertices","year":2011,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Multipartite; Mathematics; Discrete mathematics; Graph; Physics","score_opus":0.21034620644379984,"score_gpt":0.22796773457782896,"score_spread":0.01762152813402912,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2953118316","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97688216,0.000049638307,0.00044368842,0.000015965139,0.0007138337,0.000304294,0.000022635046,0.0000640966,0.021503689],"genre_scores_gemma":[0.9989629,0.00018151924,0.0001335576,0.000024846098,0.000035419565,7.44594e-7,0.0000017097425,0.000022172453,0.0006371652],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99846596,0.00027773174,0.0002755321,0.00061666995,0.00010615309,0.00025796812],"domain_scores_gemma":[0.9966114,0.00085456803,0.00042148732,0.0018799775,0.00015007284,0.000082497645],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006943392,0.0002765105,0.00036471133,0.00012885856,0.00031984854,0.000018854027,0.001158499,0.0003292303,0.000061481514],"category_scores_gemma":[0.00036009974,0.00020104011,0.00036811546,0.0002068742,0.00047193444,0.000055863817,0.00095243857,0.00067459635,0.0000059951194],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019700301,0.000081983395,0.0024734,0.00014024918,0.00021403826,0.000019720163,0.00054700946,0.00024702313,0.000009180074,0.9956068,0.00020416905,0.00025946545],"study_design_scores_gemma":[0.00021969878,0.00006996351,0.0031803295,0.00008459813,0.00017605083,9.037445e-7,0.00018424487,0.00033787175,0.00053982995,0.9948626,0.00012909129,0.00021479587],"about_ca_topic_score_codex":0.00007713371,"about_ca_topic_score_gemma":0.00006621579,"teacher_disagreement_score":0.022080706,"about_ca_system_score_codex":0.000051379433,"about_ca_system_score_gemma":0.00006324108,"threshold_uncertainty_score":0.8198178},"labels":[],"label_agreement":null},{"id":"W2953135481","doi":"10.48550/arxiv.1312.5626","title":"Graph properties, graph limits and entropy","year":2013,"lang":"en","type":"preprint","venue":"Repository of the Academy's Library (Library of the Hungarian Academy of Sciences)","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; McGill University","funders":"","keywords":"Mathematics; Random graph; Combinatorics; Limiting; Graph; Discrete mathematics; Graph property; Entropy rate; Entropy (arrow of time); Voltage graph; Line graph; Principle of maximum entropy; Joint quantum entropy; Statistics; Physics; Thermodynamics","score_opus":0.040380828774086094,"score_gpt":0.254231595855004,"score_spread":0.21385076708091788,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2953135481","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9655989,0.009624918,0.000006830358,0.013734285,0.001526771,0.0022366291,0.00013117932,0.00020096022,0.0069395513],"genre_scores_gemma":[0.9856304,0.0014602918,0.0061510643,0.0011577504,0.0004912729,0.000050147064,0.000002082432,0.00013563133,0.0049213697],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99260986,0.0013955424,0.0022858377,0.0012347415,0.0017080423,0.0007659657],"domain_scores_gemma":[0.9940673,0.0007314752,0.0037772832,0.0011119798,0.000032366865,0.0002795723],"candidate_categories":["metaepi_narrow","sts","open_science","research_integrity"],"consensus_categories":["open_science","research_integrity"],"category_scores_codex":[0.0009748505,0.00090580515,0.0015728944,0.0005763981,0.0012121047,0.00019690614,0.009166854,0.0015310778,0.00007276222],"category_scores_gemma":[0.00021685747,0.00050744606,0.0012280887,0.0011977046,0.008255396,0.0025475624,0.009050296,0.0030956042,9.865643e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002986205,0.00029436182,0.031766474,0.0044150623,0.0009389221,0.0000014925957,0.0031918653,0.00032095303,0.04492406,0.8811276,0.031918958,0.00080161716],"study_design_scores_gemma":[0.00034991922,0.00007445568,0.022831826,0.002111263,0.0003029522,0.00005458017,0.00013485097,0.00021570212,0.2710778,0.70079595,0.0015347906,0.00051593845],"about_ca_topic_score_codex":0.000016356558,"about_ca_topic_score_gemma":5.6591677e-8,"teacher_disagreement_score":0.22615373,"about_ca_system_score_codex":0.000016887556,"about_ca_system_score_gemma":0.00034306882,"threshold_uncertainty_score":0.99976516},"labels":[],"label_agreement":null},{"id":"W2953203938","doi":"10.48550/arxiv.math/0602580","title":"High-girth cubic graphs are homomorphic to the Clebsch graph","year":2006,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Combinatorics; Mathematics; Cubic graph; Foster graph; Edge coloring; Graph homomorphism; Discrete mathematics; Triangle-free graph; Homomorphism; Graph power; Graph minor; Symmetric graph; Graph; Voltage graph; Line graph","score_opus":0.06688913495285762,"score_gpt":0.1985978074582114,"score_spread":0.13170867250535379,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2953203938","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9803421,0.00013784101,0.013427118,0.00027937704,0.0016698509,0.0009123049,0.00020515047,0.00046466378,0.002561608],"genre_scores_gemma":[0.9957529,0.00013045187,0.0009481412,0.0003181107,0.0002652544,0.0000053275053,0.000025382164,0.00011021895,0.0024442442],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971712,0.00037510405,0.00040630656,0.0011852138,0.00022836188,0.0006337827],"domain_scores_gemma":[0.9962423,0.00042176188,0.0005164467,0.0023497683,0.00024084226,0.00022888505],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005371537,0.00066394074,0.0007318247,0.00055639946,0.00074666954,0.00011070231,0.002053335,0.0005605368,0.00013281264],"category_scores_gemma":[0.000122069745,0.000539227,0.0006743824,0.0010462092,0.0003572509,0.000102691585,0.001899632,0.0012907538,0.00007405563],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000087178865,0.00011609451,0.0049062027,0.00017785044,0.00028849446,0.0002567183,0.00028269397,0.021871585,0.000005974352,0.95473504,0.017154466,0.00011768252],"study_design_scores_gemma":[0.00047131022,0.000050586656,0.0065613394,0.00014875596,0.00035603592,0.000009661823,0.0002053248,0.00056084135,0.00005544852,0.9890443,0.0018239683,0.000712432],"about_ca_topic_score_codex":0.0003659718,"about_ca_topic_score_gemma":0.00064788933,"teacher_disagreement_score":0.034309234,"about_ca_system_score_codex":0.00012103762,"about_ca_system_score_gemma":0.00007496191,"threshold_uncertainty_score":0.9997059},"labels":[],"label_agreement":null},{"id":"W2953220200","doi":"10.1002/rsa.20146","title":"Rainbow Hamilton cycles in random regular graphs","year":2006,"lang":"en","type":"article","venue":"Random Structures and Algorithms","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":21,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Rainbow; Colored; Combinatorics; Mathematics; struct; Random graph; Random regular graph; Graph; Discrete mathematics; Graph factorization; Line graph; Computer science; 1-planar graph; Graph power; Physics; Optics","score_opus":0.011840481271994528,"score_gpt":0.2582866701298389,"score_spread":0.2464461888578444,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2953220200","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99230015,0.0026843587,0.0012461285,0.00009390686,0.0005109966,0.0006313065,0.000038292274,0.00012228753,0.0023725496],"genre_scores_gemma":[0.9881813,0.00031951413,0.010599289,0.0001055836,0.0003487068,0.000030243058,0.000020034593,0.000052051026,0.00034330267],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978116,0.00022513933,0.00060585095,0.0004930999,0.00035987012,0.00050440547],"domain_scores_gemma":[0.9985927,0.0006663416,0.00017792644,0.000416269,0.000048564823,0.00009820748],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00063221366,0.00040321305,0.00076523836,0.00027764632,0.00036066797,0.0000985167,0.00025327774,0.00023501279,0.00007203864],"category_scores_gemma":[0.0001139382,0.00029142882,0.00023188065,0.00027128585,0.00030508032,0.00012925103,0.00008571237,0.00032274768,6.302988e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0017422574,0.00009797331,0.0033769147,0.000252625,0.00016587104,0.00014788004,0.0032791686,0.00016041598,0.0010955761,0.9650557,0.002437406,0.022188228],"study_design_scores_gemma":[0.016124317,0.00003853175,0.008950134,0.00005100258,0.000057425543,0.00007584857,0.00022963302,0.00051874487,0.0012218861,0.9704842,0.0018464267,0.00040183993],"about_ca_topic_score_codex":0.00016334276,"about_ca_topic_score_gemma":0.000076649754,"teacher_disagreement_score":0.021786388,"about_ca_system_score_codex":0.000022437493,"about_ca_system_score_gemma":0.000018652447,"threshold_uncertainty_score":0.9999538},"labels":[],"label_agreement":null},{"id":"W2956003067","doi":"10.37236/8847","title":"A Lower Bound on the Average Degree Forcing a Minor","year":2020,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Australian Research Council; Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Lambda; Upper and lower bounds; Mathematics; Minor (academic); Degree (music); Constant (computer programming); Graph; Discrete mathematics; Physics; Computer science; Mathematical analysis; Quantum mechanics; Humanities","score_opus":0.04443103041596586,"score_gpt":0.26581109311380885,"score_spread":0.221380062697843,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2956003067","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97858804,0.0014247247,0.0050955364,0.008301946,0.0007202605,0.00024291548,0.0000011689643,0.000024045652,0.0056013283],"genre_scores_gemma":[0.9979329,0.00014284448,0.000015353127,0.0013641765,0.00027432104,0.000002061073,9.0558686e-8,0.000029689296,0.00023852351],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99829334,0.00022189047,0.0004033875,0.00010349391,0.0005095655,0.00046832752],"domain_scores_gemma":[0.9977658,0.0012502498,0.00043060884,0.00033446032,0.00013597254,0.000082953615],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012986355,0.00018211133,0.0002832875,0.00004288056,0.00042304845,0.000060624592,0.0008816342,0.00006610083,0.000061664025],"category_scores_gemma":[0.0007550853,0.000086092,0.00025523908,0.00028261694,0.00009171034,0.000074301635,0.00009799449,0.0012108632,0.000005223685],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017288279,0.00005084195,0.000024215411,0.000014012119,0.00014838559,0.000015645055,0.0016875895,0.000014074543,0.00008041806,0.99391025,0.003613289,0.00026840414],"study_design_scores_gemma":[0.000575002,0.0008847317,0.000034223354,0.000029348965,0.00009051098,0.00010560173,0.0002016832,0.00013388583,0.0007676475,0.9908888,0.0061781784,0.000110387286],"about_ca_topic_score_codex":9.036846e-7,"about_ca_topic_score_gemma":0.0000013596654,"teacher_disagreement_score":0.019344866,"about_ca_system_score_codex":0.00014089546,"about_ca_system_score_gemma":0.00018020933,"threshold_uncertainty_score":0.52606654},"labels":[],"label_agreement":null},{"id":"W2962578661","doi":"","title":"Limits of Ordered Graphs and their Applications","year":2018,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Combinatorics; Vertex (graph theory); Limit (mathematics); Discrete mathematics; Locality; Random graph; Graph","score_opus":0.09295630350527886,"score_gpt":0.22029754897264467,"score_spread":0.1273412454673658,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2962578661","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95963323,0.00015556965,0.030388959,0.000014646092,0.0001754593,0.000534747,0.00011016289,0.000116437564,0.008870813],"genre_scores_gemma":[0.9980431,0.00028601044,0.0010392,0.000021288604,0.000043919277,0.0000022919216,0.000011072648,0.00002687286,0.000526232],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989445,0.00008525711,0.00020955043,0.0005300265,0.0000446188,0.00018602659],"domain_scores_gemma":[0.99818456,0.00028858168,0.0003121944,0.00093290646,0.00019107881,0.00009066281],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018494151,0.0002645631,0.00038907994,0.00021135189,0.0001854989,0.000014936414,0.00053638814,0.00031099323,0.000055987282],"category_scores_gemma":[0.000052397798,0.00023809762,0.00018129067,0.00026607525,0.0004908381,0.0000493997,0.000735756,0.0003053371,0.000002799812],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003386076,0.000060831935,0.0012264807,0.0002933546,0.00019721605,0.0000035908413,0.00054739113,0.00007151328,0.000048517297,0.9968374,0.00030129682,0.00037856775],"study_design_scores_gemma":[0.00024890123,0.00003397062,0.0004225945,0.00006806826,0.00012918883,0.0000028159284,0.00022723016,0.0009856769,0.000398548,0.99677724,0.00046488756,0.00024089265],"about_ca_topic_score_codex":0.000016410673,"about_ca_topic_score_gemma":0.000020148516,"teacher_disagreement_score":0.038409907,"about_ca_system_score_codex":0.000022581524,"about_ca_system_score_gemma":0.000045018394,"threshold_uncertainty_score":0.9709339},"labels":[],"label_agreement":null},{"id":"W2962691672","doi":"10.48550/arxiv.1606.03920","title":"","year":2016,"lang":"","type":"article","venue":"arXiv (Cornell University)","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Mathematics; Random binary tree; Combinatorics; Binary tree; Random tree; Sequence (biology); Infinity; Edgeworth series; Random walk; Branching (polymer chemistry); Stirling numbers of the first kind; Asymptotic expansion; Tree (set theory); Stirling number; Discrete mathematics; Applied mathematics; Mathematical analysis; Statistics; Computer science","score_opus":0.08339063853855844,"score_gpt":0.18372817402969785,"score_spread":0.10033753549113941,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2962691672","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8573755,0.00017510327,0.13689032,0.0005390581,0.0015663565,0.0008356914,0.00014074966,0.00035584343,0.0021213524],"genre_scores_gemma":[0.9857354,0.0018695302,0.00044298792,0.00034095615,0.00046439245,0.0000010396818,0.0000016959809,0.00016221002,0.01098175],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99189156,0.0013056116,0.0011552504,0.0029428722,0.00032458757,0.0023801161],"domain_scores_gemma":[0.98912567,0.003950093,0.0011342829,0.003900128,0.00063521555,0.001254636],"candidate_categories":["metaepi_narrow","sts","insufficient_payload"],"consensus_categories":["metaepi_narrow"],"category_scores_codex":[0.0015115142,0.0014702198,0.0014768629,0.00074169034,0.0025223708,0.0001268699,0.0030843026,0.001025007,0.0010838715],"category_scores_gemma":[0.0012354837,0.0011153639,0.0013730535,0.0019905246,0.0026727554,0.0021229584,0.002316913,0.00070492923,0.00012161979],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00168753,0.00053510297,0.036130533,0.00023691592,0.00097390293,0.0015921107,0.0022429663,0.0007261019,0.0017871114,0.9505552,0.00025895122,0.0032735625],"study_design_scores_gemma":[0.00856981,0.00069351814,0.0059741107,0.00075610715,0.0011810767,0.0000782692,0.0018462528,0.003393824,0.0026783098,0.9717992,0.0010283899,0.0020011344],"about_ca_topic_score_codex":0.00006244351,"about_ca_topic_score_gemma":0.000103242164,"teacher_disagreement_score":0.13644733,"about_ca_system_score_codex":0.0007110099,"about_ca_system_score_gemma":0.00023025888,"threshold_uncertainty_score":0.9998293},"labels":[],"label_agreement":null},{"id":"W2962729862","doi":"10.1016/j.jnt.2012.05.003","title":"The generalized Erdős–Falconer distance problems in vector spaces over finite fields","year":2012,"lang":"en","type":"article","venue":"Journal of Number Theory","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"Ministry of Education, Science and Technology","keywords":"Mathematics; Cardinality (data modeling); Finite field; Generalization; Diagonal; Exponential function; Combinatorics; Discrete mathematics; Mathematical analysis; Geometry","score_opus":0.02464609370489775,"score_gpt":0.30056306146112693,"score_spread":0.2759169677562292,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2962729862","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98027694,0.0026868412,0.0029043558,0.00040973403,0.0020761623,0.00019960904,0.000019714133,0.000019756237,0.011406867],"genre_scores_gemma":[0.9958187,0.00019100915,0.0012214577,0.00024344053,0.00066404993,0.0000065439103,6.0348003e-7,0.000027386755,0.0018268636],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99823904,0.00043849685,0.0005548064,0.000085981264,0.00031268233,0.00036901512],"domain_scores_gemma":[0.9963829,0.0026621954,0.00047720107,0.00029774004,0.000077002274,0.000102948594],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.002242511,0.00016896958,0.00030587486,0.000054567205,0.00017928494,0.000057225883,0.00035436338,0.00011801472,0.001094592],"category_scores_gemma":[0.00082698656,0.000092077236,0.00020701256,0.0001389097,0.0001491058,0.00025959633,0.00007897426,0.00046454518,0.000007758235],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022041444,0.00010241971,0.016301524,0.000047303667,0.00013246821,0.000010539667,0.004377306,0.000022421289,0.000060751867,0.96473944,0.012775169,0.0012102411],"study_design_scores_gemma":[0.0006958917,0.000028899918,0.0052108024,0.00011677931,0.000043254688,0.00007313684,0.0003161313,0.000019838553,0.0001134704,0.94192815,0.051293105,0.00016052084],"about_ca_topic_score_codex":0.0000034992981,"about_ca_topic_score_gemma":0.000025515032,"teacher_disagreement_score":0.038517937,"about_ca_system_score_codex":0.000045644563,"about_ca_system_score_gemma":0.000027031136,"threshold_uncertainty_score":0.99981856},"labels":[],"label_agreement":null},{"id":"W2963003471","doi":"10.1016/j.jcta.2017.08.004","title":"Turán numbers of extensions","year":2017,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":27,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"H2020 European Research Council; Natural Sciences and Engineering Research Council of Canada","keywords":"Hypergraph; Combinatorics; Mathematics; Enhanced Data Rates for GSM Evolution; Extension (predicate logic); Stability (learning theory); Discrete mathematics; Computer science","score_opus":0.028833399518335037,"score_gpt":0.31922771188474053,"score_spread":0.2903943123664055,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963003471","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9704059,0.00017577228,0.0001649705,0.00022331162,0.011872845,0.00010703423,0.0000075607204,0.000013779099,0.017028866],"genre_scores_gemma":[0.99679506,0.00006858314,0.0019566314,0.000023056462,0.0006719906,7.690923e-7,1.5209557e-7,0.000022346905,0.0004614416],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985331,0.00019648409,0.0006309685,0.00008987321,0.00037252554,0.00017699802],"domain_scores_gemma":[0.99663657,0.00060940604,0.0015128242,0.0006799094,0.00045721664,0.00010408041],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016247957,0.00015394982,0.0005309658,0.00008586419,0.0005148486,0.00005847173,0.00077959883,0.00012221954,0.00018487552],"category_scores_gemma":[0.0028634968,0.00010967386,0.00031814416,0.00004486831,0.00050367194,0.0004314034,0.00020577203,0.00030955783,8.6373143e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009071393,0.00008360587,0.0002532782,0.00003610433,0.00015428493,0.000033964894,0.0009711275,7.4826744e-7,0.00067001453,0.994779,0.0014820839,0.00062864413],"study_design_scores_gemma":[0.0010740341,0.00033490505,0.00061458186,0.00011240322,0.00010384852,0.00015648632,0.00051817653,5.000714e-7,0.004476007,0.9873929,0.005099349,0.000116799],"about_ca_topic_score_codex":0.000002330363,"about_ca_topic_score_gemma":7.4919814e-7,"teacher_disagreement_score":0.026389169,"about_ca_system_score_codex":0.000020987742,"about_ca_system_score_gemma":0.00007002473,"threshold_uncertainty_score":0.44723704},"labels":[],"label_agreement":null},{"id":"W2963040959","doi":"10.1016/j.ejc.2014.03.007","title":"On the robustness of random<mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.gif\" display=\"inline\" overflow=\"scroll\"><mml:mi>k</mml:mi></mml:math>-cores","year":2014,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Combinatorics; Bounded function; Mathematics; Robustness (evolution); Discrete mathematics; Mathematical analysis; Chemistry","score_opus":0.018840471331056208,"score_gpt":0.2402401927875879,"score_spread":0.2213997214565317,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963040959","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9856073,0.00022202384,0.002860242,0.00019185027,0.0021100468,0.00005397172,0.0000129637265,0.000037800906,0.008903757],"genre_scores_gemma":[0.9979422,0.00017168038,0.00081043685,0.00027225306,0.0005534039,0.000004930713,0.000004862907,0.00013543245,0.00010477653],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967662,0.0006307683,0.0010092342,0.00025293967,0.00093507854,0.00040578388],"domain_scores_gemma":[0.9954011,0.0019522101,0.0014152408,0.0008329713,0.00021067314,0.00018783835],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.003222365,0.00032140018,0.00038582407,0.00013689106,0.00046095898,0.00014584899,0.0010673932,0.0001513661,0.00004095043],"category_scores_gemma":[0.0021018274,0.00025172697,0.000584328,0.0002491662,0.00031621824,0.00020436256,0.00035396224,0.0008201522,0.000051168234],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005873752,0.00019660195,0.000014619302,0.00018432816,0.00025913073,0.00014561714,0.0008354658,0.00088667765,0.000121769,0.9935262,0.0027714365,0.00047076834],"study_design_scores_gemma":[0.0112715755,0.004165263,0.0005907924,0.002108682,0.0012857169,0.0012950905,0.0010998436,0.5564843,0.007846915,0.39922982,0.013374977,0.0012470417],"about_ca_topic_score_codex":0.0000027505682,"about_ca_topic_score_gemma":0.0000014331582,"teacher_disagreement_score":0.5942964,"about_ca_system_score_codex":0.000013840133,"about_ca_system_score_gemma":0.00009512303,"threshold_uncertainty_score":0.9999935},"labels":[],"label_agreement":null},{"id":"W2963063409","doi":"10.1007/s10474-018-0831-x","title":"An application of kissing number in sum-product estimates","year":2018,"lang":"en","type":"article","venue":"Acta Mathematica Academiae Scientiarum Hungaricae","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Mathematics; Combinatorics; Product (mathematics); Quaternion; Regular polygon; Geometry","score_opus":0.026340220796629586,"score_gpt":0.35008447169359214,"score_spread":0.32374425089696257,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963063409","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97520906,0.00004342303,0.011206558,0.00043408538,0.00032547343,0.00064849074,0.000012264382,0.00018372688,0.011936937],"genre_scores_gemma":[0.9210411,0.000005969392,0.07846898,0.000078013334,0.00017093346,0.00003186754,0.0000063770217,0.000051052935,0.00014572327],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99693304,0.00014544537,0.0009567496,0.00069980393,0.0006581604,0.0006067996],"domain_scores_gemma":[0.9972971,0.0005532803,0.0005199452,0.0012575997,0.00019951184,0.00017253746],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0023564352,0.00031992828,0.0005775078,0.00030461946,0.0003817966,0.00007154101,0.0011197159,0.00027656285,0.00031842117],"category_scores_gemma":[0.0013661454,0.00026400023,0.00011996858,0.0010495955,0.00091000943,0.00056528003,0.0002908413,0.0004966848,0.00004752515],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000059522485,0.0007085512,0.016315639,0.0006628257,0.000081455946,0.000002672447,0.009904236,0.0000035822673,0.112857185,0.8500586,0.002987446,0.006358254],"study_design_scores_gemma":[0.000344081,0.000059831887,0.005166047,0.0001523076,0.00008483455,0.00003244798,0.0003008274,0.007722688,0.058814097,0.9263035,0.0006414084,0.0003778997],"about_ca_topic_score_codex":0.000015412817,"about_ca_topic_score_gemma":0.000011442539,"teacher_disagreement_score":0.0762449,"about_ca_system_score_codex":0.000058271547,"about_ca_system_score_gemma":0.00005330457,"threshold_uncertainty_score":0.9999812},"labels":[],"label_agreement":null},{"id":"W2963074859","doi":"10.37236/3345","title":"Repeated Columns and an Old Chestnut","year":2013,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Disjoint sets; Combinatorics; Mathematics; Conjecture; Multiplicity (mathematics); Integer (computer science); Bounded function; Family of sets; Matrix (chemical analysis); Discrete mathematics; Set (abstract data type); Geometry; Computer science","score_opus":0.013004428093068673,"score_gpt":0.2703333824382416,"score_spread":0.25732895434517294,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963074859","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99647915,0.0009540571,0.00065575703,0.00041427967,0.0002636435,0.00016061211,3.4215776e-7,0.000020600512,0.0010515767],"genre_scores_gemma":[0.9988632,0.00022258866,0.00005491221,0.00011293575,0.00011358863,0.0000027497595,2.2135816e-7,0.000022908614,0.00060689764],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986768,0.00018209005,0.00037715788,0.0000928794,0.00027945457,0.00039166154],"domain_scores_gemma":[0.99864,0.00032130777,0.0003625771,0.0003284402,0.00024639713,0.00010125889],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011278202,0.0001357212,0.0002611697,0.00006864385,0.00024284463,0.00006122646,0.00042074273,0.00007968247,0.000046660105],"category_scores_gemma":[0.00022649074,0.00008216624,0.0000782847,0.00017903646,0.0001097951,0.00021550224,0.00006584337,0.0006492717,0.0000017163778],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001997658,0.0000626682,0.00030222832,0.000011184234,0.000079022786,0.000002837319,0.0006441377,0.0000011394901,0.00015577397,0.99711007,0.0010321202,0.00057881733],"study_design_scores_gemma":[0.0005554788,0.0005640549,0.0008264527,0.000014900152,0.00007257046,0.0002867156,0.00023359306,0.00007700926,0.0007645997,0.995779,0.0007202207,0.000105416606],"about_ca_topic_score_codex":0.000011832269,"about_ca_topic_score_gemma":0.0000033997826,"teacher_disagreement_score":0.002384066,"about_ca_system_score_codex":0.00009227019,"about_ca_system_score_gemma":0.000092512586,"threshold_uncertainty_score":0.3350642},"labels":[],"label_agreement":null},{"id":"W2963199462","doi":"10.37236/6276","title":"On the Additive Bases Problem in Finite Fields","year":2016,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Mathematics; Abelian group; Combinatorics; Prime (order theory); Additive group; Finite field; Group (periodic table); Vector space; Discrete mathematics; Pure mathematics","score_opus":0.014462194633739722,"score_gpt":0.2532164183811899,"score_spread":0.2387542237474502,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963199462","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9648157,0.000998085,0.008563489,0.0122437095,0.00074419135,0.00042171855,0.0000070782044,0.000023543687,0.012182517],"genre_scores_gemma":[0.9985547,0.0004842085,0.000012457047,0.00031469663,0.000077498895,0.000004997002,7.326864e-8,0.000014842378,0.00053651194],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985712,0.00030843593,0.0003491525,0.00007647375,0.000321752,0.00037297176],"domain_scores_gemma":[0.9927497,0.006497441,0.00032529162,0.0002803374,0.00011683858,0.000030411988],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016327586,0.00012879203,0.00020311993,0.00008356727,0.00015337225,0.000015336898,0.00056339375,0.000066371686,0.00010398665],"category_scores_gemma":[0.0011942325,0.00004695162,0.00012388262,0.0002140263,0.000094636154,0.00007084974,0.000056782297,0.0006715623,0.0000032490038],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008794451,0.00006414178,0.000041216106,0.0000040129485,0.00005174971,0.000005974358,0.00046751514,0.0000047038584,0.000014600684,0.99477273,0.0034365451,0.0010488885],"study_design_scores_gemma":[0.0005967757,0.00051140063,0.000074367665,0.000109171684,0.00002529796,0.000035470566,0.00010521486,0.000008024583,0.0009314057,0.99494255,0.0025832239,0.00007709936],"about_ca_topic_score_codex":0.000001330978,"about_ca_topic_score_gemma":0.0000062825966,"teacher_disagreement_score":0.033739045,"about_ca_system_score_codex":0.00015300373,"about_ca_system_score_gemma":0.00014395139,"threshold_uncertainty_score":0.2917641},"labels":[],"label_agreement":null},{"id":"W2963210532","doi":"10.1016/j.disc.2014.08.023","title":"Almost all <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.gif\" display=\"inline\" overflow=\"scroll\"> <mml:mi>k</mml:mi> </mml:math> -cop-win graphs contain a dominating set of cardinality <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si2.gif\" display=\"inline\" overflow=\"scroll\"> <mml:mi>k</mml:mi> </mml:math>","year":2014,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Cardinality (data modeling); Vertex (graph theory); Graph; Discrete mathematics; Database; Computer science","score_opus":0.022176361831512063,"score_gpt":0.2696133685318904,"score_spread":0.24743700670037833,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963210532","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9825631,0.0007147427,0.004276997,0.00041980017,0.0021868641,0.00058538595,0.001782556,0.00070260925,0.0067679747],"genre_scores_gemma":[0.9697467,0.0006311021,0.023191344,0.0012063237,0.0015914576,0.00093268807,0.0013083732,0.0010948202,0.00029720916],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9847849,0.00081976724,0.0046341396,0.002661676,0.0038500708,0.003249455],"domain_scores_gemma":[0.98392856,0.0045545083,0.0046751834,0.0050967373,0.00051030854,0.0012347247],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","research_integrity","insufficient_payload"],"consensus_categories":["metaepi_narrow","research_integrity"],"category_scores_codex":[0.0058941413,0.0024366486,0.0022201713,0.00064125325,0.0022230276,0.0011964439,0.003222257,0.0026149275,0.00018595246],"category_scores_gemma":[0.0045845755,0.0026501806,0.0034883358,0.0012471675,0.0021602819,0.0015085376,0.0029892237,0.0027067792,0.00081023417],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010761473,0.00077303156,0.00007157981,0.0054375776,0.0024740128,0.0005312845,0.008779409,0.00069244206,0.0021258022,0.9752761,0.0019826326,0.00077998167],"study_design_scores_gemma":[0.0038489539,0.0013672006,0.00010566239,0.0029866172,0.0029525966,0.0010878752,0.004218311,0.9128541,0.009770028,0.054399684,0.0038462998,0.0025626828],"about_ca_topic_score_codex":0.0007686664,"about_ca_topic_score_gemma":0.00046297265,"teacher_disagreement_score":0.92087644,"about_ca_system_score_codex":0.0001198962,"about_ca_system_score_gemma":0.00080467924,"threshold_uncertainty_score":0.99996775},"labels":[],"label_agreement":null},{"id":"W2963249283","doi":"10.1090/s0002-9939-2012-11338-3","title":"Fourier analysis and expanding phenomena in finite fields","year":2012,"lang":"en","type":"article","venue":"Proceedings of the American Mathematical Society","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":27,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"National Natural Science Foundation of China; Texas Higher Education Coordinating Board; National Science Foundation","keywords":"Fourier analysis; Fourier transform; Physics; Statistical physics; Mathematics; Mathematical analysis","score_opus":0.019436685145684276,"score_gpt":0.2884636909675736,"score_spread":0.2690270058218894,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963249283","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9922658,0.00004838362,0.0010773453,0.00019029598,0.000024705712,0.00015092106,0.0000026104522,0.000023743589,0.0062161945],"genre_scores_gemma":[0.9652674,0.00002632358,0.034245484,0.00019285518,0.000083343846,0.000015085608,1.2255138e-7,0.000015266165,0.00015412008],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988801,0.000013650536,0.00034724578,0.00015549877,0.00026806735,0.00033547805],"domain_scores_gemma":[0.99874395,0.0006390669,0.0003359848,0.00014957538,0.000044440858,0.00008696345],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008102122,0.00015508982,0.0004942135,0.000062642684,0.00013168652,0.000021807402,0.00026254327,0.000054951015,0.00005643678],"category_scores_gemma":[0.00057513773,0.000096079675,0.00033713106,0.00087530207,0.000478772,0.000132081,0.00030853858,0.00021768746,7.2155206e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002949336,0.00025795554,0.31684363,0.0006029978,0.00088272843,9.19211e-8,0.036196608,0.0000017621236,0.00059189607,0.6414776,0.00071170024,0.002403572],"study_design_scores_gemma":[0.00024883414,0.000039809354,0.031227278,0.000074315525,0.000605428,0.0000040467485,0.005082642,0.001901241,0.0012211112,0.95926845,0.00006835234,0.00025848922],"about_ca_topic_score_codex":0.000008158489,"about_ca_topic_score_gemma":4.8491563e-7,"teacher_disagreement_score":0.31779087,"about_ca_system_score_codex":0.000029358864,"about_ca_system_score_gemma":0.0000044831504,"threshold_uncertainty_score":0.39180157},"labels":[],"label_agreement":null},{"id":"W2963259603","doi":"10.1002/rsa.20804","title":"Clique coloring of binomial random graphs","year":2018,"lang":"en","type":"article","venue":"Random Structures and Algorithms","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Fields Institute for Research in Mathematical Sciences; Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada; Ryerson University","keywords":"Combinatorics; Mathematics; Brooks' theorem; Clique number; Graph coloring; Monochromatic color; Random graph; Clique; Clique graph; Fractional coloring; Discrete mathematics; Split graph; Chromatic scale; Graph; Chordal graph; 1-planar graph; Graph power; Line graph; Physics","score_opus":0.02181948832564345,"score_gpt":0.2919788505881161,"score_spread":0.27015936226247267,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963259603","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9907883,0.00045784464,0.004389011,0.00004220554,0.0011652752,0.00048191787,0.000050744446,0.000076445314,0.0025482797],"genre_scores_gemma":[0.9862994,0.00014357467,0.012702491,0.00007319109,0.0006340201,0.000012961434,0.000004254956,0.000032968026,0.00009715675],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984043,0.00014612405,0.0005162775,0.00033781023,0.00025978102,0.00033567258],"domain_scores_gemma":[0.99846363,0.0006919448,0.00024312662,0.00034739097,0.00013433828,0.00011956617],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005448735,0.00028061707,0.00068721897,0.00015951582,0.00039388225,0.000039502655,0.0002392831,0.00018198008,0.00015471093],"category_scores_gemma":[0.00027476985,0.00019649974,0.0002107755,0.00018061834,0.00063786976,0.00009203674,0.00014710851,0.00020758898,6.5623885e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0046257013,0.00005213577,0.0016453923,0.00029285767,0.0004877043,0.00001753626,0.0039852113,0.000006464166,0.003029734,0.945976,0.0013853176,0.03849594],"study_design_scores_gemma":[0.014074919,0.00025425036,0.001965107,0.000048176935,0.00012266866,0.00006379017,0.000167275,0.000461228,0.013765085,0.9672101,0.0015514713,0.0003159361],"about_ca_topic_score_codex":0.0000359876,"about_ca_topic_score_gemma":0.000011715229,"teacher_disagreement_score":0.03818,"about_ca_system_score_codex":0.000010376452,"about_ca_system_score_gemma":0.00002495395,"threshold_uncertainty_score":0.8013027},"labels":[],"label_agreement":null},{"id":"W2963364585","doi":"10.1016/j.jnt.2016.08.001","title":"Davenport constant for commutative rings","year":2016,"lang":"en","type":"article","venue":"Journal of Number Theory","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"National Science Foundation of Sri Lanka; National Sanitarium Association; University of Minnesota Duluth; National Science Foundation","keywords":"Mathematics; Abelian group; Commutative property; Constant (computer programming); Commutative ring; Unit (ring theory); Pure mathematics; Group (periodic table); Ring (chemistry); Discrete mathematics","score_opus":0.04029419431601115,"score_gpt":0.3458230644498114,"score_spread":0.30552887013380026,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963364585","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.75647736,0.00023634543,0.15288131,0.001180608,0.0021118107,0.00057261303,0.0004605039,0.000068907415,0.086010545],"genre_scores_gemma":[0.9813467,0.0000246412,0.016200237,0.00023705857,0.00027629183,0.000005244605,5.393779e-7,0.000031468022,0.0018778167],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99884045,0.00016602274,0.0005074045,0.00008576085,0.00020887991,0.00019150008],"domain_scores_gemma":[0.99439865,0.004410694,0.00060542807,0.00020666463,0.0002895667,0.000088977715],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.001742573,0.00013054954,0.00033075488,0.000059995295,0.00013097859,0.000013258907,0.0002769109,0.00006997687,0.0016141527],"category_scores_gemma":[0.001393296,0.00006794324,0.00025928963,0.000047952537,0.0002468274,0.00014955067,0.000057971476,0.00014014014,0.000007153631],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00039568744,0.000049891732,0.0005042829,0.000027325172,0.0002073272,0.000024142751,0.001248549,9.0873165e-8,0.00039377046,0.9717692,0.019369839,0.0060098735],"study_design_scores_gemma":[0.0010516944,0.00010616371,0.00014516823,0.00018369219,0.00007851665,0.0004230179,0.0005033812,6.749565e-7,0.0013539735,0.97568053,0.02035819,0.0001149986],"about_ca_topic_score_codex":1.7301136e-7,"about_ca_topic_score_gemma":3.7542992e-7,"teacher_disagreement_score":0.22486934,"about_ca_system_score_codex":0.000048048165,"about_ca_system_score_gemma":0.000053676882,"threshold_uncertainty_score":0.9992985},"labels":[],"label_agreement":null},{"id":"W2963377168","doi":"10.1016/j.jfa.2016.04.008","title":"On the Hardy–Littlewood majorant problem for arithmetic sets","year":2016,"lang":"en","type":"article","venue":"Journal of Functional Analysis","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Mathematics; Infimum and supremum; Combinatorics; Class (philosophy); Constant (computer programming); Arithmetic; Discrete mathematics","score_opus":0.04172163314240843,"score_gpt":0.2810188145212588,"score_spread":0.2392971813788504,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963377168","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5331326,0.00025067208,0.44182765,0.020006787,0.001099279,0.0004394332,0.00015814012,0.00003268803,0.0030527357],"genre_scores_gemma":[0.9924493,0.000017858134,0.0053883907,0.00038752853,0.0003054207,0.000010688667,0.0000014175833,0.000013984619,0.0014254466],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99861926,0.0001006816,0.0004945422,0.00012518963,0.0004980567,0.0001623005],"domain_scores_gemma":[0.9962645,0.0025671236,0.00047154544,0.00021873628,0.00040970213,0.00006835813],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012312586,0.00012906555,0.00033490226,0.00031776095,0.00024408287,0.000029025783,0.00020731204,0.000057622863,0.0007420229],"category_scores_gemma":[0.0007257937,0.00005059918,0.00084876077,0.00036475356,0.00007182124,0.00008091586,0.000026140073,0.0001332028,0.0000051771754],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00047447134,0.00014977618,0.00070931285,0.00002423127,0.0055471146,0.0000055652167,0.00012462334,0.00023392355,0.0006521631,0.9678766,0.020646462,0.0035557637],"study_design_scores_gemma":[0.0005567114,0.00019576124,0.0022721794,0.000035073048,0.0019027283,0.000032999687,0.000046374043,0.00017189886,0.00030788736,0.9916883,0.0026968298,0.00009327395],"about_ca_topic_score_codex":7.755621e-7,"about_ca_topic_score_gemma":0.0000029952455,"teacher_disagreement_score":0.45931664,"about_ca_system_score_codex":0.000052688392,"about_ca_system_score_gemma":0.000038584527,"threshold_uncertainty_score":0.81246305},"labels":[],"label_agreement":null},{"id":"W2963406632","doi":"10.1017/fms.2017.24","title":"LOW-DEGREE BOOLEAN FUNCTIONS ON , WITH AN APPLICATION TO ISOPERIMETRY","year":2017,"lang":"en","type":"article","venue":"Forum of Mathematics Sigma","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of Toronto; Hebrew University of Jerusalem","keywords":"Isoperimetric inequality; Mathematics; Conjecture; Combinatorics; Coset; Boolean function; Eigenvalues and eigenvectors; Degree (music); Tuple; Discrete mathematics","score_opus":0.035998914647910836,"score_gpt":0.3063161394844476,"score_spread":0.27031722483653675,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963406632","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.82213473,0.00001004786,0.13400869,0.0004357866,0.00019684584,0.00092856976,0.00006858854,0.00011670155,0.042100012],"genre_scores_gemma":[0.9411696,0.0000012950034,0.05767641,0.00011179006,0.000081032915,0.000050712762,0.0000062114746,0.000057988633,0.0008449246],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99865836,0.000022555943,0.00037427945,0.00028954764,0.0003773751,0.0002778664],"domain_scores_gemma":[0.99699944,0.0001852654,0.00041666825,0.0021292253,0.00012541987,0.00014396972],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036086116,0.00023098876,0.0003627105,0.00013166445,0.0006620727,0.000073244395,0.0007296142,0.000108268956,0.000077334764],"category_scores_gemma":[0.00035547404,0.00016515858,0.00009438858,0.000083522384,0.00015194273,0.00016892102,0.00017051521,0.00015167176,0.000035865058],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012740612,0.0007297598,0.00042396242,0.0003199437,0.000096233016,0.0000023864586,0.0017284235,0.000054515647,0.0014150555,0.98403215,0.0020426426,0.009027521],"study_design_scores_gemma":[0.00085478736,0.0016864949,0.001355088,0.00037606063,0.00012789149,0.00002047956,0.002543648,0.0014568694,0.025512027,0.96398807,0.0015353119,0.00054327335],"about_ca_topic_score_codex":0.000011638202,"about_ca_topic_score_gemma":0.000054375334,"teacher_disagreement_score":0.11903489,"about_ca_system_score_codex":0.00002565376,"about_ca_system_score_gemma":0.00002182869,"threshold_uncertainty_score":0.67349714},"labels":[],"label_agreement":null},{"id":"W2963423082","doi":"10.1016/j.disc.2016.09.028","title":"Decompositions of edge-colored infinite complete graphs into monochromatic paths","year":2016,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Mathematics; Monochromatic color; Colored; Combinatorics; Enhanced Data Rates for GSM Evolution; Discrete mathematics; Computer science; Optics","score_opus":0.029825100914368602,"score_gpt":0.29478857743477654,"score_spread":0.26496347652040797,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963423082","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.92459434,0.00010267456,0.06451176,0.00028645893,0.00029752846,0.00072028855,0.00019248435,0.00021828814,0.009076156],"genre_scores_gemma":[0.86436975,0.000033676428,0.13521439,0.00005361865,0.000041928008,0.000052819487,0.000010228828,0.00006647942,0.00015708445],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997696,0.00012700546,0.0010421274,0.00029999253,0.00043782085,0.00039709714],"domain_scores_gemma":[0.9962743,0.0018069842,0.00056684203,0.0010288736,0.00017215135,0.00015083552],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004697694,0.00036676571,0.0007280117,0.00025725525,0.00029496595,0.000031779837,0.0005818846,0.00015768509,0.00028173742],"category_scores_gemma":[0.00061771675,0.00022742503,0.00035796335,0.00031937644,0.0004845723,0.00016946651,0.00027790217,0.0001359491,0.00003449926],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020647123,0.00015475161,0.00022640923,0.00071688695,0.00019606936,0.000005935355,0.0062584304,0.000001341869,0.014968828,0.97583115,0.0006329296,0.0009866441],"study_design_scores_gemma":[0.0007076835,0.00012608316,0.00035636302,0.0005646556,0.00016515364,0.000024988643,0.00051740126,0.00041156248,0.0048424355,0.99175626,0.00017973594,0.0003476818],"about_ca_topic_score_codex":0.000005585811,"about_ca_topic_score_gemma":0.0000094197,"teacher_disagreement_score":0.07070263,"about_ca_system_score_codex":0.00004436353,"about_ca_system_score_gemma":0.00003340586,"threshold_uncertainty_score":0.92741233},"labels":[],"label_agreement":null},{"id":"W2963578227","doi":"10.1017/s0963548313000060","title":"Arithmetic Progressions in Sumsets and <i>L<sup>p</sup></i>-Almost-Periodicity","year":2013,"lang":"en","type":"article","venue":"Combinatorics Probability Computing","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":26,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Engineering and Physical Sciences Research Council; Natural Sciences and Engineering Research Council of Canada; University of British Columbia; National Science Foundation","keywords":"Mathematics; Lemma (botany); Arithmetic progression; Combinatorics; Arithmetic; Simple (philosophy); BETA (programming language); Binary logarithm; Discrete mathematics; Computer science","score_opus":0.028311161675105,"score_gpt":0.27888195625352474,"score_spread":0.25057079457841974,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963578227","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9965945,0.0002665703,0.00035184223,0.0002064797,0.00023970187,0.0012555438,0.0000031548625,0.00018899783,0.0008932266],"genre_scores_gemma":[0.99029505,0.000006789137,0.00946299,0.0000913136,0.000040658608,0.00004119275,0.000003042573,0.00003261273,0.000026325086],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973986,0.00035816772,0.0006929261,0.00061125425,0.0003473616,0.0005916638],"domain_scores_gemma":[0.9976502,0.0010668255,0.00018614317,0.0006669639,0.00023000807,0.00019984583],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012586215,0.0003291525,0.000522373,0.00015066213,0.0005523146,0.00015545177,0.0003966471,0.00021092143,0.000034256926],"category_scores_gemma":[0.0016698566,0.00028078447,0.00009441759,0.0005453881,0.00031122193,0.00019462834,0.0007727239,0.0006303408,0.0000056782524],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014992752,0.00079567696,0.23741475,0.000758278,0.00003951702,0.000015022271,0.011887386,0.00012251362,0.000027119058,0.727803,0.00038497942,0.020736799],"study_design_scores_gemma":[0.00066349626,0.00008132065,0.028092055,0.00014554037,0.000015958776,0.000023057566,0.0004604914,0.020820348,0.000055742905,0.9492535,0.000068535795,0.0003199707],"about_ca_topic_score_codex":0.000045611963,"about_ca_topic_score_gemma":0.000005748077,"teacher_disagreement_score":0.22145052,"about_ca_system_score_codex":0.00013237713,"about_ca_system_score_gemma":0.00005337947,"threshold_uncertainty_score":0.9999644},"labels":[],"label_agreement":null},{"id":"W2963637355","doi":"10.1016/j.jctb.2019.02.005","title":"Goldberg's conjecture is true for random multigraphs","year":2019,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Israel Science Foundation","keywords":"Multigraph; Combinatorics; Conjecture; Mathematics; Edge coloring; Space (punctuation); Degree (music); Discrete mathematics; Physics; Graph; Computer science","score_opus":0.012289576074293191,"score_gpt":0.27411417064528815,"score_spread":0.26182459457099494,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963637355","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96941674,0.00065789383,0.0015445009,0.00030880762,0.022886682,0.0008626677,0.00004351054,0.00004794529,0.004231247],"genre_scores_gemma":[0.9947173,0.00006138438,0.00231743,0.00021889826,0.0011286353,0.000007692033,0.0000013567123,0.000053608273,0.0014936714],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998078,0.0002881118,0.0007612885,0.00017692501,0.0003894069,0.0003062807],"domain_scores_gemma":[0.9960775,0.0022150325,0.0007696137,0.00041396182,0.00039718492,0.00012670373],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019109073,0.00028119088,0.0008072258,0.00017039292,0.00019499795,0.00006381069,0.00052248075,0.00024413658,0.000552452],"category_scores_gemma":[0.0007949926,0.00019660656,0.00066452485,0.00015380963,0.00016278186,0.00035142916,0.00007132,0.00039467792,0.0000031097977],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.006756716,0.000080920574,0.00021539617,0.00013973529,0.00037004938,0.0000075138387,0.0025757113,0.00000356077,0.0005790856,0.9843125,0.0044659288,0.00049290643],"study_design_scores_gemma":[0.009395742,0.0009201522,0.000040954004,0.00009831148,0.00015074776,0.00011188502,0.00051503105,0.000004236295,0.0077120056,0.94757646,0.033237938,0.00023656063],"about_ca_topic_score_codex":6.954782e-7,"about_ca_topic_score_gemma":3.6791877e-7,"teacher_disagreement_score":0.03673604,"about_ca_system_score_codex":0.00003871134,"about_ca_system_score_gemma":0.000080249156,"threshold_uncertainty_score":0.8017383},"labels":[],"label_agreement":null},{"id":"W2963647147","doi":"10.1002/rsa.20874","title":"Meyniel's conjecture holds for random <b><i>d</i></b>‐regular graphs","year":2019,"lang":"en","type":"article","venue":"Random Structures and Algorithms","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Mathematics; Conjecture; Combinatorics; Discrete mathematics; Graph; Random regular graph; Random graph; Constant (computer programming); Chordal graph; 1-planar graph; Computer science","score_opus":0.01381986529594286,"score_gpt":0.2690248282542968,"score_spread":0.25520496295835393,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963647147","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9729365,0.0033676834,0.01489837,0.0003443373,0.0026704753,0.0032652968,0.00027060512,0.00027761533,0.0019691046],"genre_scores_gemma":[0.9772911,0.00023551549,0.020216659,0.00043238068,0.0004900983,0.00008640008,0.000039027444,0.000101405254,0.0011074237],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977347,0.00014062274,0.0005177344,0.00064556074,0.00037521808,0.0005861678],"domain_scores_gemma":[0.99751943,0.0013372791,0.00023580529,0.0006114824,0.000106924716,0.00018905269],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00064081245,0.00051054655,0.0010087868,0.00016489116,0.00047505813,0.0001288418,0.0003540715,0.0003488808,0.00026522132],"category_scores_gemma":[0.00019712417,0.00035019632,0.00046394678,0.0001754279,0.00022204213,0.00014325668,0.000131956,0.00031911719,0.000002116268],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002498701,0.00003938116,0.0006268283,0.00058281963,0.0005962557,0.000013241149,0.0015502597,0.000050505587,0.0015650198,0.96535045,0.004456961,0.022669567],"study_design_scores_gemma":[0.026034446,0.00020482323,0.00043173955,0.000047835023,0.00021031265,0.00009440655,0.00019319895,0.00084102794,0.0024429155,0.9549155,0.014030627,0.00055314053],"about_ca_topic_score_codex":0.000012827128,"about_ca_topic_score_gemma":0.000004432179,"teacher_disagreement_score":0.023535745,"about_ca_system_score_codex":0.000016912934,"about_ca_system_score_gemma":0.000030492098,"threshold_uncertainty_score":0.999895},"labels":[],"label_agreement":null},{"id":"W2963663072","doi":"","title":"Rainbow perfect matchings and Hamilton cycles in the random\\ngeometric graph","year":2017,"lang":"en","type":"article","venue":"Insecta mundi","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada; Ryerson University; Simons Foundation","keywords":"Combinatorics; Mathematics; Rainbow; Random regular graph; Vertex (graph theory); Discrete mathematics; Hamiltonian path; Graph; Line graph; 1-planar graph","score_opus":0.04590574373742391,"score_gpt":0.3236284613387166,"score_spread":0.2777227176012927,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963663072","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9905527,0.00049645366,0.000046870464,0.00020967814,0.0002883707,0.00033368389,0.0000068105005,0.00003799578,0.008027415],"genre_scores_gemma":[0.99883807,0.00023525982,0.0004224104,0.00022395713,0.00010936558,0.00002516583,0.0000013294498,0.000023771108,0.00012069314],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99875754,0.00020888161,0.00024336248,0.0002453268,0.00025825293,0.0002866394],"domain_scores_gemma":[0.9976183,0.0012649448,0.00017863305,0.00087025977,0.000023928924,0.000043916913],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014234546,0.00019594123,0.00029846872,0.0003051402,0.0009998723,0.00028124938,0.00075432245,0.00011332638,0.000031001564],"category_scores_gemma":[0.0010455099,0.00011990414,0.00011620995,0.00018373018,0.00029842957,0.00018967228,0.0001615969,0.00033947872,0.000002696227],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005537956,0.00024889575,0.45058692,0.00043219395,0.00020903532,0.00016522515,0.06361216,0.0000026806817,0.0010221078,0.46245635,0.0023872762,0.01832337],"study_design_scores_gemma":[0.0018749469,0.000057813708,0.30062026,0.000052922158,0.00003532477,0.00006975147,0.000106893545,0.000031574247,0.000040334748,0.6962436,0.0006663586,0.00020022021],"about_ca_topic_score_codex":0.0013337133,"about_ca_topic_score_gemma":0.00068729336,"teacher_disagreement_score":0.23378725,"about_ca_system_score_codex":0.00001469171,"about_ca_system_score_gemma":0.000010029458,"threshold_uncertainty_score":0.76903105},"labels":[],"label_agreement":null},{"id":"W2963698001","doi":"10.55016/ojs/cdm.v7i2.62148","title":"Antichains and counterpoint dichotomies","year":2012,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Consejo Nacional de Ciencia y Tecnología","keywords":"Counterpoint; Dichotomy; Mathematics; Combinatorics; Mathematical economics; Genealogy; Sociology; History; Statistics","score_opus":0.019638630347670088,"score_gpt":0.3332550051339457,"score_spread":0.3136163747862756,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963698001","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7438132,0.00063788926,0.24307276,0.0011033431,0.0005654936,0.0011142363,0.0005707385,0.0002973967,0.008824936],"genre_scores_gemma":[0.9751916,0.00002577688,0.023851668,0.00022553434,0.00020542115,0.000056640867,0.000008199473,0.000033287117,0.00040188225],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99857444,0.000059127095,0.00040884444,0.0001771305,0.00024010614,0.00054037577],"domain_scores_gemma":[0.99829,0.0006242749,0.0001198962,0.0004967783,0.0001503761,0.00031864326],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00075305713,0.00023982757,0.00038475462,0.0001228612,0.0004683548,0.00007077219,0.00019445833,0.00010471139,0.00008762969],"category_scores_gemma":[0.0018179505,0.00018339811,0.00009923694,0.00018924083,0.00016814891,0.00018009939,0.00027500727,0.00015889724,0.000031986212],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000803046,0.00008082072,0.0006170182,0.00009279573,0.00006354898,0.0000011723822,0.0048980475,4.2918245e-7,0.00032256742,0.99178016,0.0019909025,0.0001444761],"study_design_scores_gemma":[0.0005442072,0.000066952445,0.0014665044,0.00015824306,0.00020546916,0.00008517141,0.001293642,0.00052168145,0.0019913577,0.98381805,0.009374943,0.00047377078],"about_ca_topic_score_codex":0.0000023575537,"about_ca_topic_score_gemma":0.0000031159946,"teacher_disagreement_score":0.23137838,"about_ca_system_score_codex":0.0000668246,"about_ca_system_score_gemma":0.000016913766,"threshold_uncertainty_score":0.74787575},"labels":[],"label_agreement":null},{"id":"W2963936522","doi":"10.1017/s0963548317000165","title":"","year":2017,"lang":"en","type":"article","venue":"University of Birmingham Research Portal (University of Birmingham)","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Trinity College","funders":"","keywords":"Mathematics; Combinatorics; Clique; Degree (music); Simple (philosophy); Graph; Decomposition; Simple graph; Discrete mathematics; Physics","score_opus":0.1339796699496667,"score_gpt":0.35703214388813465,"score_spread":0.22305247393846794,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963936522","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97304165,0.00008516585,0.0015012146,0.0008382174,0.00022730728,0.00085616304,0.0001720671,0.00013982136,0.023138402],"genre_scores_gemma":[0.9816247,0.0003500809,0.012596966,0.00000911987,0.00007623413,1.130042e-7,0.000011860276,0.000052874366,0.0052780556],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"qualitative","domain_scores_codex":[0.9935143,0.0006932849,0.0005530382,0.0012223991,0.002517281,0.0014997118],"domain_scores_gemma":[0.9904816,0.0015092582,0.0018168725,0.003441266,0.0019984317,0.00075252814],"candidate_categories":["metaepi_narrow","sts","open_science"],"consensus_categories":["sts"],"category_scores_codex":[0.0049343654,0.00054053427,0.0014116511,0.0016124236,0.00937159,0.00009048087,0.006163911,0.00061920786,0.0009098944],"category_scores_gemma":[0.0018685724,0.000696823,0.0009357717,0.0007119752,0.008835228,0.0019422243,0.0052101165,0.0013751453,0.000008902266],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.006105207,0.0027158807,0.13989677,0.0026195701,0.0024287938,0.008477246,0.085923344,0.00004465947,0.02491366,0.68090874,0.015076521,0.030889634],"study_design_scores_gemma":[0.016277175,0.003070806,0.16326676,0.0022254586,0.00092509773,0.00026011275,0.4225356,0.0013461548,0.009142244,0.3593053,0.018681195,0.002964086],"about_ca_topic_score_codex":0.010901178,"about_ca_topic_score_gemma":0.0060542207,"teacher_disagreement_score":0.33661225,"about_ca_system_score_codex":0.00011509376,"about_ca_system_score_gemma":0.00050451705,"threshold_uncertainty_score":0.9995483},"labels":[],"label_agreement":null},{"id":"W2964060150","doi":"","title":"How to Play Dundee","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Catalan number; Sequence (biology); nobody; Combinatorics; Value (mathematics); Mathematics; Mathematical economics; Bernoulli's principle; Discrete mathematics; Computer science; Statistics; Computer security; Physics","score_opus":0.016945077576415776,"score_gpt":0.25918928028676647,"score_spread":0.2422442027103507,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2964060150","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97222805,0.00001814155,0.0005370052,0.0008437104,0.0029396936,0.00019021824,0.0000025526092,0.00014741647,0.023093184],"genre_scores_gemma":[0.9950302,0.0000013543115,0.0025709865,0.0003939771,0.000035818164,0.000012901782,0.000001050094,0.00002966442,0.0019240411],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990806,0.00008249176,0.00013872179,0.00021604421,0.0002223044,0.00025984066],"domain_scores_gemma":[0.9988172,0.00039396397,0.00005680411,0.00054095016,0.00005710116,0.00013400003],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034716324,0.0001479742,0.00020982855,0.00006900868,0.00018832422,0.00007065786,0.00032586715,0.000089315516,0.000041166022],"category_scores_gemma":[0.0007379319,0.00012155775,0.00007506341,0.00014382826,0.00004191151,0.000074474956,0.00015060099,0.00013649973,0.000028212407],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008225717,0.000025956348,0.00045593135,0.000015632613,0.000019175328,0.0000017908782,0.00047052727,3.7869683e-7,0.00014200847,0.98335993,0.014454717,0.0010457027],"study_design_scores_gemma":[0.00037189046,0.00009230756,0.00081812945,0.00001356923,0.000014269977,0.0000041642056,0.000041669955,0.000016408623,0.0012690205,0.96891814,0.028270127,0.00017029997],"about_ca_topic_score_codex":0.0000026617379,"about_ca_topic_score_gemma":0.0000026152331,"teacher_disagreement_score":0.02280213,"about_ca_system_score_codex":0.000022682363,"about_ca_system_score_gemma":0.000008243792,"threshold_uncertainty_score":0.49569812},"labels":[],"label_agreement":null},{"id":"W2964103776","doi":"","title":"General systems of linear forms: Equidistribution and true complexity","year":2016,"lang":"en","type":"article","venue":"eScholarship (California Digital Library)","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada; Fonds Québécois de la Recherche sur la Nature et les Technologies; National Science Foundation","keywords":"Mathematics; Conjecture; Pseudorandom number generator; Rank (graph theory); Abelian group; Linear system; Homogeneous; Pure mathematics; Discrete mathematics; Combinatorics; Algorithm; Mathematical analysis","score_opus":0.03746152562738566,"score_gpt":0.257844526978059,"score_spread":0.22038300135067332,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2964103776","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98420715,0.00020710456,0.0032585007,0.0001356556,0.00014101209,0.00026515912,0.0065677688,0.00017430694,0.005043322],"genre_scores_gemma":[0.9978355,0.000023116154,0.0013022526,0.000043640746,0.00014652815,0.000009397486,0.0001329586,0.000044711436,0.00046187366],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99846333,0.00008545913,0.0005451958,0.00029099462,0.00028206376,0.00033292617],"domain_scores_gemma":[0.9988052,0.00033583012,0.00022386972,0.00039844838,0.000050079903,0.00018657632],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024437546,0.00024173013,0.000373417,0.00009230023,0.00016870495,0.0001821409,0.00029085772,0.00016152767,0.000111056775],"category_scores_gemma":[0.0004340378,0.00014678422,0.0001350207,0.00015609172,0.00032870704,0.0016431219,0.0003196807,0.0001542462,0.00003363062],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013817297,0.00007192123,0.038258165,0.00021746829,0.000062112704,0.0000058144446,0.000028417726,3.1985843e-7,0.0006026449,0.957003,0.00074747205,0.0028645056],"study_design_scores_gemma":[0.00086813315,0.00012903033,0.0030767918,0.0002047869,0.000027722655,0.000034129458,0.000026725578,0.00009055313,0.00537703,0.9673366,0.02249561,0.00033291083],"about_ca_topic_score_codex":0.0000016661014,"about_ca_topic_score_gemma":3.2098887e-7,"teacher_disagreement_score":0.035181373,"about_ca_system_score_codex":0.000022735,"about_ca_system_score_gemma":0.000027453423,"threshold_uncertainty_score":0.59856874},"labels":[],"label_agreement":null},{"id":"W2964312763","doi":"10.4153/cmb-2008-006-9","title":"The Minimal Number of Three-Term Arithmetic Progressions Modulo a Prime Converges to a Limit","year":2008,"lang":"en","type":"article","venue":"Canadian Mathematical Bulletin","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Canadian Mathematical Society; National Science Foundation","keywords":"Mathematics; Arithmetic progression; Modulo; Arithmetic; Conjecture; Term (time); Prime (order theory); Prime number theorem; Limit (mathematics); Combinatorics; Elliott–Halberstam conjecture; Prime number; Discrete mathematics; Beal's conjecture; Mathematical analysis","score_opus":0.03325750058395307,"score_gpt":0.28265198769346456,"score_spread":0.24939448710951148,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2964312763","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9759722,0.00011050135,0.00081788807,0.004792781,0.00018287872,0.0009561506,0.000047543464,0.00006914301,0.017050965],"genre_scores_gemma":[0.978021,0.000011767231,0.018633176,0.00035680848,0.00009635145,0.00012130223,0.0000018867731,0.00005667648,0.00270103],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979344,0.00010005669,0.00060038286,0.0003017633,0.00039813455,0.000665258],"domain_scores_gemma":[0.996939,0.0012623132,0.000141462,0.0007854665,0.00015291794,0.0007188106],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00046392615,0.00027271424,0.0004646469,0.0001042138,0.0006774129,0.000035984416,0.00062126777,0.00016491844,0.0044344934],"category_scores_gemma":[0.0018020944,0.00017629565,0.00019845975,0.00021975866,0.00059216656,0.000020800006,0.00015104882,0.0002659651,0.00095573603],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005161144,0.00013608373,0.002083499,0.0001986663,0.00014022493,0.00012104567,0.0029209384,5.3583597e-7,0.000059044927,0.9580425,0.034479894,0.0017659578],"study_design_scores_gemma":[0.0005451062,0.00014118981,0.0037053728,0.00036900185,0.00011022034,0.0005328919,0.00031156297,0.00016918467,0.00069996074,0.9579961,0.034860924,0.0005585345],"about_ca_topic_score_codex":0.00013037927,"about_ca_topic_score_gemma":0.00048541464,"teacher_disagreement_score":0.017815288,"about_ca_system_score_codex":0.00007316894,"about_ca_system_score_gemma":0.00021042132,"threshold_uncertainty_score":0.99982214},"labels":[],"label_agreement":null},{"id":"W2964325648","doi":"10.1016/j.jcta.2019.01.006","title":"On the Turán number of ordered forests","year":2019,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":20,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Schweizerischer Nationalfonds zur Förderung der Wissenschaftlichen Forschung","keywords":"Mathematics; Geography","score_opus":0.012665367482101385,"score_gpt":0.27549971829699826,"score_spread":0.26283435081489687,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2964325648","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97774774,0.00004565266,0.000044664823,0.00018979414,0.005850576,0.00017988324,0.000004095926,0.000009772114,0.015927803],"genre_scores_gemma":[0.99861133,0.000014778474,0.00025907517,0.00007714065,0.0003268858,0.000001507362,2.0600301e-7,0.000025312589,0.000683775],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99832433,0.00037446496,0.0005732025,0.000088222805,0.00046374343,0.00017600264],"domain_scores_gemma":[0.9960573,0.0024291913,0.00073809543,0.000422698,0.00029904317,0.000053706623],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0017364648,0.00016495537,0.0004443307,0.00006059969,0.000110944944,0.000026166026,0.0005219218,0.0001111261,0.0012579298],"category_scores_gemma":[0.0011406655,0.00008906241,0.00027414394,0.0001464913,0.00017928529,0.0001643758,0.00009538364,0.00037274254,0.000008593401],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0018320186,0.00009169343,0.00061818876,0.000041060855,0.00015982159,0.000006159612,0.00096227083,0.000003901645,0.00014511617,0.99417347,0.001826039,0.00014028834],"study_design_scores_gemma":[0.0010572677,0.0005186207,0.00026818644,0.00010626618,0.000046958856,0.00008896032,0.000498676,0.0000013840862,0.0025071667,0.9923807,0.0024214825,0.00010435243],"about_ca_topic_score_codex":6.538652e-7,"about_ca_topic_score_gemma":4.48725e-7,"teacher_disagreement_score":0.02086356,"about_ca_system_score_codex":0.00002418103,"about_ca_system_score_gemma":0.000057599078,"threshold_uncertainty_score":0.99965507},"labels":[],"label_agreement":null},{"id":"W2965650065","doi":"10.1007/jhep12(2019)105","title":"Compatible cycles and CHY integrals","year":2019,"lang":"en","type":"article","venue":"Journal of High Energy Physics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; Perimeter Institute","funders":"Institut Périmètre de physique théorique; Natural Sciences and Engineering Research Council of Canada; Government of Canada; Innovation, Science and Economic Development Canada; Alexander von Humboldt-Stiftung","keywords":"Upper and lower bounds; Scalar (mathematics); Computation; Hamiltonian path; Cycle basis; Hamiltonian (control theory); Graph","score_opus":0.017280333629263664,"score_gpt":0.26130430454415976,"score_spread":0.24402397091489608,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2965650065","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9921985,0.00019371229,0.004689096,0.000061978,0.00047392803,0.000022249635,0.0000027624615,0.000009659589,0.0023480607],"genre_scores_gemma":[0.99453855,0.00009352806,0.004640663,0.00013235665,0.00030613545,3.385624e-7,6.2737536e-7,0.00001694807,0.00027084808],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992742,0.000047742764,0.0002805681,0.00007596789,0.00020345539,0.00011807152],"domain_scores_gemma":[0.999126,0.00022875288,0.00032062794,0.00016382801,0.00010339279,0.00005739109],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001486254,0.000113104456,0.00032673663,0.00005178816,0.000057643545,0.000025106063,0.00015951827,0.000047472146,0.000038379007],"category_scores_gemma":[0.000024101762,0.00007555477,0.00010450069,0.000075702206,0.000052777035,0.00015382381,0.00006107892,0.00015351488,0.0000012277142],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002734527,0.000038684295,0.0007159994,0.000024281988,0.00008124751,0.000004160571,0.0002450083,0.000035529196,0.00022730841,0.9939367,0.0010096151,0.0036541224],"study_design_scores_gemma":[0.0004091414,0.000121509045,0.0009069492,0.000059027116,0.000036587393,0.00003748381,0.00008157388,0.00004373192,0.0053248666,0.9917449,0.0011382322,0.000096004194],"about_ca_topic_score_codex":0.000011997934,"about_ca_topic_score_gemma":0.0000018120961,"teacher_disagreement_score":0.0050975583,"about_ca_system_score_codex":0.000013583585,"about_ca_system_score_gemma":0.000016846949,"threshold_uncertainty_score":0.30810344},"labels":[],"label_agreement":null},{"id":"W2965929356","doi":"10.1007/s00222-022-01177-y","title":"Equal sums in random sets and the concentration of divisors","year":2023,"lang":"lv","type":"article","venue":"Inventiones mathematicae","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"Natural Sciences and Engineering Research Council of Canada; University of Oxford; National Science Foundation","keywords":"Algorithm; Computer science","score_opus":0.03889709519081617,"score_gpt":0.3036661860775036,"score_spread":0.26476909088668743,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2965929356","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99111,0.0008045589,0.001176585,0.0007533311,0.0005200649,0.001361342,0.000041908123,0.000075381686,0.004156814],"genre_scores_gemma":[0.99831736,0.0005158424,0.00045598455,0.00004570721,0.000054392764,0.00006902851,0.000014773102,0.00003645487,0.00049046404],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997021,0.00062546984,0.0012167001,0.00028136742,0.0004857549,0.0003697103],"domain_scores_gemma":[0.99560124,0.0031837588,0.00054967945,0.00051277585,0.000086934095,0.00006562274],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032632481,0.00027690214,0.00078701763,0.00018002979,0.00024757022,0.000069160975,0.00030114042,0.00017951832,0.00018354054],"category_scores_gemma":[0.0014935881,0.00018157421,0.00026247423,0.0006324589,0.0009796662,0.00014685949,0.0002641619,0.00024515897,0.000042346022],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025426416,0.00011995136,0.0007082951,0.001687809,0.00015054783,0.0000068579884,0.02127629,0.000019525023,0.000072840114,0.97457117,0.0004253916,0.00070705253],"study_design_scores_gemma":[0.0066517997,0.000040418818,0.0014309498,0.00076376915,0.00019031859,0.000012846004,0.0032147407,0.012602932,0.00027419618,0.9745678,0.000054803284,0.00019543259],"about_ca_topic_score_codex":0.000023121194,"about_ca_topic_score_gemma":0.000025985702,"teacher_disagreement_score":0.018061548,"about_ca_system_score_codex":0.000021864113,"about_ca_system_score_gemma":0.000041048665,"threshold_uncertainty_score":0.7404381},"labels":[],"label_agreement":null},{"id":"W2971004196","doi":"10.1137/19m1284610","title":"On the Minimum Degree Required for a Triangle Decomposition","year":2020,"lang":"en","type":"preprint","venue":"SIAM Journal on Discrete Mathematics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Australian Research Council; Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Degree (music); Graph; Decomposition; Order (exchange); Discrete mathematics; Physics; Chemistry","score_opus":0.12089391020838085,"score_gpt":0.3605353410943551,"score_spread":0.23964143088597423,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2971004196","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44134575,0.00091326045,0.41165158,0.04204269,0.01141502,0.013151636,0.0017745025,0.00081898214,0.07688657],"genre_scores_gemma":[0.85697466,0.00019513976,0.13517937,0.0027730113,0.0028142526,0.0003850012,0.00007497871,0.0004782829,0.0011253003],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99623805,0.00037205603,0.0014167037,0.0005090155,0.000921485,0.0005427046],"domain_scores_gemma":[0.9912437,0.005338589,0.0017306067,0.0011978764,0.00022112069,0.0002680857],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0019407625,0.00074027444,0.0011871574,0.00022047888,0.0008762958,0.00042894934,0.0013662613,0.00048392717,0.00019472242],"category_scores_gemma":[0.003717521,0.00043129415,0.0013273595,0.00014802744,0.00016469996,0.00007155024,0.00051236834,0.0018610483,0.00002650375],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004766767,0.0002062761,6.762289e-7,0.0009685128,0.0005735515,0.000038555812,0.0037099337,0.00006557988,0.00013910087,0.96105367,0.03210003,0.0006674171],"study_design_scores_gemma":[0.0010556203,0.0006580642,0.0000049772766,0.0017512714,0.000435343,0.0001071362,0.0005866853,0.004078549,0.00063928653,0.989382,0.0007893096,0.0005117386],"about_ca_topic_score_codex":3.8320584e-7,"about_ca_topic_score_gemma":0.0000012523939,"teacher_disagreement_score":0.4156289,"about_ca_system_score_codex":0.00017927939,"about_ca_system_score_gemma":0.0001387028,"threshold_uncertainty_score":0.9998139},"labels":[],"label_agreement":null},{"id":"W2971094089","doi":"10.48550/arxiv.1702.04799","title":"A result in asymmetric Euclidean Ramsey theory","year":2017,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Euclidean distance; Mathematics; Euclidean geometry; Combinatorics; Euclidean space; Euclidean distance matrix; Space (punctuation); Unit (ring theory); Geometry; Computer science","score_opus":0.1315214729034363,"score_gpt":0.24159599782116742,"score_spread":0.11007452491773112,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2971094089","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.87378895,0.00021095898,0.006357189,0.000045095447,0.0012469633,0.0006405197,0.00007606,0.00021200576,0.117422245],"genre_scores_gemma":[0.9918746,0.00029902486,0.00057968666,0.000060027865,0.00015652057,0.0000013870649,0.00001417792,0.000059293223,0.0069553154],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99740964,0.00052322436,0.00038251173,0.0010456122,0.00013491468,0.00050411955],"domain_scores_gemma":[0.9956897,0.0009903748,0.0006170244,0.0024094328,0.00013039706,0.000163098],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0015180774,0.00047644845,0.00069314317,0.0008777882,0.00038876364,0.00009901455,0.0019409398,0.0007086022,0.00009635389],"category_scores_gemma":[0.0016047148,0.0004790388,0.00039663774,0.0004323781,0.00035086405,0.00015989336,0.0023044574,0.0014017228,0.000031089807],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022701797,0.00009683025,0.0034923966,0.00019209238,0.00014881701,0.0005672022,0.00059971627,0.0010482495,0.0000022343877,0.99178666,0.00062771613,0.0012110538],"study_design_scores_gemma":[0.0009309504,0.000031487827,0.002910879,0.0002381951,0.00015752112,0.0000054938955,0.00021150465,0.0017644074,0.00003413055,0.99255276,0.0006215409,0.0005411311],"about_ca_topic_score_codex":0.00012218114,"about_ca_topic_score_gemma":0.00010579967,"teacher_disagreement_score":0.1180856,"about_ca_system_score_codex":0.00022371525,"about_ca_system_score_gemma":0.00013088384,"threshold_uncertainty_score":0.9997661},"labels":[],"label_agreement":null},{"id":"W2971427563","doi":"10.1016/j.jnt.2019.07.026","title":"Sums of sets of abelian group elements","year":2019,"lang":"en","type":"article","venue":"Journal of Number Theory","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University","funders":"National Natural Science Foundation of China","keywords":"Mathematics; Abelian group; Integer (computer science); Group (periodic table); Combinatorics; Zero (linguistics); Discrete mathematics; Computer science; Physics","score_opus":0.017190600631738315,"score_gpt":0.306476451001476,"score_spread":0.2892858503697377,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2971427563","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98275256,0.000103938626,0.00016708454,0.000016774165,0.0005888761,0.00010120129,0.00004037396,0.0000050708936,0.016224103],"genre_scores_gemma":[0.99279237,0.00003130699,0.0064553623,0.00005917039,0.000076204844,5.1824173e-7,0.0000013466372,0.000023260855,0.00056046795],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99825823,0.00021264478,0.00086846447,0.000083593666,0.00041282095,0.00016424626],"domain_scores_gemma":[0.9975287,0.0007039321,0.0011837484,0.0003201308,0.00019893832,0.00006454914],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0016416509,0.00012888227,0.00047017893,0.00011131415,0.000029719427,0.0000057150814,0.0003641275,0.00008751122,0.0041009937],"category_scores_gemma":[0.00024345107,0.00009015758,0.0002769597,0.000115246796,0.00010253459,0.00012434623,0.00008398493,0.00022057616,0.000011034481],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00046586886,0.00022401384,0.02919154,0.00039563724,0.00055242656,0.000013865805,0.002095808,0.000002290668,0.0057168114,0.9512444,0.0057738726,0.0043234224],"study_design_scores_gemma":[0.0009301203,0.00019557585,0.0034678457,0.00025696505,0.00009397858,0.000090011206,0.000576082,0.0000044558938,0.0036204767,0.9886744,0.0019835348,0.00010652716],"about_ca_topic_score_codex":0.0000013051899,"about_ca_topic_score_gemma":7.1862604e-7,"teacher_disagreement_score":0.037429985,"about_ca_system_score_codex":0.000019968673,"about_ca_system_score_gemma":0.000028081422,"threshold_uncertainty_score":0.99680936},"labels":[],"label_agreement":null},{"id":"W2971858457","doi":"10.1007/s00373-022-02460-8","title":"Meyniel Extremal Families of Abelian Cayley Graphs","year":2022,"lang":"en","type":"article","venue":"Graphs and Combinatorics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Cayley graph; Mathematics; Abelian group; Cayley's theorem; Conjecture; Multiplicative function; Bounded function; Discrete mathematics; Vertex-transitive graph; Upper and lower bounds; Graph; Graph power; Voltage graph; Line graph","score_opus":0.021568265017199655,"score_gpt":0.2512202940871714,"score_spread":0.22965202906997173,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2971858457","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99070007,0.0014307081,0.000028692253,0.000046464113,0.0007902682,0.00018086415,0.000047801685,0.00007735519,0.0066977935],"genre_scores_gemma":[0.9988637,0.0003388934,0.00031188957,0.00007780719,0.000007287492,0.000031897394,0.000004903681,0.000026950012,0.00033668333],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99858093,0.00011463345,0.00034898173,0.0002674783,0.00041807792,0.00026988628],"domain_scores_gemma":[0.9990127,0.00022533919,0.00017725643,0.0004220196,0.00007403453,0.00008863358],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041257747,0.00020092582,0.00034903162,0.00029480804,0.000641822,0.000016904838,0.00031949108,0.000068860616,0.00008776183],"category_scores_gemma":[0.000056387013,0.00017919946,0.00016913713,0.0006588143,0.00019115342,0.000059046157,0.00037415128,0.00028794896,2.5428477e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027313681,0.00013706679,0.009728352,0.00008906986,0.00006419109,0.000009280007,0.0016345239,0.0000015674196,0.000116553056,0.9855244,0.0015025319,0.0011651103],"study_design_scores_gemma":[0.0005876539,0.00021973766,0.002571587,0.000009336184,0.00005780581,0.000023094006,0.0017632897,0.000029472538,0.00025753304,0.99143636,0.0028285389,0.00021558194],"about_ca_topic_score_codex":0.000044998713,"about_ca_topic_score_gemma":0.000004460063,"teacher_disagreement_score":0.008163636,"about_ca_system_score_codex":0.000016364198,"about_ca_system_score_gemma":0.00002318114,"threshold_uncertainty_score":0.7307542},"labels":[],"label_agreement":null},{"id":"W2972876943","doi":"10.1016/j.ejc.2021.103383","title":"Cops and robbers on directed and undirected abelian Cayley graphs","year":2021,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal; Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; Fonds de recherche du Québec – Nature et technologies; Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Cayley graph; Mathematics; Abelian group; Combinatorics; Cayley's theorem; Upper and lower bounds; Order (exchange); Undirected graph; Discrete mathematics; Strongly connected component; Graph; Line graph; Voltage graph","score_opus":0.020625254972703178,"score_gpt":0.2519415998974809,"score_spread":0.2313163449247777,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2972876943","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9811455,0.0014327626,0.0000691243,0.00019373963,0.0009313349,0.000051867548,0.0000034375148,0.000047838443,0.016124371],"genre_scores_gemma":[0.9974136,0.0007002686,0.0012564964,0.0001420417,0.000054345153,1.586459e-7,9.666346e-7,0.000042231146,0.0003898951],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983266,0.0006386061,0.0004184125,0.00015889827,0.00027891027,0.00017857994],"domain_scores_gemma":[0.9985423,0.00042581532,0.00031510624,0.00021910548,0.00030681663,0.00019083387],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00077600323,0.00017475915,0.00032079036,0.00016160528,0.00020426053,0.000070014925,0.00015352409,0.00003728121,0.00002174014],"category_scores_gemma":[0.0007229049,0.00014003034,0.000081954226,0.00032597044,0.00010585093,0.000076997094,0.000102328486,0.0003925601,0.000001196629],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000115417504,0.00020587977,0.005443567,0.00009361052,0.0002941619,0.0016576615,0.0020936423,0.0000025657625,0.00070706144,0.9771923,0.0071920757,0.005002052],"study_design_scores_gemma":[0.0031946932,0.000735241,0.043903388,0.0003552636,0.00021996771,0.0011735216,0.0004075262,0.000026166594,0.001785651,0.93463624,0.01312439,0.00043796556],"about_ca_topic_score_codex":4.797611e-7,"about_ca_topic_score_gemma":7.986968e-7,"teacher_disagreement_score":0.042556077,"about_ca_system_score_codex":0.000022812017,"about_ca_system_score_gemma":0.000031639953,"threshold_uncertainty_score":0.5710272},"labels":[],"label_agreement":null},{"id":"W2975384298","doi":"10.1561/9781680835939","title":"Higher-order Fourier Analysis and Applications","year":2019,"lang":"en","type":"book","venue":"now publishers, Inc. eBooks","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Fourier analysis; Generalization; Fourier transform; Fourier series; Order (exchange); Mathematics; Field (mathematics); Fourier inversion theorem; Algebraic number; Algebra over a field; Calculus (dental); Computer science; Pure mathematics; Mathematical analysis; Short-time Fourier transform","score_opus":0.018874744543434973,"score_gpt":0.26067925530547326,"score_spread":0.2418045107620383,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2975384298","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00010698222,0.0003430823,0.001648113,0.00010693944,0.0005844518,0.0010164233,0.0001934866,0.00022130563,0.9957792],"genre_scores_gemma":[0.00056468527,0.000014398415,0.006965443,0.0005589146,0.00097004086,0.00018872497,0.00035634422,0.00015910961,0.99022233],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9972328,0.00009873792,0.0006579309,0.0008760971,0.00065030105,0.00048416408],"domain_scores_gemma":[0.9963424,0.0006052642,0.00055221765,0.001846689,0.0004201945,0.00023318556],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0005505029,0.00062946323,0.0010611155,0.0008513877,0.0003623618,0.00068705354,0.0008154497,0.0010485592,0.0012193585],"category_scores_gemma":[0.00007663936,0.0005436483,0.00040520518,0.0002466726,0.00041860077,0.000283813,0.0005316816,0.0009527765,0.000045872534],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013769507,0.000020151248,0.00013879145,0.00025718383,0.0022443219,0.000004216347,0.00023532777,6.546436e-7,0.0000014314165,0.6511501,0.336122,0.0098120645],"study_design_scores_gemma":[0.00021769427,0.000016981558,0.000055023538,0.000019798774,0.0014442826,0.0000030027397,0.000015879057,0.000011379826,0.0000025907875,0.42717004,0.570657,0.00038631394],"about_ca_topic_score_codex":0.000015633179,"about_ca_topic_score_gemma":0.00008405377,"teacher_disagreement_score":0.23453502,"about_ca_system_score_codex":0.00014738194,"about_ca_system_score_gemma":0.00030865573,"threshold_uncertainty_score":0.9997015},"labels":[],"label_agreement":null},{"id":"W2979430184","doi":"10.1017/s096354831900018x","title":"Long Monotone Trails in Random Edge-Labellings of Random Graphs","year":2019,"lang":"en","type":"article","venue":"Combinatorics Probability Computing","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Combinatorics; Bijection; Mathematics; Random graph; Monotone polygon; Path (computing); Enhanced Data Rates for GSM Evolution; Discrete mathematics; Graph; Computer science; Geometry","score_opus":0.023265063278616504,"score_gpt":0.27092241780898535,"score_spread":0.24765735453036886,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2979430184","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98962796,0.00030408226,0.0053736814,0.000036789126,0.0010489785,0.0015783433,0.0000029496164,0.00010996138,0.0019172432],"genre_scores_gemma":[0.99722654,0.00001350798,0.0026075444,0.000022464903,0.000027066599,0.000009723456,0.0000029875139,0.00003802304,0.000052125666],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9969066,0.0004110103,0.0011743848,0.00056289724,0.00043708325,0.0005080497],"domain_scores_gemma":[0.99611264,0.0022248474,0.00046651956,0.00084249215,0.00025606173,0.0000974185],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0033544153,0.0003303963,0.0010388934,0.00024565743,0.00015146413,0.00003161902,0.000591471,0.00022565546,0.000031868647],"category_scores_gemma":[0.00090826926,0.00029861258,0.00030140433,0.000814731,0.00019949487,0.00012953897,0.00031619624,0.0005378261,0.0000038111618],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035141397,0.00055347045,0.13164099,0.0011455823,0.00006910148,0.000005134924,0.0045867707,0.00038820776,0.00019101289,0.8588769,0.000024465691,0.0021669643],"study_design_scores_gemma":[0.008917687,0.00012867042,0.0059308684,0.00021467218,0.000033442633,0.0000054179495,0.00007770334,0.004758343,0.0014574808,0.978162,0.000022383094,0.0002913331],"about_ca_topic_score_codex":0.000021675389,"about_ca_topic_score_gemma":0.000006600791,"teacher_disagreement_score":0.12571011,"about_ca_system_score_codex":0.00010750057,"about_ca_system_score_gemma":0.00007260559,"threshold_uncertainty_score":0.9999466},"labels":[],"label_agreement":null},{"id":"W2979458541","doi":"10.1016/j.disc.2020.111886","title":"Set systems related to a house allocation problem","year":2020,"lang":"en","type":"preprint","venue":"Discrete Mathematics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"National Research, Development and Innovation Office; Nemzeti Kutatási Fejlesztési és Innovációs Hivatal; Institute for Basic Science; Mount Allison University; Magyar Tudományos Akadémia; Korea Basic Science Institute","keywords":"Injective function; Cardinality (data modeling); Preference; Set (abstract data type); Combinatorics; Pareto principle; Mathematics; Mathematical economics; Revealed preference; Discrete mathematics; Computer science; Mathematical optimization; Statistics; Econometrics","score_opus":0.05044665340150343,"score_gpt":0.3165084038017139,"score_spread":0.26606175040021046,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2979458541","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6947565,0.0012916189,0.19283769,0.0060164,0.007024174,0.022621596,0.0017528145,0.008542916,0.06515628],"genre_scores_gemma":[0.8806722,0.00005186367,0.11601232,0.00020396922,0.00026981428,0.0005721149,0.00013694879,0.00048844295,0.0015923065],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9962822,0.00020616369,0.0014233455,0.0008105778,0.0007760379,0.0005016475],"domain_scores_gemma":[0.99648476,0.0004418088,0.00083837676,0.0017142716,0.00021757474,0.0003032326],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00083281455,0.0007367013,0.0011891562,0.0002192977,0.00023225485,0.0002846498,0.0010918679,0.00067137205,0.00004373813],"category_scores_gemma":[0.00082834304,0.0006071219,0.0003700539,0.00033253056,0.00009332951,0.00007304788,0.0017683738,0.0010227604,0.00014380694],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019209438,0.000055105877,0.000012426657,0.00641909,0.00042743562,0.00002213802,0.04463686,0.0008356761,0.00013434436,0.9382973,0.0090636145,0.00007680221],"study_design_scores_gemma":[0.00025778677,0.00007363138,0.000006386116,0.001390185,0.00035029452,0.00003087394,0.002138955,0.010610177,0.00017422065,0.9833542,0.0008403541,0.00077294593],"about_ca_topic_score_codex":0.00001760271,"about_ca_topic_score_gemma":0.000004099537,"teacher_disagreement_score":0.18591571,"about_ca_system_score_codex":0.00013558958,"about_ca_system_score_gemma":0.00010460421,"threshold_uncertainty_score":0.999638},"labels":[],"label_agreement":null},{"id":"W2981411081","doi":"10.1093/imrn/rnab021","title":"The Typical Structure of Sets With Small Sumset","year":2021,"lang":"en","type":"preprint","venue":"International Mathematics Research Notices","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Lambda; Omega; Bounded function; Mathematics; Combinatorics; Discrete mathematics; Physics; Mathematical analysis; Quantum mechanics","score_opus":0.15676863642345537,"score_gpt":0.4255697280706156,"score_spread":0.26880109164716026,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2981411081","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9892596,0.0004178395,0.0012661719,0.0009490391,0.0010398952,0.0007046086,0.0002792778,0.00004745469,0.006036116],"genre_scores_gemma":[0.9241713,0.000144857,0.074661255,0.000019356507,0.00024825588,0.00003540246,0.000059758073,0.00006747334,0.00059229764],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99560964,0.0004144218,0.0007815137,0.00048808797,0.002230188,0.00047613092],"domain_scores_gemma":[0.9894622,0.0066356207,0.00056328723,0.0012409856,0.0019827038,0.00011518117],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017200711,0.00034460318,0.00054148986,0.0002660536,0.00040760258,0.00049550494,0.002403298,0.000359882,0.00029855742],"category_scores_gemma":[0.0037674292,0.00019679496,0.00020845767,0.00020953338,0.00086185336,0.00007856982,0.0026767892,0.001868857,0.0000031366042],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028438555,0.0003439287,0.00038175768,0.0023174097,0.0016143596,0.000071415685,0.006674039,0.0003267939,0.00041396252,0.98453987,0.0013762142,0.0016558853],"study_design_scores_gemma":[0.00029049907,0.00007411039,0.00040358165,0.0010664824,0.000078780926,0.00003368667,0.002340274,0.0027589567,0.0027033724,0.98901224,0.00096934586,0.00026864812],"about_ca_topic_score_codex":0.00003150883,"about_ca_topic_score_gemma":0.0004860287,"teacher_disagreement_score":0.07339509,"about_ca_system_score_codex":0.00010704243,"about_ca_system_score_gemma":0.0003266929,"threshold_uncertainty_score":0.8119358},"labels":[],"label_agreement":null},{"id":"W2982140946","doi":"10.1016/j.dam.2019.10.007","title":"The Brown–Erdős–Sós conjecture in finite abelian groups","year":2019,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"European Research Council","keywords":"Mathematics; Combinatorics; Conjecture; Hypergraph; Abelian group; Integer (computer science); Discrete mathematics","score_opus":0.012937321587488256,"score_gpt":0.2558354507947821,"score_spread":0.24289812920729384,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2982140946","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.85730004,0.00031948715,0.005276122,0.00066563976,0.0008158239,0.0025880185,0.000048861115,0.0003299403,0.13265605],"genre_scores_gemma":[0.97938156,0.0000649635,0.018595673,0.00032485637,0.00012055922,0.0001047443,0.000013078853,0.00011149936,0.0012830655],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976699,0.000048943537,0.0007402988,0.00040211846,0.00049448723,0.0006442599],"domain_scores_gemma":[0.9959613,0.0023097596,0.00031729077,0.0012701871,0.000038788563,0.000102648635],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008668833,0.0004191529,0.00056816277,0.00011989441,0.0003388325,0.00011816813,0.0007948112,0.0002474077,0.000199605],"category_scores_gemma":[0.0002440667,0.0002565727,0.00018371546,0.00036817614,0.0002077624,0.000077774406,0.00029689187,0.000554136,0.00014625679],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003181731,0.000053232667,0.00017978302,0.00030027577,0.00006167014,0.0000049128935,0.006284919,0.000034269277,0.00047265712,0.9911907,0.0006221738,0.000763589],"study_design_scores_gemma":[0.0008432087,0.000040957744,0.0002221229,0.0000988319,0.00004525089,0.000011097183,0.002129109,0.0011565153,0.00065480085,0.98913336,0.0052524838,0.00041226143],"about_ca_topic_score_codex":0.000003734321,"about_ca_topic_score_gemma":0.000025346379,"teacher_disagreement_score":0.13137299,"about_ca_system_score_codex":0.00005356634,"about_ca_system_score_gemma":0.00003314858,"threshold_uncertainty_score":0.9999887},"labels":[],"label_agreement":null},{"id":"W2983733250","doi":"10.48550/arxiv.1911.01491","title":"Halfway to Hadwiger's Conjecture","year":2019,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Combinatorics; Conjecture; Minor (academic); Graph; Mathematics; Graph minor; Discrete mathematics; Graph power; Line graph; Humanities; Philosophy","score_opus":0.09584895586272518,"score_gpt":0.21598200704220932,"score_spread":0.12013305117948414,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2983733250","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9271905,0.000064954496,0.03829733,0.00013854387,0.0023039582,0.00091263,0.00011387646,0.00030430112,0.030673949],"genre_scores_gemma":[0.98680264,0.00003718577,0.0011342961,0.0003495281,0.00020965416,0.000001137018,0.000016383592,0.000066477296,0.0113827055],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980067,0.000155239,0.00024525807,0.0010246544,0.00012075718,0.00044738015],"domain_scores_gemma":[0.99734664,0.0003363034,0.00023804046,0.0017121845,0.00013294144,0.00023388624],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002739951,0.0004849836,0.00062120694,0.00030711017,0.00020931725,0.000059916565,0.0011879188,0.0006361002,0.00042734307],"category_scores_gemma":[0.00015774678,0.0004739751,0.00039896648,0.00030328328,0.000117782656,0.000077516306,0.0019853862,0.00092406163,0.0001825971],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008730778,0.000050272072,0.0015468269,0.00026006225,0.0002564981,0.00018116501,0.00080044544,0.026959432,0.000018705536,0.9623488,0.0073546977,0.00013576508],"study_design_scores_gemma":[0.00045378614,0.00006774463,0.0004202389,0.00016682367,0.00021788287,0.000007963817,0.0001643511,0.0023078648,0.00018725487,0.98841745,0.0068755373,0.0007130844],"about_ca_topic_score_codex":0.00004638949,"about_ca_topic_score_gemma":0.000034026245,"teacher_disagreement_score":0.059612174,"about_ca_system_score_codex":0.00016437045,"about_ca_system_score_gemma":0.00011348459,"threshold_uncertainty_score":0.9997712},"labels":[],"label_agreement":null},{"id":"W2992786313","doi":"10.1016/j.jctb.2019.11.004","title":"Stability and exact Turán numbers for matroids","year":2019,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Bounding overwatch; Mathematics; Term (time); Combinatorics; Matroid; Upper and lower bounds; Type (biology); Class (philosophy); Stability (learning theory); Set (abstract data type); Discrete mathematics; Mathematical analysis; Physics; Computer science; Quantum mechanics","score_opus":0.016346597040299046,"score_gpt":0.274427257906122,"score_spread":0.25808066086582293,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2992786313","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9887809,0.000176466,0.00033435712,0.0000932783,0.007067201,0.00030901394,0.000011544523,0.000018946079,0.0032082484],"genre_scores_gemma":[0.99678814,0.000029494442,0.002311449,0.000038856313,0.0005152861,0.000002855401,5.359665e-7,0.000027452561,0.00028594967],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986391,0.00023110023,0.00052190066,0.00013296725,0.00026511616,0.00020982223],"domain_scores_gemma":[0.9974144,0.0015012916,0.0004400784,0.00028186291,0.0002587498,0.00010360195],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002377341,0.00017410926,0.00048614963,0.00006476474,0.00014105607,0.000052603074,0.00025617855,0.00012856025,0.00030503428],"category_scores_gemma":[0.00071794516,0.00012675904,0.00021775183,0.000070893155,0.00017414556,0.0003710692,0.000083332874,0.00025865546,9.4492805e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0023073647,0.000056033452,0.0011153844,0.00014609228,0.000116525705,0.0000026116386,0.0010905657,3.5672977e-7,0.0007211268,0.99366075,0.00047550662,0.0003077038],"study_design_scores_gemma":[0.001782668,0.0007708053,0.00020139982,0.000038709935,0.00007085567,0.00008592659,0.0010600103,0.0000016666936,0.0034295407,0.98582864,0.0065804557,0.0001493026],"about_ca_topic_score_codex":4.6009325e-7,"about_ca_topic_score_gemma":2.9979117e-7,"teacher_disagreement_score":0.008007176,"about_ca_system_score_codex":0.00004349696,"about_ca_system_score_gemma":0.000053709457,"threshold_uncertainty_score":0.51690835},"labels":[],"label_agreement":null},{"id":"W2995958961","doi":"10.1002/jgt.22662","title":"Meyniel's conjecture on graphs of bounded degree","year":2021,"lang":"en","type":"preprint","venue":"Journal of Graph Theory","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Conjecture; Bounded function; Mathematics; Combinatorics; Degree (music); Discrete mathematics; Physics; Mathematical analysis","score_opus":0.06019598629361019,"score_gpt":0.3168677870757978,"score_spread":0.25667180078218765,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2995958961","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97809273,0.00496864,0.002569794,0.00015090816,0.004338108,0.0003428432,0.0000662562,0.00003904877,0.009431663],"genre_scores_gemma":[0.99027115,0.00080776017,0.008009925,0.0002705475,0.00036307028,0.000005142647,0.0000068999643,0.000095201794,0.00017027771],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.995331,0.0011301929,0.0016985873,0.0004021153,0.0010463911,0.00039172423],"domain_scores_gemma":[0.99261504,0.002123109,0.0030526605,0.0012567738,0.0007478959,0.00020452593],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0032445835,0.0006289076,0.0017476091,0.0010415623,0.00019763828,0.00009388489,0.0012995433,0.0008355968,0.00040374266],"category_scores_gemma":[0.0013554718,0.00045380916,0.0021557596,0.00035943318,0.00059300236,0.000102112695,0.00057193724,0.002674364,6.661973e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007806549,0.00030109606,0.00021750419,0.00074493006,0.0019837543,0.00023693238,0.0029630314,0.000059452923,0.00037524037,0.98771036,0.001670491,0.0029565308],"study_design_scores_gemma":[0.00090782373,0.00039776976,0.0006287558,0.0014500241,0.00069234346,0.00029997458,0.00093057,0.000002216749,0.0045719943,0.98946494,0.00024149579,0.00041209752],"about_ca_topic_score_codex":0.000003862426,"about_ca_topic_score_gemma":0.000007521727,"teacher_disagreement_score":0.012178437,"about_ca_system_score_codex":0.00006354475,"about_ca_system_score_gemma":0.0003251635,"threshold_uncertainty_score":0.9997914},"labels":[],"label_agreement":null},{"id":"W2999629773","doi":"10.37236/8787","title":"A Note on Hedetniemi's Conjecture, Stahl's Conjecture and the Poljak-Rödl Function","year":2019,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Royal Military College of Canada","funders":"Higher Education Discipline Innovation Project; Ministry of Education of the People's Republic of China","keywords":"Conjecture; Mathematics; Combinatorics; Function (biology)","score_opus":0.006156846074635527,"score_gpt":0.24260107635663378,"score_spread":0.23644423028199826,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2999629773","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98060155,0.00574461,0.0028326234,0.003195965,0.0021328866,0.00063100545,0.0000034454938,0.000034946555,0.0048229643],"genre_scores_gemma":[0.99789876,0.00058874086,0.000009331944,0.00068148604,0.00022189428,0.0000027004148,5.226986e-7,0.00003689037,0.00055969297],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99785167,0.00044402253,0.00047307802,0.00015769874,0.00056759163,0.00050594495],"domain_scores_gemma":[0.99663866,0.0019998013,0.0006342645,0.0005040968,0.0001559108,0.00006727394],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023156307,0.0002664661,0.00049780536,0.00010492406,0.00035623348,0.00006901771,0.00054523075,0.00015553512,0.000044762714],"category_scores_gemma":[0.00032434514,0.000121381745,0.00023033253,0.00026171605,0.00023296678,0.00009310137,0.000093291834,0.0015959598,0.0000046398122],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00094544794,0.00004192568,0.00008045616,0.000026281841,0.00021893617,0.0000029413923,0.0009540403,0.000024079367,0.00004783186,0.99616164,0.00088918273,0.00060726627],"study_design_scores_gemma":[0.003897573,0.0012055502,0.00015785135,0.000042847907,0.00022468797,0.00033430595,0.00020760427,0.00006159364,0.0002947889,0.9860133,0.00740635,0.00015357236],"about_ca_topic_score_codex":0.0000048101992,"about_ca_topic_score_gemma":0.0000044479702,"teacher_disagreement_score":0.017297188,"about_ca_system_score_codex":0.0001644078,"about_ca_system_score_gemma":0.000196355,"threshold_uncertainty_score":0.693374},"labels":[],"label_agreement":null},{"id":"W3000458209","doi":"10.4153/s0008439521000254","title":"Log-concavity and log-convexity of moments of averages of i.i.d. random variables","year":2021,"lang":"en","type":"preprint","venue":"Canadian Mathematical Bulletin","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Carnegie Mellon University; Simons Foundation","keywords":"Sequence (biology); Mathematics; Convexity; Combinatorics; Order (exchange); Logarithmically convex function; Conjecture; Moment (physics); Regular polygon; Random variable; Integer (computer science); Statistics; Convex optimization; Convex set; Physics; Computer science; Geometry","score_opus":0.02457038436184648,"score_gpt":0.2624130755961095,"score_spread":0.23784269123426302,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3000458209","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98552394,0.00063174823,0.0024921503,0.00034678326,0.00025174266,0.00079982175,0.00049280695,0.00001982828,0.009441195],"genre_scores_gemma":[0.9853336,0.0000964811,0.013959584,0.00007749148,0.000039506773,0.000024207817,0.000022027938,0.000044636294,0.00040245743],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99722826,0.00031392777,0.0012218268,0.0004470563,0.0003977737,0.00039115772],"domain_scores_gemma":[0.99590755,0.0017240944,0.00071198225,0.00096306636,0.00031892819,0.0003743566],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0011346383,0.00039554574,0.0017398578,0.0002459824,0.000077547804,0.000026270587,0.00050831854,0.0005821528,0.005884812],"category_scores_gemma":[0.0027148419,0.00034729912,0.0003222322,0.00011492822,0.0007663813,0.00001947767,0.0005817015,0.0005239943,0.000005811455],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018491466,0.00044666842,0.0020730905,0.027619136,0.0013881312,0.00008531574,0.0065786866,0.00003775583,0.0006355496,0.9542742,0.005809746,0.0008668435],"study_design_scores_gemma":[0.0011272546,0.00005119922,0.0004919272,0.0014475221,0.00033767917,0.000020972864,0.0003960804,0.00014346871,0.0040805554,0.9911187,0.00042737013,0.00035724507],"about_ca_topic_score_codex":0.0017495219,"about_ca_topic_score_gemma":0.0004354563,"teacher_disagreement_score":0.036844566,"about_ca_system_score_codex":0.00007097298,"about_ca_system_score_gemma":0.00039100004,"threshold_uncertainty_score":0.9998979},"labels":[],"label_agreement":null},{"id":"W3000656034","doi":"10.37236/8251","title":"Uniform Generation of Spanning Regular Subgraphs of a Dense Graph","year":2019,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Australian Research Council; Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Degree (music); Graph; Discrete mathematics; Distribution (mathematics)","score_opus":0.02018908723099646,"score_gpt":0.25973158636619137,"score_spread":0.2395424991351949,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3000656034","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9927351,0.0028908704,0.0031631116,0.000060689556,0.0004465828,0.00014363736,8.934572e-7,0.000006021514,0.0005530838],"genre_scores_gemma":[0.99907863,0.0005702092,0.00013868642,0.000014836887,0.000054260447,6.1238495e-7,4.1260776e-7,0.000020434187,0.00012188749],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99826676,0.00015832922,0.0006959303,0.00008058172,0.00049463724,0.00030376855],"domain_scores_gemma":[0.99769974,0.00029880585,0.0011326484,0.0003993461,0.00043188903,0.000037558402],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019410145,0.00013830797,0.00043154735,0.00022114464,0.000085399144,0.000008794582,0.00046804806,0.00008848896,0.000018230296],"category_scores_gemma":[0.00016214662,0.00008839486,0.00027849196,0.00043974526,0.00009880817,0.00010787819,0.000052552165,0.00046490278,3.5746407e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008412957,0.000070619615,0.0008367376,0.00006408332,0.0001997174,0.0000013931187,0.0008829971,0.00007396445,0.0065838806,0.9909113,0.00013840554,0.00015279281],"study_design_scores_gemma":[0.0007696945,0.0006516956,0.00020858253,0.00006861804,0.00013683354,0.00009470994,0.0002399108,0.00012784003,0.02941887,0.96806353,0.00012997762,0.00008972543],"about_ca_topic_score_codex":0.0000032862326,"about_ca_topic_score_gemma":0.0000021155959,"teacher_disagreement_score":0.022847738,"about_ca_system_score_codex":0.00007255201,"about_ca_system_score_gemma":0.00017927439,"threshold_uncertainty_score":0.36046377},"labels":[],"label_agreement":null},{"id":"W3000691650","doi":"10.37236/765","title":"Induced Trees in Triangle-Free Graphs","year":2008,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Combinatorics; Mathematics; Upper and lower bounds; Graph; Constant (computer programming); Discrete mathematics; Computer science","score_opus":0.03444147800655427,"score_gpt":0.27377389937797797,"score_spread":0.2393324213714237,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3000691650","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99485683,0.002036881,0.00023940924,0.00041828968,0.000531036,0.00012869669,5.610479e-7,0.000015496058,0.0017727952],"genre_scores_gemma":[0.99874204,0.00087324675,0.000029121638,0.000061947394,0.000085948624,0.000002212625,1.3339947e-7,0.00002491858,0.00018045174],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99799407,0.0002884718,0.0006284396,0.000096897784,0.00047871,0.0005134451],"domain_scores_gemma":[0.9980728,0.0007491519,0.00047927778,0.00049691997,0.00014002669,0.000061806844],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017441025,0.00017401086,0.00044197458,0.00027081973,0.00023160539,0.00001226167,0.0010568107,0.000107112,0.000016328624],"category_scores_gemma":[0.00082053745,0.00010621951,0.00024330588,0.00061648554,0.000102553815,0.00012483477,0.00010037962,0.0011024192,8.814928e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012273509,0.00013349907,0.0006962824,0.0000054516254,0.000080974554,0.000039008257,0.0013765616,0.000003388613,0.00016008203,0.9963245,0.00083361065,0.0002238979],"study_design_scores_gemma":[0.0023568638,0.00048468277,0.0015736072,0.000023079076,0.000043848748,0.0005989355,0.00016197725,0.000006958708,0.00090469734,0.993211,0.0005105584,0.00012384224],"about_ca_topic_score_codex":0.000005940302,"about_ca_topic_score_gemma":0.000021773138,"teacher_disagreement_score":0.003885184,"about_ca_system_score_codex":0.00018757027,"about_ca_system_score_gemma":0.00028115395,"threshold_uncertainty_score":0.4789524},"labels":[],"label_agreement":null},{"id":"W3001610491","doi":"10.1007/s00493-020-4516-z","title":"On the Directions Determined by a Cartesian Product in an Affine Galois Plane","year":2021,"lang":"en","type":"preprint","venue":"COMBINATORICA","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Mathematics; Cartesian product; Combinatorics; Affine transformation; Upper and lower bounds; Clique; Graph; Product (mathematics); Discrete mathematics; Pure mathematics; Geometry","score_opus":0.02954398501120894,"score_gpt":0.28591201975071084,"score_spread":0.2563680347395019,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3001610491","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9881628,0.0007436907,0.00002218511,0.00079963804,0.0020667154,0.0007810757,0.000053714906,0.0001613533,0.0072088144],"genre_scores_gemma":[0.99839836,0.0000733714,0.00020996704,0.000113705944,0.000109411114,0.00019479958,0.00007037733,0.000057618206,0.0007723662],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99791515,0.00043679765,0.00038491486,0.00063891197,0.00030607134,0.0003181847],"domain_scores_gemma":[0.9973233,0.0007045999,0.00018974463,0.0015958848,0.00009527438,0.00009122741],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00043511976,0.00036743286,0.0005095074,0.00013945489,0.00026713687,0.0001223002,0.00066550716,0.00023587637,0.00016913256],"category_scores_gemma":[0.0007740442,0.0002619366,0.00014718044,0.00030229863,0.00008403882,0.000043720745,0.00047388702,0.0010613205,0.0000026282235],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000119258686,0.0023702162,0.001869421,0.0005916307,0.00027860238,0.00018879585,0.008787095,0.00001778345,0.0007416824,0.92073095,0.05795198,0.0063525587],"study_design_scores_gemma":[0.00043049542,0.00014532042,0.0012654231,0.00022548709,0.00007737227,0.000017269078,0.00019401468,0.00010222559,0.0020240026,0.9918126,0.003197579,0.00050823187],"about_ca_topic_score_codex":0.0000695219,"about_ca_topic_score_gemma":0.00009058201,"teacher_disagreement_score":0.0710816,"about_ca_system_score_codex":0.00015933586,"about_ca_system_score_gemma":0.000081378894,"threshold_uncertainty_score":0.9999833},"labels":[],"label_agreement":null},{"id":"W3001905662","doi":"10.7151/dmgt.2293","title":"A new framework to approach Vizing's conjecture","year":2020,"lang":"en","type":"article","venue":"Discussiones Mathematicae Graph Theory","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Saint Mary's University","funders":"","keywords":"Mathematics; Conjecture; Combinatorics; Discrete mathematics","score_opus":0.043397361792862126,"score_gpt":0.30206699216061644,"score_spread":0.2586696303677543,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3001905662","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027382549,0.00025650172,0.9445266,0.0043621296,0.00038808383,0.0012486473,0.000027673377,0.00077283336,0.021034941],"genre_scores_gemma":[0.55209,0.000011138247,0.44229648,0.003609832,0.00061858515,0.00009601172,0.0000087707995,0.00018385489,0.0010853615],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9967345,0.00037116118,0.00074450724,0.00080383813,0.00067429786,0.0006716682],"domain_scores_gemma":[0.99634176,0.0012936516,0.000251001,0.001120845,0.00004625581,0.0009464769],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00082132785,0.00062372454,0.0008960134,0.000222826,0.0005061082,0.00011715002,0.0010861772,0.00033966184,0.0010381739],"category_scores_gemma":[0.0025542649,0.0003685685,0.0005162054,0.0010130764,0.00017455724,0.00015337534,0.0005296527,0.00064759434,0.0001370948],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017533747,0.00010722334,0.000031565825,0.00033114356,0.0001581692,0.000010593917,0.030367991,0.000008226913,0.00018730579,0.95441926,0.009973247,0.00422993],"study_design_scores_gemma":[0.00039423432,0.00012500041,0.000043104203,0.00023789355,0.00015155307,0.000029682456,0.003356743,0.000063411884,0.00052557595,0.991985,0.0024817921,0.0006059731],"about_ca_topic_score_codex":0.0000010688798,"about_ca_topic_score_gemma":3.1036748e-7,"teacher_disagreement_score":0.52470744,"about_ca_system_score_codex":0.000020963551,"about_ca_system_score_gemma":0.0000546043,"threshold_uncertainty_score":0.9998766},"labels":[],"label_agreement":null},{"id":"W3002997249","doi":"10.1016/j.jctb.2020.01.002","title":"Maximum number of colourings: 4-chromatic graphs","year":2020,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; Javna Agencija za Raziskovalno Dejavnost RS","keywords":"Combinatorics; Conjecture; Chromatic scale; Mathematics; Graph; Discrete mathematics","score_opus":0.020092332676251042,"score_gpt":0.2785898590540383,"score_spread":0.2584975263777873,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3002997249","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98759764,0.00013526935,0.00029779036,0.0003210712,0.0038427182,0.00015322074,0.0000075684384,0.000033066382,0.007611673],"genre_scores_gemma":[0.9962007,0.000033695593,0.0030521767,0.00013015565,0.00048465029,0.0000015132695,3.4306325e-7,0.0000345042,0.00006228324],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978743,0.0003503883,0.0009479387,0.00011693489,0.00049886253,0.00021154345],"domain_scores_gemma":[0.9974589,0.00073310384,0.0010503783,0.00024178838,0.00033894315,0.00017689756],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010991928,0.00021047278,0.00071122916,0.000077755045,0.00012873134,0.000028377126,0.0005394503,0.0001348502,0.0005797744],"category_scores_gemma":[0.0012602456,0.0001603322,0.00036156128,0.00026810393,0.00029738815,0.00031087,0.00014176665,0.0003673454,0.0000034389464],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013654334,0.00009765084,0.00043997128,0.00025067976,0.00023467118,0.000038985625,0.0031488321,0.0000017460084,0.00059025787,0.9921935,0.001442057,0.00019617632],"study_design_scores_gemma":[0.0013721084,0.0006279556,0.0000908373,0.000082772494,0.00015110149,0.00017055814,0.0008722395,0.0000015827715,0.0069355965,0.9877253,0.0018090238,0.0001609075],"about_ca_topic_score_codex":5.121753e-7,"about_ca_topic_score_gemma":8.7114685e-8,"teacher_disagreement_score":0.008603055,"about_ca_system_score_codex":0.000023390672,"about_ca_system_score_gemma":0.00006259896,"threshold_uncertainty_score":0.65381575},"labels":[],"label_agreement":null},{"id":"W3004174860","doi":"10.4171/rmi/1281","title":"An improved bound for the dimension of $(\\alpha,2\\alpha)$-Furstenberg sets","year":2021,"lang":"en","type":"preprint","venue":"Revista Matemática Iberoamericana","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"European Commission; Nemzeti Kutatási Fejlesztési és Innovációs Hivatal; Tempus Közalapítvány; University of St Andrews; Schweizerischer Nationalfonds zur Förderung der Wissenschaftlichen Forschung; National Research, Development and Innovation Office; National Science Foundation","keywords":"Alpha (finance); Hausdorff dimension; Dimension (graph theory); Planar; Mathematics; Set (abstract data type); Constant (computer programming); Combinatorics; Discrete mathematics; Computer science; Statistics","score_opus":0.03484650791409087,"score_gpt":0.331250050654816,"score_spread":0.2964035427407251,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3004174860","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95913553,0.012378403,0.017714133,0.00082885096,0.0024407972,0.005055276,0.00083989685,0.00034502833,0.0012620732],"genre_scores_gemma":[0.97019494,0.0010123086,0.027223298,0.0003278751,0.00026890435,0.00028712946,0.00017110784,0.00021154451,0.00030286823],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99591404,0.00046039134,0.0013305402,0.0010429766,0.00056219427,0.00068984163],"domain_scores_gemma":[0.99263763,0.0019058783,0.0013471249,0.0033113551,0.0005577262,0.00024026564],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012609948,0.00075035443,0.0016473926,0.00014458789,0.00046982104,0.0003410713,0.0013694573,0.00040819068,0.0001812987],"category_scores_gemma":[0.0008526949,0.0005195723,0.0007901728,0.0003032208,0.00070120307,0.00012882876,0.0010334061,0.00071961165,0.0000016393273],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013986209,0.0020643494,0.00073921663,0.034013916,0.007653963,0.00011387639,0.013997825,0.00030286738,0.022976767,0.80233747,0.01997439,0.09442676],"study_design_scores_gemma":[0.005376714,0.002759504,0.0055380366,0.008050557,0.013085826,0.00031365996,0.013667136,0.050175045,0.013802187,0.8379371,0.041160185,0.008134009],"about_ca_topic_score_codex":0.00023172145,"about_ca_topic_score_gemma":0.00002292675,"teacher_disagreement_score":0.08629275,"about_ca_system_score_codex":0.00013873843,"about_ca_system_score_gemma":0.00032239757,"threshold_uncertainty_score":0.9997256},"labels":[],"label_agreement":null},{"id":"W3005922675","doi":"10.37236/9376","title":"On the Existence of Hamilton Cycles with a Periodic Pattern in a Random Digraph","year":2020,"lang":"en","type":"preprint","venue":"The Electronic Journal of Combinatorics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Digraph; Traverse; Orientation (vector space); Combinatorics; Mathematics; Hamiltonian path; Geometry; Geodesy; Geography; Graph","score_opus":0.02509770828158007,"score_gpt":0.26708230116877113,"score_spread":0.24198459288719107,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3005922675","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9906338,0.0027977852,0.003781131,0.0012500957,0.00034087058,0.00049190817,0.0000054418806,0.000012299016,0.000686664],"genre_scores_gemma":[0.9982779,0.0014135351,0.00001892618,0.00014640686,0.000066713954,0.000013070421,6.161844e-7,0.000041612595,0.000021242868],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99712676,0.0006018895,0.00081888423,0.0002010119,0.0008022788,0.00044919434],"domain_scores_gemma":[0.9956568,0.0019267856,0.0014641581,0.00069342804,0.00020228732,0.00005653571],"candidate_categories":["research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0019816575,0.00035118562,0.0008625977,0.00017535912,0.00015375711,0.000049378392,0.0015553592,0.00016389698,0.000011784381],"category_scores_gemma":[0.00039965313,0.00016118992,0.00037670578,0.00034904183,0.0002916432,0.00003906865,0.00024145425,0.003154273,3.9063184e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00083387474,0.00014412004,0.0003797796,0.00018236134,0.00035763424,0.000026453328,0.006676276,0.00009160012,0.000021407242,0.99094385,0.000117840726,0.00022479625],"study_design_scores_gemma":[0.0017850682,0.0007942002,0.00040361972,0.0006452558,0.00019637033,0.00008601769,0.00048513623,0.00009611076,0.0003419526,0.9949054,0.00007919614,0.00018163375],"about_ca_topic_score_codex":0.000014433156,"about_ca_topic_score_gemma":0.000022826835,"teacher_disagreement_score":0.0076440712,"about_ca_system_score_codex":0.00017900065,"about_ca_system_score_gemma":0.00053526455,"threshold_uncertainty_score":0.9991455},"labels":[],"label_agreement":null},{"id":"W3008717233","doi":"10.37236/9489","title":"Transversals and Bipancyclicity in Bipartite Graph Families","year":2021,"lang":"en","type":"preprint","venue":"The Electronic Journal of Combinatorics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Bipartite graph; Mathematics; Vertex (graph theory); Degree (music); Graph; Discrete mathematics; Complete bipartite graph; Physics","score_opus":0.01907249066705321,"score_gpt":0.2805400169020348,"score_spread":0.2614675262349816,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3008717233","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.975247,0.021035729,0.0017451638,0.00039288236,0.0009321242,0.00020126985,0.000003934613,0.000014645918,0.0004272448],"genre_scores_gemma":[0.97854143,0.021187125,0.00005567688,0.00005633855,0.00008815336,0.0000047791173,9.906025e-7,0.000034475186,0.000031022544],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99744314,0.00048096568,0.0008303843,0.00021031221,0.00047796272,0.0005572206],"domain_scores_gemma":[0.9978026,0.0007293406,0.00069966435,0.0004843153,0.00020919825,0.000074868934],"candidate_categories":["research_integrity"],"consensus_categories":[],"category_scores_codex":[0.002203643,0.00031903604,0.0008150992,0.00030292795,0.0001487168,0.00007750848,0.00069177354,0.00028741345,0.000012378074],"category_scores_gemma":[0.00031209877,0.00021486093,0.00032791702,0.00038298982,0.00018350875,0.0000968192,0.00032195103,0.0027940099,1.2188582e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000774985,0.00013590683,0.001181623,0.00021910347,0.0003425532,0.000033005974,0.0055916305,0.00003754642,0.000120286386,0.99178773,0.00009350482,0.00037959806],"study_design_scores_gemma":[0.00073683733,0.00014184433,0.0007517683,0.00024497198,0.00021709118,0.00012966525,0.0009025433,0.000029968784,0.0011516415,0.995227,0.00024949852,0.00021721113],"about_ca_topic_score_codex":0.000020155247,"about_ca_topic_score_gemma":0.000071035276,"teacher_disagreement_score":0.004689087,"about_ca_system_score_codex":0.00018247023,"about_ca_system_score_gemma":0.00039793865,"threshold_uncertainty_score":0.9995066},"labels":[],"label_agreement":null},{"id":"W3011976042","doi":"10.48550/arxiv.2003.07172","title":"Orchards in elliptic curves over finite fields","year":2020,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Mathematics; Elliptic curve; Supersingular elliptic curve; Mathematical analysis","score_opus":0.13689157685964046,"score_gpt":0.2320923272716381,"score_spread":0.09520075041199763,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3011976042","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95992494,0.0005099389,0.01943391,0.00031282933,0.0013163121,0.0006738949,0.00007659916,0.00025258184,0.017499017],"genre_scores_gemma":[0.99586886,0.0012676369,0.0002823291,0.0005249285,0.00012835713,0.0000011942128,0.000018182749,0.000037478425,0.0018710352],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99838006,0.00018351561,0.00027964427,0.00073097926,0.00010795303,0.0003178305],"domain_scores_gemma":[0.9982478,0.0005236256,0.00020752981,0.0008300209,0.000058443657,0.00013256998],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00024338752,0.00035062342,0.0005250718,0.00020863609,0.000092402704,0.000025092178,0.0008008426,0.00044822568,0.00049507635],"category_scores_gemma":[0.0003400717,0.00036639118,0.00029220874,0.00036834215,0.00012993546,0.000090304515,0.0013351929,0.0011397784,0.000024244604],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010961235,0.00008724426,0.0057890443,0.0017535872,0.0001861586,0.00068621186,0.0010320119,0.008825381,0.000005534855,0.9763786,0.005054692,0.00009190177],"study_design_scores_gemma":[0.00045384362,0.000037361435,0.0013045954,0.0005876967,0.00014424154,0.0000015763385,0.00007527613,0.018579712,0.00002616103,0.9775012,0.0008277258,0.00046057958],"about_ca_topic_score_codex":0.00006228376,"about_ca_topic_score_gemma":0.0000686239,"teacher_disagreement_score":0.03594394,"about_ca_system_score_codex":0.00009432447,"about_ca_system_score_gemma":0.00008752685,"threshold_uncertainty_score":0.9998788},"labels":[],"label_agreement":null},{"id":"W3012954974","doi":"10.37236/9536","title":"The Erdős-Hajnal Property for Graphs with No Fixed Cycle as a Pivot-Minor","year":2021,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Kootenay Association for Science & Technology","funders":"Korea Advanced Institute of Science and Technology; Institute for Basic Science; POSCO TJ Park Foundation","keywords":"Combinatorics; Mathematics; Conjecture; Minor (academic); Discrete mathematics; Integer (computer science); Disjoint sets; Graph; Computer science","score_opus":0.010092850023676879,"score_gpt":0.2584122330902902,"score_spread":0.24831938306661333,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3012954974","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9710328,0.007413957,0.005581177,0.00434258,0.0019327872,0.00090368045,0.0000059484423,0.000053629923,0.00873342],"genre_scores_gemma":[0.99515444,0.00061059656,0.00018979152,0.00017866296,0.00016964733,0.000015747746,6.7252296e-7,0.00004448467,0.0036359625],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979065,0.00024024826,0.00047849468,0.0001471343,0.00055078004,0.0006768402],"domain_scores_gemma":[0.99671185,0.0012908991,0.0005050284,0.00049703935,0.00090916565,0.00008602759],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016110385,0.0002189044,0.00035087403,0.000048481084,0.0008795031,0.00009995105,0.0007522828,0.00008132831,0.000022581402],"category_scores_gemma":[0.0007542547,0.000084783984,0.0002834855,0.00034182484,0.00017907644,0.0001040661,0.00009004986,0.0008065835,0.0000024296007],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005092444,0.000120348566,0.000044363518,0.000031886855,0.0003817262,0.000015300535,0.0005924239,0.000006032087,0.00015458207,0.9949289,0.002528782,0.0006864225],"study_design_scores_gemma":[0.0014863613,0.0011516991,0.000030209454,0.00004386807,0.00021472231,0.0007691977,0.00040446708,0.00006275527,0.0017725473,0.9697172,0.024191277,0.00015572041],"about_ca_topic_score_codex":0.0000029112643,"about_ca_topic_score_gemma":0.00001682856,"teacher_disagreement_score":0.025211712,"about_ca_system_score_codex":0.00016115497,"about_ca_system_score_gemma":0.0008657974,"threshold_uncertainty_score":0.67645156},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.051065535098823674,"score_gpt":0.3211682898076904,"score_spread":0.27010275470886674,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3014978470","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9901243,0.0010515819,0.0022450385,0.00014073233,0.0020156743,0.0006081439,0.00007848241,0.00010252944,0.003633522],"genre_scores_gemma":[0.9577276,0.00094488857,0.040429734,0.00013627065,0.00027454348,0.000026569642,0.000015282643,0.0002128578,0.00023222857],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9939557,0.00055088225,0.002494513,0.00064726645,0.0015874339,0.0007642432],"domain_scores_gemma":[0.99260545,0.0012729187,0.0029331911,0.002035876,0.00071092055,0.0004416494],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0021017578,0.0009973766,0.002079713,0.0008837839,0.0004389199,0.00035250164,0.0013066159,0.0008792942,0.0003732794],"category_scores_gemma":[0.0018189388,0.00076643005,0.0018184204,0.0005145103,0.00031942676,0.00014804704,0.0011159328,0.003039044,0.0000073619613],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027824767,0.00140917,0.00060931954,0.007583725,0.0036137109,0.0010818931,0.026249839,0.00022855203,0.004659811,0.95034575,0.0025752492,0.0013647411],"study_design_scores_gemma":[0.0007487282,0.00026830458,0.0001806276,0.004349548,0.000707977,0.0006255979,0.0019441504,0.00029286614,0.00842876,0.98153484,0.000068351255,0.00085023843],"about_ca_topic_score_codex":0.0000054784014,"about_ca_topic_score_gemma":0.0000140849925,"teacher_disagreement_score":0.038184695,"about_ca_system_score_codex":0.00010887804,"about_ca_system_score_gemma":0.0002987299,"threshold_uncertainty_score":0.99947864},"labels":[],"label_agreement":null},{"id":"W3018106679","doi":"10.1002/jgt.22571","title":"Fractional chromatic number of a random subgraph","year":2020,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; Javna Agencija za Raziskovalno Dejavnost RS","keywords":"Chromatic scale; Combinatorics; Mathematics; Random graph; Graph; Discrete mathematics; Critical graph; Induced subgraph isomorphism problem; Induced subgraph; Windmill graph; Line graph; Graph power; Vertex (graph theory); Voltage graph","score_opus":0.026955815257990026,"score_gpt":0.3007404859135626,"score_spread":0.2737846706555726,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3018106679","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9742689,0.00056105223,0.018065657,0.0003809655,0.00055970374,0.00014810353,0.000013217246,0.000026434329,0.005975958],"genre_scores_gemma":[0.9930987,0.00008872006,0.006057133,0.000382333,0.00031027073,0.0000015513597,5.274366e-7,0.000027572669,0.000033222914],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99789065,0.0003833554,0.00090558815,0.0001157891,0.00052602927,0.00017856309],"domain_scores_gemma":[0.9967284,0.001619269,0.0010271528,0.00020216592,0.00025629057,0.00016672067],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0014302197,0.00018062284,0.0006198803,0.00017411321,0.000114416034,0.000015433676,0.0003831343,0.00010538636,0.0010899463],"category_scores_gemma":[0.0011235195,0.00012693563,0.00067593664,0.0003564552,0.00025745638,0.00018822933,0.00005553269,0.0004095187,0.00000497805],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0018287991,0.00013942039,0.0028317997,0.0002399171,0.00067627034,0.000040742605,0.0032470922,0.000013091009,0.0013026865,0.9859446,0.0028815707,0.00085397635],"study_design_scores_gemma":[0.0021219426,0.00014891155,0.00083518215,0.00009980442,0.00021432228,0.00028278414,0.00051185564,0.000017882001,0.0013240516,0.9937745,0.0005356164,0.00013318345],"about_ca_topic_score_codex":6.5279926e-7,"about_ca_topic_score_gemma":2.2259127e-7,"teacher_disagreement_score":0.018829761,"about_ca_system_score_codex":0.000011725703,"about_ca_system_score_gemma":0.000054167023,"threshold_uncertainty_score":0.9998232},"labels":[],"label_agreement":null},{"id":"W3022921866","doi":"10.1016/j.ejc.2023.103859","title":"Graph sequences sampled from Robinson graphons","year":2023,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Mathematics; Combinatorics; Measurable function; Bounded function; Graph; Norm (philosophy); Converse; Embedding; Discrete mathematics; Mathematical analysis; Computer science; Geometry","score_opus":0.04525435601837074,"score_gpt":0.28343904416938104,"score_spread":0.2381846881510103,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3022921866","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9868141,0.00040468256,0.0017346699,0.00018729083,0.003163224,0.00007668163,0.000020006872,0.00012630316,0.0074730315],"genre_scores_gemma":[0.99742025,0.00040269236,0.0016072175,0.00007768149,0.00024121093,4.2540282e-7,0.0000038137266,0.000055054672,0.00019166832],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99770665,0.0006649499,0.0006844798,0.00015686211,0.00050678995,0.000280275],"domain_scores_gemma":[0.9979033,0.0007636314,0.00058247027,0.00035055782,0.00023138236,0.00016866339],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001768013,0.00019989863,0.00036867376,0.00039801342,0.0002699875,0.00006524601,0.00071749516,0.00004075668,0.00007286186],"category_scores_gemma":[0.0006235275,0.00015272397,0.0003089262,0.00087229855,0.00011800087,0.00015638274,0.00014961066,0.00044084102,0.000030230447],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007287328,0.00012117214,0.0039150203,0.00003967545,0.00031968392,0.0010950171,0.0033300603,0.000034218534,0.0009373357,0.9444754,0.043728437,0.001931078],"study_design_scores_gemma":[0.00081487047,0.00021588807,0.008028942,0.000078837445,0.00007707449,0.000050997165,0.0003488364,0.000011357508,0.00039024456,0.97984177,0.009950552,0.00019064225],"about_ca_topic_score_codex":0.0000029910934,"about_ca_topic_score_gemma":8.200705e-7,"teacher_disagreement_score":0.035366327,"about_ca_system_score_codex":0.000026746935,"about_ca_system_score_gemma":0.00003495826,"threshold_uncertainty_score":0.6227903},"labels":[],"label_agreement":null},{"id":"W3023596029","doi":"10.1002/jgt.22607","title":"Short rainbow cycles in graphs and matroids","year":2020,"lang":"en","type":"preprint","venue":"Journal of Graph Theory","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Douglas College; Simon Fraser University","funders":"H2020 European Research Council; Natural Sciences and Engineering Research Council of Canada; Javna Agencija za Raziskovalno Dejavnost RS","keywords":"Matroid; Combinatorics; Rainbow; Conjecture; Mathematics; Generalization; Vertex (graph theory); Binary number; Graph; Graphic matroid; Simple (philosophy); Discrete mathematics; Physics; Arithmetic; Philosophy","score_opus":0.04310353134617261,"score_gpt":0.31715668530282803,"score_spread":0.2740531539566554,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3023596029","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9907117,0.0045314496,0.0008478136,0.0003911049,0.0012291427,0.00030204203,0.000031953794,0.000046000416,0.0019087913],"genre_scores_gemma":[0.9909254,0.0016255471,0.0068710158,0.00022561295,0.00023529,0.0000061457827,0.0000021866622,0.0000722558,0.000036549533],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99690855,0.0006427103,0.0012472022,0.00035672556,0.00051158626,0.00033322448],"domain_scores_gemma":[0.99739176,0.0010000023,0.0007486637,0.0004821959,0.00014650797,0.00023085995],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002878834,0.0004670779,0.0011678464,0.00092733826,0.00012232906,0.000086840046,0.0007780938,0.00045640735,0.00004453743],"category_scores_gemma":[0.0006483791,0.00035920503,0.00068986387,0.0002613447,0.00042580956,0.00012056018,0.00074550015,0.0021313622,5.095133e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000510186,0.000087516615,0.0053211404,0.00056393945,0.0004994876,0.00029787858,0.0035282609,0.000017623563,0.0002450905,0.98180795,0.0011786727,0.0059422427],"study_design_scores_gemma":[0.000490618,0.000112384725,0.010159173,0.00053158327,0.00023686978,0.00024766257,0.00067768054,0.0000105012,0.00017376375,0.9868883,0.000120666824,0.00035080893],"about_ca_topic_score_codex":0.0000021789635,"about_ca_topic_score_gemma":0.0000039731294,"teacher_disagreement_score":0.006023202,"about_ca_system_score_codex":0.000040655283,"about_ca_system_score_gemma":0.000077758144,"threshold_uncertainty_score":0.999886},"labels":[],"label_agreement":null},{"id":"W3023986409","doi":"10.1002/jgt.22478","title":"Almost all 5‐regular graphs have a 3‐flow","year":2019,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada; Centre of Excellence for Electromaterials Science, Australian Research Council","keywords":"Mathematics; Combinatorics; Conjecture; Discrete mathematics; 1-planar graph; Graph; Chordal graph","score_opus":0.019177075990577764,"score_gpt":0.2784675894635945,"score_spread":0.25929051347301674,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3023986409","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98471516,0.0013461519,0.0012893319,0.00015491979,0.0016307768,0.0002515534,0.000012445147,0.00004138261,0.010558282],"genre_scores_gemma":[0.988771,0.0002996389,0.008673995,0.00063018,0.00023192615,0.0000023534208,0.0000014964638,0.000068639354,0.001320749],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99753535,0.000427605,0.0008100534,0.0002142936,0.00061121694,0.00040151225],"domain_scores_gemma":[0.99731296,0.00081218436,0.0007750555,0.0006306632,0.00027067278,0.00019847613],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026656352,0.0003008749,0.00063540373,0.00042023242,0.0001441779,0.000048664628,0.0006222646,0.00019726473,0.0007421959],"category_scores_gemma":[0.00029823591,0.0002114019,0.00082810345,0.00023650576,0.0002257459,0.00026232147,0.00011917805,0.00060773717,0.000017913275],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00045177728,0.00012723304,0.0039285272,0.000094300674,0.00063551706,0.00008570121,0.0019080116,0.000023955821,0.0009987816,0.9841703,0.004720687,0.0028551992],"study_design_scores_gemma":[0.0010398586,0.00029789354,0.001303779,0.00013204034,0.00020348263,0.0004071698,0.0004343579,0.00002549267,0.0010222824,0.98854005,0.0063269236,0.00026666542],"about_ca_topic_score_codex":0.0000016018039,"about_ca_topic_score_gemma":0.0000018240733,"teacher_disagreement_score":0.009237533,"about_ca_system_score_codex":0.000030473651,"about_ca_system_score_gemma":0.00004486673,"threshold_uncertainty_score":0.86207193},"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,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.024872177754264934,"score_gpt":0.3041367521464307,"score_spread":0.2792645743921658,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3026391377","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9056391,0.003964307,0.0074495687,0.003932509,0.011932826,0.0029294535,0.0004454612,0.00027658086,0.0634302],"genre_scores_gemma":[0.9865682,0.0025961283,0.008378685,0.00028323795,0.0005729666,0.00005937865,0.000038062684,0.0001982964,0.0013050099],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9957054,0.0005105856,0.0014676396,0.00045400023,0.0011456657,0.00071671134],"domain_scores_gemma":[0.9933881,0.0032091253,0.0014675065,0.0013650819,0.00033440348,0.00023578625],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0022552738,0.0007550336,0.0011465946,0.00023981166,0.0009475006,0.0007175939,0.0014158459,0.0007073628,0.00014038225],"category_scores_gemma":[0.002515056,0.0004512813,0.00070976536,0.00032109563,0.0003234492,0.00011192842,0.0012204009,0.0050443932,0.000005796696],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000048936665,0.00025782094,0.000053769338,0.00054464967,0.0003909917,0.00039564734,0.00946944,0.00011299632,0.000002573389,0.98539144,0.002421032,0.00091071514],"study_design_scores_gemma":[0.00064152887,0.000116702926,0.00015203816,0.0016429009,0.000139811,0.00035917258,0.00406219,0.000603451,0.00019571268,0.9896015,0.0019355955,0.00054940535],"about_ca_topic_score_codex":0.0000031092356,"about_ca_topic_score_gemma":0.000030757263,"teacher_disagreement_score":0.08092914,"about_ca_system_score_codex":0.0003822853,"about_ca_system_score_gemma":0.00034347922,"threshold_uncertainty_score":0.9997939},"labels":[],"label_agreement":null},{"id":"W3028510799","doi":"10.1007/s10474-020-01044-3","title":"Erdős–Kakutani phenomena for paths","year":2020,"lang":"hu","type":"article","venue":"Acta Mathematica Academiae Scientiarum Hungaricae","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Mathematics; Countable set; Monochromatic color; Enhanced Data Rates for GSM Evolution; Combinatorics; Discrete mathematics; Computer science; Physics; Artificial intelligence; Optics","score_opus":0.053232337825419695,"score_gpt":0.3010568330809898,"score_spread":0.2478244952555701,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3028510799","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24342592,0.011083971,0.2610462,0.18551569,0.020558521,0.03501337,0.0064201946,0.005514121,0.23142202],"genre_scores_gemma":[0.93528277,0.00031049122,0.046837203,0.006765623,0.0028373203,0.0002947749,0.00006479844,0.0004927163,0.0071143005],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99034333,0.00041175983,0.0025809796,0.0022440278,0.0019105941,0.0025092897],"domain_scores_gemma":[0.99168515,0.0029058163,0.0015507849,0.0018969624,0.00042860777,0.0015326776],"candidate_categories":["metaepi_narrow","sts","research_integrity","insufficient_payload"],"consensus_categories":["metaepi_narrow"],"category_scores_codex":[0.003156816,0.0014252237,0.0021211514,0.0003832605,0.0021773812,0.00063039706,0.0036990452,0.0014188546,0.0023583726],"category_scores_gemma":[0.0066047367,0.00123939,0.0012508265,0.0017346602,0.0011476752,0.00084070786,0.0019707486,0.0021577114,0.0004862365],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024936235,0.00052702485,0.00004144113,0.0048010666,0.0008465826,0.000018258688,0.034869682,0.000010474797,0.009188129,0.77460045,0.17164637,0.0032011615],"study_design_scores_gemma":[0.0030232975,0.0007598763,0.00006689836,0.0006554038,0.0019785734,0.00006137334,0.004090525,0.038015094,0.0050970605,0.726479,0.21727864,0.0024942444],"about_ca_topic_score_codex":0.0000023737325,"about_ca_topic_score_gemma":0.0000012401556,"teacher_disagreement_score":0.69185686,"about_ca_system_score_codex":0.0002151632,"about_ca_system_score_gemma":0.0003091295,"threshold_uncertainty_score":0.9998775},"labels":[],"label_agreement":null},{"id":"W3030426705","doi":"10.1090/proc/15608","title":"A tight structure theorem for sumsets","year":2021,"lang":"lv","type":"preprint","venue":"Proceedings of the American Mathematical Society","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"European Research Council; Natural Sciences and Engineering Research Council of Canada; Centre de Recherches Mathématiques","keywords":"Combinatorics; Set (abstract data type); Mathematics; Structured program theorem; Discrete mathematics; Computer science","score_opus":0.01710756410346344,"score_gpt":0.27932841296619376,"score_spread":0.26222084886273034,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3030426705","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98759717,0.00032099776,0.0025036475,0.0014816851,0.00067523855,0.0029879948,0.00058984995,0.00014165363,0.0037017528],"genre_scores_gemma":[0.8215437,0.0002189057,0.17560276,0.00078017736,0.0005853273,0.00018708808,0.000016761898,0.00025097743,0.0008142857],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9942103,0.000076514734,0.0018339437,0.0013271397,0.0013964535,0.0011556246],"domain_scores_gemma":[0.9913107,0.0019511126,0.0038635998,0.0011717305,0.0014007892,0.00030207264],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.001498857,0.0012545126,0.0030201075,0.00006683377,0.0009127999,0.00034587528,0.0030740423,0.0007171721,0.00035866295],"category_scores_gemma":[0.0027224233,0.0008012577,0.00424869,0.0008457478,0.00367422,0.00016821877,0.0040856097,0.0018377528,0.0000028384104],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019683965,0.00057956204,0.00073425693,0.018753711,0.0028996828,6.5161805e-7,0.030861408,0.000008472804,0.011687651,0.9209589,0.011797246,0.0015216275],"study_design_scores_gemma":[0.0006118757,0.0001644171,0.0005513726,0.0018489482,0.00157847,0.000049146118,0.012217067,0.0021389069,0.016342143,0.9630012,0.00055021397,0.0009462429],"about_ca_topic_score_codex":0.000013890775,"about_ca_topic_score_gemma":0.0000013483847,"teacher_disagreement_score":0.17309912,"about_ca_system_score_codex":0.0002429167,"about_ca_system_score_gemma":0.00023416994,"threshold_uncertainty_score":0.9994438},"labels":[],"label_agreement":null},{"id":"W3036334018","doi":"10.37236/9659","title":"Tight Bounds on the Clique Chromatic Number","year":2021,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; McGill University","funders":"Fonds De La Recherche Scientifique - FNRS; Natural Sciences and Engineering Research Council of Canada; McGill University","keywords":"Combinatorics; Mathematics; Clique number; Monochromatic color; Corollary; Chromatic scale; Vertex (graph theory); Clique; Graph; Clique graph; Discrete mathematics; Simplex graph; Graph power; Physics; Line graph","score_opus":0.01911237087500364,"score_gpt":0.2870108141828546,"score_spread":0.267898443307851,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3036334018","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9730081,0.001576064,0.0012505223,0.004854166,0.0010935161,0.00013511951,8.678287e-7,0.000020690248,0.018060984],"genre_scores_gemma":[0.99718064,0.0005038989,0.000026578131,0.00058545795,0.00020587032,0.000002745921,2.7107419e-7,0.00002942767,0.0014650865],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979254,0.0005025543,0.00047338463,0.00009858471,0.0005439436,0.00045613636],"domain_scores_gemma":[0.996877,0.0017898254,0.0004406484,0.00056107756,0.00027740307,0.000054020198],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001972721,0.00017535321,0.00030708272,0.00003577996,0.00045370567,0.00006766563,0.00068737013,0.00008674655,0.00023300198],"category_scores_gemma":[0.0007308576,0.000083201834,0.00025621548,0.00035549636,0.00011625468,0.00006795776,0.00009178903,0.0012205455,0.000012453946],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026845086,0.00010502268,0.000059523256,0.000016606991,0.00019135972,0.000021856018,0.0006609838,0.000002392994,0.000072604846,0.9930749,0.005676537,0.00009139534],"study_design_scores_gemma":[0.0003970193,0.00018596624,0.00010882044,0.000053546264,0.00010531987,0.0007137256,0.00020851953,0.000017887603,0.003061835,0.98449737,0.010544073,0.000105940046],"about_ca_topic_score_codex":6.5142746e-7,"about_ca_topic_score_gemma":0.0000023642735,"teacher_disagreement_score":0.024172593,"about_ca_system_score_codex":0.00022028659,"about_ca_system_score_gemma":0.00043542095,"threshold_uncertainty_score":0.5302731},"labels":[],"label_agreement":null},{"id":"W3037007088","doi":"10.32920/24231043","title":"The Unit Acquisition Number of Binomial Random Graphs","year":2023,"lang":"en","type":"preprint","venue":"","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Combinatorics; Mathematics","score_opus":0.05581791959983064,"score_gpt":0.3406318136499556,"score_spread":0.28481389405012497,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3037007088","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9191483,0.00012130113,0.0025864523,0.00040269297,0.005144414,0.0010780651,0.00013250505,0.00041040522,0.07097584],"genre_scores_gemma":[0.9892468,0.0003052896,0.0027083438,0.000056397643,0.0002621821,0.00006106488,0.000031941436,0.000066521214,0.0072614653],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99849504,0.00020430873,0.00052110536,0.0002538723,0.00031079454,0.00021487444],"domain_scores_gemma":[0.9968676,0.0017565478,0.00031818735,0.00087717676,0.00013909045,0.000041423762],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009469206,0.00023317563,0.0004124429,0.00008109015,0.00026871648,0.00005109361,0.0005600716,0.00031904268,0.0003812616],"category_scores_gemma":[0.00024468632,0.00013318093,0.0004005496,0.0001322637,0.00024084764,0.00002205501,0.0008836984,0.00043452554,0.00002440257],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001740822,0.000017183407,0.00060868065,0.00018232323,0.0002392904,0.000002303422,0.00042440984,0.000012138885,0.00001572356,0.98963016,0.008210565,0.00048313924],"study_design_scores_gemma":[0.0006736028,0.000008129361,0.00066828745,0.000074997624,0.00010369001,0.000004020455,0.00016571439,0.00007245688,0.00036948873,0.9971142,0.00058328203,0.00016217204],"about_ca_topic_score_codex":0.000053419193,"about_ca_topic_score_gemma":0.000026750002,"teacher_disagreement_score":0.07009847,"about_ca_system_score_codex":0.000012872903,"about_ca_system_score_gemma":0.000043039367,"threshold_uncertainty_score":0.54309607},"labels":[],"label_agreement":null},{"id":"W3037115722","doi":"10.1002/jgt.22607","title":"Short rainbow cycles in graphs and matroids","year":2021,"lang":"en","type":"article","venue":"IRIS Research product catalog (Sapienza University of Rome)","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Douglas College; Simon Fraser University","funders":"H2020 European Research Council; Natural Sciences and Engineering Research Council of Canada; Javna Agencija za Raziskovalno Dejavnost RS","keywords":"Matroid; Combinatorics; Rainbow; Mathematics; Conjecture; Vertex (graph theory); Graphic matroid; Generalization; Simple (philosophy); Graph; Discrete mathematics","score_opus":0.05781723222469662,"score_gpt":0.33061479664272647,"score_spread":0.2727975644180298,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3037115722","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99562913,0.0011293776,0.00003401547,0.00055216055,0.00007188219,0.0003079164,0.000052248884,0.00003916036,0.002184125],"genre_scores_gemma":[0.99379057,0.000579179,0.0041124984,0.000010227586,0.000027568072,7.4015435e-7,0.000024757323,0.000018521783,0.0014359407],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976898,0.0004348658,0.0002106139,0.0005651611,0.0006015176,0.000498034],"domain_scores_gemma":[0.9982129,0.00044860298,0.00004972336,0.0007356586,0.00040786236,0.0001452795],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017382518,0.00015628463,0.00035980836,0.00056139665,0.0003930651,0.000027069747,0.00047634705,0.000112001195,0.0000988644],"category_scores_gemma":[0.0008293512,0.00016363253,0.00009519341,0.00090516626,0.0009929644,0.00022723904,0.00083856704,0.00055496977,0.000004682527],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008235555,0.001393364,0.1535782,0.0024337259,0.00062044384,0.0028256576,0.046918206,0.000019257144,0.032062143,0.657967,0.044361107,0.056997377],"study_design_scores_gemma":[0.0014297388,0.00018793723,0.15780447,0.00022304262,0.000044337045,0.00016047718,0.012361215,0.00003024822,0.010427577,0.80381256,0.012982519,0.00053585484],"about_ca_topic_score_codex":0.00022097511,"about_ca_topic_score_gemma":0.00030877948,"teacher_disagreement_score":0.1458456,"about_ca_system_score_codex":0.00007434369,"about_ca_system_score_gemma":0.00013217586,"threshold_uncertainty_score":0.6672741},"labels":[],"label_agreement":null},{"id":"W3040360762","doi":"10.48550/arxiv.2007.02216","title":"Subgraph probability of random graphs with specified degrees and applications to chromatic number and connectivity","year":2020,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Random graph; Upper and lower bounds; Degree (music); Graph; Discrete mathematics; Chromatic scale; Connectivity; Physics","score_opus":0.09452318189440896,"score_gpt":0.22103461321167314,"score_spread":0.12651143131726417,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3040360762","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9555811,0.000031459873,0.04012775,0.000051189865,0.000034228917,0.0015378766,0.00006296684,0.000079246165,0.0024941382],"genre_scores_gemma":[0.9959218,0.000058707563,0.003907822,0.000021803646,0.000023749335,0.0000105772715,0.000005037723,0.000023277391,0.000027230222],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985883,0.00016544772,0.00023284635,0.00074522,0.00008691023,0.00018124418],"domain_scores_gemma":[0.9981724,0.0006139043,0.00019853082,0.00069535844,0.0001297258,0.00019006418],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00026407395,0.00030310778,0.0006339588,0.00012054207,0.00016903222,0.000026611859,0.00029502396,0.0001832849,0.00002206352],"category_scores_gemma":[0.00009363752,0.00026611306,0.000120175886,0.0003907512,0.0004971936,0.00006786705,0.00063450227,0.0003238509,9.573623e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005278541,0.00009265603,0.026259309,0.001174942,0.00027436033,0.000013247589,0.000835698,0.00028813956,0.000051806626,0.970286,0.000031169522,0.00016480917],"study_design_scores_gemma":[0.00091767346,0.00006566232,0.01767714,0.00011397588,0.00031937734,0.000007925171,0.00019412267,0.0006064755,0.00016306761,0.9795899,0.000031862306,0.00031283352],"about_ca_topic_score_codex":0.00003638747,"about_ca_topic_score_gemma":0.00010504315,"teacher_disagreement_score":0.04034065,"about_ca_system_score_codex":0.000029918288,"about_ca_system_score_gemma":0.000042413663,"threshold_uncertainty_score":0.9999791},"labels":[],"label_agreement":null},{"id":"W3045797350","doi":"10.4153/s0008439520000181","title":"On Single-Distance Graphs on the Rational Points in Euclidean Spaces","year":2020,"lang":"en","type":"article","venue":"Canadian Mathematical Bulletin","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Euclidean space; Graph; Euclidean geometry; Clique number; Euclidean distance; Discrete mathematics; Geometry","score_opus":0.04050989374748585,"score_gpt":0.2445590072043601,"score_spread":0.20404911345687426,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3045797350","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6527169,0.00004258866,0.0007811331,0.17573676,0.00018080023,0.00093739823,0.00008776389,0.00010451327,0.1694122],"genre_scores_gemma":[0.9833699,0.0000015835591,0.001254181,0.014752153,0.00007713154,0.000027135988,0.0000035857847,0.00003815102,0.00047618427],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983895,0.0001747713,0.00036649307,0.0003115608,0.0003454832,0.00041220113],"domain_scores_gemma":[0.99682784,0.0022760953,0.00008404807,0.0003744359,0.00003606132,0.00040154636],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00046481128,0.00023330528,0.0002849575,0.00011333497,0.00023199127,0.000081434235,0.0004051672,0.00010828026,0.010162494],"category_scores_gemma":[0.0039057136,0.00015588921,0.00011368488,0.00023778492,0.00019234058,0.00001760163,0.00003627784,0.00039488505,0.0013780977],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029676528,0.000041081603,0.000023657642,0.00004843159,0.00001375034,0.00004072347,0.0011505808,0.000005785916,0.000010816531,0.94930106,0.049244847,0.00008957245],"study_design_scores_gemma":[0.00023076816,0.000098320575,0.000059192593,0.0001391743,0.000008853422,0.0000049357836,0.00026386307,0.00017106574,0.00011535918,0.97802776,0.020684425,0.00019628351],"about_ca_topic_score_codex":0.000046733345,"about_ca_topic_score_gemma":0.00056600885,"teacher_disagreement_score":0.33065304,"about_ca_system_score_codex":0.00010005751,"about_ca_system_score_gemma":0.00006210148,"threshold_uncertainty_score":0.9993994},"labels":[],"label_agreement":null},{"id":"W3046477764","doi":"10.19086/da.12058","title":"Finitely forcible graphons with an almost arbitrary structure","year":2020,"lang":"en","type":"article","venue":"Discrete Analysis","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Engineering and Physical Sciences Research Council; Grantová Agentura České Republiky; European Commission; Leverhulme Trust; National Science Foundation","keywords":"Combinatorics; Mathematics; Statement (logic); Graph; Random graph; Discrete mathematics","score_opus":0.03519003951355038,"score_gpt":0.2907537146227275,"score_spread":0.2555636751091771,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3046477764","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9847443,0.000107530694,0.009370248,0.0005104254,0.000036794136,0.00017858,0.0003061096,0.00017994877,0.0045660357],"genre_scores_gemma":[0.98491174,0.000011745495,0.013594999,0.0010660851,0.00011526547,0.0000064393994,0.00017397634,0.000041670228,0.00007806716],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998423,0.00010280765,0.0003035635,0.00048663377,0.0003619638,0.00032204986],"domain_scores_gemma":[0.99865794,0.00017356084,0.00015716521,0.0006588294,0.00007177673,0.0002807521],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009861221,0.00028800705,0.00053888804,0.00024388301,0.0003175965,0.00007981164,0.00042526468,0.000114574446,0.0008286494],"category_scores_gemma":[0.00009730367,0.00019310888,0.00038403095,0.001977826,0.00013796423,0.000242704,0.00008695193,0.00027741128,0.0000030610254],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009675893,0.00012818836,0.0933628,0.00027976237,0.01532565,0.00022303386,0.019894864,0.0019273364,0.0010954322,0.8630043,0.0022095547,0.0015814619],"study_design_scores_gemma":[0.0011789019,0.0008284174,0.010741169,0.000028577851,0.010679082,0.000013495127,0.003822246,0.016437339,0.0033793868,0.9496696,0.0018566537,0.0013651338],"about_ca_topic_score_codex":0.000036089452,"about_ca_topic_score_gemma":0.00019337842,"teacher_disagreement_score":0.08666527,"about_ca_system_score_codex":0.000008515392,"about_ca_system_score_gemma":0.000025132384,"threshold_uncertainty_score":0.907313},"labels":[],"label_agreement":null},{"id":"W3061928464","doi":"","title":"The Erd\\H{o}s-Ko-Rado theorem for $2$-intersecting families of perfect matchings","year":2020,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Matching (statistics); Perfect graph theorem; Graph; Line graph","score_opus":0.09720893394032736,"score_gpt":0.22726514807420184,"score_spread":0.13005621413387447,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3061928464","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9446188,0.000104832376,0.046604477,0.00013746324,0.0010513497,0.0008453434,0.000097907025,0.0001728023,0.0063670226],"genre_scores_gemma":[0.99775493,0.00017581657,0.0011114512,0.000061059145,0.00017172829,0.0000029030732,0.000008577657,0.0000608509,0.0006526701],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99827725,0.00021455534,0.00037074139,0.0006696947,0.000109461,0.0003582975],"domain_scores_gemma":[0.99597055,0.0022952422,0.0005693027,0.00089405465,0.00017866814,0.000092210845],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00066558336,0.00039671324,0.0005729236,0.00012455691,0.00059908687,0.000057018766,0.0012323044,0.00028757044,0.000024013932],"category_scores_gemma":[0.0006589912,0.00030417234,0.0006942088,0.00020668237,0.00039678853,0.000076191274,0.0013979248,0.0006954189,0.0000027929561],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033736607,0.000027689175,0.0004820328,0.0006431176,0.00040707216,0.000015550488,0.003577915,0.0009584905,0.00012428858,0.9923271,0.0005998746,0.0004995349],"study_design_scores_gemma":[0.00043854173,0.00009037026,0.00009000357,0.00017761192,0.00031457518,0.0000035066996,0.0042110174,0.009832283,0.00073434715,0.98325515,0.000516527,0.00033606362],"about_ca_topic_score_codex":0.000044811084,"about_ca_topic_score_gemma":0.000035471192,"teacher_disagreement_score":0.05313614,"about_ca_system_score_codex":0.00008601058,"about_ca_system_score_gemma":0.00007643015,"threshold_uncertainty_score":0.99994105},"labels":[],"label_agreement":null},{"id":"W3082098889","doi":"10.1002/jgt.22786","title":"Graph colorings with restricted bicolored subgraphs: II. The graph coloring game","year":2021,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Combinatorics; Mathematics; Graph coloring; Greedy coloring; Cartesian product; Complete coloring; Discrete mathematics; Fractional coloring; Bounded function; List coloring; Edge coloring; Graph; Corollary; Brooks' theorem; Graph power; Line graph","score_opus":0.023175980303014886,"score_gpt":0.262850474724748,"score_spread":0.2396744944217331,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3082098889","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99032646,0.0023231907,0.0013634614,0.000594986,0.0010791093,0.00034701911,0.000015589883,0.000095811105,0.0038543679],"genre_scores_gemma":[0.9944674,0.00092974474,0.0032198993,0.0004926784,0.0002901014,0.000023064218,0.0000025932022,0.00009372059,0.00048080372],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9956543,0.0009619288,0.0012158949,0.0004139099,0.0010444629,0.000709531],"domain_scores_gemma":[0.99400693,0.0024100267,0.0013422762,0.0009377369,0.0010147054,0.0002883124],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0024423716,0.00051983685,0.00090899214,0.00088309665,0.00109402,0.00014587118,0.0010808851,0.0002663011,0.00016121032],"category_scores_gemma":[0.0010755309,0.00030319128,0.0008842433,0.0026508458,0.00096103846,0.0003829769,0.00029506074,0.0013229514,0.0000014647104],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015278658,0.00032930874,0.0026607607,0.00008600183,0.0013320027,0.00059434114,0.0032618407,0.000049677587,0.0029394638,0.9845014,0.0020234347,0.00069390645],"study_design_scores_gemma":[0.0020047266,0.0008704356,0.0078947665,0.00027755284,0.00062427483,0.0013975473,0.003088139,0.0000028880643,0.0052287453,0.97452575,0.0036502376,0.00043494857],"about_ca_topic_score_codex":0.0000051518145,"about_ca_topic_score_gemma":0.000025212123,"teacher_disagreement_score":0.009975658,"about_ca_system_score_codex":0.000059723072,"about_ca_system_score_gemma":0.00024010116,"threshold_uncertainty_score":0.999942},"labels":[],"label_agreement":null},{"id":"W3082984758","doi":"10.4064/cm8033-12-2019","title":"On the inverse problems associated with subsequence sums of zero-sum free sequences over finite abelian groups","year":2020,"lang":"en","type":"article","venue":"Colloquium Mathematicum","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University","funders":"","keywords":"Subsequence; Mathematics; Abelian group; Combinatorics; Inverse; Longest increasing subsequence; Sequence (biology); Exponent; Sigma; Group (periodic table); Zero (linguistics); Rank of an abelian group; Elementary abelian group; Discrete mathematics; Mathematical analysis","score_opus":0.04861911180940461,"score_gpt":0.25141119315072763,"score_spread":0.202792081341323,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3082984758","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98765314,0.00005066382,0.0014981331,0.0014987916,0.00018224552,0.0012696577,0.00013101501,0.00020216937,0.0075142],"genre_scores_gemma":[0.99604404,0.000011569597,0.002199241,0.0010730214,0.00004828552,0.00009453759,0.0000071329896,0.00007119009,0.00045096528],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99732864,0.00025083477,0.00069422787,0.00042514552,0.00082975737,0.000471404],"domain_scores_gemma":[0.99494886,0.0029794755,0.0007149718,0.0009994927,0.00018909397,0.00016812433],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008766804,0.0004221852,0.0006722378,0.00009177155,0.00033189708,0.00007695364,0.0011546825,0.0001829194,0.00035758247],"category_scores_gemma":[0.00414603,0.00023961652,0.00019920507,0.00079630956,0.0006244916,0.00018291302,0.00026974795,0.00039876974,0.000018026194],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000105359504,0.00016981692,0.00061775534,0.0007090393,0.0003961502,0.000030555268,0.012469951,0.00013673396,0.0025726166,0.96318245,0.019594861,0.00001471883],"study_design_scores_gemma":[0.00090759416,0.0004946926,0.0001666656,0.0007015662,0.0001676012,0.0000066666325,0.00070050044,0.0024069492,0.0035805511,0.9903685,0.00010613379,0.00039257345],"about_ca_topic_score_codex":0.000013319561,"about_ca_topic_score_gemma":0.00008071605,"teacher_disagreement_score":0.027186064,"about_ca_system_score_codex":0.00006366749,"about_ca_system_score_gemma":0.00009310094,"threshold_uncertainty_score":0.9771278},"labels":[],"label_agreement":null},{"id":"W3083145360","doi":"10.1002/rsa.20189","title":"Distribution of subgraphs of random regular graphs","year":2007,"lang":"en","type":"article","venue":"Random Structures and Algorithms","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Mathematics; Combinatorics; Random graph; Asymptotic distribution; struct; Infinity; Bounded function; Discrete mathematics; Distribution (mathematics); Random regular graph; Graph; Line graph; Pathwidth; Statistics; Computer science","score_opus":0.012982554437415035,"score_gpt":0.2710556701729983,"score_spread":0.2580731157355833,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3083145360","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96967316,0.0015926961,0.027304552,0.00001723172,0.00037642036,0.00040260536,0.00014060926,0.000037953225,0.00045476807],"genre_scores_gemma":[0.9935743,0.0002600064,0.005974244,0.000014192545,0.00008850369,0.0000033887088,0.000030908817,0.00002164665,0.000032759213],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981755,0.00010361348,0.00074153085,0.0002728238,0.0003887571,0.0003177682],"domain_scores_gemma":[0.9980939,0.0008463428,0.0004066702,0.00037984012,0.0001638048,0.00010946165],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011965891,0.0002563411,0.00075259065,0.00016075517,0.00018306618,0.000013178685,0.00020341964,0.00018757035,0.000039075356],"category_scores_gemma":[0.00028849847,0.00018182646,0.00030877267,0.00030509479,0.0004900161,0.0000732009,0.000080273785,0.00017789789,6.488953e-8],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0026266773,0.00005969915,0.0024815036,0.00040460864,0.00032924116,0.000011860573,0.0010836108,0.000007666301,0.0038319367,0.9576573,0.0003405895,0.031165304],"study_design_scores_gemma":[0.009918774,0.000115187504,0.013944526,0.000058292902,0.00016091636,0.000041239768,0.00024394407,0.00007591221,0.03233335,0.9425106,0.00036938337,0.00022786856],"about_ca_topic_score_codex":0.000035538455,"about_ca_topic_score_gemma":0.0000068867876,"teacher_disagreement_score":0.030937435,"about_ca_system_score_codex":0.0000088776305,"about_ca_system_score_gemma":0.000014093185,"threshold_uncertainty_score":0.74146676},"labels":[],"label_agreement":null},{"id":"W3083377090","doi":"10.1002/rsa.20241","title":"Critical random graphs and the structure of a minimum spanning tree","year":2008,"lang":"en","type":"article","venue":"Random Structures and Algorithms","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"struct; Random graph; Combinatorics; Spanning tree; Mathematics; Independent and identically distributed random variables; Mathematical proof; Minimum spanning tree; Random tree; Frieze; Discrete mathematics; Tree (set theory); Enhanced Data Rates for GSM Evolution; Graph; Random variable; Computer science; Geometry; Statistics","score_opus":0.017241933446507637,"score_gpt":0.27435222067546555,"score_spread":0.2571102872289579,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3083377090","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9917499,0.0046031685,0.0016275366,0.000244921,0.00047536637,0.0005703148,0.00007833276,0.000059114504,0.0005913793],"genre_scores_gemma":[0.98975265,0.00060655124,0.009190863,0.0001501825,0.00018439822,0.000006453365,0.0000038659828,0.000034849898,0.00007016346],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99792284,0.00031027637,0.0005816953,0.00039688853,0.0004065996,0.0003816985],"domain_scores_gemma":[0.9958843,0.0032492212,0.00019810788,0.00040440052,0.00012031305,0.00014367994],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042053653,0.0003765346,0.0009889744,0.00012994018,0.0008149988,0.000052667183,0.0002594434,0.00020152735,0.00007136128],"category_scores_gemma":[0.0010342578,0.00020301227,0.00024898804,0.0001799084,0.002358069,0.0001204789,0.00018125016,0.00039008263,8.830349e-8],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.004715184,0.000025895291,0.0009300418,0.0003007895,0.0003798846,0.000047762664,0.008281936,0.000007147319,0.0012879192,0.9724633,0.0006681037,0.010892005],"study_design_scores_gemma":[0.025627362,0.00007893408,0.0026797785,0.00004848414,0.00023014854,0.0007410801,0.0003827358,0.0009016298,0.001429774,0.96740335,0.00018234162,0.00029438088],"about_ca_topic_score_codex":0.00003095377,"about_ca_topic_score_gemma":0.0000074616405,"teacher_disagreement_score":0.020912176,"about_ca_system_score_codex":0.0000051295624,"about_ca_system_score_gemma":0.000024028137,"threshold_uncertainty_score":0.86884034},"labels":[],"label_agreement":null},{"id":"W3087827845","doi":"10.1016/j.jctb.2022.12.007","title":"Packing A-paths of length zero modulo a prime","year":2023,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; National Sleep Foundation; National Science Foundation","keywords":"Mathematics; Modulo; Combinatorics; Prime (order theory); Mod; Abelian group; Property (philosophy); Zero (linguistics); Discrete mathematics","score_opus":0.0252346203530725,"score_gpt":0.29120211964587833,"score_spread":0.26596749929280583,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3087827845","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9862129,0.0001625363,0.0006623642,0.000109858884,0.009115619,0.0001509213,0.00001077272,0.00006884663,0.0035061885],"genre_scores_gemma":[0.9976889,0.00008741589,0.0009263956,0.000019219411,0.0008169339,0.0000017936397,8.4502375e-7,0.000042249143,0.00041626772],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99778205,0.00039008437,0.0008599328,0.0001248363,0.00056145125,0.0002816453],"domain_scores_gemma":[0.9970919,0.001134537,0.000913503,0.00037846417,0.0003785476,0.00010307987],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028319894,0.00020524248,0.0006311803,0.00027846848,0.00018018231,0.000031493902,0.00050581235,0.00015120604,0.00009767991],"category_scores_gemma":[0.0015906167,0.00015520812,0.0003351341,0.0004129102,0.00023311158,0.00034096983,0.0001883116,0.00037547073,0.0000029366313],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00082636654,0.00007684501,0.00014278208,0.000084824336,0.00021146495,0.00004457696,0.0028139437,0.0000087606795,0.0018246683,0.9910096,0.0015732943,0.0013828878],"study_design_scores_gemma":[0.001053192,0.0005012815,0.00019540584,0.00013043484,0.00008561021,0.00008019963,0.00071101845,0.0000060111574,0.0151217105,0.9793033,0.002655388,0.00015647453],"about_ca_topic_score_codex":7.034714e-7,"about_ca_topic_score_gemma":1.3073128e-7,"teacher_disagreement_score":0.013297042,"about_ca_system_score_codex":0.000038139995,"about_ca_system_score_gemma":0.00008907726,"threshold_uncertainty_score":0.6329204},"labels":[],"label_agreement":null},{"id":"W3088215122","doi":"10.1016/j.jctb.2023.02.011","title":"Packing cycles in undirected group-labelled graphs","year":2023,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Mathematics; Combinatorics; Abelian group; Element (criminal law); Group (periodic table); Undirected graph; Integer (computer science); Order (exchange); Cyclic group; Graph; Discrete mathematics; Property (philosophy)","score_opus":0.02458348691211084,"score_gpt":0.29347984964724433,"score_spread":0.2688963627351335,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3088215122","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98910356,0.00019685847,0.000040065013,0.00011651462,0.0076196017,0.00014443786,0.0000038697854,0.00010229025,0.0026728024],"genre_scores_gemma":[0.9985965,0.00019937514,0.00051800994,0.000030461131,0.00042050326,0.000003625387,0.0000017021981,0.000043496613,0.00018630779],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976143,0.0006346747,0.00080596283,0.00014685444,0.0004477385,0.00035045235],"domain_scores_gemma":[0.99734145,0.0015841814,0.0005234862,0.00027627122,0.0001734355,0.00010118795],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030682082,0.00022064238,0.00057867327,0.00057456165,0.00022333737,0.000055498444,0.00045051242,0.00016473941,0.000105551684],"category_scores_gemma":[0.0013450852,0.00017202253,0.00024156364,0.0009393744,0.00018848987,0.00036715931,0.00014782473,0.00048167346,0.0000036875351],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009620573,0.000089246496,0.0010897305,0.00004661538,0.00012315184,0.000140091,0.0020506901,0.0000048991883,0.0007428893,0.99306375,0.00077516725,0.00091171876],"study_design_scores_gemma":[0.0018619761,0.00026784578,0.0018958804,0.00013799408,0.000045899527,0.00006615701,0.0011654672,0.0000042789065,0.0010549679,0.991973,0.001334104,0.00019244602],"about_ca_topic_score_codex":0.0000017522397,"about_ca_topic_score_gemma":0.0000040688947,"teacher_disagreement_score":0.009492959,"about_ca_system_score_codex":0.000056315774,"about_ca_system_score_gemma":0.00004452561,"threshold_uncertainty_score":0.7014875},"labels":[],"label_agreement":null},{"id":"W3088844073","doi":"10.1016/j.ejc.2020.103242","title":"On-line size Ramsey number for monotone k-uniform ordered paths with uniform looseness","year":2020,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China; Ryerson University","keywords":"Hypergraph; Combinatorics; Ramsey's theorem; Mathematics; Monotone polygon; Upper and lower bounds; Discrete mathematics; Graph; Geometry; Mathematical analysis","score_opus":0.03885832215286916,"score_gpt":0.2791317990322767,"score_spread":0.24027347687940753,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3088844073","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8916558,0.00009129876,0.0811215,0.0013051126,0.0015927171,0.00057407614,0.000033858374,0.000097349766,0.023528257],"genre_scores_gemma":[0.99096876,0.00004597728,0.007469485,0.0006866474,0.00040653627,0.0000016274796,0.0000021552257,0.00011784799,0.0003009755],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980387,0.00020475726,0.00074712664,0.00019349792,0.0005016856,0.0003142497],"domain_scores_gemma":[0.99708694,0.00094217365,0.0007730687,0.0003232266,0.0005724957,0.00030208874],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009904061,0.0003037864,0.0005366976,0.00005877714,0.0002307315,0.000068049216,0.00060380384,0.000053097257,0.00006998902],"category_scores_gemma":[0.0012274575,0.00020715201,0.00021573802,0.00033170168,0.000086954526,0.00015895136,0.0001060869,0.00051213783,0.0000113105925],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001774563,0.00036442428,0.00024489508,0.00024061945,0.00029704112,0.0006149257,0.0021828478,0.0003141243,0.00005552889,0.98510635,0.006614876,0.0021897834],"study_design_scores_gemma":[0.010497521,0.0052350825,0.00028304596,0.00027020677,0.00027723014,0.00040729129,0.00057820434,0.00061904365,0.0012853482,0.9514121,0.02846081,0.00067411375],"about_ca_topic_score_codex":2.2611549e-7,"about_ca_topic_score_gemma":2.02907e-7,"teacher_disagreement_score":0.09931292,"about_ca_system_score_codex":0.000049062033,"about_ca_system_score_gemma":0.00008075208,"threshold_uncertainty_score":0.8447414},"labels":[],"label_agreement":null},{"id":"W3089503945","doi":"10.1016/j.disc.2020.112153","title":"A universal partition result for infinite homogeneous <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" display=\"inline\" id=\"d1e22\" altimg=\"si24.svg\"><mml:msub><mml:mrow><mml:mi>K</mml:mi></mml:mrow><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:msub></mml:math>-free and related graphs","year":2020,"lang":"lv","type":"article","venue":"Discrete Mathematics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"Horizon 2020; European Research Council; Natural Sciences and Engineering Research Council of Canada; Nemzeti Kutatási Fejlesztési és Innovációs Hivatal; Austrian Science Fund; Pacific Institute for the Mathematical Sciences","keywords":"Mathematics; Combinatorics; Partition (number theory); Conjecture; Bipartite graph; Ramsey's theorem; Discrete mathematics; Graph","score_opus":0.020341867125559226,"score_gpt":0.24270227973976274,"score_spread":0.22236041261420353,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3089503945","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.61251247,0.0011561391,0.0025359397,0.0010164466,0.0018304008,0.00011526266,0.0011910645,0.00032826953,0.37931398],"genre_scores_gemma":[0.9830057,0.00140289,0.010337482,0.0010777292,0.0010738982,0.0006179839,0.001353078,0.00084472506,0.00028651298],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9919032,0.00039074678,0.0022027118,0.001524604,0.0019768893,0.002001844],"domain_scores_gemma":[0.9912086,0.002579864,0.0023655093,0.0025572954,0.00020987629,0.001078848],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","research_integrity","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0017430529,0.000959419,0.00048239695,0.00046409687,0.0017101669,0.0011474396,0.0020124484,0.0022344142,0.12494564],"category_scores_gemma":[0.00358299,0.0016348369,0.0017353481,0.0011069856,0.0018098011,0.0009994431,0.002106756,0.0015162835,0.00057399756],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012594095,0.00023550869,0.000006449197,0.0034457035,0.0019118971,0.0009993,0.009882963,0.00059836946,0.0009040858,0.84412557,0.13595119,0.0006795322],"study_design_scores_gemma":[0.0044766185,0.002988461,0.00003336097,0.0029131342,0.004613823,0.0019730965,0.008537659,0.17155007,0.77220976,0.025136223,0.002889182,0.0026786013],"about_ca_topic_score_codex":0.0002693688,"about_ca_topic_score_gemma":0.00046046486,"teacher_disagreement_score":0.81898934,"about_ca_system_score_codex":0.000014838197,"about_ca_system_score_gemma":0.0007368235,"threshold_uncertainty_score":0.9998895},"labels":[],"label_agreement":null},{"id":"W3093587179","doi":"10.1002/jgt.22657","title":"Edge clique covers in graphs with independence number two","year":2021,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; Université de Sherbrooke; Université de Montréal; Dawson College; Computer Research Institute of Montréal","funders":"Natural Sciences and Engineering Research Council of Canada; Agence Nationale de la Recherche","keywords":"Combinatorics; Mathematics; Independence number; Discrete mathematics; Clique; Conjecture; Chordal graph; Upper and lower bounds; Bounded function; Split graph; Induced subgraph; Graph; 1-planar graph","score_opus":0.01628610299619613,"score_gpt":0.3005152395070341,"score_spread":0.284229136510838,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3093587179","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97577685,0.0004042085,0.0023224177,0.00009548575,0.00053680944,0.000095732204,0.000005579561,0.000017001552,0.020745927],"genre_scores_gemma":[0.9938248,0.00019156025,0.0050941333,0.00037224797,0.00010544645,0.0000024043252,5.8296035e-7,0.00003434216,0.00037448527],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977407,0.0005883646,0.00063406635,0.00019648815,0.00053667225,0.0003037068],"domain_scores_gemma":[0.99765664,0.0009754119,0.0004933978,0.00037810404,0.00036636126,0.00013009856],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002191702,0.00022006819,0.00048535416,0.0002906717,0.000120157856,0.000041956668,0.00037251884,0.00014090975,0.0005405838],"category_scores_gemma":[0.00047245086,0.0001539551,0.0002867272,0.0006241596,0.0002572226,0.00028075848,0.00008530922,0.00087863556,0.0000027819874],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005459957,0.00014426751,0.022696268,0.000041358424,0.00018889547,0.0009169225,0.0014605119,0.000029137918,0.00043910905,0.9721116,0.00043749722,0.0009884732],"study_design_scores_gemma":[0.0016299706,0.0001032724,0.0034213434,0.0002355814,0.00007982878,0.001665861,0.0011139715,0.0000017639723,0.00262194,0.9885118,0.0004075279,0.00020713807],"about_ca_topic_score_codex":0.000004103294,"about_ca_topic_score_gemma":0.000050266302,"teacher_disagreement_score":0.020371443,"about_ca_system_score_codex":0.00004581158,"about_ca_system_score_gemma":0.00019050989,"threshold_uncertainty_score":0.62781066},"labels":[],"label_agreement":null},{"id":"W3098671307","doi":"","title":"2 DENSE SUBSETS OF PRODUCTS OF FINITE TREES","year":2016,"lang":"en","type":"article","venue":"","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Combinatorics; Mathematics; Integer (computer science); Cardinality (data modeling); Homogeneous; Tree (set theory); Product (mathematics); Finite set; Discrete mathematics; Geometry; Mathematical analysis","score_opus":0.035309463115187685,"score_gpt":0.27821152727822557,"score_spread":0.2429020641630379,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3098671307","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98818815,0.000048156293,0.0006157417,0.00014327816,0.0001063386,0.000092091555,0.000013481407,0.000022768809,0.010770006],"genre_scores_gemma":[0.9910394,0.000016326812,0.0060986658,0.000014224018,0.000028301336,0.0000014321027,2.2963702e-7,0.000008780332,0.0027926383],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994279,0.000033014156,0.00022345141,0.00009777954,0.0001241319,0.00009372388],"domain_scores_gemma":[0.99890625,0.00050770416,0.000110976485,0.00034997155,0.00010507801,0.000020041338],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018253604,0.000068260204,0.00017047235,0.000051688097,0.0000181936,0.0000012468533,0.00012521553,0.000038870534,0.0002910913],"category_scores_gemma":[0.0007811315,0.000033325254,0.000050523795,0.000076468204,0.00012276093,0.000036728034,0.00004933545,0.000021267984,0.0000027935844],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000044930315,0.00005563951,0.0023679116,0.0001199821,0.00004531196,0.000001292074,0.0006547931,2.2438341e-7,0.030526955,0.95838565,0.0027420172,0.0050553167],"study_design_scores_gemma":[0.00029408067,0.00005082912,0.0028104354,0.0000507875,0.00001995454,0.000002530244,0.00003884404,0.0000020935026,0.31999344,0.67610997,0.00055764784,0.00006941294],"about_ca_topic_score_codex":0.0000030330564,"about_ca_topic_score_gemma":0.000008436333,"teacher_disagreement_score":0.28946647,"about_ca_system_score_codex":0.0000032159205,"about_ca_system_score_gemma":0.000012765997,"threshold_uncertainty_score":0.31872457},"labels":[],"label_agreement":null},{"id":"W3100427284","doi":"","title":"Loose Hamiltonian cycles forced by large (k-2)-degree - sharp version","year":2018,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Hypergraph; Mathematics; Combinatorics; Hamiltonian path; Hamiltonian (control theory); Degree (music); Upper and lower bounds; Discrete mathematics; Mathematical analysis; Physics; Graph; Mathematical optimization","score_opus":0.0222772638909818,"score_gpt":0.32917001272122837,"score_spread":0.3068927488302466,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3100427284","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39925566,0.00046704043,0.537957,0.002553426,0.0012720141,0.002697898,0.009693929,0.0010265161,0.045076538],"genre_scores_gemma":[0.97395134,0.000014459472,0.021626513,0.0004682545,0.00035932666,0.00007137715,0.00014928888,0.00008520816,0.0032742217],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99752074,0.00009557219,0.0006549743,0.00043842918,0.0004726266,0.0008176341],"domain_scores_gemma":[0.9973563,0.0005006099,0.00023530738,0.0011010143,0.00045911164,0.00034766653],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007617291,0.0004016867,0.0005455475,0.00017625533,0.0012321016,0.00012453599,0.00066916656,0.0002452165,0.0008366462],"category_scores_gemma":[0.0020344655,0.00032787546,0.00025036503,0.00042827096,0.00026693055,0.00018845357,0.00051110703,0.0002522739,0.00039848837],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000041440017,0.00017483569,0.000055666904,0.00009778592,0.0001173291,0.0000047503004,0.0023327773,5.493972e-7,0.0021520113,0.8778206,0.11667119,0.00053102843],"study_design_scores_gemma":[0.0016631241,0.00027163958,0.00020262793,0.00026206477,0.00024590272,0.000024975829,0.0006722788,0.002058734,0.010160009,0.90952486,0.0741618,0.0007519764],"about_ca_topic_score_codex":0.0000047269477,"about_ca_topic_score_gemma":0.00002778578,"teacher_disagreement_score":0.5746957,"about_ca_system_score_codex":0.0001614504,"about_ca_system_score_gemma":0.00004689102,"threshold_uncertainty_score":0.9999173},"labels":[],"label_agreement":null},{"id":"W3126958331","doi":"10.1016/j.disc.2021.112319","title":"On Aharoni’s rainbow generalization of the Caccetta–Häggkvist conjecture","year":2021,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada; Horizon 2020 Framework Programme; Rutgers, The State University of New Jersey; Natural Sciences and Engineering Research Council of Canada; Grantová Agentura, Univerzita Karlova; Division of Mathematical Sciences; National Science Foundation","keywords":"Conjecture; Combinatorics; Digraph; Rainbow; Mathematics; Generalization; Graph; Physics","score_opus":0.02114310221355421,"score_gpt":0.2860546249544033,"score_spread":0.2649115227408491,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3126958331","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9514996,0.00022277627,0.016400449,0.0009484465,0.0010003707,0.00067505625,0.00015443219,0.00011962624,0.028979292],"genre_scores_gemma":[0.9868285,0.000016494716,0.010398585,0.00041677733,0.00010628703,0.000013091015,0.000018101966,0.000058112946,0.0021440568],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984858,0.00013103767,0.00047747747,0.00022410437,0.0004476433,0.00023391085],"domain_scores_gemma":[0.9980236,0.00048393355,0.0003297535,0.0009784331,0.00013327306,0.00005097908],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027216205,0.00023251429,0.00036974146,0.000045396253,0.00026294118,0.00004099358,0.0003870032,0.00013487028,0.00032382278],"category_scores_gemma":[0.001004815,0.00014043215,0.00026342846,0.00028645276,0.00016071493,0.00004533793,0.00020731807,0.00020709162,0.000003995556],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006183602,0.00007063141,0.00007821649,0.0003342512,0.00007356551,0.000004595523,0.0026075826,0.00008967821,0.00061721524,0.9924351,0.003574034,0.00010897769],"study_design_scores_gemma":[0.0003639181,0.000027692802,0.000123956,0.00017733373,0.000096025964,0.000027760954,0.00038895098,0.00089984527,0.021947334,0.9749212,0.0008371049,0.00018884153],"about_ca_topic_score_codex":0.0000019847996,"about_ca_topic_score_gemma":0.000009589968,"teacher_disagreement_score":0.03532894,"about_ca_system_score_codex":0.00003431379,"about_ca_system_score_gemma":0.000060000864,"threshold_uncertainty_score":0.5726657},"labels":[],"label_agreement":null},{"id":"W3127639217","doi":"10.48550/arxiv.1910.10074","title":"Improved bounds on the dimensions of sets that avoid approximate\\n arithmetic progressions","year":2019,"lang":"en","type":"article","venue":"arXiv (Cornell University)","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Mathematics; Hausdorff dimension; Dimension (graph theory); Infimum and supremum; Packing dimension; Effective dimension; Fourier analysis; Upper and lower bounds; Arithmetic; Discrete mathematics; Minkowski–Bouligand dimension; Real line; Combinatorics; Fourier transform; Mathematical analysis; Fractal dimension; Fractal","score_opus":0.07348379072963561,"score_gpt":0.21433505322710275,"score_spread":0.14085126249746716,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3127639217","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9917786,0.000018324408,0.00048380412,0.00008261272,0.00023670765,0.0004903431,0.000014424078,0.00007092234,0.006824257],"genre_scores_gemma":[0.99754167,0.000022561608,0.00030471818,0.00009264558,0.000012972583,0.0000012008406,0.0000024957565,0.000022727887,0.0019990318],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989973,0.00014669604,0.0001491001,0.00033858462,0.00010000405,0.00026837384],"domain_scores_gemma":[0.9980881,0.00068743894,0.00018903374,0.0008856175,0.000072109506,0.00007767857],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002998621,0.0001883295,0.00024610027,0.000114577226,0.00031811497,0.000017834625,0.000457263,0.00011607682,0.00019298258],"category_scores_gemma":[0.00010864064,0.00011093572,0.00017318109,0.00032748206,0.00024301808,0.00009236651,0.00024817724,0.00027269975,0.000019394265],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007877347,0.0001407897,0.002976728,0.00006346326,0.00008955569,0.000011309967,0.000472726,0.000130111,0.00068090466,0.9949338,0.00033310952,0.00008871632],"study_design_scores_gemma":[0.0009898054,0.00027133338,0.001018342,0.00017972413,0.00016920164,0.000008642043,0.0015677238,0.025971504,0.0045921193,0.9642813,0.00058338844,0.0003669002],"about_ca_topic_score_codex":0.000008189279,"about_ca_topic_score_gemma":0.0000051322063,"teacher_disagreement_score":0.030652497,"about_ca_system_score_codex":0.000035186655,"about_ca_system_score_gemma":0.000032798675,"threshold_uncertainty_score":0.45238274},"labels":[],"label_agreement":null},{"id":"W3127936178","doi":"10.1112/plms.12504","title":"Erdős–Hajnal for graphs with no 5‐hole","year":2023,"lang":"en","type":"article","venue":"Proceedings of the London Mathematical Society","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Air Force Office of Scientific Research; Engineering and Physical Sciences Research Council; Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Combinatorics; Mathematics; Split graph; Conjecture; Cardinality (data modeling); Induced subgraph; Graph; Complement (music); Clique; Cograph; Existential quantification; Graph factorization; Block graph; Distance-hereditary graph; Discrete mathematics; Line graph; Pathwidth; Graph power; Computer science; Chemistry; Gene","score_opus":0.024457748549960513,"score_gpt":0.27554244764303004,"score_spread":0.2510846990930695,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3127936178","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9897062,0.000015072281,0.0006808345,0.00079044106,0.00014872164,0.0010728093,0.000030381016,0.00027241537,0.0072831195],"genre_scores_gemma":[0.9070775,0.000027362094,0.087739766,0.00033723845,0.00020915043,0.00024550536,0.0000026175912,0.00012397207,0.0042369096],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983222,0.000005201239,0.00041386596,0.0002838925,0.0005321751,0.0004426845],"domain_scores_gemma":[0.9983724,0.0006631678,0.0002859395,0.00022785756,0.00036513965,0.00008554826],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008702636,0.00024624748,0.00043475628,0.00003637305,0.0003999325,0.000045262117,0.00064426963,0.0001564247,0.00005832929],"category_scores_gemma":[0.0007056168,0.00013282678,0.0006164321,0.0005593782,0.00040001667,0.00011489402,0.00029635255,0.0002406038,0.000013271966],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006312157,0.00008147973,0.00043959063,0.0017776581,0.00017272115,1.1652671e-7,0.0030370774,0.000001306451,0.0025499107,0.9565383,0.035222445,0.000116230956],"study_design_scores_gemma":[0.00064429943,0.0001055234,0.00017452677,0.000204387,0.000137191,0.0000074991235,0.0008751322,0.0013048169,0.0075662993,0.98811334,0.0006695181,0.00019743534],"about_ca_topic_score_codex":6.41873e-7,"about_ca_topic_score_gemma":1.6195594e-7,"teacher_disagreement_score":0.087058924,"about_ca_system_score_codex":0.000028128141,"about_ca_system_score_gemma":0.000021059815,"threshold_uncertainty_score":0.54165184},"labels":[],"label_agreement":null},{"id":"W3128316582","doi":"10.37236/10225","title":"Paths of Length Three are $K_{r+1}$-Tur\\'an Good","year":2021,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Mathematics; Conjecture; Combinatorics; Graph; Path (computing); Computer science","score_opus":0.11617692218006735,"score_gpt":0.21562657361486448,"score_spread":0.09944965143479713,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3128316582","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98114717,0.00016018226,0.00981027,0.0000146226885,0.0007291587,0.00030769143,0.00010172717,0.00014556984,0.0075836303],"genre_scores_gemma":[0.99725765,0.00015395379,0.0015576705,0.000037704336,0.00013945726,8.726104e-7,0.000033791406,0.000060154907,0.00075872487],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997916,0.0002442821,0.00037009883,0.00094311783,0.00016191893,0.00036460624],"domain_scores_gemma":[0.9966403,0.00027649867,0.0006518033,0.0019453205,0.00030650976,0.00017951573],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00034812576,0.00045758137,0.000788107,0.00022316755,0.00020205072,0.000046623845,0.0011441984,0.0006188869,0.00030202957],"category_scores_gemma":[0.00016152147,0.0004700102,0.00050845137,0.0003159837,0.00025778133,0.0001785402,0.0017093583,0.0008813512,0.0000044780973],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000811707,0.00031812218,0.014866047,0.0007353661,0.00049461116,0.00041412364,0.0013317245,0.003098459,0.00006628038,0.9780422,0.0001533211,0.00039859503],"study_design_scores_gemma":[0.000616646,0.00007982125,0.0042913957,0.000365108,0.00047856182,0.0000116189385,0.0017611696,0.0038072956,0.0004980373,0.9872702,0.00015546601,0.00066468463],"about_ca_topic_score_codex":0.00008854298,"about_ca_topic_score_gemma":0.00042005721,"teacher_disagreement_score":0.016110523,"about_ca_system_score_codex":0.000101748185,"about_ca_system_score_gemma":0.00014452552,"threshold_uncertainty_score":0.9997752},"labels":[],"label_agreement":null},{"id":"W3139441217","doi":"10.1007/s12220-022-01176-8","title":"Corona Decompositions for Parabolic Uniformly Rectifiable Sets","year":2023,"lang":"fr","type":"article","venue":"Journal of Geometric Analysis","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"Division of Mathematical Sciences; Division of Materials Research; Vetenskapsrådet","keywords":"Mathematics; Corona (planetary geology); Work (physics); Pure mathematics; Sigma; Mathematical analysis; Physics; Quantum mechanics","score_opus":0.041400829401055925,"score_gpt":0.3423993945630082,"score_spread":0.3009985651619523,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3139441217","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7655942,0.02347334,0.19682634,0.0034679414,0.005555736,0.00073541206,0.0006989387,0.00008663586,0.0035614427],"genre_scores_gemma":[0.9273199,0.007767304,0.036142893,0.00021886038,0.0010232262,0.000021971186,0.000062877145,0.00008122072,0.027361782],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99691415,0.00019787814,0.001384086,0.00023843578,0.0006507915,0.0006146316],"domain_scores_gemma":[0.99365777,0.0032545507,0.0013721588,0.00045457867,0.00095992046,0.00030104423],"candidate_categories":["bibliometrics"],"consensus_categories":[],"category_scores_codex":[0.0027857998,0.0002871616,0.0011973382,0.0080727,0.00061929296,0.00012515628,0.0005323818,0.00027515087,0.0008990044],"category_scores_gemma":[0.0017595667,0.00024515978,0.0019914396,0.023201184,0.00014220215,0.00031715602,0.00011302126,0.00044371185,0.00004144718],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006530556,0.0015366732,0.030463886,0.0015399542,0.080297865,0.00042573278,0.0039179167,0.082987405,0.00014411587,0.2564755,0.30285323,0.23870465],"study_design_scores_gemma":[0.0027233039,0.0011897687,0.03239983,0.00027232364,0.04950708,0.0004644944,0.0021784545,0.035119563,0.00041213163,0.6701156,0.2046414,0.00097608374],"about_ca_topic_score_codex":0.00004644893,"about_ca_topic_score_gemma":0.000025313027,"teacher_disagreement_score":0.41364005,"about_ca_system_score_codex":0.00021175774,"about_ca_system_score_gemma":0.00014510204,"threshold_uncertainty_score":0.9997326},"labels":[],"label_agreement":null},{"id":"W3143193920","doi":"10.1016/j.jctb.2023.09.002","title":"Intersecting families of sets are typically trivial","year":2023,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Lemma (botany); Combinatorics; Mathematics; Graph; Container (type theory); Discrete mathematics; Biology","score_opus":0.02700673949303215,"score_gpt":0.2992173281957878,"score_spread":0.2722105887027556,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3143193920","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98779625,0.000058896978,0.00012618124,0.00009220345,0.0093799215,0.00009032577,0.000008478255,0.000047691203,0.0024000786],"genre_scores_gemma":[0.99848616,0.000058812573,0.00055455585,0.000021474909,0.00066250795,0.0000012207109,5.749574e-7,0.000028103628,0.00018656261],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981161,0.00036102845,0.0007927847,0.0001039634,0.0004084117,0.00021773182],"domain_scores_gemma":[0.996936,0.0014456701,0.00094311486,0.00023862094,0.00035874345,0.00007785181],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021112487,0.00016873975,0.00057293207,0.0002754942,0.00015567859,0.000026143356,0.00042110708,0.00013343687,0.000092449605],"category_scores_gemma":[0.0026526235,0.00012600867,0.00030182986,0.0003614965,0.00023235122,0.00024242535,0.00017693441,0.00036819084,0.0000022878721],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001965717,0.00006159311,0.00047270372,0.000107112675,0.0002001288,0.000047124126,0.0037646224,0.0000055431856,0.0007325267,0.9900273,0.0013045169,0.0013111051],"study_design_scores_gemma":[0.0010839971,0.0004825024,0.00074039487,0.00016057948,0.0000665011,0.00006924936,0.005966154,0.0000027793512,0.0035715627,0.986586,0.0011450622,0.00012521999],"about_ca_topic_score_codex":5.7619883e-7,"about_ca_topic_score_gemma":8.4091323e-7,"teacher_disagreement_score":0.010689964,"about_ca_system_score_codex":0.000030823485,"about_ca_system_score_gemma":0.00005728712,"threshold_uncertainty_score":0.5138485},"labels":[],"label_agreement":null},{"id":"W3153372228","doi":"10.1007/s00373-022-02574-z","title":"From One to Many Rainbow Hamiltonian Cycles","year":2022,"lang":"en","type":"article","venue":"Graphs and Combinatorics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Hamiltonian (control theory); Bijection; Hamiltonian path; Bounded function; Transversal (combinatorics); Graph; Discrete mathematics; Mathematical analysis","score_opus":0.027067669601035647,"score_gpt":0.26304833320814464,"score_spread":0.23598066360710898,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3153372228","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99474216,0.00047623165,0.000112031645,0.00033525293,0.00083673483,0.0002107707,0.000078207595,0.0001138467,0.0030947402],"genre_scores_gemma":[0.9975688,0.000048299582,0.0012697406,0.00050635677,0.00003496806,0.000050910592,0.00000788196,0.0000303243,0.0004827319],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987859,0.00009287755,0.00021378777,0.00030283825,0.00034482227,0.00025973533],"domain_scores_gemma":[0.99913514,0.0002042313,0.000070725124,0.00041132426,0.000032495354,0.00014607274],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026144527,0.00016701463,0.00025263702,0.00015168393,0.0007907758,0.000044523757,0.00031176402,0.000052379914,0.00020867928],"category_scores_gemma":[0.000049965864,0.00016255984,0.00008931566,0.0003806419,0.000055294146,0.00004034013,0.00052230246,0.0002561928,0.0000021284225],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002542362,0.00011344049,0.0020574827,0.000014594427,0.000056819692,0.000011983306,0.002424671,0.000001452593,0.00008631906,0.988864,0.0043592905,0.0019845276],"study_design_scores_gemma":[0.00045411589,0.00013340137,0.005604413,0.000007814419,0.000037846236,0.0000055860396,0.00075146527,0.000021807404,0.00010202452,0.9804798,0.012174596,0.00022717292],"about_ca_topic_score_codex":0.000060774248,"about_ca_topic_score_gemma":0.000003670642,"teacher_disagreement_score":0.008384238,"about_ca_system_score_codex":0.000031879008,"about_ca_system_score_gemma":0.000012650545,"threshold_uncertainty_score":0.6628998},"labels":[],"label_agreement":null},{"id":"W3154325236","doi":"10.1016/j.jcta.2021.105464","title":"On the d-cluster generalization of Erdős-Ko-Rado","year":2021,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Generalization; Combinatorics; Conjecture; Mathematics; Intersection (aeronautics); Cluster (spacecraft); Star (game theory); Discrete mathematics; Computer science; Geography; Mathematical analysis","score_opus":0.01749861317644078,"score_gpt":0.26722332841555996,"score_spread":0.24972471523911918,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3154325236","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98136806,0.00032900067,0.0013691622,0.00090435636,0.008513288,0.00017275852,0.000007802377,0.000013787497,0.007321777],"genre_scores_gemma":[0.9975747,0.00007512391,0.0007428023,0.00030032409,0.0006603899,0.0000024720453,8.719201e-7,0.00002515866,0.0006181494],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980095,0.00072784,0.0005955843,0.00009084318,0.00043281048,0.0001433955],"domain_scores_gemma":[0.9969737,0.0014691108,0.00062911713,0.00035807915,0.000519004,0.00005101729],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015534624,0.00014450906,0.00036222435,0.00007045041,0.00018094748,0.000038005204,0.00031890068,0.00010142978,0.00046379465],"category_scores_gemma":[0.0018391376,0.00008531758,0.00024769563,0.00020137668,0.00016368595,0.00015568435,0.000103956525,0.00027004565,8.807259e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00072599214,0.0001005188,0.000025702366,0.000035187142,0.00015008899,0.000016909942,0.0011716229,0.00002608673,0.0008291352,0.99296343,0.0037336848,0.00022161583],"study_design_scores_gemma":[0.0007909634,0.00029338067,0.000030885993,0.00008663321,0.00007490113,0.00010329677,0.0005260093,0.0000052798596,0.021538327,0.9718108,0.0046469998,0.000092520815],"about_ca_topic_score_codex":3.1107277e-7,"about_ca_topic_score_gemma":3.9428167e-7,"teacher_disagreement_score":0.021152653,"about_ca_system_score_codex":0.000029745634,"about_ca_system_score_gemma":0.000088758425,"threshold_uncertainty_score":0.50782263},"labels":[],"label_agreement":null},{"id":"W3158160756","doi":"10.37236/9148","title":"The Normalized Matching Property in Random and Pseudorandom Bipartite Graphs","year":2021,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Bipartite graph; Combinatorics; Mathematics; Pseudorandom number generator; Vertex (graph theory); Partition (number theory); Matching (statistics); Complete bipartite graph; Graph; Discrete mathematics; Algorithm","score_opus":0.011114089322099677,"score_gpt":0.25889803763410435,"score_spread":0.24778394831200468,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3158160756","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9777063,0.018048832,0.0011271066,0.001376011,0.00052287546,0.00019461053,4.6771936e-7,0.00001089489,0.0010129114],"genre_scores_gemma":[0.9915646,0.007824042,0.000035847588,0.000079132755,0.00004690446,0.0000042198085,1.5619122e-7,0.000019193849,0.00042593264],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978865,0.0006067172,0.0005759432,0.0001004213,0.0003601431,0.00047027096],"domain_scores_gemma":[0.99751514,0.0015852677,0.00035772976,0.00029279815,0.00019606626,0.000052981683],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035734342,0.00015381021,0.0003785036,0.00006897139,0.0004884696,0.0000928486,0.00039681568,0.00006175038,0.0000069147154],"category_scores_gemma":[0.0005651114,0.00006287579,0.00015863669,0.00037800905,0.00013311092,0.0001218179,0.000112227135,0.000896914,3.321917e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005377219,0.0000514962,0.0002806018,0.000024859526,0.00012417109,0.000023651568,0.0012921201,0.000008804178,0.00020695622,0.9966674,0.00016733554,0.0006149096],"study_design_scores_gemma":[0.005123625,0.00009936777,0.00011332835,0.000049098566,0.00007992185,0.0005254874,0.00041926646,0.000037460257,0.0007081017,0.98905814,0.003687495,0.00009873113],"about_ca_topic_score_codex":0.000006744146,"about_ca_topic_score_gemma":0.00004056255,"teacher_disagreement_score":0.013858281,"about_ca_system_score_codex":0.00007499562,"about_ca_system_score_gemma":0.00027554092,"threshold_uncertainty_score":0.38966948},"labels":[],"label_agreement":null},{"id":"W3159413361","doi":"","title":"The number of perfect matchings, and the sandwich conjectures, of random regular graphs","year":2021,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Combinatorics; Omega; Mathematics; Physics","score_opus":0.03318134980537377,"score_gpt":0.20632016632149425,"score_spread":0.17313881651612048,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3159413361","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9932239,0.0010767962,0.0015270491,0.0000538282,0.00032913624,0.0004515707,0.000024195015,0.000025606774,0.0032878916],"genre_scores_gemma":[0.99736935,0.0017755878,0.00023387866,0.000028057928,0.000030202442,0.0000011733043,0.00000500037,0.000024942185,0.0005318173],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981781,0.0006960316,0.00035145847,0.00042518682,0.00013962985,0.00020959327],"domain_scores_gemma":[0.99565953,0.0024110319,0.0005487984,0.0011221692,0.00020666826,0.000051794097],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011443358,0.0002897816,0.00071576337,0.00006644507,0.0003678656,0.000043106258,0.00073891494,0.00027032365,0.000060208404],"category_scores_gemma":[0.0003510462,0.00016963274,0.00050234975,0.00022136481,0.0013051128,0.000044200035,0.0010788393,0.00059925055,3.1583286e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000830023,0.00002839338,0.0023697133,0.0003573529,0.0006763001,0.00002204821,0.00195368,0.00040033195,0.000035792247,0.9930566,0.0001679488,0.000101812104],"study_design_scores_gemma":[0.0028338972,0.000012339697,0.0004818715,0.00017506744,0.0005777043,0.000019450694,0.001169883,0.0008978957,0.00050337956,0.9930294,0.00010167044,0.00019745028],"about_ca_topic_score_codex":0.00016131892,"about_ca_topic_score_gemma":0.000045487755,"teacher_disagreement_score":0.004145414,"about_ca_system_score_codex":0.000019604415,"about_ca_system_score_gemma":0.000075818585,"threshold_uncertainty_score":0.6917422},"labels":[],"label_agreement":null},{"id":"W3160268110","doi":"10.1007/s00493-023-00055-2","title":"Effective Results on the Size and Structure of Sumsets","year":2023,"lang":"lv","type":"article","venue":"COMBINATORICA","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs; Centre de Recherches Mathématiques","keywords":"Algorithm; Computer science","score_opus":0.015744175514643532,"score_gpt":0.26513998291885726,"score_spread":0.24939580740421374,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3160268110","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98969966,0.0003805317,0.0000013899747,0.00094348774,0.0016209023,0.000827998,0.0003250568,0.00008481261,0.0061161797],"genre_scores_gemma":[0.9987828,0.00019370824,0.000030623396,0.00011464841,0.00008716095,0.000010470545,0.000005653321,0.00004430221,0.00073064776],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99786556,0.00048272868,0.00044240494,0.00040458646,0.00043199267,0.0003727406],"domain_scores_gemma":[0.9882326,0.010313294,0.00032298404,0.00090800313,0.00012746327,0.00009561771],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065115816,0.00032732924,0.00049847487,0.000110410976,0.00046962843,0.000041565894,0.00043934808,0.00026553532,0.000054392647],"category_scores_gemma":[0.004076613,0.00020196554,0.00014235383,0.0007589692,0.00037541176,0.00004015222,0.000425666,0.00053777674,0.000016718719],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002908909,0.00007466244,0.00021095417,0.00032817235,0.00021341893,0.000018792181,0.0056358855,0.000002865228,0.0007858116,0.97445184,0.016173337,0.0018133767],"study_design_scores_gemma":[0.0013313609,0.0005146602,0.02114664,0.00020843832,0.000113116934,0.000006150553,0.00045146403,0.00007240216,0.006056735,0.96738565,0.002472797,0.00024056823],"about_ca_topic_score_codex":0.000010486635,"about_ca_topic_score_gemma":0.0000014793252,"teacher_disagreement_score":0.020935686,"about_ca_system_score_codex":0.00004643143,"about_ca_system_score_gemma":0.00002794476,"threshold_uncertainty_score":0.82359153},"labels":[],"label_agreement":null},{"id":"W3166161324","doi":"10.1017/s0963548322000219","title":"Towards the 0-statement of the Kohayakawa-Kreuter conjecture","year":2022,"lang":"en","type":"article","venue":"Combinatorics Probability Computing","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"UK Research and Innovation","keywords":"Conjecture; Combinatorics; Statement (logic); Mathematics; Graph; Monochromatic color; Function (biology); Discrete mathematics; Physics; Philosophy","score_opus":0.050724031928611975,"score_gpt":0.28393126006565145,"score_spread":0.23320722813703948,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3166161324","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99096304,0.00016573735,0.0010897256,0.0014940996,0.0023700148,0.00097639096,0.000017020717,0.00007662939,0.0028473241],"genre_scores_gemma":[0.9987691,0.0000012863965,0.0008132643,0.00023850458,0.000046753346,0.000022296294,0.0000014164191,0.000021656137,0.000085703905],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972843,0.0007953981,0.0006165903,0.0003108374,0.00067704084,0.00031581125],"domain_scores_gemma":[0.9974809,0.0007686974,0.00042942323,0.0011368361,0.00014412671,0.000039984632],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0027481823,0.00020085106,0.00029700142,0.000035309266,0.0015595064,0.000028073902,0.0012939865,0.000053020838,0.00008033383],"category_scores_gemma":[0.00053735386,0.00011244785,0.00024792133,0.00054996763,0.0002749873,0.00003134232,0.0025940968,0.00068794854,3.4940558e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011306023,0.00016878627,0.0040470315,0.00014064358,0.00005293563,9.780531e-7,0.004743632,0.0005447774,0.000020645586,0.9874937,0.00121984,0.0015557421],"study_design_scores_gemma":[0.0003536632,0.000084800056,0.0025036575,0.000014518341,0.000037441743,0.000013424044,0.000379025,0.0010387563,0.0005381223,0.9907609,0.0041340375,0.00014165086],"about_ca_topic_score_codex":0.00001732008,"about_ca_topic_score_gemma":0.0000020393259,"teacher_disagreement_score":0.0078060613,"about_ca_system_score_codex":0.00022877578,"about_ca_system_score_gemma":0.00011322678,"threshold_uncertainty_score":0.9997403},"labels":[],"label_agreement":null},{"id":"W3171077596","doi":"10.46298/hrj.2019.5113","title":"Set Equidistribution of subsets of (Z/nZ) *","year":2019,"lang":"en","type":"article","venue":"Hardy-Ramanujan Journal","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of Toronto; Harish-Chandra Research Institute","keywords":"Modulo; Mathematics; Coset; Complement (music); Combinatorics; Set (abstract data type); Class (philosophy); Discrete mathematics; Arithmetic; Class number; Computer science; Geometry; Artificial intelligence","score_opus":0.03843723828713595,"score_gpt":0.3131569538145425,"score_spread":0.27471971552740654,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3171077596","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99337596,0.00015951043,0.0013968194,0.00004968456,0.00070139184,0.00013393264,0.00007648354,0.0000147366945,0.004091481],"genre_scores_gemma":[0.9978187,0.00004216485,0.0016891686,0.000021918968,0.00012987063,8.051977e-7,0.0000077033355,0.00001853632,0.00027113745],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984399,0.000131759,0.0006240963,0.0001298518,0.00042123883,0.00025311796],"domain_scores_gemma":[0.9985284,0.00018127912,0.0005880209,0.00036518773,0.0002395411,0.000097539974],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0009070161,0.00014905514,0.00040077098,0.00012298393,0.00009645497,0.000020682592,0.00033053194,0.000112830705,0.0012323221],"category_scores_gemma":[0.00021916837,0.00011599822,0.00024914657,0.00013401725,0.000107139924,0.00013081284,0.00009098418,0.0003176066,0.000016943508],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00048924284,0.00021093858,0.03240201,0.00079231715,0.0005107394,0.00003855275,0.0065986067,0.000063298685,0.028448002,0.9102476,0.017116439,0.0030822488],"study_design_scores_gemma":[0.0018825076,0.00042347316,0.009500912,0.00034659,0.00014834426,0.0004866024,0.0010568551,0.00013190003,0.05259124,0.929044,0.0040555913,0.00033196353],"about_ca_topic_score_codex":0.0000016748571,"about_ca_topic_score_gemma":6.0648955e-7,"teacher_disagreement_score":0.024143238,"about_ca_system_score_codex":0.00003409756,"about_ca_system_score_gemma":0.000046374913,"threshold_uncertainty_score":0.9996807},"labels":[],"label_agreement":null},{"id":"W3173056581","doi":"10.1090/proc/15674","title":"Counting solvable 𝑆-unit equations","year":2021,"lang":"en","type":"article","venue":"Proceedings of the American Mathematical Society","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Australian Research Council; Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Annotation; Algorithm; Computer science; Semantics (computer science); Type (biology); Class (philosophy); Artificial intelligence; Programming language; Biology","score_opus":0.03375398147477771,"score_gpt":0.2984451555131959,"score_spread":0.2646911740384182,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3173056581","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9614514,0.000041207935,0.0035118163,0.0010327504,0.000073743446,0.00020941386,0.0000088464985,0.00010034953,0.033570457],"genre_scores_gemma":[0.8996,0.000017300987,0.09853563,0.00050352525,0.00008725963,0.000018796469,4.9438944e-7,0.000035711997,0.001201246],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99852705,0.000015260859,0.00042874378,0.00022868806,0.00048325091,0.00031700387],"domain_scores_gemma":[0.99791664,0.0008232165,0.00052258896,0.00024612562,0.00042367177,0.00006774021],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006033908,0.00017306859,0.00044085723,0.000015574396,0.00043850808,0.00005491148,0.00047333233,0.00005398637,0.00016015468],"category_scores_gemma":[0.0022091023,0.00011506928,0.00048306579,0.00067034573,0.00068084855,0.000112060196,0.00048206816,0.000268178,0.0000053708136],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004161856,0.0001147749,0.0013263349,0.00036005425,0.00012546273,1.6883365e-7,0.0023607833,9.480327e-7,0.0075331777,0.9846546,0.0032531645,0.00026634493],"study_design_scores_gemma":[0.00013505852,0.000019176267,0.0004177356,0.0001096251,0.000117889336,0.000014275697,0.004714984,0.0011453803,0.011832362,0.9809644,0.00037233494,0.00015676462],"about_ca_topic_score_codex":0.0000037764382,"about_ca_topic_score_gemma":3.69419e-7,"teacher_disagreement_score":0.09502381,"about_ca_system_score_codex":0.00003189154,"about_ca_system_score_gemma":0.00004562284,"threshold_uncertainty_score":0.46923888},"labels":[],"label_agreement":null},{"id":"W3177061711","doi":"10.1017/s0963548321000250","title":"Triangle-free subgraphs with large fractional chromatic number","year":2021,"lang":"en","type":"article","venue":"Combinatorics Probability Computing","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Chromatic scale; Mathematics; Combinatorics","score_opus":0.029466258867352248,"score_gpt":0.2874517273114743,"score_spread":0.257985468444122,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3177061711","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97091895,0.00013664017,0.013074848,0.0002527389,0.0009822539,0.00042861077,0.000011692623,0.00030904863,0.013885224],"genre_scores_gemma":[0.9792458,0.0000031332456,0.020314408,0.000114304195,0.000115695155,0.000010285458,0.000012899792,0.000044209657,0.00013926455],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973417,0.00036620253,0.00058728724,0.0005741216,0.0006046018,0.00052607304],"domain_scores_gemma":[0.9961783,0.0016066765,0.0002864938,0.0012643815,0.00051961216,0.00014448927],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013184934,0.00030520553,0.0005443585,0.00006234532,0.0007398165,0.00009286311,0.00048443023,0.00016597935,0.00024057347],"category_scores_gemma":[0.0023140586,0.00025842193,0.00021821105,0.0008120417,0.00014037518,0.00014675279,0.00060457556,0.0005170781,0.00000978586],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025273877,0.00056753965,0.023917304,0.00035767377,0.00010868983,0.00003963121,0.00074191985,0.000015974983,0.000011568523,0.97338516,0.0005014366,0.0003278398],"study_design_scores_gemma":[0.0019347592,0.00005434293,0.00439232,0.00010281778,0.00006559083,0.00013944489,0.00015291075,0.0008782487,0.00032602853,0.9907768,0.00084144913,0.00033533794],"about_ca_topic_score_codex":0.0000047655626,"about_ca_topic_score_gemma":0.000012349723,"teacher_disagreement_score":0.019524984,"about_ca_system_score_codex":0.00016078619,"about_ca_system_score_gemma":0.00017865302,"threshold_uncertainty_score":0.9999868},"labels":[],"label_agreement":null},{"id":"W3181044363","doi":"10.1016/j.jctb.2022.04.004","title":"Structure in sparse k-critical graphs","year":2022,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Combinatorics; Disjoint sets; Conjecture; Mathematics; Corollary; Graph; Upper and lower bounds; Discrete mathematics","score_opus":0.017049024680044603,"score_gpt":0.2849124472556697,"score_spread":0.2678634225756251,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3181044363","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98296136,0.00040772976,0.00005303451,0.0002765531,0.014152321,0.00012917351,0.000027031834,0.000021246924,0.0019715535],"genre_scores_gemma":[0.99836916,0.000018215398,0.00095907337,0.00010763436,0.00041407213,0.0000035913224,8.6912667e-7,0.000030352965,0.000097006814],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972713,0.00093382644,0.0007307504,0.00014145461,0.0006323616,0.00029032197],"domain_scores_gemma":[0.9979122,0.0011842375,0.00035002953,0.00029452905,0.000151154,0.00010780468],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0020220152,0.00019328078,0.0004985818,0.00031335684,0.00038660152,0.00003649866,0.0005967252,0.00009017177,0.001391098],"category_scores_gemma":[0.0012879396,0.00015937637,0.00022790715,0.00037183255,0.0002544074,0.00029999603,0.0002926924,0.0010162765,3.1667867e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016373862,0.0001385981,0.0003677941,0.000028849332,0.000056518915,0.00019652517,0.0017608304,0.000021827953,0.00029067168,0.99419606,0.0010014025,0.000303513],"study_design_scores_gemma":[0.0012271403,0.0006334698,0.0001731246,0.000021027914,0.000045403463,0.0005861911,0.001606367,0.0000016286002,0.0006858292,0.98851293,0.0063312766,0.0001755848],"about_ca_topic_score_codex":9.4141046e-7,"about_ca_topic_score_gemma":0.000001035693,"teacher_disagreement_score":0.015407829,"about_ca_system_score_codex":0.0000980683,"about_ca_system_score_gemma":0.00009396155,"threshold_uncertainty_score":0.9995218},"labels":[],"label_agreement":null},{"id":"W3184514170","doi":"10.1002/jgt.22880","title":"Polynomial bounds for chromatic number. I. Excluding a biclique and an induced tree","year":2022,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation; Joint Information Systems Committee; Air Force Office of Scientific Research; Engineering and Physical Sciences Research Council; University of Oxford","keywords":"Degeneracy (biology); Combinatorics; Mathematics; Bipartite graph; Complete bipartite graph; Chromatic polynomial; Bounded function; Chromatic scale; Tree (set theory); Discrete mathematics; Induced subgraph; Graph","score_opus":0.049676968357494494,"score_gpt":0.3495251988836877,"score_spread":0.29984823052619325,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3184514170","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.996316,0.00021684005,0.0010252383,0.00011151123,0.00078817253,0.00023303049,0.000016745926,0.000025577378,0.0012668888],"genre_scores_gemma":[0.9942925,0.000018977438,0.0048736082,0.00023227293,0.0004151141,0.00002080001,0.0000011732659,0.000046570865,0.00009899686],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980684,0.0005438828,0.0006298206,0.00016692665,0.00032131205,0.00026966387],"domain_scores_gemma":[0.9977393,0.0011031004,0.0006502286,0.0002676728,0.000092103444,0.00014755137],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034279344,0.00019465899,0.0004552994,0.00031410676,0.0008137758,0.00006139286,0.00040087808,0.000079567515,0.00016621873],"category_scores_gemma":[0.0004185766,0.00015705601,0.0002939777,0.00021099043,0.00013449854,0.00024574588,0.00015462589,0.0004548908,1.8220223e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002208596,0.00039751205,0.001283112,0.00024522093,0.00063954183,0.00006468872,0.013264652,0.000007667662,0.016362293,0.9438685,0.0084499065,0.013208306],"study_design_scores_gemma":[0.0015171019,0.0008803579,0.00064556225,0.000037646583,0.00016124672,0.0007820531,0.002523653,0.000043151722,0.0007619686,0.99149793,0.00093866774,0.00021067294],"about_ca_topic_score_codex":0.000002100125,"about_ca_topic_score_gemma":0.000003113881,"teacher_disagreement_score":0.047629416,"about_ca_system_score_codex":0.00006222755,"about_ca_system_score_gemma":0.00007778113,"threshold_uncertainty_score":0.6404558},"labels":[],"label_agreement":null},{"id":"W3189029205","doi":"10.37236/10808","title":"Linear Bounds for Cycle-Free Saturation Games","year":2022,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada; European Commission; Simon Fraser University; National Science Foundation","keywords":"Combinatorics; Graph; Mathematics; Saturation (graph theory); Discrete mathematics; Order (exchange)","score_opus":0.014884470986452328,"score_gpt":0.28082531278704087,"score_spread":0.2659408418005885,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3189029205","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9566663,0.0067051123,0.027696595,0.0035153048,0.0032881573,0.00057923066,0.0000160184,0.000051106563,0.0014821587],"genre_scores_gemma":[0.998687,0.00014768948,0.00017844321,0.00013479752,0.00025024617,0.000013008739,0.0000012983116,0.00002837953,0.0005590932],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99845815,0.0001945913,0.00040952925,0.0000848219,0.00047566686,0.0003772191],"domain_scores_gemma":[0.9981571,0.0007225046,0.00051164115,0.00038224203,0.00018859735,0.000037959773],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020787444,0.00012405559,0.00023877561,0.00009473142,0.00076644256,0.000026372643,0.000884708,0.000040166364,0.00003195854],"category_scores_gemma":[0.00051329954,0.00008263365,0.00022227607,0.00023641215,0.00005261342,0.000090097696,0.00017594677,0.0007993583,2.1925231e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016981596,0.00007309628,0.000017120548,0.000014645354,0.00010958744,0.0000015820964,0.0007674856,0.00009109622,0.000069277805,0.9927097,0.0055317916,0.00044482294],"study_design_scores_gemma":[0.0010899607,0.000832719,0.000021773585,0.000004863134,0.000104405524,0.00019711882,0.0003314789,0.00031095877,0.00033911498,0.96277523,0.033893816,0.00009854325],"about_ca_topic_score_codex":7.881125e-7,"about_ca_topic_score_gemma":0.0000013827597,"teacher_disagreement_score":0.042020727,"about_ca_system_score_codex":0.0003060524,"about_ca_system_score_gemma":0.0002459445,"threshold_uncertainty_score":0.5894934},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.02510234087633091,"score_gpt":0.3033898950029553,"score_spread":0.2782875541266244,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3193900015","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9939832,0.00006934268,0.0014905077,0.0005429619,0.0004257103,0.0003888471,0.00008485245,0.000120395845,0.002894167],"genre_scores_gemma":[0.9835023,0.000099679106,0.015636101,0.000058799626,0.00013525196,0.0000049458226,0.000006709317,0.0000842466,0.00047195735],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99761736,0.00014376294,0.000707114,0.00018804347,0.0008515885,0.00049215055],"domain_scores_gemma":[0.9971347,0.0012629055,0.0006171843,0.0006788783,0.0001545893,0.00015174327],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008192676,0.00031238407,0.00048623068,0.00014895941,0.0008029052,0.00015843262,0.000641184,0.00013673013,0.00008280171],"category_scores_gemma":[0.00055835716,0.0001481033,0.00020622964,0.00043127037,0.0003745846,0.00009146873,0.00014598732,0.0006555428,0.000009471017],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027189392,0.000054328284,0.00011870921,0.00031324918,0.00029442203,0.000046835525,0.0028903135,0.000049433904,0.00026090592,0.9912812,0.0038020501,0.0006166306],"study_design_scores_gemma":[0.00058911054,0.00026702558,0.00027747123,0.00026092835,0.00009501411,0.00034801703,0.0014826064,0.0009454128,0.0010249967,0.9936986,0.0007866011,0.00022422502],"about_ca_topic_score_codex":3.139413e-7,"about_ca_topic_score_gemma":0.0000055428827,"teacher_disagreement_score":0.014145594,"about_ca_system_score_codex":0.000036917612,"about_ca_system_score_gemma":0.000060473674,"threshold_uncertainty_score":0.6175379},"labels":[],"label_agreement":null},{"id":"W3194363807","doi":"10.48550/arxiv.2108.07692","title":"An Extension of the Erd\\H{o}s-Ko-Rado Theorem to uniform set partitions","year":2021,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; University of Regina","funders":"","keywords":"Partition (number theory); Combinatorics; Mathematics; Extension (predicate logic); Block (permutation group theory); Discrete mathematics; Computer science","score_opus":0.1076420977456224,"score_gpt":0.23734738041684145,"score_spread":0.12970528267121906,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3194363807","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9866586,0.000021150245,0.008138451,0.000075671625,0.0006521262,0.0004147591,0.00012797616,0.00008079434,0.0038305188],"genre_scores_gemma":[0.9980832,0.000050537936,0.0009553456,0.00015340206,0.000073369476,0.000001175193,0.000027236223,0.000035190933,0.00062058057],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998339,0.0003134522,0.00027823113,0.00065351644,0.00013710033,0.0002786743],"domain_scores_gemma":[0.99687445,0.00017654595,0.00028147883,0.0022231867,0.00028421768,0.00016009908],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036738408,0.00029899098,0.00041418767,0.00015367098,0.0003439925,0.000039900773,0.0010706118,0.0003122929,0.00021678925],"category_scores_gemma":[0.00017869835,0.0002372371,0.00038053736,0.00048564564,0.00024945952,0.00011492077,0.0015349688,0.0005381386,0.0000047870194],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000048605674,0.00012990405,0.0011232352,0.0001483114,0.00012618113,0.000050298688,0.0019038287,0.017141761,0.0002319892,0.9784464,0.00052254525,0.00012690852],"study_design_scores_gemma":[0.00024873577,0.000054321637,0.0032666787,0.00028395688,0.00028532377,0.000008001651,0.0019267467,0.0037099388,0.0011133569,0.9884926,0.00025107825,0.00035927707],"about_ca_topic_score_codex":0.00004808634,"about_ca_topic_score_gemma":0.00013240337,"teacher_disagreement_score":0.013431823,"about_ca_system_score_codex":0.00008974042,"about_ca_system_score_gemma":0.00012450486,"threshold_uncertainty_score":0.96742475},"labels":[],"label_agreement":null},{"id":"W3197543708","doi":"10.1109/isit45174.2021.9517992","title":"Type Graphs and Small-Set Expansion","year":2021,"lang":"en","type":"article","venue":"","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"William and Flora Hewlett Foundation; National Science Foundation","keywords":"Complete bipartite graph; Bipartite graph; Combinatorics; Mathematics; Graph; Discrete mathematics","score_opus":0.05645692729191395,"score_gpt":0.29975818675062227,"score_spread":0.2433012594587083,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3197543708","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9751846,0.00024378045,0.00018647804,0.00008977325,0.00023073227,0.00004038913,0.000001722824,0.0000622321,0.02396027],"genre_scores_gemma":[0.9809932,0.00012201021,0.014800509,0.00035112732,0.000023110764,0.0000012488625,0.0000032369524,0.000012058061,0.0036935052],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995744,0.000033642722,0.000095159296,0.00013115631,0.0000668236,0.00009881998],"domain_scores_gemma":[0.9995314,0.00013902383,0.000018856877,0.0002129923,0.000055844514,0.0000419179],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009600967,0.000069034606,0.000100248886,0.00002603066,0.00009508836,0.000018183002,0.000048194077,0.00005259308,0.00041436916],"category_scores_gemma":[0.00014437012,0.00004966518,0.000030566305,0.00010246647,0.00003673807,0.000024169462,0.00009434152,0.00006395847,0.000003394314],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000068142754,0.000010582256,0.00095020566,0.000027447893,0.000016671182,0.000014557167,0.00042281565,7.293022e-8,0.0010913936,0.9924415,0.0030282685,0.0019896964],"study_design_scores_gemma":[0.0001400548,0.00001937914,0.0012235254,0.000010149215,0.000015500142,0.000027288825,0.00028722125,0.000014670759,0.0050750887,0.99120414,0.0018991376,0.0000838663],"about_ca_topic_score_codex":0.0000028882766,"about_ca_topic_score_gemma":0.000013444544,"teacher_disagreement_score":0.020266764,"about_ca_system_score_codex":0.0000025813238,"about_ca_system_score_gemma":0.000011926868,"threshold_uncertainty_score":0.4537052},"labels":[],"label_agreement":null},{"id":"W3198589245","doi":"10.1093/imrn/rnac183","title":"Rank of Matrices with Entries from a Multiplicative Group","year":2022,"lang":"en","type":"article","venue":"International Mathematics Research Notices","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Mathematics; Multiplicative function; Rank (graph theory); Combinatorics; Group (periodic table); Diagonal; Multiplicative group; Geometry; Mathematical analysis","score_opus":0.09204157074507788,"score_gpt":0.399452728671909,"score_spread":0.30741115792683116,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3198589245","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98264223,0.00027508434,0.0025274479,0.0005336738,0.00024881182,0.00060959544,0.00041023706,0.0000647564,0.012688148],"genre_scores_gemma":[0.94893986,0.000032353204,0.050237883,0.000022072818,0.00009925804,0.00018022886,0.000024720719,0.000033662294,0.00042993223],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99649787,0.0002998027,0.00047753679,0.00030752443,0.002128803,0.00028848587],"domain_scores_gemma":[0.9927797,0.005851916,0.00037404028,0.0004669136,0.00045850026,0.000068931105],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.001599638,0.000163621,0.0003066868,0.00041096352,0.000477779,0.00007245592,0.0012816568,0.000042511117,0.0015685178],"category_scores_gemma":[0.0010240908,0.00012155998,0.000095155454,0.00038148998,0.00040184465,0.00017945522,0.00093288213,0.0004798819,0.000008071891],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003844652,0.0007413003,0.0013800805,0.00019492846,0.0005537345,0.00002580214,0.015211973,0.00011058834,0.0010623634,0.9786915,0.0009439989,0.0006992678],"study_design_scores_gemma":[0.00085053634,0.00024567428,0.00046405563,0.000106628555,0.00004255276,0.000011711343,0.009315566,0.0036578162,0.0023451394,0.9796178,0.0031529907,0.00018954722],"about_ca_topic_score_codex":0.00012311312,"about_ca_topic_score_gemma":0.000031363794,"teacher_disagreement_score":0.047710434,"about_ca_system_score_codex":0.00010037235,"about_ca_system_score_gemma":0.000050203056,"threshold_uncertainty_score":0.99934417},"labels":[],"label_agreement":null},{"id":"W3198893576","doi":"10.5802/alco.169","title":"The Erdős–Ko–Rado theorem for 2-intersecting families of perfect matchings","year":2021,"lang":"en","type":"article","venue":"Algebraic Combinatorics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Perfect graph theorem; Mathematics; Vertex (graph theory); Matching (statistics); Graph; Perfect graph; Strong perfect graph theorem; Extension (predicate logic); Discrete mathematics; Line graph; Computer science; Graph power; Pathwidth","score_opus":0.02013845099307112,"score_gpt":0.28604550546987006,"score_spread":0.26590705447679897,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3198893576","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9875975,0.00093383854,0.0019628596,0.00033452985,0.0020828,0.00033821675,0.000012870778,0.00009263775,0.0066447374],"genre_scores_gemma":[0.9977735,0.000118222386,0.00096937205,0.00009690315,0.00007984462,0.00002638331,0.0000039690926,0.000048591737,0.0008831907],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984794,0.00015431695,0.0004479117,0.0002719483,0.00029221064,0.0003541673],"domain_scores_gemma":[0.9940526,0.0047189975,0.0002441548,0.0006365206,0.00029205164,0.000055657714],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00094177376,0.00021605636,0.00035237198,0.000055701697,0.00070033985,0.00006113404,0.00043698275,0.0001103383,0.000027102911],"category_scores_gemma":[0.00220522,0.0001494277,0.00031070752,0.0003025169,0.0001822376,0.00007221532,0.00028169114,0.0002546115,0.0000013253718],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003137912,0.00005671679,0.00045780133,0.00017258259,0.00012370049,0.0000040302257,0.0036655308,6.6366994e-7,0.0003651008,0.99032784,0.0012521666,0.0035425131],"study_design_scores_gemma":[0.0005327806,0.00009225018,0.00017857403,0.000055903678,0.00007479304,0.000025731904,0.0039668283,0.00010584857,0.010688236,0.9813458,0.0027540491,0.00017924541],"about_ca_topic_score_codex":0.000007300173,"about_ca_topic_score_gemma":0.000011323698,"teacher_disagreement_score":0.010323135,"about_ca_system_score_codex":0.000047063415,"about_ca_system_score_gemma":0.000067454064,"threshold_uncertainty_score":0.6093484},"labels":[],"label_agreement":null},{"id":"W3200572101","doi":"10.82308/25135","title":"On the additive graph generated by a subset of the natural numbers","year":2008,"lang":"en","type":"article","venue":"eScholarship@McGill (McGill)","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Natural (archaeology); Graph; Natural number; Mathematics; Combinatorics; Computer science; Biology","score_opus":0.02062145607227877,"score_gpt":0.23170104631986255,"score_spread":0.21107959024758377,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3200572101","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9728199,0.000099941375,2.5541667e-7,0.000073593845,0.0007405651,0.0005257971,0.0017510355,0.000103471975,0.023885397],"genre_scores_gemma":[0.99712986,0.0000690109,0.00024714603,0.0011445354,0.000028173745,0.000044748205,0.000025994543,0.0000788531,0.0012316944],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99684834,0.00079063466,0.00056685944,0.000489059,0.00078308524,0.0005220411],"domain_scores_gemma":[0.9965868,0.0015307578,0.00041824678,0.0010868441,0.00025466242,0.00012268811],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.00071237277,0.000449902,0.00043848457,0.00010045585,0.0022745142,0.000020911972,0.0010489582,0.00024805695,0.00027888222],"category_scores_gemma":[0.001745251,0.00025009128,0.00045850404,0.00074784015,0.0006090042,0.00020741377,0.00028834224,0.0011999412,0.000020567766],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000106852785,0.00012288224,0.000045016674,0.000020390651,0.00022907283,0.000014459549,0.00005058423,0.000005447835,0.012634319,0.98392695,0.0014607385,0.0013833039],"study_design_scores_gemma":[0.00077487255,0.000098813536,0.00057769875,0.00009210301,0.000093699855,0.00009518324,0.00016254283,0.000018562067,0.21073233,0.7760555,0.010822433,0.00047626623],"about_ca_topic_score_codex":0.000059287777,"about_ca_topic_score_gemma":0.00006507427,"teacher_disagreement_score":0.20787142,"about_ca_system_score_codex":0.0001284289,"about_ca_system_score_gemma":0.00002291503,"threshold_uncertainty_score":0.9999951},"labels":[],"label_agreement":null},{"id":"W3200718045","doi":"","title":"Improved Hoeffding’s Lemma and Hoeffding’s Tail Bounds","year":2021,"lang":"en","type":"article","venue":"International Journal of Statistics and Probability","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Lemma (botany); Mathematics; Combinatorics; Upper and lower bounds; Convexity; Independent and identically distributed random variables; Function (biology); Discrete mathematics; Zero (linguistics); Random variable; Statistics; Mathematical analysis","score_opus":0.02381119268919039,"score_gpt":0.30231212033733684,"score_spread":0.27850092764814643,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3200718045","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.93391156,0.0006468785,0.06113427,0.0008602137,0.0018637144,0.00012006939,0.000297673,0.000013504663,0.0011521024],"genre_scores_gemma":[0.886704,0.0002750372,0.11242331,0.00013441729,0.00030284404,0.0000015252299,0.0000054769225,0.000012688708,0.00014067549],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986823,0.00009884282,0.0005543438,0.00018008414,0.00034503508,0.00013936564],"domain_scores_gemma":[0.9976007,0.0007555289,0.00035776736,0.00013522177,0.0010355315,0.000115286595],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008226127,0.00013690353,0.00026845295,0.00006976442,0.00012800333,0.0001588481,0.0001799211,0.00007042074,0.00011082803],"category_scores_gemma":[0.0018764894,0.00011030323,0.000064300104,0.00005271443,0.00017608055,0.00013508456,0.00018401298,0.00025542773,1.8547766e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018166439,0.00013724122,0.010984224,0.00014544971,0.0003297776,0.0001385973,0.0011238325,0.0000020794382,0.0010485135,0.9538987,0.0015980174,0.030411871],"study_design_scores_gemma":[0.0007179385,0.00012306865,0.006782001,0.00005662172,0.000057318204,0.0005233236,0.00010569769,0.00041209778,0.000505316,0.9873041,0.0032830157,0.00012951976],"about_ca_topic_score_codex":0.000008728832,"about_ca_topic_score_gemma":0.000019846975,"teacher_disagreement_score":0.05128904,"about_ca_system_score_codex":0.000050810864,"about_ca_system_score_gemma":0.00010120933,"threshold_uncertainty_score":0.4498035},"labels":[],"label_agreement":null},{"id":"W3202874536","doi":"10.37236/10781","title":"Density Maximizers of Layered Permutations","year":2022,"lang":"en","type":"preprint","venue":"The Electronic Journal of Combinatorics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Masarykova Univerzita; Grantová Agentura České Republiky; Leverhulme Trust","keywords":"Permutation (music); Bounded function; Combinatorics; Mathematics; Infinity; Sigma; Conjecture; Order (exchange); Cyclic permutation; Random permutation; Complement (music); Discrete mathematics; Symmetric group; Physics; Mathematical analysis; Quantum mechanics","score_opus":0.026909736447748876,"score_gpt":0.30513536184795154,"score_spread":0.2782256254002027,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3202874536","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97829247,0.0039832448,0.01228152,0.0005412564,0.002475118,0.00035529363,0.000017981074,0.000024426297,0.0020286897],"genre_scores_gemma":[0.99843705,0.00096355943,0.00011678035,0.00003531131,0.0000972333,0.000005501866,0.0000028604168,0.000042052143,0.00029964763],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99721247,0.00053211604,0.000883631,0.00015158507,0.0008019267,0.00041828328],"domain_scores_gemma":[0.9959699,0.00090217905,0.0019019063,0.00069710956,0.00046775833,0.00006118103],"candidate_categories":["research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0024130847,0.00025728272,0.0007121966,0.0002118181,0.00034257345,0.000023285378,0.0013641609,0.00016795596,0.00013064645],"category_scores_gemma":[0.0005647522,0.00017934786,0.0005622382,0.0002691622,0.00014961082,0.00004553411,0.00078633724,0.002979418,3.40449e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011202047,0.00013525107,0.00013212701,0.00010993989,0.0005615204,0.000010006605,0.0019644117,0.00056997855,0.000033794142,0.9953047,0.0009331918,0.0001330316],"study_design_scores_gemma":[0.00057872327,0.0002577136,0.00021406135,0.000042597112,0.0004192829,0.00015013645,0.00054486847,0.00007897597,0.00032384833,0.99654526,0.0006781278,0.00016639312],"about_ca_topic_score_codex":0.000008379425,"about_ca_topic_score_gemma":0.0000032387857,"teacher_disagreement_score":0.020144584,"about_ca_system_score_codex":0.0004844669,"about_ca_system_score_gemma":0.0009322861,"threshold_uncertainty_score":0.99932075},"labels":[],"label_agreement":null},{"id":"W3211215452","doi":"10.37236/9556","title":"The Erdős-Ko-Rado Theorem for 2-Pointwise and 2-Setwise Intersecting Permutations","year":2021,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Pointwise; Combinatorics; Mathematics; Sigma; Discrete mathematics; Physics; Mathematical analysis","score_opus":0.015803472235806658,"score_gpt":0.2921658446297687,"score_spread":0.27636237239396205,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3211215452","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.949054,0.012546314,0.031074306,0.0039571235,0.0015570392,0.00034191934,0.000004553884,0.00002718653,0.001437543],"genre_scores_gemma":[0.9981547,0.000993128,0.00012192706,0.00009793606,0.00016314701,0.0000059443305,5.4217986e-7,0.000028799628,0.0004338492],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984606,0.00026291402,0.00046142758,0.000110958565,0.00025756445,0.00044652927],"domain_scores_gemma":[0.9953108,0.0034400944,0.000429758,0.0003078753,0.00045072686,0.00006078493],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022378277,0.00015181676,0.00024830524,0.000048891234,0.00096614205,0.0001054163,0.00040703014,0.000061055536,0.000007588114],"category_scores_gemma":[0.0017062383,0.00008101555,0.00020968654,0.00021652109,0.00016732827,0.000096294374,0.000111421796,0.0006764713,3.0675153e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007323523,0.00003706342,0.000047485202,0.000021905276,0.00018678007,0.0000049484124,0.0024008334,0.000005321779,0.000104759514,0.9952085,0.0004946448,0.00141453],"study_design_scores_gemma":[0.0007557787,0.00022216784,0.000055482295,0.00003443714,0.00017459568,0.00060793414,0.003372917,0.00016395857,0.0008512192,0.9894683,0.0041919793,0.00010126705],"about_ca_topic_score_codex":6.4131643e-7,"about_ca_topic_score_gemma":0.000011230261,"teacher_disagreement_score":0.049100712,"about_ca_system_score_codex":0.0001320655,"about_ca_system_score_gemma":0.0002740253,"threshold_uncertainty_score":0.7430881},"labels":[],"label_agreement":null},{"id":"W3212288097","doi":"10.1016/j.ejc.2023.103845","title":"Weak diameter coloring of graphs on surfaces","year":2023,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Combinatorics; Mathematics; Bounded function; Monochromatic color; Planar graph; Vertex (graph theory); Induced subgraph; Graph; Discrete mathematics; Mathematical analysis","score_opus":0.048343231452040614,"score_gpt":0.28466745918701775,"score_spread":0.23632422773497713,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3212288097","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9737899,0.000098044475,0.000110472974,0.00006090728,0.0017127527,0.00005344543,0.000003161662,0.000034430683,0.024136908],"genre_scores_gemma":[0.99885565,0.00015417628,0.00046594936,0.000023040977,0.00006230225,1.8610729e-7,2.9952812e-7,0.000041157065,0.00039725148],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99829036,0.00041061005,0.0005875595,0.00009299285,0.00043335123,0.00018515551],"domain_scores_gemma":[0.99815875,0.0007350162,0.0005683146,0.00025272704,0.00019854582,0.000086615495],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019988308,0.00013591882,0.00032027616,0.00031510423,0.0001028144,0.000019853605,0.0004253973,0.000026058957,0.00002136083],"category_scores_gemma":[0.0006091861,0.00010135397,0.00020634073,0.0004953209,0.00007815228,0.00007814104,0.00011092073,0.00030394917,0.000011628115],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008102927,0.0001103038,0.0031255188,0.00008991885,0.00013489323,0.00018019165,0.0011569831,0.00007995,0.00051337184,0.9846107,0.008849249,0.0010678865],"study_design_scores_gemma":[0.0011029122,0.0010392651,0.017184583,0.00021554349,0.00006780379,0.00003764163,0.00037535134,0.000025841953,0.0027237823,0.970531,0.006503841,0.00019247488],"about_ca_topic_score_codex":1.7544464e-7,"about_ca_topic_score_gemma":6.283224e-8,"teacher_disagreement_score":0.025065761,"about_ca_system_score_codex":0.00001779061,"about_ca_system_score_gemma":0.000015868876,"threshold_uncertainty_score":0.4133095},"labels":[],"label_agreement":null},{"id":"W3216341204","doi":"10.1007/s00493-021-4671-x","title":"Kissing numbers of regular graphs","year":2019,"lang":"en","type":"article","venue":"ENLIGHTEN (Jurnal Bimbingan dan Konseling Islam)","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Mathematics; Combinatorics; Ramanujan's sum; Upper and lower bounds; Chordal graph; Discrete mathematics; Subsequence; Odd graph; Cayley graph; Graph; 1-planar graph; Bounded function","score_opus":0.016756736738025614,"score_gpt":0.26887224692071876,"score_spread":0.2521155101826931,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3216341204","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9877608,0.0003096662,0.00037246945,0.00010539905,0.0009877563,0.0002678914,0.000010145147,0.00014717653,0.010038737],"genre_scores_gemma":[0.98535603,0.000055524255,0.013333359,0.00012396918,0.00014652203,0.0000036997542,0.0000058928263,0.00008726524,0.0008877248],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99736005,0.00024151382,0.00083414995,0.00047303655,0.0005421477,0.0005491226],"domain_scores_gemma":[0.99763453,0.0006344161,0.0005256089,0.00088650023,0.00017539503,0.0001435475],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011731681,0.00037492515,0.0006524567,0.00036591178,0.00036170086,0.00006911876,0.0006237296,0.00022448802,0.00012097157],"category_scores_gemma":[0.00032514564,0.00031250037,0.00043930917,0.00046717818,0.00019972274,0.00019035456,0.00017474129,0.0005400292,0.00002026926],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017177976,0.0001812423,0.01734669,0.00045178932,0.00048405214,0.000055925324,0.01296858,0.000057097837,0.07379799,0.8895725,0.001987968,0.002924351],"study_design_scores_gemma":[0.0012200763,0.00021219037,0.0015147738,0.0007304778,0.00019070119,0.00015835749,0.0017987182,0.00025873186,0.06303756,0.92768925,0.002470562,0.00071862066],"about_ca_topic_score_codex":0.000015362179,"about_ca_topic_score_gemma":0.0000036428985,"teacher_disagreement_score":0.0381167,"about_ca_system_score_codex":0.000045913184,"about_ca_system_score_gemma":0.000060717226,"threshold_uncertainty_score":0.9999327},"labels":[],"label_agreement":null},{"id":"W35224872","doi":"10.1007/978-1-4614-5392-5_8","title":"How Thin Are Sidon Sets in the Bohr Compactification?","year":2012,"lang":"en","type":"book-chapter","venue":"CMS books in mathematics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; University of British Columbia","funders":"","keywords":"Compactification (mathematics); Bohr model; Mathematics; Physics; Pure mathematics; Quantum mechanics","score_opus":0.08099608464590345,"score_gpt":0.29817335257353483,"score_spread":0.21717726792763137,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W35224872","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0032275103,0.0022511568,0.0005113749,0.0011116245,0.0007382983,0.0022323725,0.00011817583,0.00016796168,0.98964155],"genre_scores_gemma":[0.35171792,0.0007419342,0.035725217,0.0012333272,0.0012891626,0.0002887681,0.00011212329,0.00081307726,0.6080785],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99716765,0.00012898575,0.0009486291,0.00042539564,0.0007993905,0.0005299676],"domain_scores_gemma":[0.99533945,0.001564128,0.0010161229,0.0018778966,0.00010944662,0.00009292569],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0017080877,0.00069932995,0.0010154819,0.00038294442,0.00020982863,0.00026839733,0.0012063427,0.0007265096,0.00016159001],"category_scores_gemma":[0.0005048234,0.0004813593,0.00029203345,0.00007954042,0.00032297123,0.00022976393,0.00022941857,0.0015324806,0.00003864742],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007635904,0.00011317158,0.00005449292,0.000652452,0.000058006386,0.000027807224,0.01219017,0.0000019350866,0.000004630593,0.98114586,0.0050458796,0.0006979825],"study_design_scores_gemma":[0.00027801443,0.000019650408,0.0000954403,0.0009079217,0.00012053517,0.00005385601,0.0016808124,0.00012355138,0.000019846755,0.9697266,0.026439074,0.00053467974],"about_ca_topic_score_codex":0.0000024811013,"about_ca_topic_score_gemma":0.00006613764,"teacher_disagreement_score":0.38156307,"about_ca_system_score_codex":0.00017342772,"about_ca_system_score_gemma":0.000046916062,"threshold_uncertainty_score":0.9997638},"labels":[],"label_agreement":null},{"id":"W37332138","doi":"10.1002/ijgo.14963","title":"On the Intersection of two m-sets and the Erdos-Ginzburg-Ziv Theorem.","year":2007,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Intersection (aeronautics); Integer (computer science); Combinatorics; Sequence (biology); Extension (predicate logic); Discrete mathematics; Computer science","score_opus":0.014840498826867696,"score_gpt":0.2811401410461164,"score_spread":0.2662996422192487,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W37332138","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9774744,0.000061799656,0.00016767195,0.00035028852,0.0014301846,0.00027405765,0.0000019072936,0.00003070966,0.02020896],"genre_scores_gemma":[0.9994679,0.0000075528606,0.00009018342,0.0003022685,0.000014460359,0.00000612421,4.988953e-7,0.000016931126,0.000094056486],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99901265,0.00018906465,0.00025743703,0.00014205533,0.00022086714,0.00017793724],"domain_scores_gemma":[0.99618024,0.003109761,0.00015828671,0.00046018985,0.000058513357,0.000033019336],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002132869,0.00013498889,0.00019384957,0.00004375336,0.00025595605,0.000021159723,0.00026466505,0.000060830313,0.00005251826],"category_scores_gemma":[0.0005055331,0.000064227,0.000094057876,0.00014150856,0.0005046442,0.00003970097,0.000115947885,0.00024918048,0.0000020892426],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019216373,0.00003520235,0.0001777023,0.000012316427,0.000053648695,0.0000016305908,0.00244553,5.1516093e-7,0.00006316514,0.9948282,0.0010992187,0.0010906637],"study_design_scores_gemma":[0.001310919,0.0000707999,0.00052456744,0.000032271117,0.00003613697,0.0000098110795,0.00052036357,0.00006302592,0.00207408,0.9951421,0.0001365764,0.00007931787],"about_ca_topic_score_codex":0.000017680897,"about_ca_topic_score_gemma":0.000008658699,"teacher_disagreement_score":0.021993505,"about_ca_system_score_codex":0.00002314413,"about_ca_system_score_gemma":0.000008527579,"threshold_uncertainty_score":0.2619101},"labels":[],"label_agreement":null},{"id":"W4205331589","doi":"10.4153/s0008439521001053","title":"Kneser’s theorem in -finite abelian groups","year":2022,"lang":"en","type":"article","venue":"Canadian Mathematical Bulletin","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Agence Nationale de la Recherche","keywords":"Mathematics; Abelian group; Combinatorics; Context (archaeology); Group (periodic table); Discrete mathematics; Physics","score_opus":0.021324586958050507,"score_gpt":0.2484465516128063,"score_spread":0.2271219646547558,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4205331589","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.74754417,0.00021179067,0.00061168027,0.0091335885,0.00058647187,0.0010932763,0.00016993842,0.0001933357,0.24045576],"genre_scores_gemma":[0.9928803,0.0000034489724,0.0019038705,0.0019257485,0.00007936762,0.00015877993,0.000010096748,0.000068643036,0.0029697593],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976693,0.00030421803,0.0005221145,0.00036784168,0.00039594944,0.0007405709],"domain_scores_gemma":[0.9977185,0.0010468082,0.000091306356,0.0006407813,0.000031978354,0.000470638],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0013151066,0.00026079247,0.00041037897,0.00042624137,0.00057844183,0.000044621604,0.0006648177,0.00010488217,0.061440337],"category_scores_gemma":[0.0010486582,0.00023852689,0.0001476073,0.00042344627,0.00017020856,0.00002599232,0.0002534522,0.0006323678,0.0008803839],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014378827,0.00006199277,0.00013532332,0.00007321492,0.000017945416,0.00018504474,0.001684404,0.00001792519,0.0000051774305,0.9830712,0.014151794,0.00058161013],"study_design_scores_gemma":[0.00036449722,0.000048266484,0.00012736207,0.000030904677,0.000015531477,0.000063733205,0.0009307962,0.00021243423,0.000010674543,0.92597085,0.071932554,0.00029237644],"about_ca_topic_score_codex":0.00039295212,"about_ca_topic_score_gemma":0.0013546122,"teacher_disagreement_score":0.24533613,"about_ca_system_score_codex":0.0003306097,"about_ca_system_score_gemma":0.00013714032,"threshold_uncertainty_score":0.99989754},"labels":[],"label_agreement":null},{"id":"W4205374221","doi":"10.1016/j.disc.2004.02.004","title":"Ramsey numbers in complete balanced multipartite graphs. Part I: Set numbers","year":2004,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Multipartite; Mathematics; Combinatorics; Ramsey's theorem; Discrete mathematics; Diagonal; Monochromatic color; Graph","score_opus":0.045755448733489204,"score_gpt":0.3082959021620013,"score_spread":0.2625404534285121,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4205374221","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9726621,0.00007847188,0.0044320235,0.0003046333,0.0006161535,0.0009444266,0.00018052146,0.00032099872,0.02046065],"genre_scores_gemma":[0.9456642,0.00004692322,0.05337804,0.00029478152,0.00008846862,0.00007550847,0.000049538812,0.00010990042,0.00029261337],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971357,0.00010363539,0.0009716433,0.00047665974,0.00055531436,0.0007570339],"domain_scores_gemma":[0.99792683,0.0004625085,0.00036136116,0.0009740582,0.00007025429,0.00020500406],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00066877156,0.0004901642,0.0007728035,0.00018799411,0.00025696625,0.000083476574,0.0005716562,0.00022149486,0.00020438687],"category_scores_gemma":[0.00046182572,0.00041057862,0.00030990536,0.00050510676,0.00032490792,0.00020374374,0.00020691346,0.00044446834,0.00006813709],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000040470564,0.00018752091,0.0017896555,0.0004719372,0.00012362332,0.000053763823,0.015168272,0.00025314192,0.00023697258,0.9802916,0.0012665779,0.00011648093],"study_design_scores_gemma":[0.0020183634,0.000047360205,0.00039152495,0.00040436556,0.000068760964,0.000041922412,0.002119458,0.0006153757,0.0004513412,0.99171954,0.0015279683,0.00059403374],"about_ca_topic_score_codex":0.00006053522,"about_ca_topic_score_gemma":0.0002060139,"teacher_disagreement_score":0.04894602,"about_ca_system_score_codex":0.00011321739,"about_ca_system_score_gemma":0.000041636085,"threshold_uncertainty_score":0.9998346},"labels":[],"label_agreement":null},{"id":"W4205569143","doi":"10.37236/10225","title":"Paths of Length Three are $K_{r+1}$-Turán-Good","year":2021,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Combinatorics; Conjecture; Mathematics; Graph; Path (computing); Discrete mathematics; Computer science","score_opus":0.017063377106575683,"score_gpt":0.26180194345081675,"score_spread":0.24473856634424107,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4205569143","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.976992,0.013089622,0.0044253636,0.00070079317,0.0010530727,0.00012029253,0.00000394175,0.000019135465,0.0035957892],"genre_scores_gemma":[0.9983648,0.0009948749,0.000095710115,0.000061332525,0.00014787671,0.0000011431601,3.9488242e-7,0.000031539923,0.00030231068],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979041,0.00023011515,0.00066232414,0.00011828488,0.0006098516,0.0004752728],"domain_scores_gemma":[0.9970562,0.00073255674,0.0009800456,0.00054019206,0.00062211225,0.00006890979],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014091876,0.00019036516,0.000521198,0.00008454312,0.00019139568,0.000023218658,0.0006782138,0.00011586794,0.000053339518],"category_scores_gemma":[0.0006050803,0.0001202461,0.0003310971,0.00040260752,0.00010821136,0.00009919786,0.00014249417,0.0009987114,0.0000011032644],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000046206726,0.00017762973,0.0007608865,0.00005276135,0.0002746121,0.000031680873,0.00051084365,0.000006172443,0.00023964357,0.9967647,0.00053145323,0.00060340314],"study_design_scores_gemma":[0.00082871265,0.0003044537,0.0007096115,0.00007603794,0.00019340163,0.00043833192,0.00044549306,0.000016246413,0.0065897587,0.9883298,0.0019377574,0.0001303954],"about_ca_topic_score_codex":0.0000014710481,"about_ca_topic_score_gemma":0.000013520621,"teacher_disagreement_score":0.021372829,"about_ca_system_score_codex":0.0001435336,"about_ca_system_score_gemma":0.00044243474,"threshold_uncertainty_score":0.49034938},"labels":[],"label_agreement":null},{"id":"W4205624872","doi":"10.1016/j.ejc.2006.06.010","title":"When is a random graph projective?","year":2006,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Korle-Bu Neuroscience Foundation; Ministerstvo Školství, Mládeže a Tělovýchovy","keywords":"Mathematics; Combinatorics; Projective test; Graph; Discrete mathematics; Pure mathematics","score_opus":0.018958885909743716,"score_gpt":0.24955865484453948,"score_spread":0.23059976893479578,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4205624872","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.84732056,0.0010713716,0.016120637,0.0003785635,0.002228685,0.00026769255,0.000006570289,0.0000670071,0.1325389],"genre_scores_gemma":[0.9959474,0.00003258966,0.0025932898,0.00011062457,0.00032886292,4.819929e-7,3.3865462e-7,0.000049655744,0.00093671767],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980055,0.0005599994,0.00066199066,0.000121671095,0.0004384813,0.00021233837],"domain_scores_gemma":[0.9984065,0.00027394612,0.0006188952,0.00026875007,0.00035171796,0.00008017009],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001656595,0.00018049119,0.0003497997,0.00022111765,0.00018357363,0.00005492775,0.00044820414,0.000032299813,0.000064000844],"category_scores_gemma":[0.0002375821,0.0001317665,0.00029135734,0.00022098275,0.00008671971,0.00014015255,0.000087949375,0.0003784923,0.0000067227425],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002296684,0.0002768496,0.0017010692,0.000056774083,0.00014016176,0.00038410487,0.002813232,0.0000030308654,0.00011391932,0.8903574,0.1026522,0.0012716044],"study_design_scores_gemma":[0.0029744655,0.00024400915,0.0013904894,0.000051041763,0.000076895725,0.00020119334,0.00008045416,0.0000047280705,0.00042767095,0.9713576,0.023032758,0.00015873098],"about_ca_topic_score_codex":0.0000013152383,"about_ca_topic_score_gemma":1.9094104e-7,"teacher_disagreement_score":0.14862686,"about_ca_system_score_codex":0.000034555913,"about_ca_system_score_gemma":0.00003163919,"threshold_uncertainty_score":0.5373282},"labels":[],"label_agreement":null},{"id":"W4205747721","doi":"10.1016/s0012-365x(04)00145-1","title":"Ramsey numbers in complete balanced multipartite graphs. Part I: Set numbers","year":2004,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"National Research Foundation","keywords":"Multipartite; Mathematics; Combinatorics; Ramsey's theorem; Discrete mathematics; Diagonal; Monochromatic color; Graph","score_opus":0.045755448733489204,"score_gpt":0.3082959021620013,"score_spread":0.2625404534285121,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4205747721","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9726621,0.00007847188,0.0044320235,0.0003046333,0.0006161535,0.0009444266,0.00018052146,0.00032099872,0.02046065],"genre_scores_gemma":[0.9456642,0.00004692322,0.05337804,0.00029478152,0.00008846862,0.00007550847,0.000049538812,0.00010990042,0.00029261337],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971357,0.00010363539,0.0009716433,0.00047665974,0.00055531436,0.0007570339],"domain_scores_gemma":[0.99792683,0.0004625085,0.00036136116,0.0009740582,0.00007025429,0.00020500406],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00066877156,0.0004901642,0.0007728035,0.00018799411,0.00025696625,0.000083476574,0.0005716562,0.00022149486,0.00020438687],"category_scores_gemma":[0.00046182572,0.00041057862,0.00030990536,0.00050510676,0.00032490792,0.00020374374,0.00020691346,0.00044446834,0.00006813709],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000040470564,0.00018752091,0.0017896555,0.0004719372,0.00012362332,0.000053763823,0.015168272,0.00025314192,0.00023697258,0.9802916,0.0012665779,0.00011648093],"study_design_scores_gemma":[0.0020183634,0.000047360205,0.00039152495,0.00040436556,0.000068760964,0.000041922412,0.002119458,0.0006153757,0.0004513412,0.99171954,0.0015279683,0.00059403374],"about_ca_topic_score_codex":0.00006053522,"about_ca_topic_score_gemma":0.0002060139,"teacher_disagreement_score":0.04894602,"about_ca_system_score_codex":0.00011321739,"about_ca_system_score_gemma":0.000041636085,"threshold_uncertainty_score":0.9998346},"labels":[],"label_agreement":null},{"id":"W4210323931","doi":"10.1016/j.disc.2004.02.013","title":"Polychromatic cliques","year":2004,"lang":"fr","type":"article","venue":"Discrete Mathematics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Mathematics; Combinatorics; Integer (computer science); Enhanced Data Rates for GSM Evolution; Function (biology); Discrete mathematics; Computer science","score_opus":0.022469930234868186,"score_gpt":0.2987121381624522,"score_spread":0.27624220792758397,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4210323931","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.60204446,0.02013059,0.15223008,0.010271778,0.008530427,0.0026032624,0.00043483096,0.0010788428,0.2026757],"genre_scores_gemma":[0.5905975,0.00094036694,0.38369682,0.00080887106,0.0011716342,0.000063967396,0.000029251138,0.0003611495,0.022330442],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99632627,0.00015432261,0.0012894587,0.0005086352,0.0007184228,0.0010028903],"domain_scores_gemma":[0.99686927,0.0006237169,0.0005719111,0.0014491028,0.00013980035,0.00034618072],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0008229186,0.0007455968,0.0009940242,0.0001932818,0.0005808833,0.00020954623,0.0007924467,0.0005307381,0.0011959879],"category_scores_gemma":[0.00078136637,0.00064566947,0.0005744295,0.00041159763,0.00080190145,0.00035934953,0.00043592695,0.00061742193,0.00053503533],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011414278,0.00043764958,0.000028642642,0.0032055504,0.00029734487,0.00008465809,0.018979646,0.000052708536,0.00011511099,0.97378016,0.0015712766,0.0014358439],"study_design_scores_gemma":[0.0009781729,0.00021430477,0.000056487763,0.0020861684,0.0004995133,0.00031720725,0.002351708,0.0005782398,0.0020955123,0.9854814,0.0045544747,0.00078684505],"about_ca_topic_score_codex":0.0000565996,"about_ca_topic_score_gemma":0.000025324587,"teacher_disagreement_score":0.23146673,"about_ca_system_score_codex":0.00026089075,"about_ca_system_score_gemma":0.00015167176,"threshold_uncertainty_score":0.99971706},"labels":[],"label_agreement":null},{"id":"W4213264158","doi":"10.4064/cm8515-6-2021","title":"Additive bases of $C_3\\oplus C_{3q}$","year":2022,"lang":"en","type":"article","venue":"Colloquium Mathematicum","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University","funders":"","keywords":"Mathematics; Combinatorics; Prime (order theory); Abelian group; Sequence (biology); Finite group; Group (periodic table); Discrete mathematics; Physics; Genetics; Biology","score_opus":0.030882096051467255,"score_gpt":0.292061443082943,"score_spread":0.2611793470314758,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4213264158","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8703559,0.00036339444,0.0025120226,0.0003086539,0.0016727527,0.0016443852,0.00097082235,0.00036281854,0.12180923],"genre_scores_gemma":[0.9822382,0.000007735591,0.010596421,0.00019398828,0.000112913585,0.0002796829,0.00001916506,0.00007349996,0.006478412],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976227,0.00025231866,0.0006886237,0.00033205445,0.00071321917,0.0003910732],"domain_scores_gemma":[0.9970441,0.0014213418,0.00048944505,0.0008147343,0.00012910359,0.000101316815],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00081495004,0.00028636146,0.00064066495,0.00021734292,0.0006030939,0.000021702665,0.00063893007,0.000070849244,0.0048925993],"category_scores_gemma":[0.0006675654,0.00024968904,0.00030020153,0.0004848727,0.00021469273,0.00009973578,0.00074901007,0.00029179783,0.000014609293],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000089517336,0.00041018697,0.00005584437,0.00044263568,0.00017598075,0.000032801203,0.0063921926,0.000017554486,0.00089786726,0.9354451,0.055584036,0.00045629195],"study_design_scores_gemma":[0.0007571228,0.00027256508,0.00006785446,0.00007516887,0.00015571619,0.00010183945,0.0047841696,0.00036478808,0.0067530684,0.9733859,0.012896552,0.00038528073],"about_ca_topic_score_codex":0.0000064788974,"about_ca_topic_score_gemma":0.0000043411906,"teacher_disagreement_score":0.11533082,"about_ca_system_score_codex":0.00009699477,"about_ca_system_score_gemma":0.00009037989,"threshold_uncertainty_score":0.9999955},"labels":[],"label_agreement":null},{"id":"W4214590193","doi":"10.1556/012.2004.41.3.2","title":"Counting sumsets and sum-free sets modulo a prime","year":2004,"lang":"en","type":"article","venue":"Studia Scientiarum Mathematicarum Hungarica","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Trinity College","funders":"","keywords":"Modulo; Mathematics; Prime (order theory); Combinatorics; Primitive root modulo n; Prime number; Set (abstract data type); Arithmetic; Discrete mathematics","score_opus":0.022810668304467912,"score_gpt":0.2848202455824304,"score_spread":0.2620095772779625,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4214590193","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9319964,0.0008954104,0.009525205,0.0021218304,0.001111076,0.0015403645,0.000080721504,0.00064463675,0.052084357],"genre_scores_gemma":[0.9448922,0.000029707611,0.05432477,0.00017436488,0.00009400968,0.00004988659,0.000003823061,0.00007660539,0.0003545858],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9963869,0.000104062405,0.0007320803,0.0008176657,0.0010114771,0.00094782445],"domain_scores_gemma":[0.9971431,0.0006080838,0.0003570168,0.0014431073,0.00017913435,0.00026956035],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.001695549,0.00048907084,0.00071524025,0.0003030543,0.0013497525,0.00026330358,0.00093717035,0.00017713738,0.000080429534],"category_scores_gemma":[0.0017913776,0.0003957486,0.00021052934,0.0006566052,0.00066930184,0.00030841623,0.001406492,0.0003935764,0.00003506545],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015666512,0.0002894874,0.000549162,0.00033076786,0.0002584342,0.000026595959,0.007219905,0.0000053610593,0.00072136027,0.9876118,0.0022991328,0.0006723685],"study_design_scores_gemma":[0.0013319865,0.00008154603,0.0014489318,0.00019048221,0.00025105136,0.00009203381,0.00065140065,0.00017362875,0.0011851247,0.99342966,0.00064229977,0.00052185316],"about_ca_topic_score_codex":0.00001650258,"about_ca_topic_score_gemma":0.000033195356,"teacher_disagreement_score":0.05172977,"about_ca_system_score_codex":0.00010154643,"about_ca_system_score_gemma":0.000121941004,"threshold_uncertainty_score":0.99995035},"labels":[],"label_agreement":null},{"id":"W4214806699","doi":"10.46298/dmtcs.3402","title":"Improper colouring of (random) unit disk graphs","year":2005,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Engineering and Physical Sciences Research Council; Natural Sciences and Engineering Research Council of Canada; Conseil Régional Provence-Alpes-Côte d'Azur; Nederlandse Organisatie voor Wetenschappelijk Onderzoek; Commonwealth Scholarship Commission","keywords":"Combinatorics; Chromatic scale; Unit disk graph; Mathematics; Unit disk; Clique number; Graph; Induced subgraph; Random graph; Unit (ring theory); Discrete mathematics; Computer science; Vertex (graph theory)","score_opus":0.01955281987293713,"score_gpt":0.28368061165432396,"score_spread":0.26412779178138684,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4214806699","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6611561,0.000043636737,0.32246223,0.00020253916,0.00027528434,0.00044583288,0.000013090977,0.00013187343,0.01526941],"genre_scores_gemma":[0.7539969,0.0000073164574,0.24575642,0.00008316565,0.00008964361,0.000009103761,7.378692e-7,0.000027749333,0.000028975026],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99699926,0.000109730434,0.00078673835,0.000499651,0.00096004806,0.00064458523],"domain_scores_gemma":[0.9971951,0.0009836224,0.00027112218,0.0010293231,0.0002645294,0.00025629287],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0022499105,0.00033255733,0.00058700994,0.00025397568,0.00055792567,0.00012766599,0.0015214062,0.00010151633,0.0002735938],"category_scores_gemma":[0.0004894086,0.00022157318,0.00024348998,0.0007282902,0.0045624217,0.0002888027,0.0009070272,0.00029475382,0.000013394353],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002709964,0.00012237339,0.000066266235,0.00012833436,0.000027213084,0.0000027143099,0.0030520367,0.000029835212,0.00086424284,0.9935383,0.000031756186,0.002109825],"study_design_scores_gemma":[0.0005568913,0.000108505184,0.0000810846,0.00013328662,0.000059576305,0.000030004416,0.00012796378,0.07298857,0.00687838,0.918681,0.000055148525,0.0002995819],"about_ca_topic_score_codex":0.0000011053386,"about_ca_topic_score_gemma":0.0000010039544,"teacher_disagreement_score":0.0928408,"about_ca_system_score_codex":0.000026619673,"about_ca_system_score_gemma":0.000055895845,"threshold_uncertainty_score":0.9981466},"labels":[],"label_agreement":null},{"id":"W4214827222","doi":"10.1016/j.jctb.2022.02.006","title":"Tilings in vertex ordered graphs","year":2022,"lang":"en","type":"article","venue":"University of Birmingham Research Portal (University of Birmingham)","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Combinatorics; Mathematics; Discrete mathematics; Vertex (graph theory); Graph; Chromatic scale; Embedding; Computer science","score_opus":0.06743621957751887,"score_gpt":0.3051614252416232,"score_spread":0.23772520566410432,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4214827222","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9726938,0.00010868481,0.0001252997,0.00021631998,0.0001459414,0.00047473254,0.000114942595,0.000069864895,0.0260504],"genre_scores_gemma":[0.9921029,0.00011594466,0.0022728336,0.000011187281,0.000009718869,1.985978e-7,0.000017470515,0.000027792883,0.005441954],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"qualitative","domain_scores_codex":[0.9964089,0.00057122007,0.00030575565,0.0005979204,0.0014169809,0.00069926324],"domain_scores_gemma":[0.99758637,0.0007397482,0.00036326956,0.00070961635,0.00038644124,0.00021457355],"candidate_categories":["metaepi_narrow","sts","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0024189942,0.00023290302,0.00061574124,0.0018265398,0.0014956652,0.000009581938,0.0015806262,0.00017394367,0.0044265357],"category_scores_gemma":[0.00025144374,0.0003247128,0.00035186845,0.0019624443,0.0012848014,0.00031299365,0.002048707,0.0010438222,0.0000065992513],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0041197906,0.0031259828,0.043223046,0.0013131972,0.00087478297,0.006216578,0.0933185,0.0003180534,0.01308209,0.7544018,0.06545647,0.014549716],"study_design_scores_gemma":[0.009514657,0.0020764987,0.01198274,0.0004504956,0.00024526074,0.00019656231,0.5050128,0.0028808117,0.0011064709,0.41301998,0.051891472,0.0016222387],"about_ca_topic_score_codex":0.0031141757,"about_ca_topic_score_gemma":0.0015450501,"teacher_disagreement_score":0.41169432,"about_ca_system_score_codex":0.00012848618,"about_ca_system_score_gemma":0.00032696582,"threshold_uncertainty_score":0.9999205},"labels":[],"label_agreement":null},{"id":"W4221138707","doi":"10.1016/j.jctb.2022.09.001","title":"A counterexample to a conjecture about triangle-free induced subgraphs of graphs with large chromatic number","year":2022,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Combinatorics; Counterexample; Mathematics; Conjecture; Digraph; Clique number; Omega; Bounded function; Induced subgraph; Chromatic scale; Graph; Discrete mathematics; Clique; Vertex (graph theory); Physics","score_opus":0.016087984959408344,"score_gpt":0.27068684073979277,"score_spread":0.25459885578038444,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4221138707","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9933042,0.00013592835,0.00020236266,0.0001350145,0.0036782194,0.00046410382,0.000111082605,0.000032987544,0.0019361126],"genre_scores_gemma":[0.9982183,0.000009038637,0.0011598796,0.00016831089,0.00023746895,0.000024122895,0.0000025028219,0.00006223105,0.000118153344],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9964343,0.0008825768,0.0010432557,0.00020652555,0.0010379389,0.00039543732],"domain_scores_gemma":[0.99637306,0.0010537592,0.0012462337,0.0007461977,0.00039418117,0.00018656404],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0030799152,0.00032987073,0.0010577333,0.00034664775,0.00047347066,0.00004853263,0.0010970357,0.00011525773,0.0013310076],"category_scores_gemma":[0.0008829859,0.00023992086,0.00039920883,0.0007828495,0.00016609381,0.00026052885,0.00041307288,0.0006994,7.6625304e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0058393837,0.00035357533,0.0004864937,0.00012762497,0.00054206594,0.00007796325,0.0075662653,0.0000051511893,0.0007343125,0.9814524,0.0027301144,0.00008465001],"study_design_scores_gemma":[0.0058928407,0.0029231452,0.00029041967,0.00012457142,0.00021710672,0.00062560145,0.0030218044,6.5519924e-7,0.0019178179,0.9802878,0.0044122026,0.00028605017],"about_ca_topic_score_codex":0.0000057982406,"about_ca_topic_score_gemma":0.0000070537712,"teacher_disagreement_score":0.0049141035,"about_ca_system_score_codex":0.00008993612,"about_ca_system_score_gemma":0.00020255297,"threshold_uncertainty_score":0.99958193},"labels":[],"label_agreement":null},{"id":"W4225784836","doi":"10.37236/11794","title":"Upper Bounds on Chromatic Number of $\\mathbb{E}^n$ in Low Dimensions","year":2024,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Division of Mathematical Sciences; Natural Sciences and Engineering Research Council of Canada; Norges Forskningsråd","keywords":"Combinatorics; Chromatic scale; Mathematics; Euclidean space; Space (punctuation); Unit (ring theory); Computer science","score_opus":0.01020809048327118,"score_gpt":0.29749140988231737,"score_spread":0.28728331939904617,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4225784836","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9922551,0.0022728213,0.00031375582,0.0003207811,0.0008772936,0.00011543111,0.0000012389295,0.000015423113,0.0038281423],"genre_scores_gemma":[0.99896485,0.0004884429,0.000036891055,0.000047935664,0.0000726131,0.0000020780697,2.0724148e-7,0.000032671374,0.00035430407],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99820846,0.00018226774,0.0006313631,0.00010095899,0.0004734104,0.0004035657],"domain_scores_gemma":[0.9981637,0.0011048004,0.0002574472,0.0003276735,0.00009973375,0.000046658963],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015176553,0.00016816576,0.00038278746,0.00018749047,0.00010008101,0.000030006519,0.00042853592,0.00008951443,0.0000745236],"category_scores_gemma":[0.0002485264,0.000098235934,0.0002282217,0.0005076188,0.00010190336,0.00009427216,0.000062118284,0.00096645276,0.000009022607],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003844144,0.00015144797,0.00015609317,0.00012839648,0.00013239107,0.000020186293,0.0011511194,0.000013127493,0.00010036837,0.9973583,0.0006271352,0.00012294724],"study_design_scores_gemma":[0.00041819652,0.00028574228,0.00017269888,0.00047759648,0.00008608136,0.00028873037,0.00018621757,0.00027943173,0.0007306512,0.99631786,0.00065320014,0.00010359481],"about_ca_topic_score_codex":0.0000021098979,"about_ca_topic_score_gemma":0.0000021400415,"teacher_disagreement_score":0.0067097438,"about_ca_system_score_codex":0.0003496534,"about_ca_system_score_gemma":0.0002797085,"threshold_uncertainty_score":0.41988102},"labels":[],"label_agreement":null},{"id":"W4225848310","doi":"10.37236/10418","title":"Further Approximations for Aharoni's Rainbow Generalization of the Caccetta-Häggkvist Conjecture","year":2022,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Conjecture; Combinatorics; Rainbow; Digraph; Mathematics; Generalization; Omega; Graph; Constant (computer programming); Physics; Computer science; Mathematical analysis","score_opus":0.015413620237446208,"score_gpt":0.2672277642578714,"score_spread":0.25181414402042523,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4225848310","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.90481246,0.0050103827,0.076670356,0.0074355276,0.003256879,0.0016449161,0.00006284668,0.00003742944,0.0010692355],"genre_scores_gemma":[0.99898887,0.00005080218,0.000090616595,0.00015507333,0.00011740932,0.000021620994,0.000001872349,0.000030809762,0.0005429323],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982404,0.00036816415,0.0005008706,0.00008716742,0.0004877262,0.00031564978],"domain_scores_gemma":[0.99795294,0.00047904468,0.0009098487,0.00038720027,0.00024422596,0.000026759775],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016727682,0.000137998,0.00027254835,0.00008131665,0.00074299966,0.000019124729,0.0008840656,0.000048008154,0.00007532727],"category_scores_gemma":[0.0002829955,0.000076596625,0.0002927066,0.0004255624,0.000099656005,0.000058132024,0.00014921138,0.0006283585,8.139361e-8],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000053962995,0.00008639723,0.00006384008,0.00003375934,0.00015314946,2.8159542e-7,0.001955571,0.0005847346,0.0001890687,0.99279684,0.0039552436,0.00012717753],"study_design_scores_gemma":[0.0008997068,0.00028586318,0.00005529373,0.000008169815,0.0001528136,0.00010802506,0.00044812085,0.00044518066,0.0011614875,0.9836344,0.012710294,0.00009060339],"about_ca_topic_score_codex":0.0000020372613,"about_ca_topic_score_gemma":0.0000026492678,"teacher_disagreement_score":0.094176434,"about_ca_system_score_codex":0.00025438136,"about_ca_system_score_gemma":0.00032854246,"threshold_uncertainty_score":0.57146275},"labels":[],"label_agreement":null},{"id":"W4226110875","doi":"10.1002/jgt.23171","title":"Variants of the Gyárfás–Sumner conjecture: Oriented trees and rainbow paths","year":2024,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Combinatorics; Conjecture; Mathematics; Rainbow; Vertex (graph theory); Graph; Upper and lower bounds; Integer (computer science); Discrete mathematics; Physics","score_opus":0.013004999097107504,"score_gpt":0.2661607394382084,"score_spread":0.2531557403411009,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4226110875","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98525554,0.006477795,0.0022568735,0.0003768113,0.0026610128,0.00018950699,0.00003467599,0.00003085729,0.002716921],"genre_scores_gemma":[0.9981959,0.00020915466,0.0008892164,0.00012811944,0.00019821853,0.0000011905538,2.367187e-7,0.000029641857,0.0003483315],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982941,0.0004269694,0.0005829197,0.0001424288,0.00036768615,0.00018589696],"domain_scores_gemma":[0.9978136,0.0012986858,0.00036276682,0.00032289198,0.00012378719,0.0000782692],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019177565,0.00018880295,0.00038427295,0.00025610017,0.00015630662,0.000039451737,0.00034217892,0.00012335832,0.00010986396],"category_scores_gemma":[0.0006109022,0.00009492096,0.00038495945,0.00037193022,0.00044293163,0.00013103116,0.00011588683,0.00046430874,4.127105e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014662374,0.00004428296,0.0005506759,0.00013332767,0.0004164933,0.00004501413,0.003548331,0.0000029226005,0.0014550722,0.986711,0.0018553665,0.005090859],"study_design_scores_gemma":[0.0004468637,0.00013144128,0.0036370854,0.0003368813,0.00025638606,0.000437887,0.000503338,0.00001853892,0.0014947879,0.9905582,0.002062501,0.00011606115],"about_ca_topic_score_codex":0.0000011063863,"about_ca_topic_score_gemma":0.0000021208289,"teacher_disagreement_score":0.012940344,"about_ca_system_score_codex":0.0000148105255,"about_ca_system_score_gemma":0.00006463713,"threshold_uncertainty_score":0.38707644},"labels":[],"label_agreement":null},{"id":"W4226334441","doi":"10.1017/fms.2023.6","title":"Ramsey numbers of cycles versus general graphs","year":2023,"lang":"en","type":"preprint","venue":"Forum of Mathematics Sigma","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Korea Advanced Institute of Science and Technology; Institute for Basic Science; POSCO TJ Park Foundation; UK Research and Innovation","keywords":"Combinatorics; Mathematics; Conjecture; Ramsey's theorem; Graph; Logarithm; Upper and lower bounds; Sigma; Complement (music); Discrete mathematics; Physics","score_opus":0.07914375741945041,"score_gpt":0.3398704851438903,"score_spread":0.2607267277244399,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4226334441","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9779509,0.00032438108,0.004529753,0.00017553748,0.003643736,0.0010975093,0.00055655336,0.00032855957,0.011393097],"genre_scores_gemma":[0.83478624,0.00023527772,0.16315356,0.000017915898,0.00016888621,0.00007884883,0.00006290807,0.0002695441,0.0012268123],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99650913,0.000103458384,0.0015155261,0.00048625332,0.0008596901,0.0005259207],"domain_scores_gemma":[0.9946363,0.0016847183,0.0015890711,0.0017326422,0.00023902557,0.00011821761],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008878444,0.00057259586,0.0014519888,0.00039706298,0.00012363346,0.00002863554,0.001205697,0.0006583472,0.00014007384],"category_scores_gemma":[0.0010544582,0.00049587496,0.00090524426,0.0002615977,0.00042147035,0.000053746277,0.0017542985,0.0006121424,0.000009164949],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000921577,0.00026711135,0.0002830094,0.0052543236,0.00088821584,0.000008163869,0.0037535469,0.00027779216,0.00020441094,0.9809517,0.0076777227,0.0003418184],"study_design_scores_gemma":[0.0007979714,0.0001111308,0.00006994145,0.00075990707,0.00035492866,0.000004632432,0.0015307347,0.0010639135,0.003763569,0.990981,0.00011493287,0.00044737326],"about_ca_topic_score_codex":0.000067003435,"about_ca_topic_score_gemma":0.000050676226,"teacher_disagreement_score":0.15862381,"about_ca_system_score_codex":0.00004528623,"about_ca_system_score_gemma":0.00009737777,"threshold_uncertainty_score":0.9997493},"labels":[],"label_agreement":null},{"id":"W4226358921","doi":"10.48550/arxiv.2202.07293","title":"Asymptotic dimension of intersection graphs","year":2022,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Disjoint sets; Intersection (aeronautics); Mathematics; Bounded function; Combinatorics; Dimension (graph theory); Metric dimension; Regular polygon; Metric space; Function (biology); Pairwise comparison; Discrete mathematics; Metric (unit); Chordal graph; Graph; Mathematical analysis; Geometry","score_opus":0.07679499056200208,"score_gpt":0.21448442094368694,"score_spread":0.13768943038168485,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4226358921","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98810977,0.000036797308,0.0035897656,0.0000067726037,0.0013796974,0.0002691094,0.000029890163,0.00011015764,0.006468061],"genre_scores_gemma":[0.99852586,0.000072680166,0.0003148886,0.000019792695,0.000030497513,8.3343673e-7,0.000016804224,0.00003169525,0.0009869289],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99865913,0.00022530522,0.000258625,0.0005491771,0.00010985976,0.0001979266],"domain_scores_gemma":[0.9983554,0.00023341936,0.00040686008,0.00084332586,0.00009329769,0.00006768002],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00029871182,0.0002552492,0.0003967201,0.000381047,0.0002148261,0.000009729666,0.00053895864,0.00022653225,0.0005802008],"category_scores_gemma":[0.00008395539,0.00027097322,0.00038868946,0.00034063432,0.00016224143,0.00006630577,0.0017022666,0.00066515506,0.000002668197],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000118592725,0.00009589606,0.0029557825,0.00027438076,0.00021627647,0.00005402095,0.00070727954,0.008993915,0.00008041795,0.9860942,0.00032764534,0.00008160029],"study_design_scores_gemma":[0.0003245823,0.00009104912,0.000810123,0.00008806433,0.0002534856,0.0000047287067,0.0005712263,0.0036534097,0.00021446557,0.9935962,0.00011751399,0.00027515684],"about_ca_topic_score_codex":0.00006038942,"about_ca_topic_score_gemma":0.0000148017925,"teacher_disagreement_score":0.010416131,"about_ca_system_score_codex":0.00014947135,"about_ca_system_score_gemma":0.000044360724,"threshold_uncertainty_score":0.99997425},"labels":[],"label_agreement":null},{"id":"W4231447687","doi":"10.1007/978-0-387-26677-0_1","title":"Introduction","year":2004,"lang":"en","type":"book-chapter","venue":"Problem books in mathematics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Amateur; Sample (material); Computer science; Political science; Law; Physics","score_opus":0.027078856204601234,"score_gpt":0.2604642467785246,"score_spread":0.23338539057392335,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4231447687","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000088980356,0.00030483646,0.0011622015,0.00025080144,0.0005034864,0.0010735723,0.00002025611,0.00024445183,0.9963514],"genre_scores_gemma":[0.001042601,0.00023952709,0.17805496,0.00007984785,0.0013226208,0.00006743582,0.000022743812,0.00035516158,0.8188151],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972139,0.000023305756,0.0011906431,0.0005831792,0.0005603918,0.0004285812],"domain_scores_gemma":[0.9977599,0.00028756502,0.00066409475,0.0010829206,0.0001146593,0.000090910915],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0007907322,0.0006650198,0.0009372144,0.0003981254,0.00015933832,0.000056195047,0.0005091152,0.00067899644,0.0017696673],"category_scores_gemma":[0.00017403153,0.00058740965,0.00028808636,0.000047450023,0.00024196714,0.00009143529,0.00029272822,0.0010324853,0.00011202066],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008823723,0.000058649257,0.000001340483,0.0016662196,0.00009202581,0.000023413857,0.0018050153,0.00001501511,0.000010050596,0.9908803,0.004461447,0.0009776802],"study_design_scores_gemma":[0.0003648328,0.000052716714,5.000188e-7,0.0009635,0.00012721075,0.000062924606,0.000036368634,0.000022299158,0.000072010276,0.95962924,0.03808601,0.00058236136],"about_ca_topic_score_codex":0.0000023768018,"about_ca_topic_score_gemma":0.000015997879,"teacher_disagreement_score":0.17753631,"about_ca_system_score_codex":0.00033511175,"about_ca_system_score_gemma":0.00010649797,"threshold_uncertainty_score":0.99965775},"labels":[],"label_agreement":null},{"id":"W4232597137","doi":"10.1002/rsa.20133","title":"Hamiltonicity of random graphs produced by 2‐processes","year":2006,"lang":"en","type":"article","venue":"Random Structures and Algorithms","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"struct; Random graph; Random regular graph; Combinatorics; Mathematics; Vertex (graph theory); Graph; Discrete mathematics; Hamiltonian path; Regular graph; Voltage graph; Line graph; Computer science; 1-planar graph","score_opus":0.010650095032135227,"score_gpt":0.2527004330042177,"score_spread":0.24205033797208245,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4232597137","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98855406,0.0063206395,0.0026536612,0.000070636954,0.0003583761,0.0006131494,0.00017132323,0.000106886626,0.0011512392],"genre_scores_gemma":[0.9942968,0.00039027928,0.0048028505,0.00004684561,0.00018399983,0.000019907859,0.000020887848,0.000037467387,0.00020098551],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99816674,0.00011519828,0.0005759392,0.00042905516,0.0003626627,0.00035039196],"domain_scores_gemma":[0.9984032,0.000686475,0.00029843868,0.0003680873,0.00016416072,0.000079633464],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039834747,0.0003388735,0.0007487733,0.0001118583,0.00032817878,0.00004894282,0.000245855,0.00015942367,0.000064127846],"category_scores_gemma":[0.00033102254,0.00023296442,0.00016791615,0.00027035835,0.0003472015,0.00011059645,0.00009151729,0.00020038403,2.0702942e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0051242528,0.00046787472,0.006741845,0.0040107435,0.00093238725,0.000033952725,0.0025097788,0.00008436167,0.034460973,0.8903873,0.028585197,0.026661312],"study_design_scores_gemma":[0.0106707895,0.00007628092,0.0009861195,0.00005133422,0.00013179655,0.000031950833,0.000065752574,0.00011296294,0.05597589,0.93042344,0.0011189067,0.00035474732],"about_ca_topic_score_codex":0.00012544198,"about_ca_topic_score_gemma":0.000012932675,"teacher_disagreement_score":0.040036146,"about_ca_system_score_codex":0.000009132974,"about_ca_system_score_gemma":0.00003232744,"threshold_uncertainty_score":0.95000136},"labels":[],"label_agreement":null},{"id":"W4233572056","doi":"10.1002/jgt.20440","title":"Cycles and paths in edge‐colored graphs with given degrees","year":2009,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":24,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Royal Military College Saint-Jean","funders":"","keywords":"Colored; Multigraph; Combinatorics; Mathematics; Hamiltonian path; Edge coloring; Graph; Hamiltonian (control theory); Enhanced Data Rates for GSM Evolution; Discrete mathematics; Line graph; Graph power; Computer science","score_opus":0.016158173664898346,"score_gpt":0.2670299673838781,"score_spread":0.2508717937189797,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4233572056","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9954816,0.0016468111,0.00040607923,0.00019122285,0.00013990734,0.0001271928,0.0000030616197,0.000017686065,0.0019864293],"genre_scores_gemma":[0.9931274,0.0003117706,0.006272448,0.00016627947,0.000066186345,0.0000013173656,2.5524014e-7,0.000018299585,0.000036021724],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985469,0.0002707764,0.00050162536,0.00014752883,0.00028238655,0.00025076984],"domain_scores_gemma":[0.99857557,0.00056304847,0.00041454379,0.00021817037,0.00011086436,0.00011779575],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00137193,0.0002069299,0.00044976128,0.00054998725,0.00013179713,0.00003541458,0.00027697903,0.00010994082,0.000023931703],"category_scores_gemma":[0.0002056901,0.00012917811,0.00015730922,0.0003006136,0.0002739711,0.00021070927,0.00003255079,0.0003959662,2.604694e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010576986,0.00015772118,0.010596924,0.000035807992,0.0001286417,0.00019937204,0.0031594185,0.00001178448,0.00047551937,0.96817577,0.0003295815,0.015671749],"study_design_scores_gemma":[0.001075226,0.00063481566,0.066667914,0.00017611796,0.000075848024,0.0003514318,0.00088838686,0.000004027324,0.00028195628,0.92960006,0.000079137426,0.00016507815],"about_ca_topic_score_codex":0.0000010517198,"about_ca_topic_score_gemma":0.000009610751,"teacher_disagreement_score":0.056070987,"about_ca_system_score_codex":0.000016279282,"about_ca_system_score_gemma":0.00002926803,"threshold_uncertainty_score":0.52677304},"labels":[],"label_agreement":null},{"id":"W4234861332","doi":"10.1002/jgt.20324","title":"On highly ramsey infinite graphs","year":2008,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Thompson Rivers University; University of Victoria","keywords":"Combinatorics; Mathematics; Ramsey's theorem; Ramsey theory; Graph; Constant (computer programming); Discrete mathematics; Computer science","score_opus":0.030808519224349427,"score_gpt":0.2758785608208873,"score_spread":0.24507004159653786,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4234861332","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98234785,0.000490219,0.0011848746,0.00009647191,0.0012086997,0.00010570861,0.000006924033,0.00004515906,0.014514094],"genre_scores_gemma":[0.9957621,0.0003524852,0.002520392,0.00068281643,0.00021936391,0.0000017774457,5.255475e-7,0.000043206506,0.0004173394],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977659,0.0004125464,0.0007640143,0.00015973319,0.0005870259,0.00031079716],"domain_scores_gemma":[0.9965232,0.0019000927,0.0007079692,0.0004491735,0.00023595936,0.00018361994],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016724156,0.00026183637,0.0005119967,0.00072128186,0.00040871167,0.000019817451,0.00053608685,0.00016042645,0.000208454],"category_scores_gemma":[0.00086157565,0.00017821077,0.00062527816,0.0004025178,0.00041957537,0.00018010283,0.00006340776,0.0006739463,0.000009453048],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005907575,0.00014466982,0.0005971529,0.000023174363,0.0002298459,0.00021723838,0.0014803539,0.00001089919,0.00020303558,0.98811054,0.007302884,0.0010894646],"study_design_scores_gemma":[0.0009490551,0.0004945424,0.0018429162,0.00009283068,0.00007907925,0.00081094226,0.00014029322,0.0000013168276,0.00082864356,0.9929857,0.0015652846,0.00020939033],"about_ca_topic_score_codex":7.1038704e-7,"about_ca_topic_score_gemma":4.4064961e-7,"teacher_disagreement_score":0.014096755,"about_ca_system_score_codex":0.000024250281,"about_ca_system_score_gemma":0.000051980773,"threshold_uncertainty_score":0.7267224},"labels":[],"label_agreement":null},{"id":"W4235275672","doi":"10.1002/jgt.20064","title":"The acyclic edge chromatic number of a random <i>d</i>‐regular graph is <i>d</i> + 1","year":2005,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":39,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Combinatorics; Mathematics; Chromatic scale; Conjecture; Foster graph; Discrete mathematics; Critical graph; Edge coloring; Friendship graph; Random graph; Graph; Windmill graph; Brooks' theorem; Enhanced Data Rates for GSM Evolution; Upper and lower bounds; Graph power; Line graph; Computer science","score_opus":0.013080081323249617,"score_gpt":0.2844518910577733,"score_spread":0.2713718097345237,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4235275672","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.982495,0.004774224,0.0028599405,0.00081274984,0.0009871656,0.00035374923,0.000016380305,0.000039531187,0.0076612495],"genre_scores_gemma":[0.99256945,0.0010718424,0.0046247374,0.0005912663,0.00050831406,0.0000074527375,4.3962586e-7,0.0000618457,0.00056463503],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9963241,0.00072270934,0.0015319394,0.00018739456,0.0007842373,0.00044961282],"domain_scores_gemma":[0.99396414,0.0031411385,0.0015881464,0.0007834266,0.00034718792,0.00017593586],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004691302,0.0003430479,0.00083144463,0.00024155506,0.0005189238,0.000058483023,0.0010720484,0.00017143782,0.00032039508],"category_scores_gemma":[0.00077072,0.00019602808,0.0011599419,0.0004915632,0.0008020496,0.00028832877,0.00013267041,0.000568344,0.000009295339],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012391417,0.0002834375,0.00073739816,0.00017297949,0.0011703472,0.000018368426,0.0054692556,0.0000094790485,0.0015755245,0.9580431,0.020001,0.01127998],"study_design_scores_gemma":[0.0025886425,0.000102339516,0.00029185193,0.00019148935,0.00038329716,0.0004646032,0.00052446703,0.0000115064595,0.0062557105,0.97972566,0.009234703,0.00022575018],"about_ca_topic_score_codex":0.0000012455005,"about_ca_topic_score_gemma":0.0000026936698,"teacher_disagreement_score":0.021682551,"about_ca_system_score_codex":0.000034160657,"about_ca_system_score_gemma":0.00007109458,"threshold_uncertainty_score":0.7993793},"labels":[],"label_agreement":null},{"id":"W4235676350","doi":"10.1017/s0963548306007954","title":"Colouring Random Regular Graphs","year":2006,"lang":"en","type":"article","venue":"Combinatorics Probability Computing","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Random graph; Chromatic scale; Combinatorics; Discrete mathematics; Random regular graph; Graph; Foster graph; Upper and lower bounds; Line graph; Voltage graph; 1-planar graph; Mathematical analysis","score_opus":0.022199893848720106,"score_gpt":0.2602597606684917,"score_spread":0.2380598668197716,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4235676350","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98183584,0.00022881432,0.006718085,0.000075788535,0.001049494,0.0006038947,0.0000020345988,0.0004402976,0.009045725],"genre_scores_gemma":[0.9907948,0.0000020559273,0.008862659,0.000029940047,0.00012220923,0.000008116047,0.0000037921923,0.000038553055,0.00013787944],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976051,0.00028333394,0.0006815053,0.00050482166,0.00040683776,0.0005183992],"domain_scores_gemma":[0.9975558,0.001101541,0.00026830952,0.00076143985,0.00022571883,0.000087188266],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0018403687,0.00029130906,0.00048312094,0.00012132451,0.0008009745,0.0000744493,0.00047766507,0.00016927601,0.000015543808],"category_scores_gemma":[0.0006597689,0.00026669254,0.00024874762,0.0005175887,0.00020708979,0.00009414373,0.0004162871,0.000373992,0.0000029869468],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026314528,0.00019711607,0.011666345,0.00018340543,0.000024413848,0.0000075197418,0.00025077988,0.00012096179,0.00008244307,0.98632354,0.0005415315,0.0005756428],"study_design_scores_gemma":[0.0014665592,0.000044592434,0.002870673,0.000048770646,0.000034697143,0.000014122932,0.000026657763,0.0014135577,0.0010570054,0.9922777,0.00043656406,0.00030911263],"about_ca_topic_score_codex":0.000024155934,"about_ca_topic_score_gemma":0.0000037977281,"teacher_disagreement_score":0.008958928,"about_ca_system_score_codex":0.00014254679,"about_ca_system_score_gemma":0.000036183403,"threshold_uncertainty_score":0.99997854},"labels":[],"label_agreement":null},{"id":"W4236302493","doi":"10.1002/rsa.20252","title":"A sharp threshold for the Hamilton cycle Maker–Breaker game","year":2008,"lang":"en","type":"article","venue":"Random Structures and Algorithms","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Conjecture; Combinatorics; struct; Mathematics; Hamiltonian path; Graph; Random graph; Discrete mathematics; Adversary; Mathematical economics; Computer science; Statistics","score_opus":0.03757259098329083,"score_gpt":0.28908713285420556,"score_spread":0.2515145418709147,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4236302493","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9619558,0.0062619504,0.024327088,0.00062952616,0.0016689008,0.0023255895,0.00025724052,0.0002456622,0.0023282815],"genre_scores_gemma":[0.9886923,0.00078336935,0.008209545,0.0005404181,0.0007926855,0.00010332567,0.000010572548,0.000060823746,0.0008069766],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99846613,0.00004931989,0.00036293847,0.0003882991,0.0002994587,0.00043382237],"domain_scores_gemma":[0.99803466,0.0011396938,0.00013849184,0.0004998427,0.00007689284,0.00011041373],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033862074,0.00032693494,0.00047776225,0.000061107916,0.0009976582,0.00006898003,0.00031670838,0.00016024207,0.00010744999],"category_scores_gemma":[0.00013393785,0.00017950965,0.00027019493,0.000113689064,0.00038077505,0.00009121276,0.00010216212,0.00024464578,9.817727e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0023230591,0.00009971875,0.0009035294,0.00035735156,0.0010129552,0.00008380657,0.014404669,0.0002186667,0.0004694429,0.90104014,0.019463621,0.05962305],"study_design_scores_gemma":[0.00792464,0.000101502475,0.004059906,0.000026126303,0.0001693121,0.00046704675,0.00021315995,0.0070325043,0.0005543152,0.9574085,0.021618921,0.00042406892],"about_ca_topic_score_codex":0.000020157775,"about_ca_topic_score_gemma":0.000007833598,"teacher_disagreement_score":0.059198983,"about_ca_system_score_codex":0.00001509916,"about_ca_system_score_gemma":0.000019880701,"threshold_uncertainty_score":0.76732814},"labels":[],"label_agreement":null},{"id":"W4236584536","doi":"10.37236/2302","title":"Colourful Theorems and Indices of Homomorphism Complexes","year":2013,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Royal Military College of Canada","funders":"Natural Sciences and Engineering Research Council of Canada; Nemzeti Kutatási és Technológiai Hivatal; Hungarian Scientific Research Fund","keywords":"Mathematics; Combinatorics; Clique; Homomorphism; Bipartite graph; Chromatic scale; Discrete mathematics; Order (exchange); Graph","score_opus":0.010795564709253575,"score_gpt":0.24760172170440536,"score_spread":0.23680615699515178,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4236584536","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99352014,0.0036421355,0.0007142553,0.0003887513,0.0002413197,0.0001685106,0.0000011813206,0.000008665477,0.0013150441],"genre_scores_gemma":[0.9990468,0.00066044804,0.00006083103,0.0000481597,0.000054278873,0.0000019471715,1.7018439e-7,0.00001728911,0.000110073954],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99859434,0.0001858606,0.00047792858,0.000072083734,0.00033923986,0.0003305297],"domain_scores_gemma":[0.9978162,0.0009069379,0.0007224235,0.00023183784,0.0002632727,0.00005935008],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011992424,0.00013982638,0.00037571392,0.00010390476,0.00017851747,0.00002845359,0.0005060087,0.00007156553,0.00006226538],"category_scores_gemma":[0.00020069648,0.000078870566,0.00010694527,0.00018790708,0.0003260831,0.00012736047,0.000097679345,0.0005341327,9.951351e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027236889,0.00006413975,0.00053922686,0.000028975202,0.00014407029,0.000001363261,0.0012024165,9.604863e-7,0.000738981,0.9961332,0.0007599343,0.00035948362],"study_design_scores_gemma":[0.00059659855,0.0005091314,0.00096333324,0.0000295871,0.000090366695,0.00020969185,0.0004138747,0.000017058266,0.0025837773,0.99403447,0.00046305853,0.000089059424],"about_ca_topic_score_codex":0.000009402605,"about_ca_topic_score_gemma":0.0000015628941,"teacher_disagreement_score":0.005526665,"about_ca_system_score_codex":0.000049666123,"about_ca_system_score_gemma":0.000097320575,"threshold_uncertainty_score":0.32162482},"labels":[],"label_agreement":null},{"id":"W4236856137","doi":"10.1016/j.disc.2006.03.022","title":"Limit distribution for the existence of Hamiltonian cycles in a random graph","year":2006,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Mathematics; Combinatorics; Random graph; Hamiltonian (control theory); Graph; Discrete mathematics; Quartic graph; Random regular graph; Hamiltonian path; Graph power; Line graph; 1-planar graph","score_opus":0.027158081144164525,"score_gpt":0.29091735446524475,"score_spread":0.26375927332108023,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4236856137","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.75125206,0.0006324098,0.23987143,0.0003538307,0.00026425484,0.0019238864,0.00041516713,0.00009158226,0.005195406],"genre_scores_gemma":[0.9783974,0.00003231088,0.021161158,0.00001706051,0.00006469247,0.00010782876,0.000028740526,0.000029266575,0.00016152542],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985762,0.000052574367,0.0006533648,0.00017906161,0.00025839248,0.00028037335],"domain_scores_gemma":[0.9968808,0.0021746045,0.00031050795,0.0005266872,0.0000803967,0.000026980553],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007674184,0.00019879921,0.00040481813,0.000064965934,0.00019254598,0.000030173522,0.00037327746,0.00009710331,0.000012682793],"category_scores_gemma":[0.00056665845,0.00012100896,0.0002569119,0.00023434157,0.000259277,0.0000644134,0.00007898175,0.00012190468,7.5222425e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006360613,0.000095367664,0.00035759778,0.00039359825,0.000034346762,0.0000011950709,0.0012671351,0.000047101228,0.00014378114,0.9968274,0.00045766187,0.00031119125],"study_design_scores_gemma":[0.0011266712,0.000036101792,0.0016505673,0.00015053523,0.000095102834,0.000006527113,0.00077616295,0.0030319605,0.0012676668,0.9913571,0.00033719398,0.00016440936],"about_ca_topic_score_codex":0.000029892157,"about_ca_topic_score_gemma":0.00008759551,"teacher_disagreement_score":0.22714537,"about_ca_system_score_codex":0.000024112847,"about_ca_system_score_gemma":0.000019366638,"threshold_uncertainty_score":0.4934602},"labels":[],"label_agreement":null},{"id":"W4237066349","doi":"10.1007/978-1-4614-6025-1_3","title":"Some combinatorial bounds","year":2012,"lang":"en","type":"book-chapter","venue":"","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia; York University","funders":"","keywords":"Exponent; Section (typography); Mathematics; Critical exponent; Combinatorics; Discrete mathematics; Computer science; Geometry; Philosophy","score_opus":0.0361909323693728,"score_gpt":0.27470397386387696,"score_spread":0.23851304149450417,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4237066349","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00007675452,0.0012921393,0.000021305434,0.000028500048,0.0062177368,0.00019170731,0.000021221602,0.00017010407,0.99198055],"genre_scores_gemma":[0.007775889,0.00021196464,0.00096909335,0.00021400176,0.005390515,0.0000047447757,0.000015197695,0.00013492521,0.9852837],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988165,0.000013645051,0.00032565938,0.00022539581,0.00033926332,0.00027956106],"domain_scores_gemma":[0.99878055,0.00024327892,0.0001763039,0.00062698335,0.000054533426,0.00011832332],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0002367052,0.00035577797,0.0004648782,0.00010125187,0.00017986706,0.000032947177,0.0003043821,0.0006093292,0.0045795883],"category_scores_gemma":[0.000041388874,0.00026973023,0.0002728082,0.000008362599,0.00015911266,0.00009058575,0.00022725924,0.00044649612,0.00015639084],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010907384,0.000012057035,0.0000016168924,0.00006096158,0.00011693668,0.0000040657173,0.000110177076,3.690797e-9,0.0000015217681,0.97009826,0.028650474,0.0009330345],"study_design_scores_gemma":[0.00016482065,0.000019793639,9.747098e-7,0.000022816943,0.00008243679,0.000006723024,0.0000021004819,1.86738e-7,0.000015638783,0.63459283,0.36485946,0.00023223994],"about_ca_topic_score_codex":0.000001641961,"about_ca_topic_score_gemma":9.919972e-7,"teacher_disagreement_score":0.33620897,"about_ca_system_score_codex":0.00004578082,"about_ca_system_score_gemma":0.000028307415,"threshold_uncertainty_score":0.9999755},"labels":[],"label_agreement":null},{"id":"W4238395855","doi":"10.5948/upo9780883859568.002","title":"Combinatorics Problems","year":2001,"lang":"en","type":"book-chapter","venue":"Anneli Lax new mathematical library","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"CONTEST; Competition (biology); Mathematics education; History; Mathematics; Geography; Political science; Law","score_opus":0.04518850154714928,"score_gpt":0.25400007713381095,"score_spread":0.20881157558666166,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4238395855","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00005956785,0.001115481,0.0011494488,0.0006692129,0.0005193197,0.0007982949,0.00006801078,0.0008088269,0.99481183],"genre_scores_gemma":[0.00074416277,0.00065326836,0.0074676103,0.0006918168,0.0010242584,0.000019106865,0.00008375076,0.0004988231,0.9888172],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99667233,0.00004729767,0.0011508106,0.00072339474,0.0007586694,0.00064747984],"domain_scores_gemma":[0.9963933,0.0011388082,0.00048229724,0.0013886003,0.000053637745,0.00054331985],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00021884197,0.0009412258,0.001323992,0.00025826035,0.00026211984,0.00016946025,0.0010369535,0.0010865874,0.01494527],"category_scores_gemma":[0.00017303285,0.00074756995,0.00063246716,0.00011835556,0.00028528782,0.00046045336,0.00077982404,0.0011113677,0.0006910595],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015568097,0.00006841936,0.0000031208197,0.0006703342,0.00016395168,0.000089991736,0.0002827014,4.1104315e-7,7.354073e-7,0.7835184,0.21426402,0.0009223912],"study_design_scores_gemma":[0.00029405317,0.00008728418,7.584649e-7,0.0006268956,0.00013725944,0.00008883082,0.000009317589,0.00002228542,0.000016973012,0.6559457,0.3421864,0.0005842318],"about_ca_topic_score_codex":9.4281813e-7,"about_ca_topic_score_gemma":3.0727352e-7,"teacher_disagreement_score":0.12792237,"about_ca_system_score_codex":0.00003540682,"about_ca_system_score_gemma":0.0001557065,"threshold_uncertainty_score":0.99949753},"labels":[],"label_agreement":null},{"id":"W4238584340","doi":"10.1016/s0022-3182(00)70570-x","title":"President's Message","year":2000,"lang":"en","type":"article","venue":"Journal of Nutrition Education","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Infimum and supremum; Discriminant; Mathematics; Field (mathematics); Upper and lower bounds; Combinatorics; Degree (music); Discrete mathematics; Computer science; Pure mathematics; Physics; Artificial intelligence; Mathematical analysis","score_opus":0.016629144680518994,"score_gpt":0.31373185123847075,"score_spread":0.29710270655795173,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4238584340","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98626715,0.0007817111,0.00016163138,0.0008333926,0.0007977072,0.00013543807,0.0000016851342,0.000012159899,0.0110091055],"genre_scores_gemma":[0.9873302,0.0004556284,0.009319642,0.00017342294,0.0010201534,0.0000081908465,0.0000015894447,0.000010229278,0.0016809226],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99929434,0.00006936975,0.00032246535,0.000051442534,0.00018912014,0.000073241165],"domain_scores_gemma":[0.99934965,0.00010552804,0.00021200268,0.00011412862,0.00016498426,0.00005368489],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00025950512,0.00005997935,0.00011729316,0.00011314298,0.000087617336,0.000024650182,0.00011622888,0.00004814806,0.0014983087],"category_scores_gemma":[0.0001004231,0.00004879443,0.00009363703,0.00009320668,0.00002338847,0.00024565542,0.000004805645,0.00012140475,0.0000062086397],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028391607,0.0057372563,0.00084124005,0.00046251604,0.00014281548,0.000011619982,0.004156399,0.000008918283,0.0014962313,0.31666467,0.45402658,0.21616784],"study_design_scores_gemma":[0.00040170527,0.000076780496,0.0035025647,0.00015833888,0.000045257075,0.00020515584,0.00045524485,0.0000027361789,0.0009777062,0.9312574,0.0628495,0.00006756103],"about_ca_topic_score_codex":0.0000010594737,"about_ca_topic_score_gemma":3.9886916e-7,"teacher_disagreement_score":0.6145928,"about_ca_system_score_codex":0.000036949103,"about_ca_system_score_gemma":0.000060831593,"threshold_uncertainty_score":0.99941444},"labels":[],"label_agreement":null},{"id":"W4238743912","doi":"10.1002/jgt.20167","title":"The generalized acyclic edge chromatic number of random regular graphs","year":2006,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Combinatorics; Mathematics; Chromatic scale; Edge coloring; Brooks' theorem; Discrete mathematics; Random graph; Graph; Foster graph; Critical graph; Upper and lower bounds; Graph power; Line graph","score_opus":0.01150738133832381,"score_gpt":0.2757262699425528,"score_spread":0.264218888604229,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4238743912","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98832446,0.0029154443,0.0017862006,0.00012311529,0.0008843266,0.00022036425,0.0000060560415,0.000024110597,0.0057159117],"genre_scores_gemma":[0.9944036,0.00038574747,0.00415989,0.00007005984,0.00030612704,0.0000052981623,8.990169e-7,0.000046326615,0.00062202406],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9966593,0.0009070478,0.0013586198,0.00013872756,0.00060016627,0.0003361488],"domain_scores_gemma":[0.99518126,0.002378299,0.00145663,0.00060690095,0.0002910341,0.000085861706],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0040202034,0.00026304196,0.0007156021,0.00023049589,0.00043417705,0.00004688439,0.0007393175,0.00014000585,0.00013689422],"category_scores_gemma":[0.0005288308,0.00014495089,0.00094078865,0.00039196628,0.0006694813,0.00015057561,0.0000811002,0.0003616887,0.000002241462],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00073090236,0.00010883252,0.0007900018,0.00007615485,0.0003808686,0.000019084284,0.0004313747,0.000008665322,0.0024869319,0.9884667,0.0055244057,0.0009761002],"study_design_scores_gemma":[0.0028305233,0.0000684726,0.0011819793,0.00011693714,0.00028424055,0.00031156908,0.00021550778,0.000007461973,0.004189986,0.9892901,0.0013346307,0.00016856696],"about_ca_topic_score_codex":0.0000052194105,"about_ca_topic_score_gemma":0.000004004782,"teacher_disagreement_score":0.0060791573,"about_ca_system_score_codex":0.000022241391,"about_ca_system_score_gemma":0.000045074157,"threshold_uncertainty_score":0.5910925},"labels":[],"label_agreement":null},{"id":"W4238782258","doi":"10.1002/jgt.20369","title":"On the chromatic number of a random 5‐regular graph","year":2009,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Combinatorics; Bounded function; Fractional coloring; Brooks' theorem; Chromatic scale; Discrete mathematics; Vertex (graph theory); Random graph; Critical graph; Graph; Graph power; Line graph; Mathematical analysis","score_opus":0.015165939591184223,"score_gpt":0.2821104125560561,"score_spread":0.2669444729648719,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4238782258","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9901327,0.0004177582,0.00168797,0.000371701,0.00031867283,0.00020823299,0.000005378199,0.000017740002,0.0068398598],"genre_scores_gemma":[0.99785316,0.000090179754,0.001276707,0.0005475496,0.00012873074,0.0000017880286,2.9697676e-7,0.000014895405,0.00008666761],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99753755,0.0006728222,0.0008507897,0.000115580755,0.00058507296,0.00023815571],"domain_scores_gemma":[0.9950504,0.003247835,0.00095978024,0.00045833318,0.00019488716,0.000088783934],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033805296,0.00022942641,0.00060144544,0.000199501,0.00020493694,0.000023987779,0.0006192793,0.000112376714,0.0004197131],"category_scores_gemma":[0.0009509418,0.000107562686,0.0007734047,0.00036258,0.0002652296,0.00010409815,0.00003140751,0.00044142056,0.0000027468282],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008548443,0.00018622474,0.00006576446,0.00003512187,0.00028874193,0.000022910539,0.0011909717,0.000006499924,0.0012608534,0.9917054,0.0021805353,0.0022021364],"study_design_scores_gemma":[0.0013851626,0.00031465403,0.0008679578,0.0002606708,0.00019462871,0.00025887685,0.00031523238,0.00000451014,0.0025105295,0.993639,0.00011397998,0.00013477566],"about_ca_topic_score_codex":3.689323e-7,"about_ca_topic_score_gemma":2.99993e-7,"teacher_disagreement_score":0.007720498,"about_ca_system_score_codex":0.000015644559,"about_ca_system_score_gemma":0.000026378137,"threshold_uncertainty_score":0.4595564},"labels":[],"label_agreement":null},{"id":"W4240114191","doi":"10.1016/s0012-365x(04)00144-x","title":"Ramsey numbers in complete balanced multipartite graphs. Part II: Size numbers","year":2004,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"National Research Foundation","keywords":"Multipartite; Mathematics; Combinatorics; Discrete mathematics; Ramsey's theorem; Diagonal; Monochromatic color; Cardinality (data modeling); Graph; Computer science","score_opus":0.029877456998500543,"score_gpt":0.28952597875345,"score_spread":0.25964852175494946,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4240114191","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97552335,0.00007029701,0.001569906,0.0003491971,0.00056182133,0.0008526512,0.00010176158,0.00029435364,0.020676648],"genre_scores_gemma":[0.929038,0.000046506233,0.06972337,0.0003306905,0.00009281468,0.000077973746,0.000020316858,0.00011096053,0.0005593976],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9969473,0.00009819676,0.0010466313,0.0005082846,0.0005934784,0.0008060969],"domain_scores_gemma":[0.9974996,0.0007869994,0.00039473968,0.0010232405,0.00007815969,0.00021728706],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006789674,0.00052836275,0.0008396849,0.00014225728,0.00042518773,0.00007504256,0.0006131964,0.00023903267,0.00029571788],"category_scores_gemma":[0.0009674204,0.0004429543,0.00034817064,0.00052778656,0.00036185858,0.00021233509,0.00030915037,0.0004716401,0.000044231456],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004734461,0.00030720377,0.0011644833,0.00042033673,0.00013144015,0.000046242665,0.015793033,0.00018825862,0.00037368908,0.9803995,0.0010080226,0.00012046974],"study_design_scores_gemma":[0.0022953856,0.00007293507,0.0004806489,0.00042903173,0.00007682206,0.000037339756,0.001597531,0.0003984514,0.0005640105,0.99185586,0.0015590347,0.00063295517],"about_ca_topic_score_codex":0.000056983692,"about_ca_topic_score_gemma":0.00018084048,"teacher_disagreement_score":0.06815346,"about_ca_system_score_codex":0.000120991564,"about_ca_system_score_gemma":0.000046297475,"threshold_uncertainty_score":0.99980223},"labels":[],"label_agreement":null},{"id":"W4240363330","doi":"10.1002/jgt.20352","title":"The <i>n</i>‐ordered graphs: A new graph class","year":2008,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University; Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada; Mitacs; Fields Institute for Research in Mathematical Sciences","keywords":"Combinatorics; Mathematics; Discrete mathematics; Countable set; Indifference graph; Chordal graph; 1-planar graph; Pathwidth; Line graph; Graph","score_opus":0.030488311670102068,"score_gpt":0.27358057609240133,"score_spread":0.24309226442229925,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4240363330","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95817584,0.01150443,0.008134457,0.0012928168,0.0039112456,0.00044339203,0.000011022782,0.0001273156,0.016399508],"genre_scores_gemma":[0.9892692,0.0035354926,0.0040482515,0.00066182925,0.0005580466,0.0000041506414,5.6241225e-7,0.00007513039,0.0018473129],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9968242,0.0006127395,0.0010797093,0.00020702787,0.00076172524,0.00051460456],"domain_scores_gemma":[0.9951721,0.0024678714,0.0010159477,0.0007113811,0.0003246967,0.00030804647],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0026059183,0.00034288722,0.0005708582,0.0004476528,0.0013149377,0.00006082784,0.0011248684,0.0001838565,0.00009568797],"category_scores_gemma":[0.0009601443,0.00019443489,0.0010120167,0.0006967425,0.00087091577,0.00024935466,0.00012283142,0.00082909263,0.0000044215726],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00055999734,0.00007900021,0.000569401,0.00001745768,0.00044936204,0.00011010744,0.0024361897,0.000004764955,0.00021313819,0.9453158,0.046348203,0.0038966117],"study_design_scores_gemma":[0.0011156546,0.00024381395,0.0009219406,0.00006082201,0.00014161645,0.0014870352,0.0007790452,0.0000017608686,0.0004786926,0.9777978,0.01672847,0.00024337036],"about_ca_topic_score_codex":0.000004060562,"about_ca_topic_score_gemma":0.000008807151,"teacher_disagreement_score":0.032482013,"about_ca_system_score_codex":0.00002636854,"about_ca_system_score_gemma":0.00017677339,"threshold_uncertainty_score":0.9999852},"labels":[],"label_agreement":null},{"id":"W4240838206","doi":"10.1002/jgt.20291","title":"A better bound for the cop number of general graphs","year":2008,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":32,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Wilfrid Laurier University","keywords":"Combinatorics; Mathematics; Sublinear function; Upper and lower bounds; Vertex (graph theory); Graph; Discrete mathematics","score_opus":0.032428926191031715,"score_gpt":0.3078512286830073,"score_spread":0.2754223024919756,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4240838206","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9895638,0.00083298,0.006367,0.00020890127,0.0008666802,0.00020302058,0.000017997438,0.00001066412,0.0019289586],"genre_scores_gemma":[0.98757946,0.0002892057,0.010662203,0.0005339243,0.00039204257,0.0000070495607,5.064556e-7,0.00003744843,0.00049816136],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99835634,0.0002136311,0.00070845906,0.000107569205,0.00037054642,0.00024346334],"domain_scores_gemma":[0.9964462,0.0020624301,0.0007275989,0.00036888767,0.0003219688,0.00007294162],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017347106,0.00018099643,0.00043612454,0.00016441278,0.0004013801,0.000014896486,0.0005183292,0.00010541821,0.00018391578],"category_scores_gemma":[0.0003440755,0.00009969588,0.0007702326,0.0002068768,0.00064809324,0.00012032506,0.000054551398,0.00030313057,8.8859696e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005034187,0.0000862143,0.002981015,0.000053989377,0.0005522877,0.00001768912,0.0018917173,0.0000042732836,0.00058681716,0.9777148,0.014459301,0.0011484944],"study_design_scores_gemma":[0.0008970712,0.00012627969,0.0021230995,0.00003810352,0.00021208478,0.0007662287,0.00020518898,0.000007554863,0.0017725286,0.99129194,0.0024353138,0.00012463435],"about_ca_topic_score_codex":0.0000019872457,"about_ca_topic_score_gemma":9.823916e-7,"teacher_disagreement_score":0.013577129,"about_ca_system_score_codex":0.0000124856915,"about_ca_system_score_gemma":0.000049404072,"threshold_uncertainty_score":0.406548},"labels":[],"label_agreement":null},{"id":"W4240883746","doi":"10.1002/jgt.20479","title":"A note on the bichromatic numbers of graphs","year":2010,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Combinatorics; Mathematics; Induced subgraph; Graph; Bounded function; Cograph; Chordal graph; Discrete mathematics; Clique number; Upper and lower bounds; 1-planar graph; Vertex (graph theory)","score_opus":0.01658953433219941,"score_gpt":0.28605030470435655,"score_spread":0.26946077037215715,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4240883746","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9871025,0.00007699836,0.00054326985,0.00030161717,0.0012675521,0.00013607753,0.0000056136,0.000014350292,0.010552039],"genre_scores_gemma":[0.99641556,0.00003036493,0.003009042,0.0002920993,0.0001325965,0.0000019157594,1.2985e-7,0.000027340522,0.00009092642],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981207,0.000352951,0.0007123866,0.0001026959,0.0005033486,0.00020788547],"domain_scores_gemma":[0.99474335,0.003468388,0.0009410369,0.0005650077,0.00019135713,0.00009086932],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034864407,0.00018784174,0.00041104853,0.000327714,0.00019725646,0.00001936907,0.00069668813,0.0001297257,0.00039110464],"category_scores_gemma":[0.001600573,0.000096783064,0.0005564565,0.0003304425,0.0005603299,0.00008854459,0.000056241024,0.0008462501,0.000002839533],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017876537,0.000101173566,0.00021121107,0.000046793266,0.0001855548,0.000012127427,0.0020747534,0.0000014927213,0.0058263424,0.9884782,0.001565613,0.0013179765],"study_design_scores_gemma":[0.00039245444,0.00019602779,0.00081584754,0.00011503658,0.00012563942,0.00015846147,0.00046440068,0.00000442549,0.0051875873,0.99206406,0.00036494373,0.000111127425],"about_ca_topic_score_codex":0.0000015152402,"about_ca_topic_score_gemma":0.0000048622205,"teacher_disagreement_score":0.010461113,"about_ca_system_score_codex":0.000008170486,"about_ca_system_score_gemma":0.000045564946,"threshold_uncertainty_score":0.42823216},"labels":[],"label_agreement":null},{"id":"W4241642908","doi":"10.1002/jgt.20428","title":"Subgraph‐avoiding coloring of graphs","year":2009,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Combinatorics; Monochromatic color; Mathematics; Graph; Chromatic scale; Induced subgraph; Integer (computer science); Discrete mathematics; Physics; Vertex (graph theory); Computer science","score_opus":0.028258918804683928,"score_gpt":0.2992367960539937,"score_spread":0.2709778772493098,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4241642908","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98889536,0.0012694726,0.0026684976,0.000071802286,0.0006797731,0.00010512882,0.000003863818,0.000027571426,0.0062785526],"genre_scores_gemma":[0.99505043,0.00024536776,0.004377527,0.00011083165,0.000131833,6.26579e-7,2.107912e-7,0.000021476735,0.00006170803],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977056,0.0004177098,0.0009715399,0.0001371385,0.00047392177,0.00029408935],"domain_scores_gemma":[0.99694914,0.0012089008,0.0010641329,0.00034663774,0.0002988382,0.0001323294],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036369967,0.00021945615,0.00060926646,0.0008079172,0.0002473523,0.000020823458,0.0005372438,0.0001315785,0.00006989076],"category_scores_gemma":[0.0007849402,0.00016180096,0.0006995906,0.00056393776,0.00023078558,0.00023299166,0.000043541608,0.0005630513,4.4709074e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00038050077,0.000118945805,0.0011899894,0.00004790063,0.00019307683,0.000031999207,0.001649737,0.000007619428,0.0068327542,0.98528874,0.000499042,0.0037596675],"study_design_scores_gemma":[0.0006321267,0.0004966825,0.0034922056,0.00018093857,0.00015479773,0.00017284867,0.0008019251,0.000002019395,0.01076631,0.9829608,0.00017200326,0.0001673148],"about_ca_topic_score_codex":6.2586673e-7,"about_ca_topic_score_gemma":5.315883e-7,"teacher_disagreement_score":0.0062168445,"about_ca_system_score_codex":0.000019330808,"about_ca_system_score_gemma":0.00003453385,"threshold_uncertainty_score":0.6598051},"labels":[],"label_agreement":null},{"id":"W4245919572","doi":"10.1002/rsa.20123","title":"Regular subgraphs of random graphs","year":2006,"lang":"en","type":"article","venue":"Random Structures and Algorithms","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Random regular graph; Combinatorics; struct; Mathematics; Graph; Random graph; Regular graph; Strongly regular graph; Discrete mathematics; Constant (computer programming); Line graph; Pathwidth; Graph power; Computer science","score_opus":0.011113094537414308,"score_gpt":0.25131214853708483,"score_spread":0.24019905399967054,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4245919572","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98736936,0.0035750465,0.0044801338,0.000062227096,0.00057517656,0.00057829544,0.000077033445,0.00011259666,0.0031701315],"genre_scores_gemma":[0.9856436,0.00021837115,0.013563173,0.00004092973,0.0002297566,0.000013530048,0.000014657997,0.000040397754,0.0002355463],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980927,0.00015547127,0.00062110723,0.00037735788,0.00038887703,0.00036445144],"domain_scores_gemma":[0.9984576,0.00061273325,0.0002832005,0.0004507507,0.000103910366,0.00009180691],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004997211,0.0003382095,0.00078942056,0.00021770077,0.00032054575,0.0000426756,0.00024533152,0.00018830232,0.00010338708],"category_scores_gemma":[0.00011743681,0.00023611079,0.00033701336,0.00026273014,0.0004382476,0.000092859904,0.000095815536,0.00020517588,2.6402765e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00078347203,0.000042452866,0.0014365272,0.0001908957,0.00017584398,0.000016673643,0.00037417377,0.000019372534,0.0014375862,0.9846565,0.0016169974,0.009249476],"study_design_scores_gemma":[0.010671,0.00006317393,0.004119426,0.000034216257,0.00013675817,0.00006729628,0.00008663065,0.00018243935,0.0051037427,0.9781603,0.0010787072,0.00029626492],"about_ca_topic_score_codex":0.00011009266,"about_ca_topic_score_gemma":0.000013772852,"teacher_disagreement_score":0.009887528,"about_ca_system_score_codex":0.0000073694496,"about_ca_system_score_gemma":0.000015131363,"threshold_uncertainty_score":0.96283185},"labels":[],"label_agreement":null},{"id":"W4246567502","doi":"10.2307/1559027","title":"Nine Cubits or Simple Soma","year":2002,"lang":"en","type":"article","venue":"College Mathematics Journal","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Facilitator; Asia pacific; Mathematics; Variety (cybernetics); Simple (philosophy); Mathematical sciences; Mathematics education; Computer science; Management; Sociology; Political science; Economics; Law; Statistics","score_opus":0.0868080895867511,"score_gpt":0.3087881062209089,"score_spread":0.2219800166341578,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4246567502","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7949323,0.0012527183,0.018686894,0.0012506811,0.0023106227,0.0011264932,0.0001452724,0.00045657845,0.1798384],"genre_scores_gemma":[0.8572984,0.0002644485,0.095999844,0.00040995263,0.001269812,0.000021357257,0.0000015369947,0.00016745215,0.044567205],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977087,0.00010003567,0.000853454,0.00020581347,0.0006033466,0.00052866014],"domain_scores_gemma":[0.9976749,0.0008431809,0.0004502536,0.00055540627,0.0001983183,0.0002779503],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00072179706,0.000325308,0.00055840524,0.0002223797,0.0008770459,0.00010794823,0.00059255096,0.00016166632,0.011183781],"category_scores_gemma":[0.001305338,0.00021218321,0.0002590496,0.000369012,0.00012561204,0.0001936214,0.0001815757,0.0005373696,0.00009188434],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003626523,0.00059200963,0.000054040633,0.00027682225,0.00022177165,0.00048031006,0.0046281866,0.000006698928,0.00015287122,0.7520745,0.23984903,0.00162753],"study_design_scores_gemma":[0.0010880529,0.00019733823,0.000017323982,0.00012781646,0.00011225873,0.0043843486,0.0009367745,0.002998118,0.00042371187,0.97422266,0.0151289385,0.0003626389],"about_ca_topic_score_codex":2.460048e-7,"about_ca_topic_score_gemma":0.0000038173785,"teacher_disagreement_score":0.22472009,"about_ca_system_score_codex":0.00007276543,"about_ca_system_score_gemma":0.000034549557,"threshold_uncertainty_score":0.9897201},"labels":[],"label_agreement":null},{"id":"W4247184689","doi":"10.5539/jmr.v1n1p0","title":"Journal of Mathematics Research, Vol. 1, No. 1, March 2009","year":2009,"lang":"en","type":"article","venue":"Journal of Mathematics Research","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Southwestern University of Finance and Economics; Chulalongkorn University","keywords":"Mathematics; Mathematics education","score_opus":0.17955056847033657,"score_gpt":0.4607909316625539,"score_spread":0.28124036319221735,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4247184689","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9331971,0.00365636,0.01100953,0.0029558775,0.0035411958,0.0017357016,0.00004509823,0.00006278584,0.043796364],"genre_scores_gemma":[0.5605623,0.0023724446,0.42346364,0.0001331886,0.005992908,0.000009140039,0.0000015130262,0.0002374919,0.0072273696],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98594654,0.001501753,0.003476065,0.00028758333,0.007346862,0.0014412035],"domain_scores_gemma":[0.96903664,0.008352931,0.0019174496,0.0012063144,0.018817779,0.0006689057],"candidate_categories":["metaresearch","metaepi_narrow","research_integrity"],"consensus_categories":["metaresearch"],"category_scores_codex":[0.044312544,0.0004284607,0.0015341456,0.0028037643,0.0007534062,0.00032532285,0.002968913,0.00043432484,0.00071068597],"category_scores_gemma":[0.039384685,0.00029570272,0.00075970555,0.00141747,0.0008382952,0.00054023083,0.0004837811,0.004735356,0.00008435342],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00047335558,0.005562476,0.00012514123,0.0024200673,0.0007423137,0.0009529546,0.014996495,0.00002993929,0.008899512,0.5145869,0.44557223,0.005638615],"study_design_scores_gemma":[0.0013711393,0.0024562634,0.00012779656,0.0014646782,0.00009341724,0.0013927205,0.0054017887,0.0005084983,0.0027315042,0.9750532,0.009109375,0.00028960977],"about_ca_topic_score_codex":0.0000037076275,"about_ca_topic_score_gemma":0.0000027849405,"teacher_disagreement_score":0.46046633,"about_ca_system_score_codex":0.00036646667,"about_ca_system_score_gemma":0.00075618183,"threshold_uncertainty_score":0.9999495},"labels":[],"label_agreement":null},{"id":"W4248026952","doi":"10.1002/jgt.20314","title":"Hamiltonian threshold for strong products of graphs","year":2008,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Mathematics; Combinatorics; Hamiltonian (control theory); Graph; Product (mathematics); Discrete mathematics; Geometry","score_opus":0.05477626846595595,"score_gpt":0.2982860674113209,"score_spread":0.24350979894536495,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4248026952","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99151266,0.0015774067,0.0030730069,0.000095695184,0.00087965315,0.00032042226,0.000022044538,0.000020967313,0.0024981291],"genre_scores_gemma":[0.9858664,0.00022918153,0.013321554,0.00006120926,0.00022487223,0.0000043933255,7.697679e-7,0.00004023486,0.00025134184],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981476,0.00013861408,0.00085384824,0.00016235985,0.0004083462,0.0002892334],"domain_scores_gemma":[0.9972962,0.00067674875,0.00093385036,0.00043462618,0.00055643695,0.00010211381],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018960723,0.00021196187,0.0005794678,0.00046269628,0.00026314403,0.000008969364,0.0004968681,0.0001158577,0.000035691086],"category_scores_gemma":[0.00068703975,0.00014990562,0.000558869,0.00031495123,0.00048645344,0.0001858037,0.000054970864,0.00030654337,3.049815e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00057158933,0.00015522593,0.0016439381,0.00017540873,0.00032537148,0.00002086566,0.0018303108,0.000009843605,0.002079191,0.9894866,0.00294733,0.0007543526],"study_design_scores_gemma":[0.00096921885,0.00043119956,0.001964885,0.00009893701,0.00014561224,0.00033047653,0.00034530813,0.0000035822118,0.0081792185,0.98670965,0.000659633,0.00016228129],"about_ca_topic_score_codex":5.9399827e-7,"about_ca_topic_score_gemma":9.157375e-7,"teacher_disagreement_score":0.010248547,"about_ca_system_score_codex":0.000018368393,"about_ca_system_score_gemma":0.000088816,"threshold_uncertainty_score":0.6112974},"labels":[],"label_agreement":null},{"id":"W4250341181","doi":"10.1002/jgt.20416","title":"Proof of a conjecture on fractional Ramsey numbers","year":2009,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Mathematics; Combinatorics; Ramsey's theorem; Conjecture; Generalization; Ramsey theory; Circulant matrix; Discrete mathematics; Integer (computer science); Circulant graph; Graph; Line graph","score_opus":0.0183920116111076,"score_gpt":0.29888762282226716,"score_spread":0.28049561121115957,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4250341181","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97086495,0.00050720957,0.0063360096,0.000541985,0.0009345504,0.00020830666,0.000014088998,0.000023168399,0.020569716],"genre_scores_gemma":[0.99665153,0.000024521034,0.0023881304,0.0004981706,0.00025284698,6.326194e-7,5.0208445e-7,0.000015727448,0.00016794098],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99836373,0.00024566945,0.0006085936,0.00011071697,0.00049306906,0.00017821242],"domain_scores_gemma":[0.99774384,0.0008540492,0.00085008226,0.00025470415,0.00020341006,0.00009390321],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013372798,0.00017569102,0.00042591145,0.00031874378,0.000114071896,0.000013115476,0.00030558067,0.00014567065,0.00026252188],"category_scores_gemma":[0.0005301257,0.00011721285,0.0004401375,0.00020771693,0.00016542601,0.00011931286,0.00001703477,0.0005429067,8.0215733e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009404092,0.00024393242,0.00015149305,0.000030576135,0.00020292678,0.000028356093,0.0009068834,0.000060095794,0.000556012,0.98785096,0.0032199703,0.0058083762],"study_design_scores_gemma":[0.00075736566,0.0007682878,0.0011669514,0.0001349964,0.00008972154,0.00025308016,0.00022606087,0.000002648642,0.005168052,0.99048483,0.0008270621,0.000120958124],"about_ca_topic_score_codex":3.5894746e-7,"about_ca_topic_score_gemma":3.615579e-7,"teacher_disagreement_score":0.025786564,"about_ca_system_score_codex":0.00002522974,"about_ca_system_score_gemma":0.000053788703,"threshold_uncertainty_score":0.4779801},"labels":[],"label_agreement":null},{"id":"W4251015925","doi":"10.1016/s1359-6128(21)00126-9","title":"Alfa Laval AB, Sweden","year":2021,"lang":"en","type":"article","venue":"Pump Industry Analyst","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Combinatorics; Multipartite; Mathematics; Bipartite graph; Monochromatic color; Conjecture; Graph; Edge coloring; Complete graph; Complete coloring; Integer (computer science); Discrete mathematics; Graph power; Line graph; Physics; Computer science","score_opus":0.0531525432252837,"score_gpt":0.32758833423934614,"score_spread":0.27443579101406246,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4251015925","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.924863,0.000234514,0.00018297497,0.0009915065,0.0004741768,0.00007987554,0.000031668114,0.00011432592,0.07302799],"genre_scores_gemma":[0.98682445,0.000025405276,0.0010350686,0.00037332342,0.0005410956,0.0000070529672,0.000016511452,0.00002723172,0.01114985],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99860096,0.00014329942,0.00032457119,0.0003138933,0.0003008188,0.00031644115],"domain_scores_gemma":[0.9987838,0.00021395792,0.00011187212,0.0006229296,0.00012536354,0.00014202436],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00033582817,0.0001856857,0.00031107542,0.00007720804,0.00027295927,0.000065141365,0.00027520262,0.00046101236,0.0021756412],"category_scores_gemma":[0.0004837578,0.0001578742,0.00019856644,0.00041364125,0.00008748834,0.000094547046,0.00019295732,0.00080808374,0.000032056523],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004145597,0.00034237624,0.03881152,0.00019030913,0.0012877163,0.00091660913,0.0016677944,0.00006857926,0.0033042282,0.88601387,0.060826935,0.0065285848],"study_design_scores_gemma":[0.00091770035,0.00004581187,0.008430066,0.00012129742,0.000620417,0.0003445137,0.0024275344,0.00028422632,0.041431308,0.87733674,0.06718292,0.0008574831],"about_ca_topic_score_codex":0.000020512693,"about_ca_topic_score_gemma":0.000031415293,"teacher_disagreement_score":0.06196149,"about_ca_system_score_codex":0.000031181306,"about_ca_system_score_gemma":0.00007804392,"threshold_uncertainty_score":0.9987365},"labels":[],"label_agreement":null},{"id":"W4252689016","doi":"10.5948/upo9781614444053.004","title":"Background","year":2015,"lang":"en","type":"book-chapter","venue":"","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Span (engineering); Mathematics; Class (philosophy); Life span; Combinatorics; Computer science; Artificial intelligence","score_opus":0.14741047094862286,"score_gpt":0.3314011147787063,"score_spread":0.18399064383008346,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4252689016","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000022705148,0.0003816243,0.00019400327,0.00002804963,0.00053574925,0.00012757063,0.000016105421,0.000122842,0.99857134],"genre_scores_gemma":[0.0004879925,0.000029679377,0.004338666,0.00013167664,0.0004019475,0.0000015560393,0.000008392595,0.00007721211,0.99452287],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991101,0.000007854313,0.0002343958,0.00021521833,0.00029035666,0.00014205166],"domain_scores_gemma":[0.99899155,0.00014594849,0.00011336586,0.00055348605,0.000102915976,0.000092728515],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00021263583,0.00025954703,0.00033642937,0.00007303033,0.00006867449,0.000020434987,0.00024047284,0.0003679923,0.009020678],"category_scores_gemma":[0.000029330751,0.00018531604,0.00015437322,0.0000071500995,0.00009882055,0.000030053514,0.00017554179,0.0002781129,0.00023369335],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004310746,0.000002164565,1.8332493e-7,0.000027506496,0.000055483044,0.00000815304,0.000045612258,2.2528916e-8,2.1805722e-7,0.80836153,0.19052915,0.00096566655],"study_design_scores_gemma":[0.00006163047,0.000013761745,1.7066742e-7,0.000019933224,0.00003503179,0.000010204984,0.000007119775,5.907885e-7,0.0000012609853,0.5573771,0.44233012,0.0001430889],"about_ca_topic_score_codex":0.000001315629,"about_ca_topic_score_gemma":0.0000063855373,"teacher_disagreement_score":0.25180095,"about_ca_system_score_codex":0.000041793286,"about_ca_system_score_gemma":0.000035128192,"threshold_uncertainty_score":0.9918852},"labels":[],"label_agreement":null},{"id":"W4253190912","doi":"10.1002/jgt.10041","title":"Projectivity and independent sets in powers of graphs","year":2002,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":22,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina; Champlain Regional College; Concordia University","funders":"","keywords":"Mathematics; Combinatorics; Graph; Discrete mathematics","score_opus":0.02923283402548195,"score_gpt":0.2822847666308228,"score_spread":0.25305193260534087,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4253190912","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99485254,0.0012323892,0.00015991347,0.000045070643,0.00025584773,0.00012573859,0.0000046143537,0.000007099203,0.003316759],"genre_scores_gemma":[0.9983903,0.00033825435,0.0011495575,0.00004197362,0.00002099953,0.0000011322221,6.843755e-8,0.000015594098,0.00004211975],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984178,0.00036278373,0.0005814889,0.000118945,0.00033507252,0.00018393046],"domain_scores_gemma":[0.9984342,0.0006291782,0.000551454,0.0002065281,0.000102899205,0.00007574838],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021371914,0.00014818336,0.00042119884,0.00065692654,0.000063030566,0.00001183489,0.00021917096,0.000112495596,0.000099257166],"category_scores_gemma":[0.0004058779,0.00010697973,0.00020336518,0.0003069463,0.00025648222,0.00017059785,0.0000651523,0.00040750133,2.275552e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003165372,0.00033801503,0.026122963,0.00014460739,0.00020138777,0.00007881418,0.0074425233,0.000004076188,0.0007027854,0.95545304,0.0004104468,0.008784823],"study_design_scores_gemma":[0.0008550936,0.00021818186,0.0151707055,0.00011033842,0.000048605063,0.00022459983,0.0007946384,0.000010473136,0.0005965905,0.9818168,0.000041160423,0.00011277216],"about_ca_topic_score_codex":0.0000029009877,"about_ca_topic_score_gemma":0.0000069048,"teacher_disagreement_score":0.02636382,"about_ca_system_score_codex":0.00001849343,"about_ca_system_score_gemma":0.0000133734975,"threshold_uncertainty_score":0.4362507},"labels":[],"label_agreement":null},{"id":"W4281381743","doi":"10.33915/etd.11291","title":"Polychromatic colorings of certain subgraphs of complete graphs and maximum densities of substructures of a hypercube","year":2022,"lang":"en","type":"dissertation","venue":"","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Combinatorics; Hypercube; Mathematics; Edge coloring; Graph; Discrete mathematics; Complete coloring; Graph power; Line graph","score_opus":0.023578768911016165,"score_gpt":0.28125686023400653,"score_spread":0.25767809132299035,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4281381743","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9927721,0.0009796842,0.0000055077007,0.000004945093,0.0002487656,0.0004499518,0.0002691587,0.000023390878,0.0052464665],"genre_scores_gemma":[0.9961912,0.00015410605,0.0030475487,0.000011998068,0.000005176747,0.000015373631,0.000113794114,0.00005537847,0.00040541808],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974121,0.0001548359,0.0013054959,0.0002870286,0.0006202313,0.000220338],"domain_scores_gemma":[0.996518,0.0011071955,0.0014955804,0.00055309467,0.00027457922,0.00005152003],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00033747274,0.00038166373,0.0015156943,0.00073233695,0.00009934825,0.0000057130214,0.00040230775,0.00025397443,0.0005141661],"category_scores_gemma":[0.00022287946,0.00032096973,0.00040366864,0.000392599,0.00041427932,0.000050275743,0.0001117029,0.00025287617,3.5782765e-8],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000635568,0.00009290552,0.0030352236,0.011708815,0.0007465555,0.000003410817,0.012157936,0.0000027236915,0.03725297,0.933831,0.00014229275,0.0003906337],"study_design_scores_gemma":[0.00054189505,0.00045338977,0.015148261,0.00037338978,0.0005116697,0.000017904964,0.016314939,0.000014694098,0.07466186,0.89164823,0.000016617945,0.00029714944],"about_ca_topic_score_codex":0.0006181062,"about_ca_topic_score_gemma":0.0003304303,"teacher_disagreement_score":0.042182736,"about_ca_system_score_codex":0.000013567138,"about_ca_system_score_gemma":0.00006927381,"threshold_uncertainty_score":0.99992424},"labels":[],"label_agreement":null},{"id":"W4283395067","doi":"10.48550/arxiv.2206.10733","title":"Improved bounds for the triangle case of Aharoni's rainbow generalization of the Caccetta-Häggkvist conjecture","year":2022,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Combinatorics; Conjecture; Rainbow; Digraph; Generalization; Mathematics; Simple (philosophy); Graph; Physics; Philosophy; Mathematical analysis","score_opus":0.08835410217544953,"score_gpt":0.23626611241493453,"score_spread":0.147912010239485,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4283395067","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9604798,0.0002851266,0.0337713,0.00014224461,0.0016584358,0.0020742044,0.0008187378,0.000050634717,0.00071954215],"genre_scores_gemma":[0.99744564,0.000051713458,0.0002928167,0.00006546918,0.00010511074,0.0000077961995,0.000025713445,0.00003878615,0.0019669316],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99858695,0.00030284212,0.0003692084,0.0004315865,0.00009280707,0.00021662001],"domain_scores_gemma":[0.9966977,0.00085061206,0.0008798379,0.0013368935,0.00019454757,0.000040404284],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061615225,0.00027454578,0.00048148446,0.00011611814,0.0006136701,0.000024563642,0.0010494614,0.00024376607,0.00020670723],"category_scores_gemma":[0.00033023,0.0001841493,0.0006361219,0.00036319703,0.00035832348,0.000045326815,0.0011742911,0.0004640873,8.473236e-8],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002620913,0.000090445465,0.00032497884,0.00062670396,0.0006156103,0.00004868282,0.0018803356,0.026023526,0.00016790176,0.9680527,0.0017097294,0.00019732634],"study_design_scores_gemma":[0.0020816568,0.00012648743,0.00011855807,0.000060165203,0.0013562505,0.000054063643,0.001504714,0.049540166,0.0015072466,0.9401961,0.00304182,0.00041278612],"about_ca_topic_score_codex":0.00028068337,"about_ca_topic_score_gemma":0.00019472615,"teacher_disagreement_score":0.036965888,"about_ca_system_score_codex":0.00012697275,"about_ca_system_score_gemma":0.00018891299,"threshold_uncertainty_score":0.75093913},"labels":[],"label_agreement":null},{"id":"W4287509483","doi":"","title":"The Complexity of two Colouring Games","year":2021,"lang":"en","type":"report","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Computer science; Mathematics","score_opus":0.06207962320583051,"score_gpt":0.30701679974243445,"score_spread":0.24493717653660393,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4287509483","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07668584,0.009359003,0.013955045,0.004544828,0.0015377544,0.0008541612,0.00021100199,0.00027377493,0.8925786],"genre_scores_gemma":[0.8503589,0.0062503032,0.06386951,0.000053318145,0.0001447959,0.00006781932,0.00026063516,0.00015252552,0.07884221],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9927515,0.004696326,0.00081566424,0.00046725431,0.0009243666,0.00034490743],"domain_scores_gemma":[0.98622406,0.0056360606,0.0010538911,0.0025453572,0.0044378643,0.000102741746],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010539982,0.00031090993,0.0005977481,0.00010213584,0.0008510886,0.0001806459,0.0012932644,0.00022514202,0.0001953842],"category_scores_gemma":[0.008152605,0.00024005042,0.00038690685,0.00032439714,0.0012118021,0.000054453012,0.001055405,0.000613171,0.0000026417729],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000056205195,0.0001447932,0.0004016351,0.00031406962,0.00018764354,0.0000051985994,0.0029890856,8.664971e-7,0.00019321767,0.9768557,0.006234614,0.012667547],"study_design_scores_gemma":[0.00056720997,4.854555e-7,0.0016174609,0.0030265804,0.00020802193,0.000079350706,0.00037718174,0.00035562736,0.030249845,0.8041001,0.15886942,0.00054874993],"about_ca_topic_score_codex":0.00057795976,"about_ca_topic_score_gemma":0.002734186,"teacher_disagreement_score":0.8137364,"about_ca_system_score_codex":0.00012452167,"about_ca_system_score_gemma":0.00060515705,"threshold_uncertainty_score":0.97889715},"labels":[],"label_agreement":null},{"id":"W4287779518","doi":"10.48550/arxiv.2005.05253","title":"Graph sequences sampled from Robinson graphons","year":2020,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Combinatorics; Bounded function; Measurable function; Graph; Mathematics; Embedding; Norm (philosophy); Converse; Discrete mathematics; Mathematical analysis; Computer science; Geometry; Philosophy; Artificial intelligence","score_opus":0.13753406468422363,"score_gpt":0.22258012521397402,"score_spread":0.08504606052975039,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4287779518","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95814955,0.00018078147,0.033697158,0.00012782292,0.0013267723,0.00048815281,0.0005459559,0.0005098608,0.0049739424],"genre_scores_gemma":[0.99544096,0.00040688994,0.0032855917,0.00018302359,0.00022086347,0.0000016458584,0.000103531405,0.00005928278,0.0002982145],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975424,0.0002851298,0.00034251116,0.0012636619,0.00014745582,0.00041886984],"domain_scores_gemma":[0.997352,0.0006088538,0.00041959638,0.0012316871,0.00011610908,0.00027173702],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00018903051,0.00055652944,0.0007252822,0.00028733004,0.0003731184,0.000076178694,0.0014067589,0.00056349713,0.00042787023],"category_scores_gemma":[0.00018755652,0.0005621715,0.00066391425,0.000566435,0.0003711332,0.00013391559,0.0014629418,0.0010710954,0.000029441544],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012023718,0.000065915716,0.0030779978,0.00015130927,0.0006229964,0.0003353075,0.0012376432,0.0021235324,0.00014962461,0.9897779,0.00224918,0.000088320485],"study_design_scores_gemma":[0.00045678281,0.000039960392,0.0007969085,0.00011861991,0.00044222313,0.00000214284,0.00036952514,0.0020920355,0.0002451318,0.9941644,0.0006415042,0.00063078],"about_ca_topic_score_codex":0.00066413946,"about_ca_topic_score_gemma":0.00020789947,"teacher_disagreement_score":0.037291404,"about_ca_system_score_codex":0.000096664044,"about_ca_system_score_gemma":0.000116211035,"threshold_uncertainty_score":0.99968296},"labels":[],"label_agreement":null},{"id":"W4290075478","doi":"10.1007/s00440-022-01157-6","title":"Sandwiching dense random regular graphs between binomial random graphs","year":2022,"lang":"en","type":"article","venue":"Probability Theory and Related Fields","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Algorithm; Computer science","score_opus":0.01600536925798802,"score_gpt":0.2504034316844254,"score_spread":0.2343980624264374,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4290075478","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9908312,0.0009850938,0.0012010508,0.00029034124,0.0007305331,0.0009274943,0.000032858086,0.00021487034,0.004786543],"genre_scores_gemma":[0.99850935,0.00007023895,0.0005306611,0.00014491202,0.0000576543,0.000066447894,0.00001596565,0.00003592705,0.0005688281],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9953302,0.0026083572,0.0007197185,0.0005786567,0.00033593967,0.0004271018],"domain_scores_gemma":[0.99532205,0.0035682137,0.00022953004,0.0006799524,0.000051036608,0.000149238],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.006658604,0.00033129772,0.0006521771,0.00019653687,0.0016143372,0.000049540457,0.00039274877,0.00039640337,0.000713862],"category_scores_gemma":[0.000984333,0.00026060626,0.00040809182,0.0003689637,0.00046680484,0.00012179286,0.00047633497,0.001432593,0.0000016888174],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002867641,0.000103517574,0.0028726438,0.00013188575,0.00042341236,0.000020523683,0.006005752,0.00006939955,0.000072107396,0.9838785,0.0002568013,0.0032977941],"study_design_scores_gemma":[0.0054952987,0.00017648342,0.0003857308,0.000025227882,0.00031006002,0.00007010194,0.00040183068,0.000045738274,0.00022862987,0.99201584,0.00049325987,0.00035180166],"about_ca_topic_score_codex":0.000009221039,"about_ca_topic_score_gemma":0.0000024717365,"teacher_disagreement_score":0.0081373155,"about_ca_system_score_codex":0.00003450629,"about_ca_system_score_gemma":0.00003536767,"threshold_uncertainty_score":0.9999846},"labels":[],"label_agreement":null},{"id":"W4292421708","doi":"10.48550/arxiv.2208.08499","title":"Every graph is eventually Turán-good","year":2022,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; University of Manitoba; Simon Fraser University; University of Victoria","funders":"","keywords":"Combinatorics; Conjecture; Graph; Mathematics; Discrete mathematics","score_opus":0.0941072416809275,"score_gpt":0.2176915039840033,"score_spread":0.1235842623030758,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4292421708","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9501438,0.0002302116,0.0052994606,0.000071778195,0.0021528497,0.00063268974,0.00028659744,0.0003854728,0.040797126],"genre_scores_gemma":[0.98485625,0.00033585727,0.0006230872,0.0003045099,0.00015072802,0.0000031877983,0.000039888047,0.00007966523,0.013606857],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99742776,0.00031925808,0.00035524738,0.0011653475,0.00023238175,0.0005000079],"domain_scores_gemma":[0.9970945,0.00038026008,0.00044464454,0.0017680994,0.00012300895,0.00018946332],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00045907244,0.00054223795,0.0006139002,0.00043970664,0.0005734514,0.00005028616,0.0016230402,0.00045788477,0.003452845],"category_scores_gemma":[0.00009806046,0.0005921332,0.000774029,0.0005307642,0.0002055673,0.00013452534,0.003573961,0.0014324824,0.000027161323],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011220868,0.00016835393,0.0027272813,0.00029253322,0.0005726093,0.00038474088,0.001441829,0.0029344596,0.000007687254,0.9840434,0.0071892496,0.00012560755],"study_design_scores_gemma":[0.00049683225,0.00006464821,0.00062106736,0.000068577036,0.0003817558,0.000009930629,0.0005958741,0.00082027825,0.000048934508,0.9909535,0.0052442923,0.00069431675],"about_ca_topic_score_codex":0.000057107107,"about_ca_topic_score_gemma":0.000016930479,"teacher_disagreement_score":0.034712404,"about_ca_system_score_codex":0.0002266942,"about_ca_system_score_gemma":0.00015584967,"threshold_uncertainty_score":0.999653},"labels":[],"label_agreement":null},{"id":"W4293236967","doi":"10.1137/21m1403163","title":"On the Cardinality of Sets in $R^d$ Obeying a Slightly Obtuse Angle Bound","year":2022,"lang":"en","type":"article","venue":"SIAM Journal on Discrete Mathematics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"ShanghaiTech University; University of Toronto; Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Combinatorics; Mathematics; Cardinality (data modeling); Conjecture; Vertex (graph theory); Polytope; Regular polygon; Function (biology); Upper and lower bounds; Graph; Discrete mathematics; Geometry; Mathematical analysis","score_opus":0.0437667565335654,"score_gpt":0.30989252401753464,"score_spread":0.26612576748396927,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4293236967","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98471683,0.00011797225,0.0004180989,0.00059725397,0.00040722807,0.00036485348,0.000053081414,0.000025147288,0.013299513],"genre_scores_gemma":[0.99666935,0.000020254693,0.0026699423,0.00028211845,0.00006063795,0.000025022431,0.0000015353935,0.000048715927,0.00022243237],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99698186,0.000551955,0.0008653026,0.00020374703,0.0010190215,0.0003781179],"domain_scores_gemma":[0.9964892,0.0019555867,0.00068388815,0.0007113718,0.000067204855,0.00009274774],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029396163,0.0002715738,0.00054566236,0.00022842103,0.00079590274,0.00007613258,0.00071987737,0.00006455966,0.0005038796],"category_scores_gemma":[0.00092983234,0.00016637247,0.00035101362,0.00037361812,0.00013720569,0.00007882494,0.00029400244,0.0010845787,0.0000037427071],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000107737505,0.00030644413,0.00019096484,0.00016058754,0.0001242135,0.00008084081,0.009732057,0.0002692001,0.00013140141,0.98648524,0.002186481,0.00022484102],"study_design_scores_gemma":[0.0005319971,0.00033929775,0.00021893611,0.00021162069,0.00005645473,0.00020897241,0.0040547224,0.0005659375,0.0003928941,0.9925521,0.00065637584,0.00021067006],"about_ca_topic_score_codex":0.000003959381,"about_ca_topic_score_gemma":0.000004082592,"teacher_disagreement_score":0.01307708,"about_ca_system_score_codex":0.0001826624,"about_ca_system_score_gemma":0.00006554809,"threshold_uncertainty_score":0.67844725},"labels":[],"label_agreement":null},{"id":"W4293298833","doi":"10.37236/10774","title":"Planar Turán Numbers of Cycles: A Counterexample","year":2022,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"National Science Foundation","keywords":"Combinatorics; Mathematics; Conjecture; Counterexample; Planar graph; Upper and lower bounds; Planar; Graph; Vertex (graph theory); Discrete mathematics; Mathematical analysis","score_opus":0.017569061698572492,"score_gpt":0.2723036695560613,"score_spread":0.2547346078574888,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4293298833","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9925931,0.002297624,0.0017214686,0.00028493188,0.0008169177,0.00013904685,0.000009235277,0.000014015832,0.0021236222],"genre_scores_gemma":[0.99945265,0.00013907572,0.000033602006,0.00008245986,0.000060628085,0.0000028498084,6.293793e-7,0.0000237545,0.00020433444],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99807423,0.00028289622,0.0005290777,0.00008001856,0.0006588762,0.000374884],"domain_scores_gemma":[0.99808925,0.0006508212,0.0007529316,0.00032659774,0.0001366002,0.000043781532],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019419786,0.00013041786,0.0003387388,0.00010532097,0.00035004166,0.000010628546,0.00086205103,0.000036271766,0.000112530644],"category_scores_gemma":[0.00015024986,0.00008751335,0.00020754091,0.00030718886,0.00009418067,0.00006093806,0.00012313206,0.00094438944,4.2250372e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013400373,0.00012212768,0.00022203162,0.000021966662,0.00019324727,0.0000075270523,0.0020080297,0.00003231497,0.00013999295,0.9940024,0.0030397747,0.000076554315],"study_design_scores_gemma":[0.00072061445,0.0005995597,0.00008377841,0.000011628534,0.00009969997,0.00045086732,0.0013627034,0.00001829353,0.0003350395,0.9897852,0.0064385524,0.00009406897],"about_ca_topic_score_codex":0.00000845817,"about_ca_topic_score_gemma":0.0000029919404,"teacher_disagreement_score":0.006859529,"about_ca_system_score_codex":0.0002779303,"about_ca_system_score_gemma":0.00025450703,"threshold_uncertainty_score":0.4102955},"labels":[],"label_agreement":null},{"id":"W4300427120","doi":"10.1002/jgt.22899","title":"Spanning trees in graphs of high minimum degree with a universal vertex II: A tight result","year":2022,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Comisión Nacional de Investigación Científica y Tecnológica; Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Conjecture; Degree (music); Vertex connectivity; Minimum degree spanning tree; Graph; Discrete mathematics","score_opus":0.02316656221824536,"score_gpt":0.24907062528834673,"score_spread":0.22590406307010136,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4300427120","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99608517,0.0005162276,0.00031539184,0.000112942274,0.00037995997,0.00013433416,0.000024726893,0.00001502199,0.0024162447],"genre_scores_gemma":[0.9963468,0.000044033743,0.0032275748,0.00006832694,0.000036875113,0.000003308027,0.0000012586689,0.00003499091,0.00023687414],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975108,0.00060952926,0.00075081456,0.00018394786,0.00065286556,0.00029206282],"domain_scores_gemma":[0.9975735,0.00088899897,0.0009228413,0.0003635441,0.00015564206,0.000095475756],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020388798,0.00022362814,0.0006069961,0.0011000072,0.00035385982,0.000011583711,0.00063618197,0.00007447171,0.00021843161],"category_scores_gemma":[0.000211427,0.00016147051,0.0003047939,0.00083735754,0.0003275573,0.00017601406,0.00023250598,0.0007069824,1.3465025e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0043299524,0.0003164621,0.002344049,0.000042207696,0.00038159764,0.0003612703,0.008753038,0.0002466014,0.0009520607,0.97969264,0.0010210841,0.0015590566],"study_design_scores_gemma":[0.0028590902,0.0014732714,0.0057311403,0.00017510475,0.0001670401,0.00033807068,0.0054291137,0.000017229662,0.0005465474,0.98271394,0.00033827062,0.00021117255],"about_ca_topic_score_codex":0.000016841701,"about_ca_topic_score_gemma":0.000032028835,"teacher_disagreement_score":0.0033870912,"about_ca_system_score_codex":0.000065066255,"about_ca_system_score_gemma":0.00011339102,"threshold_uncertainty_score":0.65845764},"labels":[],"label_agreement":null},{"id":"W4302013643","doi":"","title":"Edge clique covers in graphs with independence number two","year":2021,"lang":"en","type":"article","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; Université de Sherbrooke; Université de Montréal","funders":"","keywords":"Clique; Independence number; Independence (probability theory); Enhanced Data Rates for GSM Evolution; Combinatorics; Clique-sum; Mathematics; Chordal graph; Computer science; 1-planar graph; Graph; Artificial intelligence; Statistics","score_opus":0.0136522752678748,"score_gpt":0.257247142271955,"score_spread":0.2435948670040802,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4302013643","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.77383536,0.00014664006,0.01684479,0.0014628157,0.000114858114,0.000205963,0.000014804993,0.000112630994,0.20726214],"genre_scores_gemma":[0.95754355,0.00010766385,0.036183137,0.00016346287,0.000008717743,0.000020308204,0.000024750772,0.00003019639,0.0059181885],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9959633,0.0026333774,0.00032308832,0.00042454296,0.00036185217,0.00029386816],"domain_scores_gemma":[0.99582994,0.0017293214,0.00017360195,0.0011965941,0.00096453837,0.00010602125],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027669712,0.00018852364,0.00024685755,0.00008971769,0.00025073183,0.00011422365,0.00050057087,0.00012115257,0.00048281706],"category_scores_gemma":[0.0013052139,0.00016961635,0.00009384079,0.0006210336,0.00022248646,0.00016864539,0.00030597122,0.0004129248,0.000013433429],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015948737,0.00020246413,0.023231028,0.000034848836,0.000029601431,0.000031825293,0.005454535,0.000005904928,0.0007042151,0.96692955,0.0003043742,0.003055673],"study_design_scores_gemma":[0.0020847195,6.6621965e-7,0.011525702,0.0010629934,0.00004378702,0.00015426551,0.0007122695,0.0006158878,0.08664049,0.8896814,0.006896398,0.0005814305],"about_ca_topic_score_codex":0.0002662627,"about_ca_topic_score_gemma":0.0043100547,"teacher_disagreement_score":0.20134395,"about_ca_system_score_codex":0.000056459485,"about_ca_system_score_gemma":0.00016566116,"threshold_uncertainty_score":0.6916754},"labels":[],"label_agreement":null},{"id":"W4302305671","doi":"10.48550/arxiv.2210.01190","title":"Counting cycles in planar triangulations","year":2022,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Vlaamse regering; Natural Sciences and Engineering Research Council of Canada; Fonds Wetenschappelijk Onderzoek","keywords":"Combinatorics; Omega; Planar; Vertex (graph theory); Triangulation; Mathematics; Order (exchange); Hamiltonian path; Logarithm; Physics; Geometry; Mathematical analysis; Computer science; Graph; Quantum mechanics","score_opus":0.12402416319775174,"score_gpt":0.23453103404064635,"score_spread":0.11050687084289461,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4302305671","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9802665,0.00005523728,0.0026548933,0.000030342964,0.0005366763,0.00032076178,0.000082443534,0.00012404895,0.015929103],"genre_scores_gemma":[0.9976386,0.00005140194,0.0006402302,0.00003890048,0.00007641873,0.0000016764483,0.000035498993,0.000030587784,0.0014866857],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99866635,0.00020386036,0.00025003892,0.00053328916,0.00009091147,0.00025553512],"domain_scores_gemma":[0.99854034,0.00045081807,0.00024818984,0.00066708855,0.00003696098,0.000056602774],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004263284,0.00022965865,0.00034401764,0.00037700232,0.0003121444,0.00002749489,0.0006053042,0.00021570396,0.00056935265],"category_scores_gemma":[0.00015306173,0.0002639633,0.00019588,0.00036243675,0.00008774188,0.000078375604,0.0008129305,0.0007783095,0.0000045988577],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004813415,0.000056342564,0.015757501,0.00010219303,0.00007418799,0.0002011738,0.0008342693,0.027192568,0.00000382187,0.95531535,0.00035233016,0.00006214231],"study_design_scores_gemma":[0.00048278677,0.000011672113,0.005356033,0.000053856278,0.000088505665,0.0000024765304,0.0007920122,0.008647494,0.000005148674,0.9834371,0.00081078295,0.00031210508],"about_ca_topic_score_codex":0.00012982785,"about_ca_topic_score_gemma":0.00015578436,"teacher_disagreement_score":0.028121792,"about_ca_system_score_codex":0.00021328636,"about_ca_system_score_gemma":0.00007501838,"threshold_uncertainty_score":0.9999813},"labels":[],"label_agreement":null},{"id":"W4303438707","doi":"10.1002/jgt.22897","title":"Spanning trees in graphs of high minimum degree with a universal vertex I: An asymptotic result","year":2022,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Fondo Nacional de Desarrollo Científico, Tecnológico y de Innovación Tecnológica; Comisión Nacional de Investigación Científica y Tecnológica; Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Conjecture; Vertex (graph theory); Degree (music); Minimum degree spanning tree; Graph; Discrete mathematics; Spanning tree","score_opus":0.02759842679262543,"score_gpt":0.26144774214522915,"score_spread":0.23384931535260373,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4303438707","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9974306,0.00030256508,0.0004282417,0.000053204185,0.00035632477,0.00012791093,0.000020145759,0.000016172267,0.0012647884],"genre_scores_gemma":[0.9962459,0.000028459843,0.0035065974,0.00006059712,0.000037371123,0.0000025457646,0.0000017192568,0.000038653114,0.000078157645],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99727196,0.0008605799,0.0007357908,0.00019488664,0.0006435895,0.00029318244],"domain_scores_gemma":[0.997534,0.0009080105,0.0008717186,0.0004103408,0.00015784171,0.000118094154],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023120765,0.00022230226,0.0005878174,0.0010777748,0.00024401964,0.000016053338,0.0006778599,0.00007254867,0.00015444546],"category_scores_gemma":[0.00020748886,0.00016566986,0.0002491925,0.0007503765,0.00031900342,0.00025841035,0.00013970876,0.00066647277,1.3462368e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.004049492,0.0003752592,0.004738246,0.000042869397,0.00031743123,0.0003365977,0.0072236075,0.00073175726,0.0008605832,0.9789914,0.00021618458,0.002116567],"study_design_scores_gemma":[0.0025790217,0.0018163176,0.014180219,0.00013664432,0.00017222334,0.000350026,0.008853506,0.000040168678,0.00033094603,0.97127473,0.000052572716,0.00021362181],"about_ca_topic_score_codex":0.000020338006,"about_ca_topic_score_gemma":0.00004414013,"teacher_disagreement_score":0.009441973,"about_ca_system_score_codex":0.00006511801,"about_ca_system_score_gemma":0.00011039549,"threshold_uncertainty_score":0.67558205},"labels":[],"label_agreement":null},{"id":"W4304692595","doi":"10.1007/s00373-022-02576-x","title":"Counterexamples to Hedetniemi’s Conjecture with Large Fractional Chromatic Numbers","year":2022,"lang":"en","type":"article","venue":"Graphs and Combinatorics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Royal Military College of Canada","funders":"","keywords":"Mathematics; Combinatorics; Counterexample; Conjecture; Chromatic scale; Value (mathematics); Discrete mathematics; Statistics","score_opus":0.01471567413436825,"score_gpt":0.25568655270044993,"score_spread":0.24097087856608168,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4304692595","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99480724,0.00021744758,0.00069937145,0.00022645024,0.0005188479,0.00030506513,0.000089549525,0.00010899228,0.0030270563],"genre_scores_gemma":[0.9983756,0.000015428097,0.00057304266,0.0006349266,0.000017615565,0.00007421359,0.000012518493,0.000030767154,0.00026590473],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987229,0.0000767385,0.00019325137,0.0002722276,0.00044510383,0.0002897961],"domain_scores_gemma":[0.99919033,0.0002459665,0.000099937104,0.00028833703,0.000050872717,0.00012457954],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002922937,0.00019567879,0.0002523742,0.0001295522,0.001001658,0.000046335077,0.00020448088,0.000050606028,0.00033462443],"category_scores_gemma":[0.00003725907,0.00015557752,0.00006402423,0.00041465173,0.000056960485,0.000060679533,0.0002227228,0.00030288752,0.0000012806127],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000047724403,0.0001148944,0.0060604042,0.000054682725,0.00007763954,0.000017876084,0.0014277138,0.000008556719,0.00000848161,0.9866548,0.0054352027,0.00009201077],"study_design_scores_gemma":[0.0008176505,0.00029599504,0.0024804103,0.000014221789,0.00004624667,0.00013681494,0.0013718934,0.000039653074,0.000019050167,0.9659527,0.028572055,0.00025329107],"about_ca_topic_score_codex":0.000016493164,"about_ca_topic_score_gemma":0.000013033159,"teacher_disagreement_score":0.023136852,"about_ca_system_score_codex":0.000051171122,"about_ca_system_score_gemma":0.00003255413,"threshold_uncertainty_score":0.7704045},"labels":[],"label_agreement":null},{"id":"W4307556936","doi":"10.26493/2590-9770.1491.14a","title":"Subgraphs of Kneser graphs with large girth and large chromatic number","year":2022,"lang":"en","type":"article","venue":"The Art of Discrete and Applied Mathematics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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":"Combinatorics; Mathematics; Conjecture; Chromatic scale; Girth (graph theory); Graph; Induced subgraph; Discrete mathematics; Vertex (graph theory)","score_opus":0.010036157103522793,"score_gpt":0.24493886255851816,"score_spread":0.23490270545499536,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4307556936","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.980111,0.00011599817,0.0012165548,0.000075883974,0.000022903821,0.0005189065,0.00011032789,0.000033144705,0.017795265],"genre_scores_gemma":[0.98960245,0.00004256781,0.009989917,0.00006859544,0.000009809563,0.000056002653,0.000007243816,0.00003955728,0.00018384482],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99857867,0.00005215999,0.00045244646,0.00019717151,0.00043201612,0.00028754532],"domain_scores_gemma":[0.9985247,0.00044339322,0.000378967,0.00056166854,0.00003236678,0.000058882702],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00085034483,0.00022989434,0.0005236897,0.00007100974,0.000468887,0.000015278823,0.0002753731,0.00004330456,0.0002125343],"category_scores_gemma":[0.000026470096,0.00013457358,0.00008490251,0.00025731037,0.00032187405,0.000047923913,0.0004739747,0.00020309941,7.087798e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000059114776,0.00017723319,0.0005739415,0.00074261293,0.0001615305,0.0000012271643,0.008660128,0.0000017303271,0.00045548537,0.98867375,0.00043336715,0.00005990949],"study_design_scores_gemma":[0.0011443406,0.0001333408,0.00031776776,0.00006385657,0.00024219266,0.00005452567,0.008523331,0.00017592307,0.0012207109,0.98728466,0.0006140388,0.00022531768],"about_ca_topic_score_codex":0.0000012578748,"about_ca_topic_score_gemma":0.000006130804,"teacher_disagreement_score":0.01761142,"about_ca_system_score_codex":0.000004904822,"about_ca_system_score_gemma":0.000012111951,"threshold_uncertainty_score":0.54877514},"labels":[],"label_agreement":null},{"id":"W4313589773","doi":"10.26493/1855-3974.2698.6fe","title":"An extension of the Erdős-Ko-Rado theorem to uniform set partitions","year":2023,"lang":"en","type":"article","venue":"Ars Mathematica Contemporanea","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; University of Regina","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Partition (number theory); Combinatorics; Extension (predicate logic); Block (permutation group theory); Set (abstract data type); Discrete mathematics","score_opus":0.07039809403969605,"score_gpt":0.3332737596129833,"score_spread":0.26287566557328723,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4313589773","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98339653,0.000015868125,0.0010077974,0.0012773074,0.00033719814,0.0009706124,0.00010424106,0.00030924066,0.012581213],"genre_scores_gemma":[0.99588376,0.0000067830374,0.0028538408,0.00030242844,0.000042254243,0.00005602476,0.00001224874,0.000058461188,0.00078416936],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99791855,0.00021306629,0.000676741,0.0003249237,0.0004934266,0.00037327124],"domain_scores_gemma":[0.9971018,0.00068233866,0.00027025808,0.0016177983,0.00016611075,0.00016168962],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001353386,0.00025974592,0.00047332502,0.00016278053,0.0003929689,0.000036792535,0.00071643555,0.00011656391,0.00017380025],"category_scores_gemma":[0.00085019495,0.00015976165,0.00023906109,0.00071510323,0.0002487639,0.00014122012,0.00024704117,0.0001841103,0.00008154404],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002987903,0.00010836271,0.00017149067,0.00022000738,0.0000612547,0.000008352443,0.008766935,0.000020065214,0.002574077,0.9799181,0.0077039693,0.00041746162],"study_design_scores_gemma":[0.0003273223,0.00009457193,0.00071285834,0.00024379282,0.00006444958,0.000020147105,0.002127544,0.00079272426,0.0028482925,0.9915796,0.0009668282,0.0002218915],"about_ca_topic_score_codex":0.000008404737,"about_ca_topic_score_gemma":0.000018342882,"teacher_disagreement_score":0.012487268,"about_ca_system_score_codex":0.000022260574,"about_ca_system_score_gemma":0.000043817472,"threshold_uncertainty_score":0.6514891},"labels":[],"label_agreement":null},{"id":"W4317461927","doi":"10.48550/arxiv.2301.06485","title":"Exact values and improved bounds on $k$-neighborly families of boxes","year":2023,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Mathematics; Combinatorics; Applied mathematics; Algorithm","score_opus":0.08893233972488104,"score_gpt":0.2283312719554899,"score_spread":0.13939893223060887,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4317461927","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99247515,0.00007303737,0.0012590605,0.000020654194,0.00060035207,0.0002965342,0.000103508915,0.00019922202,0.004972507],"genre_scores_gemma":[0.9950993,0.00071200816,0.0003850515,0.000025085748,0.00007962952,9.107497e-7,0.0000110704505,0.000051805146,0.0036351432],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99853677,0.00013339007,0.00027001777,0.0006878578,0.00009906456,0.00027289568],"domain_scores_gemma":[0.99786633,0.0006951293,0.0003309346,0.00090144406,0.00011092816,0.00009525522],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00032291855,0.00036252307,0.0005568618,0.00036994505,0.00020270827,0.00003807124,0.00052270864,0.00036443767,0.000029846155],"category_scores_gemma":[0.00021542227,0.00034229073,0.0002460127,0.00023113501,0.00042317584,0.00008056028,0.0010286282,0.0004983177,0.0000046054065],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002400521,0.0000965815,0.0041563325,0.0009281833,0.0005024565,0.00007822427,0.001930872,0.00084544416,0.0001804709,0.9899092,0.0007290054,0.00040320103],"study_design_scores_gemma":[0.0004227821,0.0001414406,0.003670553,0.00021091398,0.00022130023,0.000001410344,0.00076033274,0.003833568,0.00045499,0.98984724,0.00007335494,0.00036212945],"about_ca_topic_score_codex":0.00012441452,"about_ca_topic_score_gemma":0.00003203853,"teacher_disagreement_score":0.0029881238,"about_ca_system_score_codex":0.00005797168,"about_ca_system_score_gemma":0.000057654626,"threshold_uncertainty_score":0.9999029},"labels":[],"label_agreement":null},{"id":"W4317565756","doi":"10.5281/zenodo.7552628","title":"Monochromatic forests of finite subsets of N","year":2000,"lang":"en","type":"article","venue":"","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Monochromatic color; Mathematics; Computer science; Physics; Optics","score_opus":0.026388718318155868,"score_gpt":0.2900170374687323,"score_spread":0.26362831915057644,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4317565756","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9397021,0.000039611972,0.0003444155,0.000010837842,0.000030233656,0.00008850286,0.0000063315815,0.00002080801,0.059757162],"genre_scores_gemma":[0.9898392,0.000012159827,0.008669444,0.000019115361,0.000011464903,0.0000020064037,9.1388796e-7,0.000009559396,0.0014361179],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993721,0.000028012708,0.00029742895,0.00007283389,0.0001305422,0.00009906722],"domain_scores_gemma":[0.99919635,0.0003641447,0.000082167426,0.0003021215,0.000029649336,0.000025594873],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00013054971,0.00007432053,0.0002099945,0.000045672165,0.000025352338,0.0000020877046,0.00014570415,0.000048150694,0.0033910316],"category_scores_gemma":[0.000090919944,0.000052184903,0.00008365146,0.000090078756,0.0000829316,0.000034866756,0.00002188274,0.000038647515,0.0000063959415],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005366638,0.00012635524,0.0040362095,0.00047295203,0.000094132076,0.00000282301,0.002295895,0.000055667544,0.0004459848,0.9774623,0.0018116074,0.013142389],"study_design_scores_gemma":[0.00025083078,0.00005129219,0.0066402266,0.00004384295,0.000025650406,0.0000033257231,0.00004122049,0.000544423,0.009853607,0.98236597,0.00010658943,0.00007303078],"about_ca_topic_score_codex":0.000009933055,"about_ca_topic_score_gemma":0.000015764917,"teacher_disagreement_score":0.058321044,"about_ca_system_score_codex":0.0000030074123,"about_ca_system_score_gemma":0.0000079327165,"threshold_uncertainty_score":0.99752},"labels":[],"label_agreement":null},{"id":"W4318774077","doi":"10.1090/proc/16404","title":"Large subsets of Euclidean space avoiding infinite arithmetic progressions","year":2023,"lang":"en","type":"article","venue":"Proceedings of the American Mathematical Society","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia; McGill University; Centre for Research on Brain Language and Music","funders":"Centre for Research on Brain, Language and Music","keywords":"Algorithm; Annotation; Type (biology); Artificial intelligence; Computer science; Mathematics; Biology","score_opus":0.026420814293441487,"score_gpt":0.31058442612498544,"score_spread":0.2841636118315439,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4318774077","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9946129,0.000020029442,0.000280091,0.00068990776,0.00006098512,0.00040786745,0.000025732594,0.0001738764,0.003728655],"genre_scores_gemma":[0.97657585,0.00003981011,0.022846116,0.00009469019,0.00005210258,0.000030115247,7.2248173e-7,0.000050797775,0.00030977288],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99790156,0.00003568426,0.0006319087,0.0002713213,0.00065801333,0.0005015234],"domain_scores_gemma":[0.9972122,0.0011979031,0.0009441874,0.0003016695,0.0002354319,0.00010860988],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016476589,0.00024815433,0.00070368545,0.000072068,0.00041279447,0.000026777476,0.0007315158,0.000083362225,0.000042504926],"category_scores_gemma":[0.0025957415,0.00015365514,0.00063654454,0.0015426037,0.0009977297,0.000095542055,0.0007941888,0.00042220467,0.000007942853],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021109245,0.0002132234,0.007708887,0.0014204213,0.00020758541,3.7013135e-7,0.015158713,8.6233933e-7,0.00744529,0.95979255,0.0077703455,0.00026062812],"study_design_scores_gemma":[0.0002724135,0.00007133046,0.002958709,0.0004280191,0.00014154414,0.000008577239,0.011754505,0.0011560752,0.009275172,0.973528,0.00019180709,0.00021382411],"about_ca_topic_score_codex":0.0000025258435,"about_ca_topic_score_gemma":2.0710213e-7,"teacher_disagreement_score":0.022566024,"about_ca_system_score_codex":0.000029576862,"about_ca_system_score_gemma":0.00002511931,"threshold_uncertainty_score":0.6265875},"labels":[],"label_agreement":null},{"id":"W4320917315","doi":"10.1002/rsa.21145","title":"Approximately counting independent sets in bipartite graphs via graph containers","year":2023,"lang":"en","type":"article","venue":"Random Structures and Algorithms","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"National Science Foundation","keywords":"Bipartite graph; Mathematics; Combinatorics; Complete bipartite graph; Discrete mathematics; Cograph; Maximal independent set; Partition (number theory); Line graph; Graph; 1-planar graph","score_opus":0.024999747221256044,"score_gpt":0.29259423499592785,"score_spread":0.2675944877746718,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4320917315","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.996388,0.0004603299,0.0009663156,0.000087164786,0.0006410274,0.0005746581,0.000041173735,0.00023956773,0.0006017262],"genre_scores_gemma":[0.9968826,0.0002999728,0.0024330653,0.00012272736,0.00009898755,0.000044198376,0.000025826299,0.000050700786,0.000041927302],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977524,0.00014907774,0.00055433816,0.00049135194,0.00043603743,0.0006167647],"domain_scores_gemma":[0.99877197,0.00052462396,0.0001854348,0.00032274492,0.00005709559,0.00013812985],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00095821556,0.00036269036,0.00062071916,0.00048031315,0.00036203777,0.00010416996,0.00024742834,0.00020612424,0.000058574027],"category_scores_gemma":[0.00016345031,0.0002741801,0.00017037439,0.00070404465,0.00020253264,0.00014781248,0.0001826677,0.00038004742,0.000002325891],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016956015,0.0001235529,0.036141105,0.001190025,0.00078612415,0.00069426384,0.015244836,0.00031032026,0.005927874,0.8427499,0.0023355442,0.09280088],"study_design_scores_gemma":[0.00598595,0.00004618209,0.011570141,0.00005531703,0.00004848387,0.00007847745,0.00071495184,0.004465833,0.00089916616,0.9754576,0.00025673475,0.00042117512],"about_ca_topic_score_codex":0.000091421556,"about_ca_topic_score_gemma":0.000060202317,"teacher_disagreement_score":0.13270772,"about_ca_system_score_codex":0.000021229202,"about_ca_system_score_gemma":0.00001739229,"threshold_uncertainty_score":0.99997103},"labels":[],"label_agreement":null},{"id":"W4323838401","doi":"10.1080/0025570x.2023.2176684","title":"Still Spinning: The Moser Spindle at Sixty","year":2023,"lang":"en","type":"article","venue":"Mathematics Magazine","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Mathematics; Outreach; Plane (geometry); Unit (ring theory); Chromatic scale; Mathematics education; Simple (philosophy); Object (grammar); Field (mathematics); Geometry; Combinatorics; Pure mathematics; Computer science; Artificial intelligence; Epistemology","score_opus":0.055977830869660614,"score_gpt":0.313930641589793,"score_spread":0.2579528107201324,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4323838401","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95159596,0.00012717255,0.0013732277,0.0013280046,0.000721907,0.0007268406,0.000034116198,0.0008212387,0.043271534],"genre_scores_gemma":[0.8989201,0.00006283857,0.020603534,0.0006085681,0.00054453016,0.00011331192,0.00003494606,0.0002208175,0.07889132],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99798054,0.000070924514,0.00054565916,0.00031133613,0.0005449128,0.0005466519],"domain_scores_gemma":[0.99742705,0.0009447614,0.00024337752,0.0011867722,0.00009405074,0.00010402101],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0011121221,0.00032279288,0.00040624032,0.00013587586,0.0004023103,0.00006512171,0.0006559964,0.00013325026,0.00067884306],"category_scores_gemma":[0.0007312574,0.00019362645,0.00020739133,0.00063528115,0.00022084928,0.00007429969,0.00070878584,0.00027489642,0.0011853161],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016766862,0.0001281184,0.00035215914,0.00050160725,0.00017523758,0.000046381283,0.009836258,0.000041882562,0.0014112805,0.85462046,0.13218859,0.0006812869],"study_design_scores_gemma":[0.00038688045,0.000042992182,0.0015137544,0.00007828506,0.000106514184,0.000054766046,0.00029962577,0.0030019432,0.00076657266,0.94690037,0.046528675,0.00031963215],"about_ca_topic_score_codex":0.0000011200822,"about_ca_topic_score_gemma":0.000007858952,"teacher_disagreement_score":0.092279926,"about_ca_system_score_codex":0.000056225625,"about_ca_system_score_gemma":0.000018399041,"threshold_uncertainty_score":0.99959236},"labels":[],"label_agreement":null},{"id":"W43332027","doi":"10.1007/978-3-540-72053-9_14","title":"Random Convex Bodies Lacking Symmetric Projections, Revisited Through Decoupling","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in mathematics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Regular polygon; Decoupling (probability); Mathematics; Geometry; Engineering","score_opus":0.06808607056031507,"score_gpt":0.32965726017017316,"score_spread":0.2615711896098581,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W43332027","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00057179545,0.010213608,0.43822044,0.000114376526,0.0012358716,0.0029036475,0.00007545667,0.0006082032,0.5460566],"genre_scores_gemma":[0.0502364,0.0054918486,0.89862096,0.0014203178,0.0029262695,0.0001324979,0.00016244911,0.001373784,0.039635453],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99590665,0.00006130112,0.0017185748,0.0007531537,0.00084281614,0.00071752805],"domain_scores_gemma":[0.99009764,0.0072172596,0.0010920679,0.0012152361,0.00028866087,0.00008913276],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0016085699,0.0010536495,0.0019329712,0.0010926264,0.00042799034,0.00012751977,0.000620971,0.0014018324,0.00045902433],"category_scores_gemma":[0.004333673,0.00085760094,0.00057228043,0.0003537563,0.00029983214,0.00012747411,0.00030925428,0.001893812,0.00003214973],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006965901,0.00007458143,0.00004808189,0.0028693439,0.0003739532,0.00007849471,0.005399024,0.000078271456,0.000008736053,0.9871585,0.00031980674,0.0035215896],"study_design_scores_gemma":[0.0010083414,0.000055450968,0.0000022104525,0.0025168904,0.0004299152,0.00012018193,0.000053377214,0.0009502996,0.00026334936,0.98648566,0.0072015445,0.00091280066],"about_ca_topic_score_codex":0.000007740297,"about_ca_topic_score_gemma":0.00006332678,"teacher_disagreement_score":0.50642115,"about_ca_system_score_codex":0.0002692718,"about_ca_system_score_gemma":0.000080049336,"threshold_uncertainty_score":0.99989456},"labels":[],"label_agreement":null},{"id":"W4360602557","doi":"10.1016/j.disc.2023.113422","title":"Inverse problems associated with subsequence sums in C ⊕ C II","year":2023,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University","funders":"Tianjin Municipal Education Commission; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Subsequence; Mathematics; Combinatorics; Sequence (biology); Prime (order theory); Inverse; Abelian group; Longest increasing subsequence; Group (periodic table); Finite group; Discrete mathematics; Bounded function","score_opus":0.047809160837042064,"score_gpt":0.2866357103713065,"score_spread":0.2388265495342644,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4360602557","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98946965,0.000015005647,0.0003691049,0.00013620188,0.00010110751,0.00052910077,0.000030238394,0.0003905641,0.008959033],"genre_scores_gemma":[0.9915932,0.000024311179,0.0058142794,0.00006304045,0.000028691513,0.00007668336,0.00003335239,0.00008198091,0.00228449],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981516,0.000080144644,0.00048915786,0.00029503513,0.00046123966,0.0005228124],"domain_scores_gemma":[0.9984749,0.00057021534,0.0002383999,0.00055397645,0.00007119107,0.00009130135],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00092424836,0.0002811528,0.00043956834,0.00023744274,0.00026692293,0.0000404691,0.00038273341,0.00014964797,0.000070832226],"category_scores_gemma":[0.0009210739,0.00019871604,0.00009202531,0.0010536616,0.00020436174,0.00014660519,0.00024209588,0.0002843389,0.000025322488],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021182352,0.00021775109,0.0044301455,0.00059492106,0.00017019306,0.0001317437,0.03278121,0.00027499086,0.00042109747,0.95839304,0.0024182054,0.00014554354],"study_design_scores_gemma":[0.0007041829,0.00011108704,0.0011114603,0.00056111737,0.00005121025,0.0000124144835,0.0016141086,0.006839774,0.0002675352,0.98821163,0.00012876478,0.00038672306],"about_ca_topic_score_codex":0.0000105960125,"about_ca_topic_score_gemma":0.0002340939,"teacher_disagreement_score":0.031167101,"about_ca_system_score_codex":0.0000712766,"about_ca_system_score_gemma":0.000038635615,"threshold_uncertainty_score":0.8103405},"labels":[],"label_agreement":null},{"id":"W4360609439","doi":"10.1093/qmath/haad013","title":"Towards a characterization of Sidorenko systems","year":2023,"lang":"en","type":"article","venue":"The Quarterly Journal of Mathematics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Entropy (arrow of time); Property (philosophy); Combinatorics; Physics; Quantum mechanics","score_opus":0.03577565332034752,"score_gpt":0.2921120887286506,"score_spread":0.2563364354083031,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4360609439","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9891981,0.00006881137,0.009026823,0.00016381586,0.0007241075,0.0002003758,0.0000157802,0.00003760562,0.0005646127],"genre_scores_gemma":[0.9974049,0.000057649082,0.0019943977,0.000014062913,0.00026203867,0.0000037066095,0.0000017366089,0.000032799762,0.00022876407],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99801385,0.00015002387,0.0010273313,0.00006813873,0.0005528583,0.00018781326],"domain_scores_gemma":[0.9974315,0.0005558937,0.0012677182,0.00039826287,0.00029239227,0.000054196964],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019681754,0.0001512103,0.00048397633,0.00020471422,0.00011564379,0.00003927171,0.0005219179,0.00007825898,0.00002619777],"category_scores_gemma":[0.00020719224,0.0000837217,0.00020760395,0.00035214826,0.0001084494,0.00012341149,0.000034198252,0.00019863344,0.000008431668],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000054957563,0.00023388486,0.0000496584,0.0014555849,0.00045420346,0.00003258536,0.07356046,0.000024978479,0.020576924,0.89282644,0.0014691541,0.009261151],"study_design_scores_gemma":[0.00051576894,0.0006107935,0.00047813868,0.00051932613,0.00022733197,0.000382114,0.009251753,0.0021066044,0.0016146326,0.9837036,0.00041588917,0.0001740312],"about_ca_topic_score_codex":0.0000013917469,"about_ca_topic_score_gemma":3.258224e-7,"teacher_disagreement_score":0.09087716,"about_ca_system_score_codex":0.000018015677,"about_ca_system_score_gemma":0.000042686497,"threshold_uncertainty_score":0.34140718},"labels":[],"label_agreement":null},{"id":"W4362632869","doi":"10.1017/etds.2023.18","title":"Direct and inverse results for popular differences in trees of positive dimension","year":2023,"lang":"en","type":"article","venue":"Ergodic Theory and Dynamical Systems","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"University of Sydney; Stanley Medical Research Institute","keywords":"Ergodic theory; Mathematics; Inverse; Measure (data warehouse); Type (biology); Dimension (graph theory); Extension (predicate logic); Tree (set theory); Set (abstract data type); Markov chain; Stability (learning theory); Combinatorics; Discrete mathematics; Pure mathematics; Statistics; Data mining; Computer science","score_opus":0.021257993597408174,"score_gpt":0.2698615910068015,"score_spread":0.24860359740939333,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4362632869","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99824685,0.00028386767,0.00025130968,0.000024451172,0.00022540017,0.00036069663,0.00013822436,0.00004421052,0.00042499744],"genre_scores_gemma":[0.9993559,0.000060318835,0.00008764787,0.000008608274,0.000031194537,0.000020806863,0.000015238521,0.000010990557,0.00040929296],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99871427,0.00041492554,0.00034579283,0.00023727873,0.00011349185,0.00017426611],"domain_scores_gemma":[0.9974013,0.0022607525,0.000106078434,0.00014954452,0.000022719301,0.000059608145],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013554139,0.00013094973,0.00038217905,0.00012327825,0.0001093789,0.000014768264,0.00007338962,0.000118389304,0.000001002336],"category_scores_gemma":[0.0006924367,0.00008935508,0.000050289065,0.00013125478,0.0002051403,0.000044841297,0.00008276374,0.00007395787,3.0852823e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009671362,0.00003076855,0.0021414666,0.00025164394,0.000044198383,0.000008306754,0.0029481486,0.000010358587,0.00078137085,0.992329,0.000090564296,0.00039705675],"study_design_scores_gemma":[0.0016231283,0.00029448184,0.02232284,0.0005565785,0.00005875298,0.0000128447555,0.0024724354,0.009513678,0.00016697505,0.9627041,0.000039404724,0.00023475588],"about_ca_topic_score_codex":0.00003463813,"about_ca_topic_score_gemma":0.000040611307,"teacher_disagreement_score":0.029624855,"about_ca_system_score_codex":0.000011548331,"about_ca_system_score_gemma":0.0000057445263,"threshold_uncertainty_score":0.36437947},"labels":[],"label_agreement":null},{"id":"W4362704061","doi":"10.1016/j.jctb.2023.03.002","title":"Disjoint isomorphic balanced clique subdivisions","year":2023,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Institute for Basic Science; Leverhulme Trust; UK Research and Innovation","keywords":"Combinatorics; Mathematics; Subdivision; Conjecture; Disjoint sets; Vertex (graph theory); Graph; Clique; Clique graph; Upper and lower bounds; Discrete mathematics; Line graph; Graph power","score_opus":0.026838286675701328,"score_gpt":0.30097029089983707,"score_spread":0.27413200422413575,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4362704061","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9795801,0.00012690142,0.0004743452,0.0006429618,0.014847707,0.0001917162,0.00002528705,0.00014499818,0.003965978],"genre_scores_gemma":[0.9977481,0.00017940822,0.00044530438,0.00007729911,0.00090816995,0.000004103513,0.0000028331797,0.000033706874,0.00060111145],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99779826,0.00047856494,0.00077002996,0.00014216252,0.0004839456,0.00032704553],"domain_scores_gemma":[0.9971169,0.0014503621,0.0005725795,0.00038754364,0.00031102504,0.00016159182],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00273057,0.00021766292,0.0005559785,0.00024995793,0.00033877738,0.000056642326,0.00051226607,0.00015709626,0.00028973285],"category_scores_gemma":[0.0018733152,0.00015802946,0.00033918332,0.00046042798,0.00023609187,0.0003273385,0.00020232741,0.00050469884,0.000017627253],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00093580026,0.00006612142,0.00015291883,0.000037199625,0.00012328001,0.00009112532,0.0011025331,0.000005660632,0.0006035956,0.98761207,0.008896742,0.0003729443],"study_design_scores_gemma":[0.0010682925,0.0004481692,0.0005521446,0.00008077431,0.000060763756,0.00013589083,0.0005990079,0.000003950684,0.0018577838,0.98645633,0.008552399,0.00018449296],"about_ca_topic_score_codex":4.3722758e-7,"about_ca_topic_score_gemma":3.7280728e-7,"teacher_disagreement_score":0.018167958,"about_ca_system_score_codex":0.00004494461,"about_ca_system_score_gemma":0.000087263776,"threshold_uncertainty_score":0.64442545},"labels":[],"label_agreement":null},{"id":"W4366403216","doi":"10.1016/j.disc.2023.113444","title":"An extension of the Erdős-Ko-Rado theorem to set-wise 2-intersecting families of perfect matchings","year":2023,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Combinatorics; Mathematics; Conjecture; Extension (predicate logic); Matching (statistics); Discrete mathematics; Set (abstract data type); Graph","score_opus":0.032072646748614375,"score_gpt":0.3197794347018787,"score_spread":0.2877067879532643,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4366403216","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99395466,0.00001625718,0.0023757652,0.0001087307,0.0003232623,0.0005217424,0.000060483886,0.00014795542,0.0024911512],"genre_scores_gemma":[0.9884459,0.000011533589,0.011115988,0.00006568478,0.00005524047,0.000013616659,0.00000493352,0.0000769228,0.00021018944],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99787086,0.00018115084,0.00074223254,0.00030150948,0.0005530981,0.00035115302],"domain_scores_gemma":[0.9970634,0.00094883825,0.00044604653,0.0013061264,0.0001442499,0.000091321184],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013300797,0.00029477448,0.00058566156,0.00020819162,0.00025983632,0.000030198127,0.00077334064,0.00011624718,0.00005101389],"category_scores_gemma":[0.0011683932,0.00017857327,0.00032352918,0.0006179263,0.00023006929,0.000107032436,0.0004913432,0.00022554492,0.000008783858],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006752349,0.00011783529,0.000867734,0.0018180652,0.00014439656,0.000005737789,0.1377831,0.00021404143,0.03826491,0.8185295,0.00085020915,0.0013369932],"study_design_scores_gemma":[0.00028441814,0.00016821559,0.0011149937,0.0007875837,0.0001384553,0.000020404545,0.0341763,0.005532309,0.030789174,0.92663217,0.00004305587,0.00031293507],"about_ca_topic_score_codex":0.000017691253,"about_ca_topic_score_gemma":0.000011404489,"teacher_disagreement_score":0.108102694,"about_ca_system_score_codex":0.000023404657,"about_ca_system_score_gemma":0.00002349365,"threshold_uncertainty_score":0.7282007},"labels":[],"label_agreement":null},{"id":"W4366496249","doi":"10.1007/s00283-023-10267-5","title":"The Never-Ending Happiness of Paul Erdős’s Mathematics","year":2023,"lang":"en","type":"article","venue":"The Mathematical Intelligencer","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Happiness; Mathematics; Mathematics education; Calculus (dental); Psychology; Social psychology; Medicine","score_opus":0.10059695780548746,"score_gpt":0.3683530237275923,"score_spread":0.2677560659221049,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4366496249","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6222242,0.0011396987,0.22147605,0.008782432,0.0037490497,0.004457725,0.00010374571,0.0018594706,0.13620764],"genre_scores_gemma":[0.9855939,0.00028929123,0.0060623847,0.000147769,0.00025938838,0.00012851949,0.0000029625112,0.00010791442,0.007407842],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972071,0.00016973328,0.001020469,0.00025747097,0.0007418102,0.0006034106],"domain_scores_gemma":[0.99020755,0.007918694,0.00034729345,0.0012662992,0.00016634645,0.000093822775],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002779113,0.00031915953,0.00050518,0.0001065625,0.0008961077,0.00008791819,0.0014094352,0.00014303174,0.00049325137],"category_scores_gemma":[0.0025352861,0.00014542438,0.00031683152,0.0008594409,0.00096071,0.00011228246,0.0006045486,0.00039094462,0.00023459065],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017813483,0.000058857917,0.000009481571,0.00030062612,0.00010137869,0.0000043919927,0.0051029674,0.00001535241,0.00018587186,0.9853513,0.006407761,0.002444144],"study_design_scores_gemma":[0.00007114294,0.000036667,0.000029912035,0.00017095305,0.00009142135,0.000029387556,0.0041106595,0.0063443873,0.0042416696,0.98238105,0.0022964622,0.00019630419],"about_ca_topic_score_codex":0.0000035014502,"about_ca_topic_score_gemma":0.000003542365,"teacher_disagreement_score":0.36336973,"about_ca_system_score_codex":0.000031928048,"about_ca_system_score_gemma":0.00003283101,"threshold_uncertainty_score":0.68922263},"labels":[],"label_agreement":null},{"id":"W4377818744","doi":"10.1016/j.jcta.2023.105769","title":"Integer colorings with forbidden rainbow sums","year":2023,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Rainbow; Combinatorics; Mathematics; Hypergraph; Integer (computer science); Context (archaeology); Mathematical proof; Discrete mathematics; Set (abstract data type); Computer science; Physics","score_opus":0.022721699812951343,"score_gpt":0.2807870395833798,"score_spread":0.25806533977042845,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4377818744","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98298717,0.000070754606,0.00017526903,0.0003823734,0.0060345656,0.00020381616,0.0000054670463,0.000111879795,0.010028699],"genre_scores_gemma":[0.99544233,0.000055173034,0.0008769713,0.00006984358,0.00083982025,0.000006246361,9.152538e-7,0.00005313923,0.0026555336],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982984,0.00022715586,0.0005285092,0.00013037687,0.0004993058,0.00031622418],"domain_scores_gemma":[0.9976948,0.0010359432,0.0005133303,0.00028807146,0.0003390892,0.00012875033],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021440792,0.00021455747,0.000499404,0.00023657814,0.00024870777,0.000069556714,0.0004667307,0.00012359205,0.00015367914],"category_scores_gemma":[0.00076259865,0.00013812316,0.00020338495,0.00045531444,0.0002630821,0.00039683495,0.0001491893,0.00042453903,0.000005901218],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0024263505,0.00004355629,0.00020489929,0.000047724832,0.00023089419,0.00013444893,0.0021075958,0.0000049430814,0.00013064216,0.9904899,0.0036363576,0.00054266053],"study_design_scores_gemma":[0.0014849214,0.0009947872,0.00014253728,0.00010771145,0.00008526376,0.00024389816,0.0018071893,0.0000018036512,0.0013916001,0.9701524,0.023405608,0.00018232888],"about_ca_topic_score_codex":6.08681e-7,"about_ca_topic_score_gemma":8.237391e-7,"teacher_disagreement_score":0.020337576,"about_ca_system_score_codex":0.000051054085,"about_ca_system_score_gemma":0.00009245595,"threshold_uncertainty_score":0.5632498},"labels":[],"label_agreement":null},{"id":"W4380877010","doi":"10.5817/cz.muni.eurocomb23-025","title":"A resolution of the Kohayakawa--Kreuter conjecture for the majority of cases","year":2023,"lang":"en","type":"article","venue":"","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Leverhulme Trust; UK Research and Innovation","keywords":"Conjecture; Combinatorics; Statement (logic); Monochromatic color; Bipartite graph; Mathematics; Resolution (logic); Upper and lower bounds; Function (biology); Property (philosophy); Discrete mathematics; Physics; Computer science; Graph; Mathematical analysis; Optics; Law; Artificial intelligence; Philosophy","score_opus":0.07162656052389471,"score_gpt":0.33125275667824144,"score_spread":0.25962619615434673,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4380877010","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98780555,0.00016868883,0.0032696028,0.0017236134,0.00094206794,0.0010773941,0.00017760991,0.000088347166,0.0047471477],"genre_scores_gemma":[0.99736625,0.00001167365,0.0010467189,0.00008770092,0.00006851297,0.000017252978,0.0000012175245,0.000009510901,0.001391164],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99939704,0.000055584343,0.00019962338,0.00008544212,0.00014348638,0.0001188208],"domain_scores_gemma":[0.9973181,0.002047848,0.00011307861,0.000440007,0.00006966951,0.000011291861],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041878823,0.00007297887,0.00013793889,0.000028669116,0.00016395266,0.0000046546297,0.00026013027,0.000065366,0.000060162376],"category_scores_gemma":[0.00062652683,0.000030113122,0.00016703416,0.00019148688,0.00016909553,0.000019179659,0.00012862336,0.00007417619,5.134612e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000038313196,0.000013857528,0.0003681734,0.00014434375,0.000062796804,5.1619867e-7,0.0009419464,0.000018159324,0.00037304923,0.9736792,0.023884181,0.0004754683],"study_design_scores_gemma":[0.00030413177,0.000055835237,0.0036723574,0.000029239205,0.000088361034,0.000012511252,0.0005618941,0.0007236171,0.010979684,0.9791641,0.0043429523,0.00006531286],"about_ca_topic_score_codex":0.00003891679,"about_ca_topic_score_gemma":0.00007554888,"teacher_disagreement_score":0.019541228,"about_ca_system_score_codex":0.00000611101,"about_ca_system_score_gemma":0.000016573395,"threshold_uncertainty_score":0.1261008},"labels":[],"label_agreement":null},{"id":"W4380925166","doi":"10.5817/cz.muni.eurocomb23-036","title":"A precise condition for independent transversals in bipartite covers","year":2023,"lang":"en","type":"article","venue":"","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"KU Leuven; Natural Sciences and Engineering Research Council of Canada; Institute for Basic Science; Nederlandse Organisatie voor Wetenschappelijk Onderzoek","keywords":"Bipartite graph; Combinatorics; Mathematics; Partition (number theory); Vertex (graph theory); Transversal (combinatorics); Graph; Discrete mathematics; Mathematical analysis","score_opus":0.06303990827050658,"score_gpt":0.3670395221920315,"score_spread":0.3039996139215249,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4380925166","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9882371,0.000008765921,0.003231757,0.00016106504,0.00028364948,0.0006115909,0.000058920064,0.00016882094,0.0072383303],"genre_scores_gemma":[0.9977784,0.0000142794415,0.00087777356,0.00006399351,0.000030190517,0.00008564873,0.000017030103,0.000015387479,0.0011172524],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99930453,0.00003056121,0.00019291094,0.00014519032,0.00013325439,0.00019354098],"domain_scores_gemma":[0.9993029,0.00045738363,0.000035345274,0.0001465169,0.000022064842,0.000035795427],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039340337,0.00008226739,0.00013880957,0.00014885952,0.00006266414,0.000014537938,0.00009290902,0.00007474172,0.00029922306],"category_scores_gemma":[0.0001364653,0.000066902976,0.00008054405,0.00020102764,0.000029265804,0.00007992949,0.000020334839,0.00006073026,0.000015398868],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013228867,0.000046073088,0.00070404174,0.000114149494,0.000042746455,0.000008514098,0.0035782112,0.000086893095,0.002619702,0.9772381,0.014510403,0.0009188466],"study_design_scores_gemma":[0.0012748754,0.0000542381,0.0009193297,0.000026142068,0.000019793335,0.0000017707245,0.00061773206,0.0010855083,0.011796569,0.9811549,0.002913788,0.00013532765],"about_ca_topic_score_codex":0.000005989499,"about_ca_topic_score_gemma":0.00007059469,"teacher_disagreement_score":0.011596615,"about_ca_system_score_codex":0.000023001585,"about_ca_system_score_gemma":0.00001242529,"threshold_uncertainty_score":0.32762825},"labels":[],"label_agreement":null},{"id":"W4381937347","doi":"","title":"On subsets of $\\mathbb(F)_q^n$ containing no k-term progressions","year":2010,"lang":"en","type":"preprint","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Term (time); Combinatorics; Mathematics; Discrete mathematics; Physics; Quantum mechanics","score_opus":0.02288996872827286,"score_gpt":0.2810263372468316,"score_spread":0.25813636851855876,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4381937347","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8833848,0.00024500728,0.007288277,0.0010616652,0.0008660722,0.00080603454,0.00014901812,0.00027232533,0.10592678],"genre_scores_gemma":[0.94232714,0.00010772305,0.05455927,0.000052013795,0.000041041767,0.00007587403,0.00016141756,0.0000741616,0.0026013367],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9947099,0.0029103048,0.0007690363,0.00067201955,0.00055829657,0.0003804443],"domain_scores_gemma":[0.9896115,0.0040838947,0.0010620124,0.0030211725,0.0020384176,0.0001830159],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.004679802,0.00042527317,0.00063440076,0.00023546952,0.00046860866,0.00015025708,0.001567559,0.00059388176,0.00036674202],"category_scores_gemma":[0.005550275,0.0003723338,0.0003530337,0.000185971,0.00046692332,0.000067113455,0.0017626832,0.0014614924,0.000019813713],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004275817,0.0004988081,0.0008691352,0.00040847858,0.00010804633,0.000005635296,0.010365836,0.0000031886661,0.0019521731,0.97509646,0.0007773864,0.009872109],"study_design_scores_gemma":[0.0011734775,0.0000030040778,0.0036312016,0.008563432,0.00017595553,0.000019486926,0.00018429963,0.002421826,0.052162416,0.9272777,0.0034139021,0.00097331125],"about_ca_topic_score_codex":0.00007609379,"about_ca_topic_score_gemma":0.00022293712,"teacher_disagreement_score":0.10332545,"about_ca_system_score_codex":0.00005132344,"about_ca_system_score_gemma":0.00019255502,"threshold_uncertainty_score":0.99987286},"labels":[],"label_agreement":null},{"id":"W4382864813","doi":"10.1016/j.jctb.2023.06.004","title":"Every graph is eventually Turán-good","year":2023,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; Toronto Metropolitan University; Simon Fraser University; University of Victoria","funders":"","keywords":"Combinatorics; Conjecture; Graph; Mathematics; Discrete mathematics","score_opus":0.021264963002842956,"score_gpt":0.2863046884261066,"score_spread":0.26503972542326365,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4382864813","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9665675,0.00036502117,0.00021751013,0.0005145601,0.021906706,0.0002135453,0.00002149539,0.00015542128,0.01003823],"genre_scores_gemma":[0.9948641,0.00026092603,0.00059468165,0.00019210196,0.0015266419,0.0000037964003,0.000001630156,0.00006108533,0.0024950565],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99748576,0.0004194132,0.00083048607,0.00016962184,0.0007184327,0.00037627586],"domain_scores_gemma":[0.99722683,0.0011385378,0.00066928525,0.00042841223,0.00037216424,0.00016477349],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027426076,0.00026744264,0.0005836228,0.0003699928,0.00032412316,0.000069529524,0.0006724135,0.00019859463,0.00044512798],"category_scores_gemma":[0.00090895925,0.00020285425,0.0004984078,0.0006074105,0.00021774402,0.00048126208,0.00020795348,0.00050259946,0.000017133661],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00083174603,0.000077802324,0.00013620558,0.00005385692,0.00029405567,0.000091328955,0.0026708797,0.0000023377868,0.0002529901,0.97664046,0.018304333,0.0006439888],"study_design_scores_gemma":[0.0011665293,0.0005154425,0.00026960357,0.00008497452,0.00011000353,0.00016895862,0.0010348116,9.563724e-7,0.0027175439,0.9763175,0.017385334,0.00022834165],"about_ca_topic_score_codex":5.3250363e-7,"about_ca_topic_score_gemma":2.4897741e-7,"teacher_disagreement_score":0.02829657,"about_ca_system_score_codex":0.00004289196,"about_ca_system_score_gemma":0.000103928345,"threshold_uncertainty_score":0.8272156},"labels":[],"label_agreement":null},{"id":"W4383046526","doi":"10.48550/arxiv.2306.17388","title":"Off-Diagonal Ramsey Multiplicity","year":2023,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Universities Space Research Association","keywords":"Diagonal; Monochromatic color; Multiplicity (mathematics); Combinatorics; Generalization; Graph; Mathematics; Discrete mathematics; Physics; Geometry; Mathematical analysis","score_opus":0.1958236660106923,"score_gpt":0.23644967704141756,"score_spread":0.04062601103072527,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4383046526","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9810507,0.00004724687,0.010997394,0.00005560584,0.0016142626,0.0004727175,0.00016730704,0.0007218642,0.0048728827],"genre_scores_gemma":[0.99072915,0.0002109984,0.00085148495,0.00007596154,0.00026718454,0.0000017553785,0.00003634637,0.00007943806,0.007747683],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979355,0.00019013025,0.00029290878,0.0009863547,0.00013814685,0.00045696265],"domain_scores_gemma":[0.9973583,0.0007064759,0.00030730307,0.0012914755,0.00014527762,0.00019113437],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00043171243,0.0004460095,0.0005451437,0.00028254648,0.00033307043,0.00004613107,0.0010859619,0.0006123447,0.00020062929],"category_scores_gemma":[0.00032714047,0.00046416538,0.00048750654,0.00034785955,0.0002536063,0.000087768654,0.0024747867,0.0010527343,0.00011726676],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010429365,0.000104998704,0.004961446,0.00029549314,0.00037707807,0.00039442314,0.00053743034,0.0090822,0.0000150522,0.97907484,0.004685658,0.00036711962],"study_design_scores_gemma":[0.0005146726,0.000023053388,0.0027601093,0.00010884656,0.00019556827,0.0000039298,0.00015237213,0.017931351,0.000062832674,0.9767536,0.00095167157,0.0005419764],"about_ca_topic_score_codex":0.00008983461,"about_ca_topic_score_gemma":0.00008334561,"teacher_disagreement_score":0.010145909,"about_ca_system_score_codex":0.00015390854,"about_ca_system_score_gemma":0.000097120326,"threshold_uncertainty_score":0.999781},"labels":[],"label_agreement":null},{"id":"W4385455207","doi":"10.1007/s00440-023-01221-9","title":"Correction: Sandwiching dense random regular graphs between binomial random graphs","year":2023,"lang":"en","type":"article","venue":"Probability Theory and Related Fields","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Binomial (polynomial); Random graph; Mathematical finance; Discrete mathematics; Random regular graph; Combinatorics; Statistics; Chordal graph; 1-planar graph; Graph","score_opus":0.01861621045102236,"score_gpt":0.2629004824278064,"score_spread":0.24428427197678404,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385455207","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9874666,0.00037175004,0.001485442,0.00027781547,0.0023215837,0.00078340917,0.000011614606,0.00057206326,0.0067097503],"genre_scores_gemma":[0.99738514,0.0002076869,0.0002273741,0.000066444976,0.000113812544,0.00003196228,0.000017197652,0.000035541758,0.0019148636],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9967495,0.001340287,0.0006777186,0.00054995256,0.0002456232,0.0004369008],"domain_scores_gemma":[0.9936364,0.0053500943,0.0001817385,0.0005983476,0.00007738476,0.00015601909],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.005330327,0.00032884773,0.0006208683,0.00025430694,0.000862957,0.00006500025,0.00025487217,0.00073155185,0.00019729906],"category_scores_gemma":[0.0020909572,0.0002457079,0.00037245246,0.000650018,0.00050223584,0.00015016473,0.00019719345,0.0009853529,0.000011880254],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0025471784,0.000065561966,0.0053358967,0.00023166015,0.00057458493,0.000028377066,0.006749175,0.00006642435,0.00007932382,0.97260606,0.0024553011,0.009260463],"study_design_scores_gemma":[0.0039654253,0.000101347934,0.0014841575,0.00009287897,0.00026601087,0.000044348282,0.00027391926,0.00017962926,0.00043317484,0.99255127,0.00028431255,0.00032355607],"about_ca_topic_score_codex":0.000007989636,"about_ca_topic_score_gemma":0.0000052801047,"teacher_disagreement_score":0.019945186,"about_ca_system_score_codex":0.0000193382,"about_ca_system_score_gemma":0.000027899561,"threshold_uncertainty_score":0.9999995},"labels":[],"label_agreement":null},{"id":"W4385582509","doi":"10.4153/s0008439523000607","title":"Erdős–Ko–Rado theorem in Peisert-type graphs","year":2023,"lang":"en","type":"article","venue":"Canadian Mathematical Bulletin","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Mathematics; Type (biology); Combinatorics; Discrete mathematics; Computer science; Biology","score_opus":0.03246180161981218,"score_gpt":0.2795537206804065,"score_spread":0.24709191906059433,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385582509","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8715278,0.00007971107,0.00007587393,0.004820882,0.00047852742,0.00066307,0.00003610647,0.00035342373,0.12196462],"genre_scores_gemma":[0.9914036,0.000027640188,0.001831693,0.00091655593,0.000090862035,0.000041371724,0.00001430438,0.00009395377,0.005580024],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975891,0.00016348009,0.00055058405,0.0004095584,0.00033450843,0.00095275335],"domain_scores_gemma":[0.997445,0.0010843931,0.00007755571,0.000714016,0.000072508774,0.0006065452],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0010925402,0.00031696502,0.00048808655,0.0006375746,0.00025993798,0.00006292216,0.00056362513,0.00025686374,0.013128814],"category_scores_gemma":[0.002059195,0.00026661588,0.0001673567,0.0010019159,0.0002432612,0.000033708995,0.000115852185,0.00042151162,0.00600195],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013580279,0.000026021322,0.0002853679,0.00014913084,0.000024982779,0.0001986742,0.0011306182,0.0000027824867,0.000015189233,0.94666976,0.050811905,0.000671988],"study_design_scores_gemma":[0.00030519674,0.000035004367,0.00085856835,0.00012489936,0.000021423733,0.000025582556,0.00044387486,0.00018321474,0.000044822144,0.9701905,0.027434675,0.00033219092],"about_ca_topic_score_codex":0.00035349428,"about_ca_topic_score_gemma":0.0012820847,"teacher_disagreement_score":0.11987581,"about_ca_system_score_codex":0.00012914784,"about_ca_system_score_gemma":0.00014390779,"threshold_uncertainty_score":0.9999786},"labels":[],"label_agreement":null},{"id":"W4385611729","doi":"10.1016/j.ejc.2023.103786","title":"Pure pairs. X. Tournaments and the strong Erdős-Hajnal property","year":2023,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Engineering and Physical Sciences Research Council; Natural Sciences and Engineering Research Council of Canada; Air Force Office of Scientific Research; Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Mathematics; Combinatorics; Property (philosophy)","score_opus":0.0352324415802909,"score_gpt":0.26716592679473466,"score_spread":0.23193348521444376,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385611729","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.975185,0.0005678003,0.00054446846,0.0014229616,0.002024528,0.00022135235,0.0000037466255,0.000066516914,0.019963637],"genre_scores_gemma":[0.9976683,0.00027496542,0.00020894177,0.000100541365,0.00023275941,6.143676e-7,3.9379336e-7,0.0000423983,0.0014710844],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977525,0.00085542415,0.00054956356,0.00011064605,0.0004900346,0.00024183885],"domain_scores_gemma":[0.99855375,0.0004043488,0.00046485104,0.00026254298,0.00019048764,0.00012404422],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036562784,0.00016490307,0.0003071558,0.00012337687,0.00035723814,0.00009758233,0.00050846755,0.000027328912,0.000026243773],"category_scores_gemma":[0.0006853922,0.00007502124,0.00015836403,0.00028265076,0.00020116298,0.00012945473,0.0002692871,0.00052450894,0.000009111246],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002731573,0.00008476443,0.0013841456,0.00008888849,0.0002771503,0.0007908073,0.006701084,0.000015776819,0.000030810115,0.9398753,0.04250668,0.007971444],"study_design_scores_gemma":[0.0054775705,0.0003917836,0.0037149251,0.00017287905,0.00015088821,0.00061859516,0.0017203193,0.00015078083,0.000049203634,0.9621907,0.025112506,0.00024988997],"about_ca_topic_score_codex":3.1748323e-7,"about_ca_topic_score_gemma":1.365684e-7,"teacher_disagreement_score":0.022483313,"about_ca_system_score_codex":0.000030244535,"about_ca_system_score_gemma":0.00003059595,"threshold_uncertainty_score":0.30592775},"labels":[],"label_agreement":null},{"id":"W4385964576","doi":"10.48550/arxiv.2308.01502","title":"Induced subdivisions with pinned branch vertices","year":2023,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Government of Ontario","keywords":"Combinatorics; Subdivision; Vertex (graph theory); Omega; Mathematics; Graph; Induced subgraph; Integer (computer science); Discrete mathematics; Physics; Computer science; Geography","score_opus":0.19689377480511044,"score_gpt":0.2373068948367099,"score_spread":0.04041312003159944,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385964576","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98754495,0.000017067894,0.0072469,0.000065739165,0.0006751859,0.00039739112,0.000043395612,0.00047794462,0.0035314448],"genre_scores_gemma":[0.9967839,0.00006983584,0.00037946182,0.00005295575,0.00010581932,0.0000018250528,0.000018479404,0.000078101,0.0025096333],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981925,0.00016161519,0.00023084883,0.00086394453,0.00014317236,0.00040794298],"domain_scores_gemma":[0.9976049,0.00054076634,0.0002675604,0.001264237,0.00015522845,0.00016731727],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00027653328,0.00040447214,0.00048956915,0.00031513968,0.00037933583,0.000060560425,0.00092219055,0.0004219728,0.000110948975],"category_scores_gemma":[0.00017434881,0.00035538225,0.00022363773,0.00055246305,0.0001744086,0.00012804478,0.0013006259,0.000827812,0.000050527426],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023916012,0.000117579504,0.005101992,0.00039823088,0.0006034995,0.00037512425,0.0012322131,0.0037015292,0.000088934496,0.9869255,0.0010407035,0.00017555027],"study_design_scores_gemma":[0.0006759579,0.00009821219,0.0041779242,0.000277964,0.00036142132,0.0000042757847,0.00027287798,0.0028382037,0.0002188795,0.99033415,0.0001587985,0.00058135577],"about_ca_topic_score_codex":0.000102443526,"about_ca_topic_score_gemma":0.0001862539,"teacher_disagreement_score":0.009238957,"about_ca_system_score_codex":0.00008966813,"about_ca_system_score_gemma":0.000113002054,"threshold_uncertainty_score":0.9998898},"labels":[],"label_agreement":null},{"id":"W4386234502","doi":"10.1016/j.ffa.2023.102281","title":"On the number of irreducible factors with a given multiplicity in function fields","year":2023,"lang":"en","type":"article","venue":"Finite Fields and Their Applications","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge; University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Multiplicity (mathematics); Mathematics; Pure mathematics; Function field; Field (mathematics); Mathematical analysis","score_opus":0.03546094611135513,"score_gpt":0.2800566401133997,"score_spread":0.24459569400204456,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386234502","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9784064,0.0000076892475,0.014128953,0.0004621116,0.000030422967,0.00034047378,0.00003781284,0.00004261929,0.006543491],"genre_scores_gemma":[0.9993815,0.000015519709,0.00010017071,0.00009246508,0.000021632291,0.00013627723,0.0000092372275,0.000008514606,0.0002347143],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995397,0.000027636292,0.0001320034,0.00013603363,0.00006216736,0.000102470774],"domain_scores_gemma":[0.99809945,0.0014951043,0.00005775571,0.00030230344,0.000024414583,0.000020985795],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013660359,0.00008921544,0.000115529714,0.000052838885,0.00014691052,0.00000959121,0.00010403109,0.00008606956,0.00008791515],"category_scores_gemma":[0.000054750944,0.000046663245,0.000036078007,0.00029785655,0.00005852467,0.000022589331,0.000044345157,0.00016726647,0.000004125461],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034287463,0.000056286728,0.0053533344,0.000036271987,0.00003417894,1.8527842e-7,0.0034868154,0.00006149283,0.000026320547,0.98874116,0.0007048999,0.0014647471],"study_design_scores_gemma":[0.00018385162,0.000054715183,0.012532183,0.000029472321,0.000010881861,8.9208623e-7,0.0011245323,0.00060794275,0.00037643174,0.98372304,0.0012675812,0.00008847178],"about_ca_topic_score_codex":0.000035374786,"about_ca_topic_score_gemma":0.000046136185,"teacher_disagreement_score":0.020975042,"about_ca_system_score_codex":0.0000035555838,"about_ca_system_score_gemma":0.000007118847,"threshold_uncertainty_score":0.19028719},"labels":[],"label_agreement":null},{"id":"W4386561736","doi":"10.48550/arxiv.2309.03068","title":"On the Fourier decay of multiplicative convolutions","year":2023,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; European Commission","keywords":"Multiplicative function; Exponent; Convolution (computer science); Fourier transform; Physics; Combinatorics; Energy (signal processing); Constant (computer programming); Mathematics; Mathematical analysis; Quantum mechanics","score_opus":0.2046580449944602,"score_gpt":0.24186254976829968,"score_spread":0.03720450477383949,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386561736","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9634839,0.000019333136,0.022838525,0.00018282505,0.00055170926,0.00065672206,0.00020994214,0.0001765617,0.011880457],"genre_scores_gemma":[0.9953665,0.00005790769,0.0003433647,0.000044001874,0.000045021214,0.0000029438168,0.000007755893,0.000033555258,0.004098959],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99880177,0.00020555983,0.00020648094,0.00047738227,0.00009769704,0.00021109049],"domain_scores_gemma":[0.9957866,0.0022912263,0.00033428363,0.0013602584,0.00016454417,0.00006305258],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036573486,0.0002380996,0.00031624484,0.0001614395,0.00027563237,0.000010994413,0.000839872,0.0002560186,0.000116459974],"category_scores_gemma":[0.0004183847,0.00017976691,0.0003125118,0.0003060308,0.00043964226,0.000029068364,0.0009997141,0.0005957542,0.000035924262],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004079398,0.00005060138,0.00034252924,0.00006127914,0.00023643434,0.000015228117,0.00066190225,0.0038142183,0.000009815784,0.99256796,0.0021788361,0.000020412886],"study_design_scores_gemma":[0.00021107738,0.000026863916,0.00069590326,0.0001108968,0.00015290346,6.011102e-7,0.00041492938,0.007394177,0.00025832327,0.99038535,0.0001552916,0.00019366747],"about_ca_topic_score_codex":0.00003723466,"about_ca_topic_score_gemma":0.000027139597,"teacher_disagreement_score":0.031882565,"about_ca_system_score_codex":0.00007390705,"about_ca_system_score_gemma":0.000063783824,"threshold_uncertainty_score":0.73306817},"labels":[],"label_agreement":null},{"id":"W4386755430","doi":"10.48550/arxiv.2309.06959","title":"Turán Colourings in Off-Diagonal Ramsey Multiplicity","year":2023,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Multiplicity (mathematics); Mathematics; Diagonal; Monochromatic color; Graph; Multipartite; Discrete mathematics; Ramsey's theorem; Physics; Geometry","score_opus":0.16659763893261983,"score_gpt":0.23338768383680658,"score_spread":0.06679004490418675,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386755430","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99448174,0.00003634071,0.0013961961,0.00005338502,0.00087952876,0.0005240788,0.00009869581,0.00035263202,0.0021773775],"genre_scores_gemma":[0.99487454,0.00019137519,0.0005670205,0.000065351414,0.0001388548,0.0000029920332,0.000021906273,0.0000672337,0.004070713],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99783576,0.00020087126,0.00035364332,0.0009789095,0.00013290762,0.00049789774],"domain_scores_gemma":[0.99771637,0.0007549201,0.00030153946,0.000969163,0.00010323651,0.00015478331],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00055925275,0.00043206266,0.0006030319,0.00045187297,0.0001924227,0.000040647163,0.001012255,0.00065520604,0.00011479933],"category_scores_gemma":[0.0003643959,0.00046820828,0.0003477102,0.00047245662,0.00022594677,0.000096515614,0.0022496937,0.0012879667,0.000052978543],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027309923,0.00025043913,0.038244974,0.000556756,0.00029455023,0.001221003,0.0016493261,0.025885165,0.000030638643,0.9289742,0.0023114206,0.0003084294],"study_design_scores_gemma":[0.000882061,0.000027278877,0.016077898,0.00020427156,0.00009882015,0.0000039686333,0.0002358704,0.017384069,0.00007700877,0.96398765,0.00045524546,0.0005658821],"about_ca_topic_score_codex":0.00024464543,"about_ca_topic_score_gemma":0.00039915534,"teacher_disagreement_score":0.035013426,"about_ca_system_score_codex":0.00026559742,"about_ca_system_score_gemma":0.00010382804,"threshold_uncertainty_score":0.99977696},"labels":[],"label_agreement":null},{"id":"W4386857812","doi":"10.1016/j.procs.2023.08.244","title":"Graphs with constant balancing number","year":2023,"lang":"en","type":"article","venue":"Procedia Computer Science","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Combinatorics; Constant (computer programming); Edge coloring; Graph; Graph coloring; Computer science; Upper and lower bounds; Mathematics; Exponential function; Discrete mathematics; Line graph; Graph power","score_opus":0.019963923861310913,"score_gpt":0.28054158056314554,"score_spread":0.26057765670183464,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386857812","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.960785,0.0000116366655,0.031368725,0.00012557337,0.0007775552,0.0002091173,0.000002732193,0.0005062301,0.0062134387],"genre_scores_gemma":[0.9392172,0.000005041771,0.06042882,0.00018790239,0.000082675004,0.000009601973,4.228195e-7,0.000011781629,0.00005657153],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985844,0.00001363382,0.00014984311,0.0003608524,0.00048548522,0.00040576828],"domain_scores_gemma":[0.9991766,0.00020179116,0.00006540906,0.0003036596,0.00014160608,0.00011091686],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006448507,0.00012605406,0.00014385198,0.00014430062,0.0004440918,0.0000991316,0.000504753,0.000027501605,0.00001901807],"category_scores_gemma":[0.00008496094,0.000083955725,0.000031617976,0.0015857064,0.0006084523,0.00022311603,0.0002872086,0.000111856956,0.000033131302],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008482472,0.000015000712,0.016552959,0.000073052266,0.000010572435,0.000029939465,0.0029399693,0.000016262673,0.00019294457,0.97178644,0.0017200098,0.006654393],"study_design_scores_gemma":[0.00022908716,0.000047772322,0.0046342257,0.000070763796,0.000008373276,0.00011848128,0.00004919613,0.010125617,0.00088063127,0.98337793,0.00023705997,0.00022086043],"about_ca_topic_score_codex":0.0000011503764,"about_ca_topic_score_gemma":0.0000018694897,"teacher_disagreement_score":0.029060097,"about_ca_system_score_codex":0.000018077706,"about_ca_system_score_gemma":0.00011530201,"threshold_uncertainty_score":0.3423615},"labels":[],"label_agreement":null},{"id":"W4386942710","doi":"10.48550/arxiv.2309.10950","title":"Restricted sumsets in multiplicative subgroups","year":2023,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Conjecture; Multiplicative function; Combinatorics; Finite field; Discrete mathematics; Set (abstract data type); Computer science","score_opus":0.14766290018742229,"score_gpt":0.35497603585387755,"score_spread":0.20731313566645526,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386942710","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9952971,0.00014164533,0.00014421983,0.00028972002,0.0010981237,0.00079210533,0.00009788935,0.00043264925,0.0017065445],"genre_scores_gemma":[0.9961186,0.00019653991,0.0016650498,0.00009296439,0.0002555582,0.00020137483,0.00008735815,0.00012178674,0.0012607435],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.997405,0.00025293152,0.0006991385,0.0008316958,0.00031435068,0.0004968613],"domain_scores_gemma":[0.99673086,0.0011784338,0.00038308997,0.0014800715,0.00011738659,0.000110143345],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004487878,0.0004563208,0.0006650192,0.00038350886,0.00014401099,0.00003297116,0.0008644038,0.0006535451,0.00005895322],"category_scores_gemma":[0.0015735539,0.00040433015,0.00023852495,0.0004536292,0.00016714157,0.000054683853,0.0017537633,0.0014667533,0.00010972029],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011362501,0.0002163246,0.90685415,0.0006380947,0.0002864997,0.0001956962,0.006494924,0.00006325274,0.00040889083,0.07883722,0.0052667977,0.0006245368],"study_design_scores_gemma":[0.00038297975,0.000018169103,0.54341567,0.0002151216,0.000040204788,0.0000024387425,0.00016943556,0.00010090078,0.00036980613,0.45457852,0.00033297454,0.0003737659],"about_ca_topic_score_codex":0.00022303786,"about_ca_topic_score_gemma":0.00022813979,"teacher_disagreement_score":0.3757413,"about_ca_system_score_codex":0.0001354113,"about_ca_system_score_gemma":0.00007569362,"threshold_uncertainty_score":0.99984086},"labels":[],"label_agreement":null},{"id":"W4387329467","doi":"10.1016/j.ejc.2023.103848","title":"Powers of Hamilton cycles in dense graphs perturbed by a random geometric graph","year":2023,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Mathematics; Combinatorics; Graph; Random graph; Discrete mathematics; Regular graph; Geometric graph theory; Graph power; Line graph","score_opus":0.021161410493852315,"score_gpt":0.26388670439312195,"score_spread":0.24272529389926964,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387329467","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9942481,0.0012235233,0.0004235877,0.000054058793,0.0010119097,0.000118235825,0.0000087413255,0.000034990266,0.0028768464],"genre_scores_gemma":[0.99830776,0.0011622211,0.00022947884,0.000039672283,0.000029225095,5.3183993e-7,0.0000017956453,0.00005562474,0.00017366507],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971586,0.0007765011,0.0010119653,0.00014996876,0.00059893547,0.00030401323],"domain_scores_gemma":[0.99747556,0.001085273,0.0007497139,0.00030789542,0.00024588115,0.0001356934],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032148953,0.00021241358,0.00057018927,0.0016341154,0.0000952406,0.000027089642,0.00058325083,0.00005291677,0.000017503997],"category_scores_gemma":[0.0013054432,0.00016683982,0.00034340925,0.0026188944,0.0001306742,0.00012050694,0.00009714247,0.0004592042,0.0000040347177],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0029639017,0.0020477914,0.049013082,0.000996155,0.0013500655,0.0045515792,0.026795223,0.00025202156,0.006326819,0.7266703,0.1691236,0.009909425],"study_design_scores_gemma":[0.009924316,0.00077368214,0.018226791,0.00028109417,0.00013308974,0.00015314916,0.0009961714,0.000039806047,0.0015541682,0.96384734,0.0036505887,0.00041980695],"about_ca_topic_score_codex":0.0000013817992,"about_ca_topic_score_gemma":2.9697947e-7,"teacher_disagreement_score":0.237177,"about_ca_system_score_codex":0.000034320296,"about_ca_system_score_gemma":0.000025467865,"threshold_uncertainty_score":0.680353},"labels":[],"label_agreement":null},{"id":"W4387343471","doi":"10.1090/proc/16668","title":"The limit in the (𝑘+2,𝑘)-problem of Brown, Erdős and Sós exists for all 𝑘≥2","year":2023,"lang":"lv","type":"article","venue":"Proceedings of the American Mathematical Society","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Algorithm; Artificial intelligence; Annotation; Computer science","score_opus":0.03050380246869389,"score_gpt":0.301997875737142,"score_spread":0.2714940732684481,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387343471","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9847647,0.00031926515,0.00009136601,0.007880352,0.000086827255,0.0021413784,0.00006392496,0.000058368278,0.0045938143],"genre_scores_gemma":[0.97708976,0.0014130161,0.019649025,0.00073917565,0.00015045954,0.00022880778,0.0000013674411,0.00009264787,0.000635727],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9968461,0.00006943439,0.0011242098,0.00041147557,0.00079839583,0.0007504241],"domain_scores_gemma":[0.992378,0.005427648,0.0013581187,0.0004668794,0.00028073718,0.00008863254],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0040229745,0.00040915335,0.0009303154,0.00004631497,0.00061850954,0.00012483179,0.0017414759,0.0001547755,0.000006923357],"category_scores_gemma":[0.0013226758,0.00019256031,0.0008361176,0.0011406781,0.0032538625,0.000101219106,0.0008742716,0.00053766085,0.00000286],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000115265015,0.00020935514,0.0009977145,0.0038697144,0.00044198256,2.3406135e-7,0.04733602,0.0000017565136,0.0014726153,0.9230719,0.019077387,0.0034060385],"study_design_scores_gemma":[0.00048054097,0.00024068877,0.0025420608,0.0004247642,0.0003232213,0.000013984376,0.029995287,0.0019865506,0.00078923977,0.9610737,0.0018809324,0.00024904445],"about_ca_topic_score_codex":0.000019266976,"about_ca_topic_score_gemma":0.0000027887154,"teacher_disagreement_score":0.038001765,"about_ca_system_score_codex":0.00004828174,"about_ca_system_score_gemma":0.000042360978,"threshold_uncertainty_score":0.99945873},"labels":[],"label_agreement":null},{"id":"W4387435230","doi":"10.4153/s0008439523000784","title":"A new lower bound in the conjecture","year":2023,"lang":"en","type":"article","venue":"Canadian Mathematical Bulletin","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"University of Windsor; Carleton University","funders":"University of Cambridge","keywords":"Unimodular matrix; Mathematics; Conjecture; Combinatorics; Coprime integers; Upper and lower bounds; Constant (computer programming); Dimension (graph theory); Norm (philosophy); Mathematical analysis","score_opus":0.02639958018066891,"score_gpt":0.27212292047193676,"score_spread":0.24572334029126786,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387435230","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7111584,0.0001613527,0.0009807699,0.06015192,0.0007230175,0.0014561993,0.000049142876,0.0003219732,0.22499724],"genre_scores_gemma":[0.9824357,0.000007166548,0.002147135,0.0038404404,0.0002869542,0.00004407351,0.0000067584892,0.00005729751,0.011174466],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99846286,0.00012283376,0.0003111186,0.00023037613,0.00027958746,0.0005932422],"domain_scores_gemma":[0.99785364,0.0011977936,0.000043094522,0.0005580242,0.000019285757,0.0003281362],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0008656806,0.00019565944,0.00026390102,0.00021773476,0.00022400492,0.000092512964,0.000553678,0.00016503278,0.0137474],"category_scores_gemma":[0.0011217208,0.00012453519,0.0001161999,0.0004987485,0.000110424866,0.00001752228,0.000052855903,0.0003625,0.0039694062],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000035274493,0.0000082890165,0.000021111018,0.000041175605,0.000010159517,0.0001776839,0.0018321296,0.0000010122136,0.0000020374573,0.7054526,0.29201427,0.00043596374],"study_design_scores_gemma":[0.00020115358,0.000021629106,0.00022854809,0.000047654692,0.000013728499,0.000049639104,0.00038815732,0.000029348666,0.0000056322215,0.83311576,0.16575089,0.00014785102],"about_ca_topic_score_codex":0.00063069875,"about_ca_topic_score_gemma":0.0032203614,"teacher_disagreement_score":0.2712773,"about_ca_system_score_codex":0.00006768584,"about_ca_system_score_gemma":0.00016853512,"threshold_uncertainty_score":0.99680614},"labels":[],"label_agreement":null},{"id":"W4387641873","doi":"10.1142/s1793042124500234","title":"On the jth smallest modulus of a covering system with distinct moduli","year":2023,"lang":"en","type":"article","venue":"International Journal of Number Theory","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"Fonds de recherche du Québec – Nature et technologies; Natural Sciences and Engineering Research Council of Canada; Courtois Foundation","keywords":"Moduli; Mathematics; Modulus; Bounded function; Constant (computer programming); Modular equation; Pure mathematics; Moduli space; Combinatorics; Mathematical analysis; Geometry; Moduli of algebraic curves; Computer science; Physics","score_opus":0.02570177866368628,"score_gpt":0.2884431693469132,"score_spread":0.26274139068322694,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387641873","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9747901,0.000012498275,0.0072430666,0.00021405592,0.0010418843,0.00009006677,0.00008578959,0.000030393938,0.016492147],"genre_scores_gemma":[0.9988127,0.0000057043158,0.0003759714,0.00006397185,0.0002456342,0.000003981496,0.0000023334512,0.000023677536,0.0004660611],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985124,0.0001640323,0.0004245918,0.00009455772,0.0006768733,0.00012757373],"domain_scores_gemma":[0.9968887,0.0019728588,0.0005399329,0.00021312326,0.0003417751,0.000043589538],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001096474,0.00012824032,0.00022320203,0.00011648991,0.00008239373,0.000030024168,0.00064250536,0.00004140412,0.00045076993],"category_scores_gemma":[0.0006019696,0.00006806679,0.00015662663,0.00012963258,0.00013160367,0.00006392142,0.00011147336,0.00022600687,0.000013994235],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00057459425,0.000039001465,0.0005698847,0.000033449498,0.00047543924,0.00013762951,0.00089886325,0.0005592396,0.000040569666,0.9939461,0.002273048,0.00045219492],"study_design_scores_gemma":[0.0007362599,0.000121503326,0.003251786,0.0008212127,0.00005656058,0.00069894857,0.0014627805,0.0008582262,0.00040294795,0.9910683,0.000386181,0.00013531765],"about_ca_topic_score_codex":0.0000036728918,"about_ca_topic_score_gemma":0.0000027160359,"teacher_disagreement_score":0.024022566,"about_ca_system_score_codex":0.00006963264,"about_ca_system_score_gemma":0.000036981794,"threshold_uncertainty_score":0.49356148},"labels":[],"label_agreement":null},{"id":"W4388221631","doi":"10.1007/s00454-023-00579-w","title":"On the Structure of Pointsets with Many Collinear Triples","year":2023,"lang":"en","type":"article","venue":"Discrete & Computational Geometry","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; Hungarian Scientific Research Fund","keywords":"Mathematics; Combinatorics; Conic section; Conjecture; General position; Set (abstract data type); Finite set; Plane (geometry); Point (geometry); Regular polygon; Position (finance); Discrete geometry; Discrete mathematics; Geometry; Mathematical analysis; Computer science","score_opus":0.022270517813925684,"score_gpt":0.28564257373572816,"score_spread":0.26337205592180246,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388221631","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9950051,0.000025403397,0.002971484,0.00032247326,0.00012787107,0.00023284076,0.00028712163,0.00007181718,0.0009559064],"genre_scores_gemma":[0.99564886,0.0000040734503,0.0037761286,0.000208832,0.00006220984,0.0000032180155,0.00008317089,0.000026285828,0.00018722321],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99872214,0.00007950398,0.00025936993,0.00020070378,0.0005518082,0.00018645034],"domain_scores_gemma":[0.9974735,0.0019380226,0.0001626218,0.0002669046,0.000116686366,0.000042281827],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021731584,0.00016216011,0.00021846428,0.00023401866,0.00023292519,0.000024557554,0.00026922824,0.000060531773,0.00026187784],"category_scores_gemma":[0.00028883037,0.00008896693,0.000092903174,0.0009079685,0.00017941314,0.000041165844,0.000086344786,0.00017814589,0.000011214711],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010615429,0.000016433578,0.00065638305,0.00005375459,0.0001244767,0.0000063474445,0.00041574214,0.011108642,0.00005650265,0.98422503,0.0029826537,0.00024788352],"study_design_scores_gemma":[0.00043175358,0.0001175526,0.018834239,0.000054361964,0.000029487393,0.000007395573,0.00034935045,0.0058879927,0.0004776263,0.9734897,0.0001753392,0.00014520578],"about_ca_topic_score_codex":0.0000025996858,"about_ca_topic_score_gemma":0.0000015256238,"teacher_disagreement_score":0.018177856,"about_ca_system_score_codex":0.000013417797,"about_ca_system_score_gemma":0.000032990316,"threshold_uncertainty_score":0.3627966},"labels":[],"label_agreement":null},{"id":"W4388496202","doi":"10.1002/rsa.21196","title":"Counting orientations of random graphs with no directed <i>k</i>‐cycles","year":2023,"lang":"en","type":"article","venue":"Random Structures and Algorithms","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Trinity College","funders":"Conselho Nacional de Desenvolvimento Científico e Tecnológico; Fundação de Amparo à Pesquisa do Estado de São Paulo","keywords":"Combinatorics; Conjecture; Mathematics; Binomial (polynomial); Random graph; Graph; Directed graph; Discrete mathematics; Statistics","score_opus":0.015726966115128974,"score_gpt":0.27565891537523707,"score_spread":0.2599319492601081,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388496202","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9950456,0.00029908065,0.0013385167,0.000041031464,0.00050038146,0.00053431164,0.000120661076,0.00033998233,0.0017804579],"genre_scores_gemma":[0.9845671,0.000311311,0.014555626,0.00004591564,0.00016317633,0.000031865147,0.000038414815,0.000049692033,0.0002369022],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984565,0.00011013992,0.00041951574,0.0003147486,0.0003739601,0.00032516455],"domain_scores_gemma":[0.99807036,0.0011282648,0.00023788436,0.00028301732,0.00019069765,0.00008977909],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039726714,0.00026413618,0.0005788284,0.00021007379,0.0004513481,0.000050918316,0.00016672543,0.000100572805,0.0000682868],"category_scores_gemma":[0.00030028287,0.0001699402,0.00013153063,0.0005580665,0.0003058352,0.00010790091,0.00008244761,0.0001741615,0.0000013065712],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.006535155,0.00013406051,0.019970788,0.0015774114,0.0020516226,0.00011546752,0.013509889,0.00031676667,0.005003652,0.9070895,0.0075422376,0.036153488],"study_design_scores_gemma":[0.021722054,0.00015717682,0.016029967,0.00015588567,0.0003219719,0.000070907685,0.0009331286,0.0029701337,0.002501982,0.95329934,0.001263808,0.00057367067],"about_ca_topic_score_codex":0.000039352697,"about_ca_topic_score_gemma":0.00001274903,"teacher_disagreement_score":0.046209853,"about_ca_system_score_codex":0.0000065469194,"about_ca_system_score_gemma":0.000024205454,"threshold_uncertainty_score":0.692996},"labels":[],"label_agreement":null},{"id":"W4388527470","doi":"10.1112/plms.12572","title":"An upper bound on the mean value of the Erdős–Hooley Delta function","year":2023,"lang":"en","type":"article","venue":"Proceedings of the London Mathematical Society","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"Fonds de recherche du Québec – Nature et technologies; Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Mathematics; Function (biology); Combinatorics; Value (mathematics); Upper and lower bounds; Mathematical analysis; Statistics","score_opus":0.025128417098298484,"score_gpt":0.27380059469195805,"score_spread":0.24867217759365956,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388527470","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9931031,0.000018591036,0.00010043035,0.0019661174,0.00024443437,0.00067157205,0.00001648939,0.000106338644,0.003772957],"genre_scores_gemma":[0.9974953,0.00001483477,0.0011363663,0.0005405763,0.00012756356,0.00003597686,6.844504e-7,0.000051077805,0.00059762766],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997834,0.000044744647,0.0005591559,0.00028277058,0.00091504026,0.0003642648],"domain_scores_gemma":[0.9977765,0.0008799616,0.0004557925,0.00059724203,0.00022477766,0.000065712724],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019616566,0.00026408254,0.0003852043,0.000027977007,0.000679924,0.000064278334,0.0013086688,0.00019296775,0.00010511785],"category_scores_gemma":[0.0010049411,0.00011146392,0.00076111325,0.0006720547,0.00063532835,0.00012556632,0.00048961287,0.0004766932,0.000009531404],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003179608,0.00012454233,0.0007817425,0.00048626956,0.0001419091,3.1121353e-8,0.006164288,0.000007463961,0.006663331,0.9742584,0.011224375,0.000115804],"study_design_scores_gemma":[0.00023354805,0.00008105735,0.0026485592,0.00023538002,0.00018266053,0.0000041089015,0.002873769,0.0027064814,0.019996509,0.970718,0.00017854128,0.00014136532],"about_ca_topic_score_codex":0.0000043424443,"about_ca_topic_score_gemma":6.603486e-7,"teacher_disagreement_score":0.013333177,"about_ca_system_score_codex":0.000045219116,"about_ca_system_score_gemma":0.000026326505,"threshold_uncertainty_score":0.5229494},"labels":[],"label_agreement":null},{"id":"W4389590920","doi":"10.1016/j.ejc.2023.103889","title":"Additive structure in convex translates","year":2023,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; University of British Columbia; Hungarian Scientific Research Fund","keywords":"Mathematics; Combinatorics; Conjecture; Regular polygon; Dimension (graph theory); Convex set; Set (abstract data type); Plane (geometry); Unit (ring theory); Convex body; Convex hull; Convex optimization; Geometry; Computer science","score_opus":0.02771948999840225,"score_gpt":0.27908899418573946,"score_spread":0.2513695041873372,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389590920","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98884565,0.00023152312,0.00021837647,0.00017433877,0.0014330113,0.00007964517,0.000019729398,0.00004468202,0.008953051],"genre_scores_gemma":[0.99908525,0.00013039676,0.000361088,0.00005286885,0.00013071124,1.7485111e-7,0.0000019023947,0.00004186444,0.00019575557],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983441,0.00046970922,0.0005475141,0.00010274041,0.00031457897,0.00022135163],"domain_scores_gemma":[0.99882764,0.00045147518,0.00030699815,0.00017290351,0.00015193339,0.00008902419],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011146222,0.0001480797,0.00031271056,0.00032265083,0.00008478403,0.000025453493,0.00038863107,0.0000384526,0.00008794277],"category_scores_gemma":[0.00039599897,0.000114308044,0.00012832152,0.00057890225,0.000069932285,0.00011372284,0.00005948635,0.0005063055,0.0000097422835],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012159644,0.00009844234,0.0027202526,0.00009312993,0.00014332042,0.002512005,0.009934354,0.000036009318,0.00041240317,0.95863664,0.015343575,0.009948299],"study_design_scores_gemma":[0.0014137712,0.00022085168,0.011414164,0.0001018898,0.000029805267,0.000113897266,0.0004715111,0.000030488603,0.00059043727,0.973231,0.012211774,0.00017036898],"about_ca_topic_score_codex":1.8026742e-7,"about_ca_topic_score_gemma":4.5169492e-7,"teacher_disagreement_score":0.014594428,"about_ca_system_score_codex":0.0000272357,"about_ca_system_score_gemma":0.000027385484,"threshold_uncertainty_score":0.46613467},"labels":[],"label_agreement":null},{"id":"W4389591199","doi":"10.1016/j.ejc.2023.103910","title":"On the intersection density of the Kneser graph <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" display=\"inline\" id=\"d1e2044\" altimg=\"si19.svg\"> <mml:mrow> <mml:mi>K</mml:mi> <mml:mrow> <mml:mo>(</mml:mo> <mml:mi>n</mml:mi> <mml:mo>,</mml:mo> <mml:mn>3</mml:mn> <mml:mo>)</mml:mo> </mml:mrow> </mml:mrow> </mml:math>","year":2023,"lang":"lv","type":"article","venue":"European Journal of Combinatorics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Automorphism; Automorphism group; Vertex (graph theory); Graph; Intersection (aeronautics); Discrete mathematics","score_opus":0.01993996439892176,"score_gpt":0.23828513346462318,"score_spread":0.21834516906570142,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389591199","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8368333,0.0014001689,0.0012192405,0.0010845145,0.0095567405,0.00013518664,0.00042937943,0.00036231457,0.14897913],"genre_scores_gemma":[0.98856187,0.0023037796,0.0011536938,0.0020858988,0.0031790717,0.00032237702,0.00040815832,0.0014988565,0.00048628007],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.98237956,0.0023579998,0.004307962,0.0023523767,0.0051864646,0.0034156665],"domain_scores_gemma":[0.9834909,0.004299232,0.0060487846,0.0036749053,0.00081797986,0.0016682149],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science","research_integrity","insufficient_payload"],"consensus_categories":["metaepi_narrow","sts","research_integrity","insufficient_payload"],"category_scores_codex":[0.0076341624,0.001815348,0.00092296855,0.0011853913,0.0036643043,0.0020722095,0.005453783,0.0025096985,0.026739024],"category_scores_gemma":[0.005300733,0.002537936,0.004339672,0.0030444204,0.0031613682,0.001894737,0.004287975,0.005184057,0.001801962],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0021862886,0.00074147043,0.000043408614,0.0014551794,0.0030252007,0.0021036246,0.004593774,0.001419844,0.0018329755,0.7974557,0.1834597,0.0016827891],"study_design_scores_gemma":[0.0067196945,0.007217541,0.00066922576,0.005599709,0.006332204,0.007506102,0.009125729,0.045845482,0.8544618,0.0405729,0.0113794245,0.00457022],"about_ca_topic_score_codex":0.0005000062,"about_ca_topic_score_gemma":0.00036459332,"teacher_disagreement_score":0.85262877,"about_ca_system_score_codex":0.00007307247,"about_ca_system_score_gemma":0.0015485819,"threshold_uncertainty_score":0.99992716},"labels":[],"label_agreement":null},{"id":"W4389676044","doi":"10.4153/s000843952300098x","title":"Equal-Sum-Product problem II","year":2023,"lang":"en","type":"article","venue":"Canadian Mathematical Bulletin","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Integer (computer science); Product (mathematics); Combinatorics; Infinity; Prime (order theory); Mathematical analysis; Geometry","score_opus":0.03635406987932641,"score_gpt":0.27641960158940226,"score_spread":0.24006553171007586,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389676044","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42274863,0.00015353234,0.0007766977,0.025458064,0.0007384363,0.0017085747,0.00013176812,0.0013556244,0.54692864],"genre_scores_gemma":[0.9489075,0.000014814185,0.01209593,0.001245941,0.000406346,0.00011923604,0.000022212895,0.00013653062,0.037051473],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976856,0.0000980454,0.0004969583,0.00044176533,0.000359216,0.0009184245],"domain_scores_gemma":[0.9978005,0.00056046236,0.00008571623,0.00078503706,0.00008470142,0.0006835682],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0010475391,0.00029330413,0.00041832495,0.00032678325,0.00074041745,0.000059153048,0.0005088964,0.0001563851,0.017674975],"category_scores_gemma":[0.0015932849,0.00024322941,0.00016775174,0.0005095321,0.00020079367,0.000031944914,0.0002118364,0.0003231837,0.010190385],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000034086013,0.000018920038,0.000013736263,0.0001808516,0.000031491356,0.000058661775,0.0008657816,0.0000014525554,0.000028902847,0.7722874,0.22566226,0.0008471234],"study_design_scores_gemma":[0.00016463947,0.00003312145,0.00003180581,0.0000744521,0.000027723501,0.000032028118,0.00016459315,0.000054845867,0.00011496054,0.8110605,0.18796493,0.00027641788],"about_ca_topic_score_codex":0.00021412082,"about_ca_topic_score_gemma":0.0003698204,"teacher_disagreement_score":0.52615887,"about_ca_system_score_codex":0.00010948847,"about_ca_system_score_gemma":0.00013680513,"threshold_uncertainty_score":0.99186075},"labels":[],"label_agreement":null},{"id":"W4389775381","doi":"10.4171/icm2022/102","title":"Recent progress towards Hadwiger’s conjecture","year":2023,"lang":"en","type":"book-chapter","venue":"EMS Press eBooks","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Conjecture; Combinatorics; Mathematics; Graph minor; Minor (academic); Graph; Discrete mathematics; Graph power; Humanities; Art; Line graph","score_opus":0.10495656273058732,"score_gpt":0.31656353838730367,"score_spread":0.21160697565671635,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389775381","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000034012053,0.0021229319,0.00007317337,0.00008225232,0.0027011156,0.0010895799,0.00023001556,0.0008101399,0.9928568],"genre_scores_gemma":[0.0005778573,0.0006217301,0.00067810103,0.00016698173,0.0008830002,0.00011406466,0.000047170473,0.000393293,0.9965178],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9972297,0.000058351226,0.0006685935,0.00074050535,0.00075290323,0.0005499793],"domain_scores_gemma":[0.99761504,0.00023622261,0.0004712987,0.0013012454,0.00018490007,0.00019131528],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00036722285,0.00078655337,0.0008966582,0.00017707804,0.0002773231,0.00010766924,0.00078314036,0.001045552,0.00033956798],"category_scores_gemma":[0.000074377764,0.0006268294,0.00041142266,0.000010836557,0.0005854949,0.00003154222,0.0006538406,0.0011111479,0.0000456201],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003707105,0.0000077738005,2.928093e-7,0.00026788926,0.00036002437,0.0001276209,0.0011154275,5.3354984e-7,0.000001316116,0.81873965,0.032483045,0.14685932],"study_design_scores_gemma":[0.00019360517,0.00004270853,0.000001311034,0.00023265964,0.00012517499,0.000020600773,0.0000061745573,0.0000035370822,0.00017456552,0.49805355,0.5007447,0.00040140643],"about_ca_topic_score_codex":0.000010822979,"about_ca_topic_score_gemma":0.000019211546,"teacher_disagreement_score":0.46826166,"about_ca_system_score_codex":0.000078614896,"about_ca_system_score_gemma":0.00010301369,"threshold_uncertainty_score":0.9996183},"labels":[],"label_agreement":null},{"id":"W4390833619","doi":"10.1016/j.ejc.2025.104316","title":"Bounded degree graphs and hypergraphs with no full rainbow matchings","year":2025,"lang":"en","type":"preprint","venue":"European Journal of Combinatorics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"University of Waterloo; Austrian Science Fund","keywords":"Rainbow; Combinatorics; Matching (statistics); Degree (music); Colored; Mathematics; Generalization; Bounded function; Class (philosophy); Enhanced Data Rates for GSM Evolution; Hypergraph; Discrete mathematics; Computer science; Artificial intelligence; Physics","score_opus":0.029749260496819318,"score_gpt":0.2611861623233053,"score_spread":0.23143690182648602,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390833619","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9070899,0.0021566232,0.0026017737,0.0002791671,0.0049873395,0.00041848034,0.000037287995,0.00012233885,0.08230712],"genre_scores_gemma":[0.9812385,0.0010117517,0.01571576,0.00021543066,0.00017659273,0.000001922927,0.0000035679182,0.000115735136,0.0015207842],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.996709,0.00081286614,0.0010470039,0.00037472378,0.0006991648,0.0003572338],"domain_scores_gemma":[0.9961627,0.00051880034,0.0014949742,0.00073206663,0.00084240426,0.00024904983],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0022646554,0.00057336927,0.0009700748,0.00058787013,0.0003400633,0.00023115415,0.0010912201,0.00015893484,0.000020187545],"category_scores_gemma":[0.00047977138,0.00041664235,0.00038526862,0.00030515192,0.0002883724,0.00012203983,0.0010126062,0.002068996,0.0000022032368],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00045193246,0.00019643853,0.0009895364,0.0010745907,0.0008746228,0.0007588739,0.0024047224,0.000009433979,0.000024310537,0.98355263,0.0075051375,0.0021577484],"study_design_scores_gemma":[0.0017265987,0.00062716287,0.001356798,0.0011467624,0.00043170532,0.00046527805,0.00013425524,0.0000131678535,0.00002602191,0.98713195,0.0064596287,0.00048069374],"about_ca_topic_score_codex":0.0000016296502,"about_ca_topic_score_gemma":8.9936395e-7,"teacher_disagreement_score":0.08078634,"about_ca_system_score_codex":0.00006153896,"about_ca_system_score_gemma":0.00017813704,"threshold_uncertainty_score":0.9998285},"labels":[],"label_agreement":null},{"id":"W4390961186","doi":"10.48550/arxiv.2401.06881","title":"Thresholds for constrained Ramsey and anti-Ramsey problems","year":2024,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Ramsey's theorem; Combinatorics; Monochromatic color; Rainbow; Statement (logic); Property (philosophy); Mathematics; Graph; Ramsey theory; Discrete mathematics; Physics; Law; Philosophy","score_opus":0.10803832342858542,"score_gpt":0.22818168696283217,"score_spread":0.12014336353424675,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390961186","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97514623,0.00038922532,0.012196322,0.00011300587,0.0011276504,0.0013924375,0.00030509842,0.00036265102,0.008967368],"genre_scores_gemma":[0.99552757,0.00022674678,0.0015222764,0.000060951043,0.00016239236,0.000004962023,0.0000275855,0.00006970436,0.0023978022],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981902,0.000070400914,0.0002852187,0.00097530865,0.00008096374,0.00039787852],"domain_scores_gemma":[0.998365,0.0004097761,0.00020770646,0.0007304373,0.00013052259,0.00015655371],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004175196,0.00044639927,0.00058036717,0.00024633142,0.00025512418,0.00011514522,0.00050923426,0.0005791937,0.00005544108],"category_scores_gemma":[0.00011376993,0.00042544442,0.0003253381,0.00020449283,0.00044756834,0.000067106,0.0015188983,0.0007483874,0.0000060225375],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000047186706,0.00004405203,0.0007474103,0.0018384403,0.00038566787,0.000084756335,0.0006328408,0.0011187283,0.00004809762,0.9936411,0.0011495707,0.0002621952],"study_design_scores_gemma":[0.00065603404,0.00005367924,0.0000760966,0.0003480836,0.0004817307,0.000018069573,0.00021160583,0.01118208,0.000065541935,0.985468,0.00093903736,0.0005000835],"about_ca_topic_score_codex":0.000017987535,"about_ca_topic_score_gemma":0.000020817344,"teacher_disagreement_score":0.020381339,"about_ca_system_score_codex":0.00006664456,"about_ca_system_score_gemma":0.00011289266,"threshold_uncertainty_score":0.99981976},"labels":[],"label_agreement":null},{"id":"W4391127827","doi":"10.61091/jcmcc117-16","title":"The-proper-Ramsey-numbers-of- K 3 -against- C 3 -and- C 5","year":2023,"lang":"en","type":"article","venue":"Journal of Combinatorial Mathematics and Combinatorial Computing","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Ramsey's theorem; Combinatorics; Mathematics; Integer (computer science); Monochrome; Edge coloring; Colored; Enhanced Data Rates for GSM Evolution; Discrete mathematics; Computer science; Graph; Artificial intelligence; Materials science","score_opus":0.025012369607757236,"score_gpt":0.28652470680195313,"score_spread":0.2615123371941959,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391127827","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9845567,0.00041659875,0.00037753736,0.00017955383,0.012620925,0.00026196422,0.0000021818487,0.00005771385,0.0015268435],"genre_scores_gemma":[0.9960855,0.0003036706,0.0025613846,0.000014536762,0.0009556683,0.0000016528327,4.6722198e-7,0.00004766989,0.000029427885],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970485,0.00018592611,0.0014096417,0.0001901619,0.0007647455,0.0004010263],"domain_scores_gemma":[0.99382854,0.0037673337,0.0013465341,0.00035030357,0.00053412415,0.00017315648],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003791156,0.00029608633,0.0008282888,0.00019391908,0.00079425034,0.00016048855,0.0005379005,0.00017971193,0.0000025889503],"category_scores_gemma":[0.0021261284,0.00019556911,0.00023472156,0.00045316495,0.00039511782,0.00013110001,0.00054664176,0.0005321653,0.000001175495],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007957613,0.0001004496,0.0001593444,0.0002603799,0.00016774348,0.000016410238,0.0023717491,0.0000044238573,0.0002644829,0.9917896,0.0007364321,0.004049441],"study_design_scores_gemma":[0.0020995403,0.00036459544,0.00008453064,0.000303824,0.000105674844,0.000068600486,0.0010382966,0.0012914869,0.0005425075,0.99239486,0.0014849635,0.00022111143],"about_ca_topic_score_codex":0.0000026900266,"about_ca_topic_score_gemma":2.5123552e-7,"teacher_disagreement_score":0.011665257,"about_ca_system_score_codex":0.000032973865,"about_ca_system_score_gemma":0.000082017395,"threshold_uncertainty_score":0.7975077},"labels":[],"label_agreement":null},{"id":"W4391148171","doi":"10.55016/ojs/cdm.v18i2.73074","title":"Extended inverse theorems for $h$-fold sumsets in integers","year":2023,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Science and Engineering Research Board; Council of Scientific and Industrial Research, India","keywords":"Mathematics; Fold (higher-order function); Combinatorics; Inverse; Computer science; Geometry","score_opus":0.03397540666762246,"score_gpt":0.36110881993711624,"score_spread":0.3271334132694938,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391148171","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7282675,0.000098811826,0.24270388,0.004388334,0.001638055,0.006699652,0.0032761325,0.0014510967,0.011476531],"genre_scores_gemma":[0.9716053,0.000022861936,0.025553027,0.0002605021,0.00015413553,0.0006507194,0.00012178706,0.00009104408,0.0015406199],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978854,0.000086355045,0.0006866502,0.00035921656,0.0002818509,0.00070051214],"domain_scores_gemma":[0.9968608,0.0018154004,0.0001578294,0.0007409896,0.0002279315,0.00019705688],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0015007716,0.00030441082,0.0005393432,0.00047242947,0.00034400064,0.000066720895,0.00047618884,0.00018338278,0.000072009825],"category_scores_gemma":[0.005976377,0.00024936692,0.00026108132,0.0009776454,0.00014952313,0.000115197625,0.00026172466,0.0002210407,0.000083300576],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003736513,0.000072640774,0.00004228418,0.00015966276,0.00005934741,0.0000085917145,0.0035439464,0.000035970577,0.0004150385,0.9814054,0.013851354,0.00036842082],"study_design_scores_gemma":[0.00094041915,0.000072782976,0.00017464545,0.00017212424,0.000067838315,0.0000069942284,0.0018781783,0.0072211022,0.0011091449,0.9850436,0.002974208,0.00033899015],"about_ca_topic_score_codex":0.00000470352,"about_ca_topic_score_gemma":0.000047855505,"teacher_disagreement_score":0.2433378,"about_ca_system_score_codex":0.00016088743,"about_ca_system_score_gemma":0.000059622736,"threshold_uncertainty_score":0.9999958},"labels":[],"label_agreement":null},{"id":"W4391258573","doi":"10.37236/10281","title":"Triangles and Subgraph Probabilities in Random Regular Graphs","year":2024,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Induced subgraph isomorphism problem; Random graph; Discrete mathematics; Graph; Line graph","score_opus":0.011854225939604505,"score_gpt":0.26390329926881506,"score_spread":0.25204907332921056,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391258573","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.953248,0.043883357,0.00085426314,0.00063845416,0.00057409017,0.00021106863,8.781117e-7,0.000024982737,0.0005648714],"genre_scores_gemma":[0.99660176,0.0030847243,0.000027882175,0.000019879957,0.00005902677,0.000004188701,2.094727e-7,0.000021553578,0.00018079221],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99845695,0.00028325047,0.00048389277,0.00011044288,0.0002978299,0.00036765],"domain_scores_gemma":[0.9982657,0.001254906,0.00014852389,0.00020745333,0.000080779864,0.000042628515],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002949537,0.00015215344,0.00034749808,0.0002764375,0.000118568234,0.00006677824,0.00030744777,0.00007728975,0.000007972625],"category_scores_gemma":[0.00031348658,0.00008635482,0.00018145436,0.0004804739,0.0001785566,0.00013722014,0.000049093946,0.000749803,2.3516338e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015601297,0.000036204758,0.0001800052,0.00010159449,0.00012107849,0.000017795224,0.0018714624,0.0000019932882,0.00006318909,0.99673235,0.00018412473,0.0005341895],"study_design_scores_gemma":[0.0013331953,0.00026726446,0.00010115973,0.00011939259,0.00009272604,0.00027120384,0.00039035003,0.000027304002,0.0002475544,0.9952142,0.0018344027,0.00010119603],"about_ca_topic_score_codex":0.0000027686865,"about_ca_topic_score_gemma":0.0000068933596,"teacher_disagreement_score":0.043353707,"about_ca_system_score_codex":0.00009878404,"about_ca_system_score_gemma":0.00019771612,"threshold_uncertainty_score":0.35214475},"labels":[],"label_agreement":null},{"id":"W4391821761","doi":"10.1002/jgt.23085","title":"Degree criteria and stability for independent transversals","year":2024,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Bounded function; Vertex (graph theory); Partition (number theory); Transversal (combinatorics); Independent set; Discrete mathematics; Existential quantification; Degree (music); Social connectedness; Graph","score_opus":0.07414025603468731,"score_gpt":0.3427614761729238,"score_spread":0.26862122013823647,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391821761","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9534292,0.0047320584,0.038499698,0.00024714792,0.0015087145,0.00025837935,0.000053139836,0.000039291062,0.0012323296],"genre_scores_gemma":[0.9941516,0.00014487337,0.005338013,0.000068583606,0.00021430878,0.0000040593777,3.9905638e-7,0.000026809788,0.000051343377],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987243,0.0002135986,0.00050004653,0.0001506039,0.0002284006,0.00018308467],"domain_scores_gemma":[0.9976968,0.0017472786,0.0001378803,0.00018337637,0.00013148542,0.00010317996],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034600238,0.00015198597,0.00032630115,0.00023320549,0.00012822328,0.000078677374,0.00020047207,0.00010541908,0.00019349407],"category_scores_gemma":[0.000376521,0.0001021763,0.00034147556,0.00011057583,0.00018835581,0.0002046725,0.000033054974,0.00027201508,3.0314737e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004712963,0.000044219738,0.00011932168,0.0004932049,0.00029549169,0.000028297058,0.0039882003,1.8178473e-7,0.0025895745,0.97925395,0.001079319,0.01163693],"study_design_scores_gemma":[0.00046085284,0.00022671207,0.000409768,0.00013234129,0.0002074246,0.00019404014,0.0007301383,0.000016401553,0.002521545,0.9934929,0.0014887786,0.00011909436],"about_ca_topic_score_codex":4.4656232e-7,"about_ca_topic_score_gemma":0.000002066388,"teacher_disagreement_score":0.04072237,"about_ca_system_score_codex":0.000022818997,"about_ca_system_score_gemma":0.00004200603,"threshold_uncertainty_score":0.41666287},"labels":[],"label_agreement":null},{"id":"W4392080704","doi":"10.1515/agms-2023-0105","title":"<i>C</i> <sup>1,α</sup>-rectifiability in low codimension in Heisenberg groups","year":2024,"lang":"en","type":"article","venue":"Analysis and Geometry in Metric Spaces","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Combinatorics; Order (exchange); Physics; Mathematics; Crystallography; Chemistry","score_opus":0.011648329924248994,"score_gpt":0.2800042050160089,"score_spread":0.26835587509175995,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392080704","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9942349,0.0043268423,0.00036585788,0.00013616301,0.000116075236,0.00018390486,0.0000110614865,0.00004140278,0.00058374694],"genre_scores_gemma":[0.99791855,0.0009337005,0.000796409,0.000056501976,0.00004463078,0.000015565187,0.000008143671,0.000017904847,0.00020859811],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99755853,0.00032266905,0.00066262705,0.00066839065,0.00039020157,0.0003975832],"domain_scores_gemma":[0.9969656,0.002377295,0.00008348372,0.00044946253,0.000040752013,0.0000834187],"candidate_categories":["bibliometrics"],"consensus_categories":[],"category_scores_codex":[0.0027924275,0.0002701029,0.0008092787,0.0073190867,0.00007510255,0.00016519308,0.00019319855,0.0002134907,0.00014410316],"category_scores_gemma":[0.0012281389,0.00020917629,0.00024373122,0.022810992,0.00011193835,0.00027475524,0.00015836071,0.00047039532,0.0000033613942],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000051265994,0.00032013276,0.9526877,0.0005275006,0.0006008364,0.00015186856,0.0030225283,0.0048288316,0.000038886534,0.024873285,0.00022611154,0.01267108],"study_design_scores_gemma":[0.0013293024,0.00016161094,0.4722184,0.00042586922,0.0011561242,0.000016911406,0.005946246,0.09774375,0.0005583907,0.4186375,0.0007087054,0.0010971924],"about_ca_topic_score_codex":0.00093088957,"about_ca_topic_score_gemma":0.0015185188,"teacher_disagreement_score":0.4804693,"about_ca_system_score_codex":0.0001087818,"about_ca_system_score_gemma":0.000020554895,"threshold_uncertainty_score":0.9979596},"labels":[],"label_agreement":null},{"id":"W4392119539","doi":"10.1016/j.aim.2024.109550","title":"Non-uniqueness times for the maximizer of the KPZ fixed point","year":2024,"lang":"en","type":"article","venue":"Advances in Mathematics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Hausdorff dimension; Fixed point; Uniqueness; Dimension (graph theory); Combinatorics; Hausdorff distance; Hausdorff space; Discrete mathematics; Mathematical analysis","score_opus":0.017686759764504473,"score_gpt":0.3168637551309676,"score_spread":0.29917699536646314,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392119539","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13980632,0.03447168,0.6943565,0.004131723,0.010430354,0.010221128,0.00031685282,0.00059083157,0.10567462],"genre_scores_gemma":[0.8852017,0.00082834705,0.11015848,0.00015610064,0.00015665659,0.0002833816,0.0000017784996,0.00009631983,0.003117253],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988111,0.00003993872,0.00049721636,0.00018253956,0.00024361208,0.00022559664],"domain_scores_gemma":[0.99567693,0.0033822998,0.0001590642,0.0007000273,0.00006192583,0.000019723479],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008066975,0.00018906263,0.0003141968,0.00006365637,0.00015424256,0.000033322034,0.0006475511,0.00008089841,0.000082260514],"category_scores_gemma":[0.0005171494,0.00008929219,0.00022381374,0.00028376607,0.00025225166,0.00015550746,0.00018153037,0.00020063076,0.0000021983376],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013288731,0.00004752383,0.0000342726,0.0015211111,0.00005136321,0.0000014678536,0.0040803435,0.00014001603,0.000092439,0.98833567,0.00058834575,0.0050941347],"study_design_scores_gemma":[0.0001853836,0.000019369872,0.000031554166,0.00051691796,0.000075410935,0.000011918551,0.00076406804,0.009636889,0.0033608458,0.97810274,0.0071692374,0.00012564447],"about_ca_topic_score_codex":0.000002116413,"about_ca_topic_score_gemma":0.000013221977,"teacher_disagreement_score":0.74539536,"about_ca_system_score_codex":0.000027172784,"about_ca_system_score_gemma":0.00003310498,"threshold_uncertainty_score":0.36412296},"labels":[],"label_agreement":null},{"id":"W4392872013","doi":"10.1017/fms.2024.27","title":"On the Turán number of the hypercube","year":2024,"lang":"en","type":"article","venue":"Forum of Mathematics Sigma","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Trinity College","funders":"Eidgenössische Technische Hochschule Zürich; Schweizerischer Nationalfonds zur Förderung der Wissenschaftlichen Forschung","keywords":"Combinatorics; Hypercube; Bipartite graph; Vertex (graph theory); Mathematics; Upper and lower bounds; Graph; Omega; Discrete mathematics; Physics","score_opus":0.023677178446311033,"score_gpt":0.29018418825235004,"score_spread":0.26650700980603903,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392872013","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9319969,0.0002045503,0.0011816098,0.0015334543,0.00080525636,0.0005376467,0.000054697364,0.00007539819,0.06361049],"genre_scores_gemma":[0.99492866,0.0000109609955,0.0033472385,0.00013200023,0.000044884888,0.000013873056,4.7386635e-7,0.000041090832,0.0014808237],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986383,0.000070730515,0.0004691658,0.00014721724,0.00046562604,0.00020897781],"domain_scores_gemma":[0.9960377,0.0027997969,0.00017435764,0.0009015803,0.000060175436,0.00002636365],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006389645,0.0001780659,0.00029502864,0.000041747928,0.00013126127,0.000020583062,0.0006368065,0.000099146324,0.0005973949],"category_scores_gemma":[0.00078369625,0.00007796098,0.0003283655,0.00023744698,0.00025703857,0.000040053998,0.0002270168,0.00024823006,0.000021920636],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000045526012,0.00008327998,0.000045655197,0.00055813394,0.000094864154,0.0000011207834,0.0026107419,0.0000048296242,0.00032884386,0.9841821,0.01176747,0.00031836226],"study_design_scores_gemma":[0.000074651056,0.000029328705,0.00003358183,0.0004493329,0.000073337585,0.000026499873,0.000922374,0.00075119047,0.008438342,0.98817426,0.0009319799,0.000095145864],"about_ca_topic_score_codex":0.0000029861942,"about_ca_topic_score_gemma":0.000002642528,"teacher_disagreement_score":0.06293175,"about_ca_system_score_codex":0.00001567213,"about_ca_system_score_gemma":0.000029137153,"threshold_uncertainty_score":0.6541055},"labels":[],"label_agreement":null},{"id":"W4393092613","doi":"10.1093/imrn/rnae044","title":"On the Moments of the Number of Representations as Sums of Two Prime Squares","year":2024,"lang":"en","type":"article","venue":"International Mathematics Research Notices","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Mathematics; Prime (order theory); Prime number; Arithmetic; Combinatorics; Algebra over a field; Pure mathematics","score_opus":0.12915707743012086,"score_gpt":0.5019111298055989,"score_spread":0.3727540523754781,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393092613","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9082717,0.000052237017,0.00022961576,0.0011542432,0.00042677825,0.00041780944,0.00007657666,0.000015780133,0.08935527],"genre_scores_gemma":[0.99579513,0.000023425613,0.0018633842,0.000014025082,0.000053926866,0.000028870745,0.0000017814336,0.00002115369,0.0021983173],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970878,0.00025182724,0.0005744325,0.0001683783,0.0017517356,0.00016587345],"domain_scores_gemma":[0.9896919,0.00887626,0.0002483699,0.00061927445,0.0005354331,0.000028766664],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0018173864,0.0001103124,0.00019828885,0.0001906397,0.00012026895,0.000053643867,0.0011412272,0.000047122954,0.00092740596],"category_scores_gemma":[0.0033530595,0.00005646134,0.00018401614,0.0003712527,0.0005852244,0.00009768232,0.0004278767,0.00030867744,0.000021029497],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020527481,0.0001671244,0.0004103583,0.00038421623,0.00028713763,0.0000017354191,0.0043391227,0.000043463857,0.0018715387,0.99127185,0.0010023477,0.00020055755],"study_design_scores_gemma":[0.00011967915,0.000031981155,0.00022276148,0.0006491931,0.000028059796,0.000005147812,0.0010039997,0.0025587317,0.04411152,0.9510343,0.0001840863,0.00005050904],"about_ca_topic_score_codex":0.00007388429,"about_ca_topic_score_gemma":0.00000939252,"teacher_disagreement_score":0.08752342,"about_ca_system_score_codex":0.000036407382,"about_ca_system_score_gemma":0.000081194004,"threshold_uncertainty_score":0.9999859},"labels":[],"label_agreement":null},{"id":"W4393211147","doi":"10.1016/j.sysconle.2024.105780","title":"Infinite horizon LQG Graphon Mean Field Games: Explicit Nash values and local minima","year":2024,"lang":"en","type":"article","venue":"Systems & Control Letters","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; Polytechnique Montréal; Carleton University; HEC Montréal","funders":"HEC Montréal","keywords":"Maxima and minima; Nash equilibrium; Linear-quadratic-Gaussian control; Mathematics; Field (mathematics); Horizon; Applied mathematics; Mathematical economics; Control theory (sociology); Computer science; Optimal control; Mathematical analysis; Mathematical optimization; Pure mathematics; Control (management); Artificial intelligence; Geometry","score_opus":0.011915816980396711,"score_gpt":0.25208805631885484,"score_spread":0.24017223933845813,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393211147","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9743489,0.0035003067,0.014818897,0.0015477599,0.002920024,0.0007992751,0.000034075438,0.00037131566,0.0016594708],"genre_scores_gemma":[0.99759334,0.00003523877,0.00012321718,0.0013127838,0.0005415044,0.00007400638,0.0000022976965,0.000056283436,0.0002613084],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99806136,0.0002274963,0.0004966795,0.00046432196,0.0003510739,0.00039905842],"domain_scores_gemma":[0.9981797,0.0010978779,0.000105050996,0.00045984954,0.0000372835,0.00012028886],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00059557933,0.00032449025,0.0005317556,0.00024015745,0.0001412183,0.00022592358,0.00022368059,0.0001765855,0.000037870333],"category_scores_gemma":[0.000076382,0.0002496113,0.00020089677,0.0001695756,0.00010919614,0.00015456713,0.00006271964,0.00032697796,0.000014009332],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00040095614,0.00007123287,0.002128326,0.0053533087,0.0023490007,0.0005270164,0.019736152,0.000061484956,0.04578318,0.7762689,0.12321609,0.024104338],"study_design_scores_gemma":[0.016178872,0.004526448,0.0014718664,0.010921623,0.0028644642,0.0014352581,0.023608841,0.049407687,0.0048964685,0.7112384,0.16643147,0.007018614],"about_ca_topic_score_codex":0.00008652733,"about_ca_topic_score_gemma":0.000009889653,"teacher_disagreement_score":0.06503053,"about_ca_system_score_codex":0.000037137732,"about_ca_system_score_gemma":0.000014136072,"threshold_uncertainty_score":0.9999956},"labels":[],"label_agreement":null},{"id":"W4393399097","doi":"10.48550/arxiv.2403.19824","title":"BRK-type sets over finite fields","year":2024,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Type (biology); Finite field; Computer science; Mathematics; Business; Pure mathematics; Geology; Discrete mathematics; Paleontology","score_opus":0.10153493981656898,"score_gpt":0.23550366530377215,"score_spread":0.13396872548720318,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393399097","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9600775,0.00022538801,0.002454232,0.000060087474,0.0030638375,0.00028887636,0.00007563747,0.00034887163,0.033405516],"genre_scores_gemma":[0.9871887,0.00019728154,0.00033938827,0.00016432727,0.0001968232,4.822842e-7,0.00001825876,0.000055463308,0.011839283],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984414,0.00010913924,0.00022537341,0.00079014373,0.00010192199,0.00033201123],"domain_scores_gemma":[0.9980617,0.00045787066,0.00015497234,0.00109692,0.00010076364,0.00012777816],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00021951669,0.00038619924,0.00040773267,0.0002522209,0.00016550986,0.00006795451,0.00070958445,0.0006661334,0.00071517343],"category_scores_gemma":[0.00016688678,0.00037564532,0.00035983883,0.00035241435,0.00014839182,0.000057872712,0.0024823048,0.0012909287,0.000112025424],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000077539575,0.00004612757,0.00068183284,0.00061574636,0.00037145268,0.0006153226,0.0008324186,0.005730992,0.000004331655,0.9792542,0.011575554,0.00019451189],"study_design_scores_gemma":[0.00021176875,0.000037385133,0.00018686871,0.00019358004,0.00031767262,0.0000045846086,0.00006907287,0.014547862,0.00003093082,0.9819751,0.0019863492,0.00043887176],"about_ca_topic_score_codex":0.00004378077,"about_ca_topic_score_gemma":0.000041459178,"teacher_disagreement_score":0.027111141,"about_ca_system_score_codex":0.00009636251,"about_ca_system_score_gemma":0.0001033728,"threshold_uncertainty_score":0.9998695},"labels":[],"label_agreement":null},{"id":"W4394742206","doi":"10.1016/j.disc.2024.114029","title":"Wickets in 3-uniform hypergraphs","year":2024,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; Hungarian Scientific Research Fund","keywords":"Hypergraph; Mathematics; Combinatorics; Vertex (graph theory); Conjecture; Row; Discrete mathematics; Graph; Computer science","score_opus":0.026816762002405025,"score_gpt":0.31156306649351023,"score_spread":0.2847463044911052,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4394742206","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.82671595,0.0012983958,0.00943695,0.00043837074,0.0011492949,0.00069998036,0.00004976084,0.0007385246,0.15947278],"genre_scores_gemma":[0.9679945,0.00007099725,0.030186566,0.000067505505,0.00011291008,0.000032215805,0.000006381558,0.00007988058,0.0014490547],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984678,0.00003804532,0.00050738186,0.00028715254,0.00032394848,0.00037567347],"domain_scores_gemma":[0.9987297,0.0005733829,0.00006033673,0.0005294002,0.000026226271,0.000080942795],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056739664,0.0002629471,0.00035264753,0.00030123425,0.0001068189,0.00010487685,0.00032934247,0.00013779703,0.00023004407],"category_scores_gemma":[0.0002362682,0.00019121612,0.00019560914,0.00036651874,0.0001282233,0.00016953412,0.00014705806,0.0003148959,0.00005088738],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004525614,0.000044276818,0.000087820146,0.00075092877,0.000048684557,0.00006653372,0.0077068056,0.000002888357,0.00009507342,0.9886531,0.0011940547,0.0013452906],"study_design_scores_gemma":[0.00015896707,0.000027937598,0.00006602239,0.00040373576,0.00004421615,0.00005425057,0.00090485084,0.004831325,0.00031452498,0.99021065,0.002715132,0.000268383],"about_ca_topic_score_codex":0.000004497421,"about_ca_topic_score_gemma":0.000023130973,"teacher_disagreement_score":0.15802373,"about_ca_system_score_codex":0.000044044205,"about_ca_system_score_gemma":0.000029367313,"threshold_uncertainty_score":0.7797567},"labels":[],"label_agreement":null},{"id":"W4395670988","doi":"10.4153/s0008414x24000270","title":"Catching a robber on a random <i>k</i>-uniform hypergraph","year":2024,"lang":"en","type":"article","venue":"Canadian Journal of Mathematics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; Austrian Science Fund; TU Graz, Internationale Beziehungen und Mobilitätsprogramme","keywords":"Mathematics; Hypergraph; Combinatorics; Discrete mathematics","score_opus":0.02525655135870467,"score_gpt":0.26972121269979016,"score_spread":0.2444646613410855,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4395670988","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.93342966,0.002793638,0.013003259,0.0014420553,0.0037324533,0.00041902487,0.000058855723,0.000088181376,0.045032892],"genre_scores_gemma":[0.9796173,0.00004025488,0.018961912,0.00027416504,0.0003938768,0.0000028697148,7.7951216e-7,0.00006813325,0.0006407238],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985004,0.00005291177,0.00064560556,0.00012749208,0.00031535706,0.0003582285],"domain_scores_gemma":[0.99796164,0.00093663426,0.00019651007,0.00031046665,0.00012186728,0.00047289877],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011022263,0.00022258774,0.0004314786,0.00060594664,0.00024584774,0.00016983596,0.00038989328,0.00011887152,0.00021110079],"category_scores_gemma":[0.0006616916,0.00015496532,0.0003565602,0.00027642728,0.000104701845,0.00014772371,0.000017359931,0.0005411809,0.000019035702],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015033744,0.000031786312,0.000043252763,0.0004361341,0.00026551675,0.0006080108,0.00937797,0.000043490203,0.000043620465,0.97028077,0.016539946,0.0023144826],"study_design_scores_gemma":[0.0005168461,0.00011381486,0.000015661377,0.0010470524,0.00016651726,0.001192178,0.0008747175,0.00051944243,0.00018287054,0.9753076,0.01983898,0.00022431006],"about_ca_topic_score_codex":0.00009242746,"about_ca_topic_score_gemma":0.0013586375,"teacher_disagreement_score":0.046187647,"about_ca_system_score_codex":0.000120278484,"about_ca_system_score_gemma":0.0005072612,"threshold_uncertainty_score":0.63193023},"labels":[],"label_agreement":null},{"id":"W4396741754","doi":"10.1112/blms.13057","title":"Equidistribution of high traces of random matrices over finite fields and cancellation in character sums of high conductor","year":2024,"lang":"en","type":"article","venue":"Bulletin of the London Mathematical Society","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"European Research Council","keywords":"Mathematics; Conductor; Character (mathematics); Finite field; Pure mathematics; Combinatorics; Geometry","score_opus":0.015344163225602836,"score_gpt":0.26179353183528753,"score_spread":0.2464493686096847,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4396741754","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9966114,0.00072082994,0.0012825847,0.0005891667,0.0001490235,0.0003271288,0.00013035962,0.000011943732,0.00017755314],"genre_scores_gemma":[0.9966775,0.00020114872,0.0028418982,0.000021246962,0.000036396807,0.000007459883,0.000004371959,0.000013127785,0.00019682138],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985504,0.00010768809,0.0007360273,0.00015672322,0.00031220447,0.00013693063],"domain_scores_gemma":[0.99705213,0.002222107,0.00037359042,0.0002553107,0.00007296314,0.000023903198],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00077482883,0.00014209129,0.0005576783,0.000032463973,0.00003409302,0.0000094351935,0.00018664172,0.00018224014,0.00058951945],"category_scores_gemma":[0.00038391634,0.000088544606,0.00027464927,0.00015822599,0.00032682854,0.000028209155,0.00012301675,0.00017342092,6.1399294e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00036409395,0.0002658367,0.00091474684,0.013591606,0.00036820234,0.0000012015953,0.0073884013,0.00006736997,0.010951325,0.95995677,0.0053521264,0.00077830034],"study_design_scores_gemma":[0.0016993348,0.00010209259,0.0027422495,0.001274205,0.00023608597,0.0000041105523,0.0002698158,0.0013437311,0.06969712,0.9219029,0.00055420963,0.00017416396],"about_ca_topic_score_codex":0.00012463736,"about_ca_topic_score_gemma":0.000003955852,"teacher_disagreement_score":0.058745794,"about_ca_system_score_codex":0.00001933607,"about_ca_system_score_gemma":0.000019095884,"threshold_uncertainty_score":0.6454824},"labels":[],"label_agreement":null},{"id":"W4399120955","doi":"10.1016/j.jctb.2024.05.003","title":"The burning number conjecture holds asymptotically","year":2024,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Conjecture; Mathematics; Combinatorics","score_opus":0.01176928435438561,"score_gpt":0.2922803584006069,"score_spread":0.2805110740462213,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399120955","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.831754,0.0053700125,0.0038354197,0.003410812,0.08536928,0.00043464729,0.000013732179,0.00027751015,0.06953457],"genre_scores_gemma":[0.99499583,0.00017194032,0.00065786793,0.00006941511,0.002383,0.0000021743,3.0961195e-7,0.00004626959,0.0016732016],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99791276,0.00047600453,0.00066405686,0.00013318245,0.00051775435,0.00029626518],"domain_scores_gemma":[0.99542975,0.0036391127,0.00026772905,0.00030526443,0.00024228943,0.000115851304],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032149763,0.00022202688,0.00037067774,0.000066133565,0.00054478087,0.0003473727,0.00055544614,0.0001763267,0.00030347332],"category_scores_gemma":[0.0013744537,0.000119080134,0.00034929343,0.00021958472,0.0003869411,0.00034195694,0.00013367194,0.0008661726,0.0000086226055],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00047731263,0.00002281354,0.000034408145,0.000050818744,0.00031275678,0.00012221372,0.0012893223,0.000002702574,0.0000973246,0.99062216,0.0049540107,0.0020141813],"study_design_scores_gemma":[0.00037485082,0.00023086833,0.000023281737,0.00013840596,0.00011604408,0.00075997476,0.00039773635,0.000004717658,0.0006288528,0.8943648,0.10282128,0.00013921507],"about_ca_topic_score_codex":2.3733939e-7,"about_ca_topic_score_gemma":2.6406406e-7,"teacher_disagreement_score":0.1632418,"about_ca_system_score_codex":0.000054477387,"about_ca_system_score_gemma":0.00013063557,"threshold_uncertainty_score":0.48559472},"labels":[],"label_agreement":null},{"id":"W4399771641","doi":"10.1016/j.jctb.2024.05.006","title":"On the use of senders for asymmetric tuples of cliques in Ramsey theory","year":2024,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Engineering and Physical Sciences Research Council; Deutsche Forschungsgemeinschaft; Australian Government","keywords":"Tuple; Mathematics; Combinatorics; Discrete mathematics","score_opus":0.06546077576914389,"score_gpt":0.31444724990977746,"score_spread":0.24898647414063357,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399771641","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98627174,0.0011889648,0.0027101373,0.00032582344,0.0073630516,0.00052227697,0.0000471184,0.000027805821,0.0015430932],"genre_scores_gemma":[0.998254,0.00017810363,0.001053368,0.000057647354,0.00026790667,0.000005490036,6.02827e-7,0.00003639935,0.0001464536],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975161,0.00084317493,0.0009371545,0.00012301418,0.00038626656,0.00019430197],"domain_scores_gemma":[0.98128927,0.017505076,0.0005693365,0.00031015833,0.00028128453,0.000044858538],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0047258413,0.00019558308,0.00057643466,0.00049133855,0.00007945797,0.000050498442,0.00041243175,0.00014837937,0.000054141365],"category_scores_gemma":[0.005650765,0.000113130656,0.00041553736,0.00046250867,0.0003705236,0.0003088844,0.0000744308,0.0004071207,2.1428937e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0033078534,0.00012621503,0.00003392211,0.00027299332,0.00029166686,0.000010226634,0.0021985515,0.000023586099,0.00020224527,0.99004567,0.00153388,0.0019531732],"study_design_scores_gemma":[0.00065389875,0.00092663214,0.00004051845,0.0004072122,0.00010751773,0.00002213531,0.0010898751,0.000017065928,0.010330354,0.98352134,0.0027705238,0.00011290961],"about_ca_topic_score_codex":0.0000014582845,"about_ca_topic_score_gemma":8.012996e-7,"teacher_disagreement_score":0.016661901,"about_ca_system_score_codex":0.000047499212,"about_ca_system_score_gemma":0.00011142593,"threshold_uncertainty_score":0.6764901},"labels":[],"label_agreement":null},{"id":"W4400218586","doi":"10.1112/plms.12618","title":"A lower bound on the mean value of the Erdős–Hooley Delta function","year":2024,"lang":"en","type":"article","venue":"Proceedings of the London Mathematical Society","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"Fonds de recherche du Québec – Nature et technologies; Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Mathematics; Upper and lower bounds; Exponent; Function (biology); Combinatorics; Value (mathematics); Mathematical analysis; Statistics","score_opus":0.020125090479289797,"score_gpt":0.2592346909794074,"score_spread":0.2391096005001176,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400218586","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98453945,0.0001791846,0.00034498048,0.003184058,0.00061501435,0.0007784545,0.000017982426,0.00009511654,0.010245779],"genre_scores_gemma":[0.99693364,0.00001880932,0.0011856153,0.0005205655,0.00015894943,0.00003302879,2.1131429e-7,0.00005088017,0.0010982866],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99794835,0.000029752542,0.000563795,0.00028877633,0.0008625124,0.00030682381],"domain_scores_gemma":[0.9978851,0.0011364444,0.00029295767,0.00045461167,0.00018072061,0.000050181436],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015509638,0.00027318415,0.0003672716,0.000022601675,0.00044725309,0.000103733764,0.001014287,0.00018715096,0.00016569217],"category_scores_gemma":[0.0009072614,0.00010926947,0.0010262709,0.0005055484,0.00066311785,0.00010798006,0.0005189805,0.0006096212,0.0000075994985],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031527274,0.000108321234,0.00007596655,0.0011525456,0.00024279543,7.507887e-8,0.0044813454,0.0000021200592,0.0032337122,0.97256845,0.01795386,0.00014928024],"study_design_scores_gemma":[0.00015092152,0.000070957576,0.00020696256,0.00076012564,0.0003043058,0.0000097268485,0.0009810274,0.0020654434,0.013625219,0.98089737,0.000792049,0.00013590758],"about_ca_topic_score_codex":0.0000032184887,"about_ca_topic_score_gemma":5.177575e-7,"teacher_disagreement_score":0.017161809,"about_ca_system_score_codex":0.000064596235,"about_ca_system_score_gemma":0.000037587215,"threshold_uncertainty_score":0.445588},"labels":[],"label_agreement":null},{"id":"W4400596706","doi":"10.55016/ojs/cdm.v13i2.62416","title":"A lower bound on the hypergraph Ramsey number R(4,5;3)","year":2018,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Ramsey's theorem; Hypergraph; Combinatorics; Mathematics; Set (abstract data type); Element (criminal law); Upper and lower bounds; Discrete mathematics; Graph; Computer science","score_opus":0.022868031830504846,"score_gpt":0.3238653703416144,"score_spread":0.30099733851110955,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400596706","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.80562985,0.000043403008,0.048248537,0.0072730416,0.0015885488,0.0020710505,0.0006461621,0.00046413098,0.13403527],"genre_scores_gemma":[0.98904186,0.00000587659,0.006696882,0.0014354209,0.0005582248,0.00013048411,0.0000076033907,0.000060792136,0.0020628744],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99790263,0.00013773615,0.0005370801,0.0003470839,0.0004779446,0.0005975269],"domain_scores_gemma":[0.99624705,0.0015178501,0.00018133274,0.0013871593,0.00045959957,0.00020701942],"candidate_categories":["sts","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00094788626,0.00035253027,0.00041125948,0.00009833877,0.0013833123,0.00017202667,0.0006859472,0.00016508727,0.0014923944],"category_scores_gemma":[0.0036120457,0.00021033279,0.00028308615,0.0005564941,0.0005411584,0.000081696846,0.00027654853,0.0003178117,0.00087142596],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032935237,0.0001228766,0.000029611761,0.000020835347,0.000107486594,0.0000037897523,0.0014395365,6.534803e-7,0.0001698084,0.9610115,0.03694591,0.00011505343],"study_design_scores_gemma":[0.00029266224,0.00016576385,0.000072297495,0.00013114474,0.00011300263,0.000029631594,0.0003607887,0.00023226434,0.0017785814,0.96704525,0.02944112,0.0003375212],"about_ca_topic_score_codex":0.000003810273,"about_ca_topic_score_gemma":0.000012582551,"teacher_disagreement_score":0.183412,"about_ca_system_score_codex":0.00009220697,"about_ca_system_score_gemma":0.000047378802,"threshold_uncertainty_score":0.99991673},"labels":[],"label_agreement":null},{"id":"W4400596709","doi":"10.55016/ojs/cdm.v13i2.62731","title":"Small on-line Ramsey numbers---a new approach","year":2018,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Combinatorics; Ramsey's theorem; Mathematics; Generalization; Line (geometry); Discrete mathematics; Graph","score_opus":0.07199690665834285,"score_gpt":0.3478691049751285,"score_spread":0.27587219831678567,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400596709","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04018408,0.000035769805,0.85193145,0.0012825403,0.0005882242,0.0012943773,0.00035158906,0.000413965,0.10391802],"genre_scores_gemma":[0.6498049,0.000008870563,0.3325178,0.00114573,0.0018537334,0.000101137346,0.000069274945,0.00013085219,0.0143677015],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997731,0.00009465418,0.0006624489,0.00047570185,0.0003894189,0.0006468336],"domain_scores_gemma":[0.9969477,0.00067379116,0.00021604513,0.0013276428,0.00038226452,0.00045257556],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007397593,0.00040379798,0.00057970616,0.00018428481,0.00068475684,0.000120162855,0.0006847686,0.00022421403,0.0004818496],"category_scores_gemma":[0.0033051083,0.0003145776,0.0002510077,0.00052519114,0.0002509985,0.00007526783,0.0003101344,0.0003148723,0.0005494184],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004259768,0.00018399204,0.000009705894,0.000062788946,0.000113753595,0.0000027609713,0.0027885907,0.00001559459,0.00010721185,0.964761,0.031229028,0.0006829557],"study_design_scores_gemma":[0.00091746246,0.00026854992,0.000019763556,0.00013346142,0.00016333736,0.00003641811,0.00044784666,0.0025692289,0.002378119,0.9771574,0.015410574,0.00049784296],"about_ca_topic_score_codex":0.000010483517,"about_ca_topic_score_gemma":0.000014550767,"teacher_disagreement_score":0.6096208,"about_ca_system_score_codex":0.0001328741,"about_ca_system_score_gemma":0.00009995304,"threshold_uncertainty_score":0.9999306},"labels":[],"label_agreement":null},{"id":"W4400596815","doi":"10.55016/ojs/cdm.v16i1.69407","title":"Direct and inverse problems for restricted signed sumsets in integers","year":2021,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Division of Human Resource Development; Ministry of Education, India; Indian Institute of Technology Roorkee","keywords":"Mathematics; Combinatorics; Inverse; Abelian group; Integer (computer science); Lambda; Cardinality (data modeling); Wedge (geometry); Sigma; Discrete mathematics; Physics; Geometry; Computer science","score_opus":0.024886383372675666,"score_gpt":0.31594890040409046,"score_spread":0.2910625170314148,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400596815","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.75421244,0.00067613245,0.22404486,0.0029273722,0.0005976536,0.004866382,0.002286997,0.00040427924,0.009983865],"genre_scores_gemma":[0.93678355,0.000045853973,0.061555028,0.00019391945,0.000070720234,0.00035806125,0.00008866705,0.0000548573,0.0008493319],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983938,0.000104724655,0.0005606469,0.00033927095,0.00018068292,0.0004209143],"domain_scores_gemma":[0.997379,0.0014840993,0.0001330677,0.0004887352,0.0003442971,0.0001708244],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005047029,0.00023732461,0.00050187483,0.00018565948,0.0002639249,0.00007902305,0.00017887048,0.00015249204,0.00003443064],"category_scores_gemma":[0.0071119033,0.00020408908,0.00012373981,0.00055119244,0.000104489496,0.00009611289,0.00020155315,0.00015119681,0.0000036389204],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000039734536,0.00017157556,0.00013086035,0.0004989982,0.00010865051,0.00001918194,0.0047035236,0.000035071826,0.004548022,0.98505294,0.004373621,0.00031782204],"study_design_scores_gemma":[0.0015729327,0.00010109664,0.00018471105,0.00038575035,0.00013964144,0.000025690608,0.0012832353,0.0026536104,0.006507494,0.9835568,0.0031689152,0.00042012817],"about_ca_topic_score_codex":0.0000060730367,"about_ca_topic_score_gemma":0.00012584127,"teacher_disagreement_score":0.1825711,"about_ca_system_score_codex":0.00011238741,"about_ca_system_score_gemma":0.000087790744,"threshold_uncertainty_score":0.8514126},"labels":[],"label_agreement":null},{"id":"W4401269505","doi":"10.5644/sjm.01.1.03","title":"On a Question Raised by Brown, Graham and Landman","year":2024,"lang":"en","type":"article","venue":"SARAJEVO JOURNAL OF MATHEMATICS","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Epistemology; Mathematics; Philosophy","score_opus":0.016962342719865846,"score_gpt":0.30258932617157625,"score_spread":0.2856269834517104,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401269505","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97847587,0.0031211982,0.012666205,0.0004971497,0.0007744257,0.00018847833,0.00002086243,0.0000802467,0.004175541],"genre_scores_gemma":[0.9812409,0.0002647688,0.017418802,0.00011379809,0.00021865247,0.0000021356134,0.000001242268,0.000049541926,0.0006901514],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986752,0.000080219856,0.00055993773,0.00012303705,0.0003883745,0.00017319543],"domain_scores_gemma":[0.99833053,0.0010294684,0.00024887847,0.00019782184,0.00008891536,0.000104385326],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001049319,0.00018756618,0.00035789967,0.00018905565,0.00010285475,0.000112611844,0.00017661043,0.00010758051,0.00008461771],"category_scores_gemma":[0.00054495106,0.00012328003,0.00014310528,0.0001243902,0.00008482668,0.00014167848,0.000042016472,0.00036558078,0.0000062131726],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000037682414,0.00014683722,0.00003204361,0.00076059974,0.00017483818,0.00007353928,0.0031437844,0.0000025079546,0.0009927029,0.9488217,0.043425,0.0023887553],"study_design_scores_gemma":[0.00039607284,0.00025535654,0.000023445295,0.00084861874,0.000101640864,0.0005538203,0.00021547628,0.00042942047,0.0008853493,0.99326086,0.0028828136,0.00014709764],"about_ca_topic_score_codex":6.743704e-7,"about_ca_topic_score_gemma":6.454556e-7,"teacher_disagreement_score":0.04443918,"about_ca_system_score_codex":0.000032715627,"about_ca_system_score_gemma":0.00002832797,"threshold_uncertainty_score":0.50272137},"labels":[],"label_agreement":null},{"id":"W4401579488","doi":"10.1016/j.ffa.2024.102492","title":"The subspace structure of maximum cliques in pseudo-Paley graphs from unions of cyclotomic classes","year":2024,"lang":"en","type":"article","venue":"Finite Fields and Their Applications","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; University of British Columbia","keywords":"Mathematics; Subspace topology; Combinatorics; Discrete mathematics; Mathematical analysis","score_opus":0.013864434196348545,"score_gpt":0.2738438776061649,"score_spread":0.2599794434098164,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401579488","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98437977,0.0026315537,0.009118723,0.000611871,0.00012054204,0.00044580258,0.000724279,0.000053707798,0.0019137666],"genre_scores_gemma":[0.9975777,0.0009929332,0.0012271807,0.0000326662,0.000039225142,0.000041171475,0.00001947781,0.000014393531,0.000055201413],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99928254,0.000054197848,0.00029972664,0.00017385303,0.00006993264,0.000119744676],"domain_scores_gemma":[0.99723583,0.0021940728,0.00008762018,0.00041126568,0.000042227053,0.000029001996],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011557179,0.0001236586,0.00019524992,0.00009459582,0.00013434592,0.000026260604,0.00022289886,0.00014023767,0.000032712764],"category_scores_gemma":[0.000048254242,0.0000741718,0.00008266994,0.0002728652,0.00019293875,0.000037928046,0.00007850873,0.0002364108,3.4321184e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010816482,0.00002004607,0.0009645583,0.000082293365,0.00006178779,2.958069e-7,0.0020107944,0.0000046772334,0.001397804,0.9915145,0.0002372467,0.0036951525],"study_design_scores_gemma":[0.00008173596,0.00002209824,0.0019389894,0.0000687914,0.000023860464,0.0000016990577,0.0005469334,0.00029689085,0.0028929685,0.989808,0.0042381715,0.000079835176],"about_ca_topic_score_codex":0.00008073401,"about_ca_topic_score_gemma":0.00041900223,"teacher_disagreement_score":0.013197997,"about_ca_system_score_codex":0.0000050790172,"about_ca_system_score_gemma":0.00002567605,"threshold_uncertainty_score":0.30246386},"labels":[],"label_agreement":null},{"id":"W4401894564","doi":"10.1137/24m1639488","title":"On Multicolor Turán Numbers","year":2024,"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":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Australian Research Council; Natural Sciences and Engineering Research Council of Canada; Deutsche Forschungsgemeinschaft; American Mathematical Society; National Science Foundation","keywords":"Mathematics; Combinatorics; Discrete mathematics","score_opus":0.027673408085942416,"score_gpt":0.3301607663311669,"score_spread":0.3024873582452245,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401894564","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.79060566,0.0006760062,0.015220004,0.0020279784,0.0061650397,0.0009530877,0.00008325229,0.00076597976,0.18350297],"genre_scores_gemma":[0.96969146,0.00009500243,0.024774903,0.000498563,0.0006174265,0.000015073179,0.000002507099,0.00015835928,0.0041467333],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99758404,0.00011761557,0.00072070945,0.00030377545,0.0007873965,0.0004864796],"domain_scores_gemma":[0.9968992,0.00201589,0.00022023817,0.0005417944,0.00007027614,0.0002526064],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009403338,0.0004112741,0.00047477992,0.00029189646,0.00043110203,0.00038068788,0.00047860612,0.00018400325,0.00083228905],"category_scores_gemma":[0.0009434855,0.0002619022,0.00046291907,0.00024872064,0.00013587406,0.00016009444,0.000094525596,0.0010836511,0.00025416928],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000046273508,0.00013567931,0.0000037401896,0.00038660117,0.00022092123,0.00026980686,0.0035140992,0.00004632115,0.00008678984,0.978679,0.01520215,0.001408646],"study_design_scores_gemma":[0.00038325362,0.00032978607,0.000012094763,0.0011206573,0.00012319765,0.0005091087,0.0005922651,0.0029885941,0.000474908,0.98766476,0.005444743,0.00035660883],"about_ca_topic_score_codex":5.031113e-7,"about_ca_topic_score_gemma":0.0000010588395,"teacher_disagreement_score":0.17935623,"about_ca_system_score_codex":0.00013340212,"about_ca_system_score_gemma":0.000052200787,"threshold_uncertainty_score":0.9999833},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.028401674492777522,"score_gpt":0.31515103928519994,"score_spread":0.2867493647924224,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401922144","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.93686014,0.0029496222,0.0314204,0.0009759875,0.0025823077,0.00059416925,0.00018784749,0.00028691042,0.024142608],"genre_scores_gemma":[0.9793322,0.00023607636,0.01957308,0.00010800825,0.00026161212,0.0000061447804,0.000004687939,0.00007901074,0.00039916742],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971949,0.00018121465,0.0010777694,0.00023749891,0.00091325986,0.000395356],"domain_scores_gemma":[0.99732596,0.0013717514,0.00041321482,0.0005452807,0.00013708031,0.00020671969],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014086196,0.00035307562,0.0006350965,0.0002972062,0.0002654653,0.00013497868,0.0005459236,0.00015268938,0.0006564335],"category_scores_gemma":[0.00035849962,0.00023633752,0.00064182177,0.00031911026,0.00027379952,0.00016360047,0.0001384277,0.0008089089,0.000023094484],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000045215296,0.00017379134,0.00008170506,0.000772106,0.0003629138,0.00008870496,0.002016037,0.000009556107,0.00047725064,0.99038565,0.0031416784,0.0024454165],"study_design_scores_gemma":[0.00030662527,0.00021807394,0.00011859455,0.00070994,0.00017376959,0.00051573256,0.0002640992,0.0018417132,0.0013927626,0.99175155,0.0024421257,0.00026500743],"about_ca_topic_score_codex":0.0000010410803,"about_ca_topic_score_gemma":0.0000013106264,"teacher_disagreement_score":0.042472064,"about_ca_system_score_codex":0.0000623226,"about_ca_system_score_gemma":0.00006446513,"threshold_uncertainty_score":0.9637565},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"National Science Foundation","keywords":"Rainbow; Mathematics; Combinatorics; Discrete mathematics; Physics; Optics","score_opus":0.03558605946525564,"score_gpt":0.3326163717282182,"score_spread":0.2970303122629625,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402011228","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.58546853,0.0041902037,0.048181325,0.0042074365,0.008927741,0.0011224722,0.000101150545,0.0014041058,0.34639707],"genre_scores_gemma":[0.9611326,0.00022356326,0.031562746,0.00033173437,0.0010161503,0.00001090891,0.0000023879347,0.00015406843,0.005565833],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977855,0.00008984846,0.00068978226,0.0002606608,0.00071533315,0.0004588534],"domain_scores_gemma":[0.9980612,0.00093116175,0.00017956238,0.0005335987,0.000072497205,0.00022201196],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012220948,0.0003541871,0.0004317641,0.00028828176,0.0004431096,0.00043763395,0.0005049966,0.00016157984,0.0008229849],"category_scores_gemma":[0.00045911988,0.00022514319,0.00044260052,0.0002837374,0.00013941019,0.00021116783,0.00012502566,0.0009002122,0.00011517515],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015767833,0.000062360516,0.000014036181,0.00039512783,0.00019075513,0.00024968458,0.0032078552,0.000010315893,0.00010146966,0.97675073,0.017172584,0.0018292883],"study_design_scores_gemma":[0.00022823346,0.0001592041,0.0000132767445,0.0007698242,0.000104428735,0.0012038423,0.00048553257,0.001295412,0.00033062868,0.98000884,0.015096222,0.00030457336],"about_ca_topic_score_codex":2.308989e-7,"about_ca_topic_score_gemma":5.444078e-7,"teacher_disagreement_score":0.37566411,"about_ca_system_score_codex":0.0000818647,"about_ca_system_score_gemma":0.00006064316,"threshold_uncertainty_score":0.9181073},"labels":[],"label_agreement":null},{"id":"W4402811414","doi":"10.1002/jgt.23169","title":"Finding dense minors using average degree","year":2024,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada; Institute for Basic Science","keywords":"Mathematics; Degree (music); Combinatorics; Physics","score_opus":0.08344911252887244,"score_gpt":0.3362640378418241,"score_spread":0.2528149253129517,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402811414","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9710374,0.003420971,0.02000588,0.00003555649,0.0022564377,0.00007760881,0.0000062331615,0.000045996032,0.0031139466],"genre_scores_gemma":[0.9898477,0.00009755511,0.0090307,0.00008582263,0.00048455087,5.3999344e-7,2.2352698e-7,0.000047880763,0.0004050224],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983165,0.0002862535,0.0006008209,0.00015034627,0.00037189285,0.0002741422],"domain_scores_gemma":[0.99798775,0.0012551,0.00028128957,0.0002505553,0.000106405714,0.000118915894],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023475143,0.00020478567,0.0003506311,0.0006438287,0.00023231111,0.00009874698,0.0003416238,0.0001256328,0.00027399842],"category_scores_gemma":[0.00042986393,0.00014321513,0.00052160997,0.0003520121,0.00014900621,0.00025776483,0.00008112177,0.0005430519,0.0000038598796],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013826594,0.000034459263,0.0002450603,0.00018775271,0.00042359202,0.0006754859,0.0035053585,0.00003891465,0.002278913,0.98233235,0.0012050713,0.008934794],"study_design_scores_gemma":[0.0002298282,0.00007624729,0.0001539035,0.00040704943,0.00022225031,0.001435086,0.00045012994,0.00013597263,0.0015010121,0.9944411,0.0007704364,0.00017698025],"about_ca_topic_score_codex":8.363972e-7,"about_ca_topic_score_gemma":0.0000010479608,"teacher_disagreement_score":0.018810336,"about_ca_system_score_codex":0.00005793634,"about_ca_system_score_gemma":0.00006771743,"threshold_uncertainty_score":0.5840144},"labels":[],"label_agreement":null},{"id":"W4403196330","doi":"10.1016/j.disc.2024.114275","title":"Turán numbers and switching","year":2024,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"Heilbronn Institute for Mathematical Research; Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Discrete mathematics","score_opus":0.02275104926666183,"score_gpt":0.3144958308490341,"score_spread":0.29174478158237227,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403196330","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8680463,0.0016244728,0.040991195,0.00044406386,0.00090087345,0.00043065983,0.000027031365,0.00075766584,0.08677776],"genre_scores_gemma":[0.9526085,0.000058608137,0.045800257,0.00007208525,0.00015170765,0.000012183156,0.0000023226592,0.00006725096,0.001227072],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989326,0.000028973696,0.00031137912,0.0002468443,0.00023320467,0.00024700497],"domain_scores_gemma":[0.9988626,0.0006328925,0.00005330734,0.00034374566,0.000019579193,0.000087851244],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041197,0.00021162166,0.00025750027,0.00009091223,0.00019164862,0.00018099927,0.00016601848,0.0000941787,0.000112594425],"category_scores_gemma":[0.00022255794,0.00014943554,0.00011007793,0.00014139494,0.000079425336,0.00013889097,0.00016169569,0.00023796095,0.000019219378],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000021934109,0.000011498502,0.000031155538,0.00087212684,0.00007574848,0.00002332794,0.009556341,4.2005632e-7,0.00021662077,0.9858244,0.0012391146,0.0021470208],"study_design_scores_gemma":[0.0000888349,0.000016831627,0.000022036633,0.00028858276,0.000087765664,0.000101216516,0.0010650854,0.0033152832,0.00023313858,0.99165577,0.0029082808,0.0002171927],"about_ca_topic_score_codex":0.000003721404,"about_ca_topic_score_gemma":0.0000037995064,"teacher_disagreement_score":0.08555069,"about_ca_system_score_codex":0.000018604864,"about_ca_system_score_gemma":0.00001363655,"threshold_uncertainty_score":0.6093804},"labels":[],"label_agreement":null},{"id":"W4403365292","doi":"10.48550/arxiv.2410.08077","title":"Maximum $k$-colourable induced subgraphs in $(P_5+rK_1)$-free graphs","year":2024,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Government of Ontario","keywords":"Combinatorics; Mathematics","score_opus":0.09776615042061397,"score_gpt":0.22200212719049014,"score_spread":0.12423597676987617,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403365292","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97103274,0.00026407474,0.00015697458,0.00011317558,0.001909083,0.0007091435,0.00009204197,0.00041651647,0.025306255],"genre_scores_gemma":[0.9968119,0.0002524297,0.00046227252,0.000101161204,0.00006728401,0.000005456157,0.000017378918,0.00011238546,0.0021696808],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9967327,0.0002949278,0.00053097657,0.0014853152,0.00020302186,0.0007530551],"domain_scores_gemma":[0.99653363,0.0004321337,0.00031436473,0.0023559087,0.00013775227,0.0002262346],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.00069511967,0.00072442763,0.0008636182,0.0013432472,0.00023815568,0.00010515863,0.002070364,0.0010231838,0.00024259851],"category_scores_gemma":[0.0002483133,0.000740524,0.0006690955,0.0014195363,0.00032574317,0.00013760682,0.0042299726,0.002437227,0.00005070348],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011734448,0.00013040828,0.0026297697,0.0006532761,0.00029876924,0.001063044,0.0009439624,0.00070751476,0.000057022044,0.9907457,0.0025140936,0.00013906902],"study_design_scores_gemma":[0.00084531086,0.00006484245,0.00071180175,0.000347282,0.00030651395,0.000011312575,0.00045847293,0.0019448939,0.00018817853,0.9941241,0.00019504227,0.00080221746],"about_ca_topic_score_codex":0.00030666235,"about_ca_topic_score_gemma":0.000565084,"teacher_disagreement_score":0.025779216,"about_ca_system_score_codex":0.00027900492,"about_ca_system_score_gemma":0.00020150497,"threshold_uncertainty_score":0.99986416},"labels":[],"label_agreement":null},{"id":"W4403475401","doi":"10.1017/s0963548324000300","title":"Embedding theorems for random graphs with specified degrees","year":2024,"lang":"en","type":"article","venue":"Combinatorics Probability Computing","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Embedding; Mathematics; Random graph; Discrete mathematics; Combinatorics; Computer science; Graph; Artificial intelligence","score_opus":0.048649579879659344,"score_gpt":0.31920845635587564,"score_spread":0.2705588764762163,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403475401","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8139531,0.00071002485,0.17692499,0.000121061064,0.0020132945,0.0015826621,0.000010700577,0.0008028165,0.003881349],"genre_scores_gemma":[0.9709492,0.0000060856864,0.028699303,0.000018690573,0.00015140646,0.000032095,0.0000052736036,0.00006824917,0.00006970966],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978588,0.00015833003,0.00051268283,0.00063566683,0.0003370347,0.00049744826],"domain_scores_gemma":[0.9951836,0.0038011696,0.000091224014,0.0005932498,0.00022493688,0.00010585306],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020847602,0.00033689552,0.0004885435,0.00015219336,0.0006170253,0.00021206622,0.000426082,0.00013974219,0.000011854468],"category_scores_gemma":[0.00070797384,0.00024084395,0.00026904882,0.00052543,0.0002384747,0.00013014165,0.00021349185,0.00037701783,0.0000014010243],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014424743,0.00008440666,0.0004334297,0.00090904,0.00012033851,0.000007729483,0.0016961646,0.00023117369,0.000026793197,0.9916471,0.00025404716,0.004445486],"study_design_scores_gemma":[0.00092242326,0.0001541454,0.00009783027,0.0002662224,0.00008271063,0.000023957524,0.00012759544,0.035942804,0.00036570698,0.9611226,0.0005608774,0.0003331666],"about_ca_topic_score_codex":0.0000019906795,"about_ca_topic_score_gemma":0.0000017358251,"teacher_disagreement_score":0.15699609,"about_ca_system_score_codex":0.000120258126,"about_ca_system_score_gemma":0.00006253808,"threshold_uncertainty_score":0.9821331},"labels":[],"label_agreement":null},{"id":"W4403603865","doi":"10.1016/j.disc.2024.114295","title":"On the size and structure of t-representable sumsets","year":2024,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal; Université du Québec à Montréal","funders":"","keywords":"Mathematics; Combinatorics; Discrete mathematics","score_opus":0.019409441234399576,"score_gpt":0.29332305517473106,"score_spread":0.2739136139403315,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403603865","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9845324,0.0003980013,0.0007385456,0.00041781497,0.00026983194,0.00035648845,0.00011914586,0.00009251594,0.013075254],"genre_scores_gemma":[0.99404657,0.000024547211,0.004987765,0.00007404625,0.000054530497,0.0000052327528,0.0000017728587,0.000039245708,0.00076627854],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99892884,0.00005544248,0.0003166332,0.00020288333,0.00030463765,0.00019157048],"domain_scores_gemma":[0.99544835,0.003827708,0.00008733022,0.000560662,0.000030701896,0.000045260666],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027815593,0.00019315627,0.00027471353,0.000050422175,0.00014674528,0.00007659089,0.00024782642,0.000086115724,0.0004430244],"category_scores_gemma":[0.0008853213,0.00009993703,0.00010543997,0.00016092489,0.0002113388,0.000059270697,0.00016349688,0.00022471508,0.0000036116035],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000067164765,0.000014974248,0.000017877344,0.00064108166,0.00009534914,0.0000044640965,0.0038179487,0.000002400289,0.001553414,0.99098337,0.0027121787,0.00015020354],"study_design_scores_gemma":[0.000084295236,0.00003527244,0.000044403314,0.0002493393,0.000075960044,0.000022977694,0.00067952304,0.0010289715,0.0054603927,0.9918684,0.0003268938,0.00012356947],"about_ca_topic_score_codex":0.0000030553556,"about_ca_topic_score_gemma":0.0000025013774,"teacher_disagreement_score":0.012308975,"about_ca_system_score_codex":0.000010214918,"about_ca_system_score_gemma":0.000014189216,"threshold_uncertainty_score":0.48508063},"labels":[],"label_agreement":null},{"id":"W4403610068","doi":"10.1017/fmp.2024.19","title":"Monochromatic products and sums in the rationals","year":2024,"lang":"en","type":"article","venue":"Forum of Mathematics Pi","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada; Fondation Sciences Mathématiques de Paris","keywords":"Rational number; Monochromatic color; Mathematics; Physics; Discrete mathematics; Optics","score_opus":0.033773192160903014,"score_gpt":0.30499852710684966,"score_spread":0.27122533494594664,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403610068","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9882685,0.0016198473,0.0014780035,0.0019239894,0.00021281603,0.0006708684,0.000015595479,0.00006200233,0.0057483935],"genre_scores_gemma":[0.97995734,0.000039371036,0.019618161,0.00006321985,0.000044372693,0.000029293358,0.0000021803087,0.000020702464,0.00022538057],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99893606,0.000056587567,0.00041096212,0.00015245056,0.0002769087,0.00016705858],"domain_scores_gemma":[0.99830925,0.0011929879,0.00008427048,0.00035888387,0.000035743942,0.000018867739],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009901015,0.0001305696,0.00023639473,0.00011934416,0.000070796035,0.00005083048,0.00022096265,0.000056142588,0.00003696501],"category_scores_gemma":[0.000439888,0.00007582307,0.000053249772,0.00024027769,0.00011206611,0.00009536162,0.00007687411,0.00012836777,0.000004823201],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000018086344,0.00007059693,0.000054017564,0.0016523009,0.000030764455,0.0000054394145,0.011957596,0.0000015176292,0.00027952853,0.9822003,0.0032623485,0.00048377714],"study_design_scores_gemma":[0.00010264878,0.000033861972,0.00014395262,0.00030298525,0.00003427636,0.000049998387,0.0024893912,0.0017479938,0.0009849512,0.9935561,0.00046144167,0.00009243198],"about_ca_topic_score_codex":0.0000028560462,"about_ca_topic_score_gemma":0.0000083666055,"teacher_disagreement_score":0.018140158,"about_ca_system_score_codex":0.000009762044,"about_ca_system_score_gemma":0.00002568819,"threshold_uncertainty_score":0.3091975},"labels":[],"label_agreement":null},{"id":"W4403844212","doi":"10.1007/978-3-031-68656-6_7","title":"The Bolshevik Menace of Anthropological Mathematics: Ramsey and Wittgenstein","year":2024,"lang":"en","type":"book-chapter","venue":"","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Epistemology; Philosophy","score_opus":0.03518924248585037,"score_gpt":0.2998211843355227,"score_spread":0.2646319418496723,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403844212","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00044740268,0.00667931,0.00019630397,0.0003203093,0.00042935423,0.00043815162,0.000034259523,0.00010906072,0.9913458],"genre_scores_gemma":[0.010192137,0.0035378146,0.007153031,0.00006374035,0.00019149047,0.000009670566,0.0000030083766,0.000114855975,0.97873425],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984732,0.000019545334,0.0006163465,0.00032465483,0.0003443119,0.00022191361],"domain_scores_gemma":[0.99768895,0.0012405257,0.00025823037,0.0006705215,0.000073338226,0.000068436464],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051274087,0.00038714326,0.0006370508,0.00007084274,0.00025055648,0.00005795456,0.00033471108,0.00041766302,0.0008465135],"category_scores_gemma":[0.00012544688,0.00018840551,0.0002299885,0.000022715407,0.0013226942,0.000023235365,0.0004586134,0.00046149734,0.00002130317],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011169126,0.000009583241,4.7234926e-7,0.00048795494,0.0002639073,0.000013194506,0.00045235152,3.5217894e-8,0.000014295804,0.990446,0.006692786,0.001608259],"study_design_scores_gemma":[0.000089628535,0.000090036425,4.6624785e-7,0.0002752914,0.00021383952,0.00005554599,0.00031854602,0.000028494302,0.000112467984,0.9205313,0.07806417,0.00022025785],"about_ca_topic_score_codex":0.0000026778412,"about_ca_topic_score_gemma":0.000011256811,"teacher_disagreement_score":0.07137139,"about_ca_system_score_codex":0.000019870504,"about_ca_system_score_gemma":0.000022571487,"threshold_uncertainty_score":0.9268729},"labels":[],"label_agreement":null},{"id":"W4403987219","doi":"10.1016/j.laa.2024.10.026","title":"On the Colin de Verdière graph number and penny graphs","year":2024,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Mathematics; Combinatorics; Graph; Discrete mathematics","score_opus":0.018283317070145487,"score_gpt":0.29659105701004906,"score_spread":0.2783077399399036,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403987219","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9820817,0.0014828149,0.0024040362,0.0019182551,0.00009191905,0.00067585637,0.00006930815,0.00017279116,0.011103334],"genre_scores_gemma":[0.99719197,0.0004567445,0.00085470936,0.00050535356,0.000113979106,0.00017537568,0.0000049766045,0.000024215817,0.0006726591],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993615,0.000038188395,0.00013701258,0.00021513064,0.00009695418,0.00015121535],"domain_scores_gemma":[0.9988516,0.0007837119,0.000025037052,0.0002436308,0.000026328284,0.00006970198],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020922528,0.000120121906,0.00010560125,0.00004652987,0.00039567528,0.00006956075,0.00012127977,0.00007611732,0.00013636293],"category_scores_gemma":[0.000056847428,0.00007562839,0.00005500135,0.00022531279,0.000109733075,0.000041743977,0.000063927975,0.00020396891,0.00002718767],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000043230675,0.000016835958,0.000061209896,0.00005681053,0.000038251157,9.610394e-7,0.0005503055,3.3866522e-7,0.00010611144,0.99447626,0.0033980717,0.0012905209],"study_design_scores_gemma":[0.00007501725,0.000014863862,0.00034497684,0.000026171812,0.000051539013,0.000024527822,0.000101011574,0.000702747,0.0002935278,0.97539294,0.022871258,0.0001013988],"about_ca_topic_score_codex":0.0000026261637,"about_ca_topic_score_gemma":0.0000031294855,"teacher_disagreement_score":0.019473188,"about_ca_system_score_codex":0.0000058862197,"about_ca_system_score_gemma":0.000014693695,"threshold_uncertainty_score":0.30840364},"labels":[],"label_agreement":null},{"id":"W4404374654","doi":"10.48550/arxiv.2411.04071","title":"Simultaneous edge-colourings","year":2024,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Agencia Estatal de Investigación; Engineering and Physical Sciences Research Council; Natural Sciences and Engineering Research Council of Canada","keywords":"Enhanced Data Rates for GSM Evolution; Computer science; Artificial intelligence","score_opus":0.06650950177055477,"score_gpt":0.21489160727574882,"score_spread":0.14838210550519404,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404374654","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9557409,0.0002077384,0.0019863616,0.00005333753,0.0020616099,0.00041324762,0.00006724818,0.00059466803,0.03887483],"genre_scores_gemma":[0.97911674,0.00010599676,0.00053978985,0.00006989705,0.00027849502,9.435598e-7,0.000007932078,0.00007644995,0.019803759],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99819344,0.00010182374,0.00024860151,0.0009583031,0.000101058446,0.00039679633],"domain_scores_gemma":[0.9978042,0.00067016314,0.0001836998,0.0010662484,0.00011645155,0.00015919299],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00024286135,0.00044302552,0.000471201,0.00027649102,0.00022279985,0.000075853866,0.0008985753,0.0005633551,0.0002481832],"category_scores_gemma":[0.0002584768,0.00043939817,0.00043131254,0.00029257612,0.00021352974,0.000043085824,0.003178477,0.0013201826,0.0001415428],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005768678,0.000053448966,0.00009092274,0.0006973807,0.00030377202,0.0017561499,0.0007377407,0.015380974,0.000011299504,0.97812325,0.0024851502,0.0003022513],"study_design_scores_gemma":[0.0002032092,0.000031922886,0.000012301696,0.00019782911,0.0003868372,0.000015216483,0.000118376134,0.025962155,0.00008201447,0.9698591,0.0026407265,0.00049029815],"about_ca_topic_score_codex":0.000029865912,"about_ca_topic_score_gemma":0.000020013807,"teacher_disagreement_score":0.023375781,"about_ca_system_score_codex":0.00019072309,"about_ca_system_score_gemma":0.00009993599,"threshold_uncertainty_score":0.9998058},"labels":[],"label_agreement":null},{"id":"W4404725980","doi":"10.1002/rsa.21272","title":"Typical Structure of Hereditary Graph Families. II. Exotic Examples","year":2024,"lang":"en","type":"article","venue":"Random Structures and Algorithms","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Combinatorics; Mathematics; Graph; Computer science; Genealogy; History","score_opus":0.0235831217979606,"score_gpt":0.268930274852945,"score_spread":0.24534715305498442,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404725980","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9857536,0.008697472,0.0023168887,0.00008313746,0.0018039565,0.00038101448,0.0003282754,0.00018503431,0.00045065218],"genre_scores_gemma":[0.9860497,0.00043723613,0.0126193445,0.00006128165,0.0006173208,0.0000050168205,0.000023313958,0.000053679003,0.00013309454],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981224,0.00010984314,0.00052464206,0.00048761355,0.0003880501,0.00036743618],"domain_scores_gemma":[0.9985511,0.000751451,0.00009717498,0.00039757343,0.00006469748,0.00013800879],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00020554423,0.0003858894,0.00067676516,0.00024340932,0.00035503847,0.00006815649,0.0002699952,0.0002557342,0.00031902248],"category_scores_gemma":[0.00015553128,0.00025559915,0.00025486044,0.0002986371,0.00043621848,0.00013346526,0.00022532564,0.00041933169,4.1583112e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005596563,0.000037438887,0.00020633881,0.0013923282,0.00071967405,0.00016626902,0.004176642,0.0000348667,0.0030744604,0.9110854,0.0046007494,0.073946156],"study_design_scores_gemma":[0.0017450885,0.00013327644,0.001949242,0.0001312849,0.00019691236,0.00038082985,0.0003703978,0.0006309682,0.001692648,0.98984617,0.0025765765,0.00034659434],"about_ca_topic_score_codex":0.00003058587,"about_ca_topic_score_gemma":0.000013462954,"teacher_disagreement_score":0.07876076,"about_ca_system_score_codex":0.000014285549,"about_ca_system_score_gemma":0.000037918042,"threshold_uncertainty_score":0.9999896},"labels":[],"label_agreement":null},{"id":"W4404738330","doi":"10.1016/j.disc.2024.114334","title":"Caps and wickets","year":2024,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Mathematics; Combinatorics; Discrete mathematics","score_opus":0.02655525774016084,"score_gpt":0.3126294069531486,"score_spread":0.2860741492129878,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404738330","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9002272,0.0028237044,0.01711153,0.00044591038,0.0008381187,0.0004770836,0.00005409151,0.00074571196,0.077276655],"genre_scores_gemma":[0.96411216,0.0000830995,0.033493094,0.00006661163,0.00014172218,0.000014687099,0.0000034115367,0.00006232491,0.0020229071],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99903786,0.000027147837,0.0002732067,0.00022617527,0.0002118679,0.00022371928],"domain_scores_gemma":[0.9990052,0.0005011139,0.000041710835,0.000346837,0.000021995165,0.000083118524],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003333902,0.00019118216,0.00023805969,0.0000897066,0.00015080956,0.00012328467,0.00014975376,0.000088214074,0.00014356116],"category_scores_gemma":[0.00019406134,0.00013293879,0.00009127103,0.00013005243,0.00014984963,0.000104654115,0.00014678085,0.00017350176,0.000023109314],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000018257715,0.000012529057,0.0000249954,0.00083091,0.000062139676,0.000024854897,0.006106775,1.8237024e-7,0.00011454369,0.9887763,0.0024602874,0.0015846465],"study_design_scores_gemma":[0.00008316956,0.000022661428,0.000034807792,0.00021316162,0.0000809658,0.00009033701,0.0005923806,0.0023247858,0.00035117922,0.99232,0.0036936703,0.00019285284],"about_ca_topic_score_codex":0.0000014417006,"about_ca_topic_score_gemma":0.0000019473268,"teacher_disagreement_score":0.07525375,"about_ca_system_score_codex":0.000014109363,"about_ca_system_score_gemma":0.000014289678,"threshold_uncertainty_score":0.54210865},"labels":[],"label_agreement":null},{"id":"W4405209865","doi":"10.1137/23m1609373","title":"Trimming Forests Is Hard (Unless They Are Made of Stars)","year":2024,"lang":"en","type":"article","venue":"SIAM Journal on Discrete Mathematics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"European Research Council; Israel Science Foundation; Schweizerischer Nationalfonds zur Förderung der Wissenschaftlichen Forschung","keywords":"Trimming; Stars; Mathematics; Combinatorics; Computer science; Astrophysics; Physics; Programming language","score_opus":0.041729635786186124,"score_gpt":0.31779594435036507,"score_spread":0.27606630856417896,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405209865","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97452945,0.0011650069,0.012894818,0.00079717,0.0012867547,0.0004129094,0.00014854605,0.00015095594,0.008614399],"genre_scores_gemma":[0.97817695,0.00019114379,0.019282298,0.000118534415,0.00032286873,0.0000070217357,0.000001970403,0.00011858929,0.0017806124],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973293,0.00011154464,0.0009991406,0.00027653956,0.00084447773,0.0004389936],"domain_scores_gemma":[0.9975305,0.0009574508,0.0005804867,0.0006180613,0.00013163355,0.0001818659],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001154726,0.00038289247,0.00070059247,0.00035649186,0.00027890666,0.00021702882,0.00058609963,0.00018175521,0.00034542292],"category_scores_gemma":[0.00045015418,0.00025328711,0.0005523695,0.00023224465,0.00012944968,0.00021447682,0.00014377112,0.00077482313,0.000025589528],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007399247,0.00016061394,0.0002217295,0.002703957,0.0005812842,0.0002080092,0.019023947,0.000030506577,0.00092088414,0.9656306,0.008251612,0.0021928588],"study_design_scores_gemma":[0.00038096317,0.0001727561,0.00026358117,0.0026782453,0.00021650142,0.0003230509,0.0021427018,0.0015523547,0.0031352772,0.98747635,0.0013278396,0.0003303716],"about_ca_topic_score_codex":0.0000011735362,"about_ca_topic_score_gemma":0.000004193823,"teacher_disagreement_score":0.021845752,"about_ca_system_score_codex":0.000078069774,"about_ca_system_score_gemma":0.00006929642,"threshold_uncertainty_score":0.99999195},"labels":[],"label_agreement":null},{"id":"W4405231962","doi":"10.1017/s0963548324000439","title":"Twin-width of sparse random graphs","year":2024,"lang":"en","type":"article","venue":"Combinatorics Probability Computing","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Agence Nationale de la Recherche","keywords":"Combinatorics; Mathematics; Random graph; Vertex (graph theory); Graph; Upper and lower bounds; Integer (computer science); Random regular graph; Discrete mathematics; Chordal graph; 1-planar graph; Computer science","score_opus":0.0403164595525289,"score_gpt":0.2983269296256195,"score_spread":0.25801047007309064,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405231962","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9796696,0.0011442758,0.009621785,0.00007943175,0.0026080713,0.00058054965,0.000007158336,0.00043118847,0.0058579785],"genre_scores_gemma":[0.99346447,0.000011651045,0.0063307863,0.000022201031,0.000065303924,0.000004851037,0.00000235444,0.00003710755,0.000061245504],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978144,0.00024166521,0.00072912243,0.00046734302,0.00038996837,0.0003574975],"domain_scores_gemma":[0.996651,0.0022135365,0.00015853673,0.00068658305,0.00019560574,0.00009473905],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002095912,0.0002562568,0.00052009063,0.00017734444,0.00023281673,0.000060054925,0.0004399438,0.00014325435,0.00003166971],"category_scores_gemma":[0.0011339963,0.00021381125,0.00032505472,0.00076277455,0.00024509136,0.0000964528,0.00038800438,0.0004062051,0.0000037125121],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024908668,0.00014151249,0.0025569296,0.0011947465,0.00008227693,0.000009228606,0.0016413119,0.000031606152,0.00006130908,0.9891951,0.00043206915,0.0046289703],"study_design_scores_gemma":[0.000624543,0.000072566465,0.0004041042,0.000216583,0.0000633141,0.000013149633,0.000038520433,0.004504204,0.0008581694,0.9924625,0.00052074733,0.00022158847],"about_ca_topic_score_codex":0.0000069089765,"about_ca_topic_score_gemma":8.506397e-7,"teacher_disagreement_score":0.013794938,"about_ca_system_score_codex":0.00008145282,"about_ca_system_score_gemma":0.00007277934,"threshold_uncertainty_score":0.871897},"labels":[],"label_agreement":null},{"id":"W4405323689","doi":"10.1002/jgt.23202","title":"On the Pre‐ and Post‐Positional Semi‐Random Graph Processes","year":2024,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Combinatorics; Graph; Random graph; Discrete mathematics","score_opus":0.011973159110112075,"score_gpt":0.2689495744866855,"score_spread":0.2569764153765734,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405323689","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9832784,0.007786995,0.0027226785,0.0011772227,0.0007950807,0.00021255382,0.00003553687,0.00004993257,0.003941636],"genre_scores_gemma":[0.99796164,0.00046931268,0.00034205997,0.00061799504,0.00028593512,0.0000059328086,8.893786e-7,0.000030886324,0.000285349],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99848765,0.00030511554,0.00043510692,0.00015453725,0.00043071192,0.00018690407],"domain_scores_gemma":[0.99364614,0.0056180153,0.00020694986,0.00020035198,0.00024234755,0.00008621558],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020459788,0.00019944782,0.00027553653,0.00034009645,0.00032306998,0.00013308565,0.0003051263,0.00009178154,0.00017586871],"category_scores_gemma":[0.0010131844,0.000100636134,0.00027270787,0.00033320763,0.0003342371,0.00019126506,0.00005413782,0.0005331138,0.0000018499505],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00066376675,0.000054582448,0.00003478311,0.00025562302,0.00036730806,0.000047378526,0.0021258625,0.0000059832696,0.00059435656,0.9914057,0.0034990986,0.0009455054],"study_design_scores_gemma":[0.00039351688,0.00028461136,0.00049733405,0.00051905104,0.00018090759,0.00064023916,0.00036130345,0.000006546784,0.0007509106,0.99573636,0.0004990336,0.00013017206],"about_ca_topic_score_codex":4.7821976e-7,"about_ca_topic_score_gemma":7.7558644e-7,"teacher_disagreement_score":0.0146832755,"about_ca_system_score_codex":0.000013453872,"about_ca_system_score_gemma":0.0000810342,"threshold_uncertainty_score":0.41038224},"labels":[],"label_agreement":null},{"id":"W4405618081","doi":"10.4153/s0008439524000742","title":"A strengthening of McConnel’s theorem on permutations over finite fields","year":2024,"lang":"en","type":"article","venue":"Canadian Mathematical Bulletin","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Prime (order theory); Finite field; Function (biology); Discrete mathematics","score_opus":0.022659835141810282,"score_gpt":0.27872047378774883,"score_spread":0.25606063864593853,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405618081","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.65778595,0.0003226344,0.012964993,0.005739106,0.00065373606,0.000659406,0.000292444,0.00028207345,0.32129964],"genre_scores_gemma":[0.9946464,0.000005143996,0.0022133987,0.00046580427,0.00010715021,0.000020717092,0.0000053575923,0.000043779826,0.0024922984],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987012,0.00007494174,0.000413933,0.00024623284,0.00022655193,0.00033711974],"domain_scores_gemma":[0.99623847,0.0030097077,0.00005152687,0.00039602237,0.000043875803,0.00026039843],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00041019512,0.00019609729,0.00028439015,0.00026525152,0.00015699181,0.00005948301,0.00023889517,0.00016161811,0.022822877],"category_scores_gemma":[0.0015617467,0.00015181264,0.00018469244,0.00017796867,0.00016180675,0.000023610013,0.000036944763,0.00031664106,0.0005695106],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000060711604,0.000019890611,0.000005469785,0.00027865995,0.000059689934,0.000040229068,0.0024875207,0.000018586552,0.0000091498005,0.9843694,0.011727653,0.0009776653],"study_design_scores_gemma":[0.00011337894,0.000056901208,0.000018831905,0.0004269208,0.000053837004,0.000015101833,0.00031202062,0.001680083,0.00014457092,0.98000884,0.01698787,0.00018162893],"about_ca_topic_score_codex":0.00010429408,"about_ca_topic_score_gemma":0.00019358935,"teacher_disagreement_score":0.3368604,"about_ca_system_score_codex":0.000060012026,"about_ca_system_score_gemma":0.00010943243,"threshold_uncertainty_score":0.9780704},"labels":[],"label_agreement":null},{"id":"W4406164268","doi":"10.61091/ars161-05","title":"Extremal Results for \\(K^-_{r+1}\\) -free Unbalanced Signed Graphs","year":2024,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.026522128597922003,"score_gpt":0.2931352409297267,"score_spread":0.2666131123318047,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406164268","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.93681294,0.0015809399,0.0008269064,0.0011075138,0.017317403,0.0015121277,0.00040473143,0.0013796341,0.0390578],"genre_scores_gemma":[0.99430126,0.000019461086,0.003833959,0.00008427612,0.00004992514,0.00007956128,0.000021081105,0.00006519806,0.001545272],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99834335,0.00006979814,0.0004354963,0.00045921767,0.00028294834,0.00040917867],"domain_scores_gemma":[0.9973087,0.0015281964,0.00008142443,0.0008759959,0.0001025552,0.00010312857],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066484173,0.00025657934,0.0003195093,0.00015446128,0.00026091174,0.00010272847,0.0005590683,0.0001750713,0.00003055881],"category_scores_gemma":[0.0010520868,0.0002101671,0.00026481762,0.0003425521,0.0001122186,0.00014128759,0.00017500811,0.00020942856,0.000010266943],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017074164,0.000045606226,0.000022782815,0.0001873806,0.00010282807,0.000018123226,0.00071851996,4.6154534e-7,0.00040918784,0.92535377,0.07209911,0.00087147154],"study_design_scores_gemma":[0.0018958062,0.00017690094,0.00007353796,0.00010631521,0.00007447195,0.0000096387075,0.0000622348,0.00027456426,0.0014559191,0.98776954,0.007820714,0.00028033467],"about_ca_topic_score_codex":0.0000036724305,"about_ca_topic_score_gemma":0.0000033776373,"teacher_disagreement_score":0.064278394,"about_ca_system_score_codex":0.000043092692,"about_ca_system_score_gemma":0.000045451256,"threshold_uncertainty_score":0.85703653},"labels":[],"label_agreement":null},{"id":"W4406171630","doi":"10.61091/um121-09","title":"Radio Number of Cartesian Products of Complete Bipartite Graphs and Odd Cycles","year":2024,"lang":"en","type":"article","venue":"Utilitas Mathematica","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Qinghai Normal University; Natural Science Foundation of Qinghai; National Natural Science Foundation of China","keywords":"Mathematics; Cartesian product; Bipartite graph; Combinatorics; Complete bipartite graph; Discrete mathematics; Graph","score_opus":0.03965243051451393,"score_gpt":0.3146020168826811,"score_spread":0.27494958636816713,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406171630","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98363984,0.0019210139,0.00032445267,0.00018827105,0.00020647701,0.00045127486,0.00012002758,0.00014290806,0.0130057465],"genre_scores_gemma":[0.9752628,0.00004780927,0.024364477,0.0000101299875,0.000027441774,0.000013849913,0.0000032166233,0.000039382972,0.00023084787],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984401,0.0000871435,0.0006284596,0.00030199176,0.00029944666,0.00024285246],"domain_scores_gemma":[0.99822265,0.0008618852,0.00013669045,0.0006131937,0.00009288115,0.00007270032],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005899411,0.00021953507,0.0005551564,0.00014088074,0.000075614174,0.000023241197,0.00020498964,0.00008360636,0.00025700405],"category_scores_gemma":[0.00043336613,0.00016255376,0.00014692062,0.0003221163,0.00050916005,0.000096739685,0.000119841076,0.00013518141,0.000009486942],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013919827,0.00007385673,0.0003401094,0.005118852,0.00018212704,0.000005858028,0.005758372,1.4019595e-7,0.0016297431,0.98451346,0.0015450729,0.0008184603],"study_design_scores_gemma":[0.00014804986,0.000043331995,0.00058272446,0.00054548174,0.0001694583,0.000076637916,0.00038082383,0.00040386853,0.003960029,0.9928104,0.0007190213,0.00016012756],"about_ca_topic_score_codex":0.0000060808056,"about_ca_topic_score_gemma":0.0000017265808,"teacher_disagreement_score":0.024040025,"about_ca_system_score_codex":0.000009144965,"about_ca_system_score_gemma":0.000027518427,"threshold_uncertainty_score":0.662875},"labels":[],"label_agreement":null},{"id":"W4406462949","doi":"10.1007/s40687-025-00495-w","title":"Fifty years of the Erdős similarity conjecture","year":2025,"lang":"en","type":"article","venue":"Research in the Mathematical Sciences","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Conjecture; Mathematics; Similarity (geometry); Combinatorics; Computer science; Artificial intelligence; Image (mathematics)","score_opus":0.2068880674583049,"score_gpt":0.48740410235063203,"score_spread":0.2805160348923271,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406462949","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8995452,0.0001459967,0.00024590536,0.0065730065,0.00014009936,0.000681439,0.000006068091,0.000016281976,0.09264604],"genre_scores_gemma":[0.99813527,0.000010980126,0.0014022737,0.00015091161,0.000023455428,0.000019418383,6.460326e-8,0.0000035274359,0.00025411218],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99688494,0.0009929342,0.0003125134,0.00021032713,0.0011877551,0.0004115561],"domain_scores_gemma":[0.99132204,0.007922466,0.000056583078,0.00060580275,0.00006235579,0.000030759435],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010668991,0.000087827786,0.00020916939,0.00014725332,0.00052329875,0.00007290883,0.0020643147,0.00008845976,0.000102392325],"category_scores_gemma":[0.0047007897,0.000038479357,0.00010703807,0.0018166893,0.0026689887,0.000053590833,0.00058177195,0.00057530607,0.0000036687559],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000049912,0.00007726566,0.00045446213,0.00013892782,0.000007369915,0.0000015117063,0.0019510571,0.0000048052325,0.00004073677,0.9949326,0.0013079469,0.0010783136],"study_design_scores_gemma":[0.00009538507,0.000030880892,0.0028505719,0.00017229095,0.0000055667715,0.0000033887766,0.0011443847,0.00031405527,0.00050100964,0.99430335,0.00053390994,0.000045214925],"about_ca_topic_score_codex":0.00001865455,"about_ca_topic_score_gemma":0.000021181817,"teacher_disagreement_score":0.09859009,"about_ca_system_score_codex":0.00002826855,"about_ca_system_score_gemma":0.00012649674,"threshold_uncertainty_score":0.9834},"labels":[],"label_agreement":null},{"id":"W4408337137","doi":"10.1002/rsa.21270","title":"Perfect Matchings and Loose Hamilton Cycles in the Semirandom Hypergraph Model","year":2025,"lang":"en","type":"article","venue":"Random Structures and Algorithms","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University; University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Hypergraph; Combinatorics; Mathematics; Computer science","score_opus":0.015197328818766329,"score_gpt":0.29336122787991226,"score_spread":0.2781638990611459,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408337137","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9889355,0.004380927,0.0035174356,0.0003147037,0.00020186396,0.0005824541,0.00002637399,0.000051765222,0.0019890168],"genre_scores_gemma":[0.99252725,0.001067326,0.005486758,0.000622081,0.00007478268,0.0000315112,0.0000038622125,0.000020482354,0.00016596739],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985012,0.00021016414,0.000361943,0.00038156693,0.00022884409,0.00031630878],"domain_scores_gemma":[0.99843866,0.0010515746,0.000084691725,0.00034237487,0.000028810457,0.00005389197],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007617205,0.000311739,0.0005233046,0.00019375875,0.0004879619,0.0001388585,0.000271453,0.0001580435,0.000008657834],"category_scores_gemma":[0.0001359421,0.00017826214,0.0001286019,0.00021325833,0.00026717005,0.00010171848,0.00011194754,0.00038356846,1.0841091e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001286784,0.000068473346,0.0026681155,0.0005129487,0.00024654402,0.00003593432,0.01661651,0.0002876321,0.0007566643,0.9034089,0.0012841793,0.07282732],"study_design_scores_gemma":[0.00704455,0.0000259022,0.003106186,0.0000742959,0.00009854283,0.000057577126,0.0004273025,0.013588475,0.00018268503,0.9749137,0.00025501,0.00022574262],"about_ca_topic_score_codex":0.000040255843,"about_ca_topic_score_gemma":0.000028340708,"teacher_disagreement_score":0.07260158,"about_ca_system_score_codex":0.000010513584,"about_ca_system_score_gemma":0.000017808512,"threshold_uncertainty_score":0.7269319},"labels":[],"label_agreement":null},{"id":"W4408621066","doi":"10.4064/aa231123-9-1","title":"Additively stable sets, critical sets for the $3k-4$ theorem in $\\mathbb Z$ and $\\mathbb R$","year":2025,"lang":"en","type":"article","venue":"Acta Arithmetica","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Pacific Institute for the Mathematical Sciences","funders":"","keywords":"Mathematics; Discrete mathematics; Combinatorics; Pure mathematics","score_opus":0.028609370168539098,"score_gpt":0.34321756149243976,"score_spread":0.31460819132390067,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408621066","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6806546,0.007914908,0.047283825,0.06199914,0.0047569675,0.009140866,0.002973963,0.0009509463,0.18432482],"genre_scores_gemma":[0.98018265,0.00012490833,0.017917791,0.0009961766,0.000054405922,0.00015651263,0.000007495123,0.000035587527,0.00052445463],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983308,0.00015599755,0.0003954431,0.00039243454,0.00021187852,0.00051349646],"domain_scores_gemma":[0.98957926,0.009635775,0.00006025351,0.0005307577,0.000114842325,0.00007911791],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010323644,0.00025861952,0.00038502723,0.00015239244,0.00047311193,0.00012266052,0.00040226625,0.00017812828,0.00016091026],"category_scores_gemma":[0.0037078317,0.00017099013,0.00011288878,0.00026638154,0.00054515427,0.00012490505,0.0003050002,0.00034509337,0.0000021441203],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000803925,0.00008407025,0.00011922951,0.00017679913,0.000077523066,0.000006258211,0.0008839984,3.5206318e-7,0.000061070976,0.97975457,0.010084512,0.008671232],"study_design_scores_gemma":[0.00064337224,0.000059342132,0.0023977149,0.00012634038,0.00013411342,0.000016191338,0.0007790213,0.0017389097,0.00047289737,0.9704513,0.022967704,0.00021310433],"about_ca_topic_score_codex":0.000013045724,"about_ca_topic_score_gemma":0.00002705047,"teacher_disagreement_score":0.2995281,"about_ca_system_score_codex":0.000037896563,"about_ca_system_score_gemma":0.00006860045,"threshold_uncertainty_score":0.6972775},"labels":[],"label_agreement":null},{"id":"W4408816213","doi":"10.1016/j.ffa.2025.102624","title":"BRK-type sets over finite fields","year":2025,"lang":"en","type":"article","venue":"Finite Fields and Their Applications","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Finite field; Type (biology); Pure mathematics; Algebra over a field; Discrete mathematics","score_opus":0.021138292663252414,"score_gpt":0.2993024278510898,"score_spread":0.2781641351878374,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408816213","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21638694,0.0021501558,0.52792895,0.0043492797,0.0010429719,0.0018407584,0.00029811478,0.00050844636,0.24549438],"genre_scores_gemma":[0.9934421,0.00018055049,0.0014135401,0.001525495,0.00009030581,0.00010367061,0.000022078497,0.000013079526,0.0032091504],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992527,0.00003127855,0.00022821236,0.00024224442,0.00006414772,0.00018141181],"domain_scores_gemma":[0.9980488,0.0012445204,0.000063085456,0.0005288175,0.00006156734,0.000053249103],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013099232,0.00016032193,0.0001915366,0.00009491012,0.00037047247,0.000043370605,0.0002157002,0.00022456782,0.00025074728],"category_scores_gemma":[0.000120002245,0.00012133468,0.00007760903,0.00028003627,0.00008141321,0.00004535691,0.00015751038,0.00026460952,0.0000082727365],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016238559,0.000050855157,0.0005738971,0.000079981946,0.00007509928,5.758819e-7,0.0010068616,0.0000108515615,0.000021601105,0.97605383,0.008228924,0.013881286],"study_design_scores_gemma":[0.00019750702,0.000028065118,0.00079361454,0.000028362,0.00002851804,0.0000015425711,0.0001071471,0.0006569677,0.00015577249,0.8949899,0.10287396,0.00013861337],"about_ca_topic_score_codex":0.00001262051,"about_ca_topic_score_gemma":0.000025379111,"teacher_disagreement_score":0.7770552,"about_ca_system_score_codex":0.0000067073056,"about_ca_system_score_gemma":0.000024505862,"threshold_uncertainty_score":0.49478844},"labels":[],"label_agreement":null},{"id":"W4408986240","doi":"10.1007/s00493-025-00147-1","title":"Induced Subgraphs of $$K_r$$-Free Graphs and the Erdős–Rogers Problem","year":2025,"lang":"lv","type":"article","venue":"COMBINATORICA","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Mathematics; Combinatorics; Discrete mathematics","score_opus":0.011869118175728008,"score_gpt":0.2551920491449339,"score_spread":0.24332293096920588,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408986240","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9041603,0.011976196,0.000077353034,0.0027660916,0.0029811766,0.002098972,0.000047290898,0.00015529754,0.0757373],"genre_scores_gemma":[0.9971384,0.0010080287,0.0004607383,0.00029019563,0.000018377548,0.000058545917,0.000001963606,0.00004404941,0.0009797039],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9969077,0.00057961803,0.0009493952,0.0005294578,0.00049104023,0.0005427556],"domain_scores_gemma":[0.9951754,0.0019670248,0.0005275079,0.0019005568,0.00029924806,0.00013024191],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014301352,0.00049201795,0.0010194522,0.00040542247,0.0006959332,0.0000891596,0.0014042554,0.00040670697,0.000043473883],"category_scores_gemma":[0.0009340817,0.00033291025,0.00044293728,0.0015476084,0.0013822238,0.000102785205,0.0011526146,0.00072999805,0.000002108766],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000266835,0.00022323076,0.0023456798,0.0009187347,0.0006345569,0.000005417296,0.0032394843,2.736722e-7,0.00011983421,0.9825838,0.0075886906,0.0020734644],"study_design_scores_gemma":[0.005679238,0.00015290643,0.0016556621,0.00033394495,0.0005722373,0.0000070791525,0.0006621997,0.000051784053,0.0011947475,0.98769814,0.001675017,0.00031705797],"about_ca_topic_score_codex":0.00008814402,"about_ca_topic_score_gemma":0.0000071229583,"teacher_disagreement_score":0.092978075,"about_ca_system_score_codex":0.00005077419,"about_ca_system_score_gemma":0.00014046012,"threshold_uncertainty_score":0.9999123},"labels":[],"label_agreement":null},{"id":"W4409202377","doi":"10.1016/j.ejc.2025.104159","title":"Thresholds for constrained Ramsey and anti-Ramsey problems","year":2025,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"H2020 European Research Council; Natural Sciences and Engineering Research Council of Canada; Pacific Institute for the Mathematical Sciences; Royal Society; Alexander von Humboldt-Stiftung","keywords":"Ramsey's theorem; Mathematics; Ramsey theory; Combinatorics; Graph","score_opus":0.026686812007090926,"score_gpt":0.2846851732435496,"score_spread":0.25799836123645864,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409202377","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.91471654,0.0017530738,0.034680713,0.00075686036,0.0029067614,0.0005075311,0.000013163052,0.000059046914,0.044606283],"genre_scores_gemma":[0.996031,0.00013607321,0.003034496,0.0001594436,0.00009167987,9.4199214e-7,6.326411e-7,0.000030335723,0.00051539764],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986441,0.00021747431,0.0006088004,0.00013066226,0.00019229861,0.00020662589],"domain_scores_gemma":[0.9984609,0.0004910906,0.00040575425,0.00021478186,0.0003311747,0.00009629114],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018317777,0.00016914755,0.00037092646,0.0001773876,0.00022146336,0.000075339805,0.0003381919,0.0000456863,0.00000787591],"category_scores_gemma":[0.00063376414,0.00012990067,0.00014536947,0.00019007923,0.00015716552,0.00009894679,0.000114985436,0.00029882748,4.8201036e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000043605363,0.000086595755,0.0018014426,0.00021408996,0.00013870788,0.000037635233,0.00048649166,0.0000054291095,0.00020050825,0.98863906,0.0057978486,0.0025485887],"study_design_scores_gemma":[0.0026423146,0.00032429164,0.0016803581,0.0002438161,0.00012712681,0.00012729387,0.00015489565,0.000042632793,0.00024698523,0.97222733,0.022017045,0.0001659009],"about_ca_topic_score_codex":1.1707382e-7,"about_ca_topic_score_gemma":9.164957e-8,"teacher_disagreement_score":0.08131443,"about_ca_system_score_codex":0.000021862541,"about_ca_system_score_gemma":0.00005439726,"threshold_uncertainty_score":0.52971953},"labels":[],"label_agreement":null},{"id":"W4409900362","doi":"10.1017/s0305004125000155","title":"Hypergraph removal with polynomial bounds","year":2025,"lang":"en","type":"article","venue":"Mathematical Proceedings of the Cambridge Philosophical Society","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Hypergraph; Mathematics; Combinatorics; Polynomial; Mathematical analysis","score_opus":0.016399080420872365,"score_gpt":0.26078652957520587,"score_spread":0.2443874491543335,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409900362","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.85386753,0.00007559266,0.00052388955,0.012304363,0.00020534758,0.000645099,0.000016444403,0.00016750488,0.13219425],"genre_scores_gemma":[0.9807704,0.00000803503,0.01667683,0.000952554,0.00023782939,0.00003225811,5.720414e-7,0.000044881737,0.0012766027],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99773085,0.000020491592,0.0006655778,0.00043865436,0.0006824348,0.00046201595],"domain_scores_gemma":[0.9984441,0.00047035428,0.00028900395,0.00040561368,0.00026742864,0.00012354042],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007194568,0.00037520757,0.0006783977,0.000057408273,0.0005697561,0.000070266164,0.0009862442,0.0003052688,0.00002515567],"category_scores_gemma":[0.00057813426,0.0002100155,0.00076134485,0.00074601104,0.00130754,0.00013291328,0.00062564283,0.0006727982,0.0000023904888],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011044019,0.00020083073,0.0004709618,0.0008114166,0.00026299214,8.592751e-7,0.00026733818,2.9182422e-7,0.001529705,0.9811418,0.015097801,0.00010553082],"study_design_scores_gemma":[0.00077368185,0.00007617152,0.000390879,0.00037705808,0.00027629966,0.00006880636,0.00016905968,0.00025117127,0.0035932844,0.99255633,0.001205041,0.00026221143],"about_ca_topic_score_codex":0.0000018020598,"about_ca_topic_score_gemma":1.09192804e-7,"teacher_disagreement_score":0.13091764,"about_ca_system_score_codex":0.00007936204,"about_ca_system_score_gemma":0.000057761044,"threshold_uncertainty_score":0.8564183},"labels":[],"label_agreement":null},{"id":"W4410412108","doi":"10.2140/om.2025.2.65","title":"Inverse theorems for discretized sums and Lqnorms of convolutions in ℝd","year":2025,"lang":"en","type":"article","venue":"Orbita Mathematicae","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Inverse; Discretization; Mathematics; Pure mathematics; Applied mathematics; Discrete mathematics; Mathematical analysis; Geometry","score_opus":0.02567789488769509,"score_gpt":0.34060965632328316,"score_spread":0.3149317614355881,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410412108","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9456641,0.00021303535,0.019813143,0.00044304773,0.00020827538,0.0012274307,0.00006207592,0.00006702263,0.032301843],"genre_scores_gemma":[0.96520936,0.000027961449,0.0330706,0.000065101536,0.000016109401,0.00010021151,0.000004400379,0.000021570233,0.0014846714],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989139,0.000053211174,0.00048866554,0.00020334788,0.000115695264,0.00022519002],"domain_scores_gemma":[0.9979014,0.0014355131,0.00013314007,0.0004244935,0.00006230206,0.000043186876],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066795456,0.00016330626,0.00045145958,0.00019562634,0.00010699079,0.00001761208,0.00020705824,0.00010853435,0.00006086262],"category_scores_gemma":[0.0011746181,0.00011773187,0.000111281544,0.00022979428,0.00034727168,0.00008029177,0.00013685774,0.000107872525,0.0000012127277],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004757254,0.000093154384,0.000605478,0.0008296614,0.00005569794,8.057022e-7,0.0016924846,4.4850074e-7,0.00044708626,0.9949525,0.0010648908,0.00021020326],"study_design_scores_gemma":[0.0010266723,0.000032625107,0.00049912324,0.00028602278,0.000072231516,0.0000037816785,0.0009873399,0.0009971255,0.0008247518,0.99492806,0.00021727476,0.00012500542],"about_ca_topic_score_codex":0.0000074944396,"about_ca_topic_score_gemma":0.000038287322,"teacher_disagreement_score":0.030817172,"about_ca_system_score_codex":0.000022432123,"about_ca_system_score_gemma":0.000032961027,"threshold_uncertainty_score":0.48009664},"labels":[],"label_agreement":null},{"id":"W4410796551","doi":"10.1007/s10255-025-0013-x","title":"The Linear Turán Numbers of Acyclic Linear 4-graphs","year":2025,"lang":"en","type":"article","venue":"Acta Mathematicae Applicatae Sinica English Series","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Artificial Intelligence in Medicine (Canada)","funders":"","keywords":"Mathematics; Combinatorics; Discrete mathematics","score_opus":0.015754720214053594,"score_gpt":0.30543502592415067,"score_spread":0.28968030571009706,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410796551","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8400269,0.0010382091,0.0028502524,0.0029851513,0.0016567586,0.0033688366,0.00019863565,0.00122467,0.1466506],"genre_scores_gemma":[0.96767825,0.000539659,0.028682936,0.0002208138,0.00022529285,0.00028821107,0.00001572817,0.000094433424,0.0022547028],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9969423,0.00015612588,0.0013088803,0.0005329652,0.00047804805,0.00058172306],"domain_scores_gemma":[0.9919608,0.004557786,0.00053152716,0.0024566036,0.00037060218,0.00012268513],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012564464,0.00046660157,0.0008522148,0.00013592775,0.00073463464,0.000081280145,0.0016706886,0.000292207,0.000074863514],"category_scores_gemma":[0.003242331,0.00030907206,0.00042692653,0.0007891872,0.001290262,0.00027593115,0.0007091463,0.0005295261,0.000010757597],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000121572986,0.00017443579,0.00007686317,0.0005243489,0.00032577387,0.0000014026339,0.00341516,7.1879714e-7,0.00051735237,0.98592216,0.0077019236,0.0012182745],"study_design_scores_gemma":[0.000444195,0.000057451987,0.00007839782,0.00016705773,0.00019050107,0.000007641796,0.0023817336,0.000039439004,0.006828757,0.8730951,0.11640466,0.00030507904],"about_ca_topic_score_codex":0.0000061204764,"about_ca_topic_score_gemma":0.000016619791,"teacher_disagreement_score":0.14439589,"about_ca_system_score_codex":0.000028244014,"about_ca_system_score_gemma":0.00008542123,"threshold_uncertainty_score":0.99993616},"labels":[],"label_agreement":null},{"id":"W4410902982","doi":"10.1017/s0963548325000057","title":"Tight Hamilton cycles with high discrepancy","year":2025,"lang":"en","type":"article","venue":"Combinatorics Probability Computing","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Schweizerischer Nationalfonds zur Förderung der Wissenschaftlichen Forschung; University College London; Universität Passau","keywords":"Hypergraph; Combinatorics; Mathematics; Omega; Degree (music); Vertex (graph theory); Discrete mathematics; Probabilistic logic; Hamiltonian path; Probabilistic method; Graph; Physics","score_opus":0.019131648080465344,"score_gpt":0.28234206316745997,"score_spread":0.2632104150869946,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410902982","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9736651,0.0001525592,0.012192963,0.00019395373,0.00090227055,0.0005437861,0.0000031068723,0.000364011,0.011982231],"genre_scores_gemma":[0.98283947,0.0000046083906,0.016677884,0.00007949186,0.000046916804,0.000009770212,0.0000037875257,0.000025678468,0.00031239647],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99807376,0.00018833399,0.000479618,0.0005402623,0.00030269814,0.00041532537],"domain_scores_gemma":[0.997733,0.0008760549,0.00018145179,0.0009088545,0.00022257502,0.00007806861],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007574671,0.00029115856,0.000441309,0.000120154255,0.000674528,0.00007168836,0.0004999991,0.00013680838,0.000012071841],"category_scores_gemma":[0.00042229542,0.00021926842,0.00010964333,0.00064435415,0.00023376115,0.00009282102,0.00037562932,0.00038252593,0.000001842191],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002802742,0.000202446,0.020421803,0.00036125537,0.00006572408,0.0000047594713,0.00069258065,0.000023055962,0.000009937006,0.9762611,0.00020253194,0.0017267752],"study_design_scores_gemma":[0.00063888956,0.00007699424,0.010711261,0.00019115192,0.000054030097,0.0000046572195,0.00005530823,0.0005139838,0.00068877195,0.98629624,0.0005083882,0.00026033053],"about_ca_topic_score_codex":0.000019240444,"about_ca_topic_score_gemma":0.0000076095503,"teacher_disagreement_score":0.011669835,"about_ca_system_score_codex":0.00016090815,"about_ca_system_score_gemma":0.00007525771,"threshold_uncertainty_score":0.8941506},"labels":[],"label_agreement":null},{"id":"W4411244456","doi":"10.1016/j.jcta.2025.106080","title":"Avoiding short progressions in Euclidean Ramsey theory","year":2025,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Mathematics; Euclidean geometry; Ramsey theory; Combinatorics; Mathematics education; Discrete mathematics; Geometry","score_opus":0.01897258231165641,"score_gpt":0.3221627856217802,"score_spread":0.3031902033101238,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411244456","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96308243,0.0012022449,0.0014029414,0.00029045035,0.011510691,0.0003785001,0.000004476746,0.00005911368,0.022069132],"genre_scores_gemma":[0.9974463,0.000107336615,0.0011132319,0.0000929344,0.0004411256,0.000007725554,5.2887674e-7,0.000029846591,0.0007609593],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9964087,0.0016889626,0.0010088626,0.00017758334,0.0003703489,0.00034551392],"domain_scores_gemma":[0.99601126,0.0029015527,0.00037348873,0.00036147176,0.00024762453,0.000104604806],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0076943655,0.00025770598,0.0006488082,0.00044464588,0.00046347422,0.00007788981,0.0006325813,0.00020907001,0.0001241377],"category_scores_gemma":[0.0040804483,0.0001889123,0.000292859,0.00048392193,0.0002831317,0.00038314235,0.0002441694,0.0011496239,7.505176e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0019766022,0.0001866448,0.0007761546,0.000069412716,0.00016937655,0.00009324406,0.00196081,0.0000036056774,0.00026864774,0.9887892,0.00067399663,0.0050323023],"study_design_scores_gemma":[0.0011043773,0.00021384866,0.00026797864,0.000586066,0.000094645155,0.00009708182,0.0028467316,0.0000021168019,0.0026438364,0.9876605,0.0043004155,0.0001823702],"about_ca_topic_score_codex":4.864343e-7,"about_ca_topic_score_gemma":0.0000010389451,"teacher_disagreement_score":0.034363862,"about_ca_system_score_codex":0.00010513334,"about_ca_system_score_gemma":0.00016610912,"threshold_uncertainty_score":0.77036196},"labels":[],"label_agreement":null},{"id":"W4411662065","doi":"10.1017/s0305004125000209","title":"On off-diagonal Ramsey numbers for vector spaces over $\\mathbb{F}_{2}$","year":2025,"lang":"en","type":"article","venue":"Mathematical Proceedings of the Cambridge Philosophical Society","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Diagonal; Mathematics; Ramsey's theorem; Combinatorics; Ramsey theory; Geometry","score_opus":0.02310425667331443,"score_gpt":0.2977158908236536,"score_spread":0.2746116341503391,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411662065","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.926443,0.00009141557,0.0009335463,0.022319697,0.00056781195,0.0018377433,0.00011669422,0.00022198734,0.04746815],"genre_scores_gemma":[0.9895199,0.000010803467,0.007016465,0.001896177,0.0003250717,0.00013236945,0.0000018747431,0.00006155064,0.0010357886],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974474,0.000022124757,0.0007636396,0.0005215976,0.000713593,0.0005316496],"domain_scores_gemma":[0.9966375,0.0021849293,0.00036911282,0.00038471425,0.00028197633,0.00014173683],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00096116046,0.00043981936,0.0007831129,0.000053978445,0.00052712095,0.00008732467,0.00097035256,0.00040166575,0.000058124824],"category_scores_gemma":[0.0025060687,0.00027797944,0.0012913679,0.00043478765,0.0007655371,0.000117912336,0.0005008054,0.0006147463,0.000004722324],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014405746,0.00031505188,0.00009259701,0.0016414024,0.00027044056,1.62038e-7,0.00033536612,0.000001193175,0.000814801,0.94861454,0.04767474,0.000095626754],"study_design_scores_gemma":[0.0009960114,0.00010434292,0.00039980558,0.00052724854,0.00023246714,0.000005005136,0.00012503321,0.0014219424,0.002908523,0.99225277,0.0007367637,0.00029008146],"about_ca_topic_score_codex":0.000001086332,"about_ca_topic_score_gemma":8.485765e-8,"teacher_disagreement_score":0.06307694,"about_ca_system_score_codex":0.0001238521,"about_ca_system_score_gemma":0.00004870604,"threshold_uncertainty_score":0.9999672},"labels":[],"label_agreement":null},{"id":"W4411837996","doi":"10.1017/s0963548325000094","title":"Common pairs of graphs","year":2025,"lang":"en","type":"article","venue":"Combinatorics Probability Computing","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Combinatorics; Mathematics; Computer science","score_opus":0.028797372974541352,"score_gpt":0.3041248824459258,"score_spread":0.2753275094713844,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411837996","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97765005,0.00019422032,0.0034315437,0.00008537446,0.0010342537,0.00039823086,0.000002542581,0.00016905034,0.01703475],"genre_scores_gemma":[0.9955132,0.000003505231,0.0043418575,0.00004885517,0.000011487499,0.000003429483,0.000001454497,0.000013022085,0.000063183645],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99828905,0.00023421168,0.0006535238,0.0003132767,0.00023398611,0.00027597402],"domain_scores_gemma":[0.99734604,0.0013693548,0.0002368298,0.00076514244,0.00023262514,0.000049990547],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013470369,0.00019019256,0.0004703221,0.00015917214,0.0003206698,0.000017778211,0.0005025906,0.00013336333,0.000008981004],"category_scores_gemma":[0.00092168804,0.00017307929,0.00019728298,0.0007673593,0.00024170017,0.000046614172,0.00053086056,0.00029810486,4.738913e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001188407,0.00021072025,0.061483994,0.0005703468,0.000046650854,8.8369455e-7,0.00043371366,0.000016485452,0.000029447066,0.9337498,0.0003244939,0.003121558],"study_design_scores_gemma":[0.00039219373,0.00004824817,0.0070760367,0.00012141468,0.000035725974,0.0000014006228,0.000068047724,0.0007693741,0.0010589636,0.9901327,0.00015268677,0.00014320659],"about_ca_topic_score_codex":0.000009926342,"about_ca_topic_score_gemma":0.00000238479,"teacher_disagreement_score":0.05638288,"about_ca_system_score_codex":0.000076695964,"about_ca_system_score_gemma":0.000052612293,"threshold_uncertainty_score":0.70579684},"labels":[],"label_agreement":null},{"id":"W4412085399","doi":"10.1112/blms.70141","title":"Gaps between cubes with perfect power sum","year":2025,"lang":"en","type":"article","venue":"Bulletin of the London Mathematical Society","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Mathematics; Power (physics); Thermodynamics","score_opus":0.01190254559825198,"score_gpt":0.26205361900775165,"score_spread":0.25015107340949966,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412085399","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.91672933,0.00027110567,0.005527161,0.006540546,0.00019797348,0.00086186384,0.000027574153,0.0001522404,0.0696922],"genre_scores_gemma":[0.9628029,0.000015560445,0.028208252,0.0005558912,0.000060495335,0.000025686142,0.0000010585459,0.000040863262,0.008289279],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99828684,0.000154476,0.0004820761,0.00027490186,0.00045718526,0.00034451525],"domain_scores_gemma":[0.9969802,0.0018248194,0.0001944047,0.0008353727,0.0001027119,0.000062497944],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0008237469,0.0002703974,0.0005707109,0.000024890736,0.00034640305,0.000031243944,0.0007136651,0.00019343368,0.0010072826],"category_scores_gemma":[0.0005480393,0.00014226386,0.0005976302,0.00023714908,0.000595219,0.0000152021275,0.0004450656,0.00038433046,0.000018091401],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000040886676,0.00017141594,0.0040034195,0.0010119402,0.0004667843,8.1744764e-7,0.0013701789,0.0000029586731,0.00012405998,0.9002699,0.092332445,0.00020518794],"study_design_scores_gemma":[0.00077382446,0.00008067563,0.002583518,0.0005573108,0.00031602543,0.000007100175,0.0004631894,0.000028659906,0.0034257935,0.9652704,0.02624417,0.0002493068],"about_ca_topic_score_codex":0.000005474335,"about_ca_topic_score_gemma":4.9857573e-7,"teacher_disagreement_score":0.066088274,"about_ca_system_score_codex":0.000039775743,"about_ca_system_score_gemma":0.000036750956,"threshold_uncertainty_score":0.99990594},"labels":[],"label_agreement":null},{"id":"W4412418952","doi":"10.1016/j.aim.2025.110424","title":"Equidistribution of polynomial sequences in function fields, with applications","year":2025,"lang":"en","type":"article","venue":"Advances in Mathematics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Simons Foundation; National Science Foundation","keywords":"Mathematics; Polynomial; Function field; Function (biology); Pure mathematics; Field (mathematics); Mathematical analysis","score_opus":0.011633780859703126,"score_gpt":0.30533917119637494,"score_spread":0.2937053903366718,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412418952","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2817266,0.0021982593,0.68075037,0.00013769782,0.000354234,0.0011316192,0.000028030126,0.00007446823,0.033598743],"genre_scores_gemma":[0.9670214,0.00018015192,0.032511387,0.000021731365,0.00001930073,0.00009436056,0.0000047387443,0.0000068456234,0.00014005983],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991407,0.000030544725,0.00041166536,0.0001454264,0.00012825134,0.00014344463],"domain_scores_gemma":[0.99906063,0.00045042206,0.00016167802,0.00026881334,0.0000449606,0.0000135242235],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000279581,0.000108600456,0.00024107618,0.0001580164,0.00005117998,0.0000070828014,0.00017011419,0.000078919526,0.00001869393],"category_scores_gemma":[0.0001254076,0.000083935185,0.000032358606,0.00046896553,0.00012710968,0.00015228125,0.000045394278,0.00013360656,5.5823756e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000047640508,0.00013077525,0.0025694657,0.0005680278,0.000012754505,9.876693e-7,0.00060736935,0.00031796677,0.00006811213,0.9905058,0.000044547352,0.0051265224],"study_design_scores_gemma":[0.00034947228,0.000044050917,0.00036110985,0.0002517002,0.000021889718,0.000002033837,0.00076626136,0.0003643187,0.00091068796,0.9956685,0.0011697336,0.00009027677],"about_ca_topic_score_codex":0.0000059064787,"about_ca_topic_score_gemma":0.00014525856,"teacher_disagreement_score":0.6852948,"about_ca_system_score_codex":0.00004404755,"about_ca_system_score_gemma":0.00003082397,"threshold_uncertainty_score":0.34227777},"labels":[],"label_agreement":null},{"id":"W4412597347","doi":"10.1007/s00493-025-00167-x","title":"An Approximate Counting Version of the Multidimensional Szemerédi Theorem","year":2025,"lang":"en","type":"article","venue":"COMBINATORICA","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Mathematics; Combinatorics; Discrete mathematics","score_opus":0.011591249925362566,"score_gpt":0.27813665399151827,"score_spread":0.2665454040661557,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412597347","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9785675,0.0001310487,0.00055729004,0.0001229724,0.0013218884,0.00022982205,0.0000068966756,0.00006441079,0.018998172],"genre_scores_gemma":[0.9982033,0.000005797528,0.0013565922,0.00009722237,0.000014356382,0.000004401407,0.0000014107645,0.000011246661,0.0003056702],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990855,0.0001343469,0.00022503658,0.00016633517,0.00023284576,0.00015595996],"domain_scores_gemma":[0.9988025,0.00033758878,0.00013149875,0.00058184814,0.000119530516,0.000027072663],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042732776,0.000114185816,0.00018158343,0.00005662093,0.00036419294,0.000009068265,0.0003931045,0.0000778053,0.00003802121],"category_scores_gemma":[0.00024615024,0.00007143235,0.00010096309,0.0002862064,0.0001439005,0.000055476357,0.00024403169,0.00015615553,0.000001132574],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002226513,0.00011298208,0.00276383,0.0000675934,0.00002627967,4.7721284e-7,0.0002827845,0.0000030338551,0.0014604856,0.99313545,0.0016687305,0.00045607373],"study_design_scores_gemma":[0.00046561216,0.000026281376,0.0028331485,0.00007101063,0.000039701194,0.0000011791841,0.00014072873,0.0007986438,0.011141273,0.98227715,0.002118347,0.00008689164],"about_ca_topic_score_codex":0.0000057344905,"about_ca_topic_score_gemma":3.355286e-7,"teacher_disagreement_score":0.019635802,"about_ca_system_score_codex":0.000033249897,"about_ca_system_score_gemma":0.000033525936,"threshold_uncertainty_score":0.29129267},"labels":[],"label_agreement":null},{"id":"W4412647336","doi":"10.55016/ojs/cdm.v3i1.61964","title":"A survey on semiovals","year":2008,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.05444497815643056,"score_gpt":0.34578845631010996,"score_spread":0.2913434781536794,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412647336","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.873803,0.00015238853,0.1032322,0.0008254435,0.0005926349,0.0015582395,0.0023756295,0.0005296077,0.016930858],"genre_scores_gemma":[0.98773617,0.000017653925,0.009907688,0.0003489792,0.00013070482,0.000063113555,0.000040258146,0.00005050811,0.0017049189],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997989,0.00018836038,0.0005708189,0.00032131188,0.00043551272,0.00049502676],"domain_scores_gemma":[0.9966722,0.0015772338,0.00016153233,0.00097478775,0.00035533932,0.0002589069],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010558269,0.0003021289,0.0005377054,0.0001762112,0.0008272099,0.000034108605,0.0004331105,0.00014654639,0.00014781162],"category_scores_gemma":[0.0074581364,0.00023435891,0.00020672062,0.0004704813,0.00016256158,0.00006484414,0.00019414056,0.0002464938,0.00019425475],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000052859465,0.00019361716,0.0003833738,0.00004441161,0.00010616819,0.000021868787,0.001658639,0.000016350643,0.00010261035,0.9592215,0.03804176,0.00015688177],"study_design_scores_gemma":[0.0009229916,0.0003372568,0.010737949,0.00021867813,0.000089908186,0.00008705304,0.00013524453,0.00042945376,0.0021918255,0.9798409,0.0042884415,0.00072032685],"about_ca_topic_score_codex":0.000011310997,"about_ca_topic_score_gemma":0.000015271784,"teacher_disagreement_score":0.113933176,"about_ca_system_score_codex":0.00010810766,"about_ca_system_score_gemma":0.00005814981,"threshold_uncertainty_score":0.95568794},"labels":[],"label_agreement":null},{"id":"W4412648039","doi":"10.55016/ojs/cdm.v1i1.61900","title":"Szemer'edi's regularity lemma revisited","year":2006,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Lemma (botany); Combinatorics; Mathematics; Genealogy; Biology; History; Botany","score_opus":0.016080342111403027,"score_gpt":0.3121497507281633,"score_spread":0.2960694086167603,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412648039","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25866398,0.0005860499,0.6673056,0.0037096376,0.00076701,0.0031214005,0.0023404295,0.0012815365,0.062224373],"genre_scores_gemma":[0.92415994,0.000012579627,0.071656965,0.00024711812,0.00060155697,0.0001063698,0.00013271204,0.000079864534,0.0030029006],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973879,0.00012458724,0.0008715465,0.00040762813,0.00048772656,0.0007206393],"domain_scores_gemma":[0.997257,0.000611016,0.00026755978,0.0011915605,0.0004651953,0.00020764837],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010274025,0.0003779211,0.00062940223,0.00020845218,0.0008283322,0.00012706438,0.00052535173,0.00021855984,0.00026751446],"category_scores_gemma":[0.0021531165,0.00031175834,0.00030284887,0.0006231231,0.0001764638,0.00014108114,0.00036018653,0.00029495166,0.00009078677],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011753153,0.00011982983,0.00008612887,0.00012133929,0.00005664975,0.00000918965,0.0002914446,0.000008975366,0.0005596751,0.965124,0.033463288,0.00014774327],"study_design_scores_gemma":[0.00054604467,0.000049797312,0.00039798568,0.00014934198,0.00018392206,0.0000361603,0.00011982313,0.00053607696,0.0018644776,0.9756358,0.020040656,0.00043986167],"about_ca_topic_score_codex":0.000018876686,"about_ca_topic_score_gemma":0.000017936849,"teacher_disagreement_score":0.66549593,"about_ca_system_score_codex":0.00015389378,"about_ca_system_score_gemma":0.00004647916,"threshold_uncertainty_score":0.9999334},"labels":[],"label_agreement":null},{"id":"W4412648066","doi":"10.55016/ojs/cdm.v1i1.62769","title":"Sum and product of different sets","year":2006,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Product (mathematics); Geometry","score_opus":0.01382463946740584,"score_gpt":0.2961174915697767,"score_spread":0.2822928521023708,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412648066","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9694067,0.00022178577,0.024656324,0.0005721401,0.00014148961,0.00076837785,0.00044814148,0.000094053365,0.0036909557],"genre_scores_gemma":[0.98728406,0.000007839696,0.012136647,0.000020604703,0.00007825448,0.00003457012,0.00001817564,0.000023649298,0.0003961745],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99870044,0.00004933038,0.0005133784,0.00021918232,0.00023331345,0.00028438336],"domain_scores_gemma":[0.9986081,0.00039684385,0.00017599986,0.00052727025,0.00019983102,0.00009192862],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030282923,0.00020910837,0.00043851676,0.00011250432,0.00021510833,0.000030633077,0.00018393478,0.00006686469,0.00003956091],"category_scores_gemma":[0.0008251458,0.00015088735,0.000101907055,0.0001723473,0.0001551567,0.00005279582,0.0001942304,0.00010814791,0.0000033506478],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008588835,0.00012249392,0.000478502,0.00020929113,0.000039991395,0.0000013590728,0.0005116406,0.0000028038914,0.0016317891,0.9947953,0.0019989873,0.00019921204],"study_design_scores_gemma":[0.00035280598,0.00005228206,0.002530993,0.00010241194,0.000112958616,0.000016411599,0.00011293705,0.00024294695,0.010209482,0.9855686,0.00049317675,0.0002050244],"about_ca_topic_score_codex":0.000008365657,"about_ca_topic_score_gemma":0.000016879363,"teacher_disagreement_score":0.017877353,"about_ca_system_score_codex":0.000035751113,"about_ca_system_score_gemma":0.000016103233,"threshold_uncertainty_score":0.6153008},"labels":[],"label_agreement":null},{"id":"W4412999821","doi":"10.1016/j.laa.2025.07.035","title":"Bollobás - Nikiforov Conjecture for graphs with not so many triangles","year":2025,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Mathematics; Conjecture; Combinatorics; Discrete mathematics","score_opus":0.01783223486738768,"score_gpt":0.2982986287722049,"score_spread":0.28046639390481726,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412999821","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6325392,0.0040126787,0.3239181,0.00946511,0.00042168237,0.009666206,0.0010437359,0.00078621716,0.018147063],"genre_scores_gemma":[0.97406006,0.00013762289,0.01968067,0.0012533708,0.00016759703,0.00093944714,0.000046922843,0.000037671463,0.0036766233],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991762,0.000018886856,0.00022883908,0.00028736153,0.000092199094,0.00019653645],"domain_scores_gemma":[0.9989999,0.0004306695,0.00008404857,0.0003340699,0.000090263675,0.00006107625],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013050824,0.00017184006,0.00023855866,0.00010565137,0.000602379,0.000049386577,0.00018192091,0.00011998322,0.000024222696],"category_scores_gemma":[0.0000633507,0.00012131156,0.00008489392,0.0002524192,0.000119068834,0.000052389605,0.000054250697,0.00012432686,0.0000022084112],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000057546808,0.000039708717,0.00006258217,0.00014002976,0.0000920057,2.3996748e-7,0.00020586743,0.000001062313,0.0002395442,0.99409777,0.0013312277,0.0037323942],"study_design_scores_gemma":[0.00094250124,0.00006377151,0.00024437552,0.000029895957,0.00016215577,0.0000057005195,0.00012909864,0.00030775781,0.0035341226,0.88904357,0.10536099,0.0001760749],"about_ca_topic_score_codex":0.0000026629502,"about_ca_topic_score_gemma":0.000010633166,"teacher_disagreement_score":0.34152088,"about_ca_system_score_codex":0.000007712938,"about_ca_system_score_gemma":0.000041654646,"threshold_uncertainty_score":0.4946942},"labels":[],"label_agreement":null},{"id":"W4413064234","doi":"10.1137/24m1714964","title":"Canonical Ramsey Numbers of Sparse Graphs","year":2025,"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":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"ETH Zürich Foundation; Walter Haefner Stiftung; Schweizerischer Nationalfonds zur Förderung der Wissenschaftlichen Forschung","keywords":"Mathematics; Ramsey's theorem; Combinatorics; Ramsey theory; Discrete mathematics; Graph","score_opus":0.0246427114099926,"score_gpt":0.32349596086883387,"score_spread":0.2988532494588413,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413064234","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8409954,0.0003021936,0.010555183,0.0008008401,0.0014575056,0.0004913134,0.000036312584,0.000100767735,0.14526048],"genre_scores_gemma":[0.9643976,0.00012737357,0.033168808,0.00031427707,0.00007116416,0.0000064879055,0.0000015781153,0.00004859559,0.0018641343],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99761033,0.00014839458,0.0010584965,0.0002083995,0.0005788446,0.0003955069],"domain_scores_gemma":[0.99742883,0.0009944486,0.000592315,0.0006586948,0.00016174333,0.00016394982],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010265252,0.0003132246,0.00069024676,0.00031639042,0.00030543286,0.000065019114,0.00061902363,0.00018720208,0.00025635454],"category_scores_gemma":[0.00095986744,0.00022001806,0.00048358573,0.00039765096,0.00028049195,0.00009321022,0.00015508522,0.0006813243,0.000007208999],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000066732486,0.00018966636,0.0002468087,0.00031566515,0.00027788826,0.000027431834,0.0013296647,0.000015317486,0.00014380734,0.9904235,0.0062522492,0.0007112766],"study_design_scores_gemma":[0.0007389584,0.00013267026,0.00016109299,0.0006946315,0.00016704293,0.000112923044,0.00073871535,0.00017747364,0.0013273802,0.9938652,0.0016639931,0.00021995304],"about_ca_topic_score_codex":0.0000027453777,"about_ca_topic_score_gemma":0.0000056778213,"teacher_disagreement_score":0.14339635,"about_ca_system_score_codex":0.00006518601,"about_ca_system_score_gemma":0.00012935569,"threshold_uncertainty_score":0.8972076},"labels":[],"label_agreement":null},{"id":"W4413122834","doi":"10.1007/s40305-025-00619-7","title":"Hypergraphs with a Quarter Uniform Turán Density","year":2025,"lang":"en","type":"article","venue":"Journal of the Operations Research Society of China","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"Natural Science Foundation of Shandong Province; China Postdoctoral Science Foundation; National Natural Science Foundation of China","keywords":"Quarter (Canadian coin); Mathematics; Combinatorics; History; Archaeology","score_opus":0.03066533879838002,"score_gpt":0.35965811507216733,"score_spread":0.3289927762737873,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413122834","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98704195,0.0001563456,0.0025547447,0.006903153,0.00015365842,0.00022772679,0.0000044541584,0.000005299478,0.002952657],"genre_scores_gemma":[0.98120475,0.00010180356,0.01688944,0.00011524264,0.00006700463,0.0000025406728,2.4027372e-7,0.000007679848,0.0016113142],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99839586,0.0002605995,0.00036138453,0.00008535067,0.0007071979,0.0001896347],"domain_scores_gemma":[0.99830836,0.0003058983,0.00009404791,0.00040027863,0.0008421729,0.000049263283],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021458233,0.00009236296,0.00023336365,0.0001094028,0.00085646263,0.00006027162,0.00056832115,0.000078104,0.00002998321],"category_scores_gemma":[0.00034594725,0.000045363562,0.0003515255,0.0006152191,0.0004628188,0.00016209767,0.0001577305,0.0007807134,3.0467675e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030149712,0.00053447596,0.00517374,0.00039905313,0.0014839247,0.0000047363023,0.021457704,0.0013789787,0.0070755305,0.82018226,0.14090003,0.0011080845],"study_design_scores_gemma":[0.0018808382,0.0005569431,0.029310532,0.00072525395,0.00018413695,0.0001317005,0.0067071016,0.0029612377,0.012591659,0.9420567,0.0026899413,0.00020394403],"about_ca_topic_score_codex":0.000026781974,"about_ca_topic_score_gemma":0.000048664268,"teacher_disagreement_score":0.13821009,"about_ca_system_score_codex":0.000063231804,"about_ca_system_score_gemma":0.0003012623,"threshold_uncertainty_score":0.65873045},"labels":[],"label_agreement":null},{"id":"W4413186099","doi":"10.55016/ojs/cdm.v5i2.62020","title":"Freiman's theorem for solvable groups","year":2010,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"John D. and Catherine T. MacArthur Foundation; National Science Foundation","keywords":"Mathematics; Combinatorics; Solvable group; Discrete mathematics; Abelian group","score_opus":0.01734946785670586,"score_gpt":0.32039881222157457,"score_spread":0.3030493443648687,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413186099","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24080642,0.0000495539,0.7344366,0.0017776138,0.0015395683,0.00277802,0.0016620009,0.0004980368,0.016452223],"genre_scores_gemma":[0.8143865,0.0000032313064,0.18315284,0.00022945387,0.000488675,0.000378528,0.00004521588,0.000076899276,0.0012386963],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99813336,0.000038598435,0.0005697663,0.00034749194,0.00027655647,0.0006342442],"domain_scores_gemma":[0.99657476,0.0014851083,0.00019077379,0.0010452449,0.00044084826,0.0002632627],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010903837,0.0003205163,0.0004979595,0.00014675844,0.00085133035,0.000119294265,0.00060040393,0.00022811748,0.0002779662],"category_scores_gemma":[0.004802129,0.0002493257,0.00030879505,0.00025580882,0.00019154276,0.00013165033,0.00023978742,0.00036433194,0.000046375728],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002032175,0.00009401806,0.000019669153,0.000105573774,0.00007058447,0.0000013447512,0.001043442,0.0000027418098,0.002652935,0.9875927,0.008139471,0.00025722862],"study_design_scores_gemma":[0.0006346955,0.000079393176,0.000028148217,0.000044227945,0.00014092798,0.000021134738,0.0002910394,0.0012725923,0.0046831267,0.9754389,0.017008964,0.00035685723],"about_ca_topic_score_codex":0.0000021900637,"about_ca_topic_score_gemma":0.000027364638,"teacher_disagreement_score":0.57358,"about_ca_system_score_codex":0.000047861035,"about_ca_system_score_gemma":0.00005391694,"threshold_uncertainty_score":0.9999959},"labels":[],"label_agreement":null},{"id":"W4413346871","doi":"10.1007/s00208-025-03254-y","title":"Two-point patterns determined by curves","year":2025,"lang":"en","type":"article","venue":"Mathematische Annalen","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Point (geometry); Geometry","score_opus":0.022947663891719896,"score_gpt":0.32288902811193904,"score_spread":0.29994136422021916,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413346871","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.73969394,0.0073657683,0.04996978,0.004501132,0.0009262067,0.0017035637,0.00030137418,0.0008683648,0.19466989],"genre_scores_gemma":[0.96096087,0.00062075665,0.012432485,0.0037945348,0.0001259415,0.00015813421,0.000031280117,0.00008107763,0.021794898],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99847215,0.00011427771,0.00047856,0.00032647635,0.0002547477,0.00035376617],"domain_scores_gemma":[0.9984565,0.0004919273,0.00016266142,0.00073476526,0.00007693721,0.0000772067],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056181964,0.0002784226,0.0004318101,0.00011596145,0.00021354973,0.000046812096,0.00049743283,0.00009484752,0.00061520346],"category_scores_gemma":[0.00040119607,0.00021749675,0.00018538504,0.00018602486,0.00008160802,0.00014228483,0.00026636507,0.0002204238,0.000029090836],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024861225,0.00018381135,0.0015173762,0.002535944,0.00025436524,0.00001718221,0.00089264923,2.8614753e-7,0.0011059449,0.53038657,0.45781723,0.005263786],"study_design_scores_gemma":[0.0007416132,0.000044490487,0.0003623258,0.0015591484,0.00015347835,0.000027505568,0.00018492472,0.00013660008,0.011275484,0.975235,0.009865465,0.0004139654],"about_ca_topic_score_codex":0.000011319085,"about_ca_topic_score_gemma":0.000009512257,"teacher_disagreement_score":0.44795176,"about_ca_system_score_codex":0.000018792163,"about_ca_system_score_gemma":0.000023102708,"threshold_uncertainty_score":0.88692605},"labels":[],"label_agreement":null},{"id":"W4413382729","doi":"10.1090/tran/9504","title":"Minors of matroids represented by sparse random matrices over finite fields","year":2025,"lang":"lv","type":"article","venue":"Transactions of the American Mathematical Society","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Matroid; Combinatorics; Pure mathematics","score_opus":0.010888910826474935,"score_gpt":0.27944995556978014,"score_spread":0.2685610447433052,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413382729","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.57780695,0.00095261494,0.41262627,0.0015285483,0.00049046037,0.001121025,0.0005099087,0.00008591075,0.0048783435],"genre_scores_gemma":[0.97918135,0.00073615386,0.014286876,0.0003189112,0.000033045588,0.00003407966,0.0000028985226,0.00004572256,0.0053609773],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9967423,0.0003586031,0.001383208,0.0004129738,0.00063858717,0.00046431625],"domain_scores_gemma":[0.9933737,0.0038248445,0.0010547547,0.0014818887,0.0001609761,0.0001038474],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006965606,0.00044201766,0.0014012388,0.000092404516,0.00042209073,0.000033531793,0.0010708909,0.00025327236,0.0009103014],"category_scores_gemma":[0.00037593482,0.00030752888,0.0020859002,0.001372449,0.0024564466,0.00010031465,0.00013667773,0.0006740631,0.0000055446685],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0060225874,0.016380379,0.0062482785,0.043131433,0.033324074,0.0000087413555,0.075732,0.0052414346,0.02391667,0.46213555,0.29652214,0.03133672],"study_design_scores_gemma":[0.005723596,0.00044031822,0.0011033627,0.0021045057,0.0062789554,0.000016174585,0.01170127,0.028873332,0.031604238,0.9093321,0.0017246365,0.0010975045],"about_ca_topic_score_codex":0.00025626397,"about_ca_topic_score_gemma":0.0000060989046,"teacher_disagreement_score":0.44719657,"about_ca_system_score_codex":0.00006312804,"about_ca_system_score_gemma":0.000096113916,"threshold_uncertainty_score":0.99993765},"labels":[],"label_agreement":null},{"id":"W4413385258","doi":"10.1016/j.jnt.2025.07.007","title":"The m-th element of a Sidon set","year":2025,"lang":"en","type":"article","venue":"Journal of Number Theory","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Mathematics; Element (criminal law); Set (abstract data type); Pure mathematics; Law; Computer science; Political science","score_opus":0.018816997458831183,"score_gpt":0.3392840737831428,"score_spread":0.3204670763243116,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413385258","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.82036996,0.0015919203,0.00831651,0.0013625107,0.0029351048,0.0003603824,0.000067072324,0.000028623726,0.16496794],"genre_scores_gemma":[0.99439716,0.000120963385,0.0019292809,0.00024606395,0.00014610085,0.0000021296016,4.2357e-7,0.000012428695,0.0031454375],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99862087,0.00029787887,0.00060277677,0.00006221772,0.00026504623,0.00015118322],"domain_scores_gemma":[0.99657273,0.002381438,0.0005245939,0.00029405416,0.00019102183,0.000036138234],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022350075,0.00010625529,0.00026243253,0.00006213018,0.00017129799,0.000018789124,0.00040239148,0.000055188142,0.0005634215],"category_scores_gemma":[0.0007832443,0.000054844717,0.00023867565,0.00013167044,0.00015541876,0.000052700405,0.00010357819,0.00024958822,0.0000020666855],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023070473,0.000043800097,0.00047077582,0.00004920842,0.0002357406,0.0000062216814,0.00084110035,0.0000020611542,0.00010946,0.9532694,0.03930615,0.005435351],"study_design_scores_gemma":[0.00037064668,0.00004545259,0.00034813437,0.00012803248,0.000098224096,0.000043397267,0.0010444645,0.0000043630603,0.0012420061,0.96029097,0.036331713,0.000052592444],"about_ca_topic_score_codex":6.77968e-7,"about_ca_topic_score_gemma":0.0000017715302,"teacher_disagreement_score":0.17402723,"about_ca_system_score_codex":0.00003132807,"about_ca_system_score_gemma":0.00006609007,"threshold_uncertainty_score":0.616907},"labels":[],"label_agreement":null},{"id":"W4414086407","doi":"10.1002/jcd.22004","title":"Steiner Triple Systems With High Discrepancy","year":2025,"lang":"en","type":"article","venue":"Journal of Combinatorial Designs","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Steiner system; Mathematical proof; Combinatorial proof; Order (exchange); Combinatorial design; Type (biology)","score_opus":0.02312655991804681,"score_gpt":0.2846814135717978,"score_spread":0.26155485365375103,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414086407","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8910223,0.0015174043,0.041636504,0.00047914402,0.044643704,0.0008710298,0.000012756959,0.00009568602,0.019721465],"genre_scores_gemma":[0.9954036,0.000018616236,0.0023957465,0.000028315213,0.0006341853,0.000004409971,3.8918506e-7,0.000020697018,0.0014940272],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984043,0.00022903005,0.00061917887,0.00011438637,0.00043090427,0.00020215903],"domain_scores_gemma":[0.9982408,0.0005109596,0.000497292,0.00029380483,0.00037171514,0.0000854255],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007892292,0.00017348018,0.0005283168,0.0002117364,0.0001720635,0.00007528803,0.00035169598,0.00011254762,0.000022597049],"category_scores_gemma":[0.00034280808,0.0001055022,0.00014471014,0.0002933552,0.00007106869,0.00015868824,0.00004846007,0.00031024782,8.3669704e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00051474455,0.00012117396,0.00037480544,0.000090086774,0.00026493153,0.000042897762,0.0001604803,0.000014088531,0.0001737767,0.99058074,0.00752075,0.00014150926],"study_design_scores_gemma":[0.0032607547,0.0006149531,0.0003554609,0.00031282296,0.0002333229,0.00006269841,0.00014805302,0.00001693085,0.0009376256,0.9883452,0.005563886,0.00014829723],"about_ca_topic_score_codex":0.000009369116,"about_ca_topic_score_gemma":5.6715686e-7,"teacher_disagreement_score":0.10438131,"about_ca_system_score_codex":0.000069129346,"about_ca_system_score_gemma":0.00015934078,"threshold_uncertainty_score":0.4302255},"labels":[],"label_agreement":null},{"id":"W4414398250","doi":"10.33137/codex.v1i1.45640","title":"Goldbach’s Conjecture","year":2025,"lang":"en","type":"article","venue":"Journal of Computing Data and Exploration","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Goldbach's conjecture; Riemann hypothesis; Conjecture; Number theory; State (computer science)","score_opus":0.08057890878785307,"score_gpt":0.36949078229988963,"score_spread":0.28891187351203657,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414398250","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6461997,0.00061979797,0.34967908,0.0012717359,0.0011404885,0.00007748754,0.000009482837,0.000020193513,0.0009820168],"genre_scores_gemma":[0.9860722,0.00006400952,0.013456958,0.00014434879,0.00021942287,6.679169e-8,0.000007771163,0.000003835949,0.000031430813],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994034,0.000057310528,0.0002939218,0.00007854233,0.00010149877,0.00006530225],"domain_scores_gemma":[0.9992115,0.00024454578,0.00022127392,0.00022575914,0.000073838804,0.000023090131],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064205925,0.00006105401,0.00014949258,0.000090477035,0.00013718313,0.000051922812,0.00022765894,0.00004096112,0.0000035090775],"category_scores_gemma":[0.00032301815,0.00004362059,0.000022899354,0.000086935506,0.00002980418,0.00033086794,0.00018021198,0.00014445987,2.0959611e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008729605,0.0000582382,0.0012805146,0.0001868586,0.00018941906,0.00001568266,0.0047283545,0.000124455,0.00035532736,0.8547352,0.060635686,0.077602945],"study_design_scores_gemma":[0.0005411609,0.00006737394,0.0005513517,0.0001957396,0.00008581361,0.000059868646,0.0007346916,0.0060980865,0.00023688177,0.97852534,0.012821058,0.00008264655],"about_ca_topic_score_codex":5.8889964e-7,"about_ca_topic_score_gemma":0.0000011173647,"teacher_disagreement_score":0.33987245,"about_ca_system_score_codex":0.000007716567,"about_ca_system_score_gemma":0.000029181634,"threshold_uncertainty_score":0.17787959},"labels":[],"label_agreement":null},{"id":"W4414472984","doi":"10.4064/aa240201-25-5","title":"Arbitrarily long strings of consecutive primes in special sets","year":2025,"lang":"en","type":"article","venue":"Acta Arithmetica","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Set (abstract data type); Function (biology); Open set; Set theory; Closed set","score_opus":0.016642712954928987,"score_gpt":0.3084569907063212,"score_spread":0.29181427775139224,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414472984","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8650281,0.00007946095,0.00021240601,0.00030257105,0.00035309244,0.00026136855,0.000018806242,0.000029145125,0.13371508],"genre_scores_gemma":[0.99387956,0.000017324468,0.005480466,0.00014081728,0.00006882082,0.0000057615875,0.0000017739516,0.000010758881,0.00039469774],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989545,0.00007680451,0.00036741613,0.0002097307,0.00016688132,0.00022468899],"domain_scores_gemma":[0.9986488,0.0008379807,0.000101173864,0.00031303323,0.00006324602,0.000035756468],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027322976,0.0001428254,0.00033496047,0.00023567116,0.00006273471,0.000016859098,0.00025549202,0.000120988414,0.00015555641],"category_scores_gemma":[0.0006445449,0.00012444433,0.00008793707,0.00030349012,0.00025482496,0.000058342383,0.0001661802,0.00024828367,0.0000012889224],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008788356,0.00011626614,0.00648351,0.00011108486,0.000091172806,0.000018058583,0.001395963,2.987884e-7,0.0002798015,0.98665595,0.002288123,0.0024718973],"study_design_scores_gemma":[0.0006754996,0.00004243815,0.04184293,0.00014541364,0.000056341305,0.000005372543,0.00025969077,0.000028393184,0.011490877,0.94385207,0.0014535186,0.00014746729],"about_ca_topic_score_codex":0.00002193055,"about_ca_topic_score_gemma":0.000031878284,"teacher_disagreement_score":0.13332038,"about_ca_system_score_codex":0.000031213673,"about_ca_system_score_gemma":0.000090451926,"threshold_uncertainty_score":0.50746924},"labels":[],"label_agreement":null},{"id":"W4414750135","doi":"10.1016/j.disc.2025.114822","title":"Applications of sparse hypergraph colorings","year":2025,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Karlsruhe Institute of Technology","keywords":"Hypergraph; Independence number; Upper and lower bounds; Binary logarithm; Extremal combinatorics; Ramsey's theorem; Independence (probability theory)","score_opus":0.017813932260969702,"score_gpt":0.3013916045296683,"score_spread":0.28357767226869857,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414750135","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3387934,0.0004402051,0.25817877,0.00034997275,0.00032516418,0.0017375904,0.0000894213,0.0003300317,0.39975542],"genre_scores_gemma":[0.9190528,0.00003642552,0.07765517,0.000077614786,0.000029251938,0.00013509886,0.0000047414637,0.000028139764,0.0029807587],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988853,0.00002730164,0.00050513615,0.00018204752,0.00020329698,0.00019694498],"domain_scores_gemma":[0.9984367,0.0005127013,0.00021172958,0.0006914175,0.00010293772,0.000044549986],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029558854,0.0001711188,0.00036891075,0.00018714777,0.00016369454,0.000016817035,0.00038759332,0.00009862897,0.000069974965],"category_scores_gemma":[0.00022168692,0.0001366385,0.0001731656,0.00046220396,0.00020335171,0.000048199166,0.0001746774,0.00012731132,0.000005029853],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006397647,0.00008860319,0.00025419059,0.000618121,0.0000888017,5.5976545e-7,0.0008014201,0.0000015331678,0.00028137412,0.9962665,0.00079882034,0.000793681],"study_design_scores_gemma":[0.00021643056,0.000017591208,0.00008615774,0.00011426665,0.0001231627,0.000002905606,0.0007140665,0.00016270144,0.0033137295,0.98906726,0.0060503064,0.000131407],"about_ca_topic_score_codex":0.0000030641397,"about_ca_topic_score_gemma":0.0000027044525,"teacher_disagreement_score":0.5802594,"about_ca_system_score_codex":0.000016297014,"about_ca_system_score_gemma":0.000027653386,"threshold_uncertainty_score":0.5571956},"labels":[],"label_agreement":null},{"id":"W4415357546","doi":"10.1214/25-aap2204","title":"The Horton–Strahler number of Galton–Watson trees with possibly infinite variance","year":2025,"lang":"en","type":"article","venue":"The Annals of Applied Probability","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Mathematical proof; Tree (set theory); Variance (accounting); Branching (polymer chemistry); Domain (mathematical analysis); Cauchy distribution","score_opus":0.054469122360917416,"score_gpt":0.34064378773288984,"score_spread":0.28617466537197245,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415357546","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9076203,0.000102135615,0.00037074272,0.0011961408,0.000092500006,0.0008199089,0.00002631775,0.00004060034,0.089731365],"genre_scores_gemma":[0.995726,0.000056810044,0.0033417952,0.0002042098,0.00003643004,0.000057959878,0.0000011388045,0.00001438964,0.00056128466],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984037,0.00013911337,0.0005766313,0.00026299505,0.00032504433,0.00029247793],"domain_scores_gemma":[0.99672955,0.0013006701,0.00036289022,0.0013133894,0.000257247,0.00003626112],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019690387,0.00021126037,0.00039871834,0.000029555866,0.00032000063,0.000026398628,0.0007078426,0.00010107151,0.000051239243],"category_scores_gemma":[0.00019996923,0.000098667915,0.00013791234,0.00039990002,0.0010358663,0.00004731054,0.00018646769,0.00025947994,0.0000015299529],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009523991,0.00012279267,0.0019771743,0.0002536853,0.00020834949,1.3876895e-7,0.0010998029,0.000052448595,0.00020764238,0.9893425,0.00093515194,0.0048478884],"study_design_scores_gemma":[0.0002549923,0.000048249494,0.014256839,0.000058721234,0.000055153807,0.0000013019702,0.00015876025,0.000014594901,0.011491706,0.97091585,0.0026337898,0.000110051675],"about_ca_topic_score_codex":0.000021426054,"about_ca_topic_score_gemma":0.000049167033,"teacher_disagreement_score":0.08917008,"about_ca_system_score_codex":0.000008985629,"about_ca_system_score_gemma":0.00009190808,"threshold_uncertainty_score":0.4023561},"labels":[],"label_agreement":null},{"id":"W4415525836","doi":"10.61091/jcmcc128-01","title":"Enumeration and asymptotic analysis of edge-disjoint triangle packings in complete graphs","year":2025,"lang":"","type":"article","venue":"Journal of Combinatorial Mathematics and Combinatorial Computing","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Enumeration; Pairwise comparison; Graph; Complete graph; Relation (database); Graph theory","score_opus":0.01600846079553976,"score_gpt":0.27399262536955565,"score_spread":0.2579841645740159,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415525836","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9773596,0.0025881988,0.004354366,0.0001514605,0.013942894,0.0006825458,0.000018594828,0.000017751589,0.0008846081],"genre_scores_gemma":[0.99576855,0.0003991729,0.0033693288,0.000032649383,0.00036819986,0.0000023491389,0.000003352351,0.000045767294,0.000010605136],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9927802,0.0006522082,0.0044925115,0.00049667637,0.0009886066,0.00058978965],"domain_scores_gemma":[0.98952866,0.0045707733,0.004000806,0.0005739481,0.0010849109,0.00024091013],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0056050057,0.00069761387,0.0037671733,0.0027544857,0.00053336413,0.0003319524,0.0006251941,0.0005273555,0.000019977791],"category_scores_gemma":[0.0025407285,0.00064214936,0.0008579369,0.0028834653,0.00047952772,0.00029912713,0.00068325084,0.001088146,2.3057291e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00039369808,0.001112959,0.0030844547,0.00166964,0.0032633033,0.000022733708,0.007931361,0.00011255111,0.00045159145,0.97985953,0.00006219401,0.002036],"study_design_scores_gemma":[0.00862564,0.0008704476,0.0026706741,0.0022549422,0.0050221724,0.000028510765,0.0014104935,0.025511647,0.00038863972,0.9526212,0.00010178275,0.0004938082],"about_ca_topic_score_codex":0.00003341281,"about_ca_topic_score_gemma":0.0000053138165,"teacher_disagreement_score":0.027238272,"about_ca_system_score_codex":0.00017202893,"about_ca_system_score_gemma":0.00027573973,"threshold_uncertainty_score":0.999603},"labels":[],"label_agreement":null},{"id":"W4415569780","doi":"10.1017/s0963548325100205","title":"Disperse hypergraphs","year":2025,"lang":"en","type":"article","venue":"Combinatorics Probability Computing","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Hypergraph; Set (abstract data type); Independent set; Clique; Set theory","score_opus":0.02924122589144217,"score_gpt":0.315248863617299,"score_spread":0.2860076377258568,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415569780","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9516793,0.0002102668,0.008316553,0.00022323981,0.0019389855,0.0004431319,0.0000018737023,0.00036698053,0.03681966],"genre_scores_gemma":[0.9940817,0.0000042182614,0.005405572,0.00014099418,0.00003887929,0.000005889433,0.0000014453267,0.000016889504,0.00030446373],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983165,0.00017809725,0.0004648856,0.00044015725,0.00022585141,0.00037448062],"domain_scores_gemma":[0.9979045,0.00092548924,0.00011625727,0.00078932877,0.0001897741,0.00007467156],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00100653,0.00022673316,0.00034863132,0.00014527605,0.000636611,0.000049495997,0.00050246966,0.00013715932,0.00001684556],"category_scores_gemma":[0.001327356,0.00020127706,0.0001905796,0.000758021,0.00019223736,0.0000672216,0.0005635682,0.0003509608,0.0000029479295],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009247288,0.00017048989,0.01846005,0.00022335853,0.000040964813,0.000002131215,0.00045275604,0.000010619002,0.000023536584,0.9764069,0.0007053456,0.0034946285],"study_design_scores_gemma":[0.00041298065,0.000026517293,0.0031960765,0.00006746547,0.000033888333,0.0000027926512,0.00007789308,0.0010665708,0.00025023895,0.99351305,0.0011560033,0.00019655128],"about_ca_topic_score_codex":0.0000062748795,"about_ca_topic_score_gemma":0.000001814802,"teacher_disagreement_score":0.04240234,"about_ca_system_score_codex":0.00012524863,"about_ca_system_score_gemma":0.000058199337,"threshold_uncertainty_score":0.82078403},"labels":[],"label_agreement":null},{"id":"W4416012590","doi":"10.1080/03081087.2025.2578529","title":"The quantum Ramsey numbers <i>QR</i> (2, <i>k</i> )","year":2025,"lang":"en","type":"article","venue":"Linear and Multilinear Algebra","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"Air Force Office of Scientific Research; National Science Foundation","keywords":"Ramsey's theorem; Quantum; Class (philosophy); Field (mathematics); Boolean function","score_opus":0.014723657846825406,"score_gpt":0.31132394642519196,"score_spread":0.29660028857836657,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416012590","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95532453,0.003106652,0.004190608,0.0021310723,0.0026661975,0.0009009296,0.00004137279,0.00045000887,0.031188598],"genre_scores_gemma":[0.982225,0.0006771233,0.006018396,0.0017249475,0.00033200934,0.000028544307,0.000007385073,0.000046921396,0.008939644],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998684,0.00010244907,0.00036602974,0.0003069066,0.00018250669,0.00035813265],"domain_scores_gemma":[0.99810296,0.0011012887,0.00008106135,0.0005399277,0.000085283566,0.000089485],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005263306,0.0002269167,0.0002585782,0.00005344714,0.0008882241,0.00007659672,0.0003120705,0.00014493716,0.000023578863],"category_scores_gemma":[0.0005287658,0.00014106228,0.00013633967,0.00020830178,0.00033283007,0.00006462172,0.0002355923,0.0003315518,0.000011662619],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011884942,0.000053120126,0.00086148776,0.0000861992,0.00012826057,0.0000055826963,0.00068549014,0.0000024104168,0.00021852163,0.97186357,0.011166387,0.014810115],"study_design_scores_gemma":[0.0013791336,0.000047895373,0.00057520386,0.000068852285,0.00011395878,0.000014921365,0.0006062503,0.007940377,0.0027205318,0.6984704,0.28772646,0.0003359877],"about_ca_topic_score_codex":0.000028531394,"about_ca_topic_score_gemma":0.000028929828,"teacher_disagreement_score":0.27656007,"about_ca_system_score_codex":0.000012182016,"about_ca_system_score_gemma":0.000038081176,"threshold_uncertainty_score":0.6831592},"labels":[],"label_agreement":null},{"id":"W4416295488","doi":"10.1112/mtk.70059","title":"Many pentagons in triple systems","year":2025,"lang":"en","type":"article","venue":"Mathematika","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; Hungarian Scientific Research Fund; National Science Foundation","keywords":"Exponent; Upper and lower bounds; Graph; Plane (geometry); Constant (computer programming)","score_opus":0.026215226908598628,"score_gpt":0.317885090869586,"score_spread":0.2916698639609874,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416295488","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.67905015,0.00093467097,0.009939437,0.00032451432,0.0019564882,0.0011938825,0.000019635436,0.0002877726,0.30629346],"genre_scores_gemma":[0.97995317,0.000015678499,0.0030528419,0.00010150769,0.00004777574,0.00008809595,0.000001953089,0.000022859822,0.0167161],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99883485,0.00008253473,0.0004413318,0.00021507297,0.00016753282,0.0002586877],"domain_scores_gemma":[0.9989623,0.00037144177,0.00009260792,0.00050872425,0.000029432942,0.00003553385],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005341811,0.00016441502,0.000354838,0.000250303,0.00012453603,0.000047661586,0.00031522603,0.00010274114,0.00014350028],"category_scores_gemma":[0.00026466657,0.00013074884,0.00009546304,0.0003203244,0.000051842857,0.000064810185,0.00014074957,0.0001719672,0.000024054298],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000102179865,0.00007557256,0.00048404856,0.00038517034,0.000026919419,0.000008963793,0.0008810626,0.0000031118454,0.00006579138,0.98844635,0.009328171,0.00028460598],"study_design_scores_gemma":[0.0005394642,0.00000983787,0.00047938546,0.00024933103,0.00002414253,0.000011268883,0.00069112657,0.00064184226,0.00026203174,0.99227214,0.004671355,0.00014810462],"about_ca_topic_score_codex":0.000020407568,"about_ca_topic_score_gemma":0.000012131307,"teacher_disagreement_score":0.30090305,"about_ca_system_score_codex":0.0000635826,"about_ca_system_score_gemma":0.000027233598,"threshold_uncertainty_score":0.53317827},"labels":[],"label_agreement":null},{"id":"W4416907084","doi":"10.1145/3779121","title":"Hardness of linearly ordered 4-colouring of 3-colourable 3-uniform hypergraphs","year":2025,"lang":"en","type":"article","venue":"ACM Transactions on Computation Theory","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Trinity College","funders":"Univerzita Karlova v Praze","keywords":"Hypergraph; Chromatic scale; Graph; Enhanced Data Rates for GSM Evolution; Graph theory","score_opus":0.025828264527205644,"score_gpt":0.3139078574151777,"score_spread":0.288079592887972,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416907084","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39472213,0.00005050683,0.6003723,0.00008562578,0.0005519501,0.00027091365,0.000025249983,0.00007808928,0.0038432153],"genre_scores_gemma":[0.9677123,0.000020340482,0.03129452,0.000067578614,0.0000073507713,0.000018345185,0.0000030363253,0.000018839224,0.0008577039],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99872285,0.00018637073,0.0005267748,0.00019831037,0.00020309686,0.00016257931],"domain_scores_gemma":[0.99742556,0.0016017328,0.0002193044,0.0004674326,0.00025132543,0.000034638906],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060013076,0.00016350315,0.00035546586,0.0004539382,0.0002511465,0.000012176296,0.0003499374,0.00012356111,0.00009509845],"category_scores_gemma":[0.00023254735,0.00014749248,0.00020012246,0.0005792934,0.00018461255,0.00010239895,0.000015129843,0.0002078678,0.0000016525962],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00055158546,0.0004568855,0.0000746775,0.00047932894,0.00045010378,0.0000010733562,0.002171011,0.012249744,0.0012567961,0.9215737,0.00010416305,0.060630925],"study_design_scores_gemma":[0.00078727514,0.000121242374,0.00035898617,0.00014939833,0.00013004283,0.0000027124393,0.000560692,0.0011185367,0.026532767,0.9700381,0.000076140124,0.00012410896],"about_ca_topic_score_codex":0.000012173188,"about_ca_topic_score_gemma":0.0000070111814,"teacher_disagreement_score":0.5729901,"about_ca_system_score_codex":0.000027754128,"about_ca_system_score_gemma":0.00006795622,"threshold_uncertainty_score":0.6014569},"labels":[],"label_agreement":null},{"id":"W4416978636","doi":"10.4153/s0008439525101549","title":"Explicit sumset sizes in additive number theory","year":2025,"lang":"en","type":"article","venue":"Canadian Mathematical Bulletin","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"City University of New York","keywords":"Set (abstract data type); Range (aeronautics); Finite set; Set theory; Additive group","score_opus":0.012910114557476766,"score_gpt":0.27829823031833656,"score_spread":0.2653881157608598,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416978636","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11530972,0.0000841959,0.0013124809,0.0037138297,0.00027745366,0.00080463255,0.0005864423,0.00013553888,0.8777757],"genre_scores_gemma":[0.9614732,0.00001167168,0.005513164,0.0035253975,0.000096122116,0.0002143742,0.000035004847,0.000059151684,0.029071867],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99814576,0.00022869001,0.00048001754,0.00034466508,0.00018008595,0.00062077795],"domain_scores_gemma":[0.9955519,0.003479367,0.00006429103,0.0005347665,0.00006326511,0.00030642457],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00073404564,0.00027028672,0.00045797552,0.00026432076,0.00020276672,0.000050536484,0.0004145299,0.00022863175,0.12689388],"category_scores_gemma":[0.0035753003,0.00023127366,0.00013930454,0.00032948938,0.00019237027,0.00002986119,0.0001011095,0.0003751719,0.0023608357],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014858007,0.000032747994,0.00006403179,0.000088915614,0.00003430032,0.00004797808,0.0005652315,1.6256588e-7,0.0000018659496,0.825336,0.17267081,0.0011431241],"study_design_scores_gemma":[0.0002777631,0.000008190526,0.00021982324,0.00025757658,0.00002495638,0.000012221436,0.00064658804,0.000016041886,0.000078304845,0.87259877,0.12564318,0.00021660094],"about_ca_topic_score_codex":0.00026078583,"about_ca_topic_score_gemma":0.0017319716,"teacher_disagreement_score":0.84870386,"about_ca_system_score_codex":0.00019898968,"about_ca_system_score_gemma":0.00018454743,"threshold_uncertainty_score":0.99841595},"labels":[],"label_agreement":null},{"id":"W4417026731","doi":"10.4230/lipics.approx/random.2025.37","title":"Permanental Rank vs Determinantal Rank of Random Matrices over Finite Fields","year":2025,"lang":"en","type":"article","venue":"ArXiv.org","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University; University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Rank (graph theory); Matrix (chemical analysis); Block matrix; Random matrix; Finite field; Algebraic number; Zero (linguistics); Random element","score_opus":0.02062180166971331,"score_gpt":0.2947452479061064,"score_spread":0.27412344623639306,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4417026731","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99076957,0.00039196716,0.0004325522,0.000077398094,0.00067896175,0.00023935638,0.000021031594,0.000053545045,0.007335636],"genre_scores_gemma":[0.99735457,0.00011281317,0.00033795586,0.00026527213,0.00009820327,0.000011999534,0.000004994792,0.000018079116,0.00179609],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9988116,0.00008828847,0.00043448014,0.00023425941,0.0001862137,0.00024512864],"domain_scores_gemma":[0.9981971,0.0011424389,0.00014788315,0.00042379307,0.00004511319,0.0000436982],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026220005,0.00020013946,0.00042105914,0.00014927941,0.00017382587,0.00001588625,0.00032896776,0.00016997638,0.00045559247],"category_scores_gemma":[0.00034828507,0.00015629429,0.0002576375,0.00019579992,0.00014327373,0.000106608066,0.00018327362,0.00021205291,0.000012780471],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0023565115,0.00030741136,0.9047272,0.0012330642,0.0005021498,0.00007815015,0.004694568,0.000014028643,0.002877101,0.070897736,0.008999353,0.003312691],"study_design_scores_gemma":[0.029277498,0.00057590206,0.48662725,0.0011456319,0.0013962985,0.00009197184,0.0017788601,0.0016996935,0.07233907,0.3905543,0.012734056,0.0017794721],"about_ca_topic_score_codex":0.000021752912,"about_ca_topic_score_gemma":0.000013398744,"teacher_disagreement_score":0.4181,"about_ca_system_score_codex":0.000016238986,"about_ca_system_score_gemma":0.00002553033,"threshold_uncertainty_score":0.6373496},"labels":[],"label_agreement":null},{"id":"W4417036183","doi":"10.48550/arxiv.2512.04071","title":"On the Hypergraph Nash-Williams' Conjecture","year":2025,"lang":"","type":"preprint","venue":"ArXiv.org","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Hypergraph; Conjecture; Divisibility rule; Generalization; Order (exchange); Constant (computer programming)","score_opus":0.04730903634158285,"score_gpt":0.29049890276612134,"score_spread":0.2431898664245385,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4417036183","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9206339,0.0017779595,0.00035034117,0.0040493663,0.008504033,0.0021182527,0.00035611997,0.0002590019,0.06195102],"genre_scores_gemma":[0.97154146,0.0015826003,0.00040471964,0.0068019233,0.0008961948,0.0002182443,0.000040023857,0.00014401658,0.018370809],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99328625,0.0010527341,0.0015611065,0.0018751237,0.0009869001,0.0012379118],"domain_scores_gemma":[0.9876306,0.0056631877,0.0009834246,0.0050954265,0.00035300216,0.00027436583],"candidate_categories":["metaepi_narrow","sts","research_integrity","insufficient_payload"],"consensus_categories":["metaepi_narrow","research_integrity"],"category_scores_codex":[0.0015222245,0.0017439425,0.00169113,0.00043497118,0.0020184775,0.00022132932,0.0033210923,0.0018858112,0.0028534273],"category_scores_gemma":[0.0023000378,0.0011023943,0.0017207512,0.0007752713,0.0011539425,0.00008691632,0.0028938479,0.0049688765,0.00031562653],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019106168,0.00030071667,0.017796727,0.0010318024,0.0017698868,0.000048756116,0.0038418104,0.00020267969,0.000122857,0.95568407,0.01752381,0.0014858259],"study_design_scores_gemma":[0.00075269706,0.00022495468,0.008577658,0.0019606543,0.0009381479,0.00002624664,0.00066163,0.00013140768,0.0030580482,0.9456086,0.036573008,0.0014869411],"about_ca_topic_score_codex":0.000040724768,"about_ca_topic_score_gemma":0.000024695153,"teacher_disagreement_score":0.05090756,"about_ca_system_score_codex":0.00017169764,"about_ca_system_score_gemma":0.00036178852,"threshold_uncertainty_score":0.9995307},"labels":[],"label_agreement":null},{"id":"W4417154908","doi":"10.1007/s10801-025-01489-1","title":"The intersection densities of transitive actions of $$\\operatorname {PSL}_2(q)$$ with cyclic point stabilizers","year":2025,"lang":"en","type":"article","venue":"Journal of Algebraic Combinatorics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; University of Regina","funders":"","keywords":"Intersection (aeronautics); Transitive relation; Permutation group; Conjugate; Prime (order theory); Graph; Permutation graph; Clique; Point (geometry)","score_opus":0.013933562373013636,"score_gpt":0.28693743677822997,"score_spread":0.27300387440521634,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4417154908","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9937568,0.00028655893,0.0027834,0.00034056054,0.0010074975,0.00015326438,0.000014558586,0.000010782242,0.0016466095],"genre_scores_gemma":[0.99920976,0.000118112504,0.00043002027,0.000032435164,0.000027309758,0.0000027576477,4.751622e-7,0.000015020584,0.00016408767],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984658,0.00017864828,0.0007329989,0.00009827879,0.0003655106,0.00015880393],"domain_scores_gemma":[0.9962966,0.0019170779,0.00067181414,0.000272659,0.00079160306,0.00005027238],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006625505,0.00015709118,0.00043669756,0.00020275183,0.00023811097,0.000023401613,0.0002643957,0.00008566776,0.000040441577],"category_scores_gemma":[0.0006576916,0.000094490504,0.0002375025,0.00048004306,0.00033537357,0.00015463342,0.000046948622,0.0004078315,1.3584781e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00047656408,0.00020273999,0.00036948215,0.00016041238,0.0006710486,0.000007870922,0.0074110623,0.000020583839,0.0013067821,0.98627055,0.0018286944,0.0012742087],"study_design_scores_gemma":[0.0012887366,0.0008398513,0.0014448323,0.0004342477,0.00033430092,0.00010633656,0.018276606,0.000055068052,0.017865287,0.95841795,0.00079740037,0.00013938487],"about_ca_topic_score_codex":0.0000069446924,"about_ca_topic_score_gemma":0.000018985733,"teacher_disagreement_score":0.027852602,"about_ca_system_score_codex":0.0001416287,"about_ca_system_score_gemma":0.00021193502,"threshold_uncertainty_score":0.38532108},"labels":[],"label_agreement":null},{"id":"W4417252725","doi":"10.48550/arxiv.2505.05339","title":"A Counterexample to a Conjecture of Lovász","year":2025,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Division of Mathematical Sciences; Natural Sciences and Engineering Research Council of Canada; Banff International Research Station for Mathematical Innovation and Discovery; European Commission; National Science Foundation","keywords":"Counterexample; Conjecture; Hypergraph; Vertex (graph theory); Matching (statistics); Graph","score_opus":0.08645650273801497,"score_gpt":0.3515011460662824,"score_spread":0.26504464332826744,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4417252725","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98491895,0.0002437298,0.0019041364,0.00026223395,0.0012640007,0.00065459945,0.00034025253,0.00010198665,0.010310084],"genre_scores_gemma":[0.9924059,0.000026864718,0.0038940897,0.00068039977,0.0001947223,0.000045460947,0.000019533618,0.000033940716,0.0026990739],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998324,0.000097606884,0.0005341316,0.00050095964,0.0002564726,0.00028687372],"domain_scores_gemma":[0.9977026,0.00046541786,0.0002776128,0.0012901463,0.00017285632,0.000091371694],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003200619,0.00036055,0.0007283387,0.0002000728,0.00008731566,0.00002004609,0.0007540504,0.00043608036,0.0003168134],"category_scores_gemma":[0.00055761106,0.00029786484,0.0002918058,0.00017179597,0.00010304054,0.000021636417,0.0015077628,0.0006436624,0.000013429167],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033265722,0.0003478676,0.14654927,0.0070722266,0.0016751809,0.000052706877,0.018715866,0.00021171328,0.0011276576,0.7691465,0.05284726,0.0019211156],"study_design_scores_gemma":[0.00053658424,0.000110024026,0.019189771,0.0011983478,0.00030283513,0.000008452171,0.00023619813,0.000027705557,0.004383752,0.95559675,0.017771678,0.00063789985],"about_ca_topic_score_codex":0.00009005323,"about_ca_topic_score_gemma":0.00005297812,"teacher_disagreement_score":0.18645027,"about_ca_system_score_codex":0.000054495722,"about_ca_system_score_gemma":0.00014015868,"threshold_uncertainty_score":0.99994737},"labels":[],"label_agreement":null},{"id":"W4417420857","doi":"10.2139/ssrn.5929690","title":"Local Infection in Uniform Hypergraphs","year":2025,"lang":"","type":"preprint","venue":"SSRN Electronic Journal","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Hypergraph; Vertex (graph theory); Graph; Set (abstract data type); Upper and lower bounds; Block (permutation group theory)","score_opus":0.010175460604548926,"score_gpt":0.2703815534979378,"score_spread":0.26020609289338886,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4417420857","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6982934,0.01408984,0.2319981,0.000696598,0.009190231,0.0017336219,0.00004778734,0.00016888665,0.043781526],"genre_scores_gemma":[0.8912503,0.10293229,0.00038227745,0.00012136116,0.00053826824,0.000030609477,0.00001219653,0.000076740645,0.004655929],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9895467,0.00077033835,0.002091513,0.00090966036,0.0008246494,0.0058571245],"domain_scores_gemma":[0.996794,0.00045575012,0.0011249864,0.0010485615,0.00035549453,0.00022122185],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":["research_integrity"],"category_scores_codex":[0.0073945313,0.0010895407,0.0013953779,0.0018636179,0.0009880541,0.00020245736,0.0012419649,0.0015240446,0.00020991637],"category_scores_gemma":[0.0004051204,0.0009964146,0.0011792236,0.0010925401,0.0004254524,0.00029019572,0.001086611,0.023022972,0.000017246195],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":true,"about_ca_system_consensus":true,"study_design_scores_codex":[0.00030017568,0.0003079166,0.0046141613,0.00039399948,0.0010809727,0.000018973862,0.0010718948,0.0018684195,0.000005535466,0.92570174,0.00006200802,0.06457421],"study_design_scores_gemma":[0.0017154479,0.00041619892,0.0010883623,0.0010104077,0.00043782266,0.0009890131,0.0016596725,0.0014374366,0.00006826135,0.98835635,0.0019443228,0.0008767087],"about_ca_topic_score_codex":0.0006793528,"about_ca_topic_score_gemma":0.010000756,"teacher_disagreement_score":0.23161581,"about_ca_system_score_codex":0.006059533,"about_ca_system_score_gemma":0.009512412,"threshold_uncertainty_score":0.9997722},"labels":[],"label_agreement":null},{"id":"W61072206","doi":"","title":"On bipartite generalized Ramsey theory.","year":2003,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Bipartite graph; Ramsey theory; Combinatorics","score_opus":0.022314320970585787,"score_gpt":0.2802018678683466,"score_spread":0.25788754689776083,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W61072206","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.93651104,0.00011745051,0.00007143043,0.00003831748,0.00268853,0.00020062749,0.0000033547446,0.00013664541,0.06023261],"genre_scores_gemma":[0.99643713,0.00001417012,0.0011876514,0.00042578587,0.000010733167,0.000020652089,0.000001864952,0.000043180713,0.0018588381],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984847,0.00041116227,0.00025755094,0.00026283087,0.00025760272,0.00032616212],"domain_scores_gemma":[0.99836314,0.00073571684,0.00010131019,0.00063887244,0.000055170516,0.00010581833],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007909961,0.00021125087,0.00026582566,0.00008276448,0.00027150483,0.000036042245,0.00024258556,0.00012453186,0.0006192944],"category_scores_gemma":[0.0009985687,0.00016548848,0.00013419245,0.00019169699,0.00009375163,0.000058861646,0.00004654021,0.00020944705,0.000060554183],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000046292036,0.0000983,0.00018920419,0.000013251979,0.00005497484,0.000008754461,0.00037878976,0.0000021795327,0.00011203264,0.9925467,0.006338844,0.00021068803],"study_design_scores_gemma":[0.0011310045,0.00009050486,0.00008403845,0.000017662242,0.000030424198,0.000007092474,0.000033745007,0.000008053234,0.003931395,0.987252,0.0071965787,0.0002175112],"about_ca_topic_score_codex":0.0000015091246,"about_ca_topic_score_gemma":5.282396e-7,"teacher_disagreement_score":0.05992609,"about_ca_system_score_codex":0.00003238523,"about_ca_system_score_gemma":0.00002180454,"threshold_uncertainty_score":0.67808396},"labels":[],"label_agreement":null},{"id":"W64826384","doi":"","title":"On Maximal Fractional Independent Sets In Graphs.","year":2008,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Maximal independent set; Combinatorics; Discrete mathematics; Chordal graph; 1-planar graph; Graph","score_opus":0.025472710744579765,"score_gpt":0.27652372380635026,"score_spread":0.2510510130617705,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W64826384","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9864123,0.00003099617,0.00000584857,0.00006323323,0.0016536354,0.0001396553,0.0000047855747,0.000057507423,0.011632054],"genre_scores_gemma":[0.9993117,0.000017231678,0.00028483043,0.0001725471,0.0000072325024,0.000015152332,0.0000036271986,0.0000222959,0.00016541091],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99879706,0.00008066524,0.00024658264,0.00023354552,0.00039851107,0.00024364878],"domain_scores_gemma":[0.99911827,0.0003818651,0.000081345315,0.0003097481,0.000040091596,0.000068692694],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023002748,0.00015859635,0.00020290981,0.0001803353,0.00021171148,0.00000991166,0.00020491621,0.00013517072,0.00021237593],"category_scores_gemma":[0.00017975678,0.00014085673,0.00009110463,0.00019869542,0.00008577014,0.00008901379,0.00007323917,0.00038151516,0.00002690261],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000060621645,0.00021085459,0.012262842,0.000009123553,0.000021875043,0.00009487071,0.00047688646,0.0000046323653,0.000014638629,0.9832031,0.003524313,0.00011623145],"study_design_scores_gemma":[0.0009556141,0.00008205163,0.050553,0.000016907732,0.0000053579865,0.000053959357,0.00002939932,0.000021829768,0.00018263534,0.9477025,0.00024203876,0.00015469413],"about_ca_topic_score_codex":0.000013720854,"about_ca_topic_score_gemma":0.0000051745724,"teacher_disagreement_score":0.03829016,"about_ca_system_score_codex":0.000062298735,"about_ca_system_score_gemma":0.00003099555,"threshold_uncertainty_score":0.5743971},"labels":[],"label_agreement":null},{"id":"W6884549748","doi":"10.1051/ita:2005019/pdf","title":"A note on the Size-Ramsey number of long subdivisions of graphs","year":2005,"lang":"en","type":"article","venue":"Springer Link (Chiba Institute of Technology)","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Graph; 1-planar graph; Subdivision; Pathwidth; Line graph; Block graph; Graph theory; Time complexity; Indifference graph","score_opus":0.01885017634893027,"score_gpt":0.28336875171154086,"score_spread":0.2645185753626106,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6884549748","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.986247,0.00008846744,0.0004955123,0.0017950438,0.00039548508,0.0003384074,0.000021327007,0.00013760176,0.010481182],"genre_scores_gemma":[0.9637459,0.00007577439,0.035909303,0.00007488973,0.000064458785,0.00001453327,7.689957e-7,0.0000281676,0.00008621686],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983609,0.000029137993,0.00071668206,0.00027874726,0.0003262631,0.00028829236],"domain_scores_gemma":[0.9976682,0.00035015034,0.00051602646,0.0012645546,0.00016092697,0.000040152656],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000440935,0.0002494566,0.00052918145,0.00030986944,0.00015387728,0.0000056574972,0.0009219992,0.00040370354,0.000117638396],"category_scores_gemma":[0.0013582979,0.00016775454,0.000284953,0.000658766,0.0012895536,0.00009469238,0.00039464782,0.0005740337,0.000009075547],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000033020933,0.00015641889,0.0048314403,0.000104630446,0.000121917656,0.0000043320297,0.00021666918,0.000022047447,0.0024514392,0.9764005,0.00012208158,0.015535523],"study_design_scores_gemma":[0.00070528866,0.00014333098,0.005220621,0.00048616374,0.000135588,0.000027160975,0.00006693848,0.000060892322,0.16883728,0.81679386,0.007222653,0.00030019123],"about_ca_topic_score_codex":0.000014593383,"about_ca_topic_score_gemma":0.000035668603,"teacher_disagreement_score":0.16638584,"about_ca_system_score_codex":0.00002260317,"about_ca_system_score_gemma":0.00004842686,"threshold_uncertainty_score":0.68408316},"labels":[],"label_agreement":null},{"id":"W6904786165","doi":"10.14288/1.0225773","title":"Business cards and notices of assessment","year":2016,"lang":"en","type":"article","venue":"Open Collections","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Postal service; ATM card; Smart card; Envelope (radar)","score_opus":0.03224081156998347,"score_gpt":0.33165193620711764,"score_spread":0.29941112463713415,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6904786165","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13196424,0.00003773312,0.003377329,0.00050681253,0.00057138735,0.000603094,0.000082040475,0.00003293079,0.86282444],"genre_scores_gemma":[0.9034773,0.000026755219,0.011030281,0.000021450032,0.000040418934,0.000037427886,3.537475e-7,0.000011478751,0.08535451],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995793,0.000039952163,0.0001259758,0.00010196718,0.00007977855,0.00007302881],"domain_scores_gemma":[0.99932176,0.00029776982,0.00006467618,0.00017654467,0.00011337118,0.000025901507],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001736694,0.000056002733,0.00013556259,0.000032794967,0.0006934968,0.00010458637,0.00014226847,0.000031499017,0.00035498655],"category_scores_gemma":[0.0001354373,0.00003314672,0.000020450603,0.0002903278,0.000077831464,0.00010605713,0.0001818626,0.000028258048,2.1188873e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008189977,0.000264813,0.0020707417,0.00016033859,0.00034670494,0.0000037890088,0.00081178517,0.0000074326485,0.0012933232,0.73498386,0.24967606,0.010299223],"study_design_scores_gemma":[0.0010191746,0.00008408962,0.010150672,0.00011086429,0.000098584664,0.0000107101805,0.00026212932,0.000033353306,0.0010544338,0.9643124,0.022688517,0.00017512125],"about_ca_topic_score_codex":0.00033365574,"about_ca_topic_score_gemma":0.00023246718,"teacher_disagreement_score":0.77746993,"about_ca_system_score_codex":0.00001780058,"about_ca_system_score_gemma":0.00005344577,"threshold_uncertainty_score":0.5333887},"labels":[],"label_agreement":null},{"id":"W6929288580","doi":"10.48550/arxiv.2402.17857","title":"Clique Decompositions in Random Graphs via Refined Absorption","year":2024,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Random graph; Random regular graph; Graph; Clique; Binomial (polynomial); Clique number","score_opus":0.06401983762865214,"score_gpt":0.22915174096812102,"score_spread":0.16513190333946887,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6929288580","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9661116,0.00014667367,0.020729784,0.00009459583,0.0010496995,0.000552069,0.00006994805,0.00029444072,0.010951216],"genre_scores_gemma":[0.9976239,0.00021181897,0.0008999598,0.000064048785,0.000078639954,0.0000041392723,0.000050193536,0.000048810278,0.0010184693],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99823,0.00025481745,0.00035608324,0.0007723207,0.00008112837,0.00030566892],"domain_scores_gemma":[0.9985369,0.00029935196,0.0001872446,0.0007919903,0.000081122416,0.00010339797],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004370759,0.0003621563,0.00049284636,0.00068215036,0.0001562116,0.000048501057,0.00050471886,0.0005178464,0.00013003359],"category_scores_gemma":[0.00005998386,0.00037131668,0.00043348724,0.0005270228,0.00014754529,0.00007413116,0.0010155748,0.0011688232,0.00003922461],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019119396,0.00009070109,0.00031901087,0.0003545348,0.00016429476,0.00030804388,0.00039691819,0.005614048,0.00009257388,0.9918385,0.0005003571,0.00012978906],"study_design_scores_gemma":[0.0010061942,0.000026471156,0.00046783453,0.0003015185,0.00023788244,0.000010333902,0.000059878806,0.012849416,0.00008441711,0.98444295,0.00012423209,0.00038884528],"about_ca_topic_score_codex":0.00010115282,"about_ca_topic_score_gemma":0.0002985985,"teacher_disagreement_score":0.031512346,"about_ca_system_score_codex":0.00019782498,"about_ca_system_score_gemma":0.00008495537,"threshold_uncertainty_score":0.9998739},"labels":[],"label_agreement":null},{"id":"W6949123938","doi":"10.5281/zenodo.11579706","title":"Are MD + ACV Gummies Australia the Right Choice for Your Keto Journey?","year":2024,"lang":"en","type":"other","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Taste; Sugar; Calorie; Digestion (alchemy); Blood sugar; Insulin","score_opus":0.11186542537151709,"score_gpt":0.3364109127204927,"score_spread":0.22454548734897564,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6949123938","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00024272664,0.0012367568,0.0011277993,0.0010192747,0.0011906124,0.0016365049,0.0020901994,0.0016647272,0.9897914],"genre_scores_gemma":[0.0036491149,0.0002700281,0.00076514116,0.00022155602,0.0020683527,4.1029614e-7,0.0004532391,0.011931497,0.98064065],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99780995,0.00032341652,0.0003547091,0.00055415404,0.0004627348,0.0004950222],"domain_scores_gemma":[0.99808043,0.00011884717,0.00040960655,0.00094623625,0.00029739353,0.00014746071],"candidate_categories":["metaepi_narrow","sts","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0007955918,0.00036528325,0.00035940934,0.00035041897,0.0017466461,0.000982513,0.0018213234,0.00027300735,0.056087345],"category_scores_gemma":[0.001637167,0.0002554496,0.00021885493,0.0003688369,0.0003160541,0.000081172635,0.0012264237,0.0006633021,0.007614672],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001926319,0.000034718207,4.6463603e-7,0.0004826121,0.00022360007,0.000012599025,0.0006822563,6.350299e-7,0.000024699286,0.10944334,0.88773876,0.0013370657],"study_design_scores_gemma":[0.000261428,0.00006577537,0.000015453472,0.00027522657,0.00013775859,0.00006265686,0.00030154895,0.000008602768,0.00004351092,0.0761535,0.9223795,0.00029503857],"about_ca_topic_score_codex":0.000011988209,"about_ca_topic_score_gemma":0.0000034131615,"teacher_disagreement_score":0.048472673,"about_ca_system_score_codex":0.00009734539,"about_ca_system_score_gemma":0.000003044388,"threshold_uncertainty_score":0.99998975},"labels":[],"label_agreement":null},{"id":"W6950069432","doi":"10.5281/zenodo.7019677","title":"Empria improba","year":2022,"lang":"en","type":"article","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Homonym (biology); Type (biology); Taxon; Nomenclature; Taxonomy (biology)","score_opus":0.05019908940476582,"score_gpt":0.27193473340072966,"score_spread":0.22173564399596385,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6950069432","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3329113,0.0001736063,0.0048003243,0.0012313446,0.0008861613,0.0011947901,0.0006318969,0.0029905646,0.65518],"genre_scores_gemma":[0.99486464,0.000011776112,0.00091445533,0.00023320635,0.00014565386,7.8003985e-8,0.0003166477,0.0013572968,0.002156243],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9983591,0.00043469504,0.00021033364,0.00029459863,0.00040508137,0.00029620895],"domain_scores_gemma":[0.9990742,0.000046129975,0.0000953375,0.00050932536,0.00017344582,0.00010156597],"candidate_categories":["sts","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000913537,0.00011271245,0.00012627667,0.00016260985,0.0059901816,0.00022755921,0.0010695688,0.000031886753,0.03821711],"category_scores_gemma":[0.0005316487,0.00011355986,0.00006836397,0.00039402215,0.00010846612,0.00009709401,0.0027924431,0.00035739876,0.0006068162],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007361579,0.00012875305,0.0000027759013,0.00005047004,0.000055597968,0.000017949518,0.0033660084,0.000025349293,0.0017813927,0.62877166,0.3207171,0.045009356],"study_design_scores_gemma":[0.00032361576,0.00016208296,0.000087722925,0.0000036276556,0.000012290497,0.00015015462,0.0005297032,0.000087665074,0.00016788517,0.112882644,0.8854517,0.00014092133],"about_ca_topic_score_codex":0.000003914168,"about_ca_topic_score_gemma":6.012628e-8,"teacher_disagreement_score":0.66195333,"about_ca_system_score_codex":0.00012913774,"about_ca_system_score_gemma":0.0000021883545,"threshold_uncertainty_score":0.99530387},"labels":[],"label_agreement":null},{"id":"W6950556123","doi":"10.5281/zenodo.7608965","title":"Geography Played on an N-cycle Times a 4-Cycle","year":2003,"lang":"en","type":"article","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Prince Edward Island","funders":"","keywords":"Product (mathematics); Cartesian product; Vertex (graph theory); Sketch; Game theory","score_opus":0.030066424766176856,"score_gpt":0.2686872998286557,"score_spread":0.23862087506247884,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6950556123","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44981447,0.000050518924,0.0011262684,0.00014549804,0.00019830914,0.00052290235,0.00013095391,0.001262864,0.5467482],"genre_scores_gemma":[0.9965379,0.000022122362,0.0013346173,0.00021327799,0.00008985815,5.1160193e-8,0.00015776396,0.0011306924,0.00051370956],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99796146,0.0005940026,0.00024652664,0.00041388284,0.00038364765,0.00040048742],"domain_scores_gemma":[0.99867505,0.000077083765,0.00010025463,0.00071313255,0.00022695573,0.00020754612],"candidate_categories":["sts","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0008233368,0.0001851541,0.00017802966,0.00027244975,0.0026119016,0.00037377974,0.0007573749,0.00008838344,0.014839466],"category_scores_gemma":[0.00087407464,0.00017099181,0.000091751404,0.00041983434,0.00018098006,0.00020468999,0.00032603618,0.00028838633,0.0012516833],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000112341746,0.00035627256,0.000010387352,0.000050436796,0.00008522239,0.000016380194,0.0019233134,0.00005518407,0.00080247887,0.93447584,0.044421043,0.017691081],"study_design_scores_gemma":[0.00079496985,0.0005673075,0.00046028823,0.00002916872,0.000027729808,0.00009262516,0.00042055055,0.00020564295,0.0011313735,0.269254,0.72667724,0.00033907755],"about_ca_topic_score_codex":0.0000038225535,"about_ca_topic_score_gemma":1.7306397e-7,"teacher_disagreement_score":0.6822562,"about_ca_system_score_codex":0.000045836656,"about_ca_system_score_gemma":0.000002291374,"threshold_uncertainty_score":0.99952596},"labels":[],"label_agreement":null},{"id":"W6966298626","doi":"10.4230/lipics.approx/random.2024.67","title":"Explicit and Near-Optimal Construction of t-Rankwise Independent Permutations","year":2024,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Permutation (music); Random permutation; Order (exchange); Set (abstract data type); Random variable; Upper and lower bounds","score_opus":0.01949977994498601,"score_gpt":0.29544373984220373,"score_spread":0.2759439598972177,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6966298626","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96754843,0.00018383609,0.026532954,0.00010926996,0.0009385679,0.0008103493,0.00067043153,0.00017499163,0.0030311653],"genre_scores_gemma":[0.96125126,0.000062545565,0.03812035,0.000090563764,0.00010068095,0.00006760288,0.00009568813,0.000049024122,0.00016229023],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99799436,0.000033193635,0.0009942928,0.00021453455,0.00038323874,0.00038036134],"domain_scores_gemma":[0.9986601,0.00038045345,0.00024929395,0.00039590776,0.0001834557,0.00013079187],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00045613584,0.00030452752,0.0004152273,0.00025461227,0.00038521478,0.0002531898,0.00025156108,0.00022459381,0.00009056766],"category_scores_gemma":[0.00014847932,0.0002525132,0.00023168685,0.00022310765,0.0003244945,0.00071369944,0.00019726777,0.0003620832,0.000010362969],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012766523,0.000104487204,0.0018383699,0.0025896193,0.0004172629,0.000006395987,0.037258882,0.000057009653,0.00014195709,0.9460194,0.0013984856,0.010040483],"study_design_scores_gemma":[0.007016294,0.0009695109,0.0024986102,0.0015701957,0.0009840612,0.001388081,0.028383575,0.10519618,0.005881178,0.7938876,0.050239135,0.0019855376],"about_ca_topic_score_codex":0.0000068269587,"about_ca_topic_score_gemma":0.0000048566862,"teacher_disagreement_score":0.15213174,"about_ca_system_score_codex":0.000053412205,"about_ca_system_score_gemma":0.000067235116,"threshold_uncertainty_score":0.9999927},"labels":[],"label_agreement":null},{"id":"W6976844737","doi":"10.60692/ef9hg-f1e29","title":"Re-creation of a Key Step in the Evolutionary Switch from C3 to C4 Leaf Anatomy","year":2017,"lang":"en","type":"article","venue":"Greater South Information System","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Chloroplast; Organelle; Key (lock); Photosynthesis; Extant taxon; Vascular bundle","score_opus":0.03927936874627914,"score_gpt":0.2729897465901693,"score_spread":0.23371037784389015,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6976844737","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97120386,0.000004338893,0.0063173436,0.00015716559,0.00030921222,0.0005975861,0.00014030925,0.000048704453,0.021221481],"genre_scores_gemma":[0.9976064,1.3672809e-7,0.0020773099,0.000109446344,0.00007983337,0.000051845716,0.000013366391,0.000008113456,0.000053562082],"study_design_codex":"qualitative","study_design_gemma":"observational","domain_scores_codex":[0.9985551,0.00011518366,0.00065029645,0.00011768618,0.00039547446,0.00016623591],"domain_scores_gemma":[0.9982106,0.00005683799,0.00054916344,0.0009954509,0.00014590131,0.000042043157],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006607646,0.00014737519,0.0002503959,0.00020157108,0.00034403766,0.0001330503,0.0005584861,0.00011382966,0.000026436726],"category_scores_gemma":[0.00017682128,0.0000958275,0.0000773435,0.000110002075,0.00005056189,0.00055974023,0.00012396151,0.00010605139,0.00005561372],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025873404,0.000009037438,0.32791334,0.00054861343,0.00009906825,0.0000049246405,0.5634988,0.00006293846,0.0000028035383,0.1042888,0.001887535,0.0014253808],"study_design_scores_gemma":[0.0024078416,0.000106155545,0.8575914,0.00084809476,0.00009980393,0.000020370333,0.123842284,0.0038923072,0.0003356109,0.008488519,0.0018764093,0.0004912264],"about_ca_topic_score_codex":0.00011211155,"about_ca_topic_score_gemma":0.0000075877165,"teacher_disagreement_score":0.52967805,"about_ca_system_score_codex":0.00006739321,"about_ca_system_score_gemma":0.000021984446,"threshold_uncertainty_score":0.39077318},"labels":[],"label_agreement":null},{"id":"W6979260094","doi":"","title":"Counting big Ramsey degrees of the homogeneous and universal $K_4$-free graph","year":2025,"lang":"en","type":"article","venue":"ArXiv.org","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Grantová Agentura České Republiky; European Commission","keywords":"Homogeneous; Graph; Binary number; Ramsey theory; Extension (predicate logic)","score_opus":0.03087822856269562,"score_gpt":0.2542728648371103,"score_spread":0.2233946362744147,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6979260094","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99342185,0.00044189024,0.0002551625,0.00016292978,0.00046263903,0.00013866919,0.000012255528,0.000038931044,0.0050656954],"genre_scores_gemma":[0.99832773,0.00005774308,0.0006328074,0.00011863847,0.00004868939,0.000002173298,5.086355e-7,0.00001324924,0.00079848734],"study_design_codex":"observational","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99922764,0.00006834085,0.00021022734,0.00017697863,0.00013944124,0.00017736618],"domain_scores_gemma":[0.9988007,0.00036066244,0.00012033592,0.0006209668,0.00007025425,0.000027107313],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022419322,0.00013310854,0.00019921958,0.00008609732,0.0002759338,0.000013946156,0.00045310284,0.00009251956,0.000015287276],"category_scores_gemma":[0.0003893196,0.000089018475,0.00010372703,0.00027788943,0.0003045162,0.000037535196,0.0004275476,0.00015652794,5.8302714e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003477339,0.0000404929,0.6038259,0.00018446945,0.00019096956,0.000007675326,0.0010760977,0.000019113315,0.001602729,0.38945034,0.0013060962,0.0022612992],"study_design_scores_gemma":[0.0012103105,0.00005253719,0.36389524,0.00024681794,0.0002880757,0.000022040782,0.0011329814,0.00012697361,0.0076272017,0.6224406,0.002652404,0.00030484062],"about_ca_topic_score_codex":0.00005172792,"about_ca_topic_score_gemma":0.000102050515,"teacher_disagreement_score":0.2399307,"about_ca_system_score_codex":0.000013537669,"about_ca_system_score_gemma":0.000035135145,"threshold_uncertainty_score":0.3630068},"labels":[],"label_agreement":null},{"id":"W6983450213","doi":"","title":"On the minimum order of k-cop-win graph","year":2012,"lang":"en","type":"preprint","venue":"University of Minnesota Digital Conservancy (University of Minnesota)","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Line graph; Block graph; Graph; Comparability graph; Cubic graph; Graph isomorphism; Distance-hereditary graph; Graph power; Voltage graph","score_opus":0.028524697646758527,"score_gpt":0.2153898414139273,"score_spread":0.18686514376716878,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6983450213","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.966251,0.00031227453,0.0011502692,0.0010525514,0.00049455784,0.0008393659,0.0015981094,0.00007530545,0.028226564],"genre_scores_gemma":[0.99312186,0.00027296753,0.0030540132,0.000042149284,0.000043497923,1.7517326e-7,0.00008382195,0.00005294929,0.003328541],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99711674,0.00027906793,0.00051090115,0.00070601114,0.00082238024,0.0005648691],"domain_scores_gemma":[0.99351424,0.0020517772,0.0015728155,0.0017703117,0.0008712705,0.0002195928],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00056895235,0.0006645701,0.0014016695,0.0005623439,0.00048600303,0.000021812577,0.0023868296,0.0007074316,0.0008707075],"category_scores_gemma":[0.00040975728,0.0006783817,0.0010655726,0.00061282475,0.0022612931,0.0005056219,0.0024608774,0.00078595994,0.000018314853],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0036142406,0.00261622,0.010417968,0.0045293304,0.0038111284,0.00027026716,0.032783274,0.00010666736,0.00056764344,0.8459333,0.0905844,0.004765533],"study_design_scores_gemma":[0.008126713,0.0011602531,0.012816178,0.0037682613,0.0036748522,0.00007865894,0.077826485,0.0004136505,0.001279966,0.8201603,0.06676413,0.003930514],"about_ca_topic_score_codex":0.0003603155,"about_ca_topic_score_gemma":0.0002229449,"teacher_disagreement_score":0.04504321,"about_ca_system_score_codex":0.00008865987,"about_ca_system_score_gemma":0.00026587103,"threshold_uncertainty_score":0.99956673},"labels":[],"label_agreement":null},{"id":"W6992582472","doi":"","title":"On the Logarithimic Calculus and Sidorenko's Conjecture","year":2011,"lang":"en","type":"dissertation","venue":"Library and Archives Canada (Government of Canada)","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Conjecture; Forcing (mathematics); Bipartite graph; Logarithm; Vertex (graph theory); Type (biology)","score_opus":0.006073161322805474,"score_gpt":0.1656709988519777,"score_spread":0.15959783752917223,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6992582472","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43345016,0.00049734954,0.000007433152,0.0008352866,0.0006184221,0.00034221122,0.0002822513,0.000013182095,0.5639537],"genre_scores_gemma":[0.9712005,0.0001841459,0.00021838641,0.001151301,0.0000601251,0.0000109451985,0.000023372064,0.0000432517,0.027107976],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981594,0.00008789804,0.00026962403,0.0002672151,0.0009815338,0.00023434905],"domain_scores_gemma":[0.99835503,0.00095269183,0.00025276857,0.00029961363,6.3269016e-7,0.00013923719],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000015425623,0.0003042137,0.00034366382,0.000024030816,0.0003377131,0.000020323754,0.00027482616,0.0000955804,0.00010829087],"category_scores_gemma":[0.000017535236,0.00019942463,0.00004256591,0.00003890734,0.00011259715,0.000068881316,0.000087749395,0.0003815025,8.996795e-10],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034199312,0.000009831589,0.00021528022,0.0002981211,0.00012495197,0.000031372987,0.00051420694,5.9588535e-7,0.00025378933,0.9941469,0.00225297,0.0018100208],"study_design_scores_gemma":[0.00033240573,0.00012462835,0.007760044,0.00039572414,0.0001363277,0.000013425757,0.004627674,0.00008948834,0.02919136,0.95088,0.0059558796,0.0004930278],"about_ca_topic_score_codex":0.0009750393,"about_ca_topic_score_gemma":0.036168084,"teacher_disagreement_score":0.5377503,"about_ca_system_score_codex":0.0000033501858,"about_ca_system_score_gemma":0.0005963008,"threshold_uncertainty_score":0.9814193},"labels":[],"label_agreement":null},{"id":"W7000867149","doi":"","title":"Hypergraph Capacity with Applications to Matrix Multiplication","year":2013,"lang":"en","type":"article","venue":"Scholarship - Claremont (Claremont Colleges)","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Hypergraph; Upper and lower bounds; Set (abstract data type); Matrix multiplication; Matrix (chemical analysis); Multiplication (music)","score_opus":0.0415896441113883,"score_gpt":0.3011813436100197,"score_spread":0.25959169949863137,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7000867149","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9667443,0.0003921099,0.01486927,0.0024321496,0.00028983847,0.006707978,0.00016291923,0.0007950343,0.007606393],"genre_scores_gemma":[0.8982426,0.000025175195,0.09707016,0.00087996013,0.00026241518,0.0017611732,0.00002945199,0.00014939164,0.0015796989],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99573386,0.00034974303,0.0008439755,0.0011221296,0.0009945808,0.00095569127],"domain_scores_gemma":[0.9952915,0.0005330714,0.00035626744,0.0021411667,0.000951683,0.00072633557],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009559122,0.00069527095,0.00071519415,0.0005279186,0.0012782998,0.00035652527,0.0012143836,0.00049548096,0.00032684533],"category_scores_gemma":[0.0005582995,0.00056275574,0.00028389267,0.0014365044,0.0002223485,0.0008372417,0.00030774716,0.0010460054,0.00032616654],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00045348256,0.00091708696,0.033324376,0.00048071778,0.00057519204,0.000033025597,0.0026346997,0.0001775082,0.017631894,0.915655,0.013080653,0.0150363175],"study_design_scores_gemma":[0.0030893437,0.0005245571,0.07722639,0.0003316294,0.0003524416,0.00020615757,0.0012420407,0.0004057023,0.0064521814,0.8555486,0.052219376,0.0024015473],"about_ca_topic_score_codex":0.00019029582,"about_ca_topic_score_gemma":0.00038456375,"teacher_disagreement_score":0.08220089,"about_ca_system_score_codex":0.000294234,"about_ca_system_score_gemma":0.000101837766,"threshold_uncertainty_score":0.99968237},"labels":[],"label_agreement":null},{"id":"W7006516905","doi":"","title":"Trois résultats en théorie des graphes","year":2022,"lang":"fr","type":"dissertation","venue":"Papyrus : Institutional Repository (Université de Montréal)","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Conjecture; Graph; Ordered set; Order (exchange)","score_opus":0.007015531797820131,"score_gpt":0.19960163733077477,"score_spread":0.19258610553295463,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7006516905","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.89699453,0.03044017,0.0002995406,0.00018983694,0.003945007,0.0006584188,0.0005985811,0.00022409263,0.06664982],"genre_scores_gemma":[0.86950284,0.0024674688,0.0041038445,0.00011091817,0.00045261477,0.0000887985,0.0012212577,0.000127639,0.121924594],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99577916,0.0006069625,0.0007366661,0.00091899367,0.0011609304,0.0007973112],"domain_scores_gemma":[0.99691814,0.0008278537,0.0006963741,0.00075593055,0.00035701963,0.00044468147],"candidate_categories":["metaepi_narrow","sts","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00048207454,0.00084292586,0.0007916703,0.0005574136,0.024951795,0.00009303286,0.0010330477,0.0007097594,0.0010176651],"category_scores_gemma":[0.0003209033,0.0009329645,0.00089076464,0.0006891458,0.00081732793,0.00046059644,0.00056743925,0.0011348473,0.000041793],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":true,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012010398,0.0003876199,0.010634798,0.0008058485,0.0012923557,0.0028785157,0.2151274,0.0012137044,0.0028731092,0.7562177,0.0013309739,0.0060369456],"study_design_scores_gemma":[0.003296132,0.0006303665,0.0533822,0.0008307059,0.0030388238,0.0032528755,0.32213113,0.0010590309,0.009704742,0.4610145,0.13888155,0.0027779473],"about_ca_topic_score_codex":0.019023508,"about_ca_topic_score_gemma":0.00611539,"teacher_disagreement_score":0.29520318,"about_ca_system_score_codex":0.0067464705,"about_ca_system_score_gemma":0.0013778182,"threshold_uncertainty_score":0.9998955},"labels":[],"label_agreement":null},{"id":"W7011078674","doi":"","title":"Local stability method for hypergraph Turán problems","year":2016,"lang":"en","type":"dissertation","venue":"eScholarship@McGill (McGill)","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Hypergraph; Bipartite graph; Conjecture; Partition (number theory); Vertex (graph theory); Graph; Existential quantification; Stability (learning theory)","score_opus":0.034328373658662946,"score_gpt":0.3002690330510484,"score_spread":0.2659406593923855,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7011078674","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8006763,0.0008269259,0.000690563,0.00005388824,0.0074761286,0.007111533,0.010389287,0.0013430978,0.17143227],"genre_scores_gemma":[0.9325029,0.00018396736,0.053039566,0.00027438765,0.00021871844,0.0013606494,0.0007954565,0.00075699924,0.010867319],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99332476,0.0008660517,0.0016573627,0.0018419182,0.0010445192,0.0012654038],"domain_scores_gemma":[0.99274087,0.0029385164,0.001064771,0.0018512375,0.0009448665,0.0004597531],"candidate_categories":["metaepi_narrow","sts","research_integrity"],"consensus_categories":["metaepi_narrow"],"category_scores_codex":[0.003429767,0.00133569,0.0016400061,0.0004805394,0.0021653362,0.000086203916,0.0013218451,0.0017713106,0.0005470414],"category_scores_gemma":[0.0028659955,0.0010419043,0.0013220012,0.0004701582,0.00020692311,0.0005237203,0.00023297613,0.001566887,0.000039948],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004922813,0.00020802842,0.000008997096,0.0021265622,0.00050046685,0.000008320307,0.00003925705,0.0000020488076,0.013943447,0.8190559,0.000026444459,0.16358824],"study_design_scores_gemma":[0.0012498931,0.00022213736,0.00006723944,0.0005291886,0.00049296406,0.000020884845,0.00026517213,0.000018097608,0.08791133,0.8666819,0.041271932,0.0012693099],"about_ca_topic_score_codex":0.00007028735,"about_ca_topic_score_gemma":0.00065783196,"teacher_disagreement_score":0.16231893,"about_ca_system_score_codex":0.0005674304,"about_ca_system_score_gemma":0.000084638836,"threshold_uncertainty_score":0.99993944},"labels":[],"label_agreement":null},{"id":"W7023787582","doi":"","title":"Phosphorus, nitrogen, and carbon nutrition in fresh and starved gametophytes of the red alga Porphyra purpurea (Roth) C. Agardh and occurrence of polyphosphates","year":2000,"lang":"en","type":"other","venue":"Library and Archives Canada (Government of Canada)","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Gametophyte; Porphyra; Carbon fibers; Pigment; Algae","score_opus":0.0039074978001934985,"score_gpt":0.1567141851935818,"score_spread":0.1528066873933883,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7023787582","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7099192,0.032272127,0.0000017584863,0.00047387357,0.0002170203,0.0010436815,0.003354858,0.000014683552,0.25270277],"genre_scores_gemma":[0.98541975,0.0074274614,0.0010723985,0.00014012786,0.000034479966,0.000013982681,0.000010985781,0.0000762428,0.0058045974],"study_design_codex":"observational","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99840146,0.00008414988,0.00036577415,0.00026210275,0.0006864071,0.00020007993],"domain_scores_gemma":[0.99897444,0.00028652375,0.00037482218,0.00025731983,8.0572937e-7,0.00010607694],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000019301453,0.00026400285,0.0005236068,0.000052800227,0.000057239933,0.000010164132,0.00017543591,0.00008216682,0.00003464793],"category_scores_gemma":[0.00000901077,0.00020654904,0.00003119641,0.00007776697,0.00036527467,0.000060240087,0.00016002504,0.00016341358,7.659871e-11],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0036335422,0.0003838351,0.46516776,0.0128641045,0.0014399433,0.00013357255,0.0020329412,0.0000037948407,0.012188167,0.4359879,0.0413446,0.024819864],"study_design_scores_gemma":[0.005584679,0.00064407755,0.10031177,0.008214245,0.0005828344,0.00006110897,0.0053028157,0.00037834936,0.2576408,0.55860484,0.06054623,0.0021282604],"about_ca_topic_score_codex":0.0049848775,"about_ca_topic_score_gemma":0.013031639,"teacher_disagreement_score":0.36485597,"about_ca_system_score_codex":0.0000031834475,"about_ca_system_score_gemma":0.00025358968,"threshold_uncertainty_score":0.84228253},"labels":[],"label_agreement":null},{"id":"W7024165025","doi":"","title":"Power Corporation Of Canada Is Still A Buy (OTCMKTS:PWCDF)","year":2020,"lang":"en","type":"other","venue":"","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Corporation; Power (physics); Work (physics); Government (linguistics)","score_opus":0.017365179171096784,"score_gpt":0.2425283518044242,"score_spread":0.2251631726333274,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7024165025","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00008459497,0.0001353063,0.0005311329,0.00029618718,0.00060115266,0.0002627558,0.00026195528,0.0000830304,0.9977439],"genre_scores_gemma":[0.023929145,0.000023157592,0.006585651,0.0013933209,0.00018695774,0.000005236281,0.000021486609,0.00035206793,0.96750295],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9989473,0.00003337766,0.00028555468,0.00022819375,0.00035162238,0.00015393468],"domain_scores_gemma":[0.9990182,0.00008282574,0.00036716805,0.0004103749,0.000040922503,0.00008053398],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00006473431,0.00023263373,0.0004174758,0.00007509584,0.0000270782,0.000008932815,0.0002287598,0.000214933,0.025438303],"category_scores_gemma":[0.000101486825,0.00017581358,0.00008522179,0.00010629936,0.0000535581,0.000015103531,0.00007719211,0.00015636387,0.0000049318382],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005696178,0.0000067942706,0.0000120181485,0.00012725774,0.000084773375,0.0000051629822,0.0002063149,5.688964e-8,0.000008268373,0.29693338,0.7025707,0.00003962303],"study_design_scores_gemma":[0.00016690514,0.00003315967,0.000010042245,0.00007775522,0.00004506274,0.0000026954592,0.00007105583,0.000011732383,0.0002905427,0.1890056,0.81004703,0.00023842603],"about_ca_topic_score_codex":0.06442694,"about_ca_topic_score_gemma":0.16835137,"teacher_disagreement_score":0.107927784,"about_ca_system_score_codex":0.000032386262,"about_ca_system_score_gemma":0.000265906,"threshold_uncertainty_score":0.9754526},"labels":[],"label_agreement":null},{"id":"W7024200949","doi":"","title":"Reports of the proprietors and managers.","year":2014,"lang":"en","type":"article","venue":"QSpace (Queen's University Library)","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Lunatic; Government (linguistics); Order (exchange); State (computer science); Appropriation; Begging; Embezzlement","score_opus":0.005987863434457492,"score_gpt":0.17973946933059165,"score_spread":0.17375160589613417,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7024200949","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9477845,0.0000067164483,0.00027229925,0.01090261,0.00025405633,0.00024083494,0.0000045526485,0.000119262964,0.0404152],"genre_scores_gemma":[0.9628898,0.000019312456,0.003575373,0.00009136135,0.000027833628,1.4466723e-7,8.2632016e-7,0.000016264337,0.033379067],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99927837,0.00012314765,0.00010829916,0.00019581219,0.0001547334,0.00013961243],"domain_scores_gemma":[0.99909914,0.00012349886,0.00017858564,0.0005185651,0.000018200793,0.000062024075],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000082217324,0.00011534035,0.0001757215,0.00007530142,0.00020707444,0.000015536361,0.00023576959,0.00008506094,0.000071172086],"category_scores_gemma":[0.000079147685,0.00008318447,0.000089657064,0.00019784067,0.0002527592,0.00030202864,0.00045771882,0.00013698621,5.104842e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000038646576,0.000029765046,0.036237013,0.00017551001,0.00006560729,0.00004877071,0.0012457747,0.0000028741083,0.000011829694,0.89141,0.07033169,0.00040252059],"study_design_scores_gemma":[0.00043821946,0.00010109958,0.044467617,0.00011696108,0.00015145313,0.0000073483616,0.0012054559,0.000010011383,0.006272499,0.70839566,0.23843975,0.00039389887],"about_ca_topic_score_codex":0.000111569694,"about_ca_topic_score_gemma":0.0000025242518,"teacher_disagreement_score":0.18301432,"about_ca_system_score_codex":0.000009153871,"about_ca_system_score_gemma":0.000020851488,"threshold_uncertainty_score":0.33921644},"labels":[],"label_agreement":null},{"id":"W7024606953","doi":"","title":"Studi literatur: hubungan antara fleksibilitas anterior columna vertebralis segmen lumbalis dengan tingkat disabilitas pada pasien nyeri punggung bawah","year":2020,"lang":"id","type":"dissertation","venue":"Widya Mandala Catholic University Surabaya Repository (Widya Mandala Catholic University Surabaya)","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Nucleofection; Pretext; Fusible alloy","score_opus":0.01155517872983125,"score_gpt":0.22239096912950157,"score_spread":0.21083579039967032,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7024606953","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96734345,0.0018099183,0.00006785966,0.0006801047,0.005342597,0.0044903797,0.0032614004,0.0012946451,0.015709622],"genre_scores_gemma":[0.9276571,0.0019853963,0.0010594382,0.00026659403,0.0010490649,0.000014190457,0.0035954176,0.00062099204,0.06375181],"study_design_codex":"qualitative","study_design_gemma":"not_applicable","domain_scores_codex":[0.9784056,0.0052253073,0.003029954,0.006171237,0.003438718,0.0037292035],"domain_scores_gemma":[0.9840042,0.0020898401,0.0036270504,0.0052738576,0.0023309002,0.0026741705],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science","research_integrity"],"consensus_categories":["metaepi_narrow","sts","research_integrity"],"category_scores_codex":[0.002378599,0.004543021,0.005817634,0.00231468,0.009007012,0.001466804,0.0059002573,0.003358132,0.0003259736],"category_scores_gemma":[0.0009600579,0.0055060107,0.0038899248,0.003790952,0.0029809338,0.0034821727,0.0034264775,0.0051851887,0.00012645873],"study_design_candidate":"qualitative","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":true,"about_ca_system_consensus":false,"study_design_scores_codex":[0.011760353,0.0047528725,0.096947685,0.012921038,0.011142408,0.035912216,0.77707666,0.000100508805,0.03017566,0.0068511437,0.0062682983,0.0060911635],"study_design_scores_gemma":[0.02349032,0.0040482627,0.1465108,0.0071409806,0.019524865,0.0044790125,0.17267105,0.0014819134,0.010915491,0.0006794966,0.590422,0.018635865],"about_ca_topic_score_codex":0.0046564904,"about_ca_topic_score_gemma":0.0030233008,"teacher_disagreement_score":0.60440564,"about_ca_system_score_codex":0.0042182095,"about_ca_system_score_gemma":0.001900201,"threshold_uncertainty_score":0.9997324},"labels":[],"label_agreement":null},{"id":"W7025251217","doi":"","title":"Visual Culture in Translation : The Reception of the Benin Bronzes on the Verge of Modernity","year":2012,"lang":"en","type":"dissertation","venue":"PEARL (University of Plymouth)","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Modernity; Visual culture; Punitive damages; Ethnography; German; Reputation; Quarter (Canadian coin); Period (music); Panorama","score_opus":0.034939374772527815,"score_gpt":0.26180448083742286,"score_spread":0.22686510606489504,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7025251217","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96925443,0.00016609879,0.0000516857,0.00010380403,0.00022482299,0.0003585971,0.00007644789,0.000008270333,0.029755821],"genre_scores_gemma":[0.99083215,0.000018434092,0.00011817275,0.0000054768093,0.00003022449,4.3675698e-7,0.000048321286,0.000012471357,0.008934325],"study_design_codex":"qualitative","study_design_gemma":"qualitative","domain_scores_codex":[0.99885803,0.00030431198,0.00020370021,0.00013268525,0.00037960557,0.0001216437],"domain_scores_gemma":[0.9987497,0.00027314766,0.0005191125,0.0003371115,0.00010359635,0.000017366718],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004539239,0.00015380644,0.00027244375,0.00008245647,0.00023128705,0.0000039623787,0.000497668,0.00025703295,0.0002259252],"category_scores_gemma":[0.00007811617,0.0000897941,0.00025550308,0.0001966486,0.0001739449,0.00008259552,0.00004310592,0.00038920032,0.0000011961769],"study_design_candidate":"qualitative","study_design_consensus":"qualitative","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00093124754,0.00030030278,0.000542003,0.000659987,0.0002337271,4.502521e-7,0.8579146,0.00007951086,0.0048426157,0.12549016,0.0005653361,0.0084400205],"study_design_scores_gemma":[0.0012825191,0.0002057081,0.10189039,0.00096694415,0.0008468821,0.0000014090122,0.7233372,0.0007278968,0.0008750117,0.16928767,0.00012932425,0.00044909678],"about_ca_topic_score_codex":0.003025258,"about_ca_topic_score_gemma":0.004043211,"teacher_disagreement_score":0.13457748,"about_ca_system_score_codex":0.000029131801,"about_ca_system_score_gemma":0.000034017314,"threshold_uncertainty_score":0.45733052},"labels":[],"label_agreement":null},{"id":"W7033996448","doi":"","title":"On some Density Theorems in Number Theory and Group Theory","year":2012,"lang":"en","type":"other","venue":"Open MIND","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Université de Montréal","keywords":"Group theory; Dimension (graph theory); Additive group; Number theory","score_opus":0.029688143455560506,"score_gpt":0.3199028580346177,"score_spread":0.29021471457905723,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7033996448","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028532518,0.00042333265,0.000046972003,0.000007701538,0.00044481683,0.00082934886,0.00026238873,0.000010978149,0.96944195],"genre_scores_gemma":[0.10756123,0.0001166246,0.0062351855,0.00028709904,0.0005903535,0.00006560987,0.0000987047,0.0008234601,0.88422173],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977191,0.00084588095,0.00029066915,0.00051360606,0.00021750786,0.000413252],"domain_scores_gemma":[0.9968633,0.0019147871,0.0002608554,0.00082769233,0.00001253967,0.00012081329],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0024372493,0.00046882857,0.00066723424,0.000178029,0.00010427708,0.000097232856,0.00067561056,0.0005461434,0.15343909],"category_scores_gemma":[0.00034677138,0.00032688482,0.00012219597,0.00009205684,0.00034240508,0.00011706129,0.00064798025,0.0005086738,0.00044408324],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023799892,0.00011588677,0.00013927087,0.000036004538,0.00013577603,0.000020372772,0.00089712907,2.4010562e-8,0.0000034424527,0.91811633,0.054089937,0.026207851],"study_design_scores_gemma":[0.0004817378,0.000031692503,0.0001786918,0.00030931938,0.0000740734,0.000023516168,0.0001317903,5.178908e-7,0.000025002539,0.9184574,0.07987488,0.00041141553],"about_ca_topic_score_codex":0.000023950846,"about_ca_topic_score_gemma":0.00008121812,"teacher_disagreement_score":0.152995,"about_ca_system_score_codex":0.000042017316,"about_ca_system_score_gemma":0.000024917043,"threshold_uncertainty_score":0.99991834},"labels":[],"label_agreement":null},{"id":"W7069370103","doi":"","title":"Covering systems","year":2022,"lang":"fr","type":"dissertation","venue":"Papyrus : Institutional Repository (Université de Montréal)","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Fonds de recherche du Québec – Nature et technologies","keywords":"Coin flipping; Context (archaeology); General interest","score_opus":0.007375973917635002,"score_gpt":0.19015900079636522,"score_spread":0.18278302687873021,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7069370103","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.77995926,0.062936604,0.00032593205,0.00009041468,0.011753157,0.0008283194,0.00038986097,0.00022702196,0.14348945],"genre_scores_gemma":[0.7173372,0.0009819886,0.0006310753,0.000066182605,0.00045540003,0.00007406815,0.000609209,0.00010045137,0.27974442],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9962758,0.0003954326,0.00070627086,0.00078893185,0.0011645438,0.0006690495],"domain_scores_gemma":[0.99742603,0.00042030265,0.0007812011,0.0007532825,0.0002525789,0.0003666309],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.00041474463,0.00068919,0.0007424256,0.00041172805,0.0229175,0.000115091505,0.00083936163,0.00061987486,0.0006644724],"category_scores_gemma":[0.0001406654,0.00080601836,0.00060035125,0.0004088179,0.00031684607,0.00033552732,0.00061021623,0.0010206621,0.00006076949],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":true,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000788613,0.00023835452,0.004179231,0.0013499717,0.0010729615,0.0037282794,0.098916896,0.012616996,0.0031351421,0.8708738,0.001846965,0.001252764],"study_design_scores_gemma":[0.0025500236,0.00036459457,0.00947332,0.0011637892,0.0021308542,0.0052606417,0.2795685,0.008581216,0.0030187187,0.017407741,0.66796017,0.0025204679],"about_ca_topic_score_codex":0.03201391,"about_ca_topic_score_gemma":0.0017839177,"teacher_disagreement_score":0.8534661,"about_ca_system_score_codex":0.009760633,"about_ca_system_score_gemma":0.0013320764,"threshold_uncertainty_score":0.99943906},"labels":[],"label_agreement":null},{"id":"W7093370050","doi":"10.1016/j.jalgebra.2025.09.036","title":"On the number and sizes of double cosets of Sylow subgroups of the symmetric group","year":2025,"lang":"en","type":"article","venue":"Journal of Algebra","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"European Commission; National Science Foundation","keywords":"Sylow theorems; Modulo; Coset; Symmetric group; Complement (music)","score_opus":0.015192795414910311,"score_gpt":0.2741512183042514,"score_spread":0.25895842288934107,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7093370050","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9941835,0.00044989173,0.000044674525,0.0002954788,0.00030525302,0.00011668576,0.0000064239293,0.0000019859262,0.00459611],"genre_scores_gemma":[0.9993164,0.00010405058,0.00034566675,0.000095488846,0.000029287396,6.499049e-7,8.238665e-8,0.000007745696,0.00010064865],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988308,0.00011552396,0.0005634763,0.00006270873,0.00033097566,0.00009652371],"domain_scores_gemma":[0.9970337,0.001728421,0.0007517989,0.00029373335,0.00016838378,0.000023954797],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007380868,0.00009877545,0.00035914293,0.00012959413,0.00007121718,0.000009177199,0.00038363677,0.00006198366,0.000054292443],"category_scores_gemma":[0.00048603336,0.000045429093,0.00020536716,0.00044564228,0.00021663848,0.00004952284,0.00011376525,0.00023547282,1.6682242e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020338471,0.00010778192,0.009786984,0.00018963341,0.00022747095,0.0000012057444,0.0005192636,0.0000023821315,0.0005411517,0.9857567,0.0019646734,0.0006993581],"study_design_scores_gemma":[0.00094440137,0.000133505,0.043204967,0.0003094012,0.00016737352,0.00002440246,0.00026107885,0.000012529854,0.015390718,0.93938315,0.000114827424,0.000053649776],"about_ca_topic_score_codex":0.0000049468244,"about_ca_topic_score_gemma":0.0000035015562,"teacher_disagreement_score":0.046373565,"about_ca_system_score_codex":0.000012795877,"about_ca_system_score_gemma":0.000031207543,"threshold_uncertainty_score":0.18525447},"labels":[],"label_agreement":null},{"id":"W7097443577","doi":"","title":"Bondy’s Theorem","year":2013,"lang":"en","type":"article","venue":"","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"OpenPGP card; Smart card; Java Card; Lemma (botany); Contactless smart card","score_opus":0.023446138905660576,"score_gpt":0.2739525915584882,"score_spread":0.25050645265282767,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7097443577","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41755772,0.000019464927,0.0012640092,0.00024654064,0.00016579231,0.00014142219,5.762272e-7,0.00013728325,0.58046716],"genre_scores_gemma":[0.97383475,0.0000023443758,0.013479809,0.0004921181,0.00006758449,0.000011726258,3.231831e-7,0.0000119436645,0.012099378],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999558,0.000022593631,0.000106131476,0.00008929794,0.000088845045,0.00013516055],"domain_scores_gemma":[0.9994797,0.00016293844,0.000023503893,0.0002598177,0.00003144268,0.00004257615],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00010072449,0.000070298855,0.00008526689,0.000025764084,0.00008595243,0.000022893939,0.00013469748,0.000041839074,0.0074082282],"category_scores_gemma":[0.00008506703,0.00004216221,0.00005026436,0.0000440373,0.000051138857,0.00006935339,0.00006285273,0.00006149241,0.00018129265],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[8.558098e-7,0.0000082787665,0.00015935574,0.0000056556723,0.000008743189,4.2084372e-7,0.00020820109,4.2483737e-8,0.00012104809,0.96109915,0.03573688,0.002651353],"study_design_scores_gemma":[0.000078163925,0.000010034692,0.0005969153,0.0000024948183,0.0000044377884,0.000004750253,0.0001181534,0.00003441617,0.0009508619,0.9946576,0.0034702863,0.000071927905],"about_ca_topic_score_codex":0.0000109573475,"about_ca_topic_score_gemma":0.0000014854791,"teacher_disagreement_score":0.56836784,"about_ca_system_score_codex":0.000004822961,"about_ca_system_score_gemma":0.0000035110277,"threshold_uncertainty_score":0.99349916},"labels":[],"label_agreement":null},{"id":"W7098970564","doi":"","title":"GRADUATE The Evolution of Public Drug Benefits in Saskatchewan:","year":2004,"lang":"en","type":"article","venue":"","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"CONTEST; Public policy; Public university; Publication; Population; Policy studies; Graduate students","score_opus":0.051569427698839876,"score_gpt":0.27330272121545707,"score_spread":0.2217332935166172,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7098970564","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9915026,0.0002201937,0.0010216358,0.0008793344,0.00013067314,0.00014867698,0.0000031306583,0.00003361601,0.00606017],"genre_scores_gemma":[0.99730927,0.000010203092,0.00228175,0.00005841792,0.00002976931,0.000006288623,6.214144e-7,0.00000967537,0.0002940004],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992113,0.000059727696,0.000244133,0.00011059887,0.00020199541,0.00017223714],"domain_scores_gemma":[0.9993598,0.00016114605,0.000077683246,0.00031662858,0.000057502755,0.000027246058],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006198262,0.00008708213,0.00013452582,0.000085539294,0.00007972274,0.000011285222,0.00023096713,0.00004171824,0.00003790673],"category_scores_gemma":[0.00014624385,0.00004926351,0.00006633231,0.00026035294,0.00009915741,0.00008177043,0.00007776096,0.00012720261,0.0000025261904],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000037966406,0.000040515704,0.0007383414,0.00001717965,0.0000107875385,4.6889505e-7,0.00458106,0.00005319664,0.0000375848,0.9927893,0.00017690803,0.0015508265],"study_design_scores_gemma":[0.00033377696,0.000011901099,0.008305147,0.000020307478,0.0000074279214,0.000003855092,0.0073179128,0.00001938938,0.0010777822,0.98280317,0.00003139658,0.000067964706],"about_ca_topic_score_codex":0.00066353136,"about_ca_topic_score_gemma":0.0038915968,"teacher_disagreement_score":0.009986197,"about_ca_system_score_codex":0.0000775715,"about_ca_system_score_gemma":0.00006195736,"threshold_uncertainty_score":0.21716024},"labels":[],"label_agreement":null},{"id":"W7099451783","doi":"","title":"Prospectus Supplement to the Short Form Base Shelf Prospectus Dated November 14, 2011","year":2013,"lang":"en","type":"article","venue":"","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Prospectus; Product (mathematics); Initial public offering; Base (topology)","score_opus":0.02478771991539415,"score_gpt":0.2758926927354225,"score_spread":0.25110497282002836,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7099451783","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.82911855,0.00008027173,0.0067761005,0.010983678,0.0017036358,0.00943093,0.0001573887,0.0006859723,0.14106348],"genre_scores_gemma":[0.9642618,0.000006445888,0.017675698,0.0017189622,0.00026845658,0.00052130653,0.000022847637,0.00006406184,0.015460474],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99794215,0.00004047265,0.00048657405,0.00043334928,0.0004813102,0.0006161516],"domain_scores_gemma":[0.9981673,0.00019359983,0.000065288325,0.0011672815,0.00020401168,0.00020255096],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00047576174,0.000326147,0.0003009751,0.00008114957,0.00037907006,0.00014151755,0.0006018846,0.00010025419,0.029120557],"category_scores_gemma":[0.00016227146,0.00017089907,0.0001367899,0.00018587038,0.00008296582,0.00018343735,0.00044218032,0.0002426619,0.0005756201],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027726539,0.00013605389,0.0021788504,0.00004328373,0.00011087075,0.0000049464625,0.0020124398,0.0000032343632,0.00043727856,0.51372576,0.47913834,0.0021811859],"study_design_scores_gemma":[0.0008096399,0.00031443793,0.011460786,0.000028043542,0.00011587499,0.000047336456,0.00072289637,0.0005263835,0.01709477,0.9022524,0.06582828,0.0007991789],"about_ca_topic_score_codex":0.00016257782,"about_ca_topic_score_gemma":0.00048359876,"teacher_disagreement_score":0.41331008,"about_ca_system_score_codex":0.00007144741,"about_ca_system_score_gemma":0.000028545139,"threshold_uncertainty_score":0.97176695},"labels":[],"label_agreement":null},{"id":"W7099779971","doi":"","title":"The Alignment Template Approach to Statistical Machine Translation","year":2008,"lang":"en","type":"article","venue":"","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Machine translation; NIST; Example-based machine translation; Evaluation of machine translation; Generalization; Translation (biology); Machine translation software usability; Transfer-based machine translation; Feature (linguistics)","score_opus":0.07031204748436691,"score_gpt":0.3032960958384896,"score_spread":0.23298404835412267,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7099779971","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04037449,0.00014044587,0.72080845,0.0005809854,0.00023825168,0.00064142665,0.000035479323,0.00013559005,0.23704489],"genre_scores_gemma":[0.87388855,0.000017894366,0.12440103,0.00019282107,0.000041602314,0.000018536102,0.000004956715,0.000013353977,0.0014212278],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992336,0.00005886398,0.00018968234,0.00013240687,0.00021762634,0.00016781813],"domain_scores_gemma":[0.9992213,0.00043566496,0.000022947404,0.00023513522,0.000016275892,0.00006866045],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002541356,0.000092196206,0.00010141236,0.000021490152,0.00048505454,0.000014302159,0.00013733454,0.00003447406,0.00007203654],"category_scores_gemma":[0.000052905278,0.000048460894,0.000036633046,0.00006389881,0.000072118986,0.000023159966,0.000029356377,0.00007541652,0.000009599889],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029989995,0.000034592143,0.00007330691,0.000008121741,0.000022796628,0.0000018715336,0.0012582776,0.000011791715,0.000025560808,0.98503953,0.007548076,0.0059461],"study_design_scores_gemma":[0.00041099385,0.000073317824,0.001669883,0.0000037111054,0.00002577701,0.00007258891,0.0001585854,0.003541467,0.00030844135,0.96368766,0.029840063,0.00020750883],"about_ca_topic_score_codex":0.000009350817,"about_ca_topic_score_gemma":0.0000054594752,"teacher_disagreement_score":0.8335141,"about_ca_system_score_codex":0.000011858979,"about_ca_system_score_gemma":0.0000072976586,"threshold_uncertainty_score":0.37306964},"labels":[],"label_agreement":null},{"id":"W7104401656","doi":"10.55016/ojs/cdm.v20i1.75917","title":"On Freiman-Lev conjecture","year":2025,"lang":"","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Natural Science Foundation of Anhui Province; National Natural Science Foundation of China","keywords":"Conjecture; Set (abstract data type); Upper and lower bounds; Beal's conjecture; Finite set","score_opus":0.010861542113256363,"score_gpt":0.3285934601710092,"score_spread":0.31773191805775286,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7104401656","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.069720745,0.0024935359,0.70787144,0.017486904,0.0065414235,0.007445515,0.007921755,0.0008045234,0.17971413],"genre_scores_gemma":[0.9674884,0.00011372652,0.013270982,0.00275419,0.00039848706,0.0002588829,0.00007832622,0.0001362851,0.0155007],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.994496,0.0003416778,0.0018690104,0.0010456304,0.0008105236,0.0014371522],"domain_scores_gemma":[0.9913372,0.0039395816,0.00053378573,0.0028757039,0.0007742232,0.00053953636],"candidate_categories":["metaresearch","metaepi_narrow","sts","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0013030634,0.0011616852,0.0016884839,0.0008633328,0.00216471,0.0004446611,0.001469651,0.0008603241,0.0013873253],"category_scores_gemma":[0.009661991,0.0009842167,0.00084663107,0.0016693689,0.00054319,0.00014923247,0.0010088278,0.0012797317,0.00052239624],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010318198,0.00051305257,0.0000118110665,0.0008329799,0.0007657544,0.000023812152,0.0022232665,0.00017997387,0.00016885149,0.94378126,0.050465807,0.0009302587],"study_design_scores_gemma":[0.0018363579,0.0003612142,0.00007502396,0.0023109855,0.0010897785,0.000020660547,0.0008133425,0.0027605095,0.0022503743,0.96223396,0.025280783,0.00096701965],"about_ca_topic_score_codex":0.000006812575,"about_ca_topic_score_gemma":0.000013259731,"teacher_disagreement_score":0.89776766,"about_ca_system_score_codex":0.00062304764,"about_ca_system_score_gemma":0.00039195112,"threshold_uncertainty_score":0.99952555},"labels":[],"label_agreement":null},{"id":"W7114780409","doi":"10.37236/13517","title":"Extremal Number of Arborescences","year":2025,"lang":"","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"National Research, Development and Innovation Office; Innovációs és Technológiai Minisztérium; Nemzeti Kutatási Fejlesztési és Innovációs Hivatal; Magyar Tudományos Akadémia","keywords":"Eulerian path; Upper and lower bounds; Bipartite graph; Graph; Transitive relation; Orientation (vector space); Tournament; Minification","score_opus":0.008349927471902786,"score_gpt":0.2995931588540293,"score_spread":0.29124323138212654,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7114780409","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9097702,0.04917593,0.010170994,0.0016196877,0.0058223833,0.0004219176,0.000005325629,0.000016009915,0.022997582],"genre_scores_gemma":[0.98992133,0.008172845,0.00005699359,0.00008097627,0.00014919284,0.0000013697711,1.7135196e-7,0.000028667995,0.0015884683],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99574524,0.00060902844,0.001701042,0.00018098207,0.00088255736,0.00088112196],"domain_scores_gemma":[0.99467105,0.0017004857,0.001967522,0.0007198522,0.0008546437,0.0000864468],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003575477,0.00037655266,0.0009804724,0.00023978189,0.00041463156,0.00005216518,0.0018393685,0.00025599726,0.00017016985],"category_scores_gemma":[0.0008061537,0.00023754801,0.0006388273,0.0011087131,0.00059034204,0.00016571004,0.00028878928,0.0019625514,0.0000026465439],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033590238,0.00039514832,0.0019166853,0.00025605617,0.0010074734,0.000008696137,0.0013160476,0.000010761768,0.00009739839,0.9920061,0.0013295017,0.0013201998],"study_design_scores_gemma":[0.0013454754,0.00045787083,0.00042075594,0.0004658164,0.00086757436,0.00018974429,0.00078823767,0.00008914374,0.0029886346,0.9885005,0.0036879978,0.00019828],"about_ca_topic_score_codex":0.000005852072,"about_ca_topic_score_gemma":0.0000025096465,"teacher_disagreement_score":0.08015114,"about_ca_system_score_codex":0.00031712916,"about_ca_system_score_gemma":0.0015412763,"threshold_uncertainty_score":0.9686927},"labels":[],"label_agreement":null},{"id":"W7115040161","doi":"","title":"Universal diameter bounds for random graphs with given degrees","year":2025,"lang":"en","type":"dissertation","venue":"eScholarship@McGill (McGill)","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"McGill University","keywords":"Random graph; Upper and lower bounds; Random variable; Quadratic equation; Set (abstract data type)","score_opus":0.02128479600456494,"score_gpt":0.26010657247208474,"score_spread":0.2388217764675198,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7115040161","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.85326964,0.0003822646,0.000019169944,0.000018118424,0.0025182546,0.0026194914,0.0030641288,0.0004721947,0.13763675],"genre_scores_gemma":[0.93216395,0.00022398311,0.018444624,0.00021677339,0.00009090636,0.0005076166,0.0013290328,0.00042947015,0.046593625],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99603814,0.0003576047,0.00085553783,0.0011708352,0.000731646,0.00084622233],"domain_scores_gemma":[0.9952731,0.0020272697,0.0007050371,0.001115196,0.00062593195,0.00025343467],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.00089055096,0.0010636068,0.0013433191,0.0007736341,0.0020428044,0.0001353324,0.0010328366,0.0010303904,0.0001634868],"category_scores_gemma":[0.0011646979,0.00088361267,0.0008699551,0.0006069799,0.00015173265,0.00047657703,0.00014799353,0.0012709883,0.000008263353],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0032833011,0.00014477635,0.000027357062,0.0013717595,0.0013078374,0.00004059253,0.000055826935,0.0000089136265,0.0006572387,0.96437883,0.00009060874,0.028632967],"study_design_scores_gemma":[0.0053870576,0.0003888852,0.00015182697,0.00096030784,0.0014702108,0.000017043662,0.0006116021,0.000017564018,0.007409109,0.9330836,0.04918057,0.0013222551],"about_ca_topic_score_codex":0.00006980012,"about_ca_topic_score_gemma":0.0015634506,"teacher_disagreement_score":0.09104313,"about_ca_system_score_codex":0.0003217884,"about_ca_system_score_gemma":0.00010170801,"threshold_uncertainty_score":0.99936146},"labels":[],"label_agreement":null},{"id":"W7115749811","doi":"10.1112/jlms.70389","title":"Discretised sum‐product theorems by Shannon‐type inequalities","year":2025,"lang":"en","type":"article","venue":"Journal of the London Mathematical Society","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Engineering and Physical Sciences Research Council","keywords":"Upper and lower bounds; Inequality; Interval (graph theory); Ring (chemistry); Stability (learning theory); Type (biology); Calculus (dental)","score_opus":0.02092804140318194,"score_gpt":0.3031315970410355,"score_spread":0.28220355563785354,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7115749811","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9601137,0.0023325048,0.015867865,0.007047329,0.0021529247,0.00059075566,0.0000328932,0.00007665687,0.011785363],"genre_scores_gemma":[0.97632545,0.00018270794,0.013370946,0.0012316802,0.00035282128,0.0000037041723,0.0000011965722,0.00004520446,0.008486259],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976232,0.00028777044,0.0009494464,0.00017709789,0.00062937604,0.00033312678],"domain_scores_gemma":[0.9971028,0.0013558811,0.00057213154,0.00061552733,0.0002641737,0.000089512374],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020583943,0.00026200435,0.00063132,0.000039813138,0.0003865192,0.00008685576,0.0009744364,0.0001508674,0.0002623079],"category_scores_gemma":[0.001901257,0.00013471584,0.00086485135,0.00040245082,0.0004505751,0.00013711728,0.0003441955,0.00066429714,0.0000038457615],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000060621016,0.00017034414,0.00030902526,0.00041965995,0.00037446967,0.000001503405,0.0025558255,0.000002946671,0.0014608908,0.8624142,0.13185465,0.00037588205],"study_design_scores_gemma":[0.0005594235,0.000052303974,0.0001383964,0.00032094365,0.00020167406,0.00003586902,0.00085329055,0.00010594681,0.0048392355,0.98777485,0.004960163,0.00015792873],"about_ca_topic_score_codex":0.00000145441,"about_ca_topic_score_gemma":3.6080655e-7,"teacher_disagreement_score":0.12689449,"about_ca_system_score_codex":0.00008742875,"about_ca_system_score_gemma":0.000084411506,"threshold_uncertainty_score":0.54935527},"labels":[],"label_agreement":null},{"id":"W7116983411","doi":"10.1016/j.aim.2025.110752","title":"Distances in sparse sets of large Hausdorff dimension","year":2025,"lang":"en","type":"article","venue":"Advances in Mathematics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Dimension (graph theory); Hausdorff dimension; Hausdorff distance; Hausdorff space; Set (abstract data type)","score_opus":0.014074414977806054,"score_gpt":0.33875957578819693,"score_spread":0.3246851608103909,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7116983411","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9538662,0.0044889324,0.0068917098,0.00007243687,0.000534272,0.00053135207,0.000024916484,0.000053396972,0.033536784],"genre_scores_gemma":[0.95672846,0.00069051003,0.042135194,0.000049582904,0.000010281652,0.000022351602,0.0000023872574,0.00001745214,0.00034378006],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998456,0.00007116653,0.00073277403,0.00022068017,0.00022604864,0.0002933523],"domain_scores_gemma":[0.99824816,0.0009711407,0.00023465409,0.00047659097,0.00004494449,0.00002449641],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006897852,0.00018995629,0.0005117323,0.00026006578,0.000059232323,0.000008052169,0.00030211464,0.00009861705,0.000045829693],"category_scores_gemma":[0.00063772185,0.00015300985,0.00007492924,0.00051721156,0.00013240764,0.00019868914,0.00016259686,0.00019489742,0.0000015731362],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028156766,0.00032051082,0.005421628,0.001150479,0.000013035607,0.0000106445295,0.002936046,0.000067817724,0.00008365089,0.9875368,0.00009475297,0.0023365174],"study_design_scores_gemma":[0.00067827,0.000018730505,0.0008403811,0.00087639724,0.000013458856,0.0000018098715,0.0014570602,0.0010429621,0.0011953013,0.99210864,0.0016198285,0.00014714636],"about_ca_topic_score_codex":0.0000022097574,"about_ca_topic_score_gemma":0.0001791616,"teacher_disagreement_score":0.035243485,"about_ca_system_score_codex":0.00004424019,"about_ca_system_score_gemma":0.00002227945,"threshold_uncertainty_score":0.623956},"labels":[],"label_agreement":null},{"id":"W7118051148","doi":"","title":"Two-Distance Sets over Finite Fields","year":2025,"lang":"","type":"article","venue":"ArXiv.org","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Nemzeti Kutatási Fejlesztési és Innovációs Hivatal","keywords":"Quadratic equation; Upper and lower bounds; Finite field; Lorentz transformation; Field (mathematics); Finite set","score_opus":0.02912160402602628,"score_gpt":0.3129993980152136,"score_spread":0.28387779398918733,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7118051148","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.90349805,0.00272803,0.004881671,0.0007666694,0.004078989,0.0004526351,0.00006731623,0.00012731279,0.08339935],"genre_scores_gemma":[0.9750932,0.0003643386,0.000859292,0.0032817384,0.00030569982,0.000023176983,0.000008038913,0.00005289129,0.02001162],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970545,0.000216603,0.0008745452,0.0007363118,0.00035231415,0.00076571107],"domain_scores_gemma":[0.9963425,0.0014560667,0.00029808033,0.0015938578,0.0001522885,0.00015721848],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0004969417,0.000559252,0.0006773328,0.00020038681,0.000728424,0.00010050054,0.00079802773,0.00046804213,0.002178438],"category_scores_gemma":[0.0008513433,0.0005146617,0.0004156276,0.00062637066,0.00037184742,0.00021113748,0.00060130446,0.0008999331,0.00013529764],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019728502,0.00023432515,0.2445799,0.0008076449,0.0005516986,0.00008238625,0.0030055917,0.000083502804,0.00012193101,0.7308324,0.015750399,0.00375292],"study_design_scores_gemma":[0.0026543636,0.00013636681,0.085000336,0.0009521712,0.0005163087,0.000007822106,0.00051871163,0.0016300061,0.0022603115,0.84941846,0.05584822,0.0010569323],"about_ca_topic_score_codex":0.000029782324,"about_ca_topic_score_gemma":0.00006876973,"teacher_disagreement_score":0.15957956,"about_ca_system_score_codex":0.000087402615,"about_ca_system_score_gemma":0.00013689844,"threshold_uncertainty_score":0.99973047},"labels":[],"label_agreement":null},{"id":"W7132863735","doi":"","title":"On the Logarithimic Calculus and Sidorenko&apos;s Conjecture","year":2011,"lang":"en","type":"dissertation","venue":"TSpace","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Conjecture; Forcing (mathematics); Bipartite graph; Logarithm; Vertex (graph theory); Type (biology)","score_opus":0.06113968693171706,"score_gpt":0.3703866312554483,"score_spread":0.30924694432373123,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7132863735","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8291879,0.0005525373,0.000027633789,0.00022304922,0.0010062939,0.00046745272,0.000013562554,0.000093994786,0.16842753],"genre_scores_gemma":[0.9118651,0.00013492224,0.00039796083,0.00052373565,0.00021414316,0.000040023402,0.0000696612,0.00011269064,0.086641744],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989582,0.00010556222,0.00018233637,0.00030678578,0.00021586065,0.00023125486],"domain_scores_gemma":[0.9984786,0.00066124345,0.00020196871,0.0005458098,0.00005159939,0.000060807022],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021341875,0.00033622014,0.00033306118,0.000076664415,0.00030634776,0.000038768398,0.00028630014,0.00044944327,0.0007014724],"category_scores_gemma":[0.00033586944,0.00019278679,0.00011426064,0.000074272844,0.000107546795,0.000017445882,0.00004650487,0.00068793,0.000016173397],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009409258,0.000018808534,0.0000050460876,0.0001555636,0.00009924832,0.0000095828555,0.024855928,1.9112804e-7,0.000059498823,0.96156675,0.012177213,0.0009581019],"study_design_scores_gemma":[0.00022121644,0.00010082351,0.00027377935,0.00017084646,0.00017350186,0.000015429006,0.0037255317,0.0000109617495,0.0018313458,0.99049723,0.0026490681,0.00033024966],"about_ca_topic_score_codex":0.00007074176,"about_ca_topic_score_gemma":0.0002558811,"teacher_disagreement_score":0.08267717,"about_ca_system_score_codex":0.000016950326,"about_ca_system_score_gemma":0.000035385525,"threshold_uncertainty_score":0.7861617},"labels":[],"label_agreement":null},{"id":"W7142763955","doi":"10.23952/jano.8.2026.1.02","title":"Some results and conjectures related to Frankl’s union closed conjecture","year":2025,"lang":"","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Conjecture; Finite set; Set (abstract data type); Existential quantification; Family of sets; Element (criminal law)","score_opus":0.005598809760703863,"score_gpt":0.2518934061996613,"score_spread":0.2462945964389574,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7142763955","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35472572,0.019227812,0.5717818,0.020024564,0.0066466536,0.003835057,0.00017927085,0.00017419018,0.023404945],"genre_scores_gemma":[0.9598458,0.0023692066,0.03600364,0.0012928736,0.00023684159,0.000003134604,0.00000825049,0.000036933336,0.00020331371],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972304,0.00019771793,0.0014850763,0.00039411,0.0003723856,0.00032031216],"domain_scores_gemma":[0.997541,0.00075878063,0.00090537104,0.0002646173,0.00024221052,0.00028798427],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009637496,0.00040951528,0.0009234278,0.00048301765,0.00044577403,0.00015937848,0.0002186927,0.00052320166,0.00004200121],"category_scores_gemma":[0.00048222175,0.00031227502,0.00014067304,0.0005708738,0.00022267805,0.00017250584,0.00019272197,0.0007708696,7.130187e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0065962095,0.00030601476,0.00005615161,0.00048186333,0.0010073396,0.00003509015,0.008826914,0.20145935,0.0007944922,0.7386641,0.0041758073,0.03759667],"study_design_scores_gemma":[0.010535441,0.0014404526,0.0012475743,0.0008133244,0.0011217685,0.00014870212,0.0010215339,0.042211715,0.0017108213,0.93285465,0.0060665733,0.00082743866],"about_ca_topic_score_codex":0.0000025858803,"about_ca_topic_score_gemma":1.7697836e-7,"teacher_disagreement_score":0.60512006,"about_ca_system_score_codex":0.000058899484,"about_ca_system_score_gemma":0.00010056177,"threshold_uncertainty_score":0.99993294},"labels":[],"label_agreement":null},{"id":"W73305646","doi":"10.1007/978-3-540-72053-9_17","title":"Decoupling Weakly Dependent Events","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in mathematics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Decoupling (probability); Computer science; Engineering; Control engineering","score_opus":0.0487334576692593,"score_gpt":0.31201474771181603,"score_spread":0.26328129004255674,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W73305646","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004215128,0.0024812904,0.3269904,0.0001215321,0.0022451591,0.002156193,0.00009296806,0.00048575702,0.66121155],"genre_scores_gemma":[0.18455566,0.0011195857,0.6651788,0.001286759,0.0030653838,0.00008538193,0.00012008161,0.0019442197,0.14264415],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9962823,0.000028032435,0.001358835,0.00066364807,0.00097062514,0.00069655146],"domain_scores_gemma":[0.9947713,0.0028895317,0.0007573329,0.0012925304,0.0001390721,0.00015022646],"candidate_categories":["metaepi_narrow","research_integrity","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0012158386,0.0009498945,0.001246228,0.00059330557,0.00021444549,0.000045867524,0.00081321306,0.0014446871,0.0009296094],"category_scores_gemma":[0.0011832858,0.0007995066,0.00043852377,0.00010107577,0.00014222147,0.00006247748,0.000283635,0.0016903894,0.00007292597],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003120259,0.000106540414,0.00005851713,0.0012829872,0.0002506069,0.00014519064,0.0022714934,0.0001525121,0.000039244074,0.98785913,0.00011032987,0.007692248],"study_design_scores_gemma":[0.0003449709,0.00004707496,0.0000055351197,0.0012085298,0.00020660671,0.00010240906,0.00001359285,0.0003289853,0.0005566995,0.9947161,0.0016463862,0.0008230933],"about_ca_topic_score_codex":0.0000034605362,"about_ca_topic_score_gemma":0.00017492658,"teacher_disagreement_score":0.51856744,"about_ca_system_score_codex":0.0002684981,"about_ca_system_score_gemma":0.00007145075,"threshold_uncertainty_score":0.99998367},"labels":[],"label_agreement":null},{"id":"W74783409","doi":"10.1007/978-3-0348-0209-3_2","title":"Smooth Functions on Subsets of ℝ n","year":2011,"lang":"en","type":"book-chapter","venue":"","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Mathematics","score_opus":0.06776807165379012,"score_gpt":0.26776986987629403,"score_spread":0.2000017982225039,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W74783409","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000197861,0.000058072525,0.00027466257,0.000010122786,0.00050264434,0.0001464046,0.0000577132,0.0000634866,0.99868906],"genre_scores_gemma":[0.022362439,0.00004544089,0.00089118193,0.000089883186,0.000118346834,0.000002794284,0.000009670977,0.00006281142,0.9764174],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99919426,0.000008936881,0.0003023349,0.00019247002,0.00018957157,0.00011242278],"domain_scores_gemma":[0.9988787,0.00019744053,0.0001996199,0.0006118289,0.000067184075,0.000045238477],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00010535267,0.00023002175,0.00034355096,0.0001445089,0.00006880885,0.000003964171,0.00018207051,0.00030590215,0.011147195],"category_scores_gemma":[0.00003378491,0.00016236331,0.00023428955,0.000011170294,0.00012424182,0.000015984204,0.0000686648,0.00025178958,0.00009905788],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021902986,0.000015406353,0.0000026126124,0.000056738605,0.000086390326,0.0000022783183,0.00012260389,4.986322e-8,0.000002113145,0.9745765,0.022696203,0.0024171984],"study_design_scores_gemma":[0.00008393859,0.00007584894,0.000014894799,0.000072013114,0.00008365954,0.000002384442,0.000005590938,2.3019342e-7,0.00007147883,0.85652995,0.14290676,0.0001532501],"about_ca_topic_score_codex":0.0000047229637,"about_ca_topic_score_gemma":0.000012357421,"teacher_disagreement_score":0.12021056,"about_ca_system_score_codex":0.000012868319,"about_ca_system_score_gemma":0.00001751343,"threshold_uncertainty_score":0.98975676},"labels":[],"label_agreement":null},{"id":"W754424760","doi":"10.1016/j.disc.2015.06.022","title":"Edge coloring multigraphs without small dense subsets","year":2015,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Multigraph; Edge coloring; Combinatorics; Mathematics; Conjecture; Statement (logic); Vertex (graph theory); Chromatic scale; Brooks' theorem; Graph; Enhanced Data Rates for GSM Evolution; Discrete mathematics; 1-planar graph; Computer science; Chordal graph; Line graph; Artificial intelligence","score_opus":0.09607106585995495,"score_gpt":0.32043644204658683,"score_spread":0.22436537618663188,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W754424760","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9586096,0.00019104166,0.013344585,0.00006642509,0.0007226001,0.00060328044,0.000027434744,0.00036816346,0.026066896],"genre_scores_gemma":[0.8509913,0.000013791339,0.14703412,0.00009220808,0.00017671533,0.000047740145,0.000008601906,0.00010399098,0.0015315026],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99789655,0.0001184515,0.0006210177,0.00035255592,0.00047538144,0.00053602137],"domain_scores_gemma":[0.9977091,0.0005414718,0.00029840527,0.000911348,0.00019577086,0.0003439227],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010417536,0.0004005852,0.00058157626,0.00015830585,0.0002459358,0.00009293286,0.0005341314,0.00019165511,0.00005868373],"category_scores_gemma":[0.0013705454,0.0003082765,0.0002251073,0.00025591758,0.00021158287,0.00012531706,0.00028099192,0.00030018084,0.00005091395],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000068062756,0.00020177494,0.0038546326,0.0005279759,0.00020563633,0.000050096904,0.025743296,0.000014767321,0.00026958817,0.9643281,0.0042125215,0.00052355166],"study_design_scores_gemma":[0.0011356089,0.000087239416,0.00019273694,0.00016715702,0.0001751345,0.00008677653,0.0027229541,0.002560078,0.0018999189,0.98868215,0.0017082246,0.00058199663],"about_ca_topic_score_codex":0.000009881666,"about_ca_topic_score_gemma":0.00003579031,"teacher_disagreement_score":0.13368954,"about_ca_system_score_codex":0.00006268811,"about_ca_system_score_gemma":0.00005307302,"threshold_uncertainty_score":0.99993694},"labels":[],"label_agreement":null},{"id":"W790696949","doi":"10.1016/j.endm.2015.06.021","title":"Weak regularity and finitely forcible graph limits","year":2015,"lang":"en","type":"preprint","venue":"Electronic Notes in Discrete Mathematics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"European Research Council; Engineering and Physical Sciences Research Council; Grantová Agentura České Republiky; European Commission","keywords":"Combinatorics; Bounded function; Mathematics; Upper and lower bounds; Partition (number theory); Finitely-generated abelian group; Graph; Discrete mathematics; Mathematical analysis","score_opus":0.046928112627552185,"score_gpt":0.31672372398507637,"score_spread":0.26979561135752417,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W790696949","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.93376476,0.010223054,0.03094152,0.0006523825,0.0009851615,0.002808297,0.00018762604,0.0005418576,0.019895356],"genre_scores_gemma":[0.9195652,0.0009895313,0.077882804,0.00007990088,0.00027862893,0.0001798358,0.00006767814,0.00023516284,0.00072126853],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9955368,0.00023651599,0.001251309,0.00095188286,0.00076846423,0.0012550313],"domain_scores_gemma":[0.9953821,0.001669014,0.00069980393,0.0018334577,0.0001878518,0.00022777957],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.00244844,0.0009088928,0.0014339598,0.0004793771,0.00022734962,0.00018349395,0.0010335629,0.0009503671,0.00005912905],"category_scores_gemma":[0.0029112177,0.0007851781,0.00033600128,0.00038472403,0.00039298585,0.0001383853,0.0016672539,0.0023579656,0.0000056626313],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000049450977,0.00017262867,0.0002705932,0.0020705438,0.0002353097,0.000015134839,0.003619038,0.00009357521,0.000036150745,0.9913357,0.00086360873,0.0012383015],"study_design_scores_gemma":[0.0006829788,0.00014259644,0.000077275625,0.0007258,0.00022611025,0.000056247853,0.00023024404,0.0029496257,0.00055263407,0.99299467,0.00049052725,0.0008712904],"about_ca_topic_score_codex":0.00003367913,"about_ca_topic_score_gemma":0.00022524674,"teacher_disagreement_score":0.046941288,"about_ca_system_score_codex":0.00031208474,"about_ca_system_score_gemma":0.00038422525,"threshold_uncertainty_score":0.9999436},"labels":[],"label_agreement":null},{"id":"W79767735","doi":"","title":"A Problem on Linear Functions and Subsets of a Finite Field.","year":2001,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Finite field; Field (mathematics); Pure mathematics; Combinatorics","score_opus":0.021931515880796785,"score_gpt":0.27348651806389707,"score_spread":0.2515550021831003,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W79767735","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9811385,0.000051284158,0.00004525538,0.00016488887,0.00046570326,0.00014317458,0.0000045288616,0.00003978944,0.017946826],"genre_scores_gemma":[0.9984162,0.000034800454,0.0006789592,0.00009284353,0.000009965887,0.00000889026,0.0000015550446,0.000012580668,0.00074421475],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994,0.00003933187,0.00017785084,0.00013251712,0.00012194141,0.00012832886],"domain_scores_gemma":[0.99894994,0.0006256308,0.000073560404,0.0002544377,0.000050616574,0.000045820194],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015077706,0.00009734956,0.00015982884,0.000065257096,0.000110939494,0.0000075232833,0.0000901685,0.00007975817,0.00007365822],"category_scores_gemma":[0.00023292493,0.000079205136,0.00004912391,0.00013480021,0.00004805117,0.000037817277,0.000053480337,0.00013373356,0.000004772387],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000058821177,0.000092020644,0.0028587969,0.000038178143,0.000029499366,0.000005546394,0.00048781748,0.00000205824,0.00003828247,0.99281925,0.0020156908,0.0015540529],"study_design_scores_gemma":[0.00054933125,0.0002532188,0.0006594007,0.000040659375,0.000024026303,0.000008132949,0.0000623237,0.000073554824,0.0004535997,0.9951376,0.0026486418,0.00008954698],"about_ca_topic_score_codex":0.000007676941,"about_ca_topic_score_gemma":0.0000033189672,"teacher_disagreement_score":0.017277641,"about_ca_system_score_codex":0.000006676155,"about_ca_system_score_gemma":0.000009942633,"threshold_uncertainty_score":0.3229892},"labels":[],"label_agreement":null},{"id":"W85188401","doi":"","title":"An improved bound on correlation between polynomials over Z_m and MOD_q.","year":2006,"lang":"en","type":"article","venue":"","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Combinatorics; Boolean function; Mathematics; Prime (order theory); Upper and lower bounds; Function (biology); Polynomial; Degree (music); Discrete mathematics; Physics; Mathematical analysis","score_opus":0.018032414357358244,"score_gpt":0.2907375941705609,"score_spread":0.27270517981320264,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W85188401","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9775825,0.000022666985,0.0020471585,0.000033881384,0.00012898665,0.00016847605,0.000014045394,0.00008538472,0.019916879],"genre_scores_gemma":[0.9964252,0.0000016843177,0.001967981,0.00010553924,0.00029730087,0.0000024388312,0.00001321143,0.000020955684,0.0011656713],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999297,0.0000473576,0.00020853634,0.0001879038,0.000108753135,0.0001504422],"domain_scores_gemma":[0.9993426,0.0002449103,0.000078263976,0.00026668602,0.000018279847,0.000049212336],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019884211,0.00012529884,0.00016855574,0.000062194325,0.00018483172,0.000061002618,0.000065495406,0.000118357406,0.0001327891],"category_scores_gemma":[0.000033610948,0.000093582974,0.000038286966,0.00004440133,0.000061279105,0.0001241963,0.000029230718,0.00009423669,0.0000026236903],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000041867424,0.000050302562,0.013182947,0.000019824787,0.000027892687,0.0000011997681,0.00021992867,0.000010283119,0.002301374,0.97846925,0.002627207,0.0030479468],"study_design_scores_gemma":[0.000475422,0.00013004745,0.076149635,0.00000763147,0.000037406327,0.000002388874,0.000025831952,0.001265963,0.0019083106,0.9194142,0.0004112337,0.00017191336],"about_ca_topic_score_codex":0.00011014639,"about_ca_topic_score_gemma":0.000026193737,"teacher_disagreement_score":0.06296669,"about_ca_system_score_codex":0.000018328947,"about_ca_system_score_gemma":0.0000067019023,"threshold_uncertainty_score":0.3816203},"labels":[],"label_agreement":null},{"id":"W91855218","doi":"","title":"On Ramsey Numbers of Short Paths versus Large Wheels.","year":2008,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics","score_opus":0.031069213511176873,"score_gpt":0.2870773960984097,"score_spread":0.25600818258723285,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W91855218","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96131724,0.000051823965,0.000011998772,0.000017466338,0.0032426785,0.00015973445,0.000015070451,0.0000753023,0.0351087],"genre_scores_gemma":[0.9992135,0.000035035053,0.00037924247,0.00005678145,0.000013990643,0.000007811322,0.0000049226687,0.00003404168,0.0002546575],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987144,0.00008423315,0.00030231135,0.00022453762,0.00037548167,0.0002990512],"domain_scores_gemma":[0.9985424,0.00061543006,0.00009482473,0.0005769647,0.00008291544,0.00008742866],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029054392,0.00018728436,0.00032085317,0.00007375823,0.00022230155,0.000006466801,0.00029976282,0.000143782,0.00015316505],"category_scores_gemma":[0.0003921864,0.0001624597,0.0001577595,0.00017577349,0.00013005464,0.00006666054,0.00010889226,0.00022914418,0.000014567999],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016834166,0.00020966293,0.0016789787,0.000030219016,0.00007885076,0.000027713912,0.0012518126,7.677862e-7,0.000042442767,0.98756295,0.008808984,0.00013929339],"study_design_scores_gemma":[0.0017740868,0.00024632,0.0011093238,0.00003368169,0.000030455634,0.000008121603,0.00009905566,0.000014498064,0.001584887,0.99378556,0.0011223318,0.0001916985],"about_ca_topic_score_codex":0.0000070534516,"about_ca_topic_score_gemma":0.000002742561,"teacher_disagreement_score":0.037896294,"about_ca_system_score_codex":0.00003929794,"about_ca_system_score_gemma":0.000031414347,"threshold_uncertainty_score":0.66249144},"labels":[],"label_agreement":null},{"id":"W95359580","doi":"10.1007/978-3-540-32439-3_3","title":"Discrepancy in Graphs and Hypergraphs","year":2006,"lang":"en","type":"book-chapter","venue":"Bolyai Society mathematical studies","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":17,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Trinity College","funders":"","keywords":"Combinatorics; Mathematics; Graph; Discrete mathematics","score_opus":0.051721357207322405,"score_gpt":0.30997869308385506,"score_spread":0.25825733587653266,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W95359580","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018742958,0.03901424,0.00023863607,0.0006706216,0.00043194115,0.0016608034,0.00013119944,0.00051427,0.93859535],"genre_scores_gemma":[0.045891363,0.027902065,0.066194974,0.00085923885,0.0006336665,0.00035033145,0.000041361625,0.00077215664,0.8573548],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99723756,0.000035543784,0.0009809176,0.00067760225,0.0005528755,0.00051547604],"domain_scores_gemma":[0.99738705,0.0014881878,0.00032105035,0.00059476326,0.00010582823,0.000103096616],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005748478,0.00078846066,0.0016124502,0.00011030703,0.00039887617,0.00004461129,0.00027985542,0.00058200496,0.00010584642],"category_scores_gemma":[0.00026119134,0.00057910534,0.0008094273,0.000084965795,0.0011930435,0.000077291625,0.00061132235,0.0007052938,0.0000108823015],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000075878233,0.000057669404,0.00006512069,0.0014145544,0.0006219431,0.00001773573,0.002453257,1.16495606e-7,0.0000025815486,0.97343934,0.021429826,0.00049026386],"study_design_scores_gemma":[0.0004228281,0.00004622255,0.00010551209,0.00087676756,0.000319566,0.000023868737,0.0005781855,0.00001576792,0.0000036818183,0.9920115,0.0049530575,0.00064303394],"about_ca_topic_score_codex":0.0000040578248,"about_ca_topic_score_gemma":0.000018714198,"teacher_disagreement_score":0.08124049,"about_ca_system_score_codex":0.000079874146,"about_ca_system_score_gemma":0.000020180869,"threshold_uncertainty_score":0.99966604},"labels":[],"label_agreement":null}]}