{"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.63531023,0.00047697703,0.343952,0.002237389,0.00006294602,0.00006756936,0.00017901903,0.00022725157,0.017486645],"genre_scores_gemma":[0.9828971,0.00011199019,0.014302199,0.0002206561,0.00007235659,0.00008147429,0.0001101081,0.000034646822,0.002169359],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971535,0.0013109451,0.00013994874,0.00056052336,0.0006039637,0.00023109256],"domain_scores_gemma":[0.98428833,0.010858228,0.0014578355,0.0012407321,0.001222614,0.0009322906],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004426808,0.00047125792,0.00075414364,0.0017371988,0.0011910541,0.0023417783,0.0016079381,0.0014515616,0.0036702866],"category_scores_gemma":[0.016023824,0.000480794,0.0011307627,0.00082864356,0.0067796465,0.005985809,0.0029465954,0.0025507475,0.0003879694],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001929817,0.000017406948,0.00044489582,0.00001338364,0.000006848967,0.000065220775,0.00013778037,0.0031187923,0.0006600103,0.9945675,0.0001280855,0.00082075835],"study_design_scores_gemma":[0.000016488111,0.000033307595,0.00027910247,0.000009912126,0.0000035147623,0.00012001908,0.00008290652,0.04679274,0.00078439986,0.9512935,0.0005700443,0.000014075873],"about_ca_topic_score_codex":0.00088679336,"about_ca_topic_score_gemma":0.00058844325,"teacher_disagreement_score":0.004426808,"about_ca_system_score_codex":0.0015172998,"about_ca_system_score_gemma":0.000633881,"threshold_uncertainty_score":0.023411453},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5585423,0.0020491458,0.3467971,0.0013531607,0.00029519183,0.00008664081,0.00041048822,0.00034632074,0.09011961],"genre_scores_gemma":[0.9413781,0.00075857877,0.047729243,0.00027968182,0.00018534878,0.000108556305,0.00027339926,0.00009524037,0.009191774],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991714,0.00024564294,0.000044819797,0.00014768919,0.00021227264,0.00017822465],"domain_scores_gemma":[0.99684405,0.0016539983,0.00047504448,0.0005094035,0.00021825793,0.0002991911],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00091585587,0.0006464774,0.000569686,0.0013184915,0.0011238096,0.0014648157,0.0007323114,0.0005655718,0.0036255918],"category_scores_gemma":[0.00437708,0.00042158677,0.0005823858,0.0009600052,0.0031109154,0.0031512983,0.0020875013,0.0014246866,0.0005561284],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007942196,0.000014095799,0.0006129561,0.000043003147,0.00000674272,0.00009577385,0.0001523594,0.0077102277,0.002170816,0.98127216,0.0007759614,0.0070664557],"study_design_scores_gemma":[0.000024515695,0.000044368022,0.0006060771,0.000031914115,0.000008068898,0.00024617248,0.00008346715,0.038379736,0.0020179704,0.9543493,0.0041901097,0.000018270002],"about_ca_topic_score_codex":0.0007304738,"about_ca_topic_score_gemma":0.000672127,"teacher_disagreement_score":0.0036255918,"about_ca_system_score_codex":0.0015006305,"about_ca_system_score_gemma":0.00037178554,"threshold_uncertainty_score":0.01212883},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017496016,0.0033619779,0.0486837,0.0041275923,0.00092310656,0.000023775508,0.00047429686,0.00020107812,0.92470855],"genre_scores_gemma":[0.63224477,0.0072307037,0.05043921,0.005347564,0.0027089359,0.00037014598,0.0023342378,0.00070088333,0.29862347],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990339,0.000242688,0.00006158063,0.0002102893,0.0003176443,0.0001338904],"domain_scores_gemma":[0.99887997,0.0005372525,0.000066163295,0.00023822434,0.0001738179,0.00010448282],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009876587,0.0007563752,0.00074137584,0.0015996539,0.002118274,0.005241178,0.0015211045,0.001361256,0.01946273],"category_scores_gemma":[0.002373,0.00048983726,0.0012478699,0.0017240035,0.003976989,0.010703469,0.0028026842,0.00504675,0.0032867845],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000053661965,0.000005329999,0.000031239328,0.000016908507,0.0000014322383,0.000008658987,0.00011968751,0.000067391484,0.0001399505,0.9937635,0.0033008214,0.0025397008],"study_design_scores_gemma":[0.000004824033,0.000005689414,0.00010193722,0.000029344763,0.0000044942717,0.0000590715,0.00009658422,0.00031774145,0.00015744605,0.96723616,0.031979933,0.000006844782],"about_ca_topic_score_codex":0.0010415596,"about_ca_topic_score_gemma":0.00088117697,"teacher_disagreement_score":0.01946273,"about_ca_system_score_codex":0.0021031487,"about_ca_system_score_gemma":0.00057613186,"threshold_uncertainty_score":0.06510931},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10937494,0.01305275,0.48747182,0.008970394,0.0015659378,0.00022365917,0.00095046125,0.00070575625,0.37768435],"genre_scores_gemma":[0.8214159,0.006323191,0.11389984,0.0049534566,0.0012966136,0.00046189193,0.0009918163,0.00044293486,0.050214235],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99885,0.00026243553,0.00004139689,0.00025544644,0.00039094096,0.00019979672],"domain_scores_gemma":[0.9978956,0.0013484719,0.00012277882,0.00024009463,0.00022930208,0.00016367692],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017322585,0.0008431753,0.0009610164,0.002443711,0.003029606,0.0023795054,0.0013953582,0.0016544635,0.007000361],"category_scores_gemma":[0.005460375,0.00074141973,0.0013524501,0.0020722905,0.00576485,0.008787441,0.005044457,0.0044192197,0.0022158204],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023537377,0.000009159361,0.00011059236,0.000034751938,0.000005896889,0.000046769863,0.00019234527,0.00039240677,0.000506259,0.99116313,0.0022483976,0.005266635],"study_design_scores_gemma":[0.000013237369,0.000015403166,0.00016015056,0.00002884763,0.0000074231543,0.00012886919,0.000051902767,0.0010501848,0.000729533,0.9863149,0.011485782,0.000013912337],"about_ca_topic_score_codex":0.0022118061,"about_ca_topic_score_gemma":0.0016199102,"teacher_disagreement_score":0.007000361,"about_ca_system_score_codex":0.0024271577,"about_ca_system_score_gemma":0.0006488523,"threshold_uncertainty_score":0.023418546},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.61280054,0.0044107516,0.031976983,0.0024625503,0.00035556726,0.00010545433,0.0037145799,0.001355406,0.34281817],"genre_scores_gemma":[0.9597292,0.0011711225,0.014829855,0.00031388426,0.00009022288,0.00010740257,0.0016034445,0.00009900657,0.022055846],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995654,0.00008174724,0.000026847674,0.000100010875,0.00010788332,0.00011817394],"domain_scores_gemma":[0.9982862,0.00062237884,0.00032801068,0.00025702256,0.0002381804,0.00026831825],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000747308,0.0004542373,0.00030964398,0.0024963599,0.0013129871,0.0019640315,0.0005658102,0.0006796181,0.011282763],"category_scores_gemma":[0.0024723455,0.00018155896,0.00031728364,0.0008813517,0.0012535249,0.0023670527,0.0011317709,0.0010774308,0.0017805293],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027621316,0.000048251215,0.0020498172,0.00022142618,0.00002748574,0.00014100083,0.00045682743,0.0008643116,0.0039737257,0.951137,0.015265743,0.025538016],"study_design_scores_gemma":[0.00003866265,0.00008211317,0.006060339,0.00012881726,0.00004666431,0.00091174495,0.0007894687,0.0038031568,0.007247544,0.9115386,0.06929477,0.00005800111],"about_ca_topic_score_codex":0.0010285734,"about_ca_topic_score_gemma":0.0018207212,"teacher_disagreement_score":0.011282763,"about_ca_system_score_codex":0.00080279435,"about_ca_system_score_gemma":0.0005882756,"threshold_uncertainty_score":0.03774464},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012721497,0.007156031,0.52070034,0.025178866,0.017298821,0.00039060783,0.004207002,0.005122715,0.4072241],"genre_scores_gemma":[0.23925471,0.006277015,0.5134494,0.016103126,0.0059331437,0.0015201825,0.0042173183,0.0030716674,0.21017356],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978992,0.0008703087,0.00012505718,0.00046127048,0.00039412075,0.00025008587],"domain_scores_gemma":[0.99631006,0.0020438682,0.00025954543,0.00070644467,0.00042130088,0.00025877726],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026877746,0.0015079884,0.0010890845,0.0015778871,0.0022555206,0.002535731,0.002374052,0.0016004256,0.065736674],"category_scores_gemma":[0.008398447,0.00079032895,0.0009712791,0.0022369418,0.0025253452,0.00625682,0.003701243,0.003846408,0.021671917],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013385598,0.000041782034,0.0001442031,0.00023957313,0.000016279742,0.00012441592,0.00012411147,0.0013535038,0.0012885451,0.818215,0.13985997,0.03845866],"study_design_scores_gemma":[0.000025730478,0.000030669267,0.00025605503,0.000065597764,0.000010027656,0.00028852478,0.000036882102,0.0062881676,0.000732403,0.7540975,0.23812686,0.000041575924],"about_ca_topic_score_codex":0.0018479212,"about_ca_topic_score_gemma":0.004207385,"teacher_disagreement_score":0.065736674,"about_ca_system_score_codex":0.0019434366,"about_ca_system_score_gemma":0.0008762255,"threshold_uncertainty_score":0.2199111},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.112520285,0.012522497,0.30020988,0.035453346,0.002849906,0.0001726938,0.0014537631,0.0011323846,0.5336852],"genre_scores_gemma":[0.90367925,0.0043881354,0.05937597,0.0028667815,0.0027250932,0.00032725264,0.0010379779,0.00037569503,0.025223816],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9966809,0.0010532805,0.00018328075,0.00063951046,0.00095057016,0.0004923373],"domain_scores_gemma":[0.9579508,0.032720286,0.0012411033,0.0043435,0.0023258163,0.0014185852],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0057116593,0.0009805135,0.0013597272,0.004406658,0.002890422,0.004849649,0.0035575903,0.0029722007,0.016739123],"category_scores_gemma":[0.05086816,0.0007048811,0.0013615392,0.0033813831,0.006608352,0.013201554,0.0059722005,0.007672381,0.0021556458],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010191259,0.00004752782,0.00064473215,0.0000836388,0.000015139144,0.000055087407,0.00018617693,0.004180997,0.00040254393,0.9744213,0.008604667,0.011256323],"study_design_scores_gemma":[0.0000097606635,0.000008072027,0.00016792012,0.0000239558,0.0000083791365,0.000047390884,0.000041998414,0.009883423,0.0002650056,0.9861826,0.0033518113,0.000009703131],"about_ca_topic_score_codex":0.0022591637,"about_ca_topic_score_gemma":0.002261621,"teacher_disagreement_score":0.016739123,"about_ca_system_score_codex":0.003575952,"about_ca_system_score_gemma":0.0014619888,"threshold_uncertainty_score":0.055997968},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.81000173,0.001999161,0.12059123,0.0012702352,0.00018366768,0.0000954649,0.0014689751,0.00034376857,0.06404571],"genre_scores_gemma":[0.9690652,0.00041979906,0.025168182,0.00009820021,0.0001130547,0.000076974065,0.0007738093,0.00003371913,0.0042510745],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99867946,0.0002879955,0.00013615534,0.00041083334,0.0003144884,0.00017093236],"domain_scores_gemma":[0.9941766,0.0033571075,0.000978005,0.00043533245,0.00040573927,0.0006471621],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001018075,0.00048249456,0.0006153138,0.0032167197,0.0015973464,0.002292641,0.001160754,0.000965491,0.005499405],"category_scores_gemma":[0.006361611,0.00039072527,0.0007165249,0.0026322186,0.0031251826,0.0044657676,0.0031039729,0.0013493417,0.0006828272],"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.00029532565,0.00006520516,0.0049085044,0.00023297012,0.000063615036,0.00045700162,0.0014921062,0.011726172,0.00190476,0.94686943,0.0018033588,0.030181488],"study_design_scores_gemma":[0.000039794286,0.0001586888,0.0027829285,0.000074174844,0.000035993682,0.0008158638,0.0004334171,0.019210422,0.0012502642,0.96479666,0.010357663,0.00004409243],"about_ca_topic_score_codex":0.00071132963,"about_ca_topic_score_gemma":0.00051500543,"teacher_disagreement_score":0.005499405,"about_ca_system_score_codex":0.0013269079,"about_ca_system_score_gemma":0.0004026186,"threshold_uncertainty_score":0.018397331},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01055789,0.0042144475,0.040392,0.0012587146,0.0011556621,0.00001887845,0.00025415354,0.0001858629,0.94196236],"genre_scores_gemma":[0.24099354,0.0076728268,0.020074386,0.0013632316,0.0007957819,0.00010997809,0.00056309585,0.00038463375,0.72804254],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99961936,0.00007248441,0.000028211905,0.00006919499,0.00015869795,0.00005195391],"domain_scores_gemma":[0.99963355,0.00011578247,0.000029726154,0.00007878078,0.00010818286,0.000034000434],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037320988,0.0005833377,0.00040437488,0.001456889,0.0011922606,0.0031765623,0.0006943842,0.00057384657,0.01889548],"category_scores_gemma":[0.0010397815,0.00040203214,0.00036662034,0.0015000491,0.0022273299,0.0042458912,0.001331637,0.002585959,0.00616012],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000038148582,0.0000036487795,0.000017691329,0.000017624609,0.0000011256575,0.0000088548595,0.00008543974,0.00008232746,0.00015179119,0.98640084,0.004864912,0.008362026],"study_design_scores_gemma":[0.0000019396575,0.000006245458,0.00007182821,0.0000386613,0.0000033197794,0.00008618432,0.00009729689,0.00026461913,0.00038870887,0.8933236,0.105710514,0.0000070805013],"about_ca_topic_score_codex":0.00063028885,"about_ca_topic_score_gemma":0.0008254109,"teacher_disagreement_score":0.01889548,"about_ca_system_score_codex":0.0010805695,"about_ca_system_score_gemma":0.00062381447,"threshold_uncertainty_score":0.06321168},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19832462,0.010389362,0.6749588,0.014535212,0.00078849925,0.0003067836,0.0051864567,0.006103227,0.08940702],"genre_scores_gemma":[0.8170845,0.0048466497,0.13225336,0.0034991736,0.002039533,0.00040162224,0.003208047,0.0035829484,0.033084154],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9872519,0.0020773697,0.0005367725,0.0042076567,0.0027971703,0.0031292154],"domain_scores_gemma":[0.87425584,0.08889214,0.0038575388,0.01800029,0.0052000447,0.009794113],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0072458033,0.0034979393,0.0065822876,0.0055525075,0.005022813,0.012433963,0.012357853,0.0056617092,0.02603579],"category_scores_gemma":[0.07158722,0.0037936626,0.0037850353,0.008049802,0.005842702,0.037469864,0.008409084,0.013667097,0.00448624],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002141235,0.0011053655,0.0064269737,0.0016088841,0.0004788531,0.00075851893,0.003229963,0.12664735,0.02040623,0.7011934,0.038551595,0.09745166],"study_design_scores_gemma":[0.00008940831,0.00016420227,0.0015654683,0.00016497202,0.00029497585,0.000518647,0.00028345917,0.24028379,0.0049654497,0.7402844,0.011275561,0.000109572306],"about_ca_topic_score_codex":0.007011942,"about_ca_topic_score_gemma":0.00615424,"teacher_disagreement_score":0.02603579,"about_ca_system_score_codex":0.005846362,"about_ca_system_score_gemma":0.0039101723,"threshold_uncertainty_score":0.08709836},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27446294,0.0012996533,0.4526813,0.017051173,0.0011728905,0.00046896358,0.0012801546,0.0007762112,0.2508069],"genre_scores_gemma":[0.8814798,0.0016227007,0.07003188,0.005233723,0.0013077109,0.0008009825,0.0012250165,0.0004901195,0.03780801],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9962836,0.000934144,0.0001305938,0.001044113,0.0006604361,0.0009471162],"domain_scores_gemma":[0.98348975,0.010605781,0.00093292113,0.0025926935,0.0008968521,0.0014819329],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0042417664,0.0017744065,0.0031891675,0.0018547545,0.003828757,0.00445569,0.005468572,0.004541121,0.016667446],"category_scores_gemma":[0.02765026,0.0009728919,0.0024443227,0.0024516513,0.0073827435,0.019718949,0.0060075894,0.0068005454,0.0021938912],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001855293,0.00007109125,0.00046539333,0.000102063066,0.000031992862,0.00014728511,0.00030661217,0.01868225,0.00069264986,0.95953673,0.012182159,0.0075961715],"study_design_scores_gemma":[0.000072202936,0.000039357303,0.00019909801,0.000028033908,0.000017635515,0.00007999709,0.00008187643,0.049066763,0.000282393,0.9451319,0.004971537,0.000029196082],"about_ca_topic_score_codex":0.006286356,"about_ca_topic_score_gemma":0.004048081,"teacher_disagreement_score":0.016667446,"about_ca_system_score_codex":0.0031920583,"about_ca_system_score_gemma":0.0020999738,"threshold_uncertainty_score":0.05575818},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35474315,0.0035509067,0.15229763,0.04011942,0.0020201858,0.00011550042,0.0011543166,0.0019568792,0.44404206],"genre_scores_gemma":[0.9192653,0.0023726153,0.028816262,0.007362517,0.0017015645,0.00019541594,0.0010962818,0.00043107735,0.038759068],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99736315,0.00068081444,0.00009374989,0.00078477256,0.00052752945,0.00054989784],"domain_scores_gemma":[0.9910653,0.0059017395,0.00040107165,0.0014010816,0.00062634377,0.00060427986],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028789297,0.0008880296,0.0017642245,0.0014693191,0.002583171,0.0028706521,0.0018578724,0.002489924,0.019304773],"category_scores_gemma":[0.015593736,0.0007531899,0.0015635772,0.0016057113,0.005857356,0.010794237,0.0051407525,0.0056355563,0.0038271535],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017471547,0.000041717874,0.0006480636,0.00010442015,0.00002360995,0.00014037699,0.0003902311,0.0033533298,0.00072222366,0.9675309,0.018265465,0.0086048925],"study_design_scores_gemma":[0.000055732224,0.000041974352,0.00033038223,0.000037593214,0.00002467072,0.00019436139,0.00019184912,0.009955247,0.0007441544,0.97631854,0.012086313,0.000019134033],"about_ca_topic_score_codex":0.0013984079,"about_ca_topic_score_gemma":0.00097292714,"teacher_disagreement_score":0.019304773,"about_ca_system_score_codex":0.0014243793,"about_ca_system_score_gemma":0.0010097255,"threshold_uncertainty_score":0.06458092},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.83364934,0.00061526353,0.12916014,0.0002555756,0.00006972604,0.00009517168,0.0004156193,0.00042498772,0.03531413],"genre_scores_gemma":[0.98052007,0.00023331706,0.014666584,0.00009736338,0.00006231731,0.00006578982,0.0003632047,0.00007618249,0.0039150934],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993825,0.00012898946,0.00003870315,0.00015147637,0.00016030463,0.00013788568],"domain_scores_gemma":[0.9973786,0.0010741932,0.0004303531,0.00044881535,0.000280295,0.0003877282],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047652153,0.00031545677,0.0004148279,0.0013435718,0.0007425061,0.001632883,0.0005816862,0.00037717397,0.0029084561],"category_scores_gemma":[0.003324952,0.00035891315,0.00044205916,0.00065550796,0.0016728386,0.0025553666,0.0015106811,0.0006780654,0.00032571083],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017963944,0.000049626415,0.002462915,0.000120196135,0.000022931172,0.0003942457,0.0008153671,0.0049404497,0.010226449,0.95853406,0.0017105314,0.02054365],"study_design_scores_gemma":[0.000030556108,0.000073840405,0.0012993811,0.000027317383,0.00002541728,0.00047890013,0.00035074344,0.021958562,0.005209603,0.963963,0.006569626,0.000013107048],"about_ca_topic_score_codex":0.0008713349,"about_ca_topic_score_gemma":0.0008130605,"teacher_disagreement_score":0.0029084561,"about_ca_system_score_codex":0.000725521,"about_ca_system_score_gemma":0.0003019365,"threshold_uncertainty_score":0.009729803},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8122192,0.00073204254,0.083681434,0.0015979713,0.00018874972,0.00007948073,0.0011579503,0.00097517937,0.09936803],"genre_scores_gemma":[0.9758127,0.00026441456,0.012199315,0.0003067236,0.00011983163,0.00022973765,0.00091909914,0.00026594583,0.0098822275],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99820423,0.00046797935,0.00007899532,0.0004104409,0.00045290336,0.0003853965],"domain_scores_gemma":[0.9921995,0.004282811,0.0006403103,0.0010818877,0.00079577864,0.0009997357],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011908794,0.000697545,0.00079003006,0.003834543,0.0039018295,0.0028616197,0.001773291,0.0018072288,0.012347324],"category_scores_gemma":[0.011894281,0.00086563453,0.000949521,0.0014686112,0.002740126,0.0034365084,0.002308581,0.0021220208,0.0010236908],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000110370194,0.000059974744,0.0022982403,0.0000746924,0.000026012727,0.00043421474,0.0003385976,0.0063412474,0.0022414643,0.97533095,0.0053158146,0.0074284077],"study_design_scores_gemma":[0.000037582337,0.000041286123,0.0014293325,0.000051205792,0.000019026229,0.0012516949,0.00026442742,0.046374347,0.0017079859,0.943554,0.005228802,0.000040377603],"about_ca_topic_score_codex":0.00084448385,"about_ca_topic_score_gemma":0.0010720172,"teacher_disagreement_score":0.012347324,"about_ca_system_score_codex":0.0016433891,"about_ca_system_score_gemma":0.0007223588,"threshold_uncertainty_score":0.04130584},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0032248881,0.021692313,0.03518033,0.009342195,0.0018569615,0.000033257384,0.00032541106,0.00018511912,0.9281596],"genre_scores_gemma":[0.26672024,0.049224112,0.027189257,0.0055649257,0.004686222,0.00022210315,0.00042468862,0.0005296618,0.64543873],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99943036,0.00015390392,0.000024920857,0.000109017616,0.00023079006,0.0000510202],"domain_scores_gemma":[0.99945277,0.00030682574,0.000031539636,0.00008141835,0.00009924713,0.000028184322],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006540178,0.00072219194,0.00067618943,0.0018962105,0.0019852463,0.0028881675,0.0005956914,0.0012654099,0.012087704],"category_scores_gemma":[0.0018316427,0.00046659602,0.000285491,0.0024108859,0.005606925,0.0068391995,0.001554046,0.0030457855,0.0045248736],"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.000002390586,0.0000029241787,0.0000105860145,0.000020509588,0.0000010437603,0.000004493901,0.00010751863,0.00009438686,0.000032991265,0.97714406,0.014362353,0.008216677],"study_design_scores_gemma":[0.0000025274585,0.000002660049,0.000030103165,0.000035874415,0.0000019146864,0.000026613521,0.000051641564,0.00016545298,0.00010269927,0.83088434,0.16869092,0.000005171611],"about_ca_topic_score_codex":0.0018970355,"about_ca_topic_score_gemma":0.0020614855,"teacher_disagreement_score":0.012087704,"about_ca_system_score_codex":0.003521002,"about_ca_system_score_gemma":0.0013427269,"threshold_uncertainty_score":0.0404374},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48153007,0.0048294207,0.30223054,0.009938625,0.00043477435,0.00010554175,0.003115108,0.0010127883,0.19680312],"genre_scores_gemma":[0.9751218,0.0014485391,0.00841543,0.0003666751,0.00031750006,0.00012605396,0.00046065898,0.00012153848,0.0136218155],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983895,0.0005236117,0.00006459045,0.00018554612,0.0004298044,0.00040697723],"domain_scores_gemma":[0.988106,0.009617624,0.00039911302,0.00071523763,0.0009572736,0.0002047024],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019959004,0.00075360626,0.0010295818,0.0016573763,0.0011600367,0.004240725,0.0014813303,0.0016464054,0.008427645],"category_scores_gemma":[0.00944177,0.00044885353,0.0004764296,0.0017763553,0.0029961374,0.0037527084,0.0022375677,0.0015882251,0.0013909612],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024995528,0.000044390086,0.0003963417,0.00019494885,0.00002434409,0.00016117253,0.0004057743,0.038709417,0.0037781172,0.9362639,0.0057933037,0.013978349],"study_design_scores_gemma":[0.0000415338,0.000028458782,0.00027733532,0.000085653504,0.000025598556,0.00017955792,0.00007932359,0.13161716,0.0037730373,0.8616394,0.0021954854,0.00005760137],"about_ca_topic_score_codex":0.0022528279,"about_ca_topic_score_gemma":0.0013492196,"teacher_disagreement_score":0.008427645,"about_ca_system_score_codex":0.0016802793,"about_ca_system_score_gemma":0.0021436512,"threshold_uncertainty_score":0.028193295},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.59394807,0.0052457834,0.19711727,0.009261689,0.00051759405,0.00012045003,0.001931017,0.0019458364,0.18991242],"genre_scores_gemma":[0.96374565,0.0017331899,0.020775892,0.00091369846,0.0005422239,0.00034132312,0.0010949095,0.00044017404,0.010412885],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982919,0.0005298316,0.00004675732,0.00027204116,0.0004676528,0.00039170077],"domain_scores_gemma":[0.9866045,0.009121466,0.00092842354,0.0011466864,0.0008761832,0.0013226218],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018904004,0.0015786047,0.0013910386,0.0037950105,0.0028175132,0.0030496249,0.002526221,0.0014358001,0.014923135],"category_scores_gemma":[0.014189471,0.00082144263,0.0011112229,0.0018354197,0.0034012904,0.0051722485,0.0038323198,0.003997492,0.002599967],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030932188,0.00014126355,0.006016218,0.00032555978,0.00007928467,0.0002602837,0.0009446159,0.020060996,0.0038344632,0.9168531,0.025073051,0.026102027],"study_design_scores_gemma":[0.00003933156,0.00009293622,0.006946431,0.00012268903,0.000092338734,0.0008337438,0.0002085795,0.10869593,0.0039630085,0.86390233,0.014999732,0.00010303292],"about_ca_topic_score_codex":0.0018146893,"about_ca_topic_score_gemma":0.0018153266,"teacher_disagreement_score":0.014923135,"about_ca_system_score_codex":0.0019665856,"about_ca_system_score_gemma":0.000633682,"threshold_uncertainty_score":0.049922824},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22933753,0.0033193857,0.7135841,0.0027375726,0.00015640589,0.00033908364,0.0008910953,0.003112335,0.04652247],"genre_scores_gemma":[0.8342757,0.0016554312,0.14745015,0.00097426394,0.00030053072,0.0009172889,0.0012169952,0.000873382,0.012336198],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99636567,0.0009910297,0.00019428962,0.0011892066,0.00082110136,0.00043861617],"domain_scores_gemma":[0.9749415,0.016239192,0.0015622582,0.0051546413,0.0011283291,0.0009741643],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0039919615,0.0011522071,0.0026301262,0.0016999809,0.0015718942,0.003413984,0.004077737,0.0023391976,0.013491834],"category_scores_gemma":[0.03511929,0.0009210882,0.0016513381,0.0022203086,0.0028945713,0.0102762915,0.004618049,0.0033899283,0.003391506],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008877598,0.0005383707,0.003467032,0.0012272731,0.00029874858,0.00011753961,0.00062533503,0.15682684,0.0067983842,0.67587125,0.01518095,0.13816044],"study_design_scores_gemma":[0.00015422274,0.00020533432,0.0009110874,0.00012778128,0.00011011002,0.00022120206,0.00015428865,0.39776927,0.005359905,0.5895891,0.005350666,0.000046977002],"about_ca_topic_score_codex":0.0007937438,"about_ca_topic_score_gemma":0.0013201224,"teacher_disagreement_score":0.013491834,"about_ca_system_score_codex":0.002942835,"about_ca_system_score_gemma":0.0018961609,"threshold_uncertainty_score":0.045134723},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19676222,0.01100217,0.5098548,0.007752286,0.0013281001,0.000335653,0.004003457,0.0014273704,0.26753393],"genre_scores_gemma":[0.7445356,0.0112922555,0.17427568,0.003448084,0.0027466572,0.0011701414,0.0027885248,0.00065904687,0.05908399],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976278,0.00037644402,0.00018804643,0.0006352117,0.00080402766,0.00036846157],"domain_scores_gemma":[0.9932678,0.0038516545,0.0006579323,0.0010719915,0.000648765,0.0005018534],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030246498,0.0010852308,0.0018748973,0.004525602,0.003722699,0.0052442444,0.0019575646,0.0014660527,0.00918173],"category_scores_gemma":[0.009451956,0.001069355,0.0021982694,0.0042515555,0.0035833318,0.01125311,0.0062565883,0.0036314446,0.0030051658],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000687872,0.000020604719,0.0005256574,0.00014435842,0.000022751685,0.00010281678,0.00021942657,0.0017429655,0.0009389422,0.9794572,0.0045815734,0.01217493],"study_design_scores_gemma":[0.000028232445,0.00003073184,0.00053777813,0.00005552508,0.000031846837,0.00027721666,0.00009098598,0.00662954,0.0007352838,0.96941245,0.02214309,0.000027254722],"about_ca_topic_score_codex":0.0008320585,"about_ca_topic_score_gemma":0.00073592586,"teacher_disagreement_score":0.00918173,"about_ca_system_score_codex":0.0023189567,"about_ca_system_score_gemma":0.0012313718,"threshold_uncertainty_score":0.030716002},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37785432,0.005541935,0.15304698,0.006547808,0.0005037397,0.00008354886,0.0009955706,0.000788296,0.45463789],"genre_scores_gemma":[0.95742023,0.0008755038,0.01513572,0.0004086451,0.00020371075,0.00009672472,0.00024082579,0.00013375116,0.025484832],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980767,0.0007653872,0.000076642034,0.00028088843,0.00053655374,0.00026376412],"domain_scores_gemma":[0.9905785,0.0063498933,0.00068953674,0.0010231923,0.00052279327,0.00083609263],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018279074,0.00047449226,0.00074773683,0.003042856,0.0021348484,0.004533889,0.0010686809,0.0014530531,0.0117090065],"category_scores_gemma":[0.014058656,0.0006407513,0.00054664345,0.0018072649,0.004027733,0.008088024,0.0032245293,0.0029080098,0.0012367418],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002104319,0.000005487157,0.00019306588,0.000020699961,0.0000033929032,0.000016736232,0.00007125006,0.0005013205,0.00014660977,0.9952618,0.0012110808,0.0025474906],"study_design_scores_gemma":[0.000005620194,0.0000036579777,0.00013044762,0.000012627241,0.0000034194736,0.000050106337,0.000034036308,0.0020919694,0.00013363741,0.9954152,0.0021148361,0.0000044388216],"about_ca_topic_score_codex":0.0009993827,"about_ca_topic_score_gemma":0.0017084586,"teacher_disagreement_score":0.0117090065,"about_ca_system_score_codex":0.002771581,"about_ca_system_score_gemma":0.0007404252,"threshold_uncertainty_score":0.039170504},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3459682,0.008286931,0.5362077,0.00972329,0.0004954713,0.0001906293,0.0028782217,0.001046624,0.095202856],"genre_scores_gemma":[0.8428467,0.0036541035,0.1343653,0.0014493702,0.0013170463,0.00045490038,0.0029656813,0.00066753,0.012279295],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9937674,0.0013686491,0.00034072396,0.0012529414,0.002156683,0.0011136822],"domain_scores_gemma":[0.9744056,0.018402293,0.0011600077,0.0029170369,0.0014734601,0.001641662],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00367081,0.0021110766,0.002944625,0.0034909737,0.003314933,0.006100308,0.0045593632,0.0019602347,0.0074830316],"category_scores_gemma":[0.024966316,0.0017776873,0.002287222,0.004205144,0.004244742,0.017361268,0.005445335,0.008016706,0.0019970424],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010197476,0.00019877164,0.0066820993,0.0006769527,0.00024685566,0.00052985246,0.0009628372,0.026983436,0.015687285,0.89143497,0.012095761,0.043481577],"study_design_scores_gemma":[0.00005363851,0.00009714643,0.0032219177,0.00013649675,0.00017049274,0.001027452,0.00033532083,0.11284488,0.014764737,0.8496877,0.01754238,0.00011790017],"about_ca_topic_score_codex":0.00146452,"about_ca_topic_score_gemma":0.001561579,"teacher_disagreement_score":0.0074830316,"about_ca_system_score_codex":0.0028418503,"about_ca_system_score_gemma":0.0011498136,"threshold_uncertainty_score":0.025033236},"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":"commentary","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12879662,0.0070945844,0.08340526,0.4462107,0.013176308,0.00014104623,0.0015079989,0.002182681,0.31748468],"genre_scores_gemma":[0.8428461,0.0039589987,0.028677551,0.07264256,0.0111811645,0.00027616305,0.0014008342,0.0006060446,0.03841056],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9961862,0.0009648959,0.00014629906,0.0010444914,0.0010642738,0.00059387943],"domain_scores_gemma":[0.9788374,0.013526601,0.0008552185,0.002441048,0.0028304595,0.0015093035],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0046695396,0.00089632586,0.0013841664,0.0014453076,0.006096805,0.0028794939,0.0022502816,0.004058636,0.022459738],"category_scores_gemma":[0.02236292,0.0005908971,0.0014009245,0.0020822226,0.011093069,0.012341359,0.0059983223,0.00750626,0.0033538963],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002809926,0.000112352296,0.0019238561,0.0001550824,0.000025494877,0.0003046567,0.001285902,0.0015493863,0.0007482824,0.87723243,0.1070739,0.009307736],"study_design_scores_gemma":[0.00013786244,0.000056455574,0.0016269577,0.00011542832,0.000027870272,0.00030282236,0.0006303053,0.004118321,0.0008319098,0.92120844,0.0708873,0.000056236127],"about_ca_topic_score_codex":0.005628891,"about_ca_topic_score_gemma":0.002699725,"teacher_disagreement_score":0.022459738,"about_ca_system_score_codex":0.002078532,"about_ca_system_score_gemma":0.0011295333,"threshold_uncertainty_score":0.07513535},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.75010127,0.00087336526,0.22537945,0.000849585,0.000079018355,0.00004730675,0.00021201171,0.00030289704,0.022155045],"genre_scores_gemma":[0.9787451,0.00033165913,0.015876185,0.00011154999,0.00006264875,0.00009429379,0.00016161524,0.0000772033,0.004539728],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99811625,0.0007453408,0.000072792056,0.00024827794,0.0005448196,0.0002724585],"domain_scores_gemma":[0.98886454,0.007153783,0.0010330247,0.00049992726,0.0014778682,0.00097093306],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003706381,0.0007605884,0.00080630486,0.0028446864,0.0012082406,0.0020815826,0.0012566234,0.0010084689,0.00401383],"category_scores_gemma":[0.01733459,0.00037593083,0.00087544444,0.0010256647,0.0032681916,0.0034816836,0.001328865,0.0016109125,0.00035178973],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020271073,0.00010873194,0.003636993,0.00012583882,0.00004063539,0.000557496,0.00061377365,0.041407533,0.0059979926,0.9343223,0.001081063,0.011905003],"study_design_scores_gemma":[0.00003215942,0.00011461202,0.0021810045,0.00007700031,0.000017138935,0.00047018495,0.0002795549,0.39454684,0.0041468753,0.5957733,0.002313121,0.00004831574],"about_ca_topic_score_codex":0.001677494,"about_ca_topic_score_gemma":0.000931411,"teacher_disagreement_score":0.00401383,"about_ca_system_score_codex":0.0028283186,"about_ca_system_score_gemma":0.0005649083,"threshold_uncertainty_score":0.020520985},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6397496,0.0019271314,0.09770816,0.0032206797,0.0003497722,0.000112439084,0.0015238315,0.0007309489,0.25467736],"genre_scores_gemma":[0.9495108,0.0007629049,0.03417841,0.00042437032,0.000092112256,0.00012928993,0.0005587214,0.00017159099,0.014171832],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994221,0.00012954515,0.000017552824,0.00014735086,0.00011136626,0.00017211327],"domain_scores_gemma":[0.99852896,0.00080184435,0.00019932682,0.00018588357,0.00011555994,0.00016832449],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005630412,0.00041857857,0.00038523602,0.0005795485,0.0012762498,0.0013193815,0.0011818988,0.0008311935,0.02493325],"category_scores_gemma":[0.0025233822,0.0002151635,0.00042147262,0.0005772427,0.0010141395,0.0025918693,0.0011098138,0.0012281261,0.0028699231],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003980871,0.00024791213,0.00480584,0.00041933433,0.000059916227,0.00043989613,0.00034129,0.01893687,0.016396463,0.87287927,0.01878351,0.0662915],"study_design_scores_gemma":[0.000050245966,0.0001632095,0.0033591727,0.000087097455,0.00005446403,0.0012961484,0.00046405592,0.057838406,0.0200818,0.8560523,0.06048546,0.000067717745],"about_ca_topic_score_codex":0.0009450444,"about_ca_topic_score_gemma":0.0020290483,"teacher_disagreement_score":0.02493325,"about_ca_system_score_codex":0.00079940795,"about_ca_system_score_gemma":0.0006178819,"threshold_uncertainty_score":0.083410025},"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":"commentary","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014169052,0.30872378,0.0054886905,0.39610642,0.15307854,0.000028408509,0.00040453643,0.00019964146,0.12180092],"genre_scores_gemma":[0.33203575,0.19765699,0.003917055,0.0653983,0.12924393,0.000082364626,0.00053702266,0.0013204729,0.26980808],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99749833,0.0009723206,0.000105893094,0.00044245986,0.0006828947,0.00029806304],"domain_scores_gemma":[0.99656373,0.0013412653,0.00027737234,0.00021923844,0.00072260905,0.00087572733],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003962763,0.00058382103,0.00061969925,0.0015371587,0.0029930724,0.005216465,0.0008408814,0.0022036205,0.00607519],"category_scores_gemma":[0.0088757165,0.00045681314,0.00031420693,0.001142855,0.004907727,0.004188242,0.003967594,0.0068164617,0.004771641],"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.0001719336,0.00004401808,0.00058219774,0.0003043132,0.00004118736,0.00034989996,0.0040703146,0.00035269686,0.00059219735,0.3688333,0.5890744,0.03558342],"study_design_scores_gemma":[0.0000048511156,0.00001623403,0.0006442799,0.00021049076,0.000005253476,0.00020309605,0.00045880603,0.000066344866,0.00032257973,0.014073729,0.983976,0.000018368779],"about_ca_topic_score_codex":0.0016334894,"about_ca_topic_score_gemma":0.002128682,"teacher_disagreement_score":0.00607519,"about_ca_system_score_codex":0.003311031,"about_ca_system_score_gemma":0.001390946,"threshold_uncertainty_score":0.024023354},"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":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031318232,0.012077393,0.25643325,0.040711552,0.037130028,0.00022944208,0.0078030284,0.007989798,0.6063072],"genre_scores_gemma":[0.22337033,0.005222093,0.15618806,0.012855869,0.0067855045,0.0003292383,0.0055186176,0.0054627513,0.5842675],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99879897,0.00019504775,0.00006327112,0.0004983109,0.00027726847,0.00016717658],"domain_scores_gemma":[0.9977276,0.00054150267,0.00014643058,0.00082912383,0.0005054549,0.00024994655],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00076808105,0.0011514483,0.0008933546,0.001287273,0.0038860876,0.0037038464,0.0013675907,0.0012490222,0.09581151],"category_scores_gemma":[0.005051769,0.0009448499,0.0011435258,0.0016895842,0.0032959655,0.0074351854,0.0030978203,0.0041212705,0.040133204],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00032838897,0.00007608526,0.00084434677,0.00030045994,0.000049626342,0.0007581065,0.00079504395,0.0006129961,0.007307753,0.67901725,0.240967,0.068942934],"study_design_scores_gemma":[0.000019747513,0.000074315896,0.0007725896,0.00013611173,0.00003201473,0.0010621902,0.00025306604,0.0015082491,0.004060164,0.32319587,0.66881996,0.00006579279],"about_ca_topic_score_codex":0.0022659989,"about_ca_topic_score_gemma":0.004430937,"teacher_disagreement_score":0.09581151,"about_ca_system_score_codex":0.0015970316,"about_ca_system_score_gemma":0.0009334899,"threshold_uncertainty_score":0.32052147},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48114625,0.0034882096,0.24322532,0.057060827,0.0019496152,0.00008759302,0.0009677314,0.0006767622,0.21139771],"genre_scores_gemma":[0.9687659,0.0008887186,0.013489912,0.0030573967,0.0010995235,0.000091036454,0.00028540814,0.00011056109,0.0122115575],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.996738,0.0009288661,0.00015489421,0.00090207934,0.0009938604,0.0002823219],"domain_scores_gemma":[0.9860476,0.0098573435,0.000766865,0.001360017,0.0011935283,0.00077457336],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004802311,0.00045690156,0.0014838185,0.00163035,0.0029287657,0.004121089,0.0011255222,0.002267786,0.005926806],"category_scores_gemma":[0.01964766,0.0005606448,0.0010660655,0.0015464659,0.008385139,0.009737884,0.0049796537,0.0040699793,0.0006702742],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009755952,0.000022368971,0.0005954547,0.00003972241,0.000011587176,0.00009105662,0.00020450982,0.001993799,0.00034752543,0.9887263,0.004051954,0.0038181494],"study_design_scores_gemma":[0.000025701365,0.000018677416,0.00023323258,0.000029933593,0.0000098316295,0.00012774146,0.000119925106,0.008672748,0.0004682596,0.98483974,0.0054386347,0.000015544843],"about_ca_topic_score_codex":0.0007728946,"about_ca_topic_score_gemma":0.0005045328,"teacher_disagreement_score":0.005926806,"about_ca_system_score_codex":0.0021429118,"about_ca_system_score_gemma":0.00063113065,"threshold_uncertainty_score":0.02539736},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.58837056,0.0014308847,0.23147619,0.0013835161,0.00033637095,0.0001269573,0.0004224378,0.00072386157,0.17572926],"genre_scores_gemma":[0.9576555,0.00041166545,0.021600619,0.00035595294,0.00016780435,0.00013309885,0.00016909998,0.00024123302,0.019265106],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988852,0.00022621783,0.000049178914,0.0002860147,0.00029915993,0.00025425357],"domain_scores_gemma":[0.9950153,0.0017652394,0.00060631084,0.000700327,0.00096003606,0.00095266494],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011614597,0.00041304866,0.0009079644,0.002062288,0.0014859501,0.002620834,0.001212857,0.0010503492,0.0084707495],"category_scores_gemma":[0.008934707,0.0004732086,0.00063406443,0.0007195844,0.0023528489,0.0051336195,0.003562646,0.0019714378,0.001020881],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029323903,0.000016374499,0.0009416451,0.000042257037,0.0000051559155,0.000112076785,0.00017670821,0.0013948628,0.0017626329,0.98956406,0.00085702894,0.0050978237],"study_design_scores_gemma":[0.000018581444,0.00006817265,0.0019913348,0.000055261946,0.00001271882,0.0005316193,0.00024048962,0.045271967,0.0034894748,0.94063747,0.007658961,0.000023989554],"about_ca_topic_score_codex":0.0010914662,"about_ca_topic_score_gemma":0.0011252767,"teacher_disagreement_score":0.0084707495,"about_ca_system_score_codex":0.0013343348,"about_ca_system_score_gemma":0.00054803793,"threshold_uncertainty_score":0.028337479},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0032850932,0.004035075,0.023838887,0.0015247294,0.001420719,0.00006456009,0.00074582576,0.0003788347,0.9647061],"genre_scores_gemma":[0.053672053,0.006709605,0.03078103,0.00090280577,0.00082385953,0.00022338978,0.0017374121,0.0003843865,0.90476555],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995516,0.00009792297,0.000030453619,0.000104845734,0.0001655197,0.00004966036],"domain_scores_gemma":[0.9995104,0.00018824935,0.00003277741,0.00007271516,0.00014407228,0.00005185707],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003395414,0.0010407526,0.0006810264,0.0020112235,0.0015578736,0.004150836,0.0008057538,0.00055587076,0.06628017],"category_scores_gemma":[0.0021891221,0.0004616833,0.000301986,0.0030862612,0.0014758665,0.0058166115,0.001180634,0.0020653591,0.029188579],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016826672,0.000014613329,0.00006497392,0.0001235802,0.000002169173,0.000026974578,0.00030684914,0.00015948329,0.00034854756,0.85986567,0.061996788,0.07707348],"study_design_scores_gemma":[0.0000064378637,0.000012318962,0.00009636019,0.00012750916,0.0000050048516,0.00012245364,0.00018007417,0.00033189286,0.00039360407,0.36147916,0.6372375,0.000007656083],"about_ca_topic_score_codex":0.000828338,"about_ca_topic_score_gemma":0.001170496,"teacher_disagreement_score":0.06628017,"about_ca_system_score_codex":0.0015651718,"about_ca_system_score_gemma":0.0011734292,"threshold_uncertainty_score":0.22172928},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.55618745,0.0014191713,0.32777026,0.003039128,0.00031763717,0.0001275381,0.00078190886,0.005719304,0.104637526],"genre_scores_gemma":[0.92337483,0.00033672497,0.06625487,0.00044610896,0.00009096557,0.00009086949,0.00043023916,0.0004091673,0.008566298],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998212,0.0004659487,0.00005492037,0.00031973256,0.00041231193,0.0005350326],"domain_scores_gemma":[0.99436533,0.002316995,0.00033695382,0.0019567893,0.0005643908,0.00045955653],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011872895,0.0007016754,0.0010313852,0.00088103215,0.0015056947,0.0019532254,0.0020640926,0.00140331,0.007719666],"category_scores_gemma":[0.011017545,0.00047930112,0.0005075964,0.0008880241,0.0021624402,0.0038141967,0.0025101965,0.001461803,0.0017204251],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009727963,0.0002723238,0.002377026,0.00038183946,0.000063536696,0.00031342424,0.0009450797,0.1287181,0.031842068,0.7082991,0.032090776,0.09372398],"study_design_scores_gemma":[0.00016176846,0.00011879084,0.00077498605,0.000046059227,0.000043254775,0.00031021814,0.00020961983,0.2965865,0.007478978,0.6836311,0.010587023,0.00005161528],"about_ca_topic_score_codex":0.0040664184,"about_ca_topic_score_gemma":0.006281756,"teacher_disagreement_score":0.007719666,"about_ca_system_score_codex":0.0027107839,"about_ca_system_score_gemma":0.0012447455,"threshold_uncertainty_score":0.025824845},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9521419,0.0006445478,0.014731429,0.00019362029,0.000025825224,0.000014277338,0.0001087042,0.00007991501,0.032059804],"genre_scores_gemma":[0.9928727,0.00026550837,0.0045532384,0.00005262079,0.000045481214,0.000052423195,0.00020311236,0.0000251208,0.0019297015],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99888915,0.00026546806,0.00006316319,0.00022831108,0.00032311512,0.0002308286],"domain_scores_gemma":[0.9959766,0.00251054,0.0006311717,0.00020962038,0.00021678903,0.00045529054],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016121547,0.00065660215,0.00055427174,0.0037420823,0.0020080446,0.0033339001,0.00080887246,0.001002205,0.0040003485],"category_scores_gemma":[0.00572112,0.00046838075,0.0004718182,0.001464748,0.0029816693,0.0031727734,0.0027203644,0.0010280894,0.00040611989],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033863442,0.00011880183,0.010218743,0.00014606075,0.000040695522,0.0012335557,0.0010415033,0.008653045,0.011483808,0.9467681,0.0009409028,0.019016014],"study_design_scores_gemma":[0.000044859004,0.0001960587,0.005161098,0.00014675409,0.000047610152,0.0018528533,0.00090923865,0.025014339,0.014248517,0.9456418,0.0066658366,0.000071075294],"about_ca_topic_score_codex":0.00023989835,"about_ca_topic_score_gemma":0.00027869153,"teacher_disagreement_score":0.0040003485,"about_ca_system_score_codex":0.00093888683,"about_ca_system_score_gemma":0.00032708966,"threshold_uncertainty_score":0.013382435},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95769405,0.00018068867,0.018339036,0.0012426074,0.00014588972,0.000036190533,0.00036656586,0.00021835366,0.021776592],"genre_scores_gemma":[0.9884553,0.00014784565,0.0032353543,0.00013996611,0.00014197583,0.00006024571,0.00035201892,0.00014366885,0.007323503],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99911505,0.00019078272,0.00002673019,0.0002068288,0.00024451612,0.00021609673],"domain_scores_gemma":[0.9915833,0.0037638799,0.0012841055,0.0010196691,0.00057215936,0.0017770563],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012708234,0.0006412202,0.0009084815,0.003368791,0.0028792967,0.003930739,0.001955036,0.0017888644,0.012297507],"category_scores_gemma":[0.008253136,0.00078366126,0.0008341836,0.0016426697,0.004590701,0.004270361,0.0027288029,0.0024907817,0.0007255483],"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.00048084636,0.00008428724,0.0028443974,0.00007430155,0.00003991244,0.0001427377,0.000423125,0.0102588665,0.005390714,0.9707364,0.0036898772,0.0058346773],"study_design_scores_gemma":[0.00014735697,0.00008092165,0.0044261133,0.00005292915,0.000050200615,0.0002685179,0.0003462731,0.08477541,0.0027770658,0.90447426,0.0025121297,0.00008883734],"about_ca_topic_score_codex":0.0022935725,"about_ca_topic_score_gemma":0.0025458399,"teacher_disagreement_score":0.012297507,"about_ca_system_score_codex":0.0022674503,"about_ca_system_score_gemma":0.0010159793,"threshold_uncertainty_score":0.041139245},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.87873083,0.0008757486,0.10482389,0.0010496859,0.000052535543,0.0000273055,0.00020172648,0.00020968715,0.014028545],"genre_scores_gemma":[0.9947589,0.00024685686,0.0038681456,0.000046004872,0.000053008986,0.000021822501,0.00006587556,0.000041876334,0.00089750165],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99950254,0.00017906706,0.00002037032,0.00009801945,0.00013253067,0.00006747586],"domain_scores_gemma":[0.990217,0.006805696,0.0011217337,0.00072474795,0.00054575474,0.0005851513],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017379689,0.0002640477,0.00049017405,0.0017389852,0.00064533734,0.001304708,0.0007137188,0.00067405205,0.0016414822],"category_scores_gemma":[0.010446633,0.00026654496,0.00040817072,0.00068795733,0.0030058715,0.0028354053,0.001032204,0.0007679529,0.00013382366],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007891297,0.000049105256,0.0055959895,0.00009878996,0.000032441927,0.00024043252,0.0003388518,0.08064444,0.008471426,0.89662564,0.0010855006,0.0067385896],"study_design_scores_gemma":[0.000010871044,0.000035318953,0.0037199256,0.000028535327,0.000012655147,0.000266943,0.000100452395,0.24938211,0.0025038894,0.7429252,0.000989734,0.000024391948],"about_ca_topic_score_codex":0.0009628834,"about_ca_topic_score_gemma":0.00064052024,"teacher_disagreement_score":0.0017389852,"about_ca_system_score_codex":0.0012012641,"about_ca_system_score_gemma":0.00028363365,"threshold_uncertainty_score":0.009191334},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9033608,0.0011040553,0.051918846,0.0021186431,0.00006457295,0.000020381662,0.00023695907,0.00023454196,0.040941153],"genre_scores_gemma":[0.99303997,0.00015609707,0.003350741,0.00012050898,0.000095619085,0.00002551955,0.00006859052,0.000032684573,0.003110277],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993882,0.0001558604,0.00003128507,0.00013480644,0.0001405594,0.00014924206],"domain_scores_gemma":[0.9964893,0.0022998268,0.00037702196,0.00025070878,0.00021326052,0.00036989228],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012732871,0.00034006865,0.0007359809,0.0013702445,0.0013683635,0.002161438,0.00081423356,0.0008102765,0.0051544127],"category_scores_gemma":[0.008095798,0.0004159392,0.0004888568,0.00094008044,0.0027613202,0.004500095,0.001738846,0.001443081,0.00052219693],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029488653,0.000054053766,0.002200064,0.00019849224,0.000026720201,0.00028875328,0.0006602918,0.007239374,0.006995251,0.9630193,0.0027949945,0.016227826],"study_design_scores_gemma":[0.000031441894,0.00004580016,0.0017278702,0.000026440168,0.000016678008,0.00023716562,0.00017791298,0.021340184,0.0023683677,0.971854,0.0021508809,0.000023430699],"about_ca_topic_score_codex":0.00047961783,"about_ca_topic_score_gemma":0.0005838286,"teacher_disagreement_score":0.0051544127,"about_ca_system_score_codex":0.0011851698,"about_ca_system_score_gemma":0.00025248723,"threshold_uncertainty_score":0.017243207},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.63130844,0.0013141512,0.332592,0.00089999236,0.00011755874,0.000055287106,0.00018254762,0.0002564946,0.03327353],"genre_scores_gemma":[0.96109885,0.0007480138,0.028722908,0.00016764767,0.000106009196,0.00013373267,0.00016993214,0.00013161427,0.008721314],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99910885,0.0003056112,0.000032811644,0.0001371226,0.00027334868,0.000142272],"domain_scores_gemma":[0.9948153,0.0029697497,0.0007358954,0.0002677474,0.0006819164,0.0005294232],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018295802,0.0006944971,0.00063171226,0.0023563302,0.0010767801,0.0019812756,0.0012474295,0.0008332252,0.002922637],"category_scores_gemma":[0.010589817,0.00031213873,0.0006631814,0.0011335382,0.0034002527,0.003326857,0.0014079838,0.0014877194,0.00047733847],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000051620715,0.000050234128,0.00085503433,0.00006179528,0.00001613515,0.00018624665,0.00032878466,0.011283941,0.0031308297,0.9753264,0.0005161503,0.008192785],"study_design_scores_gemma":[0.000012638003,0.00006003584,0.0010241148,0.00005068984,0.0000130433555,0.00029872844,0.0002034627,0.15379524,0.0033038615,0.8380921,0.0031123736,0.000033708286],"about_ca_topic_score_codex":0.001428224,"about_ca_topic_score_gemma":0.0010780637,"teacher_disagreement_score":0.002922637,"about_ca_system_score_codex":0.0019097005,"about_ca_system_score_gemma":0.00055330974,"threshold_uncertainty_score":0.013855934},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6797844,0.0021495041,0.22183663,0.0010879484,0.00075116206,0.0001558718,0.0019542186,0.0014965598,0.09078367],"genre_scores_gemma":[0.8083252,0.00096088566,0.16211918,0.00039958913,0.0003006309,0.0002993021,0.002692928,0.0007035422,0.02419872],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992956,0.0000833586,0.00007678614,0.00023159495,0.00017074494,0.0001418666],"domain_scores_gemma":[0.99730444,0.0010726429,0.00040059493,0.0005360348,0.00047765262,0.00020847643],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005853081,0.0007575791,0.0006543913,0.0012121202,0.0024510953,0.0017302328,0.0012299318,0.0010232291,0.011116235],"category_scores_gemma":[0.0074954154,0.00043918326,0.0007015617,0.0014827317,0.001277602,0.003973619,0.0017738999,0.0015307866,0.003927669],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010071791,0.00023264215,0.0076321727,0.0012004566,0.000077997334,0.001645688,0.0013466716,0.013603953,0.06237822,0.7309794,0.009103211,0.17079245],"study_design_scores_gemma":[0.00008167255,0.00034785646,0.003916152,0.00043139354,0.0001508699,0.0031432416,0.00080117804,0.0358098,0.054235324,0.8476566,0.053232692,0.00019329929],"about_ca_topic_score_codex":0.00033432574,"about_ca_topic_score_gemma":0.0007702635,"teacher_disagreement_score":0.011116235,"about_ca_system_score_codex":0.0006810037,"about_ca_system_score_gemma":0.00092674326,"threshold_uncertainty_score":0.037187517},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8422731,0.0036910176,0.13431269,0.0021617368,0.00013252733,0.000121619036,0.00038327713,0.00061954756,0.01630445],"genre_scores_gemma":[0.9889436,0.0011330325,0.006051707,0.00023526826,0.00011242849,0.00014123063,0.00020119186,0.000094257164,0.0030872126],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990188,0.00035628356,0.000035198584,0.00022953456,0.00018820378,0.00017200578],"domain_scores_gemma":[0.99142283,0.0048987796,0.0015220889,0.00070581556,0.0005834543,0.0008669352],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016244457,0.000528106,0.000911802,0.002836004,0.0011504217,0.002187401,0.0013275057,0.0015154608,0.0029406492],"category_scores_gemma":[0.01588491,0.00084655965,0.00058826606,0.0015007557,0.0027718025,0.0036825375,0.0014576697,0.0011369382,0.00045858583],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023016839,0.000059759437,0.005056015,0.00017969879,0.00006891025,0.00042168977,0.0006191691,0.054235216,0.0036021685,0.9174119,0.0036560744,0.014459301],"study_design_scores_gemma":[0.00005367226,0.000049518057,0.0016165067,0.00005853871,0.000033529504,0.00034328975,0.00016166354,0.188336,0.0012279171,0.80490977,0.0031680467,0.000041530155],"about_ca_topic_score_codex":0.0020149606,"about_ca_topic_score_gemma":0.001908483,"teacher_disagreement_score":0.0029406492,"about_ca_system_score_codex":0.0019274784,"about_ca_system_score_gemma":0.0005323082,"threshold_uncertainty_score":0.013984919},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35004106,0.0025599718,0.561242,0.0034850792,0.0003392814,0.00024622824,0.0011737418,0.0005405686,0.08037213],"genre_scores_gemma":[0.8824854,0.002507058,0.09812113,0.0010492147,0.0005697152,0.0005181344,0.0011653455,0.00020733628,0.013376575],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9965501,0.00073573855,0.00028178535,0.0009108226,0.0008750687,0.0006464769],"domain_scores_gemma":[0.98815197,0.0063615935,0.0013736894,0.0022048878,0.0010690435,0.0008387239],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00490891,0.00089897605,0.0020168638,0.0026389644,0.003227851,0.0040296484,0.002438466,0.0014289389,0.007908099],"category_scores_gemma":[0.016198212,0.0009021887,0.0022002251,0.0026265625,0.0046421634,0.010934109,0.005064177,0.004260267,0.0011833282],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005583275,0.000018169629,0.00071277306,0.00007307111,0.000022044416,0.00007559863,0.00030313173,0.0043654526,0.0007774505,0.98734075,0.0015895771,0.00466616],"study_design_scores_gemma":[0.00004460988,0.00004261319,0.0008205971,0.000037634454,0.0000426427,0.0003090002,0.00020789023,0.030619944,0.0016913264,0.95879143,0.0073530395,0.00003940467],"about_ca_topic_score_codex":0.0012637688,"about_ca_topic_score_gemma":0.0011571147,"teacher_disagreement_score":0.007908099,"about_ca_system_score_codex":0.0030284913,"about_ca_system_score_gemma":0.00096506,"threshold_uncertainty_score":0.026455224},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16425171,0.006571421,0.11404326,0.011073275,0.001201494,0.00012888729,0.0011791667,0.00077857694,0.7007722],"genre_scores_gemma":[0.9009894,0.0020575472,0.02651225,0.0015754211,0.0007095844,0.0002848524,0.0004649452,0.00016092104,0.067244895],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99934345,0.00020756994,0.000028949278,0.00013192954,0.00019024378,0.00009782643],"domain_scores_gemma":[0.9961636,0.0023255085,0.00033098395,0.00034716006,0.0003445728,0.00048819554],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011995318,0.0006106566,0.00051537843,0.0020850443,0.0015533239,0.0027623577,0.0008538113,0.0011091385,0.020446844],"category_scores_gemma":[0.0076044225,0.00034904006,0.0005272419,0.0011421998,0.002627306,0.008359027,0.002039114,0.0031704726,0.0020057992],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002064059,0.000012926138,0.00009598615,0.000050164024,0.000003207469,0.000022929691,0.000085966705,0.0003434863,0.00037049834,0.9906625,0.0045126444,0.0038190775],"study_design_scores_gemma":[0.000007020115,0.0000063236585,0.00013808432,0.000018594988,0.0000042141237,0.00007812024,0.000046607038,0.0017438531,0.00025838715,0.9921799,0.0055141677,0.000004896107],"about_ca_topic_score_codex":0.0006390897,"about_ca_topic_score_gemma":0.0011999552,"teacher_disagreement_score":0.020446844,"about_ca_system_score_codex":0.0012100978,"about_ca_system_score_gemma":0.00058693317,"threshold_uncertainty_score":0.068401456},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.749549,0.001512806,0.18576513,0.0011820133,0.00020886528,0.000054941807,0.0013497549,0.0013489106,0.05902862],"genre_scores_gemma":[0.9618923,0.00019277558,0.03338752,0.00018573625,0.00006274523,0.00006463056,0.0011094373,0.00038173186,0.0027230878],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99871206,0.00023405034,0.000057358306,0.0003159699,0.0003535676,0.00032688718],"domain_scores_gemma":[0.9940258,0.00397361,0.0005186741,0.0007891867,0.00029328399,0.0003994193],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010519936,0.0010425941,0.001104959,0.0025996394,0.001999869,0.0027585798,0.0021625874,0.0016076249,0.015626198],"category_scores_gemma":[0.012843951,0.0007945563,0.0007716512,0.0017410043,0.0028109082,0.004905587,0.0026641416,0.0020980472,0.0012354602],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009093474,0.00032452983,0.008394987,0.00055408344,0.000107156346,0.00073539675,0.00060861185,0.16524714,0.00482359,0.75420386,0.015926896,0.0481644],"study_design_scores_gemma":[0.00003825621,0.00004356768,0.0006871073,0.00006223795,0.000023974282,0.0001826291,0.00014348346,0.16625047,0.0024955987,0.8281694,0.0018669178,0.000036396956],"about_ca_topic_score_codex":0.0011698456,"about_ca_topic_score_gemma":0.0022047835,"teacher_disagreement_score":0.015626198,"about_ca_system_score_codex":0.0014123337,"about_ca_system_score_gemma":0.0006943061,"threshold_uncertainty_score":0.052274823},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014135095,0.054303914,0.32664457,0.024911195,0.034728773,0.00028504172,0.002939877,0.00371948,0.5383321],"genre_scores_gemma":[0.35037893,0.05164873,0.22247957,0.017162288,0.03897527,0.00089487265,0.0049152332,0.0041825566,0.30936247],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992606,0.00011422158,0.000051021947,0.00015511956,0.00034201358,0.00007704826],"domain_scores_gemma":[0.99888057,0.00058625074,0.00005503273,0.00009686745,0.000281837,0.00009939239],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010112836,0.002403212,0.0013788963,0.0032264641,0.0018571828,0.0028996416,0.0014336953,0.0015789196,0.038361937],"category_scores_gemma":[0.0027586743,0.00088890415,0.0020053382,0.0033483477,0.0026452318,0.0056862007,0.0030297183,0.0056704697,0.012332888],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012213309,0.00018630551,0.00026500903,0.0013402182,0.00010561396,0.00063691667,0.00049312616,0.0021478971,0.0060151774,0.73049647,0.11934716,0.13884397],"study_design_scores_gemma":[0.000021169517,0.000053358293,0.000723366,0.0001354359,0.000046982936,0.0004513537,0.00006703668,0.0011665937,0.0014162319,0.83414507,0.16171448,0.000059004316],"about_ca_topic_score_codex":0.0009551584,"about_ca_topic_score_gemma":0.0010231473,"teacher_disagreement_score":0.038361937,"about_ca_system_score_codex":0.0013712778,"about_ca_system_score_gemma":0.0006814357,"threshold_uncertainty_score":0.12833345},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17152454,0.014487574,0.07278604,0.01779456,0.0022464579,0.000106160944,0.0021720405,0.0017553173,0.7171274],"genre_scores_gemma":[0.9111405,0.0047948654,0.029477239,0.0032469358,0.0017545389,0.00026424197,0.0012660401,0.00045934453,0.047596324],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975184,0.0004913854,0.000094010524,0.0005729147,0.0007074803,0.00061570737],"domain_scores_gemma":[0.9915479,0.0058232713,0.00030837097,0.00085136574,0.00046992718,0.0009991569],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027585155,0.0013386626,0.0013632838,0.002288891,0.0032509225,0.004410781,0.002177332,0.0021812504,0.02889613],"category_scores_gemma":[0.011755409,0.0008324078,0.0009118654,0.0020133427,0.0037509901,0.010767798,0.0051567233,0.0045657824,0.0070673777],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00063725346,0.00016409517,0.0010036242,0.00050302455,0.00006245141,0.00024946732,0.0005332677,0.0042345766,0.00474584,0.9105495,0.040329084,0.036987796],"study_design_scores_gemma":[0.00004974663,0.000062102394,0.0012097023,0.00013091964,0.00005400363,0.00030287067,0.00011986442,0.006283786,0.0027500158,0.95488095,0.034083396,0.00007258374],"about_ca_topic_score_codex":0.0015927644,"about_ca_topic_score_gemma":0.0028544948,"teacher_disagreement_score":0.02889613,"about_ca_system_score_codex":0.0022123957,"about_ca_system_score_gemma":0.0013853684,"threshold_uncertainty_score":0.09666717},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14382383,0.0017910976,0.76644564,0.0023769927,0.00034447972,0.00027956767,0.0013076123,0.00095790304,0.082672805],"genre_scores_gemma":[0.75867176,0.001838222,0.20561078,0.001211242,0.0008975484,0.0006745259,0.0015383472,0.00040219974,0.02915535],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99697745,0.00049117557,0.00023518523,0.0008307546,0.0010120836,0.00045332537],"domain_scores_gemma":[0.99276555,0.0043110154,0.0005228431,0.0012360403,0.0007505591,0.00041401453],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002745321,0.00088152295,0.0016499292,0.0026225932,0.0040208376,0.003876021,0.0018767436,0.001789189,0.0121091725],"category_scores_gemma":[0.010397377,0.0009788289,0.0026526116,0.0036049008,0.005239513,0.012015034,0.004070712,0.003834226,0.0020192896],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004601012,0.00001903898,0.00046804367,0.00012286179,0.000025057436,0.00009398075,0.00037047008,0.0035569416,0.0012467977,0.98218334,0.0031786307,0.008688746],"study_design_scores_gemma":[0.00003118395,0.00004615198,0.00045061103,0.000037113452,0.00003423355,0.00040817252,0.0000879257,0.01757996,0.0022768022,0.96680856,0.0122084515,0.000030829226],"about_ca_topic_score_codex":0.0014547831,"about_ca_topic_score_gemma":0.0013947781,"teacher_disagreement_score":0.0121091725,"about_ca_system_score_codex":0.0028645848,"about_ca_system_score_gemma":0.0012525235,"threshold_uncertainty_score":0.040509164},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29788673,0.0020743194,0.5889914,0.0030056236,0.00032686448,0.00013858949,0.0010244529,0.00075132924,0.10580067],"genre_scores_gemma":[0.900927,0.0011139617,0.0766559,0.00085592817,0.00018038988,0.00022316788,0.0005209326,0.00014220264,0.019380474],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995165,0.00006874739,0.000023612836,0.0001543704,0.00013068327,0.00010604037],"domain_scores_gemma":[0.99755186,0.0014019123,0.0001827376,0.0003517936,0.00029642068,0.00021526289],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007679555,0.00052511465,0.00047575883,0.0013732604,0.0014169343,0.0012654569,0.0011588235,0.0005636901,0.0067683407],"category_scores_gemma":[0.0047893883,0.00032232646,0.000829626,0.0009615028,0.001871562,0.0028373958,0.0016933865,0.0016492695,0.0007415293],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000072466944,0.00001590728,0.0011711582,0.0001121797,0.000021739977,0.00011545118,0.0003385491,0.008320543,0.00389718,0.9576774,0.004268864,0.02398857],"study_design_scores_gemma":[0.000023363646,0.000044191704,0.00090597046,0.0000361866,0.000025182506,0.00027801446,0.00010492771,0.025525775,0.0026213662,0.9524032,0.018004488,0.000027395456],"about_ca_topic_score_codex":0.004223638,"about_ca_topic_score_gemma":0.004717879,"teacher_disagreement_score":0.0067683407,"about_ca_system_score_codex":0.0021406473,"about_ca_system_score_gemma":0.00090563286,"threshold_uncertainty_score":0.022642374},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.77498275,0.0010944407,0.20151177,0.0008396811,0.00008494311,0.00003356531,0.00022465577,0.00020293288,0.021025281],"genre_scores_gemma":[0.9800143,0.00038201513,0.013884739,0.000066435,0.0000850912,0.000042167976,0.00017757749,0.000075613076,0.0052720103],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99925584,0.00020570043,0.000027750046,0.00016639725,0.0002355663,0.00010861413],"domain_scores_gemma":[0.9970216,0.001313766,0.000499351,0.00027213065,0.0002769628,0.00061625405],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012164006,0.0005783996,0.00060371653,0.0019943954,0.000982767,0.0016508726,0.0011490328,0.0006277149,0.002340248],"category_scores_gemma":[0.005593213,0.00032845617,0.00055186317,0.0009331501,0.0031210422,0.0029333003,0.0018148187,0.0014133878,0.00024314219],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008982126,0.00002485271,0.0014868339,0.000052287756,0.000016589043,0.00019713237,0.00025716546,0.033237707,0.005979416,0.9507433,0.00057708094,0.0073378216],"study_design_scores_gemma":[0.000019878118,0.000065236236,0.0022651008,0.000026138317,0.0000119710785,0.00040942262,0.00020505492,0.26993513,0.0034225574,0.72085613,0.002736053,0.00004731467],"about_ca_topic_score_codex":0.001537951,"about_ca_topic_score_gemma":0.0010584294,"teacher_disagreement_score":0.002340248,"about_ca_system_score_codex":0.0021720664,"about_ca_system_score_gemma":0.0004204782,"threshold_uncertainty_score":0.015759528},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04916282,0.009078717,0.7353005,0.009345737,0.0012945199,0.0000753989,0.00088343857,0.00076390523,0.19409496],"genre_scores_gemma":[0.6039471,0.009798284,0.2740529,0.0062815347,0.004879242,0.0006922576,0.0024421196,0.001334403,0.09657219],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99721634,0.00069941755,0.00016265444,0.00080017874,0.00087654195,0.00024494264],"domain_scores_gemma":[0.99045897,0.0070841387,0.00034312927,0.00080300187,0.0007633859,0.0005474893],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027049838,0.0010270155,0.0018528452,0.0032193505,0.004233392,0.00533042,0.002610083,0.0022561185,0.013576216],"category_scores_gemma":[0.011469046,0.0014129195,0.0027065456,0.003958136,0.007447121,0.022165664,0.007234822,0.010062505,0.002214914],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013310315,0.000010189754,0.00008822943,0.000037800146,0.0000072028174,0.000027979353,0.00019845206,0.00023529779,0.0001888177,0.9929085,0.0017412229,0.0045431443],"study_design_scores_gemma":[0.000006327969,0.0000028287368,0.00004821938,0.000009310466,0.000005987385,0.00003763141,0.000040016046,0.00064153783,0.00011988379,0.99469674,0.0043871813,0.000004269058],"about_ca_topic_score_codex":0.0018865796,"about_ca_topic_score_gemma":0.001378786,"teacher_disagreement_score":0.013576216,"about_ca_system_score_codex":0.002263679,"about_ca_system_score_gemma":0.0010490202,"threshold_uncertainty_score":0.04541695},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8869774,0.0014606987,0.023577487,0.0027463492,0.00022159453,0.000045672958,0.00035738962,0.00025401288,0.08435928],"genre_scores_gemma":[0.99156624,0.00047673122,0.002536312,0.00016484773,0.0002855856,0.00005093748,0.00022536461,0.00005438082,0.00463945],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992514,0.00016323385,0.00003474183,0.00013322098,0.00024171242,0.00017560502],"domain_scores_gemma":[0.9925459,0.004059007,0.00090948964,0.00032368634,0.0004951194,0.0016667182],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001232317,0.00071365526,0.0012221601,0.004490985,0.0025044254,0.0050379466,0.0019401865,0.0015761415,0.009843045],"category_scores_gemma":[0.0108656185,0.0010754875,0.00042296568,0.001859956,0.004620939,0.0058684587,0.002195065,0.001968568,0.00052210287],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013965521,0.000037387803,0.0010491516,0.00008848516,0.000014471707,0.00011111074,0.00035281875,0.0025776927,0.0019660136,0.9875651,0.0023528766,0.0037451435],"study_design_scores_gemma":[0.0000515493,0.000024853363,0.00096937694,0.00003923512,0.000017281285,0.0002823765,0.00019437385,0.015997209,0.0012126778,0.9795634,0.0016267081,0.000020959209],"about_ca_topic_score_codex":0.0012088479,"about_ca_topic_score_gemma":0.0013024614,"teacher_disagreement_score":0.009843045,"about_ca_system_score_codex":0.002062142,"about_ca_system_score_gemma":0.0006808077,"threshold_uncertainty_score":0.032928288},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.80137557,0.0014097403,0.16714254,0.0054077297,0.0002265607,0.00013620834,0.0006297186,0.0016252602,0.022046618],"genre_scores_gemma":[0.98623484,0.00041921067,0.008497092,0.00034469587,0.00020791913,0.00009135683,0.00022900746,0.00021884892,0.0037569616],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99844885,0.0006140942,0.00005798738,0.0003535366,0.00024287478,0.00028257814],"domain_scores_gemma":[0.9688692,0.021794928,0.0022202444,0.0022472732,0.0015436035,0.0033247056],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006052798,0.00065533427,0.001960676,0.004154614,0.002110952,0.0056333253,0.004518278,0.0031622988,0.008700817],"category_scores_gemma":[0.051168952,0.001721427,0.0016114333,0.0017573728,0.0065204357,0.009593908,0.0028262066,0.00405516,0.0007616654],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018984225,0.0001739673,0.0027697643,0.00015559582,0.000041249987,0.00028016756,0.00078216445,0.014770414,0.0032313818,0.96986365,0.0032800813,0.004461602],"study_design_scores_gemma":[0.00007915342,0.000079089725,0.0031174337,0.00010031938,0.00004624425,0.0005415033,0.00044751738,0.24035054,0.0013817963,0.7525982,0.0011781773,0.00008001492],"about_ca_topic_score_codex":0.0027801262,"about_ca_topic_score_gemma":0.0017497187,"teacher_disagreement_score":0.008700817,"about_ca_system_score_codex":0.003202278,"about_ca_system_score_gemma":0.0011587819,"threshold_uncertainty_score":0.032010615},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7665125,0.0024842937,0.112937875,0.0037095295,0.00017923054,0.000060013757,0.0004989173,0.0002554303,0.113362186],"genre_scores_gemma":[0.9686566,0.001066934,0.012420045,0.00036528692,0.00025622168,0.00008218489,0.00028601184,0.00007230657,0.016794378],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99936825,0.0002084712,0.000034104276,0.00011643518,0.0001692512,0.00010354518],"domain_scores_gemma":[0.9973212,0.0018342341,0.0002660611,0.00016129804,0.00015704581,0.00026017925],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007449275,0.00060888147,0.00094215263,0.0018779427,0.0018342931,0.004312853,0.0012189072,0.0010850581,0.005718251],"category_scores_gemma":[0.0035586045,0.00086146645,0.00054077856,0.0021246437,0.003706251,0.0073757092,0.0022279986,0.0029907194,0.00039736385],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025666375,0.000016016362,0.00021739575,0.00003093359,0.0000030580504,0.000041061016,0.00022661786,0.00060057815,0.0002895779,0.99481505,0.00058484246,0.003149128],"study_design_scores_gemma":[0.000010283195,0.0000035689177,0.00009597756,0.000006994949,0.00000448262,0.00003639324,0.00005627951,0.0018893138,0.00013786567,0.99676764,0.0009876731,0.0000035416138],"about_ca_topic_score_codex":0.0015344556,"about_ca_topic_score_gemma":0.0023294562,"teacher_disagreement_score":0.005718251,"about_ca_system_score_codex":0.0018219382,"about_ca_system_score_gemma":0.00046791957,"threshold_uncertainty_score":0.019129515},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30607685,0.011185238,0.6559298,0.0076798587,0.0003235824,0.00009529351,0.00063245156,0.00062938477,0.017447593],"genre_scores_gemma":[0.93364346,0.0044947797,0.056312583,0.00085454294,0.0008143319,0.00024112123,0.00049889914,0.000313845,0.002826389],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99199975,0.0044961977,0.00027837692,0.0015363109,0.0011749101,0.000514474],"domain_scores_gemma":[0.7533289,0.22184418,0.008541472,0.0076566064,0.0049319067,0.0036968442],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010163386,0.0012287931,0.0027200915,0.005059329,0.0016331279,0.0028742056,0.0044075283,0.0028013801,0.0034804295],"category_scores_gemma":[0.11542875,0.0011258294,0.0010040475,0.003415047,0.0077351504,0.014191019,0.0055416254,0.0045330105,0.00076403894],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005227619,0.000099600205,0.006122434,0.0003922526,0.0001276276,0.00029473216,0.0006810676,0.13333213,0.0025394189,0.8315691,0.0044854474,0.019833392],"study_design_scores_gemma":[0.00004471389,0.00015100354,0.0026544568,0.00012925676,0.000047199723,0.00038304747,0.00013292937,0.3477856,0.0011186039,0.64521706,0.0022437065,0.00009241513],"about_ca_topic_score_codex":0.0014833835,"about_ca_topic_score_gemma":0.00090917427,"teacher_disagreement_score":0.010163386,"about_ca_system_score_codex":0.0031125261,"about_ca_system_score_gemma":0.0007356878,"threshold_uncertainty_score":0.05374974},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05005365,0.0016244114,0.91982067,0.00094267336,0.0009657127,0.000092527,0.0013180576,0.0031268648,0.0220555],"genre_scores_gemma":[0.57558995,0.002445459,0.34791115,0.0012575617,0.0018057842,0.0006536914,0.008226997,0.007955793,0.054153614],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9934058,0.00144178,0.00046877278,0.0013420264,0.0023299737,0.0010116415],"domain_scores_gemma":[0.95518255,0.025607731,0.0030611942,0.007054494,0.0070325364,0.0020615172],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0074207126,0.0028965082,0.002138597,0.0056353956,0.0016147239,0.0053374963,0.004775304,0.002117753,0.02706034],"category_scores_gemma":[0.061967082,0.0013720676,0.0034018527,0.0034583583,0.0026751258,0.013515356,0.00612158,0.005785938,0.00863665],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007482124,0.00026962656,0.011390456,0.0012171442,0.00047028484,0.0008283671,0.0006008556,0.09263462,0.0061017373,0.7050585,0.042281352,0.13839877],"study_design_scores_gemma":[0.000026039877,0.00010308887,0.002630296,0.00029829427,0.00015019067,0.00051423995,0.00019755855,0.56624943,0.0075675584,0.40631482,0.01584855,0.00009992126],"about_ca_topic_score_codex":0.0032614712,"about_ca_topic_score_gemma":0.0036042295,"teacher_disagreement_score":0.02706034,"about_ca_system_score_codex":0.0021981804,"about_ca_system_score_gemma":0.0018655359,"threshold_uncertainty_score":0.090525806},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44727993,0.0036939443,0.16712843,0.0059303516,0.0006430699,0.00011865516,0.0010000113,0.0006659101,0.37353972],"genre_scores_gemma":[0.9664374,0.0008183502,0.016779987,0.0004162186,0.00023872558,0.00018263377,0.00020009677,0.00006660729,0.01486002],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990282,0.00036458997,0.000049223032,0.00017060128,0.00026508045,0.00012227069],"domain_scores_gemma":[0.99333376,0.0042824117,0.00068713585,0.00047827337,0.0005306044,0.0006877717],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016273073,0.00038491574,0.00047311548,0.0024196415,0.0015134593,0.002890991,0.00096408365,0.00089372107,0.009532367],"category_scores_gemma":[0.00906889,0.00040063876,0.00036304197,0.0009391467,0.0027322958,0.0062009688,0.0016316382,0.0017558158,0.0009157329],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002160165,0.000010028787,0.00014569487,0.00003091636,0.0000033350905,0.000014731369,0.000054420656,0.00040615138,0.0002701359,0.9947978,0.0016258656,0.00261925],"study_design_scores_gemma":[0.000009653985,0.000008356031,0.00017997815,0.00001673242,0.000005464509,0.00009645285,0.000051773477,0.004458227,0.00033386645,0.99179685,0.0030363118,0.000006275639],"about_ca_topic_score_codex":0.00044766627,"about_ca_topic_score_gemma":0.0008250952,"teacher_disagreement_score":0.009532367,"about_ca_system_score_codex":0.0012372077,"about_ca_system_score_gemma":0.00059878547,"threshold_uncertainty_score":0.031888902},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.58603376,0.000465192,0.34869087,0.00070431054,0.00018257619,0.00013512513,0.00013689617,0.0006960148,0.062955305],"genre_scores_gemma":[0.86401844,0.00014336676,0.1188033,0.00017948297,0.000054591987,0.00017508998,0.00013777694,0.00014036644,0.01634757],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99911577,0.00030267655,0.0000573479,0.00015406661,0.00018974823,0.00018048631],"domain_scores_gemma":[0.9989612,0.00049057486,0.000075504984,0.0001863022,0.00013903777,0.000147319],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008393623,0.00047741315,0.0008340624,0.001332913,0.0019877315,0.0014549764,0.0011060286,0.00093989726,0.0038494784],"category_scores_gemma":[0.0018662837,0.00069117587,0.001247005,0.0005522217,0.002268754,0.003423524,0.003761913,0.0018186424,0.0007081304],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006728462,0.000028694745,0.0006043806,0.000049562062,0.000015973117,0.00023565924,0.00077935384,0.0015045737,0.011054969,0.9769413,0.0006505116,0.008067674],"study_design_scores_gemma":[0.00005072021,0.00012972577,0.00076255924,0.000033148805,0.000054357108,0.0004143409,0.0003817617,0.013146095,0.020589571,0.9456952,0.018687643,0.00005476192],"about_ca_topic_score_codex":0.00034723623,"about_ca_topic_score_gemma":0.00070884917,"teacher_disagreement_score":0.0038494784,"about_ca_system_score_codex":0.00085113,"about_ca_system_score_gemma":0.00042812008,"threshold_uncertainty_score":0.012877762},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15206227,0.011846967,0.49525592,0.00798091,0.0015909144,0.00015189365,0.0011144483,0.0006509807,0.32934573],"genre_scores_gemma":[0.8377967,0.010841417,0.09486331,0.0032481553,0.0029797922,0.00067260413,0.0012650284,0.00076600997,0.04756701],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9969656,0.00069560815,0.000115655734,0.0008543872,0.0008635849,0.0005051881],"domain_scores_gemma":[0.98455435,0.010905704,0.0010257255,0.0014421714,0.0008915159,0.0011805848],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018413286,0.0014122522,0.0015424554,0.004852312,0.0030021786,0.003695619,0.0027517225,0.0024872345,0.014026661],"category_scores_gemma":[0.019845877,0.0007197943,0.0010485427,0.0028354928,0.0073321913,0.015972944,0.006849043,0.0074924678,0.0030690182],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003451313,0.000016531934,0.00035469886,0.000087492146,0.000006101133,0.000045941888,0.00018083156,0.0034427792,0.0007571215,0.98424226,0.0033101654,0.007521525],"study_design_scores_gemma":[0.000008199095,0.0000210317,0.00039291676,0.00006296001,0.000010545481,0.00015004305,0.00008409905,0.009908085,0.00060356787,0.9747683,0.013966918,0.000023422737],"about_ca_topic_score_codex":0.0008776338,"about_ca_topic_score_gemma":0.00062516733,"teacher_disagreement_score":0.014026661,"about_ca_system_score_codex":0.0021194506,"about_ca_system_score_gemma":0.00068985374,"threshold_uncertainty_score":0.046923876},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5137757,0.003470323,0.4470725,0.0050587007,0.00023540619,0.00019134983,0.00079348654,0.0009628761,0.02843958],"genre_scores_gemma":[0.96889347,0.0013545888,0.0197804,0.00045004062,0.00020141828,0.00017431017,0.00031368798,0.00020631634,0.008625759],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99675214,0.0014241863,0.000120268385,0.0007319361,0.0004355897,0.00053595746],"domain_scores_gemma":[0.9677394,0.022916907,0.00319766,0.0026861953,0.0012005528,0.0022593169],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006564651,0.0011774404,0.0027340958,0.0024051254,0.002208166,0.0031556648,0.0035330632,0.0028016716,0.0077181025],"category_scores_gemma":[0.031171575,0.001237296,0.0021632325,0.0018916703,0.005816498,0.0081904195,0.003208236,0.0034862095,0.0013332792],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024982163,0.00005240567,0.0019194352,0.00011825669,0.00007385649,0.0004574242,0.0005306985,0.039513472,0.0011684658,0.94823325,0.0024673645,0.005215516],"study_design_scores_gemma":[0.00013543954,0.000060280032,0.0006860575,0.000045519067,0.000045946923,0.0002408108,0.00013688154,0.21507803,0.0004158465,0.781144,0.0019434124,0.0000677682],"about_ca_topic_score_codex":0.0029824688,"about_ca_topic_score_gemma":0.002893744,"teacher_disagreement_score":0.0077181025,"about_ca_system_score_codex":0.0022684906,"about_ca_system_score_gemma":0.00087389426,"threshold_uncertainty_score":0.03471756},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.754436,0.004066377,0.15321057,0.0041239304,0.00024455079,0.000064213426,0.0006935493,0.00026526477,0.08289549],"genre_scores_gemma":[0.9704264,0.0015295125,0.010403259,0.00040897535,0.0005257742,0.0001356426,0.0004987037,0.000088234185,0.015983572],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990087,0.00037992166,0.0000688847,0.00021555094,0.00017919479,0.00014783071],"domain_scores_gemma":[0.9956115,0.0024423765,0.0006170809,0.0002716289,0.00034190164,0.000715595],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014799548,0.0010455806,0.00107399,0.0048760865,0.0033080885,0.0057243463,0.001677974,0.001802516,0.0062819077],"category_scores_gemma":[0.006037662,0.00085110444,0.0009490612,0.004178861,0.005631226,0.012557236,0.0041997447,0.0024364672,0.000485416],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018475968,0.000016057465,0.00035805927,0.000021110041,0.0000051346883,0.000074427626,0.00036823744,0.00061387743,0.0002841348,0.9966522,0.00030155783,0.0012869284],"study_design_scores_gemma":[0.0000062112676,0.000007671274,0.000249741,0.0000107638625,0.0000053960566,0.000071679024,0.00022595639,0.0017109796,0.00007556633,0.99712,0.0005096052,0.000006346271],"about_ca_topic_score_codex":0.0018973796,"about_ca_topic_score_gemma":0.002034574,"teacher_disagreement_score":0.0062819077,"about_ca_system_score_codex":0.002135011,"about_ca_system_score_gemma":0.00074393925,"threshold_uncertainty_score":0.021015108},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.86783755,0.0011363451,0.098468564,0.0014234452,0.000071064795,0.00010555322,0.0005458458,0.00072743144,0.029684149],"genre_scores_gemma":[0.987633,0.0003574193,0.009043448,0.00018982444,0.00007283278,0.00012549071,0.0002971664,0.00011382261,0.0021668554],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99827266,0.00039452367,0.00009515087,0.00044833648,0.00032628715,0.00046298173],"domain_scores_gemma":[0.9735807,0.016954416,0.0030023588,0.0019072882,0.0010602818,0.0034948934],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022230716,0.00051982614,0.0010192833,0.0020369687,0.0010282716,0.0033135656,0.0012749734,0.0014687651,0.0050068004],"category_scores_gemma":[0.026194926,0.00071664643,0.00053023454,0.00097634766,0.0025718291,0.0044713253,0.0019036018,0.0015220431,0.00047705421],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007118007,0.00021620266,0.013047116,0.0002726474,0.00007261626,0.00049977703,0.00091102783,0.040263213,0.016092986,0.8941074,0.005918075,0.02788714],"study_design_scores_gemma":[0.000121850244,0.00017393309,0.006893892,0.00009126649,0.00005411818,0.0006552176,0.00043186726,0.15020488,0.007531195,0.8294091,0.0043434263,0.000089243666],"about_ca_topic_score_codex":0.001093281,"about_ca_topic_score_gemma":0.0006968327,"teacher_disagreement_score":0.0050068004,"about_ca_system_score_codex":0.0022411325,"about_ca_system_score_gemma":0.000521966,"threshold_uncertainty_score":0.016749382},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.56219774,0.008828338,0.13340412,0.010935477,0.0007937545,0.00006481187,0.00051090674,0.00033224828,0.28293258],"genre_scores_gemma":[0.95979804,0.003382107,0.017058095,0.0007354914,0.0007740122,0.00010719118,0.0002386094,0.00010555622,0.017800845],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99904686,0.00035998362,0.000043829812,0.00017068193,0.00024638933,0.00013219475],"domain_scores_gemma":[0.9935256,0.004425162,0.0005698868,0.00035402089,0.0005066223,0.0006186476],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018456243,0.00066407636,0.0011023412,0.0033161559,0.002278667,0.0036867002,0.0015347551,0.0012609252,0.0071617914],"category_scores_gemma":[0.011300475,0.0006697707,0.0005764713,0.0027345498,0.0058778496,0.012793644,0.003392228,0.0035502259,0.0007814387],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020104966,0.000008989791,0.00012995278,0.000023446253,0.0000023757595,0.000014749098,0.00016234015,0.0009257854,0.00013097576,0.994966,0.00077975757,0.0028356172],"study_design_scores_gemma":[0.000005013484,0.000005138664,0.00012376386,0.000012375236,0.0000026723742,0.000026528007,0.000063470885,0.001897606,0.000059483387,0.9964275,0.0013712439,0.000005302774],"about_ca_topic_score_codex":0.0013978106,"about_ca_topic_score_gemma":0.0013514792,"teacher_disagreement_score":0.0071617914,"about_ca_system_score_codex":0.0019986122,"about_ca_system_score_gemma":0.00081447995,"threshold_uncertainty_score":0.023958623},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8801422,0.0004536625,0.07884996,0.00030366244,0.000039621125,0.000022193137,0.0001453383,0.00014055042,0.03990272],"genre_scores_gemma":[0.99032307,0.00017832356,0.006380096,0.00004605952,0.000048190937,0.000012237855,0.00011332796,0.000014466355,0.0028841952],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99969435,0.000045248013,0.00001783823,0.00007397663,0.00009271283,0.00007584839],"domain_scores_gemma":[0.9989536,0.00037949256,0.00021959638,0.00009121877,0.00013074426,0.00022530081],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003195891,0.00028179862,0.00026088994,0.0015802198,0.0007204013,0.0013893018,0.0004477292,0.00035366442,0.0026604205],"category_scores_gemma":[0.0011108425,0.00020715575,0.00027090887,0.0008274186,0.001127364,0.0020972406,0.0011184643,0.000744358,0.00018771167],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003469607,0.000019289038,0.0011127165,0.000022427248,0.0000079166575,0.00021369892,0.00031444646,0.0020330264,0.0033539918,0.9866476,0.00036317576,0.0058770403],"study_design_scores_gemma":[0.000010968504,0.000025682562,0.0015306288,0.000017349837,0.000021149244,0.00039181797,0.00031648728,0.024582595,0.0031880834,0.9654215,0.0044789715,0.00001483815],"about_ca_topic_score_codex":0.00067008124,"about_ca_topic_score_gemma":0.001120997,"teacher_disagreement_score":0.0026604205,"about_ca_system_score_codex":0.0007128844,"about_ca_system_score_gemma":0.00024413201,"threshold_uncertainty_score":0.008899987},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.61571026,0.0015524108,0.18274389,0.002620699,0.0003041472,0.00015828141,0.0023681396,0.0010560092,0.1934862],"genre_scores_gemma":[0.9641615,0.00043500014,0.018048443,0.00025066367,0.00010705137,0.00010770922,0.0011914572,0.00008892254,0.015609371],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99898237,0.00018997167,0.00005524928,0.00032089237,0.00027477136,0.0001767385],"domain_scores_gemma":[0.9985442,0.00047269583,0.00023153318,0.00028073744,0.00023347244,0.0002374091],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005905047,0.000446737,0.00085559534,0.001987952,0.0022654622,0.0047422755,0.0007574178,0.00067765295,0.012761662],"category_scores_gemma":[0.0034910932,0.0004532639,0.0004177526,0.0015264221,0.0023308573,0.003799892,0.0037335642,0.0016220802,0.0016798539],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010932947,0.000018155508,0.00089462474,0.000048081096,0.000012637122,0.00019545386,0.00041534816,0.0014298694,0.0013976312,0.98470473,0.0020182275,0.008755872],"study_design_scores_gemma":[0.00003668674,0.00003757372,0.0010271713,0.000038064158,0.000017698065,0.0006284963,0.00050465885,0.011037746,0.002390122,0.96066,0.023601975,0.00001991966],"about_ca_topic_score_codex":0.0009211329,"about_ca_topic_score_gemma":0.0004301883,"teacher_disagreement_score":0.012761662,"about_ca_system_score_codex":0.0014647096,"about_ca_system_score_gemma":0.00035409018,"threshold_uncertainty_score":0.042692006},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.89758885,0.0005480415,0.084281,0.0007134157,0.00004299717,0.00007213277,0.00041018997,0.00032783026,0.016015477],"genre_scores_gemma":[0.9884433,0.00024116684,0.0071588554,0.00010989758,0.00005401747,0.000095383104,0.00024343042,0.0000805069,0.0035734843],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992692,0.00017574131,0.00003559726,0.00016678173,0.00018348913,0.00016923604],"domain_scores_gemma":[0.99353176,0.0030669044,0.0011278375,0.0008393107,0.0005525099,0.0008816375],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00068916706,0.00036455758,0.00069346465,0.0012384475,0.0015421992,0.0015901596,0.0009537743,0.0008290369,0.003319166],"category_scores_gemma":[0.0083008725,0.00058066787,0.00065233826,0.0009315512,0.0024403273,0.00244799,0.0021963322,0.0014576834,0.00042651984],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00038029204,0.000108954875,0.008302913,0.00031793173,0.000047484104,0.0006740323,0.0019821303,0.031856548,0.014235876,0.9210955,0.0046980926,0.016300341],"study_design_scores_gemma":[0.000062352905,0.00009977088,0.0031986048,0.00004051867,0.0000256605,0.0011374465,0.0005766907,0.08495539,0.0049255593,0.8983925,0.0065297415,0.000055664466],"about_ca_topic_score_codex":0.0036564087,"about_ca_topic_score_gemma":0.0040279436,"teacher_disagreement_score":0.0036564087,"about_ca_system_score_codex":0.0012470969,"about_ca_system_score_gemma":0.0006459166,"threshold_uncertainty_score":0.011103749},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6003772,0.0070462623,0.17944114,0.0053578685,0.00046364046,0.000058131576,0.00079887296,0.00036957307,0.20608732],"genre_scores_gemma":[0.966822,0.002143202,0.019573353,0.00036895438,0.00029687173,0.000050571314,0.0002885373,0.000092770024,0.010363739],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99916434,0.00013758817,0.00003296981,0.00028995934,0.00020254476,0.00017266428],"domain_scores_gemma":[0.9973126,0.0012849767,0.00036591917,0.00045486548,0.00026857012,0.0003130171],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066890084,0.00050526677,0.00054113276,0.00227105,0.0014352471,0.0021020323,0.000986911,0.0009106108,0.007882499],"category_scores_gemma":[0.004123252,0.00027511042,0.0004670526,0.0016611234,0.0047603594,0.0060242726,0.0017250495,0.0015503443,0.0007109999],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000099585646,0.000022316552,0.0013234812,0.000081549006,0.000009926775,0.00006099391,0.00015740315,0.0038588848,0.0037480094,0.9792437,0.0015178801,0.009876324],"study_design_scores_gemma":[0.000009156755,0.000020912503,0.00106007,0.00002713924,0.000007985644,0.00029506843,0.00011123034,0.00771369,0.0023168505,0.97961545,0.008806339,0.000015954154],"about_ca_topic_score_codex":0.001409714,"about_ca_topic_score_gemma":0.0011399058,"teacher_disagreement_score":0.007882499,"about_ca_system_score_codex":0.0024140957,"about_ca_system_score_gemma":0.0004492246,"threshold_uncertainty_score":0.026369631},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19895382,0.008781333,0.46119395,0.0072270148,0.0012070496,0.00013583037,0.001503136,0.0013298917,0.31966797],"genre_scores_gemma":[0.8506677,0.004342697,0.08505155,0.0018435166,0.001460713,0.00048740814,0.0020414407,0.0007509045,0.053354032],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99649614,0.00084393256,0.00032013896,0.0008671783,0.00101365,0.0004589377],"domain_scores_gemma":[0.9904999,0.0064587374,0.00052016455,0.0008115341,0.0009801039,0.00072957284],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037205752,0.001576161,0.0023250133,0.00848329,0.006668262,0.008198849,0.0029816364,0.0021176946,0.015782576],"category_scores_gemma":[0.0074979304,0.0021269813,0.004154087,0.0067743054,0.006904649,0.025262307,0.011255322,0.010113738,0.0018514433],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018260842,0.000016029133,0.0001644553,0.000036666428,0.000014967108,0.000050270242,0.00029305895,0.000138006,0.00016940323,0.9956672,0.0007469886,0.0026845837],"study_design_scores_gemma":[0.000008501093,0.000005566116,0.00010295044,0.000015174346,0.000016967128,0.000076624485,0.00009459578,0.00064283673,0.00019580971,0.99644643,0.0023856885,0.000008867712],"about_ca_topic_score_codex":0.0013878444,"about_ca_topic_score_gemma":0.0010242775,"teacher_disagreement_score":0.015782576,"about_ca_system_score_codex":0.003433384,"about_ca_system_score_gemma":0.0010089561,"threshold_uncertainty_score":0.052797914},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019900262,0.025307097,0.03502706,0.0024119986,0.0022923439,0.00004462251,0.0002981854,0.00028009122,0.9144384],"genre_scores_gemma":[0.4480666,0.031198598,0.046317838,0.00073996984,0.0028740002,0.00016874522,0.0007163664,0.00040488137,0.46951303],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99981135,0.000057041023,0.000012118576,0.00003694736,0.00006018691,0.000022296806],"domain_scores_gemma":[0.9998115,0.000082272665,0.000016789889,0.000027034,0.00003983872,0.000022608137],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021607506,0.00057733187,0.00045780616,0.0011685414,0.0012908593,0.0033611131,0.00045731614,0.0005533451,0.018743668],"category_scores_gemma":[0.00081684045,0.000294895,0.00037494017,0.0020745923,0.0031640204,0.0037980047,0.0012095263,0.0017344286,0.005628808],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012289479,0.00000449568,0.000048437352,0.000054580258,0.0000018701128,0.000032298776,0.00036398397,0.00031318917,0.00018942608,0.96505654,0.011802217,0.022120655],"study_design_scores_gemma":[0.000007467728,0.000015631542,0.00020884356,0.00006893731,0.0000036410113,0.00020206168,0.00026150895,0.00048041667,0.00022049336,0.84639317,0.15213074,0.000006957794],"about_ca_topic_score_codex":0.0007315808,"about_ca_topic_score_gemma":0.0013218857,"teacher_disagreement_score":0.018743668,"about_ca_system_score_codex":0.0009145788,"about_ca_system_score_gemma":0.00048921315,"threshold_uncertainty_score":0.06270379},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.74579924,0.0012654631,0.19170807,0.0036707297,0.0003223744,0.000083922365,0.00033897953,0.00038747635,0.056423686],"genre_scores_gemma":[0.9832767,0.00024275387,0.013498693,0.00017281761,0.00016406324,0.000031650612,0.0001080297,0.000039276543,0.0024659268],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992399,0.0002288273,0.000031138334,0.0001631207,0.00022420031,0.000112854395],"domain_scores_gemma":[0.9943402,0.0040441942,0.00038346212,0.0004137066,0.0002834946,0.0005348822],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012393721,0.00037850058,0.00066399755,0.0012354808,0.001984654,0.0015469239,0.0009993336,0.0009949972,0.005996753],"category_scores_gemma":[0.0049187797,0.00039226588,0.0009094814,0.0011714351,0.0026114327,0.0026003171,0.0025960046,0.0019248145,0.00023184023],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000107716354,0.00002703201,0.0013159583,0.00008091769,0.000035048375,0.0004945091,0.0005595858,0.00525077,0.0053283307,0.9794574,0.0023161785,0.005026441],"study_design_scores_gemma":[0.000036811503,0.00008537889,0.00088986405,0.000022328219,0.00003096406,0.00032292333,0.00023570427,0.028843498,0.0037287113,0.96136546,0.0044200183,0.000018301875],"about_ca_topic_score_codex":0.00087283604,"about_ca_topic_score_gemma":0.0010578295,"teacher_disagreement_score":0.005996753,"about_ca_system_score_codex":0.0008117943,"about_ca_system_score_gemma":0.0002941646,"threshold_uncertainty_score":0.020061195},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.66763574,0.0020917046,0.13776994,0.00707595,0.0005457849,0.0001321785,0.0012915396,0.0005646776,0.18289243],"genre_scores_gemma":[0.95855945,0.0014782337,0.01631917,0.00084659626,0.0005440475,0.00021073839,0.0006314153,0.00016101848,0.021249315],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985434,0.00030263964,0.00013829963,0.00043871632,0.00030331805,0.0002736466],"domain_scores_gemma":[0.9950846,0.002686683,0.00072049315,0.00064256764,0.0003394532,0.00052609894],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015257233,0.000869357,0.0020387804,0.0027846883,0.0035159497,0.005002135,0.0015104925,0.001995121,0.0075593838],"category_scores_gemma":[0.0056460565,0.0007861108,0.0016115698,0.002516828,0.004592442,0.011387726,0.003967417,0.003702119,0.0011835159],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005085455,0.000019509336,0.0002065936,0.000031650052,0.000010905343,0.00007592424,0.00028893666,0.0003224668,0.00047865615,0.9949891,0.0008926252,0.0026327143],"study_design_scores_gemma":[0.000026210933,0.000010629921,0.0001429431,0.000011369469,0.000014686129,0.00012978441,0.00009434133,0.0012042263,0.00032590298,0.99552757,0.0024997478,0.000012522074],"about_ca_topic_score_codex":0.00063570816,"about_ca_topic_score_gemma":0.0005157529,"teacher_disagreement_score":0.0075593838,"about_ca_system_score_codex":0.0014263578,"about_ca_system_score_gemma":0.00083978276,"threshold_uncertainty_score":0.025288701},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.75220275,0.003096262,0.13321479,0.0064178617,0.00065155316,0.000056684654,0.0004053435,0.00054156285,0.10341317],"genre_scores_gemma":[0.97128886,0.0010227832,0.010068443,0.00037851787,0.0009799005,0.00007325437,0.00026826301,0.00024327172,0.015676681],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992054,0.00028712975,0.00003949015,0.00016091733,0.00017986225,0.00012714941],"domain_scores_gemma":[0.99657637,0.0016824828,0.0004233686,0.00023808352,0.0003034921,0.00077607395],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016107493,0.0014001235,0.0013851441,0.0061703688,0.002367768,0.004963759,0.0024442703,0.0026548076,0.007672694],"category_scores_gemma":[0.010137343,0.00080464204,0.00090281473,0.0019048332,0.005285356,0.0073136506,0.003705094,0.0033131342,0.0008248578],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000038438593,0.000022860413,0.00036582502,0.00003871204,0.000007954729,0.00007722435,0.00017453668,0.0007602539,0.00047760975,0.99374264,0.00127615,0.0030177762],"study_design_scores_gemma":[0.000008892413,0.0000061238597,0.00020459028,0.000016017124,0.000007011452,0.00014265551,0.000055367196,0.0061854636,0.00016241323,0.9923201,0.0008814348,0.000009946369],"about_ca_topic_score_codex":0.0006697588,"about_ca_topic_score_gemma":0.0005517077,"teacher_disagreement_score":0.007672694,"about_ca_system_score_codex":0.0019332304,"about_ca_system_score_gemma":0.0005775135,"threshold_uncertainty_score":0.025667727},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09107636,0.1305591,0.27336007,0.018369906,0.006481348,0.000077288896,0.0028180783,0.0013461234,0.4759117],"genre_scores_gemma":[0.70101666,0.037079364,0.05714376,0.0049778116,0.006408632,0.00014028844,0.0022409938,0.001024243,0.18996818],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990331,0.00022004846,0.0000379116,0.00026964655,0.00034412718,0.000095225616],"domain_scores_gemma":[0.9993426,0.00025124376,0.00008221425,0.00014654778,0.00011212574,0.00006525209],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00068764633,0.00069115474,0.00066924683,0.0013278213,0.0013351478,0.0030206724,0.0006083098,0.00071506546,0.027127717],"category_scores_gemma":[0.0030095421,0.0005467164,0.0007022996,0.0023145569,0.0019247908,0.006415597,0.00180756,0.002237243,0.006131114],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000048736685,0.000014226412,0.00025165817,0.00012123695,0.000017050039,0.00005194409,0.0001997943,0.0007606514,0.00068481616,0.9372803,0.028055398,0.032514144],"study_design_scores_gemma":[0.0000042571596,0.000010453578,0.0005044248,0.00004701897,0.000011212935,0.00017605374,0.000084711755,0.0016749064,0.0003629144,0.9365817,0.060529776,0.000012511713],"about_ca_topic_score_codex":0.0014696487,"about_ca_topic_score_gemma":0.0016166891,"teacher_disagreement_score":0.027127717,"about_ca_system_score_codex":0.0017574799,"about_ca_system_score_gemma":0.0005754201,"threshold_uncertainty_score":0.09075123},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8006296,0.0028858897,0.06954774,0.014064597,0.00056007213,0.00009263448,0.00084271375,0.00095271296,0.11042397],"genre_scores_gemma":[0.97908247,0.00079938915,0.010785334,0.001357231,0.00022149681,0.00009537168,0.0006025885,0.00008121213,0.0069749067],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986046,0.00029124648,0.000064580345,0.00038696636,0.000289437,0.00036334989],"domain_scores_gemma":[0.99052775,0.005251309,0.0007665399,0.0017395386,0.00070069224,0.0010141605],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016034257,0.0007834574,0.0013514394,0.002257566,0.002387977,0.0032362938,0.0013321432,0.0022609518,0.00637219],"category_scores_gemma":[0.010408299,0.00088023714,0.0017184935,0.0020965151,0.005371304,0.0060781213,0.004775304,0.0033913995,0.0012097475],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00064279715,0.000068833906,0.004710332,0.0002827737,0.00008842141,0.0005678627,0.0020500252,0.010320326,0.005363291,0.94229746,0.017607464,0.016000396],"study_design_scores_gemma":[0.00003944886,0.000025657086,0.0008546354,0.000038029026,0.00002290066,0.00025065645,0.00022791927,0.007214247,0.0012020895,0.98253375,0.007571484,0.0000191843],"about_ca_topic_score_codex":0.001568716,"about_ca_topic_score_gemma":0.0011333319,"teacher_disagreement_score":0.00637219,"about_ca_system_score_codex":0.0016427095,"about_ca_system_score_gemma":0.00064910465,"threshold_uncertainty_score":0.021317065},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.57518667,0.0016352562,0.407123,0.0017204805,0.00010497212,0.00008587435,0.0004852984,0.00054386957,0.013114612],"genre_scores_gemma":[0.97632617,0.0008258277,0.017522583,0.00016999486,0.00006690758,0.000091061054,0.00022054448,0.000058654547,0.0047183456],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990181,0.00039760306,0.00004175777,0.0002237535,0.00016034035,0.00015845735],"domain_scores_gemma":[0.9928033,0.004360918,0.0009936892,0.0004876689,0.00047916194,0.00087527506],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025184914,0.00054861937,0.0011867072,0.0016300372,0.0010774913,0.0015194591,0.0013953728,0.0012355372,0.0026035889],"category_scores_gemma":[0.011909964,0.00054131594,0.0008724714,0.0009152632,0.002177848,0.002880262,0.0017644782,0.0014631164,0.00036349113],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012590626,0.000051427436,0.0023812714,0.00009852466,0.000051435578,0.0005891351,0.00031166375,0.0789523,0.001955056,0.90939,0.0013016666,0.0047916793],"study_design_scores_gemma":[0.00006861832,0.00005595995,0.0007581461,0.000036060857,0.000027106133,0.00021695226,0.00010795146,0.42630923,0.00051569496,0.5700624,0.0018087385,0.000033081837],"about_ca_topic_score_codex":0.0031929458,"about_ca_topic_score_gemma":0.0037265914,"teacher_disagreement_score":0.0031929458,"about_ca_system_score_codex":0.0021509225,"about_ca_system_score_gemma":0.00069974945,"threshold_uncertainty_score":0.015606105},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8125302,0.0016779136,0.0935776,0.004472535,0.00033132592,0.00003383539,0.00048258097,0.00019393514,0.086700045],"genre_scores_gemma":[0.9884682,0.0004536419,0.0025677474,0.00022743168,0.00041074184,0.00003244069,0.00019701406,0.000045597433,0.0075971014],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991702,0.00030188842,0.000030629744,0.000098768935,0.00028118814,0.00011738077],"domain_scores_gemma":[0.9968405,0.0016949938,0.00039214885,0.00031016278,0.00029395154,0.00046825007],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00138701,0.0004848754,0.00086558505,0.0026657525,0.0012077425,0.0024336006,0.0010942797,0.0010797061,0.004432486],"category_scores_gemma":[0.005995355,0.00035164587,0.00051943876,0.0011018976,0.0034248142,0.005013942,0.0021473088,0.0014459016,0.00032963222],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015153848,0.000007712037,0.0002000187,0.00001157557,0.0000031827383,0.000014408187,0.00007116185,0.0011247164,0.00020558282,0.996926,0.0003707872,0.001049674],"study_design_scores_gemma":[0.000003999105,0.000003236027,0.00017528741,0.0000036851848,0.0000017858397,0.000017200191,0.000020419051,0.004811556,0.0000819403,0.99462116,0.0002556807,0.0000040881237],"about_ca_topic_score_codex":0.0008130779,"about_ca_topic_score_gemma":0.00070794317,"teacher_disagreement_score":0.004432486,"about_ca_system_score_codex":0.0013646439,"about_ca_system_score_gemma":0.00065183325,"threshold_uncertainty_score":0.014828205},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4212491,0.013103073,0.15591581,0.006527258,0.0012616608,0.00010779264,0.0006889104,0.0006894612,0.40045696],"genre_scores_gemma":[0.9538686,0.003379291,0.020669116,0.0007214938,0.0004910832,0.00014625417,0.00020360723,0.00014825842,0.02037213],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99930847,0.00021422231,0.000039751558,0.00013537167,0.00017585217,0.00012632561],"domain_scores_gemma":[0.9957704,0.0027188193,0.00042844025,0.00029806956,0.00036463173,0.0004196009],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013684728,0.000543572,0.00069014577,0.003314002,0.0017084081,0.0028765916,0.0011869328,0.0010954587,0.008467417],"category_scores_gemma":[0.008504767,0.00047256134,0.0004326828,0.0017655063,0.0030979998,0.008632483,0.0024832888,0.0020008276,0.0011662841],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030243506,0.000013802872,0.00026233282,0.00006318713,0.0000043140926,0.000037132304,0.00019548874,0.00081119686,0.00030299064,0.9886286,0.0023888058,0.0072619133],"study_design_scores_gemma":[0.0000055499618,0.000007737685,0.00016434769,0.000035162713,0.0000046213263,0.00008464098,0.00010740516,0.0027634022,0.00019527847,0.99305236,0.0035705278,0.0000090728645],"about_ca_topic_score_codex":0.0010740458,"about_ca_topic_score_gemma":0.0016305541,"teacher_disagreement_score":0.008467417,"about_ca_system_score_codex":0.0016483268,"about_ca_system_score_gemma":0.0005435365,"threshold_uncertainty_score":0.028326273},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27942222,0.006912094,0.11776494,0.0076205595,0.0020488873,0.00008951912,0.00052633486,0.0004088063,0.58520657],"genre_scores_gemma":[0.8944582,0.0029058193,0.016088242,0.0011482468,0.001867489,0.00018618937,0.0003955573,0.0003367874,0.08261361],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99819213,0.00063012214,0.00010961508,0.0003075853,0.0004912116,0.00026940132],"domain_scores_gemma":[0.9961532,0.0021914267,0.00025590733,0.00047711487,0.0005298362,0.00039250252],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017635344,0.00095474627,0.0015333928,0.0048871026,0.0035140703,0.005489363,0.0011419447,0.0014899465,0.014247377],"category_scores_gemma":[0.009005602,0.00073364703,0.0014549376,0.0032959073,0.0055122245,0.01269037,0.004712705,0.004400629,0.002300002],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017803666,0.000009883796,0.000059143054,0.000026572201,0.000005045656,0.000033126264,0.00020095515,0.00011705893,0.00011790651,0.9963081,0.0006855064,0.002418987],"study_design_scores_gemma":[0.0000036803206,0.000003203305,0.00003845159,0.000008156812,0.0000055074715,0.000062493324,0.0000453351,0.0003468077,0.00007295181,0.9975898,0.0018206014,0.0000031610466],"about_ca_topic_score_codex":0.00044288483,"about_ca_topic_score_gemma":0.00040341847,"teacher_disagreement_score":0.014247377,"about_ca_system_score_codex":0.0015184792,"about_ca_system_score_gemma":0.00060710305,"threshold_uncertainty_score":0.04766226},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.52706915,0.0007185931,0.36684835,0.0018203271,0.00015446072,0.00009632464,0.0007768659,0.0011250398,0.101390876],"genre_scores_gemma":[0.96319866,0.00037410608,0.02014702,0.0003242491,0.00019004499,0.00013609884,0.00041441843,0.00025721817,0.014958099],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970368,0.0009062798,0.00015875933,0.0005353388,0.00081434567,0.00054842874],"domain_scores_gemma":[0.98184574,0.011388115,0.0016930127,0.0016161704,0.0013193988,0.0021374656],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002390631,0.00092779327,0.0014244633,0.0032058994,0.0036842423,0.0066869576,0.0022293143,0.0016460402,0.00842955],"category_scores_gemma":[0.010495023,0.001961216,0.0020994043,0.00242848,0.0060180225,0.011032966,0.004916299,0.0050719674,0.0010389374],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004948558,0.000033274286,0.0003268725,0.000038429673,0.000016825272,0.00010165923,0.00038001826,0.00092197355,0.00079255237,0.9946525,0.00053635467,0.0021499502],"study_design_scores_gemma":[0.000016600521,0.0000114208115,0.0002710925,0.00001176996,0.000017622187,0.00016098503,0.0001063553,0.005163488,0.0006919494,0.99270296,0.00082765595,0.000018067705],"about_ca_topic_score_codex":0.0018030273,"about_ca_topic_score_gemma":0.0021156108,"teacher_disagreement_score":0.00842955,"about_ca_system_score_codex":0.0019811182,"about_ca_system_score_gemma":0.001114417,"threshold_uncertainty_score":0.028199673},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22427255,0.0034839232,0.49833804,0.01212065,0.00093204615,0.000084463565,0.0006535693,0.0005066587,0.25960812],"genre_scores_gemma":[0.91489905,0.0014875391,0.044673398,0.0011948604,0.0008773787,0.00015177464,0.0004531063,0.0002637635,0.035999026],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979964,0.00059125456,0.00011301642,0.0005139109,0.0005427919,0.0002426284],"domain_scores_gemma":[0.99675304,0.001536389,0.00030658813,0.00059302937,0.0005467052,0.00026427282],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016004423,0.00062821823,0.0009813808,0.0015941086,0.0025246667,0.0054844036,0.0014957928,0.002418002,0.011007813],"category_scores_gemma":[0.008866065,0.00062752166,0.0010111376,0.0014809557,0.0068947915,0.011290309,0.0038537064,0.005104916,0.0013237428],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000041262156,0.0000031653183,0.000033663207,0.0000069305706,0.0000013812935,0.000010527451,0.00005316319,0.00020463258,0.000047296136,0.9980552,0.000442955,0.0011369329],"study_design_scores_gemma":[0.0000018749895,9.4812196e-7,0.000010663261,0.0000019625638,6.963704e-7,0.000011561555,0.000014965118,0.0008758424,0.000029318446,0.9984938,0.0005566601,0.000001757946],"about_ca_topic_score_codex":0.0009888012,"about_ca_topic_score_gemma":0.0009466237,"teacher_disagreement_score":0.011007813,"about_ca_system_score_codex":0.0019062615,"about_ca_system_score_gemma":0.00088576315,"threshold_uncertainty_score":0.036824822},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.83193547,0.0012506414,0.11192672,0.00069346227,0.000108197506,0.000046482208,0.00043138594,0.00029272214,0.053315],"genre_scores_gemma":[0.97238106,0.00077541784,0.018825278,0.000103946644,0.000056400717,0.00003592841,0.0003744287,0.000060902174,0.007386617],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996153,0.000093669914,0.000021840255,0.00011745423,0.000084463514,0.000067255205],"domain_scores_gemma":[0.99897885,0.000378078,0.00026730384,0.00014483358,0.00011115584,0.00011985503],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023656397,0.0006084064,0.0003579891,0.0010566697,0.0009041805,0.0015007943,0.0006733718,0.00071172736,0.004363728],"category_scores_gemma":[0.0018123387,0.00038472936,0.0003237271,0.0011940661,0.001513883,0.00480291,0.0015202687,0.0012889949,0.000588302],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006381399,0.0000311606,0.0008966896,0.000089115805,0.000020090421,0.0004645605,0.0005635132,0.009395166,0.003675589,0.97288215,0.0008564354,0.011061667],"study_design_scores_gemma":[0.000018813198,0.000048941925,0.00091135124,0.000042808577,0.000017643135,0.00049959123,0.0007469805,0.022024972,0.0027412935,0.96452975,0.008397687,0.000020095476],"about_ca_topic_score_codex":0.0012060944,"about_ca_topic_score_gemma":0.0010438622,"teacher_disagreement_score":0.004363728,"about_ca_system_score_codex":0.0006890242,"about_ca_system_score_gemma":0.00016459425,"threshold_uncertainty_score":0.014598072},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9467248,0.00035219526,0.045285426,0.00031750262,0.000032878885,0.000020653562,0.00012657634,0.00018592674,0.0069542043],"genre_scores_gemma":[0.9962909,0.00013590304,0.0024309594,0.000047953185,0.00006448199,0.000020861255,0.00008587948,0.00004696943,0.0008762017],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99899405,0.00036658155,0.00003921791,0.00023489939,0.00017548446,0.00018969653],"domain_scores_gemma":[0.9912798,0.0042058406,0.0014279878,0.00084496144,0.0007036566,0.0015376984],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015196638,0.00043119045,0.00097207894,0.0016148207,0.00087799184,0.0016944718,0.0011115549,0.0007006076,0.0016725487],"category_scores_gemma":[0.0076734307,0.0004989569,0.0005033341,0.00048731957,0.002518259,0.0028456512,0.0016753505,0.0010529582,0.00019353621],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004095799,0.00009109234,0.0059957136,0.00012854609,0.000055713117,0.00036756057,0.0005166468,0.044816215,0.025900157,0.9158295,0.0016059693,0.004283344],"study_design_scores_gemma":[0.000103860584,0.00020925971,0.013564302,0.00005861277,0.00010388327,0.0007533278,0.00036314313,0.40972507,0.015023928,0.55658036,0.003416164,0.00009807604],"about_ca_topic_score_codex":0.00085870427,"about_ca_topic_score_gemma":0.00053146225,"teacher_disagreement_score":0.0016944718,"about_ca_system_score_codex":0.0012367866,"about_ca_system_score_gemma":0.0002940491,"threshold_uncertainty_score":0.008973539},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.76624215,0.0007377663,0.20850879,0.0028022407,0.0001141793,0.0001203421,0.0010549055,0.00059374154,0.019825842],"genre_scores_gemma":[0.9734529,0.000541551,0.020401508,0.00021046861,0.00015936898,0.0002688117,0.0006720957,0.00017303434,0.004120241],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989297,0.00031191864,0.000051803963,0.00033680676,0.0002292389,0.0001405087],"domain_scores_gemma":[0.98379,0.011332188,0.0012097689,0.0013535331,0.0010316701,0.0012829184],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017123839,0.0005150786,0.0006926106,0.001923299,0.00114607,0.0018295228,0.0015184705,0.0013414768,0.004178389],"category_scores_gemma":[0.017877985,0.0004971156,0.0006331067,0.00084886583,0.003062415,0.0039899773,0.001300481,0.0014032205,0.00064725144],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00071238016,0.00009884002,0.016586382,0.00035571534,0.00013513282,0.0005158888,0.00078856875,0.09025534,0.034391668,0.82201445,0.008312952,0.025832612],"study_design_scores_gemma":[0.00007615433,0.0002391418,0.00831683,0.000095981246,0.000077958335,0.0011868599,0.00026564405,0.58660424,0.015475912,0.3831023,0.004441852,0.00011712848],"about_ca_topic_score_codex":0.0007185463,"about_ca_topic_score_gemma":0.00061596686,"teacher_disagreement_score":0.004178389,"about_ca_system_score_codex":0.001546658,"about_ca_system_score_gemma":0.00061689224,"threshold_uncertainty_score":0.013978064},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.88907564,0.00044326307,0.09383875,0.0002655788,0.00005107664,0.00003367959,0.00021982427,0.00028777847,0.01578442],"genre_scores_gemma":[0.9905906,0.00008099996,0.007256613,0.00003617758,0.000050725237,0.000023319337,0.00011254959,0.00003559496,0.001813508],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995277,0.00012708239,0.00002419452,0.0001001472,0.00012563501,0.000095276846],"domain_scores_gemma":[0.9979126,0.00079810456,0.00044703716,0.00015796805,0.00027916374,0.00040511694],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005360403,0.0003085098,0.0004333501,0.0013676136,0.0006834287,0.0011222509,0.0006841762,0.0004504347,0.0030678732],"category_scores_gemma":[0.0029412492,0.00030413363,0.00036226565,0.0005621784,0.0011961882,0.0012018037,0.000849151,0.0006252349,0.00023243406],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002868729,0.00008679246,0.003019398,0.00012620764,0.000035462013,0.00039714095,0.0005966268,0.015356964,0.019395374,0.9450895,0.003066274,0.01254346],"study_design_scores_gemma":[0.000031804597,0.00008135946,0.0023512365,0.000021842747,0.000012323099,0.00055517425,0.0002271192,0.06903127,0.0038899845,0.92035645,0.003413042,0.000028403023],"about_ca_topic_score_codex":0.0005673311,"about_ca_topic_score_gemma":0.0004620025,"teacher_disagreement_score":0.0030678732,"about_ca_system_score_codex":0.0005422496,"about_ca_system_score_gemma":0.00017876748,"threshold_uncertainty_score":0.010263085},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9144414,0.00034923348,0.038368423,0.0008024545,0.00011614607,0.000043573888,0.00013960728,0.00025860648,0.045480594],"genre_scores_gemma":[0.98134893,0.0002503738,0.009801955,0.00012373012,0.000097361335,0.00007445521,0.00018217374,0.000061654646,0.008059428],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99915683,0.00021162114,0.000049011865,0.00017838854,0.00021590429,0.00018824183],"domain_scores_gemma":[0.99662435,0.0017626778,0.00055990595,0.00060247025,0.00020242289,0.0002481441],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007751195,0.0003840954,0.00050606305,0.0010884766,0.0015426236,0.0025727358,0.0007992808,0.0012158429,0.004462436],"category_scores_gemma":[0.006775817,0.00035807208,0.0005711954,0.00083840627,0.003174093,0.0036509896,0.0017348315,0.0014618518,0.00059123116],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001287694,0.00004179243,0.0011267156,0.00006578321,0.000010269659,0.00019742807,0.00033147685,0.006302395,0.0047510676,0.970803,0.0012313775,0.015009907],"study_design_scores_gemma":[0.000028239781,0.00006452436,0.00043742656,0.000022740283,0.000018540459,0.0003616388,0.00018177183,0.024014724,0.0047077215,0.96473145,0.005408683,0.000022497996],"about_ca_topic_score_codex":0.00064437796,"about_ca_topic_score_gemma":0.0007288484,"teacher_disagreement_score":0.004462436,"about_ca_system_score_codex":0.0011455286,"about_ca_system_score_gemma":0.0010973687,"threshold_uncertainty_score":0.0149284005},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2589378,0.0015929671,0.3854689,0.004317273,0.0004104319,0.00013173293,0.0003992598,0.0007176992,0.34802392],"genre_scores_gemma":[0.9165111,0.0007446155,0.015687672,0.00058100733,0.00029281623,0.000101904734,0.00025655937,0.00014700994,0.06567729],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992811,0.00019371694,0.00003147776,0.00011327624,0.00023566931,0.00014481497],"domain_scores_gemma":[0.9975292,0.0010437985,0.00020590448,0.0005167163,0.00039409677,0.0003102368],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007672006,0.0006901632,0.0007658165,0.0013232782,0.0016724764,0.0033416331,0.0011996866,0.0021251321,0.011438433],"category_scores_gemma":[0.00407501,0.00040220408,0.0007777309,0.00093288306,0.0027028339,0.0049701175,0.0019660513,0.0026788546,0.0017953619],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000041145795,0.0000070123638,0.000033395085,0.000005540036,0.0000018131682,0.000022243163,0.000072906034,0.00082587317,0.00020478907,0.99769324,0.00036913218,0.0007598816],"study_design_scores_gemma":[0.0000040840982,0.000004045103,0.000030901287,0.0000044000985,0.0000028256206,0.000049320115,0.00004366754,0.009892017,0.00014041808,0.98833615,0.0014870018,0.000005183762],"about_ca_topic_score_codex":0.0016670916,"about_ca_topic_score_gemma":0.0015016183,"teacher_disagreement_score":0.011438433,"about_ca_system_score_codex":0.0012028991,"about_ca_system_score_gemma":0.0007953675,"threshold_uncertainty_score":0.038265347},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.69661266,0.004159116,0.13859388,0.055770036,0.002244864,0.00006379643,0.0007396512,0.00040540655,0.10141063],"genre_scores_gemma":[0.9471409,0.0011411059,0.03566905,0.002304395,0.0015291887,0.00010977409,0.0005013435,0.00010107715,0.011503179],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99920326,0.00028818502,0.000035935685,0.00024199643,0.000111282534,0.000119315766],"domain_scores_gemma":[0.9922375,0.0051480667,0.00068610394,0.0009285119,0.0004147336,0.0005851964],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015244053,0.00038606563,0.0010103779,0.00095206295,0.0023673815,0.0030024613,0.0023875886,0.0041828537,0.0077710445],"category_scores_gemma":[0.013252688,0.00061389914,0.0008410504,0.0008902454,0.0043552015,0.0072182748,0.0029766087,0.0029883191,0.0005803638],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000080085454,0.000030805048,0.0005852627,0.00013181465,0.000014554674,0.0001320386,0.00022005897,0.003561843,0.00041903215,0.98295295,0.0064118886,0.0054595885],"study_design_scores_gemma":[0.000021853999,0.000007740607,0.00013719221,0.000015275547,0.0000037213692,0.000083188184,0.00011005048,0.0069024586,0.00015328267,0.99097276,0.0015829363,0.000009505614],"about_ca_topic_score_codex":0.00077695126,"about_ca_topic_score_gemma":0.000871668,"teacher_disagreement_score":0.0077710445,"about_ca_system_score_codex":0.0009376889,"about_ca_system_score_gemma":0.0010365498,"threshold_uncertainty_score":0.025996745},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4171674,0.0018557296,0.5224572,0.012039002,0.0002714278,0.00025450205,0.0010215015,0.00092620985,0.044007137],"genre_scores_gemma":[0.9554788,0.0016436008,0.01978203,0.0010096211,0.00080828334,0.00044569458,0.00035136737,0.00023284575,0.020247748],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99308395,0.00330819,0.00028124882,0.0011840273,0.0013475653,0.0007950036],"domain_scores_gemma":[0.9196189,0.060731854,0.005601459,0.0069897217,0.0024517193,0.0046063913],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007777191,0.0013603158,0.0032017103,0.004221379,0.0025070978,0.008546856,0.004456642,0.0044330857,0.008306511],"category_scores_gemma":[0.05376832,0.0022231224,0.0018086426,0.0037299977,0.009772315,0.020435072,0.006121377,0.006598274,0.001061175],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000040105097,0.00003308243,0.00030094862,0.000029145483,0.000011998013,0.00008322158,0.00017188418,0.005312333,0.00021959971,0.99200517,0.0005627095,0.0012298297],"study_design_scores_gemma":[0.000035788027,0.000010858315,0.00011770387,0.000015932572,0.000014825262,0.00009646223,0.00007430332,0.041817423,0.00021730678,0.95698524,0.00059594325,0.000018259312],"about_ca_topic_score_codex":0.0019121744,"about_ca_topic_score_gemma":0.0016544587,"teacher_disagreement_score":0.008546856,"about_ca_system_score_codex":0.0033599667,"about_ca_system_score_gemma":0.0015552716,"threshold_uncertainty_score":0.041130185},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.64398044,0.0012050382,0.039199628,0.0060969437,0.00029759205,0.0000485015,0.00046377946,0.00049503957,0.30821306],"genre_scores_gemma":[0.9663014,0.00038356084,0.0046999245,0.0007637619,0.00030557977,0.00004863429,0.00019295095,0.00011556952,0.02718854],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993113,0.00019267609,0.000028888391,0.00013374952,0.00017909579,0.0001541963],"domain_scores_gemma":[0.99648994,0.001975393,0.00037930868,0.00027649404,0.0004482293,0.00043068294],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006668907,0.0005632655,0.0007565788,0.0019968818,0.002863672,0.0037055186,0.0011378163,0.0012426688,0.01154134],"category_scores_gemma":[0.004932665,0.00053591456,0.00048916537,0.0019283841,0.004104589,0.0048542814,0.0026549262,0.0032539496,0.0011132805],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000055698223,0.00002987168,0.00037663983,0.000022373517,0.0000037026748,0.0000883426,0.00021343004,0.00030855127,0.00043923143,0.9927551,0.0022623297,0.0034448032],"study_design_scores_gemma":[0.000014081617,0.000008858123,0.0004374455,0.000008129508,0.0000046168916,0.00015921732,0.00006352451,0.0019279624,0.00031371802,0.9947332,0.0023190076,0.000010150109],"about_ca_topic_score_codex":0.0024798703,"about_ca_topic_score_gemma":0.002561157,"teacher_disagreement_score":0.01154134,"about_ca_system_score_codex":0.001403846,"about_ca_system_score_gemma":0.0007130257,"threshold_uncertainty_score":0.038609624},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.68580633,0.0048442064,0.24027085,0.009897631,0.00028121698,0.00011085956,0.00074936,0.000977677,0.05706189],"genre_scores_gemma":[0.98059547,0.0014081231,0.01032477,0.000592067,0.00039574638,0.00011622734,0.00029758769,0.0001998675,0.006070142],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997735,0.0008218696,0.00013506577,0.00045559835,0.00045627102,0.00039606896],"domain_scores_gemma":[0.9636933,0.02745029,0.002253603,0.0021661343,0.0013646832,0.003072037],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037561345,0.00080791727,0.0028456391,0.004180584,0.0025583727,0.006266014,0.0034046653,0.0027799252,0.005715476],"category_scores_gemma":[0.030623788,0.0012515254,0.0013779367,0.0028032893,0.0074769957,0.015136357,0.0041711554,0.004341021,0.00057385507],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008567025,0.000042352298,0.0009138561,0.0000992208,0.00001661581,0.00009169233,0.00047191404,0.005058143,0.0009464849,0.98763615,0.0013604059,0.0032774094],"study_design_scores_gemma":[0.000017651477,0.0000105633535,0.00030749882,0.000023898145,0.000013159777,0.00007771688,0.00008358249,0.026029458,0.00023906797,0.97272116,0.00046166076,0.000014631676],"about_ca_topic_score_codex":0.0029405525,"about_ca_topic_score_gemma":0.0021743288,"teacher_disagreement_score":0.006266014,"about_ca_system_score_codex":0.0040221936,"about_ca_system_score_gemma":0.0013238613,"threshold_uncertainty_score":0.029183209},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.78231674,0.001702053,0.122221544,0.0011003312,0.00018472958,0.00006825817,0.0005004661,0.00038380633,0.09152198],"genre_scores_gemma":[0.9844773,0.00033011867,0.0067944927,0.00010538112,0.0001144246,0.000057137466,0.0002807522,0.00006444818,0.0077759847],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99909806,0.00016840792,0.00005984348,0.00026832626,0.0002297534,0.00017569866],"domain_scores_gemma":[0.99746096,0.0012258714,0.00027656637,0.00035500378,0.00026339508,0.00041817184],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007086071,0.0005750467,0.00073941157,0.0021942703,0.002449571,0.004755728,0.0008054763,0.0009114258,0.0054288586],"category_scores_gemma":[0.002773031,0.0006107809,0.00082294375,0.0020367438,0.0042719203,0.007266065,0.0036447,0.0018087297,0.00041253451],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000056129433,0.000017140384,0.0006849674,0.00003360241,0.0000074543773,0.00009702691,0.0006022734,0.00050147326,0.0009867862,0.99274445,0.0005026401,0.0037660475],"study_design_scores_gemma":[0.000013070305,0.000018607623,0.00071025325,0.000011199664,0.000020803509,0.00022506392,0.00033405237,0.0019886985,0.001071774,0.99142444,0.0041676858,0.000014345834],"about_ca_topic_score_codex":0.001142665,"about_ca_topic_score_gemma":0.0010070384,"teacher_disagreement_score":0.0054288586,"about_ca_system_score_codex":0.0011409476,"about_ca_system_score_gemma":0.0004554574,"threshold_uncertainty_score":0.018161297},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45147198,0.00089189457,0.4657266,0.00489874,0.00023304185,0.00029801665,0.0005493946,0.00053655304,0.07539386],"genre_scores_gemma":[0.9054988,0.00055896735,0.050658423,0.0005270534,0.0002445968,0.00040437974,0.00028481247,0.00022027561,0.04160263],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974427,0.0012884516,0.00008024297,0.00040955754,0.00032797144,0.00045112852],"domain_scores_gemma":[0.98982483,0.0069134682,0.00079181703,0.0006913679,0.00040567445,0.0013727912],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025909117,0.0018332362,0.0032158575,0.001963037,0.0023833932,0.0038450544,0.003390391,0.004329643,0.010227873],"category_scores_gemma":[0.012318846,0.0013131353,0.0017574471,0.001516181,0.0047916435,0.008419575,0.0038775876,0.003837003,0.0007335728],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021384026,0.00011405684,0.00024416688,0.00007831704,0.000043742453,0.00024262795,0.00023868895,0.07680094,0.0010254735,0.91424924,0.0031928846,0.0035559463],"study_design_scores_gemma":[0.00006689093,0.000055530996,0.0001327802,0.000017691165,0.00002388552,0.00007519078,0.00009465376,0.32371756,0.00025524304,0.67443097,0.0010974051,0.000032244978],"about_ca_topic_score_codex":0.004086701,"about_ca_topic_score_gemma":0.004049083,"teacher_disagreement_score":0.010227873,"about_ca_system_score_codex":0.0021525885,"about_ca_system_score_gemma":0.0016042687,"threshold_uncertainty_score":0.03421557},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47728318,0.0029170946,0.18723664,0.004821963,0.0011937962,0.00022928692,0.00082524243,0.00087580044,0.32461694],"genre_scores_gemma":[0.9405793,0.0011371336,0.027615253,0.00056387647,0.0005523305,0.0003134962,0.000349992,0.00014808736,0.028740501],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99897087,0.0002743482,0.00007360751,0.0001800632,0.00030711887,0.00019395641],"domain_scores_gemma":[0.9974159,0.0014332539,0.0002648279,0.00024704408,0.00028120863,0.0003577849],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016916896,0.0009385809,0.0012047413,0.0052096127,0.0040826607,0.005195913,0.0013724954,0.0016408305,0.016677516],"category_scores_gemma":[0.0061958786,0.00072382076,0.0010104785,0.0034577916,0.0048777084,0.010025816,0.0032545647,0.004183539,0.0022520605],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016550424,0.000008615909,0.00004239896,0.0000147894,0.0000017308369,0.000025009613,0.00012699538,0.00015121253,0.00011007085,0.9968477,0.0005395463,0.0021153183],"study_design_scores_gemma":[0.000006517314,0.0000053724507,0.000050918803,0.000008885933,0.000003671752,0.000043547014,0.000057179488,0.000835052,0.00011833987,0.99764293,0.0012194349,0.000008146045],"about_ca_topic_score_codex":0.0008145587,"about_ca_topic_score_gemma":0.0012181508,"teacher_disagreement_score":0.016677516,"about_ca_system_score_codex":0.0020488414,"about_ca_system_score_gemma":0.0010743508,"threshold_uncertainty_score":0.055791914},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.59098524,0.009787236,0.18795566,0.0069411956,0.00060470635,0.00013408206,0.0013544223,0.0005269971,0.20171043],"genre_scores_gemma":[0.9660017,0.0024884536,0.014575904,0.00034101927,0.00039911683,0.00021577081,0.0002998511,0.000097833865,0.015580351],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99938846,0.00013679886,0.000030235446,0.00013286417,0.00021844744,0.00009307313],"domain_scores_gemma":[0.9953551,0.0030561837,0.00047079404,0.00041888707,0.0003612303,0.0003377687],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010876947,0.00038017528,0.00045885428,0.0017592333,0.00083504175,0.0028717373,0.00087407907,0.000912143,0.0073367087],"category_scores_gemma":[0.007083518,0.00045516988,0.00035515917,0.0014066055,0.002307483,0.006360734,0.0014493412,0.0013744457,0.00068083947],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000048702772,0.000015338723,0.000458993,0.000082402425,0.0000060558855,0.00002270969,0.00014515786,0.003215412,0.0015772297,0.9826999,0.0028616772,0.008866437],"study_design_scores_gemma":[0.000012635127,0.000019037088,0.0007180598,0.000038719612,0.000008541304,0.00015433172,0.000100070974,0.011509886,0.001311809,0.9802807,0.00583444,0.000011740251],"about_ca_topic_score_codex":0.0003182173,"about_ca_topic_score_gemma":0.00041334683,"teacher_disagreement_score":0.0073367087,"about_ca_system_score_codex":0.0012451955,"about_ca_system_score_gemma":0.00046202407,"threshold_uncertainty_score":0.024543703},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2123836,0.011774564,0.30074203,0.012225321,0.00079288473,0.00010080841,0.0008495856,0.00088618766,0.460245],"genre_scores_gemma":[0.8562795,0.0055216025,0.041499205,0.0015114726,0.0012542462,0.00022837467,0.0005855023,0.0003577592,0.09276242],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990237,0.0004468589,0.000047005473,0.00020702991,0.00019273454,0.000082747116],"domain_scores_gemma":[0.997463,0.0014744385,0.00028377888,0.00024980307,0.00032193886,0.00020709677],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009339895,0.0005284086,0.0007544808,0.0032875796,0.0031082756,0.0063299746,0.001081758,0.0016763518,0.012520041],"category_scores_gemma":[0.004554853,0.00079257984,0.0005935081,0.003989604,0.0062109684,0.013393657,0.002264933,0.0043284246,0.0018142539],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004675459,0.0000047246117,0.000078074954,0.000013982644,0.0000016137088,0.000017302276,0.00023243857,0.00015306422,0.00007109822,0.99652016,0.0008735141,0.0020293945],"study_design_scores_gemma":[0.0000033968338,0.0000016598287,0.000048374262,0.000008612208,0.0000030474991,0.000029730329,0.000080474245,0.00048113553,0.000061798906,0.99376523,0.005513604,0.0000030015399],"about_ca_topic_score_codex":0.002321302,"about_ca_topic_score_gemma":0.002179994,"teacher_disagreement_score":0.012520041,"about_ca_system_score_codex":0.002167664,"about_ca_system_score_gemma":0.00058915716,"threshold_uncertainty_score":0.041883707},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43936548,0.0021498469,0.0925133,0.00790122,0.001744962,0.0001095663,0.0005526758,0.0008386032,0.4548244],"genre_scores_gemma":[0.8710683,0.0007995334,0.018108634,0.0012611318,0.0010559337,0.00013500749,0.0004676673,0.00027506196,0.106828816],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99896634,0.00028014238,0.000050318045,0.00024361881,0.00026773213,0.00019182976],"domain_scores_gemma":[0.9971245,0.0013041049,0.00027479493,0.00031040327,0.0004587139,0.0005274279],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009134871,0.0008758524,0.0010719999,0.0033292058,0.004057784,0.0055015516,0.0015124197,0.0024476128,0.012585719],"category_scores_gemma":[0.0040925937,0.00073609524,0.0008570942,0.0015998358,0.004517746,0.0075421818,0.0029746804,0.00444843,0.0013451594],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008938594,0.000011092055,0.000056732613,0.0000070669175,0.0000021040041,0.00002606085,0.00010658639,0.000070896094,0.00019241274,0.99799395,0.000621123,0.0009031135],"study_design_scores_gemma":[0.000007758979,0.000006146504,0.0000898814,0.000008835953,0.0000047032904,0.00008085805,0.00007296757,0.00066129025,0.00024484735,0.99612516,0.0026905327,0.0000069454068],"about_ca_topic_score_codex":0.0009258373,"about_ca_topic_score_gemma":0.0015896343,"teacher_disagreement_score":0.012585719,"about_ca_system_score_codex":0.0020786163,"about_ca_system_score_gemma":0.00078195747,"threshold_uncertainty_score":0.04210347},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4790657,0.0036733337,0.17940363,0.0047938093,0.001098859,0.00006856907,0.000417399,0.00050809514,0.33097064],"genre_scores_gemma":[0.9164649,0.0019007844,0.02209108,0.00070162624,0.0011932555,0.00013098388,0.00040331835,0.00024017024,0.056873832],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987429,0.0003246473,0.000083724524,0.00024936715,0.0004387801,0.00016064188],"domain_scores_gemma":[0.9962882,0.001807518,0.00037624463,0.00037344825,0.0005725968,0.0005820731],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001170787,0.00064809213,0.0009522108,0.003668153,0.0026931048,0.0042647542,0.0013166593,0.0013251808,0.010413054],"category_scores_gemma":[0.007774413,0.0007013722,0.0009546921,0.0023268024,0.0040803463,0.008200489,0.003055884,0.0031395778,0.0011930491],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011433577,0.000014142827,0.00013211052,0.000011847286,0.0000032865767,0.00003900527,0.00014420359,0.00025679532,0.00022735274,0.99548197,0.0005063333,0.0031714658],"study_design_scores_gemma":[0.0000037293535,0.0000049368978,0.00007815912,0.000006656412,0.0000029534974,0.00007734319,0.000039810053,0.0011567932,0.00014340159,0.99685174,0.0016294952,0.000004981159],"about_ca_topic_score_codex":0.00097622804,"about_ca_topic_score_gemma":0.0008693898,"teacher_disagreement_score":0.010413054,"about_ca_system_score_codex":0.0015129715,"about_ca_system_score_gemma":0.00082168693,"threshold_uncertainty_score":0.0348351},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15931511,0.0032582043,0.6536931,0.0037537373,0.0014191892,0.00011493497,0.00044852804,0.00040732618,0.1775898],"genre_scores_gemma":[0.8088751,0.0026149391,0.13184878,0.002348479,0.0018398903,0.00031480927,0.00027668467,0.00026943962,0.051611926],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988073,0.00023637536,0.00008113401,0.00040160478,0.00034287188,0.00013066418],"domain_scores_gemma":[0.9982772,0.0008385953,0.00017441518,0.00034897498,0.0002244558,0.00013639363],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019803736,0.00082098565,0.00095773133,0.0018181518,0.0013376297,0.0018291692,0.0012778443,0.0009349025,0.005449678],"category_scores_gemma":[0.005124478,0.00035524755,0.0012409408,0.00137447,0.0037915206,0.007885035,0.004109073,0.0032247242,0.0011076708],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014205952,0.0000067372007,0.0001237022,0.000035923564,0.000004987676,0.000034065666,0.00014969095,0.0005172542,0.0007957999,0.98972064,0.0007652326,0.007831756],"study_design_scores_gemma":[0.000008155495,0.000022413726,0.00020580423,0.000014040204,0.0000062845534,0.00017865087,0.000042012078,0.0018950888,0.00088661414,0.98825294,0.008474913,0.000013134835],"about_ca_topic_score_codex":0.00048889243,"about_ca_topic_score_gemma":0.00029885178,"teacher_disagreement_score":0.005449678,"about_ca_system_score_codex":0.0012914262,"about_ca_system_score_gemma":0.0005351793,"threshold_uncertainty_score":0.018230975},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6052933,0.0014171622,0.26065442,0.0032857037,0.0003486041,0.00023084765,0.0020441946,0.002515321,0.12421051],"genre_scores_gemma":[0.94319284,0.00053371786,0.021133412,0.0005910032,0.00020012532,0.00016536664,0.000875969,0.0007620711,0.032545492],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998295,0.00051769346,0.00008166936,0.000363205,0.00034686064,0.0003955229],"domain_scores_gemma":[0.9923781,0.003679879,0.0008052344,0.0009755313,0.0009933253,0.001167842],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021166347,0.0006446117,0.0012095447,0.0020170528,0.0020547425,0.0026933467,0.00085242203,0.0012237354,0.016572796],"category_scores_gemma":[0.009530796,0.00061792607,0.0012776983,0.0012259883,0.0029131933,0.003625759,0.0015335155,0.0014597914,0.003165705],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023085001,0.000053396063,0.0013364825,0.000080077065,0.000023952498,0.00018057816,0.00026659845,0.005861657,0.0009308457,0.97492796,0.009644981,0.006462613],"study_design_scores_gemma":[0.0000536841,0.000027115611,0.0005474441,0.000036879093,0.00001585403,0.00017124966,0.00008950435,0.018253066,0.0010547035,0.97581553,0.0039081317,0.000026848926],"about_ca_topic_score_codex":0.0034251737,"about_ca_topic_score_gemma":0.005846193,"teacher_disagreement_score":0.016572796,"about_ca_system_score_codex":0.0017192316,"about_ca_system_score_gemma":0.0014830884,"threshold_uncertainty_score":0.05544156},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6667213,0.0022035365,0.18300202,0.003799218,0.00021908489,0.00010032322,0.00075806445,0.00087103655,0.1423254],"genre_scores_gemma":[0.95228595,0.0008953984,0.021918228,0.0003723863,0.0001642931,0.00007222698,0.0004644526,0.00016838322,0.023658706],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99939144,0.000112393514,0.000024970417,0.00018485442,0.00017903006,0.000107179156],"domain_scores_gemma":[0.99803287,0.00073505624,0.00033775473,0.00030197934,0.0001958527,0.00039648882],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005539392,0.0005198722,0.00077223126,0.0022221052,0.002925904,0.0033554973,0.0016424389,0.001497913,0.0049060457],"category_scores_gemma":[0.0029556155,0.0005522352,0.0005991468,0.0020211623,0.004084577,0.0059538847,0.002187142,0.0029246719,0.0005882684],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025208543,0.000014338814,0.0003273533,0.000035402943,0.000007256765,0.00010761569,0.00041685335,0.0011490596,0.0005031423,0.9920797,0.0011792865,0.004154863],"study_design_scores_gemma":[0.000008918835,0.000005306212,0.00032403177,0.000011982231,0.000007424556,0.000203231,0.00023989892,0.003066723,0.00035845232,0.99125797,0.0045044282,0.000011642253],"about_ca_topic_score_codex":0.0016177555,"about_ca_topic_score_gemma":0.001869269,"teacher_disagreement_score":0.0049060457,"about_ca_system_score_codex":0.0012349226,"about_ca_system_score_gemma":0.00077371113,"threshold_uncertainty_score":0.016412377},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02132265,0.0006253976,0.80678445,0.0029806118,0.0012064371,0.00024332496,0.0010248815,0.0028110263,0.16300124],"genre_scores_gemma":[0.52148736,0.0021633557,0.34509304,0.0060232976,0.0016488922,0.00094967446,0.0044681425,0.004295403,0.11387077],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99599165,0.00077851693,0.00027692007,0.0010262076,0.0013617503,0.000564981],"domain_scores_gemma":[0.99498796,0.0018506276,0.00027716733,0.0016775406,0.0010233186,0.00018345218],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002429648,0.0008210913,0.00082740077,0.0012033874,0.002161429,0.0027617707,0.0020223497,0.0013562642,0.018825598],"category_scores_gemma":[0.0067018536,0.00082088355,0.002281013,0.0012821638,0.0037967744,0.009371234,0.0055648983,0.0055388035,0.010017797],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005485393,0.000036421054,0.00017430862,0.00014641657,0.000027492943,0.00033094862,0.00039363405,0.0005591036,0.004467087,0.9474603,0.013332086,0.033017393],"study_design_scores_gemma":[0.000046110526,0.000045796656,0.0002370828,0.000036500234,0.00004924363,0.0007866375,0.00021004272,0.0030340725,0.012756046,0.87384176,0.108919576,0.00003727914],"about_ca_topic_score_codex":0.0015060655,"about_ca_topic_score_gemma":0.0011601759,"teacher_disagreement_score":0.018825598,"about_ca_system_score_codex":0.001034866,"about_ca_system_score_gemma":0.0013131747,"threshold_uncertainty_score":0.06297785},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48131272,0.00097064907,0.4628761,0.00057307334,0.00013655142,0.000038407747,0.0005553069,0.00022530172,0.053311802],"genre_scores_gemma":[0.96194756,0.00043901958,0.029531794,0.00010000933,0.00019797563,0.00008423076,0.00031303643,0.00009250269,0.0072938423],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99852437,0.00029100073,0.000080283884,0.00026831927,0.0004794763,0.00035659698],"domain_scores_gemma":[0.99652714,0.0017898738,0.00042753192,0.00033699695,0.00047426843,0.0004441624],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012874232,0.00061805034,0.00084032863,0.0016472639,0.0015590488,0.0025818138,0.0016803337,0.00042308486,0.0056178253],"category_scores_gemma":[0.005324727,0.00037099177,0.0010238293,0.0011720245,0.0026097952,0.004951208,0.0023108753,0.0019828537,0.00047110097],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002709778,0.000009495267,0.00036031808,0.00003194943,0.000010269475,0.00004524434,0.00009601721,0.0030692078,0.0014760668,0.99071383,0.00030824236,0.0038522934],"study_design_scores_gemma":[0.000005624981,0.000031603686,0.00076514954,0.000021811378,0.000015939931,0.00012124812,0.00012331511,0.038484957,0.0035073706,0.95444626,0.0024565817,0.00002014243],"about_ca_topic_score_codex":0.0010912602,"about_ca_topic_score_gemma":0.0013586049,"teacher_disagreement_score":0.0056178253,"about_ca_system_score_codex":0.0013896642,"about_ca_system_score_gemma":0.00046466262,"threshold_uncertainty_score":0.018793523},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.55546457,0.0011325203,0.20139153,0.0034260622,0.00046632002,0.00011807931,0.00064121635,0.0027329982,0.23462677],"genre_scores_gemma":[0.9380002,0.0003962437,0.04307703,0.00044364473,0.00013021288,0.00007189968,0.00030005866,0.0004322044,0.017148504],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987607,0.00043175698,0.000039862298,0.00019196776,0.00028790662,0.00028783138],"domain_scores_gemma":[0.9941538,0.0031996954,0.00026529728,0.0013503348,0.0005849385,0.00044587816],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010254019,0.00060797716,0.001247811,0.0012930459,0.0019317991,0.0031557276,0.0019277675,0.0018707286,0.012896905],"category_scores_gemma":[0.008537595,0.0005245166,0.0006178731,0.0012355568,0.002273003,0.0039870827,0.0022493235,0.0019811597,0.001253772],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014215917,0.00006121127,0.00037450736,0.00007802676,0.000013275287,0.000059195747,0.00020930349,0.009066356,0.003022666,0.96169823,0.0064667654,0.01880833],"study_design_scores_gemma":[0.0000356771,0.000017440658,0.00020920737,0.000018322611,0.000015191846,0.00009068158,0.0000663738,0.034423728,0.0010516157,0.9609798,0.0030744544,0.00001750598],"about_ca_topic_score_codex":0.0024833055,"about_ca_topic_score_gemma":0.004987468,"teacher_disagreement_score":0.012896905,"about_ca_system_score_codex":0.0020654465,"about_ca_system_score_gemma":0.0011047064,"threshold_uncertainty_score":0.043144405},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44824162,0.009254902,0.28367883,0.05409498,0.002129733,0.00038263298,0.004442503,0.0022566777,0.19551815],"genre_scores_gemma":[0.918117,0.0037674177,0.04360279,0.00443352,0.004978992,0.00063742825,0.0021113644,0.0007902748,0.021561176],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98886746,0.0025058195,0.0005415332,0.0034101137,0.0025967357,0.002078421],"domain_scores_gemma":[0.894988,0.08643423,0.0039921044,0.0065233326,0.0029017648,0.0051605524],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01261192,0.00300202,0.0056991125,0.0070796493,0.0072502466,0.010192469,0.009413221,0.0056485385,0.01937019],"category_scores_gemma":[0.07304186,0.004313932,0.0042307014,0.007424436,0.010957576,0.03090852,0.011086779,0.016666101,0.002753902],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001117362,0.00026561882,0.0034933386,0.0004476749,0.00013659654,0.0002703039,0.0013620995,0.012521089,0.0020454118,0.94757473,0.015571212,0.015194545],"study_design_scores_gemma":[0.000092665454,0.00004404424,0.0006481909,0.00007634508,0.000077557095,0.00015782616,0.00016459475,0.019837296,0.0009764265,0.9736473,0.004226546,0.000051311705],"about_ca_topic_score_codex":0.002862764,"about_ca_topic_score_gemma":0.0026694606,"teacher_disagreement_score":0.01937019,"about_ca_system_score_codex":0.005904443,"about_ca_system_score_gemma":0.0019446217,"threshold_uncertainty_score":0.06669903},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.75164855,0.0013021792,0.21433188,0.0011835688,0.00005296133,0.00008481328,0.0007352101,0.0002900654,0.030370811],"genre_scores_gemma":[0.97093475,0.00041311356,0.024980953,0.000060375074,0.0000622895,0.000054268094,0.0003679796,0.000048926435,0.003077376],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990609,0.00036508628,0.0000461029,0.00016812644,0.00020999198,0.00014975725],"domain_scores_gemma":[0.99258465,0.0052423533,0.00065889425,0.0005615962,0.00042501406,0.00052753655],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001374309,0.0002878118,0.00058651995,0.0014040854,0.0011023921,0.001775466,0.00058413553,0.00053155096,0.0065153996],"category_scores_gemma":[0.0075388346,0.00052721,0.00052112615,0.0014648199,0.0018619257,0.0025387674,0.0014739676,0.00090039865,0.0003402016],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018377474,0.000035696245,0.002524806,0.00017970362,0.000040077608,0.0001589687,0.00039975366,0.037415333,0.005275015,0.9390353,0.00210006,0.01265148],"study_design_scores_gemma":[0.000052136744,0.00006383275,0.002024427,0.000034403478,0.00002590981,0.0003037922,0.00018498118,0.12698077,0.002155082,0.86268425,0.005475031,0.000015338834],"about_ca_topic_score_codex":0.001086762,"about_ca_topic_score_gemma":0.0014454486,"teacher_disagreement_score":0.0065153996,"about_ca_system_score_codex":0.0014198093,"about_ca_system_score_gemma":0.00044368874,"threshold_uncertainty_score":0.021796227},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3655183,0.0035458752,0.4683974,0.009249299,0.00035738593,0.00015740788,0.0010181764,0.00054892304,0.15120733],"genre_scores_gemma":[0.95047307,0.0016012889,0.03426573,0.0010807541,0.00049528776,0.00019001601,0.0005763068,0.00005934671,0.0112582585],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981419,0.00045795395,0.00010127758,0.00057586574,0.00047727156,0.0002457709],"domain_scores_gemma":[0.9948966,0.0025281713,0.00060541293,0.00090128434,0.00070986355,0.000358613],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019172408,0.00055703154,0.0009755577,0.0013921141,0.0020941512,0.0039102873,0.0014683407,0.0022126934,0.0050063897],"category_scores_gemma":[0.009123792,0.0003516385,0.00084515766,0.0025404864,0.004925008,0.01057374,0.0032922723,0.002355716,0.00063204987],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013044774,0.0000048306606,0.0002595096,0.000015197703,0.000003252469,0.00004269702,0.00017908904,0.0008040808,0.00032890294,0.9957546,0.0006433032,0.0019514898],"study_design_scores_gemma":[0.000011264305,0.00002127291,0.00019562802,0.000014950485,0.000010347981,0.00017007224,0.00013751672,0.0057393606,0.0005389705,0.9860005,0.0071505336,0.000009683361],"about_ca_topic_score_codex":0.0016041503,"about_ca_topic_score_gemma":0.0007406143,"teacher_disagreement_score":0.0050063897,"about_ca_system_score_codex":0.0023775545,"about_ca_system_score_gemma":0.00095035497,"threshold_uncertainty_score":0.017250419},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22359605,0.0036761966,0.7256559,0.0014747148,0.00022033042,0.0002846229,0.00076356676,0.0006478929,0.04368067],"genre_scores_gemma":[0.74971116,0.0017844633,0.22692104,0.00069218443,0.00035488306,0.0010482303,0.00096316996,0.00046376407,0.018061124],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99710804,0.0012069102,0.00015860057,0.0005651013,0.0006564001,0.0003049989],"domain_scores_gemma":[0.98983955,0.0068011144,0.001175974,0.00068230944,0.00088245125,0.0006185688],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036868525,0.00060932705,0.001562051,0.0032808054,0.0014937302,0.0033692343,0.0013078992,0.0013431278,0.008471735],"category_scores_gemma":[0.024290565,0.0011099894,0.001025778,0.0019308745,0.0025468257,0.0047283624,0.0038525022,0.0015583253,0.0016835965],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019458495,0.000046650046,0.00127691,0.00022793915,0.00005530038,0.00016456936,0.00031030926,0.039800335,0.0018073538,0.92741627,0.0038579982,0.024841748],"study_design_scores_gemma":[0.000060781604,0.000054953616,0.0006233671,0.000084382555,0.000016611317,0.00022670865,0.000113441114,0.13720733,0.0016128393,0.85407704,0.0058932346,0.00002929809],"about_ca_topic_score_codex":0.00046668967,"about_ca_topic_score_gemma":0.00053546426,"teacher_disagreement_score":0.008471735,"about_ca_system_score_codex":0.0013569238,"about_ca_system_score_gemma":0.00062553387,"threshold_uncertainty_score":0.028340757},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5904721,0.008054852,0.20372301,0.012331141,0.00088196684,0.000067559544,0.0005106412,0.000506461,0.18345228],"genre_scores_gemma":[0.95898825,0.0028897398,0.016596263,0.00076022005,0.0009547707,0.00010443386,0.00028397894,0.00013656094,0.019285765],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991405,0.0003314255,0.000050393868,0.00015845562,0.00020900431,0.000110152236],"domain_scores_gemma":[0.9946122,0.0033431773,0.0006055028,0.00035967675,0.0004908784,0.0005885308],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001078679,0.00078041694,0.00088304543,0.0028851633,0.0019714828,0.0045462456,0.0015470234,0.0015320524,0.00685231],"category_scores_gemma":[0.0076071075,0.0007440127,0.00078736164,0.002241092,0.00546936,0.009906923,0.0035069794,0.003748473,0.00064109766],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008953473,0.000013632056,0.00012655639,0.000020201243,0.0000031313625,0.000024972436,0.00021316641,0.00044750833,0.00012363556,0.9963565,0.000585274,0.0020766086],"study_design_scores_gemma":[0.0000038045673,0.0000033793274,0.000060684404,0.0000068274967,0.000002132114,0.000030455221,0.00007310993,0.0012344044,0.000050918043,0.9977622,0.0007684169,0.0000037343227],"about_ca_topic_score_codex":0.0011397961,"about_ca_topic_score_gemma":0.0011485158,"teacher_disagreement_score":0.00685231,"about_ca_system_score_codex":0.0016112691,"about_ca_system_score_gemma":0.00055223855,"threshold_uncertainty_score":0.022923231},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5665504,0.0022172383,0.36739632,0.0038519814,0.00022576847,0.00007988603,0.00045560487,0.00060804957,0.05861467],"genre_scores_gemma":[0.94197184,0.0012120241,0.04552109,0.00033071943,0.0004977651,0.00019356428,0.0002843884,0.00013126875,0.009857259],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977228,0.0007006442,0.000099134515,0.00045028838,0.0007757939,0.00025130535],"domain_scores_gemma":[0.98277444,0.011755764,0.0012286853,0.0019365671,0.0012002948,0.0011041723],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038244417,0.0006671514,0.0011479056,0.0027557386,0.0018792312,0.003833995,0.0016272049,0.0013422999,0.0035521144],"category_scores_gemma":[0.028254693,0.0006683637,0.00084517617,0.0020573097,0.0046019666,0.008097448,0.0037944573,0.0028147053,0.00045306],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029408544,0.000010694745,0.0004082098,0.00003383405,0.0000062196727,0.000092106005,0.00014459112,0.003954197,0.0006384175,0.9902553,0.0005096298,0.003917362],"study_design_scores_gemma":[0.000008370223,0.000012018273,0.00026973957,0.00001236515,0.0000064621377,0.00013504089,0.00003666494,0.02042767,0.0006053268,0.97702163,0.0014568,0.000008015086],"about_ca_topic_score_codex":0.000976923,"about_ca_topic_score_gemma":0.0007865056,"teacher_disagreement_score":0.003833995,"about_ca_system_score_codex":0.0022759095,"about_ca_system_score_gemma":0.0009781306,"threshold_uncertainty_score":0.020225823},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20814626,0.0020907652,0.39197704,0.0019743037,0.00067829544,0.00015387354,0.0040301033,0.0019213714,0.389028],"genre_scores_gemma":[0.83905035,0.0013693696,0.07551362,0.0007002552,0.00044653975,0.00035189677,0.0059843473,0.00084253255,0.07574107],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9948802,0.0013280206,0.00039250148,0.0014595249,0.0012281139,0.00071171863],"domain_scores_gemma":[0.9928456,0.0032537326,0.00056394294,0.0012188862,0.0016461759,0.0004715813],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018052866,0.0008298956,0.0010938451,0.0038204906,0.0046582706,0.0046143113,0.0011566718,0.0014266573,0.02426791],"category_scores_gemma":[0.008083909,0.00093959196,0.0022615283,0.0032184185,0.0029591222,0.00783079,0.003680715,0.0020693068,0.0043141125],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000060134458,0.000017425182,0.0010763375,0.00006098336,0.000026511105,0.00049855094,0.0006507206,0.0011320096,0.00064826896,0.9750479,0.0044551305,0.016325986],"study_design_scores_gemma":[0.000012882543,0.000025314319,0.00051109056,0.00006176236,0.000021446747,0.00077819003,0.00051697163,0.004656591,0.0009965006,0.956556,0.035835143,0.000028134893],"about_ca_topic_score_codex":0.0027592962,"about_ca_topic_score_gemma":0.002137917,"teacher_disagreement_score":0.02426791,"about_ca_system_score_codex":0.0031240894,"about_ca_system_score_gemma":0.0011967807,"threshold_uncertainty_score":0.08118427},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47017378,0.003404779,0.2103295,0.043331455,0.001186007,0.00013752583,0.0006763708,0.0006060076,0.27015463],"genre_scores_gemma":[0.9241851,0.0020468624,0.036497302,0.0022431216,0.0009622979,0.0001611415,0.0005048215,0.00018722967,0.033212196],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99899095,0.00047388542,0.000036333084,0.00020565453,0.00016574697,0.00012742144],"domain_scores_gemma":[0.9960186,0.0027850447,0.00021517074,0.00040007196,0.00024241766,0.00033874137],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017759299,0.00071378885,0.0013922831,0.000963483,0.003430864,0.003037721,0.0022797622,0.002904707,0.009425394],"category_scores_gemma":[0.007161419,0.0005846644,0.00093714806,0.002084576,0.0042863656,0.012900462,0.0037850244,0.004322036,0.0007381007],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004756843,0.000028719913,0.00011488612,0.000059565366,0.000007172265,0.00006104501,0.00016480063,0.0019097809,0.000199254,0.98829716,0.0049134404,0.0041965684],"study_design_scores_gemma":[0.000015844902,0.000004921487,0.000043975648,0.000009773462,0.0000061091446,0.000056471505,0.00008093383,0.005135355,0.00009763507,0.99219173,0.0023516617,0.0000055250403],"about_ca_topic_score_codex":0.001348185,"about_ca_topic_score_gemma":0.0013659422,"teacher_disagreement_score":0.009425394,"about_ca_system_score_codex":0.0014652244,"about_ca_system_score_gemma":0.0010166087,"threshold_uncertainty_score":0.031531096},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07468495,0.12089335,0.37105912,0.07893888,0.025515785,0.00015225074,0.0027304126,0.0019901528,0.32403502],"genre_scores_gemma":[0.572865,0.10482799,0.16921109,0.017214753,0.050485056,0.00040963304,0.001441898,0.0024058358,0.08113865],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99832684,0.000494861,0.00012913442,0.00037574154,0.00052742974,0.00014593966],"domain_scores_gemma":[0.9809301,0.0151164355,0.0006103056,0.00147594,0.001161637,0.00070558285],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021725397,0.0013004619,0.0015463553,0.0042521516,0.0025231843,0.0042295186,0.0030422227,0.0022289557,0.008631871],"category_scores_gemma":[0.016476726,0.00092594186,0.0011242931,0.008806717,0.0053817797,0.020912979,0.0032405898,0.0078461245,0.0021291238],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006559371,0.00004095783,0.00056673295,0.00029441502,0.000019723842,0.00009724048,0.00039624938,0.0032661345,0.0009670152,0.9277214,0.030103095,0.03646155],"study_design_scores_gemma":[0.000005480052,0.000011663282,0.0001923371,0.000050807077,0.000012220519,0.000044682096,0.00007089148,0.00171127,0.00029818862,0.9668267,0.030757545,0.000018201126],"about_ca_topic_score_codex":0.002379193,"about_ca_topic_score_gemma":0.0025434822,"teacher_disagreement_score":0.008631871,"about_ca_system_score_codex":0.0025148739,"about_ca_system_score_gemma":0.0008777505,"threshold_uncertainty_score":0.028876543},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22334084,0.0016137541,0.13587847,0.0061537037,0.00080515596,0.00020939797,0.0023058672,0.0011085607,0.6285842],"genre_scores_gemma":[0.84311116,0.0005914247,0.03120415,0.0010026806,0.00021340098,0.00014026738,0.0011387568,0.00035658822,0.12224154],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994099,0.000107765154,0.000026176443,0.00015572025,0.00015476519,0.00014565475],"domain_scores_gemma":[0.9984547,0.0003816216,0.00012993373,0.00031152216,0.00040024007,0.00032192108],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036030053,0.00038065363,0.000881633,0.0014322154,0.0033333597,0.003910085,0.0009502378,0.0013747142,0.018691486],"category_scores_gemma":[0.0031164675,0.00042778515,0.00056983024,0.0014739177,0.002680207,0.003366838,0.002479165,0.0029055232,0.0056121196],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003181305,0.000011769527,0.00018451453,0.000018182054,0.000004003769,0.00009862299,0.00024668273,0.00015184382,0.00067134725,0.98988146,0.002874854,0.005824908],"study_design_scores_gemma":[0.000015295971,0.000008512078,0.0002469808,0.000016609338,0.000012117744,0.00025054743,0.00026413813,0.00097106054,0.0006280898,0.96556985,0.032006145,0.00001062503],"about_ca_topic_score_codex":0.0017106168,"about_ca_topic_score_gemma":0.0023683682,"teacher_disagreement_score":0.018691486,"about_ca_system_score_codex":0.0013388648,"about_ca_system_score_gemma":0.00084750156,"threshold_uncertainty_score":0.06252921},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8545347,0.0019352755,0.098515354,0.0055417847,0.00024634792,0.00007724185,0.00074255565,0.00027390412,0.03813295],"genre_scores_gemma":[0.9555597,0.001073693,0.032997616,0.00033276813,0.0005580412,0.00014867247,0.0007029357,0.00021754355,0.008409061],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984201,0.0005399642,0.00008060967,0.00040953798,0.00031047655,0.00023922222],"domain_scores_gemma":[0.9654958,0.028010327,0.0019535297,0.0009951069,0.0009590535,0.0025860965],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030525734,0.0011344451,0.001959009,0.003941556,0.0026777158,0.004287483,0.0040835044,0.0030926147,0.007268356],"category_scores_gemma":[0.01954498,0.0014314394,0.0012550767,0.0023792607,0.0057349456,0.011161357,0.003168156,0.0028411653,0.0004566888],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008187449,0.00019851256,0.005248912,0.00060053775,0.00013960034,0.00049160124,0.00141412,0.046026416,0.009450701,0.91495496,0.005103449,0.015552451],"study_design_scores_gemma":[0.00007785391,0.00007305208,0.002034888,0.0000758699,0.00006271286,0.00033468983,0.00041517927,0.113719,0.0013980606,0.87963486,0.0021234434,0.000050363284],"about_ca_topic_score_codex":0.0016107293,"about_ca_topic_score_gemma":0.0022837222,"teacher_disagreement_score":0.007268356,"about_ca_system_score_codex":0.0018700868,"about_ca_system_score_gemma":0.0006632215,"threshold_uncertainty_score":0.024315119},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018390477,0.0004468971,0.96915406,0.00075569976,0.00010882106,0.00013552057,0.00018347215,0.002422813,0.008402247],"genre_scores_gemma":[0.1888434,0.00050974864,0.7988243,0.00067509094,0.00017753949,0.00040593237,0.0013362996,0.00068430963,0.008543408],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980915,0.0003349121,0.00012191887,0.0006731462,0.00048283167,0.00029561584],"domain_scores_gemma":[0.99723,0.0011783909,0.00019327694,0.0009801923,0.0002466586,0.00017140117],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013831701,0.0014583784,0.0013650515,0.0016359291,0.0014108347,0.0029350703,0.0035919247,0.0019866896,0.008034089],"category_scores_gemma":[0.006421494,0.0009215982,0.0019732078,0.0026155233,0.0015953896,0.008161169,0.004006587,0.0034090215,0.0033590645],"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.0010598651,0.00067002623,0.0029170902,0.0007053296,0.00026802503,0.00027857945,0.00078754633,0.11318614,0.037130035,0.29527256,0.042807244,0.5049176],"study_design_scores_gemma":[0.0003489529,0.0003434902,0.0009791565,0.00008049687,0.00016008792,0.00068927585,0.00024829188,0.6560179,0.016122153,0.30312404,0.021788936,0.00009720644],"about_ca_topic_score_codex":0.003008674,"about_ca_topic_score_gemma":0.004239401,"teacher_disagreement_score":0.008034089,"about_ca_system_score_codex":0.0023039673,"about_ca_system_score_gemma":0.0022227492,"threshold_uncertainty_score":0.026876688},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22035207,0.005532362,0.42154157,0.011637087,0.0012949896,0.00014376428,0.00087747554,0.0010684597,0.33755225],"genre_scores_gemma":[0.9056262,0.0029438746,0.038921762,0.0018494177,0.0028828713,0.000484709,0.0008112519,0.0006839405,0.04579605],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970094,0.0008071074,0.00012103315,0.0004882411,0.0011510403,0.00042308666],"domain_scores_gemma":[0.9750606,0.01862181,0.0011509488,0.0016629932,0.0016648705,0.0018387865],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036088321,0.0020122766,0.0024157418,0.0064399047,0.003321697,0.005911862,0.0034846081,0.0024177467,0.016958404],"category_scores_gemma":[0.022643369,0.0012633187,0.0015786558,0.004233798,0.005080671,0.010731031,0.00548534,0.008184236,0.0029178925],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000049031307,0.00005564958,0.00027380063,0.00005920241,0.000018572244,0.000039847237,0.000218152,0.0028782433,0.00061857526,0.98708785,0.004324193,0.0043768077],"study_design_scores_gemma":[0.000008706191,0.0000062641575,0.00015483085,0.000017111466,0.0000108986715,0.00003283148,0.000036743713,0.012852109,0.00019277942,0.98565084,0.0010240118,0.000013006662],"about_ca_topic_score_codex":0.0009995527,"about_ca_topic_score_gemma":0.0011551859,"teacher_disagreement_score":0.016958404,"about_ca_system_score_codex":0.002809472,"about_ca_system_score_gemma":0.0009942988,"threshold_uncertainty_score":0.056731522},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5820203,0.0020813677,0.3950987,0.0037226065,0.00018214976,0.00007996354,0.0006670791,0.000769598,0.015378271],"genre_scores_gemma":[0.97226846,0.0012621295,0.018479388,0.00041358362,0.0010157224,0.00021086406,0.00064954424,0.00033746072,0.0053626793],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99462444,0.0024155867,0.00026430038,0.0010444087,0.0010474587,0.0006037988],"domain_scores_gemma":[0.9001447,0.07554567,0.007662116,0.0061104344,0.0052379384,0.00529905],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.011485763,0.0014116572,0.0036226476,0.007578539,0.0026354967,0.0076267626,0.004510283,0.002936652,0.004329923],"category_scores_gemma":[0.095290035,0.0019949651,0.0019581106,0.0038117426,0.011324485,0.015652154,0.0049379948,0.0059675453,0.0005342868],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000108535714,0.000065979955,0.0021174443,0.00008205052,0.000034616533,0.0001299503,0.00037249073,0.0107404785,0.00075760536,0.98130393,0.0011045807,0.0031822498],"study_design_scores_gemma":[0.000014965657,0.000021348344,0.00097010116,0.000022711283,0.00001755896,0.00014773673,0.00009633503,0.07610264,0.00037194323,0.92189556,0.00030348898,0.000035608256],"about_ca_topic_score_codex":0.002251917,"about_ca_topic_score_gemma":0.0012421914,"teacher_disagreement_score":0.011485763,"about_ca_system_score_codex":0.0037425093,"about_ca_system_score_gemma":0.0019840845,"threshold_uncertainty_score":0.060743272},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8629354,0.00076947134,0.073849864,0.0014035404,0.00019474217,0.000047711335,0.0005310084,0.00024027987,0.060027972],"genre_scores_gemma":[0.9687773,0.00028609086,0.018534208,0.00016603476,0.00024207456,0.000057553374,0.00030667026,0.00006875295,0.011561299],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99914086,0.00024515614,0.00005822558,0.00016113145,0.00026527426,0.00012934108],"domain_scores_gemma":[0.99838495,0.0005293968,0.00028210558,0.00012217181,0.00017912936,0.00050230074],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010472698,0.00052593084,0.00086396706,0.0021268274,0.0017797684,0.0050689196,0.0012307229,0.0009045325,0.00416223],"category_scores_gemma":[0.0024951524,0.0006297373,0.0005442586,0.0013192382,0.0034133287,0.005239597,0.0014807922,0.0017370031,0.0004014016],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007647066,0.000031986492,0.00040172736,0.000025174793,0.00000665,0.000091393435,0.00023038776,0.0014420701,0.0012735677,0.9932168,0.0004583685,0.0027452805],"study_design_scores_gemma":[0.000024818502,0.000022611583,0.0003330584,0.000011740416,0.000007771176,0.00017190154,0.00015351421,0.009273207,0.0006261373,0.9873284,0.002029402,0.000017369239],"about_ca_topic_score_codex":0.0011469043,"about_ca_topic_score_gemma":0.00094981055,"teacher_disagreement_score":0.0050689196,"about_ca_system_score_codex":0.0014592641,"about_ca_system_score_gemma":0.0005920076,"threshold_uncertainty_score":0.013924003},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8982736,0.00046843066,0.061974846,0.0011045075,0.000195144,0.000034258424,0.00020349633,0.00027949808,0.037466276],"genre_scores_gemma":[0.9696415,0.00033842566,0.015279729,0.00025859615,0.00018671012,0.000048951842,0.00032290845,0.00021861374,0.013704651],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99896145,0.00030234823,0.000058971265,0.0001927483,0.00025732524,0.00022721416],"domain_scores_gemma":[0.9950446,0.0019544552,0.0005761064,0.0005617496,0.0005930707,0.0012699326],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012130978,0.0005291299,0.0011082444,0.0033445738,0.0027513811,0.0038699976,0.0017154972,0.0015522365,0.0057699136],"category_scores_gemma":[0.0059313867,0.0009881529,0.0011883598,0.0015665039,0.0042468226,0.0048427316,0.0026145568,0.0024591098,0.0005381746],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007155878,0.000033283923,0.0009437656,0.000028304245,0.0000062185786,0.00010636959,0.0005789176,0.0017296637,0.0008615715,0.99185586,0.00093444384,0.0028500464],"study_design_scores_gemma":[0.000014990318,0.000009852329,0.00044813153,0.000012240063,0.0000061419896,0.00010864596,0.000264815,0.0078716315,0.0003623095,0.98988414,0.0010068541,0.000010251104],"about_ca_topic_score_codex":0.002360652,"about_ca_topic_score_gemma":0.0030875364,"teacher_disagreement_score":0.0057699136,"about_ca_system_score_codex":0.0018026703,"about_ca_system_score_gemma":0.0007768665,"threshold_uncertainty_score":0.019302249},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8178463,0.000706886,0.065954916,0.0011526678,0.00023240858,0.000037796468,0.00039893034,0.00031121037,0.11335889],"genre_scores_gemma":[0.96110135,0.00034440882,0.020115877,0.00024522597,0.00007964511,0.00003550991,0.00029874995,0.00013353956,0.01764577],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99974376,0.00006916982,0.000015342825,0.000050412225,0.00005794587,0.00006340663],"domain_scores_gemma":[0.99827397,0.00075195014,0.00014869214,0.00021899644,0.00025716604,0.00034923435],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037940135,0.00025870078,0.00045196374,0.00143465,0.0014930776,0.0025684102,0.00086133514,0.00082388957,0.0044065323],"category_scores_gemma":[0.0022277697,0.00048251252,0.00043085866,0.0009388886,0.0014130527,0.0016897154,0.0008917293,0.0010978314,0.00059591094],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006595038,0.000032579253,0.00066631055,0.000032637156,0.0000063410275,0.00020940584,0.00025796544,0.0020823649,0.0031136118,0.9868276,0.0019203529,0.0047849366],"study_design_scores_gemma":[0.000022584136,0.000012160058,0.0004947129,0.000021175445,0.000009239016,0.00023486148,0.00016805598,0.016769642,0.0010351023,0.9776014,0.0036180478,0.0000131363],"about_ca_topic_score_codex":0.0019203941,"about_ca_topic_score_gemma":0.0027846207,"teacher_disagreement_score":0.0044065323,"about_ca_system_score_codex":0.0011523531,"about_ca_system_score_gemma":0.00043990856,"threshold_uncertainty_score":0.014741361},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6347346,0.0032807563,0.19332457,0.0051339976,0.00034532184,0.00007548492,0.0003671024,0.0006017757,0.16213648],"genre_scores_gemma":[0.96552414,0.0010571016,0.020650305,0.0004046878,0.0002362381,0.000068822745,0.00019862893,0.000059576974,0.011800516],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99894315,0.00030364562,0.00006834414,0.00022371771,0.0003017286,0.00015934605],"domain_scores_gemma":[0.9961302,0.0021673637,0.00036098828,0.00052982476,0.00041848308,0.00039308608],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018863021,0.0003431781,0.0005268232,0.0011879022,0.0018800793,0.001850639,0.0014170604,0.00079107267,0.0057113827],"category_scores_gemma":[0.004817798,0.0003855742,0.00061643467,0.000982495,0.002753339,0.008075789,0.0030057416,0.0021479046,0.0005425835],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000038231003,0.000033191765,0.00037883507,0.000055164586,0.000006544478,0.000091879134,0.00026107245,0.0012635009,0.0008437152,0.99187815,0.0010323449,0.0041172914],"study_design_scores_gemma":[0.0000120891,0.000024412922,0.00025906393,0.000016491695,0.00000888846,0.00017195001,0.0001512446,0.0086159315,0.00096890045,0.98574567,0.004013818,0.000011507723],"about_ca_topic_score_codex":0.00073493837,"about_ca_topic_score_gemma":0.0009041525,"teacher_disagreement_score":0.0057113827,"about_ca_system_score_codex":0.0011169066,"about_ca_system_score_gemma":0.0006197557,"threshold_uncertainty_score":0.019106448},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.865222,0.0005958802,0.12206734,0.0017773358,0.000057149828,0.000058853515,0.0007798386,0.00012139406,0.009320298],"genre_scores_gemma":[0.9860891,0.00020509642,0.01225105,0.00009892481,0.00007232326,0.000094910865,0.00033196088,0.000027246462,0.0008294501],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99822897,0.00066234,0.000120216035,0.00035904735,0.0004284827,0.00020093498],"domain_scores_gemma":[0.94372934,0.04662009,0.0035436316,0.0026996862,0.0016067657,0.001800431],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004260585,0.0003605971,0.0009270091,0.0020666912,0.0010976294,0.0023443487,0.0014960349,0.0009982835,0.0027995794],"category_scores_gemma":[0.03915912,0.0006459191,0.00056452054,0.0009948664,0.002765011,0.0037012347,0.0021430128,0.0012405715,0.0001818861],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001745373,0.00019967533,0.07646369,0.00047355125,0.0002448218,0.0006876774,0.0009579057,0.13549747,0.019505555,0.7258212,0.006044227,0.032358885],"study_design_scores_gemma":[0.00013139995,0.0002522719,0.024964325,0.00022394728,0.000076561635,0.0011595087,0.0007209114,0.55516136,0.017482193,0.39480603,0.004880062,0.00014145653],"about_ca_topic_score_codex":0.0005647326,"about_ca_topic_score_gemma":0.00045222102,"teacher_disagreement_score":0.004260585,"about_ca_system_score_codex":0.0013651861,"about_ca_system_score_gemma":0.00050157856,"threshold_uncertainty_score":0.022532403},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4369922,0.010008735,0.36655134,0.005177546,0.0020261132,0.000086885375,0.0006501728,0.00047790422,0.17802903],"genre_scores_gemma":[0.912312,0.0035884348,0.043082856,0.0008215694,0.0010919905,0.00016429584,0.00027482386,0.00022299167,0.03844103],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99893993,0.0002808685,0.00009752681,0.00018699387,0.00032901898,0.0001657121],"domain_scores_gemma":[0.995014,0.0029155067,0.0005239208,0.00052487745,0.0005836365,0.00043809303],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020517793,0.00094306597,0.00095193274,0.0051899613,0.0020417483,0.005250494,0.0012112026,0.001087593,0.006578531],"category_scores_gemma":[0.008103345,0.0006891776,0.0006766746,0.0032548741,0.00422688,0.009926516,0.002230907,0.003520217,0.0009505035],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000057559287,0.000005483861,0.00005223147,0.000009431987,0.0000016624695,0.00001838959,0.000114223585,0.00010090979,0.000121397694,0.99751484,0.0003390911,0.0017165636],"study_design_scores_gemma":[0.000004448221,0.0000052793307,0.000097748096,0.000016997223,0.0000051206957,0.0000765181,0.000068534355,0.0011295333,0.00013920486,0.9959735,0.0024717539,0.000011478761],"about_ca_topic_score_codex":0.00075446744,"about_ca_topic_score_gemma":0.00085377187,"teacher_disagreement_score":0.006578531,"about_ca_system_score_codex":0.0016344531,"about_ca_system_score_gemma":0.0007356696,"threshold_uncertainty_score":0.022007406},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.057889283,0.0064958376,0.7300163,0.010812771,0.0038228524,0.00016186203,0.0011415596,0.0011122901,0.18854724],"genre_scores_gemma":[0.638605,0.010175528,0.28089446,0.0058284714,0.004974871,0.0005432424,0.0012896232,0.0010441773,0.056644667],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983954,0.00036119067,0.0001409934,0.0003936626,0.0005378585,0.00017092399],"domain_scores_gemma":[0.9945281,0.0028710885,0.00041034824,0.00082331366,0.00093516754,0.00043197811],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026431445,0.0017645326,0.0020412276,0.0050229128,0.0024507293,0.0034092146,0.0023070022,0.002178104,0.01424417],"category_scores_gemma":[0.008704247,0.000990381,0.0027373638,0.0033736532,0.004417854,0.01133045,0.0070501566,0.0076191984,0.0025995292],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003927751,0.00004939653,0.00037904872,0.0002093761,0.000035842448,0.00021956682,0.00030356218,0.0010730495,0.0015733624,0.97300446,0.0059712804,0.01714177],"study_design_scores_gemma":[0.000025064332,0.000026563192,0.00039865598,0.00006276942,0.000057631056,0.00043191132,0.000098161436,0.0052859117,0.0008508506,0.9654656,0.027251352,0.00004544411],"about_ca_topic_score_codex":0.0008951805,"about_ca_topic_score_gemma":0.0009259785,"teacher_disagreement_score":0.01424417,"about_ca_system_score_codex":0.0019054617,"about_ca_system_score_gemma":0.0009498292,"threshold_uncertainty_score":0.04765147},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.83181477,0.00027405715,0.16033795,0.00013246751,0.000013658562,0.00004958936,0.00023581625,0.00014446495,0.006997184],"genre_scores_gemma":[0.96545994,0.00016364129,0.03239588,0.000048355625,0.000014687587,0.000089508176,0.00034743873,0.00005561061,0.0014248954],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984621,0.00038322218,0.000116796495,0.0004307565,0.00034452305,0.00026262627],"domain_scores_gemma":[0.9933994,0.0036176974,0.0013992864,0.0005833049,0.00050573493,0.000494582],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013467586,0.00046154033,0.0006160711,0.0010500527,0.0011488172,0.0015046578,0.0009340651,0.000538397,0.0018960364],"category_scores_gemma":[0.0057295295,0.0006410003,0.00076568144,0.00079539145,0.0026408918,0.004099349,0.0020669706,0.0009081015,0.00013239373],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00076010515,0.00017349859,0.010629451,0.000283022,0.00008529624,0.0009438449,0.0024295116,0.037537392,0.022043835,0.8813866,0.0008038354,0.04292373],"study_design_scores_gemma":[0.00009681431,0.00029370788,0.0044607674,0.00010917938,0.000112764086,0.0014728664,0.0012774853,0.11855773,0.020931445,0.84410435,0.008507976,0.00007491962],"about_ca_topic_score_codex":0.0010191761,"about_ca_topic_score_gemma":0.00077919936,"teacher_disagreement_score":0.0018960364,"about_ca_system_score_codex":0.0009471257,"about_ca_system_score_gemma":0.0006070362,"threshold_uncertainty_score":0.0071223974},"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":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008419771,0.47499767,0.16930221,0.012868196,0.005882456,0.00015659866,0.00090726186,0.00073213404,0.32673374],"genre_scores_gemma":[0.15277931,0.5353368,0.1482419,0.008077933,0.022997651,0.00056577526,0.0022735908,0.0007679999,0.12895899],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99920434,0.00018424646,0.00006966242,0.00024565292,0.00022880672,0.00006734216],"domain_scores_gemma":[0.9990025,0.0005987518,0.00006495241,0.000099223624,0.00016259479,0.00007211454],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016096291,0.0010971298,0.0011880152,0.0043510804,0.0014644852,0.0043844073,0.0013909704,0.0016656806,0.012232134],"category_scores_gemma":[0.0022900803,0.0010004301,0.0011951147,0.005872995,0.0034274354,0.009159945,0.0024042684,0.004578039,0.0034891344],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003674803,0.000037763988,0.00014283982,0.0010502425,0.000014362355,0.000057297584,0.0001791994,0.001976236,0.0009247564,0.8871379,0.020811306,0.087631345],"study_design_scores_gemma":[0.0000081661365,0.000035791774,0.00041531184,0.00034348373,0.000015382271,0.00035016765,0.000055339355,0.0014870564,0.00048209395,0.6615856,0.33518365,0.000037932612],"about_ca_topic_score_codex":0.0014657784,"about_ca_topic_score_gemma":0.0014468699,"teacher_disagreement_score":0.012232134,"about_ca_system_score_codex":0.002901968,"about_ca_system_score_gemma":0.0011764842,"threshold_uncertainty_score":0.040920556},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15815997,0.021447914,0.4793305,0.019680502,0.0022251864,0.00027350144,0.0022312396,0.0015015397,0.3151497],"genre_scores_gemma":[0.76997054,0.017916389,0.13581844,0.005734641,0.008688059,0.0012460573,0.0026775233,0.0017184769,0.05622983],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.994601,0.0012961635,0.0003093819,0.0010322834,0.0018705006,0.00089070667],"domain_scores_gemma":[0.9557791,0.035368055,0.0014340909,0.0021541717,0.0021860362,0.0030785657],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0096195955,0.003273104,0.004046259,0.013693432,0.005410263,0.009967399,0.0069536013,0.0045122104,0.023510888],"category_scores_gemma":[0.040683478,0.0024546469,0.003919853,0.011357533,0.007494284,0.03566505,0.010780834,0.015896795,0.002621583],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012263792,0.0001316716,0.0007945025,0.0002533524,0.00005088044,0.000146319,0.0008471211,0.0033633832,0.0007502225,0.96737546,0.008318814,0.017845597],"study_design_scores_gemma":[0.000018079954,0.000028626797,0.0005381005,0.00010174781,0.00007451046,0.00015328864,0.00015480784,0.013362502,0.00039113362,0.978115,0.0070191333,0.00004291776],"about_ca_topic_score_codex":0.001836769,"about_ca_topic_score_gemma":0.0023897942,"teacher_disagreement_score":0.023510888,"about_ca_system_score_codex":0.006625045,"about_ca_system_score_gemma":0.0011451315,"threshold_uncertainty_score":0.078651786},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.84938955,0.0005879106,0.07974759,0.001541084,0.0001089089,0.000057275964,0.00036595366,0.00029355078,0.06790804],"genre_scores_gemma":[0.9729637,0.00042143025,0.01185735,0.00031150455,0.000107020474,0.000084361156,0.00034545694,0.0001116664,0.013797472],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993338,0.00016834549,0.000030938667,0.000113404036,0.00021892015,0.00013451686],"domain_scores_gemma":[0.99494416,0.0033651332,0.00040289044,0.00030007222,0.00034718015,0.00064059923],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006356618,0.0005706049,0.0010767098,0.0023024247,0.0020700386,0.0035792666,0.0018667262,0.0014381215,0.009802899],"category_scores_gemma":[0.0065672137,0.0010659142,0.0006441142,0.0016716293,0.0035718933,0.005025378,0.0033089535,0.0027431364,0.0009451534],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000105141065,0.00004835361,0.00077649654,0.00006273364,0.0000123703385,0.0002288259,0.00081701024,0.0025286963,0.0011299181,0.9864101,0.0017046349,0.006175739],"study_design_scores_gemma":[0.000019578738,0.00001007854,0.00020570979,0.000013179174,0.000006225567,0.00013485785,0.00024324005,0.00633881,0.00040243097,0.99193513,0.00068426377,0.00000650132],"about_ca_topic_score_codex":0.0016008227,"about_ca_topic_score_gemma":0.0023387456,"teacher_disagreement_score":0.009802899,"about_ca_system_score_codex":0.000786397,"about_ca_system_score_gemma":0.0004103692,"threshold_uncertainty_score":0.032794},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33680585,0.0050394554,0.15740977,0.18528375,0.005044502,0.00010933904,0.0013850147,0.0010871405,0.30783513],"genre_scores_gemma":[0.94597656,0.0016446649,0.015092005,0.007045118,0.0039209165,0.00015263696,0.0007391445,0.00028354416,0.025145454],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997018,0.0010030093,0.00015478914,0.0007859084,0.0006014209,0.00043703633],"domain_scores_gemma":[0.9697269,0.022873769,0.00090938725,0.0032063425,0.0020097555,0.0012738128],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005026513,0.00074825046,0.002684235,0.0025075842,0.005752949,0.005655925,0.003159923,0.006671061,0.0152646685],"category_scores_gemma":[0.028548053,0.0010604459,0.0020090644,0.003804964,0.015715085,0.03096648,0.007925968,0.010044504,0.0016775979],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000053935964,0.000023737859,0.0001650365,0.000033379118,0.0000042860966,0.000046556277,0.00035047552,0.00030321904,0.0001059678,0.9921423,0.0050626034,0.0017083974],"study_design_scores_gemma":[0.000014654232,0.000005819896,0.000070117676,0.00001422895,0.000004973077,0.00003173396,0.00007173579,0.00060602307,0.000072240044,0.99693274,0.0021680696,0.000007547187],"about_ca_topic_score_codex":0.0018813726,"about_ca_topic_score_gemma":0.0010738366,"teacher_disagreement_score":0.0152646685,"about_ca_system_score_codex":0.0026361484,"about_ca_system_score_gemma":0.00121407,"threshold_uncertainty_score":0.051065385},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.75814015,0.00045654507,0.21881633,0.0016810705,0.0000507177,0.00010766497,0.000755387,0.00058887753,0.019403331],"genre_scores_gemma":[0.975916,0.00018934307,0.019502271,0.0002124868,0.00006914962,0.00008999874,0.00054788706,0.00006932909,0.0034034771],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981962,0.0006036121,0.00007444624,0.000400711,0.00051421626,0.00021079637],"domain_scores_gemma":[0.9893055,0.00644839,0.0013510336,0.0012870849,0.00079465174,0.0008133447],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001410742,0.0002945244,0.0007703391,0.0016715586,0.00077606295,0.0013321368,0.00087141054,0.00073214114,0.003320196],"category_scores_gemma":[0.011052255,0.00043995766,0.0005645622,0.0008617735,0.0016656202,0.002180768,0.001305795,0.0010114749,0.00042999786],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00038370024,0.00011159628,0.006557917,0.00017121165,0.000077223565,0.0005736253,0.00044772727,0.036600627,0.009073575,0.92430687,0.005765964,0.015929898],"study_design_scores_gemma":[0.0000857797,0.000068000496,0.001933269,0.000027808808,0.000037733585,0.0005317793,0.00011097404,0.18679361,0.003584588,0.80275774,0.0040459954,0.00002265273],"about_ca_topic_score_codex":0.0008764167,"about_ca_topic_score_gemma":0.0010158569,"teacher_disagreement_score":0.003320196,"about_ca_system_score_codex":0.0011219997,"about_ca_system_score_gemma":0.0004522417,"threshold_uncertainty_score":0.011107147},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.53968394,0.0043004868,0.22774546,0.011069141,0.0010177465,0.00011518427,0.0005968736,0.00046280466,0.21500836],"genre_scores_gemma":[0.95174164,0.0020166598,0.016959654,0.0010361101,0.001043205,0.0001598798,0.00032065815,0.00012714385,0.026594978],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993625,0.00016433826,0.000037980673,0.0001324924,0.0001797722,0.00012283203],"domain_scores_gemma":[0.9987968,0.0005079743,0.00014980663,0.00018117063,0.00018787148,0.00017638243],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015825311,0.0007029082,0.0014882847,0.002140842,0.0023347382,0.003058494,0.0014608178,0.0017767779,0.004654624],"category_scores_gemma":[0.0038680902,0.00041989097,0.0010917629,0.001244768,0.0050317976,0.008562924,0.0030885376,0.003385897,0.0007844906],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000704967,0.0000042197153,0.00003599258,0.000008645282,0.0000023643968,0.000012941409,0.00006772858,0.00021059568,0.00013074202,0.9982021,0.00032254204,0.0009951332],"study_design_scores_gemma":[0.0000051801476,0.0000018706244,0.000025770967,0.0000024102196,0.0000012533519,0.000011573987,0.000013124855,0.00072760374,0.000054438326,0.9985575,0.0005963821,0.0000028794109],"about_ca_topic_score_codex":0.0014408618,"about_ca_topic_score_gemma":0.0006894929,"teacher_disagreement_score":0.004654624,"about_ca_system_score_codex":0.0015608015,"about_ca_system_score_gemma":0.0009614899,"threshold_uncertainty_score":0.015571237},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5620792,0.0050938977,0.25684637,0.065595224,0.0010987289,0.00023160261,0.0054006157,0.0028037298,0.1008506],"genre_scores_gemma":[0.96234936,0.001516986,0.014780457,0.002908401,0.0016254224,0.00028954478,0.0017130567,0.0004903637,0.014326344],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9953269,0.0015080455,0.00020059459,0.0010536854,0.0010647906,0.00084601354],"domain_scores_gemma":[0.84225035,0.14051072,0.004097955,0.005508724,0.0028905743,0.004741703],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0053802845,0.0012694569,0.004210565,0.0028024083,0.004452738,0.009474931,0.005104289,0.0064920667,0.017594537],"category_scores_gemma":[0.06857091,0.0021705488,0.0020586906,0.0033717554,0.0062241615,0.025434706,0.0044210954,0.009469669,0.0018782171],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00090760837,0.00021616447,0.0035519279,0.0006827656,0.00019125066,0.00058133015,0.0006063621,0.026655845,0.0010893805,0.9316842,0.021928618,0.011904624],"study_design_scores_gemma":[0.000070052374,0.000023789591,0.0003239308,0.00002990863,0.000030961237,0.00026501663,0.000069928894,0.04170137,0.00024336854,0.9558705,0.0013495471,0.000021579639],"about_ca_topic_score_codex":0.0014111203,"about_ca_topic_score_gemma":0.0016591098,"teacher_disagreement_score":0.017594537,"about_ca_system_score_codex":0.00396355,"about_ca_system_score_gemma":0.0020401815,"threshold_uncertainty_score":0.058859646},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8360149,0.0014101912,0.13955086,0.0014085823,0.000076615106,0.00010073478,0.0005133037,0.0007150455,0.020209702],"genre_scores_gemma":[0.98474705,0.0003952764,0.012224171,0.00015851359,0.00010658117,0.00013272061,0.00026688108,0.00012262152,0.0018460826],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982167,0.00041152228,0.00010495235,0.00047825277,0.00031784305,0.00047075417],"domain_scores_gemma":[0.9670415,0.021676857,0.004535865,0.0024407092,0.0012056672,0.003099454],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002481434,0.0006412165,0.0010595865,0.0021730422,0.0011037298,0.0032094684,0.001619366,0.0014826406,0.003960549],"category_scores_gemma":[0.03539036,0.00064169645,0.00046132787,0.0011856768,0.0027489641,0.0057188203,0.0019685407,0.0014608052,0.00046895572],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011030881,0.00028619677,0.012850902,0.00029106718,0.000086896434,0.000498013,0.0009803891,0.08207558,0.019985527,0.8330849,0.005322742,0.043434627],"study_design_scores_gemma":[0.00014314552,0.00023766806,0.0048772553,0.00010498289,0.000058393674,0.000672092,0.00042248637,0.26746684,0.009725451,0.7125591,0.0036402368,0.00009230384],"about_ca_topic_score_codex":0.0009924618,"about_ca_topic_score_gemma":0.0005462283,"teacher_disagreement_score":0.003960549,"about_ca_system_score_codex":0.0021925506,"about_ca_system_score_gemma":0.0005711831,"threshold_uncertainty_score":0.015908182},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26997492,0.004383735,0.46509388,0.014506193,0.00082146405,0.00012994933,0.0010711617,0.00076068996,0.24325807],"genre_scores_gemma":[0.88139063,0.0027911614,0.05854635,0.0023153932,0.0018317002,0.00028335792,0.000646267,0.000311071,0.051884085],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988686,0.00026656338,0.00006242383,0.0002481014,0.00040604136,0.00014832568],"domain_scores_gemma":[0.99360317,0.003801142,0.0003294837,0.00063446414,0.0009855722,0.000646065],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018683118,0.0007347384,0.0016894041,0.0040082005,0.0032771481,0.0039330493,0.0026551497,0.0018928626,0.01188773],"category_scores_gemma":[0.011023273,0.00112777,0.0014810405,0.0029456473,0.0054229223,0.011260253,0.004496356,0.0050318623,0.0012675517],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009191966,0.00001028987,0.00013977531,0.0000214562,0.000005063207,0.000019815374,0.0001011707,0.00029776755,0.00016367309,0.99516666,0.0017173343,0.0023477823],"study_design_scores_gemma":[0.0000067559113,0.0000038637463,0.00011074158,0.000007836038,0.0000048798465,0.00005999473,0.000035662335,0.0028759376,0.00013704502,0.994753,0.0019974543,0.000006759868],"about_ca_topic_score_codex":0.0020586632,"about_ca_topic_score_gemma":0.001551825,"teacher_disagreement_score":0.01188773,"about_ca_system_score_codex":0.00220503,"about_ca_system_score_gemma":0.00084836077,"threshold_uncertainty_score":0.039768398},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28924987,0.0038401026,0.58141583,0.0039048314,0.00044847222,0.00007064747,0.00039336638,0.00037571954,0.12030118],"genre_scores_gemma":[0.9056784,0.0024152144,0.050255384,0.00066645106,0.001081584,0.00013276511,0.00034553336,0.00027307155,0.039151594],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999345,0.00022744993,0.000029592458,0.000110533656,0.00017915001,0.00010825049],"domain_scores_gemma":[0.9975036,0.0013179188,0.00028029352,0.00019254428,0.00033699497,0.00036874172],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014653361,0.0010606974,0.0010652558,0.0037643872,0.0015633755,0.0027593998,0.0014290212,0.0010722562,0.009532732],"category_scores_gemma":[0.004540621,0.0006788869,0.0009726311,0.002470379,0.0034830025,0.006441971,0.002392663,0.0032131977,0.0009678952],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007876492,0.00001404829,0.00007609848,0.000024666218,0.0000037327995,0.000022811195,0.00013642918,0.0005735995,0.00034871488,0.9962991,0.0006276293,0.001865311],"study_design_scores_gemma":[0.00000403128,0.0000035991156,0.00008520009,0.000009027559,0.000004364222,0.000028752904,0.00007430093,0.0058274716,0.00015681727,0.99317616,0.0006236571,0.000006696311],"about_ca_topic_score_codex":0.0011715913,"about_ca_topic_score_gemma":0.0013310404,"teacher_disagreement_score":0.009532732,"about_ca_system_score_codex":0.001323577,"about_ca_system_score_gemma":0.00050622056,"threshold_uncertainty_score":0.031890154},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.826439,0.0021411665,0.062013354,0.0046933987,0.0006334684,0.00006670086,0.000649228,0.00032809368,0.103035666],"genre_scores_gemma":[0.97325224,0.0009641152,0.013752339,0.00039631597,0.00037967533,0.000099293524,0.00044927912,0.00014365255,0.01056316],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982665,0.0004997781,0.00011260499,0.00033815939,0.00050540897,0.0002776447],"domain_scores_gemma":[0.976942,0.016046235,0.0022186672,0.0010638938,0.0011116109,0.0026175918],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023687605,0.0007013849,0.0015618994,0.004023594,0.002903282,0.0057141236,0.0041941544,0.0024148019,0.012614319],"category_scores_gemma":[0.017328637,0.0011474179,0.0008980985,0.0028257915,0.005938004,0.009762311,0.0029153798,0.0031386514,0.0008151376],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00038197896,0.00009935806,0.0027385051,0.00018692068,0.00003353036,0.00018083278,0.00057722576,0.0086889025,0.0021413893,0.96896464,0.0033480898,0.012658673],"study_design_scores_gemma":[0.00003472792,0.000032565516,0.00079587405,0.00005959414,0.00002170494,0.00027656174,0.00029463353,0.018607775,0.00074674946,0.9775039,0.0016008724,0.000025213685],"about_ca_topic_score_codex":0.0012894474,"about_ca_topic_score_gemma":0.0016970162,"teacher_disagreement_score":0.012614319,"about_ca_system_score_codex":0.0017974227,"about_ca_system_score_gemma":0.0007655643,"threshold_uncertainty_score":0.042199075},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6881656,0.0033112448,0.18307444,0.0035748368,0.00045991532,0.000051258863,0.00049113313,0.00034544378,0.120526046],"genre_scores_gemma":[0.930565,0.0019895944,0.027119355,0.0004075783,0.00081056205,0.000094609924,0.00034816135,0.00021314698,0.03845189],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99914634,0.00024759662,0.000056269062,0.00015553406,0.00030055924,0.00009377305],"domain_scores_gemma":[0.9968976,0.0016876331,0.00046068337,0.00023413074,0.00034956582,0.00037036333],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000924608,0.0007055515,0.001014395,0.0038348439,0.001993587,0.003741931,0.0010315203,0.0010852152,0.0066693164],"category_scores_gemma":[0.004266976,0.0007816036,0.00073860027,0.002560704,0.0033732431,0.008154798,0.0029324815,0.0023170554,0.0007530097],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016633165,0.000010833601,0.0001341396,0.000023986939,0.000004839664,0.00003710814,0.00019781358,0.00044747395,0.00030249218,0.9950147,0.00044920028,0.0033606943],"study_design_scores_gemma":[0.0000028592285,0.000004920621,0.00006990583,0.0000050614353,0.000004306282,0.00007389873,0.00004967301,0.0012175159,0.00012221733,0.99755657,0.00088908395,0.000004081424],"about_ca_topic_score_codex":0.0005414003,"about_ca_topic_score_gemma":0.0007314538,"teacher_disagreement_score":0.0066693164,"about_ca_system_score_codex":0.00080380245,"about_ca_system_score_gemma":0.00042515201,"threshold_uncertainty_score":0.022311091},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9474542,0.0005345524,0.020119425,0.00082291744,0.000101188714,0.000023299986,0.000330023,0.00019501586,0.030419309],"genre_scores_gemma":[0.9959735,0.00019017053,0.0013752632,0.000058132624,0.000067673405,0.000023913984,0.00011981043,0.000041700045,0.0021498853],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977673,0.0004642932,0.00013873038,0.00059445144,0.00051161903,0.0005236533],"domain_scores_gemma":[0.98551244,0.0068677263,0.002031961,0.0021293075,0.0020908776,0.0013677388],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027324152,0.00026881503,0.0007323163,0.0043128156,0.0027101636,0.0039841617,0.0012092268,0.0007876694,0.004885459],"category_scores_gemma":[0.018853705,0.0005337208,0.00028561268,0.0017617255,0.0070732064,0.00441262,0.0024942695,0.0017452743,0.0007695517],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004539109,0.000054896176,0.01733449,0.00009102223,0.000032689313,0.0005138935,0.002015187,0.0039563226,0.007945062,0.93905246,0.0025682328,0.02598193],"study_design_scores_gemma":[0.00004537157,0.00019132227,0.013713976,0.00008662211,0.000037574628,0.0015510315,0.001841337,0.012546354,0.009796541,0.9436844,0.016408278,0.00009720544],"about_ca_topic_score_codex":0.00047038277,"about_ca_topic_score_gemma":0.0004294313,"teacher_disagreement_score":0.004885459,"about_ca_system_score_codex":0.0019656536,"about_ca_system_score_gemma":0.00062618253,"threshold_uncertainty_score":0.016343534},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6687508,0.006584154,0.18009031,0.008512049,0.00046605963,0.000103835875,0.0006899511,0.0006440713,0.13415875],"genre_scores_gemma":[0.9577808,0.0023990048,0.025789153,0.0006557163,0.00047673902,0.00024179895,0.00027992838,0.00012400276,0.012252953],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992293,0.0002468163,0.00004559177,0.00017750102,0.00017971774,0.00012101886],"domain_scores_gemma":[0.9891394,0.008273629,0.000878954,0.0004688367,0.0004147142,0.00082452595],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023402749,0.0005305454,0.0011367957,0.0038547409,0.0025470583,0.0048135957,0.0014794834,0.0015299218,0.0065091243],"category_scores_gemma":[0.0131321,0.00084303226,0.000612936,0.002503698,0.004027597,0.012200624,0.002309205,0.0035635177,0.00064647925],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000039377817,0.000016649592,0.00025875794,0.00005059839,0.0000043284317,0.000024067596,0.00029684065,0.0009505855,0.00038507165,0.993543,0.0011850052,0.0032456913],"study_design_scores_gemma":[0.000009003977,0.000006518793,0.00019524738,0.000016578293,0.000007870758,0.000063115614,0.00007651132,0.003343272,0.00019723018,0.99454606,0.0015289553,0.000009759093],"about_ca_topic_score_codex":0.00072111626,"about_ca_topic_score_gemma":0.0012991262,"teacher_disagreement_score":0.0065091243,"about_ca_system_score_codex":0.0021315191,"about_ca_system_score_gemma":0.0007668673,"threshold_uncertainty_score":0.021775186},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6952358,0.005481063,0.09964805,0.00490083,0.00078392075,0.000052347677,0.00032259608,0.00031415647,0.19326131],"genre_scores_gemma":[0.97160226,0.0011044877,0.012103206,0.00029504352,0.00038457816,0.000041776686,0.0001389448,0.00004665952,0.014283083],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989322,0.00036069934,0.000060585397,0.00023624083,0.00024270172,0.00016758007],"domain_scores_gemma":[0.9969234,0.001527106,0.0003808078,0.00030381238,0.00034264452,0.0005222911],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019963803,0.0006202071,0.0009400912,0.003707961,0.00203908,0.0042743916,0.0013389998,0.0012408758,0.0049469788],"category_scores_gemma":[0.0049723936,0.00060976186,0.0005897105,0.0026013015,0.0072006127,0.008716781,0.0026369598,0.0024743632,0.00060672156],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010411093,0.0000045070947,0.00009105367,0.000008520722,0.0000015153621,0.000016030566,0.0001004486,0.00024522416,0.00007373737,0.9980855,0.00026348332,0.0010994914],"study_design_scores_gemma":[0.0000040666,0.0000040200202,0.00006830623,0.0000049347077,0.00000184497,0.000030847106,0.000035956255,0.0005346809,0.00008345662,0.9981976,0.0010296224,0.0000047089557],"about_ca_topic_score_codex":0.0012726609,"about_ca_topic_score_gemma":0.0008811384,"teacher_disagreement_score":0.0049469788,"about_ca_system_score_codex":0.0018335669,"about_ca_system_score_gemma":0.00083256804,"threshold_uncertainty_score":0.01654929},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.086898535,0.005076143,0.8293839,0.015368223,0.0008140916,0.00024523446,0.0009437578,0.0013138924,0.059956215],"genre_scores_gemma":[0.8682293,0.006311251,0.090045564,0.006665098,0.0027662786,0.00078621117,0.0007683216,0.000610116,0.023817891],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99637574,0.0011311366,0.00011350104,0.0008860363,0.0010550831,0.0004384228],"domain_scores_gemma":[0.961129,0.02750546,0.0019128087,0.005478426,0.002426238,0.0015479898],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007249996,0.00134137,0.002932967,0.004036695,0.002712015,0.0027689557,0.0034802477,0.0027675114,0.009062541],"category_scores_gemma":[0.049996834,0.00097159785,0.0029061409,0.003216894,0.00746355,0.011841315,0.005185906,0.006028851,0.001535961],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009125544,0.000033873042,0.00092922716,0.0001729443,0.00005047502,0.0001419847,0.00022021556,0.009223512,0.0006904725,0.9692975,0.0077867787,0.011361712],"study_design_scores_gemma":[0.00006861193,0.00006680933,0.0007851861,0.000044628163,0.000044537726,0.00033209193,0.0000549849,0.088474676,0.0007549264,0.89922553,0.010103906,0.0000441552],"about_ca_topic_score_codex":0.0035399091,"about_ca_topic_score_gemma":0.0020304401,"teacher_disagreement_score":0.009062541,"about_ca_system_score_codex":0.003183066,"about_ca_system_score_gemma":0.0015726449,"threshold_uncertainty_score":0.03834212},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5297794,0.0044308957,0.19914408,0.022366175,0.00049394777,0.0001775526,0.0019388077,0.0012452034,0.24042395],"genre_scores_gemma":[0.9704746,0.0006800959,0.017485399,0.00047404418,0.000270693,0.00015226583,0.00026487446,0.00016702474,0.010030971],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99298394,0.0033561834,0.0004443768,0.0013742096,0.0011512394,0.0006900125],"domain_scores_gemma":[0.9146667,0.06278479,0.0039999997,0.013326069,0.0018557413,0.0033667125],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010418943,0.0005664479,0.002648909,0.0027437522,0.0053228987,0.010799039,0.004528337,0.0064652134,0.02683864],"category_scores_gemma":[0.073862664,0.0021607114,0.0019860296,0.0028741537,0.007363716,0.022558112,0.004438828,0.006285284,0.002242774],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014090358,0.000040530296,0.0011958292,0.00007178616,0.000034207882,0.000103310085,0.00021860027,0.0030601507,0.0001937343,0.98399884,0.002388227,0.008553797],"study_design_scores_gemma":[0.000028882721,0.0000083514415,0.00015683995,0.000022454431,0.000019302068,0.0003010306,0.00010437227,0.006244806,0.00016927144,0.9910706,0.0018541944,0.000019788014],"about_ca_topic_score_codex":0.00026786563,"about_ca_topic_score_gemma":0.00038782976,"teacher_disagreement_score":0.02683864,"about_ca_system_score_codex":0.0015242535,"about_ca_system_score_gemma":0.0011049081,"threshold_uncertainty_score":0.089784145},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7851304,0.0011699952,0.15164614,0.0043507046,0.00008936964,0.00012943077,0.0014708458,0.0013418691,0.054671172],"genre_scores_gemma":[0.984362,0.00032059217,0.0100101875,0.00044408604,0.00013836181,0.000095721676,0.0006198392,0.00011857375,0.0038905598],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988801,0.00014724104,0.00005666911,0.0004881485,0.000192608,0.00023515007],"domain_scores_gemma":[0.98909175,0.005883284,0.0016173277,0.001897354,0.00056009245,0.00095021364],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013521834,0.00063775596,0.0010502588,0.0016142213,0.0019838759,0.0032841035,0.0019136536,0.00081455446,0.006610509],"category_scores_gemma":[0.0063525536,0.0006585568,0.0010821914,0.001596438,0.003942258,0.005748611,0.0021846094,0.0015281425,0.0009942742],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00059726933,0.00028511806,0.017129704,0.00047473633,0.00017149514,0.00039398443,0.0014487143,0.013709284,0.01636781,0.89921033,0.012346084,0.037865557],"study_design_scores_gemma":[0.000101704165,0.00014173516,0.0074858125,0.00006821026,0.00010870145,0.00065567624,0.0006260914,0.027332926,0.01704468,0.9345566,0.011815512,0.000062460276],"about_ca_topic_score_codex":0.0014167946,"about_ca_topic_score_gemma":0.0012915793,"teacher_disagreement_score":0.006610509,"about_ca_system_score_codex":0.0024213295,"about_ca_system_score_gemma":0.00090405776,"threshold_uncertainty_score":0.022114396},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.734905,0.0019349216,0.09947485,0.0014072108,0.00030853137,0.00007424524,0.0004947901,0.0006613343,0.1607391],"genre_scores_gemma":[0.9486359,0.0008010807,0.022770938,0.0003491745,0.00021277925,0.00017274827,0.0004969161,0.0001997123,0.02636079],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988972,0.0002602276,0.00006879738,0.00019152128,0.0003643979,0.00021780745],"domain_scores_gemma":[0.99707353,0.0015953995,0.00028591364,0.00025410898,0.00033289546,0.00045814092],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012215652,0.00096508575,0.0010925198,0.0037467675,0.0036102694,0.004422189,0.0018355611,0.0016073204,0.010818194],"category_scores_gemma":[0.0042929095,0.0009921257,0.0012807462,0.0027847956,0.0031498636,0.005914023,0.0038594073,0.003020085,0.0012340007],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007537343,0.000029682782,0.00029793943,0.00003843755,0.0000142216095,0.00027973208,0.00042351143,0.00052058004,0.0011220364,0.991459,0.0007776593,0.0049617593],"study_design_scores_gemma":[0.000029601852,0.000019726722,0.00043616662,0.000030457573,0.000026281996,0.0005394374,0.00017470265,0.0023047011,0.0008834687,0.9916407,0.0038884727,0.000026300877],"about_ca_topic_score_codex":0.00061559625,"about_ca_topic_score_gemma":0.00078464276,"teacher_disagreement_score":0.010818194,"about_ca_system_score_codex":0.0016787077,"about_ca_system_score_gemma":0.00059353194,"threshold_uncertainty_score":0.03619045},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36913773,0.01683741,0.26881978,0.016863273,0.0011049919,0.00013003142,0.0012304606,0.00061204884,0.3252642],"genre_scores_gemma":[0.9153497,0.0067409887,0.03342009,0.0010951252,0.0015393364,0.00018792573,0.00079334877,0.00019422038,0.040679317],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99896514,0.0003540502,0.00005498535,0.00023900451,0.00024518365,0.00014162129],"domain_scores_gemma":[0.99656785,0.0020930732,0.00036219682,0.0002919387,0.0002856482,0.0003993403],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015845017,0.0012818951,0.0017247013,0.0046813046,0.0045804167,0.005532131,0.0015202934,0.001770143,0.008117918],"category_scores_gemma":[0.0051863883,0.0011286422,0.0014089913,0.005161765,0.009786376,0.0170488,0.0042135767,0.0055241594,0.0008569832],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012197238,0.00001032839,0.00009074256,0.000020578454,0.0000024792391,0.00002734978,0.00030384993,0.00023972067,0.000079995836,0.99699247,0.0005397451,0.001680566],"study_design_scores_gemma":[0.0000033606757,0.0000029921553,0.000045369772,0.0000069216044,0.0000037483608,0.00002822971,0.00006768901,0.00032258668,0.00003436042,0.99814045,0.0013412161,0.0000031051482],"about_ca_topic_score_codex":0.0026811885,"about_ca_topic_score_gemma":0.0033303958,"teacher_disagreement_score":0.008117918,"about_ca_system_score_codex":0.0027198975,"about_ca_system_score_gemma":0.0009840323,"threshold_uncertainty_score":0.027157128},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.79132974,0.00026136488,0.1952634,0.00082867104,0.0000498311,0.000052087453,0.00012832278,0.0005226363,0.01156393],"genre_scores_gemma":[0.97680205,0.00017455274,0.018387944,0.00016485143,0.000025626718,0.000041968633,0.00010082857,0.00010671488,0.0041955076],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988763,0.000422757,0.000029356093,0.00020972642,0.00022622832,0.0002355298],"domain_scores_gemma":[0.9891043,0.007046641,0.001216841,0.0013764191,0.0006594766,0.0005964276],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015065452,0.00041442714,0.00051255804,0.00097297906,0.0008444585,0.0014887616,0.0014613521,0.0009883704,0.0029701386],"category_scores_gemma":[0.011646857,0.0003894078,0.0005535803,0.00056811544,0.002986294,0.0020489898,0.0017284432,0.0012017287,0.0004649905],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00058779615,0.00008874074,0.007376977,0.000154708,0.000085366446,0.0006465111,0.0006229372,0.2116222,0.025392445,0.73221844,0.00311928,0.018084526],"study_design_scores_gemma":[0.000046411522,0.00006560146,0.00117469,0.000017929808,0.000021973698,0.00024025077,0.000082438186,0.5297604,0.005461101,0.46119863,0.0018965214,0.000034035995],"about_ca_topic_score_codex":0.0030864682,"about_ca_topic_score_gemma":0.0032901666,"teacher_disagreement_score":0.0030864682,"about_ca_system_score_codex":0.0021622786,"about_ca_system_score_gemma":0.0007272932,"threshold_uncertainty_score":0.015688479},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09820142,0.005558313,0.23408565,0.2999373,0.0063875993,0.00016949503,0.0009914814,0.0008150502,0.35385367],"genre_scores_gemma":[0.84954464,0.0037233536,0.055523563,0.021639029,0.007351988,0.00024348365,0.000682621,0.00028578367,0.061005604],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99710196,0.0010983744,0.00015880076,0.00086004584,0.0004900433,0.00029071036],"domain_scores_gemma":[0.99122953,0.0058278344,0.0004750782,0.0010829339,0.000791737,0.00059292314],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035722689,0.0004831978,0.0011119304,0.0011859913,0.0032823465,0.0032429213,0.0017740299,0.004326945,0.01667542],"category_scores_gemma":[0.01698222,0.00060588366,0.00085318804,0.0025917261,0.0062403036,0.012498224,0.005595589,0.0050455816,0.0021332856],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009471943,0.00003202537,0.0003384935,0.000110724184,0.000018833569,0.00020816257,0.00026126922,0.00121629,0.0004167619,0.9360004,0.049578395,0.011723821],"study_design_scores_gemma":[0.000039213694,0.00001372447,0.00012405607,0.000029023186,0.000008001901,0.00020196158,0.0001605177,0.0015724315,0.00020902316,0.96282756,0.034801174,0.0000131939105],"about_ca_topic_score_codex":0.0014415269,"about_ca_topic_score_gemma":0.00106093,"teacher_disagreement_score":0.01667542,"about_ca_system_score_codex":0.0017336608,"about_ca_system_score_gemma":0.0009137005,"threshold_uncertainty_score":0.05578482},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41876936,0.01372396,0.22415686,0.0110581005,0.0008481138,0.0001238369,0.0014714955,0.0011394169,0.3287089],"genre_scores_gemma":[0.93850195,0.0054577524,0.028499717,0.0010136819,0.0011954606,0.0002628085,0.00091962167,0.00048067307,0.023668416],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984559,0.00037000282,0.000067924484,0.0003765212,0.00042637152,0.00030329236],"domain_scores_gemma":[0.9765512,0.01825231,0.0009330084,0.0015661544,0.001023261,0.001673968],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035803453,0.001877101,0.001271436,0.0063202465,0.0022940373,0.005641138,0.004310499,0.0018480214,0.012428185],"category_scores_gemma":[0.01895943,0.0011260846,0.001368742,0.0043072314,0.006841075,0.011037358,0.0047214157,0.006928034,0.0011810012],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017967267,0.000074799995,0.0017177275,0.00020368416,0.000039903065,0.000078301324,0.0004396294,0.011161447,0.0022284426,0.9625849,0.004776075,0.01651547],"study_design_scores_gemma":[0.000021737747,0.000028760729,0.0013546433,0.00007621173,0.000047507914,0.0000777423,0.00011235856,0.022636212,0.0012748239,0.9706665,0.0036662063,0.000037270762],"about_ca_topic_score_codex":0.002248382,"about_ca_topic_score_gemma":0.0033080915,"teacher_disagreement_score":0.012428185,"about_ca_system_score_codex":0.004881953,"about_ca_system_score_gemma":0.0010705935,"threshold_uncertainty_score":0.041576445},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11874904,0.010451981,0.7527871,0.043370426,0.002716576,0.00016712684,0.0016440717,0.0009350332,0.06917864],"genre_scores_gemma":[0.90343744,0.0033234775,0.059798144,0.013332871,0.004268777,0.00032612355,0.0011532339,0.00043937983,0.013920583],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99743253,0.00080794067,0.00013573788,0.00069011,0.0006687899,0.00026476514],"domain_scores_gemma":[0.98726153,0.008279122,0.001117181,0.0019607663,0.0008830485,0.0004983879],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029262977,0.00028727116,0.0007024291,0.0011714168,0.0007577358,0.0014959031,0.0012825271,0.0012506137,0.0036394605],"category_scores_gemma":[0.013978761,0.00034016234,0.00068300846,0.00080515514,0.004152362,0.005396711,0.0025798646,0.0024366435,0.00065206195],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007927196,0.000026127162,0.0019995905,0.00008828124,0.00004178813,0.000090231806,0.00015261167,0.0025609932,0.0012260155,0.95114034,0.012174403,0.030420464],"study_design_scores_gemma":[0.000020970865,0.00004045113,0.0015665285,0.000020013113,0.000014970286,0.00014617849,0.000037867514,0.009687023,0.0008528748,0.968164,0.019424975,0.000024099825],"about_ca_topic_score_codex":0.00041204676,"about_ca_topic_score_gemma":0.0003581984,"teacher_disagreement_score":0.0036394605,"about_ca_system_score_codex":0.0011282746,"about_ca_system_score_gemma":0.00049049535,"threshold_uncertainty_score":0.015475988},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8794162,0.0013154785,0.07335105,0.0013752119,0.0000781263,0.000062787745,0.0005584418,0.00059782784,0.043244768],"genre_scores_gemma":[0.98723316,0.0002481539,0.009491448,0.00009945499,0.000046456604,0.000049505128,0.00015202232,0.00002907399,0.002650803],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99920565,0.00023400996,0.000035397607,0.00018211563,0.00018497312,0.00015789016],"domain_scores_gemma":[0.99545115,0.00249054,0.0006449249,0.00039894666,0.0004369179,0.0005774421],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00090387004,0.00032840198,0.0004685518,0.0017199854,0.00079686625,0.0015453625,0.0006437273,0.00058454485,0.005523759],"category_scores_gemma":[0.0063479203,0.00037464828,0.000367728,0.0007286324,0.0016056938,0.0034820114,0.0013526041,0.00096494873,0.00046747082],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00037093452,0.000068883,0.0027167203,0.00024426664,0.00003196908,0.00019313207,0.0006537479,0.020891396,0.0097159045,0.9327403,0.004600336,0.027772514],"study_design_scores_gemma":[0.000039840474,0.00006497087,0.0013513543,0.000037884307,0.000020853615,0.0003826581,0.00020613465,0.07045459,0.0032986137,0.9198188,0.0042983587,0.000025847767],"about_ca_topic_score_codex":0.0008954586,"about_ca_topic_score_gemma":0.00092754624,"teacher_disagreement_score":0.005523759,"about_ca_system_score_codex":0.0012044166,"about_ca_system_score_gemma":0.00038346686,"threshold_uncertainty_score":0.01847887},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15142828,0.013480108,0.10991848,0.01420524,0.0016572253,0.00006535983,0.000660633,0.0003933081,0.7081914],"genre_scores_gemma":[0.8428547,0.0062588076,0.020680944,0.0015153371,0.0019510232,0.00016210495,0.00043045657,0.00020402226,0.12594262],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992828,0.00017253346,0.000032495587,0.00022924252,0.00019901233,0.0000838673],"domain_scores_gemma":[0.9983961,0.00080352614,0.00016625758,0.00023251088,0.00023057938,0.00017109927],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00087395,0.000783817,0.00092760724,0.0032181463,0.0029544425,0.0058453283,0.0012965025,0.0016249631,0.01597598],"category_scores_gemma":[0.003179224,0.0007259252,0.0006291925,0.0040770364,0.008837556,0.014607075,0.0027525576,0.00483741,0.0014741094],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000024486708,0.0000022648035,0.000023569566,0.0000065115864,8.046493e-7,0.0000038414073,0.00007748464,0.000051244468,0.00003958763,0.99818736,0.0005799302,0.0010249466],"study_design_scores_gemma":[0.0000019626927,0.0000018202351,0.000051564675,0.00000423995,0.0000022123177,0.000022722767,0.00004251553,0.00019218183,0.000047661066,0.99448144,0.0051489053,0.0000026991097],"about_ca_topic_score_codex":0.0019637109,"about_ca_topic_score_gemma":0.0018042626,"teacher_disagreement_score":0.01597598,"about_ca_system_score_codex":0.0028710465,"about_ca_system_score_gemma":0.00079022057,"threshold_uncertainty_score":0.05344498},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.82201946,0.0009586708,0.06910956,0.0011925634,0.00017592408,0.000058833524,0.0002618238,0.00019543941,0.10602784],"genre_scores_gemma":[0.9646591,0.0005095969,0.017003544,0.0001996958,0.00010851538,0.000114588416,0.00022532027,0.00008505611,0.017094595],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99911255,0.0002380075,0.000066354456,0.00018998193,0.00024254559,0.0001506086],"domain_scores_gemma":[0.9950517,0.0029186842,0.0006001552,0.0004278853,0.00044308792,0.00055854255],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011100083,0.0005305917,0.0009634257,0.0043599657,0.0037292922,0.004381099,0.0014613152,0.0014991944,0.0055864276],"category_scores_gemma":[0.0054347473,0.0009911663,0.00087279617,0.001726754,0.003401484,0.007890984,0.0032126734,0.0022493438,0.00059425476],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027665581,0.000023015153,0.00031119684,0.000018035364,0.0000048540046,0.00007233077,0.00026307916,0.00051386823,0.0004921462,0.9954384,0.000305633,0.0025297664],"study_design_scores_gemma":[0.000010275359,0.000008482554,0.0002453115,0.00001574159,0.000007938381,0.00014718922,0.00019338084,0.0023349249,0.0005181947,0.99522203,0.0012866488,0.0000099158815],"about_ca_topic_score_codex":0.00066476496,"about_ca_topic_score_gemma":0.0012864413,"teacher_disagreement_score":0.0055864276,"about_ca_system_score_codex":0.0012911299,"about_ca_system_score_gemma":0.00044743464,"threshold_uncertainty_score":0.01868844},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8176751,0.0023094395,0.0927131,0.00213129,0.000119016506,0.00006540333,0.00037434834,0.00038881972,0.08422349],"genre_scores_gemma":[0.9854063,0.00066403777,0.007937402,0.00022852393,0.00012558782,0.00006108747,0.00014847734,0.00006776583,0.0053608315],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986513,0.00042320747,0.00009877472,0.0002955031,0.00030523277,0.00022591975],"domain_scores_gemma":[0.9930269,0.0044353004,0.0007442553,0.0006495244,0.00048618,0.00065781723],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002183241,0.00063806813,0.0013595737,0.003054565,0.0030135352,0.004737457,0.0018420069,0.0014520835,0.004837199],"category_scores_gemma":[0.0062695486,0.0010090331,0.0012786381,0.002302439,0.0067368075,0.010331624,0.0028343054,0.0033518346,0.00037917538],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000414242,0.000015056428,0.00021036001,0.000039160255,0.0000076187885,0.000078671335,0.000785908,0.0005930184,0.0006642657,0.99559516,0.00025578978,0.0017134955],"study_design_scores_gemma":[0.000009420163,0.0000114602,0.00020019343,0.000014196525,0.000011137551,0.00011212253,0.00021630575,0.0016538075,0.00045914896,0.9964971,0.0008036607,0.0000114241675],"about_ca_topic_score_codex":0.0012242957,"about_ca_topic_score_gemma":0.0013529455,"teacher_disagreement_score":0.004837199,"about_ca_system_score_codex":0.0014880289,"about_ca_system_score_gemma":0.00048398375,"threshold_uncertainty_score":0.016182005},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7023846,0.0019510521,0.16514854,0.0021557494,0.0006161547,0.00008900268,0.00056596776,0.00042991317,0.12665899],"genre_scores_gemma":[0.9366693,0.0013706706,0.031583197,0.0006800257,0.0006232267,0.00022936043,0.0006962015,0.00031563328,0.027832463],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975746,0.0006573921,0.00018448282,0.0004991229,0.00068612554,0.00039828877],"domain_scores_gemma":[0.989356,0.0066811903,0.0011528081,0.0010957675,0.00078690785,0.00092744944],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021360747,0.0011093614,0.0017415961,0.005193003,0.004384255,0.0065822094,0.0025831638,0.0017291222,0.0067043747],"category_scores_gemma":[0.011654323,0.0013396523,0.0015686316,0.004395626,0.0060452237,0.014470833,0.0046592476,0.0030526419,0.0012383125],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005035914,0.000021215084,0.0001922561,0.00002408188,0.000006763698,0.00011548316,0.0003689881,0.0004008716,0.0005032537,0.99514765,0.00052233477,0.0026468101],"study_design_scores_gemma":[0.00000979439,0.00000865156,0.000101982245,0.000021746515,0.000009065608,0.00013661082,0.00012777212,0.0015825997,0.00029903385,0.9966072,0.0010860331,0.000009500765],"about_ca_topic_score_codex":0.0008083862,"about_ca_topic_score_gemma":0.0007413109,"teacher_disagreement_score":0.0067043747,"about_ca_system_score_codex":0.0019266694,"about_ca_system_score_gemma":0.00064954965,"threshold_uncertainty_score":0.022428334},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7058075,0.00092605443,0.24512626,0.0013972095,0.00018962962,0.00008475853,0.0005206911,0.00057333737,0.045374546],"genre_scores_gemma":[0.9513692,0.00052316743,0.03175754,0.0003151801,0.00013503872,0.00016665325,0.00047948488,0.00019412332,0.015059578],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99860865,0.00035595734,0.00007422826,0.00036919178,0.00037334795,0.00021862531],"domain_scores_gemma":[0.9945338,0.0031357813,0.0005386754,0.00055574754,0.0006386329,0.0005973157],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012798042,0.00067723036,0.0008696727,0.0033727973,0.003469373,0.0032469742,0.0014800675,0.0012216509,0.005722821],"category_scores_gemma":[0.0053247223,0.00094289077,0.0011218035,0.0023789485,0.0043126117,0.0076775593,0.0028142917,0.0022576454,0.00050546956],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026276686,0.000009626588,0.0002501286,0.000017067106,0.000005466776,0.0001316644,0.000424778,0.000604023,0.00050840434,0.99558276,0.00022785764,0.002212031],"study_design_scores_gemma":[0.000008641875,0.000009052843,0.00022265001,0.000010845658,0.000008121171,0.00012479177,0.00024169098,0.0024728784,0.00044547208,0.9951603,0.0012860538,0.000009527237],"about_ca_topic_score_codex":0.0021030286,"about_ca_topic_score_gemma":0.0024026714,"teacher_disagreement_score":0.005722821,"about_ca_system_score_codex":0.002329874,"about_ca_system_score_gemma":0.00077466574,"threshold_uncertainty_score":0.019144714},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12249595,0.004479212,0.76745963,0.00612622,0.0013580109,0.000049963644,0.0003431972,0.00078298774,0.09690478],"genre_scores_gemma":[0.8606874,0.0028894357,0.09038137,0.0018525396,0.0024398675,0.00021882378,0.00036008886,0.0011453868,0.040025093],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99778193,0.0007392167,0.00009189874,0.0004296027,0.0007187208,0.00023866245],"domain_scores_gemma":[0.9924906,0.0051950114,0.00041954793,0.00077596086,0.0004196487,0.0006991815],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002734646,0.0019661982,0.002321735,0.0038859416,0.0018296229,0.0040106587,0.0037899304,0.002789678,0.008072599],"category_scores_gemma":[0.014688616,0.0012348131,0.001687427,0.0018311483,0.006267455,0.014387035,0.0076181744,0.0071365186,0.0013196724],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003217279,0.000019638492,0.00016909215,0.000049926803,0.000014359444,0.00003234806,0.00007041216,0.0042461767,0.0005420224,0.98923934,0.0011042567,0.0044802628],"study_design_scores_gemma":[0.000003686092,0.0000073952274,0.000066226785,0.000013497353,0.000007620887,0.000033704102,0.000013664742,0.027256431,0.00027853367,0.971201,0.00110847,0.0000096840895],"about_ca_topic_score_codex":0.00068370235,"about_ca_topic_score_gemma":0.0008022785,"teacher_disagreement_score":0.008072599,"about_ca_system_score_codex":0.0013734199,"about_ca_system_score_gemma":0.00072149467,"threshold_uncertainty_score":0.027005494},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7331956,0.0026567536,0.19378385,0.0056749047,0.00057050615,0.000101243124,0.0013544379,0.00049539824,0.06216739],"genre_scores_gemma":[0.94120836,0.00074026315,0.03971013,0.00056824996,0.0004492583,0.00010236682,0.0009940234,0.0001307031,0.016096555],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979469,0.00068527623,0.00013753487,0.0005538264,0.00041018796,0.0002662953],"domain_scores_gemma":[0.9929335,0.004863929,0.0008285298,0.0004940833,0.00035542203,0.0005244859],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025504406,0.00073743,0.0012945968,0.0015376755,0.0018610088,0.0057081664,0.001254699,0.0013015592,0.009074384],"category_scores_gemma":[0.011850166,0.0006309105,0.001024263,0.0024090675,0.003221622,0.009390821,0.0023724323,0.0020905433,0.0010594361],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035584427,0.00003788363,0.0015598963,0.00018619877,0.00003839718,0.00023842977,0.00032826455,0.009684138,0.0010174309,0.9653089,0.005102555,0.016142132],"study_design_scores_gemma":[0.000066278255,0.00005983625,0.00040487715,0.000044471402,0.000029554587,0.00022684407,0.00012935742,0.025893185,0.00069385354,0.9658792,0.006544371,0.000028056324],"about_ca_topic_score_codex":0.000974768,"about_ca_topic_score_gemma":0.00075015705,"teacher_disagreement_score":0.009074384,"about_ca_system_score_codex":0.0019149209,"about_ca_system_score_gemma":0.00083802966,"threshold_uncertainty_score":0.030356884},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44061226,0.0015618973,0.32882845,0.009328143,0.00042606887,0.00020527757,0.0009611212,0.00049781863,0.21757898],"genre_scores_gemma":[0.8939923,0.0012616938,0.055117395,0.0011764115,0.00077422603,0.00020499584,0.0008503756,0.00020684811,0.046415653],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992207,0.0003956387,0.00002564444,0.00014707368,0.00011600228,0.000094960174],"domain_scores_gemma":[0.997003,0.0018495433,0.00023836292,0.00024228981,0.00026100146,0.00040575274],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009358739,0.00040926167,0.0009574732,0.0010888801,0.0015761934,0.0025768261,0.0017061465,0.001862891,0.009529248],"category_scores_gemma":[0.005584028,0.00038231505,0.0007761872,0.0018665423,0.0017138598,0.00625246,0.0022838416,0.002621633,0.0007178375],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000055003657,0.00007388694,0.00020752521,0.00005347957,0.0000099575245,0.00009750882,0.00012161653,0.005436601,0.00035776038,0.98116285,0.0046558976,0.0077677714],"study_design_scores_gemma":[0.000018170194,0.0000116138945,0.00013589789,0.000014253233,0.0000075213698,0.00007555205,0.00006262823,0.03229068,0.00013771963,0.9638388,0.0033987649,0.00000838172],"about_ca_topic_score_codex":0.001450137,"about_ca_topic_score_gemma":0.0015442896,"teacher_disagreement_score":0.009529248,"about_ca_system_score_codex":0.0010044196,"about_ca_system_score_gemma":0.00089812675,"threshold_uncertainty_score":0.03187853},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9768456,0.00013849905,0.016934719,0.0005651197,0.000020011124,0.00004046462,0.00011209557,0.00012103916,0.0052224025],"genre_scores_gemma":[0.99592495,0.000038753824,0.0033344466,0.00008179981,0.000018719797,0.000049253165,0.00013319474,0.0000146384255,0.00040410648],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99793696,0.00070452073,0.00012546162,0.0003762679,0.0005497053,0.00030704658],"domain_scores_gemma":[0.97323686,0.018484285,0.0032316395,0.0014359547,0.0010877693,0.0025234583],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021403173,0.0003718157,0.0011036609,0.0031228676,0.0015590294,0.003620493,0.00120541,0.0018316365,0.003732036],"category_scores_gemma":[0.020524122,0.00073993707,0.0006499558,0.0012967662,0.0037738248,0.003602153,0.0025052417,0.0011374739,0.00024989757],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001980294,0.00049529097,0.033266928,0.0004430051,0.00030119976,0.0025987711,0.0025115665,0.0589291,0.015965689,0.8616514,0.0037168106,0.018140009],"study_design_scores_gemma":[0.00029682554,0.00022197267,0.014872821,0.00013822624,0.00016305681,0.0016656605,0.0012576219,0.23065239,0.007841263,0.7399623,0.002803495,0.00012453711],"about_ca_topic_score_codex":0.00053637737,"about_ca_topic_score_gemma":0.00045035782,"teacher_disagreement_score":0.003732036,"about_ca_system_score_codex":0.0012512214,"about_ca_system_score_gemma":0.00037155364,"threshold_uncertainty_score":0.0124848485},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6232248,0.002111363,0.33791608,0.0031702435,0.00022708483,0.00009139648,0.0005127101,0.00044407806,0.03230223],"genre_scores_gemma":[0.96072173,0.0014959412,0.030304,0.00030186842,0.00026580616,0.00016475501,0.00028722195,0.00018265923,0.006276131],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998931,0.00025347812,0.000053152682,0.0002751702,0.00024518135,0.00024210614],"domain_scores_gemma":[0.991987,0.0037796416,0.0012554487,0.0012586358,0.0007376022,0.0009816624],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027414958,0.0006605702,0.0006274491,0.0019619286,0.0011161859,0.0029222437,0.0014340455,0.0010199109,0.0022894756],"category_scores_gemma":[0.016048834,0.0005231131,0.0005749245,0.0015283368,0.0055740625,0.0065398416,0.0017481976,0.0021099248,0.00036533724],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010927313,0.000023452538,0.0021160627,0.00005875497,0.000014859691,0.000094463,0.00021686133,0.02999544,0.0030165066,0.9573233,0.001315049,0.005715789],"study_design_scores_gemma":[0.000018976843,0.00003723126,0.0016425607,0.000035673496,0.00001621217,0.00016011935,0.000085990716,0.16042143,0.0019460617,0.83284765,0.0027414167,0.00004666801],"about_ca_topic_score_codex":0.0018661417,"about_ca_topic_score_gemma":0.0010697178,"teacher_disagreement_score":0.0029222437,"about_ca_system_score_codex":0.0027390956,"about_ca_system_score_gemma":0.00093293336,"threshold_uncertainty_score":0.019873679},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.71148354,0.0017287877,0.2313204,0.0059038806,0.00026387905,0.00014542678,0.0009876146,0.0008467082,0.04731984],"genre_scores_gemma":[0.975843,0.000999017,0.014829515,0.0008837475,0.00021678035,0.00025957436,0.00042970653,0.00016134379,0.006377265],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99880457,0.0003395185,0.000045925306,0.00042197504,0.00020591464,0.00018216616],"domain_scores_gemma":[0.978874,0.0154151,0.0015038872,0.0017488473,0.0011290028,0.0013290971],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021790587,0.0008005034,0.0011102606,0.0029441926,0.001991281,0.0032320542,0.0022069896,0.0016217675,0.004994255],"category_scores_gemma":[0.016121902,0.0006703234,0.0007983285,0.0018245296,0.004825761,0.005103008,0.0026887308,0.002824119,0.000572923],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014681747,0.00004982534,0.0038847711,0.00018410174,0.000039498587,0.0000923859,0.00025866023,0.016918393,0.005978448,0.9606488,0.002985331,0.008812999],"study_design_scores_gemma":[0.00006796024,0.00008455659,0.0028350933,0.000058930786,0.0000481147,0.00041614138,0.00014084978,0.1329911,0.0048342375,0.8544016,0.004038163,0.00008322152],"about_ca_topic_score_codex":0.002320432,"about_ca_topic_score_gemma":0.0020245276,"teacher_disagreement_score":0.004994255,"about_ca_system_score_codex":0.0028344858,"about_ca_system_score_gemma":0.0012486622,"threshold_uncertainty_score":0.020565689},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.817122,0.00051555654,0.10431158,0.0010259908,0.00018308099,0.000042034677,0.00032148557,0.0005358195,0.07594239],"genre_scores_gemma":[0.9782146,0.0002618247,0.009466936,0.00010816947,0.00012536145,0.00005307181,0.00017030662,0.00014220481,0.011457681],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99929976,0.00014168765,0.000025930378,0.00020204202,0.00021432647,0.0001162447],"domain_scores_gemma":[0.9958157,0.0019699535,0.0004939331,0.0006345645,0.000363226,0.0007226278],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009228948,0.00057752116,0.0007082465,0.0022705442,0.0015237724,0.0030149894,0.0019149493,0.0011425143,0.008870416],"category_scores_gemma":[0.0047354205,0.0004968278,0.0005752364,0.0018061926,0.0035747595,0.0055644894,0.0022439898,0.0026888035,0.00059417856],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006482476,0.000023769342,0.0005256217,0.000024780258,0.0000075989124,0.000045794503,0.0001988623,0.005027588,0.0015164868,0.9870459,0.0008053213,0.004713501],"study_design_scores_gemma":[0.000016205548,0.000017922208,0.00060927344,0.000008997202,0.000010388893,0.00007840486,0.00006905414,0.020791015,0.0008721394,0.9759041,0.0016032902,0.00001929996],"about_ca_topic_score_codex":0.0016220416,"about_ca_topic_score_gemma":0.0020957272,"teacher_disagreement_score":0.008870416,"about_ca_system_score_codex":0.0019979274,"about_ca_system_score_gemma":0.0006911561,"threshold_uncertainty_score":0.02967453},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.74987864,0.00077865383,0.17579976,0.0010112254,0.000107938016,0.00013875478,0.0008986634,0.0015095851,0.0698769],"genre_scores_gemma":[0.95889074,0.00019789797,0.03261886,0.00024404182,0.000065370084,0.000115838244,0.00035222515,0.00023554054,0.0072794757],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99855393,0.00009034182,0.000112791335,0.000416301,0.00024720994,0.000579305],"domain_scores_gemma":[0.9937236,0.0023309493,0.0010035639,0.0012989212,0.00079915,0.00084378803],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008368212,0.00081662094,0.0010851796,0.0007747326,0.0013754003,0.0029648875,0.0013472326,0.00088339555,0.007521914],"category_scores_gemma":[0.004525881,0.00072437525,0.001024244,0.0006258923,0.0023891802,0.004662236,0.0021536045,0.0017052963,0.001761604],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0017240954,0.0005305528,0.038007345,0.0009162122,0.00014199715,0.0017968699,0.0023060464,0.021979569,0.08417944,0.766355,0.012985139,0.069077775],"study_design_scores_gemma":[0.00015530261,0.00034622257,0.007815968,0.00012920698,0.00017037163,0.0043519866,0.00095639157,0.062237523,0.07976001,0.82095534,0.023026971,0.00009460109],"about_ca_topic_score_codex":0.0011477848,"about_ca_topic_score_gemma":0.0012594141,"teacher_disagreement_score":0.007521914,"about_ca_system_score_codex":0.0011724996,"about_ca_system_score_gemma":0.00063007744,"threshold_uncertainty_score":0.025163352},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22687152,0.0038790882,0.28653774,0.0097026,0.0015289326,0.00009013913,0.00044238914,0.00079888594,0.47014883],"genre_scores_gemma":[0.9365466,0.0018491771,0.024277056,0.001528016,0.0017660906,0.00014133002,0.00018688792,0.0002141183,0.033490613],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994672,0.00016241356,0.000021829812,0.00012971826,0.00014347374,0.00007539338],"domain_scores_gemma":[0.9982566,0.0009453723,0.0001237326,0.00020601747,0.0002925327,0.00017568468],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008650021,0.0006841397,0.00083533616,0.0026688043,0.0015573573,0.0020145406,0.0010900352,0.0011517851,0.008611794],"category_scores_gemma":[0.0038660804,0.0003141452,0.00097214093,0.0013685374,0.0031805963,0.006197564,0.002672466,0.002561999,0.0009978062],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015529244,0.000010239828,0.0001088017,0.000028793285,0.0000041567423,0.000045241813,0.0001487072,0.00093119935,0.00031521902,0.9899559,0.0020377534,0.0063985446],"study_design_scores_gemma":[0.0000042342917,0.00000628161,0.00013827215,0.000006654003,0.000003105728,0.000042762833,0.000023534763,0.003304015,0.00018383359,0.99201363,0.004267565,0.0000060399393],"about_ca_topic_score_codex":0.0006892245,"about_ca_topic_score_gemma":0.00051794545,"teacher_disagreement_score":0.008611794,"about_ca_system_score_codex":0.0010782522,"about_ca_system_score_gemma":0.0005219598,"threshold_uncertainty_score":0.028809309},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.64899385,0.0042144125,0.1315806,0.012304537,0.0005100563,0.00005466326,0.00038572366,0.00034634842,0.2016098],"genre_scores_gemma":[0.9835196,0.0007037129,0.008211346,0.00042325075,0.000257857,0.000033725562,0.000099540135,0.000033680913,0.0067173163],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99918264,0.00021693938,0.00002993702,0.000177778,0.0002140085,0.00017865056],"domain_scores_gemma":[0.9983365,0.0007434045,0.00024104172,0.00034024278,0.00018019116,0.00015873693],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014790511,0.0003233727,0.00051757897,0.0011270918,0.0021755125,0.002372359,0.0009739621,0.0013781585,0.0049413345],"category_scores_gemma":[0.005110601,0.00027745526,0.0006583522,0.001124142,0.003959862,0.0050657704,0.0020193118,0.0017702492,0.00031034587],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000042520773,0.0000123840855,0.00025728403,0.000018782985,0.0000031146312,0.000045977802,0.00015375108,0.0037430008,0.00050352066,0.99183923,0.000956952,0.0024234632],"study_design_scores_gemma":[0.000018448676,0.000009932347,0.00033249945,0.000011652481,0.0000047344756,0.00004832362,0.00013802045,0.013795981,0.0003674226,0.98040456,0.004857975,0.00001056822],"about_ca_topic_score_codex":0.0048655886,"about_ca_topic_score_gemma":0.0027329465,"teacher_disagreement_score":0.0049413345,"about_ca_system_score_codex":0.0026354766,"about_ca_system_score_gemma":0.0007016212,"threshold_uncertainty_score":0.019121826},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7909124,0.0011085342,0.15671098,0.00063258345,0.000110594876,0.00006804643,0.00093537086,0.00037320555,0.049148355],"genre_scores_gemma":[0.9675075,0.0004171315,0.020978035,0.00013500908,0.00013435006,0.0001769466,0.0010955116,0.0001402454,0.009415326],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99833715,0.00037147166,0.00018124777,0.00039111602,0.00048318127,0.00023585076],"domain_scores_gemma":[0.9902069,0.005991311,0.00089998316,0.00087903405,0.00099015,0.0010326967],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015307998,0.00075490586,0.0016399964,0.0033913576,0.0031389333,0.0065734354,0.0019522802,0.0009956544,0.006963884],"category_scores_gemma":[0.0077771726,0.0015195141,0.0014587458,0.0025035858,0.003925228,0.0072802254,0.003438009,0.0016413289,0.0006868309],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014261073,0.000044054003,0.0016247587,0.0000590266,0.00004052585,0.00027611613,0.00067443616,0.0010924843,0.0015263902,0.99010706,0.0006256382,0.0037869331],"study_design_scores_gemma":[0.00003019236,0.00003466712,0.0012645967,0.000048582744,0.000054401422,0.00078735984,0.0006254628,0.008631906,0.0020022015,0.9835348,0.0029562048,0.000029678104],"about_ca_topic_score_codex":0.0009354794,"about_ca_topic_score_gemma":0.0008298687,"teacher_disagreement_score":0.006963884,"about_ca_system_score_codex":0.001319646,"about_ca_system_score_gemma":0.00057260116,"threshold_uncertainty_score":0.023296475},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.87944996,0.00082601106,0.106457666,0.0011636437,0.00004918816,0.000046923895,0.0003494747,0.00014306416,0.011514077],"genre_scores_gemma":[0.9773842,0.00027849482,0.020288976,0.000090528345,0.00005771743,0.0000504043,0.00018786751,0.000059881077,0.0016019462],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993148,0.00029010174,0.00002580259,0.00016284085,0.00011702295,0.000089418114],"domain_scores_gemma":[0.9958781,0.0027219893,0.0004672585,0.00024234835,0.0003201113,0.00037019636],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013801366,0.00044563072,0.00089533324,0.0013080586,0.0007669327,0.0012455566,0.0012237955,0.00092054333,0.003151487],"category_scores_gemma":[0.0074664573,0.0005218648,0.0003398915,0.0007268258,0.0012481825,0.002518411,0.0009545566,0.0008627746,0.00025008325],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00078059186,0.00018652128,0.007323499,0.00063644437,0.00012549179,0.0002834496,0.00086134975,0.11387925,0.028382022,0.81271243,0.0064048492,0.028424127],"study_design_scores_gemma":[0.00009752325,0.000115839335,0.003265044,0.00008104801,0.00004290681,0.00050108327,0.000410748,0.28452113,0.007834562,0.6997913,0.0032852162,0.000053533866],"about_ca_topic_score_codex":0.00080534926,"about_ca_topic_score_gemma":0.0009136142,"teacher_disagreement_score":0.003151487,"about_ca_system_score_codex":0.0008712532,"about_ca_system_score_gemma":0.0003584877,"threshold_uncertainty_score":0.01054275},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.88566846,0.00043655524,0.096941516,0.00071549293,0.000043914562,0.00003565914,0.00015610752,0.00014261168,0.015859673],"genre_scores_gemma":[0.996012,0.00006427615,0.0028162652,0.000041040606,0.000019572311,0.000011645884,0.000039612944,0.0000047542853,0.0009908461],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992581,0.00016460891,0.00003168089,0.00018771536,0.000205939,0.00015188001],"domain_scores_gemma":[0.9982773,0.0005113121,0.00031532138,0.00030901848,0.0002081509,0.0003788684],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001032469,0.00030670883,0.00042212827,0.0008038262,0.0008629292,0.0012043788,0.000531494,0.00044335471,0.0020123876],"category_scores_gemma":[0.0037722639,0.00020588408,0.00049147184,0.00041573052,0.0026280205,0.0015132295,0.0022524118,0.0010313562,0.00015486198],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008005622,0.000017015604,0.001658094,0.00004125766,0.000012582539,0.000096172516,0.00047043196,0.004085531,0.0047502606,0.98459584,0.00029359382,0.0038991238],"study_design_scores_gemma":[0.000038943672,0.00012517958,0.0023655249,0.000026234811,0.000019758987,0.00032772805,0.00030165128,0.046108156,0.0033825622,0.94395053,0.0033256314,0.000028192453],"about_ca_topic_score_codex":0.0012103122,"about_ca_topic_score_gemma":0.0007299452,"teacher_disagreement_score":0.0020123876,"about_ca_system_score_codex":0.001077675,"about_ca_system_score_gemma":0.00043562165,"threshold_uncertainty_score":0.007819176},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38827145,0.002369197,0.1985404,0.004992119,0.0015482195,0.000095534204,0.00072513573,0.0007823512,0.4026756],"genre_scores_gemma":[0.9092097,0.0010454669,0.01856012,0.0005551101,0.00084711326,0.00006450828,0.00036703816,0.0003153505,0.069035545],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989579,0.0002618384,0.000045587036,0.00019617635,0.00033119586,0.0002073674],"domain_scores_gemma":[0.9987048,0.00046348438,0.00016466655,0.0001877938,0.00025231627,0.00022704531],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010362171,0.00083805044,0.00085827557,0.002548938,0.0018074353,0.004635054,0.0009852059,0.0012291793,0.0154090775],"category_scores_gemma":[0.0026530358,0.0006211092,0.0008704387,0.0024192675,0.002937639,0.0057590613,0.0031379396,0.0032129409,0.0024073813],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000148536965,0.0000116485535,0.00004517621,0.000009785296,0.00000254416,0.000027985965,0.00016225596,0.0001342061,0.00026898223,0.9954672,0.00061319704,0.0032421437],"study_design_scores_gemma":[0.000008809348,0.000011211141,0.00009378115,0.000006988628,0.0000056130357,0.000098994366,0.00006594214,0.0013180419,0.00028602878,0.99383837,0.0042564957,0.000009570284],"about_ca_topic_score_codex":0.00092007994,"about_ca_topic_score_gemma":0.0007719689,"teacher_disagreement_score":0.0154090775,"about_ca_system_score_codex":0.0016039121,"about_ca_system_score_gemma":0.0006614547,"threshold_uncertainty_score":0.05154854},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.117649876,0.0047842576,0.7683326,0.0022973493,0.00088050985,0.00007096594,0.00034616547,0.00071029423,0.104928054],"genre_scores_gemma":[0.8612759,0.005688976,0.10044972,0.000793017,0.0018685658,0.0002757073,0.0005635291,0.00086368003,0.028220978],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99606436,0.0009030925,0.00023657594,0.00055559893,0.0017073492,0.00053306937],"domain_scores_gemma":[0.9842988,0.009885791,0.00087787915,0.0016544684,0.0022176192,0.0010653987],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0070498693,0.0025494823,0.0018684497,0.007879439,0.0023617023,0.0055418615,0.0037591422,0.0014063678,0.01079437],"category_scores_gemma":[0.0247944,0.00092308957,0.002073043,0.0045427056,0.005985718,0.020880794,0.007527996,0.0078024957,0.0031810256],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000053479474,0.00004502788,0.0005949802,0.00013003478,0.000024649935,0.000088228764,0.0002376767,0.0041685803,0.0011862542,0.98296124,0.0013246785,0.009185227],"study_design_scores_gemma":[0.0000058501614,0.000026189515,0.00029735325,0.00006273905,0.00004689026,0.00013514567,0.0000825476,0.028812805,0.0030097314,0.96449983,0.0029864763,0.00003443246],"about_ca_topic_score_codex":0.00092795596,"about_ca_topic_score_gemma":0.0010377414,"teacher_disagreement_score":0.01079437,"about_ca_system_score_codex":0.0027216533,"about_ca_system_score_gemma":0.00095291506,"threshold_uncertainty_score":0.03728372},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19768825,0.015738629,0.5306105,0.071896315,0.0033820444,0.0002581205,0.0014963672,0.0013973638,0.17753235],"genre_scores_gemma":[0.7143442,0.008661698,0.20603679,0.004863633,0.0027917097,0.00027107817,0.0010111775,0.0014560568,0.06056372],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99810493,0.00077125244,0.00011072715,0.00045221654,0.00039159227,0.00016917528],"domain_scores_gemma":[0.9927192,0.0051856036,0.000290367,0.0010090567,0.0005335973,0.00026214292],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019005646,0.00069213,0.0020183118,0.0011766674,0.004056942,0.003393381,0.002320538,0.002965048,0.009916329],"category_scores_gemma":[0.016542833,0.001255219,0.0010352086,0.0037559809,0.0051343623,0.013914569,0.0041500493,0.0052509196,0.0022541368],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013418279,0.000039348106,0.0003020124,0.00019340482,0.00001550814,0.00012449364,0.0006924679,0.0040769493,0.000524751,0.928922,0.023547592,0.041427333],"study_design_scores_gemma":[0.000029572186,0.0000072181588,0.00006182695,0.000021470587,0.000009278345,0.00009031441,0.00018984743,0.0035478233,0.00038032164,0.97994256,0.01570442,0.000015445257],"about_ca_topic_score_codex":0.0030049272,"about_ca_topic_score_gemma":0.002412501,"teacher_disagreement_score":0.009916329,"about_ca_system_score_codex":0.0014844666,"about_ca_system_score_gemma":0.0014054298,"threshold_uncertainty_score":0.033173442},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6529448,0.0017461836,0.32344872,0.0061256546,0.00013648279,0.00020292288,0.0010860215,0.00055567344,0.013753574],"genre_scores_gemma":[0.9801768,0.0012274506,0.013969521,0.0003858394,0.0002490625,0.0003235649,0.00041403924,0.00012420384,0.003129515],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9958813,0.002296038,0.00009468804,0.0007800597,0.00056891766,0.00037892882],"domain_scores_gemma":[0.92794657,0.060597464,0.0035209386,0.0049302583,0.0014964304,0.0015083834],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0083022425,0.00085229415,0.002019182,0.0034793087,0.0012887807,0.0027366544,0.0025755602,0.0021853133,0.0034509231],"category_scores_gemma":[0.06484288,0.0010364717,0.0008041752,0.0021058354,0.0076771853,0.006918883,0.0027075345,0.0021159572,0.0006231875],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00077397504,0.00007535025,0.0082216505,0.00030234456,0.00014517092,0.0004361591,0.00058598915,0.22035766,0.005176772,0.74115384,0.004375116,0.018395951],"study_design_scores_gemma":[0.00019931226,0.00017215726,0.003523505,0.00013576381,0.000081944134,0.00057182496,0.00019380452,0.52555007,0.0024949736,0.46460417,0.0023601162,0.000112424284],"about_ca_topic_score_codex":0.0016311225,"about_ca_topic_score_gemma":0.0011235585,"teacher_disagreement_score":0.0083022425,"about_ca_system_score_codex":0.0022790432,"about_ca_system_score_gemma":0.0006415662,"threshold_uncertainty_score":0.043906987},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08533993,0.037736848,0.5449712,0.046413604,0.009594585,0.00012372408,0.0007284387,0.0011193675,0.27397224],"genre_scores_gemma":[0.7173345,0.023040807,0.15016891,0.009575369,0.017687248,0.00033571396,0.00038689998,0.0009262043,0.08054439],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988238,0.0005296622,0.00008282679,0.0001844213,0.0002968125,0.00008232515],"domain_scores_gemma":[0.9933041,0.004733598,0.000325725,0.00067022315,0.00047044893,0.00049593206],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004299308,0.0012153718,0.0020623098,0.0037192446,0.0026425738,0.0042007314,0.0027030704,0.0029262952,0.0070711067],"category_scores_gemma":[0.010744074,0.00082785706,0.0014261411,0.0024250906,0.0106275985,0.015791016,0.0041438327,0.0070266654,0.00087404327],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003988149,0.0000064845644,0.00003013853,0.00002544195,0.0000026248651,0.000032841916,0.000105223,0.00023630017,0.00013700442,0.99643683,0.0017774876,0.001205651],"study_design_scores_gemma":[0.0000030836454,0.000005505408,0.000045347646,0.0000110565425,0.0000034100829,0.000053432173,0.000033767417,0.0019576466,0.000079675614,0.992833,0.004965223,0.000008924696],"about_ca_topic_score_codex":0.0016096445,"about_ca_topic_score_gemma":0.0016998346,"teacher_disagreement_score":0.0070711067,"about_ca_system_score_codex":0.0021902202,"about_ca_system_score_gemma":0.0008523404,"threshold_uncertainty_score":0.023655236},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6980424,0.0030248775,0.23801878,0.0014443392,0.00029162585,0.00005494244,0.00045369184,0.00044523578,0.058224097],"genre_scores_gemma":[0.9273411,0.0020594404,0.048686754,0.00016788291,0.0004669458,0.00007693654,0.00044974202,0.00021449097,0.020536728],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986534,0.00025154502,0.00008570084,0.00025258109,0.0005885464,0.000168143],"domain_scores_gemma":[0.9917269,0.004884034,0.0009649075,0.0005827561,0.0012113038,0.00063004385],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013605134,0.00067161734,0.0010886841,0.0053762817,0.0013689969,0.0047573466,0.0020004886,0.0016925774,0.0052489405],"category_scores_gemma":[0.012279919,0.00062219164,0.00043555832,0.0032951776,0.0033093465,0.009930308,0.0021582567,0.0022707107,0.00069223385],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000059222606,0.000020574988,0.00083583157,0.00009216814,0.000011402534,0.000094728384,0.0002896011,0.0030495422,0.0015264311,0.9815237,0.0011018818,0.011394899],"study_design_scores_gemma":[0.000008073195,0.0000123623295,0.00044781846,0.000025507763,0.000011655352,0.00016987597,0.00014372639,0.018381502,0.0011986175,0.97711825,0.0024708642,0.000011881822],"about_ca_topic_score_codex":0.0010231112,"about_ca_topic_score_gemma":0.0008646803,"teacher_disagreement_score":0.0053762817,"about_ca_system_score_codex":0.0013313834,"about_ca_system_score_gemma":0.00046749826,"threshold_uncertainty_score":0.01755941},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.80067843,0.0010113412,0.077044,0.002652914,0.00030565515,0.000111564084,0.0004245978,0.00038865715,0.1173828],"genre_scores_gemma":[0.9601596,0.00058262085,0.01796594,0.0002489785,0.00027230874,0.000164395,0.00032671832,0.000098035445,0.020181457],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992335,0.0001909018,0.000043096417,0.00015549378,0.00023089693,0.00014620571],"domain_scores_gemma":[0.9934934,0.0043309843,0.00074048666,0.0003276457,0.00048247084,0.00062502857],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011956607,0.00052089896,0.00065925764,0.0032101949,0.003001047,0.0040588905,0.0015123419,0.0013673962,0.007206065],"category_scores_gemma":[0.008545567,0.00080931815,0.0008851881,0.0018566782,0.0035266443,0.0077419057,0.0019448311,0.0027468826,0.0006568563],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000043292457,0.00003578636,0.00024503632,0.000028342352,0.000004078223,0.00010038447,0.00036691935,0.0010999243,0.00049602374,0.9936706,0.00078862027,0.0031210936],"study_design_scores_gemma":[0.000020437667,0.0000104317805,0.00019432667,0.000012320277,0.000006146944,0.00007924635,0.00008542561,0.0034285423,0.00022845672,0.9948502,0.0010739586,0.00001046141],"about_ca_topic_score_codex":0.0011839111,"about_ca_topic_score_gemma":0.0023565455,"teacher_disagreement_score":0.007206065,"about_ca_system_score_codex":0.0014507365,"about_ca_system_score_gemma":0.0009890947,"threshold_uncertainty_score":0.024106622},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36813816,0.0055246055,0.21203625,0.11537375,0.002516852,0.00011444748,0.0019049167,0.001195418,0.29319566],"genre_scores_gemma":[0.940448,0.0022945337,0.026664209,0.0073518124,0.002155785,0.00016566386,0.0008956592,0.00022790993,0.019796543],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99737996,0.00074711756,0.0001079081,0.0006615565,0.0008170901,0.00028635902],"domain_scores_gemma":[0.97959614,0.01659751,0.0007168641,0.0014912268,0.00072519144,0.0008730269],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030534777,0.0006263171,0.0019768472,0.0019489715,0.003044254,0.005812157,0.002738503,0.0041215406,0.008215978],"category_scores_gemma":[0.017534725,0.0008173855,0.0010246056,0.003342003,0.005584147,0.011325057,0.0051940843,0.004877345,0.0009735637],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000102654514,0.000041176052,0.00035960335,0.000077194716,0.000015321031,0.00012134073,0.00017508227,0.0018463394,0.0004278679,0.97959524,0.010933746,0.0063044047],"study_design_scores_gemma":[0.000033641245,0.000010007618,0.00011343173,0.000016451771,0.0000082531715,0.00015362118,0.000049635244,0.005907878,0.00021052644,0.98948824,0.004000933,0.0000074124882],"about_ca_topic_score_codex":0.00079847954,"about_ca_topic_score_gemma":0.00073408236,"teacher_disagreement_score":0.008215978,"about_ca_system_score_codex":0.001933558,"about_ca_system_score_gemma":0.00087407907,"threshold_uncertainty_score":0.027485132},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.79106855,0.0009674144,0.14771625,0.007181566,0.00014581993,0.00025371055,0.0017773926,0.0020456405,0.04884359],"genre_scores_gemma":[0.98034245,0.00036551317,0.012117491,0.00061913906,0.00010626971,0.00017626431,0.0006645526,0.00027686957,0.0053314297],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986394,0.00025231176,0.000034267126,0.0005180158,0.00021531843,0.00034064215],"domain_scores_gemma":[0.9906144,0.004404317,0.001434556,0.0017252177,0.0007591942,0.0010622485],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012952887,0.00058220234,0.0013205267,0.0011726426,0.0017247915,0.0026005383,0.0020100314,0.001427258,0.005498831],"category_scores_gemma":[0.012651773,0.00060525484,0.0011124283,0.00076846173,0.0032984617,0.0029774918,0.001849217,0.0021900565,0.00093623286],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011407842,0.00033965908,0.019783195,0.0010769167,0.00028926623,0.0019973414,0.0017321546,0.037837222,0.055659357,0.82259506,0.021766247,0.03578279],"study_design_scores_gemma":[0.0002308461,0.00040801024,0.020771287,0.00019827434,0.00026434372,0.0036573347,0.00086658273,0.22593637,0.033354133,0.69926995,0.014860312,0.00018257929],"about_ca_topic_score_codex":0.002090024,"about_ca_topic_score_gemma":0.0020736214,"teacher_disagreement_score":0.005498831,"about_ca_system_score_codex":0.0023568617,"about_ca_system_score_gemma":0.0012356403,"threshold_uncertainty_score":0.018395424},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15718786,0.0066431984,0.4120282,0.018301336,0.002083009,0.00013965521,0.0012916639,0.00065371586,0.4016714],"genre_scores_gemma":[0.83785486,0.00495945,0.07987289,0.0036464217,0.0024396605,0.0002915984,0.0009947784,0.00051539653,0.06942487],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989003,0.00021087508,0.00004040404,0.00038165174,0.0002706982,0.00019611134],"domain_scores_gemma":[0.988197,0.007600615,0.0006764905,0.0010938607,0.0008950436,0.0015369214],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016623061,0.0010749082,0.0009621241,0.005277037,0.0026044336,0.003693783,0.0027394628,0.0020857987,0.015191216],"category_scores_gemma":[0.01081852,0.0006751241,0.0010792053,0.004704238,0.0063670087,0.009315745,0.003762887,0.005632874,0.001115579],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000036556336,0.000024149636,0.00037153534,0.00007263934,0.000005962105,0.000031764568,0.00019328196,0.0012997219,0.00052086794,0.9883456,0.0031262508,0.0059716348],"study_design_scores_gemma":[0.000021635919,0.000020583175,0.0006846741,0.000046043024,0.000020694657,0.00012156187,0.00013654151,0.006150166,0.00072639406,0.98061717,0.011428926,0.00002555176],"about_ca_topic_score_codex":0.0029713067,"about_ca_topic_score_gemma":0.0034958357,"teacher_disagreement_score":0.015191216,"about_ca_system_score_codex":0.0040038875,"about_ca_system_score_gemma":0.0015127057,"threshold_uncertainty_score":0.050819695},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7133783,0.0023129936,0.12707755,0.0034878831,0.0006181509,0.00013186326,0.00063663983,0.00072354433,0.15163301],"genre_scores_gemma":[0.9226425,0.0015999533,0.02519196,0.00038967468,0.0005674987,0.00019246929,0.0004778881,0.00028602045,0.048651934],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987864,0.00028309942,0.00009268951,0.0002622377,0.000348604,0.00022704547],"domain_scores_gemma":[0.9974184,0.0013651006,0.00037014534,0.00018424472,0.00022845765,0.00043374157],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011764388,0.0010542786,0.0013544913,0.0067809657,0.0044265348,0.0060736667,0.001574685,0.0017245149,0.011265086],"category_scores_gemma":[0.0051477947,0.0010755146,0.0013131979,0.004715967,0.0062568435,0.011403531,0.004636656,0.004929729,0.0015064627],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002001471,0.0000142897015,0.00009752321,0.000021184207,0.0000030663623,0.00006807698,0.0003347385,0.00036037288,0.000205318,0.99621177,0.00033773974,0.0023259546],"study_design_scores_gemma":[0.000010859882,0.000007120231,0.000089373956,0.000015030953,0.000007112325,0.000090003996,0.000109150234,0.0007096075,0.00017418686,0.9971072,0.001672103,0.000008229114],"about_ca_topic_score_codex":0.0012085601,"about_ca_topic_score_gemma":0.0013467009,"teacher_disagreement_score":0.011265086,"about_ca_system_score_codex":0.0022885925,"about_ca_system_score_gemma":0.0008057242,"threshold_uncertainty_score":0.037685513},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46904427,0.014458237,0.19286208,0.011493507,0.0010123769,0.00008026592,0.0006686375,0.0005001227,0.3098805],"genre_scores_gemma":[0.94480777,0.0038799755,0.021806795,0.0008941919,0.00092802476,0.00016392737,0.000256581,0.00007334978,0.027189331],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99923015,0.00028371747,0.000046177294,0.0001538185,0.00017859465,0.00010756302],"domain_scores_gemma":[0.9974975,0.001420846,0.00038459734,0.00017873953,0.00025669756,0.0002615546],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012828894,0.0006510793,0.0010247641,0.0029466571,0.002730285,0.004289033,0.0011251143,0.0014778452,0.006924213],"category_scores_gemma":[0.0048090904,0.0006976457,0.00053561537,0.00349144,0.006164217,0.01151467,0.0023536594,0.0034566498,0.0008339476],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000073011174,0.0000038912785,0.000030451745,0.000011282974,0.0000010497764,0.000008133164,0.00007162957,0.000137711,0.00007603261,0.998384,0.0003483346,0.0009202268],"study_design_scores_gemma":[0.000004084868,0.0000026295882,0.0000441807,0.0000053320337,0.0000020993036,0.000023227014,0.000035488276,0.00053412194,0.0000589378,0.99784625,0.0014396855,0.000004028555],"about_ca_topic_score_codex":0.0010340697,"about_ca_topic_score_gemma":0.0011122879,"teacher_disagreement_score":0.006924213,"about_ca_system_score_codex":0.0015211427,"about_ca_system_score_gemma":0.0007051344,"threshold_uncertainty_score":0.023163795},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5330367,0.002132227,0.39592507,0.0066777673,0.00032069944,0.00034055425,0.0029279923,0.0026038687,0.056035075],"genre_scores_gemma":[0.91963065,0.0014358693,0.056721453,0.0007628481,0.00036354785,0.00021644721,0.0017514469,0.00049520127,0.01862253],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9969374,0.0007849187,0.00019170815,0.00082972995,0.0006514177,0.00060484686],"domain_scores_gemma":[0.9815793,0.012901495,0.0016211479,0.0017646265,0.0007456398,0.0013879213],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027098763,0.0011266876,0.0024779637,0.0019645502,0.0027379002,0.0065740864,0.003579384,0.0022519373,0.012824956],"category_scores_gemma":[0.0209948,0.0020703892,0.0015199026,0.0044507394,0.003452777,0.020486606,0.004453751,0.0050997455,0.0018362532],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005221619,0.0002129423,0.0011513551,0.0004181827,0.00008089997,0.00022186441,0.00094793725,0.020658134,0.002808368,0.93777275,0.008191553,0.027013812],"study_design_scores_gemma":[0.00007078302,0.000018894661,0.00014801562,0.000021838674,0.000031271302,0.00007287546,0.000109634864,0.021230813,0.0008213872,0.975872,0.0015890801,0.000013585687],"about_ca_topic_score_codex":0.0032622945,"about_ca_topic_score_gemma":0.004687993,"teacher_disagreement_score":0.012824956,"about_ca_system_score_codex":0.004360674,"about_ca_system_score_gemma":0.0024132838,"threshold_uncertainty_score":0.04290372},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.71404827,0.0015023907,0.045478404,0.0133943055,0.0010617893,0.000032924472,0.00031554038,0.0003760658,0.22379032],"genre_scores_gemma":[0.9832608,0.00024181372,0.0045839255,0.0005699896,0.00026261172,0.000021861773,0.0000945533,0.000037341404,0.010927099],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99934703,0.00018010919,0.000021330186,0.00012593484,0.00011104536,0.00021451454],"domain_scores_gemma":[0.9979873,0.000946337,0.0001592083,0.00044949757,0.00018163372,0.00027606732],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015471935,0.00040599814,0.0008867291,0.0013019615,0.003171136,0.0033928342,0.001186744,0.0020421068,0.0064063882],"category_scores_gemma":[0.0048425845,0.0003679496,0.0006749504,0.001227678,0.0054604607,0.0056165676,0.0025263508,0.0027272187,0.00056881574],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004524739,0.000016490472,0.0002661156,0.000011593868,0.0000023009834,0.000046911573,0.00013629263,0.00085579394,0.00017721303,0.9956132,0.0010683411,0.0017604546],"study_design_scores_gemma":[0.0000098878845,0.0000025575544,0.000059637772,0.0000033873757,0.0000014688201,0.000014566552,0.000039045553,0.0014202818,0.0000831655,0.99749136,0.0008715736,0.0000030525994],"about_ca_topic_score_codex":0.003476859,"about_ca_topic_score_gemma":0.0029982363,"teacher_disagreement_score":0.0064063882,"about_ca_system_score_codex":0.0025303015,"about_ca_system_score_gemma":0.0011124718,"threshold_uncertainty_score":0.021431506},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41075435,0.0017235881,0.47272825,0.0024278886,0.00024136073,0.000069721056,0.0007734825,0.0009967247,0.11028474],"genre_scores_gemma":[0.9606356,0.00024638887,0.027886655,0.000115661,0.000079706944,0.000039492734,0.00024708678,0.000090644426,0.010658724],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991093,0.00015844675,0.000052956726,0.00021852205,0.0002386504,0.00022203675],"domain_scores_gemma":[0.9983323,0.00062726415,0.00020154941,0.00042455323,0.00027714053,0.00013704215],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00092767173,0.00022607217,0.0006684083,0.0007491566,0.00075863465,0.0013556818,0.00079342927,0.0004935229,0.005989958],"category_scores_gemma":[0.0070042703,0.00021013299,0.00039896864,0.00086014264,0.001259474,0.0024755122,0.0013336461,0.0012197538,0.0008451718],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011130483,0.000032288906,0.0006470172,0.00006792517,0.000013457118,0.00009510315,0.00017225406,0.019083505,0.0022551538,0.950776,0.0033465666,0.023399407],"study_design_scores_gemma":[0.000032988963,0.000040005783,0.0004255401,0.000021761556,0.000019711293,0.00011234621,0.000103710416,0.13240784,0.0026791703,0.8559209,0.008217015,0.000018933888],"about_ca_topic_score_codex":0.0013309473,"about_ca_topic_score_gemma":0.0020887642,"teacher_disagreement_score":0.005989958,"about_ca_system_score_codex":0.001858134,"about_ca_system_score_gemma":0.00087466306,"threshold_uncertainty_score":0.020038426},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.65986055,0.0020919335,0.21423447,0.0032137171,0.00016650514,0.00007667213,0.00063934736,0.00056083803,0.11915589],"genre_scores_gemma":[0.9666245,0.0007772094,0.018487448,0.00040771574,0.00018976242,0.0001712431,0.0004564164,0.000114104914,0.012771585],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99843293,0.00047548188,0.00008024545,0.00033332896,0.00047738978,0.00020059307],"domain_scores_gemma":[0.992675,0.0046861535,0.00052029506,0.00061146746,0.0006139918,0.0008929618],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020957792,0.0007021289,0.0015233852,0.0023957312,0.0042122724,0.0035611906,0.0017229338,0.001274625,0.006494469],"category_scores_gemma":[0.00797552,0.00090204005,0.00093656336,0.0020104263,0.004399031,0.0082760155,0.0044848192,0.002656141,0.0004727841],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006068009,0.000017299664,0.00035410537,0.00004236642,0.000015104166,0.00007026779,0.00033501894,0.0005346895,0.000620746,0.9945544,0.0007561823,0.0026390802],"study_design_scores_gemma":[0.000022670192,0.000008764343,0.00029491764,0.000017264312,0.000024193288,0.00016184166,0.00016559829,0.0027498356,0.00060647697,0.99390405,0.0020347068,0.000009663403],"about_ca_topic_score_codex":0.0007038007,"about_ca_topic_score_gemma":0.0010121881,"teacher_disagreement_score":0.006494469,"about_ca_system_score_codex":0.0016902046,"about_ca_system_score_gemma":0.000688018,"threshold_uncertainty_score":0.021726131},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.76347464,0.00083675,0.059934862,0.0039212042,0.0001898128,0.00014693342,0.0010935605,0.00051766855,0.16988458],"genre_scores_gemma":[0.9709627,0.0003287074,0.010000546,0.00042116278,0.000103404556,0.000081047154,0.00056422123,0.00006377694,0.017474452],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996301,0.00006640403,0.000014923097,0.000114545954,0.00009148343,0.00008250814],"domain_scores_gemma":[0.9985637,0.0003972002,0.00022700048,0.00024263508,0.00019728331,0.00037219995],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003856191,0.0006258669,0.00090290507,0.001693462,0.0032145171,0.0030808875,0.0014985171,0.0013074403,0.0058486434],"category_scores_gemma":[0.00196365,0.00038379178,0.00064713485,0.001395218,0.0025437362,0.0024119536,0.0014643827,0.0019538372,0.0007951008],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000047526537,0.000023725124,0.000551496,0.00002441366,0.000010036992,0.00020846823,0.00024574198,0.00037699973,0.0010048696,0.99228364,0.0014194414,0.0038036245],"study_design_scores_gemma":[0.00005137383,0.000016910477,0.0008531039,0.000017713883,0.000016226426,0.00047976684,0.0002493798,0.0035340216,0.0006110404,0.9865437,0.007611707,0.000015062207],"about_ca_topic_score_codex":0.0026101077,"about_ca_topic_score_gemma":0.0021405627,"teacher_disagreement_score":0.0058486434,"about_ca_system_score_codex":0.0012953004,"about_ca_system_score_gemma":0.00072603114,"threshold_uncertainty_score":0.019565642},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5563033,0.002467571,0.2421307,0.009523297,0.0003965384,0.000089981186,0.0009391096,0.0012368278,0.1869127],"genre_scores_gemma":[0.9694499,0.0006246896,0.012815287,0.0004958068,0.00021721529,0.0000559016,0.00056850223,0.00018172259,0.015591007],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984439,0.0003919293,0.00010561539,0.00044389136,0.00030640175,0.00030839758],"domain_scores_gemma":[0.99427766,0.0025454727,0.00056070543,0.0008659486,0.00083067984,0.0009196155],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002526638,0.0006496759,0.0015882272,0.0026364168,0.003875262,0.008231694,0.0019403425,0.00201453,0.015132249],"category_scores_gemma":[0.0073194336,0.0011029809,0.0012490138,0.002901662,0.008287886,0.031711597,0.003918321,0.0032812576,0.0019603139],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003348658,0.000024989375,0.0005222132,0.000024843048,0.0000076927445,0.000049165927,0.00066662073,0.00014254473,0.00021747751,0.99434495,0.0008731911,0.003092755],"study_design_scores_gemma":[0.000010857978,0.000008313581,0.00019335028,0.000015126119,0.000007639484,0.000104439125,0.00073711516,0.00055938447,0.0002832027,0.995025,0.0030446525,0.000010968296],"about_ca_topic_score_codex":0.002007906,"about_ca_topic_score_gemma":0.0019564992,"teacher_disagreement_score":0.015132249,"about_ca_system_score_codex":0.0014494772,"about_ca_system_score_gemma":0.00090593495,"threshold_uncertainty_score":0.050622404},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28181845,0.008124995,0.16788535,0.012140725,0.0034540829,0.00008038508,0.00055275334,0.00051857636,0.5254246],"genre_scores_gemma":[0.9141915,0.003506327,0.030248167,0.0020971377,0.0020086046,0.0001617706,0.00041854908,0.00031524457,0.04705283],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992755,0.00028583597,0.00003082595,0.00011913451,0.00017120964,0.00011753428],"domain_scores_gemma":[0.997929,0.0011457606,0.00019084685,0.00014882346,0.00025952226,0.0003260395],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001273315,0.0008759738,0.0012352519,0.0031200186,0.0026561199,0.0037928051,0.0017120945,0.0017894479,0.01091152],"category_scores_gemma":[0.006030312,0.0004893025,0.0007426522,0.0018515193,0.0048600044,0.0070066745,0.0025586162,0.004509397,0.0019825187],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022343966,0.000006285148,0.0000754927,0.000023931327,0.0000024145502,0.000015721796,0.00006563437,0.0010730249,0.00009199731,0.9928906,0.0021192988,0.0036133023],"study_design_scores_gemma":[0.0000034685984,0.000005482546,0.00007246979,0.00001355541,0.0000020506911,0.000021671216,0.000028889788,0.002680899,0.00005053271,0.9945943,0.00252006,0.0000066741636],"about_ca_topic_score_codex":0.0020027042,"about_ca_topic_score_gemma":0.0015044207,"teacher_disagreement_score":0.01091152,"about_ca_system_score_codex":0.0019422374,"about_ca_system_score_gemma":0.000874107,"threshold_uncertainty_score":0.03650266},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06917256,0.075035356,0.1821572,0.037558686,0.0029776036,0.000045057954,0.00043343237,0.00040701908,0.6322131],"genre_scores_gemma":[0.8322745,0.03956354,0.02567802,0.0049574105,0.008760111,0.0000991458,0.00034504134,0.00031252118,0.08800969],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995035,0.00015336808,0.000016449323,0.00008078869,0.00019162528,0.000054275653],"domain_scores_gemma":[0.9986228,0.0008373901,0.000065353444,0.00016320663,0.00019823799,0.00011309079],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007968051,0.00042291952,0.00047469657,0.0022349036,0.0012884224,0.0028694975,0.0006643536,0.0007019707,0.010811052],"category_scores_gemma":[0.0033877639,0.0002321322,0.00036528622,0.0013953137,0.0065393364,0.007820054,0.0021905892,0.0029451894,0.0017356954],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000025403904,0.000002776509,0.000054141605,0.000020520283,0.0000018439268,0.000013309272,0.000094862204,0.0002365311,0.0000730179,0.9925769,0.0024311848,0.0044924538],"study_design_scores_gemma":[0.0000011071542,0.0000017962934,0.000060354218,0.000010359555,6.861488e-7,0.000013869176,0.00005145206,0.00039445,0.000036863825,0.98776245,0.011664163,0.0000024832457],"about_ca_topic_score_codex":0.0015527139,"about_ca_topic_score_gemma":0.000992703,"teacher_disagreement_score":0.010811052,"about_ca_system_score_codex":0.0018218367,"about_ca_system_score_gemma":0.00065859605,"threshold_uncertainty_score":0.03616661},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7405664,0.0017672635,0.13048735,0.0026882582,0.00028913518,0.000077352495,0.00054042554,0.0005003145,0.12308358],"genre_scores_gemma":[0.9768223,0.0002747737,0.011818777,0.00022937323,0.00013097329,0.00007908735,0.00019908707,0.000046916644,0.010398635],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990107,0.0002373606,0.000070726775,0.00021334164,0.0003408419,0.00012698396],"domain_scores_gemma":[0.99684614,0.0016107776,0.0003354673,0.00035863958,0.00039386036,0.00045513734],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010956023,0.00041495427,0.00069576106,0.0027457895,0.0022077102,0.0033148525,0.0009875774,0.0010000551,0.005510152],"category_scores_gemma":[0.005182726,0.0004130272,0.00070616056,0.0014465076,0.0038004355,0.004415227,0.0038054758,0.0016090255,0.0006150494],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002254365,0.000008381045,0.0002971436,0.000023302224,0.000004195098,0.00010372818,0.00027886147,0.00085843785,0.00048267722,0.99593323,0.0002914469,0.0016960305],"study_design_scores_gemma":[0.00001555238,0.000019832585,0.00027119037,0.000023387001,0.000007914796,0.0002026892,0.00019166032,0.005079396,0.00079384795,0.9891115,0.0042716875,0.000011424445],"about_ca_topic_score_codex":0.0008333431,"about_ca_topic_score_gemma":0.0005634771,"teacher_disagreement_score":0.005510152,"about_ca_system_score_codex":0.0025457116,"about_ca_system_score_gemma":0.0004731892,"threshold_uncertainty_score":0.018470526},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4951333,0.0020751462,0.2314806,0.003544147,0.00092530675,0.0001570602,0.001044098,0.0008780423,0.2647622],"genre_scores_gemma":[0.910487,0.0012525016,0.038068168,0.0008061533,0.00060773175,0.00014264164,0.0007460205,0.00028395694,0.04760583],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99881786,0.0002495215,0.00008666101,0.00028418438,0.00032181435,0.00023982723],"domain_scores_gemma":[0.9966702,0.001284051,0.00036271778,0.00060191273,0.0005972315,0.0004838523],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014270908,0.0007760566,0.00095224974,0.0031319372,0.0040594433,0.004874867,0.0008864259,0.0010378718,0.005770499],"category_scores_gemma":[0.0034622126,0.0008952778,0.0008480994,0.0024270364,0.0060883877,0.0092424,0.0021562807,0.0033777968,0.0012347221],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022213408,0.000020471542,0.00013700478,0.000015493635,0.000004644342,0.000062176056,0.00027102535,0.00007297951,0.0004363116,0.9960821,0.0007080656,0.0021675443],"study_design_scores_gemma":[0.00000651914,0.000008279035,0.00010558802,0.000007853121,0.000008523304,0.0001309995,0.000121701676,0.00027738756,0.0005165673,0.9938176,0.0049916217,0.0000072253947],"about_ca_topic_score_codex":0.0008727887,"about_ca_topic_score_gemma":0.0011864688,"teacher_disagreement_score":0.005770499,"about_ca_system_score_codex":0.0013744837,"about_ca_system_score_gemma":0.00097161595,"threshold_uncertainty_score":0.019304276},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7351159,0.0018529693,0.19056414,0.0025870437,0.0002936688,0.00004938422,0.00022625155,0.00019154185,0.069119215],"genre_scores_gemma":[0.97775877,0.0006263685,0.011930791,0.00016329043,0.0004968167,0.0000553813,0.000117384974,0.00007383199,0.008777512],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99915695,0.00026287523,0.00003485124,0.00013493832,0.00028621254,0.00012415783],"domain_scores_gemma":[0.9923786,0.0051715667,0.0007199437,0.00060898415,0.00050648936,0.0006143827],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020006723,0.00076223357,0.0014633191,0.0035882213,0.0017783104,0.0031632907,0.0018547535,0.0012328727,0.0050926907],"category_scores_gemma":[0.011075962,0.00080605946,0.0010425071,0.0016031463,0.005533716,0.00600462,0.0019887423,0.0030492956,0.000380954],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020031917,0.00001825359,0.00021984492,0.000018049637,0.000007812069,0.000059098104,0.00014454886,0.0015342989,0.00035971054,0.995417,0.00044580543,0.0017555412],"study_design_scores_gemma":[0.0000070190154,0.0000041561825,0.00018355898,0.000008101529,0.0000046503555,0.00006534364,0.000049511204,0.0074497107,0.00013045012,0.99172556,0.00036527668,0.0000066801067],"about_ca_topic_score_codex":0.0007051448,"about_ca_topic_score_gemma":0.000859814,"teacher_disagreement_score":0.0050926907,"about_ca_system_score_codex":0.0011180403,"about_ca_system_score_gemma":0.00050142035,"threshold_uncertainty_score":0.017036736},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40403157,0.003548896,0.107432574,0.02668256,0.0013761444,0.00006760915,0.00079428713,0.0011479752,0.45491835],"genre_scores_gemma":[0.96113175,0.0014447563,0.011367461,0.002574659,0.000821465,0.00006365803,0.0004564589,0.00018082125,0.021958862],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989292,0.00025722737,0.00003729167,0.00029432875,0.0002577821,0.00022410323],"domain_scores_gemma":[0.995178,0.0023576242,0.00020773236,0.0010048888,0.00074907026,0.0005026924],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001553727,0.00040618706,0.0007210864,0.0010390328,0.0033429863,0.0022656766,0.0012772657,0.0017198536,0.011586435],"category_scores_gemma":[0.0069128345,0.00043125803,0.0007046759,0.0012471557,0.005399643,0.006599087,0.002417059,0.002507391,0.0013542159],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027005473,0.00001854341,0.00066029275,0.000024374154,0.0000044256835,0.00006459805,0.00025120442,0.00071769045,0.00020201594,0.9857546,0.007373137,0.0049021295],"study_design_scores_gemma":[0.000012234229,0.000005487423,0.00021451896,0.000015740734,0.0000050495464,0.00006767446,0.000116040595,0.0027199376,0.00015896547,0.98836356,0.008315825,0.0000049807327],"about_ca_topic_score_codex":0.006789456,"about_ca_topic_score_gemma":0.005343152,"teacher_disagreement_score":0.011586435,"about_ca_system_score_codex":0.0021572514,"about_ca_system_score_gemma":0.0010632084,"threshold_uncertainty_score":0.038760483},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.070371196,0.0033260817,0.85224473,0.0013795741,0.0007323171,0.00028417012,0.0014949514,0.0007007291,0.069466196],"genre_scores_gemma":[0.66060895,0.003319394,0.27377415,0.0012665642,0.0010167515,0.00088264316,0.0024318427,0.0004771431,0.056222554],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99840647,0.00043059126,0.000070032605,0.00030524845,0.00048259404,0.00030504883],"domain_scores_gemma":[0.9957783,0.0020766242,0.0004525224,0.0007579817,0.0006341617,0.00030038712],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010842899,0.00111495,0.0011383253,0.0011338395,0.0012529346,0.0019357353,0.001988531,0.0014376027,0.009579293],"category_scores_gemma":[0.0058038943,0.00051554106,0.0008004706,0.0019525115,0.0019556708,0.0029733838,0.001726228,0.0024326805,0.0017644664],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013911059,0.00007106286,0.00047865094,0.000171177,0.00002500393,0.00012939035,0.00008398395,0.06031705,0.0017416407,0.9011746,0.010672624,0.024995876],"study_design_scores_gemma":[0.000083434315,0.00013118878,0.0003612968,0.000060496626,0.00002848842,0.00042957853,0.00006987425,0.35223675,0.0029585112,0.6180383,0.025540097,0.000061910825],"about_ca_topic_score_codex":0.0021482194,"about_ca_topic_score_gemma":0.0020487255,"teacher_disagreement_score":0.009579293,"about_ca_system_score_codex":0.0022629178,"about_ca_system_score_gemma":0.0016136641,"threshold_uncertainty_score":0.03204596},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35565457,0.0026895355,0.37287292,0.0071202223,0.0014314282,0.00013861149,0.0008104849,0.00047038303,0.2588117],"genre_scores_gemma":[0.91298693,0.0009949693,0.04479334,0.0016896047,0.0010416684,0.00017825108,0.00040036868,0.00015522461,0.03775967],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99908197,0.00016454647,0.000062161846,0.0003027676,0.00022601394,0.00016246247],"domain_scores_gemma":[0.9983215,0.00075897994,0.00015824498,0.0003425963,0.000254469,0.00016423942],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001069889,0.00060206914,0.0011471867,0.0023897942,0.0025400065,0.0023524638,0.0013610927,0.0015078369,0.007235024],"category_scores_gemma":[0.0037354664,0.0004414439,0.0015799272,0.0015257573,0.0038861209,0.009014425,0.0038809967,0.0027451173,0.0009843708],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001690779,0.000006507496,0.000090498674,0.000017216358,0.0000039471915,0.000026932159,0.00011090763,0.0003251206,0.0003521724,0.99622935,0.00071081985,0.0021095895],"study_design_scores_gemma":[0.000007518139,0.000012481458,0.0001293568,0.000010940225,0.0000060185616,0.000077726254,0.000039244715,0.0017173394,0.00037386533,0.99329644,0.0043202615,0.000008887846],"about_ca_topic_score_codex":0.0010020641,"about_ca_topic_score_gemma":0.0007381598,"teacher_disagreement_score":0.007235024,"about_ca_system_score_codex":0.0019248431,"about_ca_system_score_gemma":0.00077637174,"threshold_uncertainty_score":0.024203539},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8594813,0.00038384102,0.13477741,0.0004335183,0.00005091305,0.00007452973,0.00018262074,0.00028970884,0.004326196],"genre_scores_gemma":[0.97924346,0.00010672979,0.018706152,0.00015315085,0.000028821316,0.00006299587,0.00016963914,0.000058465146,0.0014705278],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982003,0.00049007527,0.00012560323,0.0005242397,0.00035047156,0.0003093148],"domain_scores_gemma":[0.9865676,0.0059110555,0.0021671578,0.0032790566,0.0007285027,0.0013466665],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019502474,0.0006432682,0.0013227855,0.0011063685,0.0012285735,0.0015058087,0.0015247108,0.0009978057,0.0040333476],"category_scores_gemma":[0.014318316,0.000821724,0.00076481,0.0007203975,0.0019023943,0.003918343,0.0034474486,0.00094027433,0.00063605484],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00347155,0.0004968914,0.04683886,0.0009868897,0.0006133286,0.0031626737,0.0026917818,0.13374573,0.12898932,0.5692569,0.007563366,0.10218279],"study_design_scores_gemma":[0.00022430831,0.0009022117,0.009570727,0.00016095054,0.00025358025,0.0038672125,0.0010169351,0.42417,0.046667296,0.5051424,0.007879406,0.00014499004],"about_ca_topic_score_codex":0.00063489133,"about_ca_topic_score_gemma":0.00074313226,"teacher_disagreement_score":0.0040333476,"about_ca_system_score_codex":0.0005837924,"about_ca_system_score_gemma":0.0005751114,"threshold_uncertainty_score":0.013492942},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5138979,0.0021755632,0.13206387,0.005829087,0.00036791,0.00007052805,0.00056481955,0.0007696461,0.3442607],"genre_scores_gemma":[0.9459149,0.00072094833,0.016236661,0.0005203104,0.00021844177,0.000089839785,0.00022999379,0.00008089935,0.035988055],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99950266,0.00016835902,0.00002264612,0.00011298337,0.00011919364,0.0000741953],"domain_scores_gemma":[0.998367,0.0008166835,0.00018742314,0.00020788927,0.00017890165,0.00024213312],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00096963556,0.00033085156,0.00060505094,0.0017171786,0.0018309052,0.002598297,0.00079072115,0.0008684497,0.010067137],"category_scores_gemma":[0.0036998806,0.000373555,0.00037518723,0.0014475088,0.0026478902,0.005687654,0.0019826584,0.0021378796,0.0009082772],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001818733,0.0000068907066,0.000095239186,0.000013961261,0.0000017737906,0.00001275407,0.0000809501,0.00027887846,0.00021382332,0.99635786,0.0008888501,0.0020309081],"study_design_scores_gemma":[0.000007919289,0.0000043812784,0.00012914144,0.0000066073544,0.000004332874,0.000040035804,0.000042176976,0.0016305629,0.00017001665,0.9957775,0.0021822557,0.000005163869],"about_ca_topic_score_codex":0.0008773843,"about_ca_topic_score_gemma":0.0015512272,"teacher_disagreement_score":0.010067137,"about_ca_system_score_codex":0.001246743,"about_ca_system_score_gemma":0.00067693833,"threshold_uncertainty_score":0.033677936},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.750827,0.0033790579,0.13065393,0.0032937366,0.00030601758,0.000042739066,0.0003794359,0.00033886486,0.1107792],"genre_scores_gemma":[0.96332276,0.001361785,0.021347778,0.0003600207,0.00035847386,0.00006751223,0.00029949617,0.000083275016,0.012798802],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99917966,0.00023259861,0.000050567472,0.00014908076,0.00021702172,0.00017095813],"domain_scores_gemma":[0.9955428,0.002796496,0.00065900484,0.00035394015,0.00022226051,0.00042543354],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010984202,0.000630732,0.0011725314,0.0034309,0.0030345528,0.0052600736,0.0013623909,0.0017095057,0.005910738],"category_scores_gemma":[0.008467753,0.0010647045,0.00066546415,0.003529652,0.0051640724,0.008898443,0.002494329,0.0027570562,0.00042437456],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031655785,0.000022774184,0.00021590179,0.000029735873,0.0000032434941,0.00005066073,0.0002960262,0.0016297076,0.00027171912,0.9931243,0.00075892813,0.0035654323],"study_design_scores_gemma":[0.000008364729,0.000004874006,0.00013597516,0.000013490638,0.0000042768024,0.000074544696,0.00012336975,0.0045655696,0.00016943149,0.99378407,0.0011109285,0.000005184766],"about_ca_topic_score_codex":0.0020046874,"about_ca_topic_score_gemma":0.0023610485,"teacher_disagreement_score":0.005910738,"about_ca_system_score_codex":0.0018341944,"about_ca_system_score_gemma":0.00051784894,"threshold_uncertainty_score":0.019773364},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8686571,0.00033986985,0.12097352,0.0010479736,0.000031415184,0.00007891927,0.0007642147,0.00033523358,0.007771664],"genre_scores_gemma":[0.97304577,0.00039875408,0.020825611,0.00020850246,0.000082258724,0.00016856147,0.00096895685,0.00011766859,0.004183884],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987858,0.00051794155,0.00006168721,0.00023524293,0.000250173,0.00014922764],"domain_scores_gemma":[0.98183423,0.012688766,0.0024660057,0.0010573418,0.00071866706,0.0012350671],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012280126,0.0005279009,0.00091166125,0.002509615,0.0009293752,0.0021358542,0.00153204,0.0012763329,0.0034477143],"category_scores_gemma":[0.012956291,0.0010132669,0.0006856158,0.001906327,0.0015681598,0.003663505,0.0015951967,0.0013102907,0.00032706067],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005196494,0.00023861679,0.009832525,0.00029570606,0.00009290139,0.0005610862,0.001038839,0.07754356,0.008480496,0.87430656,0.003521515,0.023568563],"study_design_scores_gemma":[0.000090368965,0.00005981449,0.0029580658,0.000039563667,0.000056257537,0.00049010495,0.0002368662,0.21902725,0.0022607828,0.7733238,0.0014308651,0.00002626265],"about_ca_topic_score_codex":0.0007978419,"about_ca_topic_score_gemma":0.0016982041,"teacher_disagreement_score":0.0034477143,"about_ca_system_score_codex":0.0011686962,"about_ca_system_score_gemma":0.000517862,"threshold_uncertainty_score":0.011533737},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.593955,0.0019377462,0.18887003,0.0041884826,0.0006811664,0.00011717776,0.00055003085,0.00047644327,0.20922394],"genre_scores_gemma":[0.9289153,0.0010307664,0.030609826,0.00060437154,0.00048827557,0.00017356074,0.00042220976,0.00024886263,0.037506822],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990115,0.00027515905,0.000059655853,0.00020125348,0.00027952818,0.00017287677],"domain_scores_gemma":[0.9956181,0.002677124,0.00050573173,0.0004613857,0.00031168672,0.0004259724],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010632621,0.00089051394,0.0011408547,0.0028659047,0.0031866627,0.0040349164,0.0025458666,0.002593101,0.011577308],"category_scores_gemma":[0.0097139105,0.0011719653,0.0011664813,0.0027573183,0.004693331,0.008806084,0.0037209361,0.004310261,0.0009157852],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001676259,0.000016991688,0.00013077454,0.000020174184,0.0000038804124,0.00010450067,0.000154036,0.0005916869,0.00019204398,0.9955942,0.0006976728,0.002477378],"study_design_scores_gemma":[0.0000055114933,0.0000025931297,0.000029782577,0.0000069175976,0.0000037400796,0.00006516562,0.000038017733,0.0012094611,0.00007866962,0.9978319,0.0007245703,0.0000036776416],"about_ca_topic_score_codex":0.0011753131,"about_ca_topic_score_gemma":0.001358702,"teacher_disagreement_score":0.011577308,"about_ca_system_score_codex":0.0012201116,"about_ca_system_score_gemma":0.0009192549,"threshold_uncertainty_score":0.038729966},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.050360244,0.008374037,0.8385422,0.008820491,0.00051895087,0.000053027943,0.00041234866,0.00022796718,0.09269064],"genre_scores_gemma":[0.7972079,0.007492596,0.16061974,0.002145177,0.0032455937,0.00029256972,0.0005337774,0.0002151332,0.028247528],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981635,0.0007257864,0.00010477055,0.000292913,0.0005702927,0.00014278243],"domain_scores_gemma":[0.995304,0.0028688035,0.00031341822,0.0004641325,0.0005944639,0.00045517163],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026912726,0.00085955276,0.0014280669,0.004772259,0.002541898,0.0052651437,0.0028938982,0.0018684942,0.0053194063],"category_scores_gemma":[0.0062504457,0.0008458453,0.0016483496,0.0041727005,0.00907631,0.014083489,0.0045204596,0.005192776,0.0005771041],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000001085071,0.0000024972642,0.000016698494,0.0000064788505,0.0000018956957,0.0000055416544,0.00003784333,0.00021428708,0.000040735165,0.9989274,0.00014876066,0.0005967641],"study_design_scores_gemma":[0.0000015875726,0.0000019446968,0.000018340546,0.0000041898193,0.0000013825943,0.000009748414,0.000015940393,0.0011513947,0.000020752634,0.9978695,0.0009033045,0.000002013081],"about_ca_topic_score_codex":0.0017173765,"about_ca_topic_score_gemma":0.0015331651,"teacher_disagreement_score":0.0053194063,"about_ca_system_score_codex":0.0035413424,"about_ca_system_score_gemma":0.0012795433,"threshold_uncertainty_score":0.02569431},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0737733,0.0042050923,0.6530944,0.019728113,0.00096820656,0.00010102365,0.0010886644,0.0009854082,0.24605581],"genre_scores_gemma":[0.8226587,0.0030462313,0.12151674,0.0062720436,0.0018934323,0.00039227013,0.00047708568,0.00037334987,0.043370105],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99861467,0.00034711204,0.000060217753,0.00040295452,0.00038974892,0.00018527372],"domain_scores_gemma":[0.99348724,0.004140724,0.00035972058,0.0008443963,0.00074798096,0.00041993157],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022220977,0.0008566884,0.00081827893,0.0014432404,0.0011719358,0.0018848098,0.001917616,0.0011405449,0.019265253],"category_scores_gemma":[0.007876341,0.0004683754,0.001026526,0.0014531694,0.004067715,0.0116639715,0.004802803,0.005020993,0.0017564754],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030510344,0.000027432887,0.0002321066,0.00008161123,0.000009689247,0.000060069295,0.00017195255,0.0008184482,0.0015591135,0.9868117,0.003378067,0.006819277],"study_design_scores_gemma":[0.000029976707,0.00008685744,0.000623011,0.000034280994,0.000023238726,0.00027866627,0.00009154372,0.01101046,0.0028725308,0.9586256,0.026286867,0.000036769656],"about_ca_topic_score_codex":0.0013142588,"about_ca_topic_score_gemma":0.0010420965,"teacher_disagreement_score":0.019265253,"about_ca_system_score_codex":0.0017947936,"about_ca_system_score_gemma":0.000985112,"threshold_uncertainty_score":0.064448714},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34137687,0.0041067987,0.58485484,0.0039394614,0.00034233442,0.00005112327,0.00028316313,0.00017632842,0.06486911],"genre_scores_gemma":[0.93492836,0.0016392601,0.048449658,0.0005456731,0.00042988837,0.0000855267,0.00020028907,0.000097299606,0.013624067],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99777263,0.00091506843,0.00011482855,0.00035677003,0.0005932771,0.00024745907],"domain_scores_gemma":[0.9881811,0.009164971,0.0007167704,0.00046395147,0.00087361276,0.000599519],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004313977,0.00072489725,0.0012872288,0.0022142816,0.0015836172,0.00273102,0.0012401083,0.0012020178,0.004575267],"category_scores_gemma":[0.015938573,0.0005556319,0.0013482575,0.0023411012,0.0048350347,0.0073129307,0.0040568803,0.0029458029,0.00035863198],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023128014,0.000012606085,0.00031281175,0.000034464516,0.000013907949,0.00007229011,0.00013650833,0.0053022737,0.0002830442,0.9893448,0.00046848925,0.0039956174],"study_design_scores_gemma":[0.0000054775437,0.00001766211,0.00028069667,0.000020809266,0.000007992773,0.00012794854,0.00008168038,0.035732888,0.00028954537,0.9619577,0.0014688194,0.000008712249],"about_ca_topic_score_codex":0.0016386324,"about_ca_topic_score_gemma":0.0009492583,"teacher_disagreement_score":0.004575267,"about_ca_system_score_codex":0.0027080611,"about_ca_system_score_gemma":0.00085224665,"threshold_uncertainty_score":0.02281475},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.57394683,0.0009959337,0.082247436,0.0026967023,0.00037923714,0.00007354932,0.00031359436,0.0006247679,0.33872196],"genre_scores_gemma":[0.96862596,0.00022294342,0.01402125,0.0003413343,0.00009261556,0.000078409095,0.00012602023,0.00010522719,0.016386196],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99918133,0.00022163236,0.000034730518,0.00013154383,0.00018056032,0.00025017207],"domain_scores_gemma":[0.9984276,0.00060110237,0.00020493123,0.00028161792,0.00012718112,0.00035743808],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063398253,0.0006185613,0.00078174705,0.0014695752,0.0024958325,0.0047988365,0.0016771395,0.002203175,0.014511781],"category_scores_gemma":[0.0024914297,0.0005857786,0.00078815105,0.0011224642,0.0042313645,0.0033566377,0.0022483284,0.0027470787,0.0013883971],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000053172465,0.00002786132,0.00026792169,0.00002952609,0.000009235205,0.00041309977,0.0001882544,0.0012823795,0.0012447735,0.99198204,0.0015137114,0.0029880847],"study_design_scores_gemma":[0.000020246696,0.0000106154475,0.00015105295,0.00001430725,0.0000070062188,0.00030639066,0.0001795015,0.0052840267,0.00077682355,0.9917441,0.0014921249,0.000013712201],"about_ca_topic_score_codex":0.001374076,"about_ca_topic_score_gemma":0.0017483576,"teacher_disagreement_score":0.014511781,"about_ca_system_score_codex":0.00079363456,"about_ca_system_score_gemma":0.00069941516,"threshold_uncertainty_score":0.04854679},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46702963,0.0025916535,0.3070823,0.0076704784,0.0014711568,0.00020150842,0.0027674597,0.0014532176,0.20973267],"genre_scores_gemma":[0.9483067,0.0010275384,0.018858181,0.00060634076,0.00087522494,0.00018355635,0.0010353695,0.00033003863,0.028777074],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99727935,0.0007091279,0.00023393045,0.0007316209,0.00063558447,0.00041039824],"domain_scores_gemma":[0.9923159,0.0038334222,0.00088905194,0.0008596737,0.0010715906,0.0010303033],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017464678,0.0010232009,0.0012499182,0.004298947,0.0029255257,0.008671496,0.0017512109,0.002180713,0.012485747],"category_scores_gemma":[0.010199442,0.0008633647,0.0012593,0.0034373738,0.0043717576,0.014551447,0.0034459974,0.0036228967,0.0013939396],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002770423,0.000021163782,0.00021686639,0.000023664774,0.000006977737,0.000082970655,0.0001875448,0.00019059198,0.0003415158,0.9963966,0.00062175945,0.0018827149],"study_design_scores_gemma":[0.0000084448875,0.000005884534,0.00013149745,0.000009980999,0.0000071400946,0.00011992028,0.000087250846,0.0015362155,0.00036013333,0.9958605,0.0018638675,0.000009121848],"about_ca_topic_score_codex":0.00063845475,"about_ca_topic_score_gemma":0.00045572015,"teacher_disagreement_score":0.012485747,"about_ca_system_score_codex":0.0019488584,"about_ca_system_score_gemma":0.0007663735,"threshold_uncertainty_score":0.041768968},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20061381,0.0032201349,0.65368974,0.0042652674,0.0006302893,0.00008504987,0.0005357359,0.0012079111,0.13575204],"genre_scores_gemma":[0.9176647,0.0011110642,0.056085844,0.0009865117,0.0006640437,0.00013601643,0.00028245148,0.0006124982,0.022456855],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99582326,0.0011354694,0.00022045439,0.0009272877,0.0012985473,0.0005949856],"domain_scores_gemma":[0.990742,0.0052848584,0.00062284747,0.0014984993,0.0013386154,0.0005130344],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0043131663,0.0007612986,0.0011656027,0.00243485,0.0018342886,0.00353697,0.0022514767,0.001897217,0.011731292],"category_scores_gemma":[0.015435722,0.0005766208,0.0016771044,0.0014490003,0.0043041324,0.014372503,0.0055226847,0.0052227806,0.0022647185],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000058312857,0.000018930603,0.00034796348,0.000055443033,0.000008361327,0.00018453713,0.0002495409,0.0008477669,0.0012421766,0.9882095,0.001250421,0.0075271116],"study_design_scores_gemma":[0.000015654532,0.00004292994,0.0002176566,0.000028213813,0.000016721759,0.00033154016,0.000113318776,0.0066479594,0.0026589755,0.9834404,0.0064618476,0.00002479517],"about_ca_topic_score_codex":0.00059984135,"about_ca_topic_score_gemma":0.00028906437,"teacher_disagreement_score":0.011731292,"about_ca_system_score_codex":0.001197283,"about_ca_system_score_gemma":0.0005484016,"threshold_uncertainty_score":0.03924507},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.53079075,0.008358951,0.18940935,0.007039738,0.00096574414,0.000054980253,0.0005216272,0.0008462042,0.2620126],"genre_scores_gemma":[0.9703066,0.0011997006,0.01428323,0.00052581227,0.0003596211,0.00006029092,0.00014961274,0.00013656788,0.012978607],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987921,0.00024004256,0.000063730695,0.00027618642,0.00038370068,0.00024422063],"domain_scores_gemma":[0.9934685,0.0044523054,0.00049781206,0.0007983984,0.00028722952,0.00049574743],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017094527,0.00095929665,0.00094794814,0.0027740125,0.0025517023,0.0038956553,0.0016617388,0.0013782871,0.0081176255],"category_scores_gemma":[0.013701381,0.00050956605,0.0009278785,0.0018166561,0.004749841,0.010655859,0.0042443355,0.00290248,0.0008504802],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003913698,0.000012640241,0.00031857987,0.000040159342,0.000004105079,0.00006188706,0.00019707752,0.0014377198,0.00025367498,0.9911308,0.00089851837,0.005605683],"study_design_scores_gemma":[0.000003790103,0.0000062055183,0.0001416747,0.00001906337,0.0000058847154,0.00010429605,0.00006515051,0.0027671321,0.00024759292,0.99413574,0.0024978973,0.000005561296],"about_ca_topic_score_codex":0.0010383748,"about_ca_topic_score_gemma":0.00096948165,"teacher_disagreement_score":0.0081176255,"about_ca_system_score_codex":0.0019809976,"about_ca_system_score_gemma":0.00067505235,"threshold_uncertainty_score":0.027156115},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.83892757,0.003900884,0.07946689,0.0042183395,0.0001738638,0.00004820317,0.0002417172,0.00024558342,0.07277701],"genre_scores_gemma":[0.9846629,0.0013572538,0.007559711,0.00029214128,0.00031500403,0.00007057834,0.00014524184,0.000066713415,0.005530415],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99924064,0.00034588575,0.00002736804,0.000089281624,0.00018544978,0.000111374495],"domain_scores_gemma":[0.99058366,0.0068119476,0.00075621996,0.00035021355,0.0005713983,0.00092654803],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00182342,0.0006989767,0.0011596411,0.004938236,0.0023433608,0.0029510832,0.0022247392,0.0018619151,0.0053809555],"category_scores_gemma":[0.013537483,0.0008458731,0.0005029713,0.0021497859,0.005590243,0.006451684,0.0024893414,0.002265199,0.0003850996],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029975592,0.000018361477,0.00048692114,0.000040513947,0.0000055200812,0.000049357197,0.00024767345,0.0025356186,0.0003702925,0.99355185,0.000703344,0.0019605507],"study_design_scores_gemma":[0.000009475466,0.000006087772,0.00029809738,0.000020938347,0.0000054192515,0.00006366665,0.00008764791,0.011249343,0.00013908236,0.98756707,0.000544328,0.0000088465795],"about_ca_topic_score_codex":0.002085216,"about_ca_topic_score_gemma":0.0016375047,"teacher_disagreement_score":0.0053809555,"about_ca_system_score_codex":0.0018855804,"about_ca_system_score_gemma":0.00065727334,"threshold_uncertainty_score":0.01800108},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48311412,0.0069881147,0.23845445,0.009693202,0.0007357022,0.00009724026,0.0007827436,0.00087638013,0.2592581],"genre_scores_gemma":[0.9420362,0.0019326466,0.028840492,0.0007692308,0.0005298273,0.00012081386,0.0003265828,0.00015098263,0.025293263],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989472,0.00046451474,0.000060992814,0.0001857833,0.00020508716,0.00013645357],"domain_scores_gemma":[0.99602216,0.0026456392,0.00032350488,0.0003476919,0.00027215198,0.0003888476],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002760048,0.00080437865,0.0012958958,0.0035220427,0.0026390825,0.0035403783,0.001966302,0.001844804,0.00848483],"category_scores_gemma":[0.0065408205,0.00076117634,0.0013018623,0.002411917,0.0057882867,0.010779796,0.0033434296,0.004193726,0.0007864063],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012145714,0.0000057572233,0.00009993026,0.00001530723,0.0000030735307,0.000026713346,0.00012449683,0.00019194488,0.000098584605,0.9980076,0.0003794032,0.0010350662],"study_design_scores_gemma":[0.00001724948,0.0000074943864,0.000119809825,0.000008051007,0.0000087398685,0.000047396705,0.000060297676,0.0008329062,0.00011864211,0.99731535,0.0014578928,0.0000061333],"about_ca_topic_score_codex":0.0010054758,"about_ca_topic_score_gemma":0.0009375937,"teacher_disagreement_score":0.00848483,"about_ca_system_score_codex":0.0020518485,"about_ca_system_score_gemma":0.0007067962,"threshold_uncertainty_score":0.028384626},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3049116,0.009976549,0.53732145,0.006258981,0.0017212207,0.000114930765,0.0011082079,0.0016084568,0.13697863],"genre_scores_gemma":[0.92752874,0.00194425,0.057081576,0.0011457748,0.0012542569,0.0001816179,0.0003852287,0.0005509049,0.009927664],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99824893,0.000525336,0.00007762693,0.00038558178,0.0004758229,0.0002868645],"domain_scores_gemma":[0.9929817,0.0042006485,0.00031039002,0.0010473686,0.00057920563,0.00088066753],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038000022,0.002064128,0.0027247209,0.0062931934,0.0030702369,0.004952425,0.0048042615,0.0029471912,0.007476075],"category_scores_gemma":[0.011627035,0.0011214382,0.0018977644,0.0024097254,0.006022303,0.010300602,0.006842462,0.006983678,0.001134109],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015358081,0.00003837265,0.00055394985,0.00016945055,0.000032777203,0.0000893705,0.00019387105,0.0052559334,0.0029173966,0.9836309,0.0020840687,0.0048804297],"study_design_scores_gemma":[0.000015363617,0.000028354634,0.00065361924,0.00007562353,0.000044434022,0.000104086044,0.00006652676,0.05166646,0.0019411148,0.9422235,0.003112657,0.00006829945],"about_ca_topic_score_codex":0.0013787997,"about_ca_topic_score_gemma":0.0015259098,"teacher_disagreement_score":0.007476075,"about_ca_system_score_codex":0.0028222653,"about_ca_system_score_gemma":0.0008404356,"threshold_uncertainty_score":0.02500993},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35804343,0.008038118,0.29122883,0.009690968,0.0007357367,0.000117187716,0.0017243148,0.0009381283,0.32948333],"genre_scores_gemma":[0.9105477,0.0022959516,0.02912366,0.0016955665,0.0017137905,0.00026068336,0.0016218306,0.00041132595,0.052329488],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99696404,0.0004776412,0.00012478507,0.00055850705,0.0013360553,0.0005389135],"domain_scores_gemma":[0.9911343,0.0061738403,0.00043199238,0.0006806864,0.000872706,0.00070647197],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002742573,0.00095798145,0.0015276326,0.0034239502,0.002665969,0.0046061426,0.0021297764,0.001231861,0.016141389],"category_scores_gemma":[0.011636355,0.0006272843,0.0011197723,0.0029851967,0.0029761065,0.008930102,0.005073734,0.003963456,0.0021890637],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001659284,0.00006917703,0.0014953096,0.00020391041,0.000040432504,0.00020281794,0.00038027926,0.004141283,0.0024849027,0.96540916,0.0064380155,0.018968893],"study_design_scores_gemma":[0.00002629741,0.00006666961,0.0010461959,0.000060744536,0.000041560023,0.00029980345,0.00007230074,0.0321617,0.001459729,0.9544683,0.010269424,0.000027163402],"about_ca_topic_score_codex":0.0011349028,"about_ca_topic_score_gemma":0.0010271363,"teacher_disagreement_score":0.016141389,"about_ca_system_score_codex":0.0029406967,"about_ca_system_score_gemma":0.00074727484,"threshold_uncertainty_score":0.05399829},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5693979,0.0045015165,0.31320038,0.0040295264,0.00023902813,0.00017681303,0.0008814579,0.00045772214,0.10711561],"genre_scores_gemma":[0.93073714,0.001719376,0.046826255,0.0002915414,0.00017804834,0.0002598055,0.00048591464,0.000111292364,0.019390637],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989023,0.00032070393,0.00008645139,0.00024330695,0.00031792215,0.00012928183],"domain_scores_gemma":[0.9955995,0.003073211,0.00032916828,0.00025541236,0.0003475341,0.0003952333],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010611103,0.00063977594,0.0011578089,0.0037057577,0.0034078523,0.005275823,0.001533593,0.001761764,0.008496982],"category_scores_gemma":[0.0064954874,0.0010091272,0.0010516649,0.00496887,0.0052666296,0.009887285,0.0035816617,0.0030144393,0.00049275055],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015135649,0.000008292939,0.00016983267,0.000033137545,0.000004910884,0.00003160599,0.00034024112,0.000846136,0.00015105418,0.9952958,0.00027706358,0.002826807],"study_design_scores_gemma":[0.0000045403917,0.0000032815435,0.000047938698,0.0000073104507,0.0000046833625,0.000028719896,0.00006865827,0.0012791231,0.0000816745,0.99746335,0.0010071063,0.0000035072885],"about_ca_topic_score_codex":0.0028222115,"about_ca_topic_score_gemma":0.0031180705,"teacher_disagreement_score":0.008496982,"about_ca_system_score_codex":0.0023524156,"about_ca_system_score_gemma":0.0011172013,"threshold_uncertainty_score":0.028425217},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.87643415,0.00083005417,0.08205655,0.0010858114,0.000052516,0.000037757916,0.0007926621,0.000455649,0.038254824],"genre_scores_gemma":[0.9794408,0.00037750736,0.015988534,0.00010152772,0.00006709401,0.00005908977,0.0002951509,0.00015406971,0.0035161627],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99926347,0.0001579243,0.000039787654,0.00022378647,0.00016150862,0.0001535339],"domain_scores_gemma":[0.99065685,0.0053252736,0.0012689333,0.00081441144,0.00053396757,0.0014006405],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017942659,0.0006605022,0.0008631434,0.0036028274,0.0020166382,0.0051600323,0.0022758436,0.0014182917,0.0044672666],"category_scores_gemma":[0.009312269,0.00084103795,0.0005080826,0.002454057,0.0025684494,0.0062140767,0.001532312,0.0014592571,0.0004907355],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00095280795,0.00016011995,0.011646086,0.00034142833,0.00010463355,0.0002203811,0.0012779945,0.04364716,0.022589028,0.8878155,0.004655701,0.026589235],"study_design_scores_gemma":[0.000052640506,0.000080571815,0.0047401767,0.00009062156,0.0000813698,0.00038264747,0.0004993547,0.117469355,0.009078856,0.8641277,0.0033355555,0.00006118],"about_ca_topic_score_codex":0.0015334965,"about_ca_topic_score_gemma":0.0025951145,"teacher_disagreement_score":0.0051600323,"about_ca_system_score_codex":0.0036011264,"about_ca_system_score_gemma":0.0012242532,"threshold_uncertainty_score":0.026128054},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.76813245,0.0011595339,0.2121719,0.001298872,0.00007583395,0.000047418354,0.00027659212,0.0003173186,0.016520072],"genre_scores_gemma":[0.9841282,0.0002517996,0.012986303,0.000103415834,0.000042278203,0.00003637702,0.000117660304,0.000069638525,0.0022644445],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988317,0.00040848294,0.000031467447,0.00024735634,0.00027076842,0.00021029447],"domain_scores_gemma":[0.9872938,0.007736663,0.0013852816,0.0016924705,0.000882499,0.0010092594],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014977582,0.0004580978,0.0004662579,0.0018349777,0.0015790671,0.0021226741,0.0021579415,0.0010098366,0.0027151583],"category_scores_gemma":[0.0142621705,0.00051573373,0.00048280464,0.001438188,0.0032203284,0.0035731243,0.0019361004,0.0017672704,0.00023964254],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018788381,0.00004743217,0.00461535,0.00009756668,0.000051814357,0.00015122726,0.00056884665,0.103394546,0.008214234,0.87022096,0.0020344923,0.010415631],"study_design_scores_gemma":[0.00003161126,0.00003029265,0.0019375834,0.000019965435,0.00001316231,0.00018238636,0.00011603525,0.27448538,0.0028098735,0.7181676,0.0021734443,0.000032656197],"about_ca_topic_score_codex":0.0028367809,"about_ca_topic_score_gemma":0.0022233902,"teacher_disagreement_score":0.0028367809,"about_ca_system_score_codex":0.0027748581,"about_ca_system_score_gemma":0.0007130448,"threshold_uncertainty_score":0.020133138},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6048396,0.00056036515,0.3740199,0.001227637,0.000045404275,0.00008369686,0.0005119466,0.00043455703,0.01827684],"genre_scores_gemma":[0.9359571,0.00040507267,0.05746158,0.00026459727,0.00007551312,0.00021149276,0.0006377482,0.000089135625,0.0048978236],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982127,0.0006355765,0.00011774275,0.00039292788,0.00045315048,0.00018795133],"domain_scores_gemma":[0.96909684,0.023754768,0.0015815181,0.0027713843,0.0016466168,0.0011488695],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024303647,0.00041133724,0.00080841547,0.0020695825,0.0009586666,0.002648127,0.001770796,0.0012471208,0.0036508057],"category_scores_gemma":[0.034902558,0.00074275734,0.0006673625,0.0013920798,0.0022243666,0.005235103,0.002481494,0.0014297822,0.00042882422],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031742398,0.000113684095,0.016797747,0.00034444995,0.00007785292,0.00034329624,0.0006884391,0.07417329,0.008395996,0.8557186,0.0040776515,0.03895166],"study_design_scores_gemma":[0.000035012275,0.00005944973,0.0023879854,0.000059039932,0.000031245545,0.0005054996,0.00012784102,0.309654,0.0037987402,0.6808962,0.0024188093,0.000026214408],"about_ca_topic_score_codex":0.00061174075,"about_ca_topic_score_gemma":0.0009448436,"teacher_disagreement_score":0.0036508057,"about_ca_system_score_codex":0.0015884057,"about_ca_system_score_gemma":0.00069795665,"threshold_uncertainty_score":0.012853146},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31599125,0.0016225533,0.61333185,0.0016683195,0.00034657062,0.00012583562,0.0010063226,0.00097478007,0.06493249],"genre_scores_gemma":[0.9157748,0.0011328699,0.06504897,0.00026604132,0.0004039666,0.00022252931,0.0007666107,0.00032997376,0.016054224],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9967704,0.00092246244,0.000290795,0.0007443748,0.00085057964,0.0004214668],"domain_scores_gemma":[0.9877144,0.0068762144,0.0014316093,0.0011927448,0.0012487896,0.0015362441],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029100704,0.0008191312,0.0010572497,0.0039954497,0.0026237047,0.0075332,0.0018791578,0.0016045719,0.006447183],"category_scores_gemma":[0.011022357,0.0011216283,0.0016604838,0.0037271848,0.0048741777,0.0143313045,0.0035744794,0.003304165,0.00077219703],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023758026,0.000018187893,0.0003788319,0.000024027991,0.0000106478055,0.00012964127,0.00026093348,0.00041941824,0.00048032025,0.9960639,0.00028497138,0.0019053397],"study_design_scores_gemma":[0.000009602725,0.000011315962,0.00022904317,0.00001349313,0.000014460023,0.00015630071,0.000108034576,0.0033027101,0.00062972365,0.9934881,0.0020259887,0.0000111709405],"about_ca_topic_score_codex":0.00093700475,"about_ca_topic_score_gemma":0.00093906705,"teacher_disagreement_score":0.0075332,"about_ca_system_score_codex":0.0018055127,"about_ca_system_score_gemma":0.00084506144,"threshold_uncertainty_score":0.021568},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.042078275,0.01491443,0.27386564,0.023471061,0.003923781,0.000082446546,0.0008159998,0.000777581,0.6400708],"genre_scores_gemma":[0.69081837,0.012000073,0.10802886,0.0070114452,0.006536813,0.00032904552,0.00060044666,0.0011308013,0.17354405],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99768186,0.00096779765,0.00008624924,0.00045870757,0.00061820314,0.00018718737],"domain_scores_gemma":[0.996738,0.0015640905,0.00025236266,0.00060254754,0.00052798825,0.00031492522],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00354128,0.0012486664,0.0015503375,0.0038006378,0.002262189,0.0035379601,0.0024666474,0.0021007333,0.018113527],"category_scores_gemma":[0.009663516,0.00051934744,0.0016651447,0.0026848912,0.0053122127,0.009250031,0.0053810296,0.0053820168,0.0038878212],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007811961,0.0000044584235,0.000038397175,0.000023081795,0.000004817681,0.000018852848,0.000066558576,0.00022089561,0.00010470524,0.994736,0.0023045086,0.002469826],"study_design_scores_gemma":[0.0000059188674,0.0000055760115,0.00007588269,0.0000124607695,0.0000063043103,0.000043239295,0.000024595854,0.0011770709,0.00009268632,0.98791015,0.010636751,0.000009475785],"about_ca_topic_score_codex":0.0026429498,"about_ca_topic_score_gemma":0.0020553833,"teacher_disagreement_score":0.018113527,"about_ca_system_score_codex":0.0026922992,"about_ca_system_score_gemma":0.0008872578,"threshold_uncertainty_score":0.06059575},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7871278,0.0013998592,0.12547404,0.0027895868,0.00012645051,0.00009336075,0.00080948434,0.00043533143,0.08174413],"genre_scores_gemma":[0.96445215,0.0010289828,0.021082858,0.00047930656,0.000249933,0.00026248817,0.00066245085,0.0001592296,0.011622644],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99757165,0.00070631533,0.00012020942,0.000602188,0.00045871266,0.00054098136],"domain_scores_gemma":[0.98245066,0.011771133,0.0021603485,0.0012056961,0.0005980512,0.0018141923],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020578983,0.0014136389,0.0018774406,0.0048346883,0.0047513517,0.0077199475,0.0028937953,0.002720253,0.0043506343],"category_scores_gemma":[0.010188227,0.0014043113,0.0016262742,0.004997177,0.009412052,0.014265563,0.005473885,0.0037342366,0.0007895462],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011284399,0.00004691019,0.0006816588,0.00006842834,0.000015290776,0.00018446881,0.0005903537,0.0024103606,0.0010796122,0.99096406,0.0007975458,0.0030483531],"study_design_scores_gemma":[0.000018354287,0.000011138448,0.00029009394,0.000033801996,0.000015743168,0.00014370994,0.00020125942,0.005643733,0.00044546995,0.9925264,0.0006546358,0.000015536549],"about_ca_topic_score_codex":0.001668123,"about_ca_topic_score_gemma":0.0017747529,"teacher_disagreement_score":0.0077199475,"about_ca_system_score_codex":0.0030999342,"about_ca_system_score_gemma":0.0012087419,"threshold_uncertainty_score":0.022491693},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7683966,0.0020189236,0.16061452,0.0033745423,0.00028082792,0.00005438302,0.0001772694,0.0002127383,0.06487012],"genre_scores_gemma":[0.97153926,0.0007300364,0.011989655,0.00030177453,0.0005469947,0.00011722508,0.00019168643,0.000065502565,0.014517775],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991303,0.00030014163,0.000047629273,0.00016568,0.00019998226,0.00015628242],"domain_scores_gemma":[0.995767,0.0022911932,0.00064574595,0.00033736462,0.0002782027,0.0006804675],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017309677,0.00079061487,0.0011231042,0.0037502225,0.0035385704,0.0051774355,0.0011384403,0.0018886549,0.0040052473],"category_scores_gemma":[0.0052549215,0.0006704486,0.0012377405,0.0022303276,0.009234195,0.005755808,0.0032316302,0.0035957408,0.00049051666],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011448245,0.000010227641,0.00016551942,0.000006673914,0.0000034414502,0.000029128725,0.00022272648,0.0002740288,0.00015683669,0.99826485,0.00015773758,0.00069734216],"study_design_scores_gemma":[0.000008303751,0.0000067505152,0.00011569649,0.0000037171817,0.000004525452,0.000037685695,0.00009829489,0.0010666554,0.000077576704,0.9981742,0.00040167166,0.000004806846],"about_ca_topic_score_codex":0.0009996702,"about_ca_topic_score_gemma":0.0011882376,"teacher_disagreement_score":0.0051774355,"about_ca_system_score_codex":0.0014285669,"about_ca_system_score_gemma":0.0008154744,"threshold_uncertainty_score":0.013398886},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9625665,0.00078694086,0.0157095,0.0014101224,0.000052042316,0.00004699475,0.0020216645,0.00021700084,0.017189166],"genre_scores_gemma":[0.98427665,0.00052681833,0.00988875,0.0002524481,0.00012391595,0.00011350191,0.0013995814,0.00018061778,0.0032377087],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988667,0.0003544766,0.00008440178,0.00026112076,0.00021925336,0.00021412616],"domain_scores_gemma":[0.9697706,0.023065303,0.0027341268,0.0012278218,0.0010887446,0.0021134145],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018325923,0.00086213247,0.0015259302,0.002405345,0.0018915848,0.0048087663,0.0026899634,0.0023068178,0.0075300243],"category_scores_gemma":[0.015946988,0.0013442911,0.00091192964,0.0022712196,0.0022069025,0.007633539,0.00164208,0.0013504403,0.00049820996],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0047992663,0.00037548246,0.027518904,0.0014753845,0.00049175,0.0015016127,0.002172358,0.08631935,0.05973198,0.7630286,0.016145105,0.036440175],"study_design_scores_gemma":[0.00030429568,0.00021905832,0.011490853,0.00019676264,0.0002993921,0.0016630858,0.0010170884,0.1377573,0.017825872,0.82408494,0.005038382,0.000102938415],"about_ca_topic_score_codex":0.0010959567,"about_ca_topic_score_gemma":0.001352613,"teacher_disagreement_score":0.0075300243,"about_ca_system_score_codex":0.0017050202,"about_ca_system_score_gemma":0.00076012424,"threshold_uncertainty_score":0.025190473},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7824612,0.0025149856,0.107293315,0.0015551372,0.00019731435,0.00007347801,0.00051615795,0.00051196857,0.104876414],"genre_scores_gemma":[0.9855033,0.00040473227,0.0095762685,0.00011934987,0.00017362836,0.00012042424,0.00025525637,0.000042329004,0.003804709],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99743015,0.0005634493,0.00015640171,0.0005009,0.00085698586,0.0004922565],"domain_scores_gemma":[0.9900767,0.0067163245,0.00085329224,0.0006922762,0.0006290576,0.0010323222],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017318364,0.0005045961,0.0008185628,0.0024262236,0.0015641996,0.0034369556,0.00074381696,0.0013224398,0.005470494],"category_scores_gemma":[0.012982644,0.0005586836,0.00069072674,0.0010742239,0.0029821086,0.004456845,0.0017439256,0.0017450749,0.0003838388],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013480599,0.00005138718,0.0029939178,0.00008564305,0.000018581,0.00018328159,0.0003540002,0.0054325606,0.0024027608,0.96913314,0.0019356254,0.01727425],"study_design_scores_gemma":[0.000045589793,0.000076019045,0.0025450315,0.000085246735,0.000019009167,0.00077700353,0.00015982406,0.03576652,0.0024995934,0.94703126,0.010952759,0.000042110983],"about_ca_topic_score_codex":0.00046146486,"about_ca_topic_score_gemma":0.0003901727,"teacher_disagreement_score":0.005470494,"about_ca_system_score_codex":0.00251849,"about_ca_system_score_gemma":0.00045142617,"threshold_uncertainty_score":0.018300593},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033488885,0.00264218,0.7723082,0.0070443787,0.0016655362,0.00022231496,0.0010476698,0.0016920567,0.17988884],"genre_scores_gemma":[0.638892,0.003938765,0.28337616,0.0060092453,0.0018901951,0.0007091914,0.00093933323,0.000740437,0.0635047],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99919087,0.0001056002,0.000038962196,0.00016696568,0.00040309262,0.00009449471],"domain_scores_gemma":[0.9984541,0.00067691685,0.00008367342,0.00020664388,0.0004403961,0.00013825271],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011984679,0.0009810826,0.00088126684,0.0020527206,0.0016487301,0.0013837531,0.0018277864,0.0011101352,0.024823427],"category_scores_gemma":[0.0044334074,0.0005829975,0.0015554026,0.0014102947,0.0028801512,0.004180614,0.0038946597,0.0029468618,0.0036223272],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024461193,0.000043174205,0.00019783198,0.00016883537,0.000019892974,0.00016330177,0.00014151417,0.0008519207,0.002819814,0.9646529,0.0107943555,0.02012214],"study_design_scores_gemma":[0.000027003369,0.000030182147,0.0004714814,0.000047517657,0.00002220618,0.00041646737,0.000046601694,0.0047394945,0.002501558,0.9694417,0.02222421,0.000031533516],"about_ca_topic_score_codex":0.0014560678,"about_ca_topic_score_gemma":0.0013828363,"teacher_disagreement_score":0.024823427,"about_ca_system_score_codex":0.0012203621,"about_ca_system_score_gemma":0.0008609007,"threshold_uncertainty_score":0.08304262},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8387796,0.0022605218,0.10187229,0.002491376,0.00009618378,0.00004458596,0.00043194892,0.00024527893,0.053778235],"genre_scores_gemma":[0.9883477,0.000942929,0.005887813,0.00016498391,0.00013739025,0.000056621997,0.00017637356,0.000048175007,0.004238009],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99937975,0.00023122404,0.00002680043,0.000097106255,0.00016959081,0.000095406765],"domain_scores_gemma":[0.98751897,0.009246206,0.0008045966,0.00051086623,0.0007612495,0.0011580414],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013209507,0.0004850446,0.0009880131,0.0051820423,0.0018915613,0.003560754,0.0016434814,0.0013684592,0.004638573],"category_scores_gemma":[0.015464155,0.0009124759,0.0003810835,0.0024760175,0.0040803775,0.006068021,0.0019639723,0.0016676014,0.00025965093],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024310257,0.000017793365,0.00085760996,0.000042048647,0.0000065905624,0.00005059725,0.00022636162,0.0028375855,0.00032260097,0.99236816,0.0007905629,0.0024557794],"study_design_scores_gemma":[0.000009949446,0.0000058721394,0.00052216614,0.000024033581,0.000008886822,0.000107023174,0.00011189223,0.017023789,0.00022224263,0.9810647,0.0008897618,0.000009799979],"about_ca_topic_score_codex":0.0019155198,"about_ca_topic_score_gemma":0.0017031506,"teacher_disagreement_score":0.0051820423,"about_ca_system_score_codex":0.0018063043,"about_ca_system_score_gemma":0.0005508746,"threshold_uncertainty_score":0.015517592},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3729303,0.0021053366,0.41531748,0.0106828,0.0008223516,0.00021541574,0.0013444868,0.0018896338,0.19469216],"genre_scores_gemma":[0.9138131,0.0018605168,0.04063394,0.0011730117,0.0009573491,0.00039149175,0.0017102836,0.00044620733,0.03901413],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973966,0.00062106684,0.0001658406,0.00073870394,0.00069819903,0.00037959407],"domain_scores_gemma":[0.9846506,0.010224036,0.00118368,0.0014333604,0.0011383735,0.0013699927],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002638799,0.00086799834,0.002036114,0.0041197054,0.0051238188,0.0060851397,0.0021163076,0.002648181,0.010982373],"category_scores_gemma":[0.013174727,0.0010906289,0.002001478,0.004156905,0.0076891785,0.022078125,0.006667864,0.008872965,0.0013240088],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018979545,0.00001898601,0.00016018124,0.00002526486,0.0000045264974,0.00005727977,0.00026714714,0.00038284692,0.000102082726,0.99574983,0.0009370957,0.002275715],"study_design_scores_gemma":[0.000010299579,0.0000041138865,0.00006033763,0.000005727055,0.000005209354,0.000052299303,0.000056251745,0.0008912163,0.00013430926,0.99753845,0.0012353222,0.0000063529014],"about_ca_topic_score_codex":0.0019762057,"about_ca_topic_score_gemma":0.001478942,"teacher_disagreement_score":0.010982373,"about_ca_system_score_codex":0.0025914698,"about_ca_system_score_gemma":0.002250135,"threshold_uncertainty_score":0.036739647},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13694663,0.0034025423,0.7566649,0.0046976516,0.00038665652,0.00029169337,0.002290669,0.00050301955,0.09481624],"genre_scores_gemma":[0.762313,0.006852168,0.19852275,0.0031484133,0.0013257975,0.0012600981,0.0027180675,0.0005161425,0.023343604],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9952798,0.000988165,0.00030005694,0.0015244676,0.0012410285,0.0006665612],"domain_scores_gemma":[0.9823042,0.010610598,0.0016216777,0.0030895674,0.0014828565,0.0008910304],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0052756756,0.0013006508,0.0026830456,0.0032865736,0.0049239397,0.0054744957,0.0023040178,0.0019379284,0.007381136],"category_scores_gemma":[0.018639823,0.0011769005,0.0029656796,0.0032631257,0.00657049,0.014737099,0.0057462566,0.0054278136,0.0018848653],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008897237,0.00002735107,0.0006495774,0.00009882223,0.000036831087,0.000089418194,0.00027200137,0.0048278267,0.0012582855,0.980361,0.003667212,0.0086226845],"study_design_scores_gemma":[0.00004221058,0.000043253258,0.00063066237,0.000061030514,0.000047988946,0.00041475182,0.00014522356,0.025077034,0.0014525258,0.9541068,0.017939541,0.000038967366],"about_ca_topic_score_codex":0.0012867306,"about_ca_topic_score_gemma":0.0010298638,"teacher_disagreement_score":0.007381136,"about_ca_system_score_codex":0.003563486,"about_ca_system_score_gemma":0.0014392348,"threshold_uncertainty_score":0.027900815},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25484112,0.0012380122,0.68462485,0.00048379324,0.00009378188,0.00021054588,0.00065020274,0.0008954175,0.056962293],"genre_scores_gemma":[0.74292076,0.0007034673,0.23957437,0.00022662217,0.00006759907,0.00022952302,0.0018036743,0.00030003843,0.0141739985],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990914,0.00024955865,0.00006762458,0.00020519794,0.00024344955,0.00014282565],"domain_scores_gemma":[0.9975701,0.0010155537,0.00023454243,0.00059631706,0.00036554757,0.00021794041],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005744852,0.0003822205,0.000421003,0.0009779027,0.0013190769,0.0016077658,0.001260963,0.00061954634,0.005252998],"category_scores_gemma":[0.0035055554,0.0004375483,0.00047693646,0.0009660333,0.0014298,0.0029910125,0.0026509394,0.0010337721,0.0010633067],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00037742476,0.000102793834,0.0022864512,0.00037075175,0.000040302195,0.0005038544,0.0018924638,0.028341852,0.032650717,0.84409124,0.0038839132,0.0854583],"study_design_scores_gemma":[0.000038585276,0.00011695909,0.0010367888,0.000099657525,0.00004611381,0.000727897,0.0007855251,0.057842594,0.012545959,0.87872773,0.047996923,0.00003523759],"about_ca_topic_score_codex":0.0010648541,"about_ca_topic_score_gemma":0.0018106772,"teacher_disagreement_score":0.005252998,"about_ca_system_score_codex":0.0008083219,"about_ca_system_score_gemma":0.00051100965,"threshold_uncertainty_score":0.017572999},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.65400374,0.00085625506,0.14095484,0.0020163192,0.00038087642,0.0001595906,0.001015498,0.0012091334,0.19940373],"genre_scores_gemma":[0.96791637,0.000374544,0.014036657,0.0004944648,0.0001247121,0.0001298272,0.00058921345,0.0003061063,0.01602792],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991542,0.00012581536,0.000034833,0.00024236609,0.00017898587,0.0002638329],"domain_scores_gemma":[0.9969189,0.0011507005,0.00035552215,0.0006088175,0.0004329249,0.00053305086],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056932424,0.0009368485,0.0015480644,0.0022217478,0.0040821703,0.0035881447,0.0018390941,0.0017409862,0.0091799],"category_scores_gemma":[0.004264839,0.001001418,0.001046826,0.0019567953,0.0031838303,0.0062309224,0.0032819894,0.0028898614,0.0012641059],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007049507,0.000024924038,0.00048340083,0.00006861674,0.000021966605,0.0001317765,0.00027555146,0.0003886184,0.0010393007,0.99020666,0.0020750354,0.005213786],"study_design_scores_gemma":[0.000014668403,0.000008958751,0.00025947086,0.000019266528,0.000019695695,0.00021217926,0.00020410608,0.00171686,0.00084860134,0.99366426,0.0030230614,0.000008807738],"about_ca_topic_score_codex":0.0010749364,"about_ca_topic_score_gemma":0.0012212185,"teacher_disagreement_score":0.0091799,"about_ca_system_score_codex":0.00093802216,"about_ca_system_score_gemma":0.000685653,"threshold_uncertainty_score":0.030709803},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8641166,0.0016442413,0.10687827,0.0020851518,0.00011741373,0.00004790325,0.0005218247,0.00035294567,0.0242356],"genre_scores_gemma":[0.9869578,0.00052978453,0.009053439,0.00017211778,0.00014232697,0.00008719245,0.00027994442,0.00011308361,0.0026643116],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981912,0.00069994375,0.00009239349,0.00026305052,0.0004619067,0.00029153406],"domain_scores_gemma":[0.9672226,0.02477985,0.003487098,0.00199854,0.00076941063,0.001742546],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002354971,0.00065449416,0.0017287247,0.0032738382,0.0021985814,0.0059818407,0.0029887524,0.002161387,0.004996065],"category_scores_gemma":[0.023829825,0.0019372026,0.0009513216,0.0029514763,0.0055772034,0.0082037635,0.0028596052,0.0031155786,0.00038089138],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025462778,0.00007761119,0.0019080245,0.000100393445,0.000040477793,0.00020131886,0.00036493043,0.04576088,0.0011747715,0.94242775,0.0020609172,0.0056282543],"study_design_scores_gemma":[0.000023953264,0.000013812291,0.0005308112,0.000018349934,0.000012096938,0.00016365836,0.00009478661,0.05866059,0.0003747319,0.9395773,0.0005168305,0.000013135072],"about_ca_topic_score_codex":0.0008612452,"about_ca_topic_score_gemma":0.0010267989,"teacher_disagreement_score":0.0059818407,"about_ca_system_score_codex":0.0017112553,"about_ca_system_score_gemma":0.0006097933,"threshold_uncertainty_score":0.0167135},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5110801,0.0011572588,0.26337025,0.0053809243,0.00090105826,0.00024508176,0.0019436426,0.0011786316,0.21474306],"genre_scores_gemma":[0.9307368,0.00038282305,0.048814435,0.0007567676,0.00028599182,0.0003782483,0.0009332907,0.00016568058,0.017545963],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99749327,0.00041916204,0.00028503817,0.0006482043,0.0006373823,0.0005169847],"domain_scores_gemma":[0.9906533,0.004702603,0.0006089571,0.0013650982,0.0014429094,0.0012273247],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028117797,0.0005649407,0.001308787,0.00185693,0.0037573336,0.0034390795,0.0013862725,0.0028421583,0.020387692],"category_scores_gemma":[0.013551068,0.00054562005,0.001317912,0.0016858068,0.0038175432,0.008548468,0.0040924326,0.0029962042,0.0018228352],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011330342,0.000037926562,0.001138321,0.00009659898,0.0000104839155,0.00019429225,0.00023518312,0.0011934869,0.0026446336,0.9841495,0.0020722472,0.008114082],"study_design_scores_gemma":[0.00007472648,0.00013076863,0.00088816806,0.000070350354,0.000015956972,0.00067721994,0.0002962352,0.015668077,0.0045909625,0.9679387,0.009606764,0.00004199866],"about_ca_topic_score_codex":0.0010724978,"about_ca_topic_score_gemma":0.0011972277,"teacher_disagreement_score":0.020387692,"about_ca_system_score_codex":0.0020192272,"about_ca_system_score_gemma":0.0014374321,"threshold_uncertainty_score":0.06820357},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24176602,0.020687837,0.2470297,0.01681068,0.0016940953,0.00006796042,0.00037814258,0.0004990045,0.4710666],"genre_scores_gemma":[0.93470466,0.007018669,0.028224092,0.001813533,0.0018883675,0.00010497395,0.00017960476,0.00023885252,0.02582733],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99860233,0.00048551738,0.00006391455,0.0002849749,0.0003457298,0.00021752025],"domain_scores_gemma":[0.99473286,0.0030884165,0.00044454393,0.00067424576,0.00047913363,0.00058078294],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030225827,0.0012150222,0.0018880768,0.0053051854,0.00338451,0.004548652,0.0020806429,0.0030126541,0.0054453765],"category_scores_gemma":[0.011574564,0.00084379216,0.0017316277,0.0035679077,0.010111246,0.013018585,0.0046053166,0.008496897,0.0007950425],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000046323307,0.0000037879656,0.000027957663,0.0000148926765,0.0000019957313,0.000015019046,0.00009437062,0.00022543948,0.000051348947,0.99849653,0.00032090643,0.00074309093],"study_design_scores_gemma":[0.0000016843818,0.0000017973312,0.000025336125,0.000005692476,0.0000020846842,0.000014498839,0.000017601747,0.0004176522,0.000020711032,0.9989814,0.00050909206,0.0000024516448],"about_ca_topic_score_codex":0.0017921798,"about_ca_topic_score_gemma":0.0015824889,"teacher_disagreement_score":0.0054453765,"about_ca_system_score_codex":0.002709857,"about_ca_system_score_gemma":0.0008964233,"threshold_uncertainty_score":0.019661427},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7021283,0.0007551483,0.1520458,0.0015395127,0.0006841678,0.00009875236,0.0006770503,0.00067628536,0.14139499],"genre_scores_gemma":[0.8574462,0.00060464366,0.070103265,0.0005478731,0.0003087228,0.00024919107,0.0014225133,0.0006298443,0.06868781],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99908054,0.00014153706,0.000098303026,0.00018802972,0.00028390126,0.00020768837],"domain_scores_gemma":[0.995288,0.002084286,0.0004530123,0.0005644182,0.00083343807,0.000776896],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010728887,0.0009502767,0.0017064778,0.0033134997,0.005826066,0.004180983,0.0017056267,0.0016331582,0.009107951],"category_scores_gemma":[0.0056381593,0.0012602384,0.0011601041,0.0018861864,0.003089611,0.0067174165,0.003919006,0.0038323796,0.002025426],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003151224,0.000069519454,0.0009837996,0.000109404195,0.000053890984,0.00084290444,0.00071026996,0.0006756773,0.0076289154,0.97574776,0.0024298343,0.010432769],"study_design_scores_gemma":[0.000033885004,0.000053354368,0.0006567599,0.00007182615,0.000059124854,0.0013753504,0.0006800691,0.0035995573,0.0061868723,0.9777109,0.009540229,0.00003204358],"about_ca_topic_score_codex":0.0006193013,"about_ca_topic_score_gemma":0.0008702663,"teacher_disagreement_score":0.009107951,"about_ca_system_score_codex":0.0011324313,"about_ca_system_score_gemma":0.00064102985,"threshold_uncertainty_score":0.03046912},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24090144,0.016117094,0.17580813,0.016997501,0.0027310073,0.00014923078,0.0010389304,0.0007088482,0.54554796],"genre_scores_gemma":[0.85419357,0.008180432,0.03800321,0.001604982,0.0018119552,0.00048614107,0.00088359497,0.0006097904,0.094226316],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971372,0.00066770293,0.00015840311,0.00057814585,0.0008836027,0.0005749493],"domain_scores_gemma":[0.9836548,0.012463094,0.0007450354,0.0010264482,0.0010266459,0.0010839623],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038502084,0.002187275,0.0019017045,0.0076699746,0.003955287,0.008040882,0.0049059107,0.0025885284,0.020197375],"category_scores_gemma":[0.024101669,0.001364434,0.0014922894,0.005313846,0.005725226,0.017791586,0.0057137874,0.00931189,0.0032810331],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010948282,0.000042899366,0.00026764686,0.00010635825,0.000024236315,0.00007922666,0.00035918958,0.0023096325,0.0008056617,0.98170865,0.0035107785,0.0106762415],"study_design_scores_gemma":[0.000012919079,0.00001633039,0.00028226574,0.000072672505,0.00003692809,0.00009748714,0.00008186029,0.007160411,0.00064784155,0.98470795,0.0068533625,0.00003006358],"about_ca_topic_score_codex":0.0016886991,"about_ca_topic_score_gemma":0.002675953,"teacher_disagreement_score":0.020197375,"about_ca_system_score_codex":0.0038169483,"about_ca_system_score_gemma":0.0011470792,"threshold_uncertainty_score":0.06756693},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.84626734,0.0007403759,0.126453,0.0013334281,0.00006868775,0.000039678955,0.0004101828,0.00029037523,0.024396926],"genre_scores_gemma":[0.9907624,0.00020252375,0.0061339675,0.000092923336,0.00010826316,0.00005088211,0.000191406,0.00008435927,0.0023731117],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990274,0.00032730482,0.0000441349,0.00018501598,0.00026277849,0.00015343426],"domain_scores_gemma":[0.9906452,0.0063173017,0.0008018292,0.0010228818,0.000513676,0.00069911516],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014308671,0.00033024023,0.00051747344,0.0019382825,0.00090423867,0.0017885809,0.0008786978,0.00062467955,0.0019713691],"category_scores_gemma":[0.008597683,0.00035844295,0.0005405935,0.0007975788,0.00392605,0.0047008414,0.001853152,0.0010358751,0.00022375937],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007376595,0.00002378862,0.0015151093,0.00005706887,0.00001215115,0.0000735717,0.00019540172,0.013125333,0.0022732094,0.9786048,0.0006011081,0.0034445864],"study_design_scores_gemma":[0.00001236504,0.000021289985,0.0012254479,0.000011968435,0.0000078371595,0.00010598527,0.000044706718,0.05661771,0.0019608014,0.93897855,0.0009928973,0.00002053247],"about_ca_topic_score_codex":0.00060570583,"about_ca_topic_score_gemma":0.0005159053,"teacher_disagreement_score":0.0019713691,"about_ca_system_score_codex":0.0013808629,"about_ca_system_score_gemma":0.00040636776,"threshold_uncertainty_score":0.010018885},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.87660676,0.00069244346,0.07381462,0.0013305467,0.00008397745,0.00006466805,0.00063433865,0.00053649413,0.046236113],"genre_scores_gemma":[0.9778022,0.0002962926,0.014087213,0.00013394738,0.00010544778,0.00013595077,0.0003365029,0.00010361179,0.006998781],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998295,0.0003557124,0.00013123389,0.000358825,0.0005680678,0.00029116176],"domain_scores_gemma":[0.98630667,0.009587063,0.001283518,0.00087341,0.00069228193,0.0012570785],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017489145,0.0005203632,0.0016796243,0.004415252,0.0048286356,0.007291062,0.0024991718,0.002214347,0.006254718],"category_scores_gemma":[0.010603379,0.0017237369,0.0012765512,0.0035174903,0.0052759983,0.010415655,0.0035100954,0.0024404645,0.0005776429],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019985183,0.000047452762,0.0012271596,0.000080471684,0.00002247351,0.00015885632,0.0009767463,0.0023375866,0.0021872388,0.9882465,0.0007362673,0.0037793084],"study_design_scores_gemma":[0.00003901227,0.000017351622,0.00048958923,0.000017253014,0.000027881342,0.00019685163,0.00034560252,0.0051203645,0.001322369,0.9915141,0.00088875304,0.000020874515],"about_ca_topic_score_codex":0.0009871023,"about_ca_topic_score_gemma":0.0017836476,"teacher_disagreement_score":0.007291062,"about_ca_system_score_codex":0.0019741294,"about_ca_system_score_gemma":0.00087399664,"threshold_uncertainty_score":0.020924151},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46231756,0.004748634,0.30804002,0.094013564,0.0025895503,0.00023764124,0.0017951485,0.0011285784,0.12512933],"genre_scores_gemma":[0.93127495,0.0017653093,0.04438513,0.004073732,0.0032849815,0.00029386766,0.00080672704,0.00042156916,0.013693717],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9897037,0.0032597624,0.00058018795,0.0032287322,0.0018365786,0.0013909433],"domain_scores_gemma":[0.86275584,0.11122133,0.003989492,0.010998383,0.005391678,0.0056433273],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.013238411,0.0015243777,0.004787709,0.0046185316,0.008508656,0.009465377,0.0075614513,0.007472591,0.01543333],"category_scores_gemma":[0.10483473,0.0029577212,0.0038252012,0.0055904314,0.01857476,0.04595593,0.014135405,0.014693062,0.0015346302],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027720793,0.00008453622,0.0014545111,0.00012490831,0.000034890156,0.000116294636,0.0009662666,0.0034537567,0.00036557685,0.9807161,0.006391151,0.006014753],"study_design_scores_gemma":[0.00006417952,0.000020418871,0.00020889849,0.0000431853,0.000026185815,0.00008853531,0.00019833095,0.0077350116,0.00024029695,0.98893076,0.0024143965,0.000029863586],"about_ca_topic_score_codex":0.002353421,"about_ca_topic_score_gemma":0.0019826281,"teacher_disagreement_score":0.01543333,"about_ca_system_score_codex":0.0041218107,"about_ca_system_score_gemma":0.0018346676,"threshold_uncertainty_score":0.07001227},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5219342,0.0019487115,0.33585596,0.0032196746,0.00060342683,0.00011982929,0.00036866326,0.0005011516,0.1354484],"genre_scores_gemma":[0.95349663,0.0008595499,0.02435271,0.0004305119,0.00061756175,0.00015094873,0.00016573432,0.00020929934,0.019716974],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99806195,0.00060140906,0.0001292793,0.00041576827,0.00052436977,0.0002672307],"domain_scores_gemma":[0.99278647,0.0035267721,0.000938071,0.000912551,0.0007075093,0.0011287037],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029700806,0.00094740646,0.001712789,0.004956828,0.0038888664,0.0055275685,0.0020168063,0.0016598776,0.0066089095],"category_scores_gemma":[0.00821073,0.0011408237,0.0017757973,0.003736391,0.008833613,0.015684247,0.004069299,0.0050894255,0.0006963216],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000788044,0.0000073752444,0.000032896194,0.0000063151106,0.0000028514917,0.000020458052,0.00013185422,0.00015641942,0.00010906877,0.99880624,0.00011786726,0.0006006993],"study_design_scores_gemma":[0.0000047398594,0.000004130975,0.0000354601,0.0000031459906,0.0000042059837,0.00003350629,0.000040038492,0.00084994745,0.00010886663,0.9985061,0.00040537296,0.000004396288],"about_ca_topic_score_codex":0.0011342571,"about_ca_topic_score_gemma":0.0009787673,"teacher_disagreement_score":0.0066089095,"about_ca_system_score_codex":0.0020340201,"about_ca_system_score_gemma":0.00077757344,"threshold_uncertainty_score":0.022108972},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4954802,0.00478867,0.1775839,0.010624886,0.002170221,0.00009901889,0.00048603246,0.0005136271,0.30825347],"genre_scores_gemma":[0.91962814,0.0017642633,0.01493736,0.0009684233,0.0012704544,0.00007355087,0.00018472287,0.000195032,0.060977995],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99913174,0.00023346617,0.00004057138,0.00015886671,0.0002842008,0.00015118426],"domain_scores_gemma":[0.9987239,0.00041618908,0.00014303574,0.000090008696,0.00023527973,0.0003916207],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010940139,0.0010740509,0.0014047815,0.005696382,0.0035890124,0.004954531,0.001621465,0.0017209576,0.008342301],"category_scores_gemma":[0.0023192645,0.0006086851,0.0010106676,0.00318871,0.005580735,0.008510683,0.0035264164,0.0028233551,0.0006465153],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000032506775,0.0000066247576,0.0000355738,0.0000052989467,0.0000017525775,0.00001915804,0.0000912776,0.000099074095,0.00009637857,0.9988374,0.00021678275,0.000587439],"study_design_scores_gemma":[0.000004373444,0.0000042395263,0.00007197307,0.0000042480738,0.0000034012087,0.00004012286,0.00004760043,0.0009896978,0.000063274245,0.99722916,0.0015364245,0.000005390192],"about_ca_topic_score_codex":0.0025985169,"about_ca_topic_score_gemma":0.0028130931,"teacher_disagreement_score":0.008342301,"about_ca_system_score_codex":0.0038770041,"about_ca_system_score_gemma":0.001068458,"threshold_uncertainty_score":0.028129756},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40833926,0.00669773,0.42747498,0.011164646,0.0011706055,0.00009290146,0.001089361,0.00065341126,0.14331715],"genre_scores_gemma":[0.92812634,0.0021444035,0.04617905,0.0008026183,0.0009065955,0.00012658439,0.0004230564,0.00019505474,0.021096302],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981122,0.00074994704,0.00013505484,0.0003487172,0.00045161994,0.00020246078],"domain_scores_gemma":[0.9935359,0.0035670067,0.00058135536,0.00076702074,0.0007326456,0.00081614486],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025115807,0.0005648704,0.0008949489,0.0040367143,0.0032771651,0.006503511,0.0013403428,0.0014267395,0.0047387006],"category_scores_gemma":[0.00675206,0.00093199685,0.001042732,0.0030163485,0.009784615,0.019893797,0.0025753237,0.0039172675,0.000507669],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000073602073,0.0000031574693,0.00007709743,0.000008097672,0.0000012685241,0.000010915945,0.00014618151,0.00011623759,0.00010850045,0.9986156,0.00015310722,0.0007523015],"study_design_scores_gemma":[0.0000044034673,0.0000060983925,0.00010655943,0.000007960503,0.0000035544751,0.000029281051,0.00008932605,0.0008001735,0.000098996454,0.99677616,0.0020720349,0.0000056205836],"about_ca_topic_score_codex":0.00258965,"about_ca_topic_score_gemma":0.0027623826,"teacher_disagreement_score":0.006503511,"about_ca_system_score_codex":0.002500985,"about_ca_system_score_gemma":0.0012367871,"threshold_uncertainty_score":0.018145978},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.58440083,0.0024624977,0.24908273,0.0064145103,0.0003102601,0.00010948582,0.0013450782,0.0006704233,0.15520419],"genre_scores_gemma":[0.9616214,0.0013627365,0.022528527,0.0006909893,0.0004032585,0.00016867838,0.0004952275,0.00014255181,0.012586731],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983847,0.00030937197,0.00014570309,0.0004850918,0.00046106358,0.00021411941],"domain_scores_gemma":[0.9941649,0.0032393073,0.0007068543,0.00079867267,0.00057747203,0.00051280006],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016262595,0.00058281416,0.0017999464,0.0020647577,0.0023815641,0.0057420027,0.0017482876,0.0020520955,0.007012951],"category_scores_gemma":[0.009413453,0.00081906805,0.001084573,0.0027202778,0.0037409575,0.013794457,0.0033823764,0.0037835196,0.00089424243],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000048680966,0.000016342354,0.00029785978,0.00003751338,0.000009399314,0.00005893229,0.00014950344,0.00065058673,0.0007295369,0.9917706,0.000962806,0.0052683987],"study_design_scores_gemma":[0.000016531338,0.000010255148,0.00015722311,0.000011465545,0.000010356231,0.00015345456,0.00005351533,0.0028410207,0.0005419422,0.99395144,0.0022427028,0.00001002098],"about_ca_topic_score_codex":0.0006546252,"about_ca_topic_score_gemma":0.0005189419,"teacher_disagreement_score":0.007012951,"about_ca_system_score_codex":0.0014621357,"about_ca_system_score_gemma":0.00082089804,"threshold_uncertainty_score":0.023460686},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5892926,0.0018639974,0.3171193,0.0013272119,0.00024219631,0.00015120843,0.0012844434,0.0006748756,0.08804421],"genre_scores_gemma":[0.8048975,0.001281536,0.16923404,0.00035857185,0.00023245321,0.00012626106,0.0021218327,0.0003681574,0.021379575],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99844414,0.00034084456,0.00015508568,0.00031564425,0.0005190884,0.0002251945],"domain_scores_gemma":[0.9938992,0.0038321512,0.00045832834,0.00083019544,0.0005850373,0.00039508697],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010765407,0.00078142044,0.0011378278,0.003521109,0.0015417191,0.0045161746,0.0024605081,0.0013761374,0.0065580984],"category_scores_gemma":[0.010068981,0.0008265006,0.0010085324,0.0037588244,0.0022582416,0.010485716,0.003661062,0.0030515708,0.000772005],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000120744844,0.00014927126,0.004804327,0.0002570535,0.000024338045,0.00024452896,0.0011230651,0.0069181453,0.002455943,0.9123153,0.0043007247,0.0672865],"study_design_scores_gemma":[0.000012641938,0.000027802971,0.00073896063,0.00005207507,0.00003087477,0.000524348,0.00046296985,0.019149344,0.0025339508,0.96800494,0.008444731,0.000017352455],"about_ca_topic_score_codex":0.0006834861,"about_ca_topic_score_gemma":0.0010520988,"teacher_disagreement_score":0.0065580984,"about_ca_system_score_codex":0.001077709,"about_ca_system_score_gemma":0.00055818004,"threshold_uncertainty_score":0.02193898},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8731697,0.0022677677,0.073484965,0.0057897773,0.00027309914,0.00007858507,0.00086056005,0.00037655473,0.04369897],"genre_scores_gemma":[0.9847514,0.0009567698,0.007724195,0.0003701501,0.00028379814,0.00010716258,0.00036791692,0.00015789224,0.005280616],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99861217,0.0005551462,0.000044415356,0.00034069427,0.00025147086,0.00019610453],"domain_scores_gemma":[0.9676216,0.024130514,0.002783958,0.001839833,0.0011420646,0.002481936],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003019808,0.00079966977,0.0013110626,0.0055048787,0.0021512716,0.0040240814,0.0029755034,0.0018440228,0.007821052],"category_scores_gemma":[0.022881245,0.00093532214,0.0006295111,0.0028598758,0.0065067043,0.0065034223,0.0029913012,0.00262678,0.00045924025],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00041524676,0.00008068579,0.0034585241,0.0001650629,0.000045363475,0.00007934402,0.00042247213,0.043218717,0.0033017397,0.93564516,0.0050211977,0.008146634],"study_design_scores_gemma":[0.000091257934,0.00004551842,0.002342183,0.00008629809,0.000037743943,0.00013800382,0.00019088693,0.1926601,0.0012330201,0.8010629,0.0020412386,0.00007090623],"about_ca_topic_score_codex":0.0031904501,"about_ca_topic_score_gemma":0.0034403952,"teacher_disagreement_score":0.007821052,"about_ca_system_score_codex":0.0048954347,"about_ca_system_score_gemma":0.0012153769,"threshold_uncertainty_score":0.035519004},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5171248,0.0063960846,0.33589897,0.0071426393,0.00070756517,0.00009253184,0.00061492034,0.0005595481,0.13146289],"genre_scores_gemma":[0.9124778,0.002784758,0.05135643,0.0008360355,0.00068723987,0.0001387595,0.00037052107,0.00017935163,0.03116913],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99846727,0.00040257032,0.00009458437,0.00041394585,0.00043605635,0.00018545266],"domain_scores_gemma":[0.9931503,0.0042545726,0.00078081037,0.00066964567,0.0004784309,0.0006663337],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015753882,0.00071358826,0.0014149265,0.003537671,0.0023401168,0.0039118924,0.0021612563,0.002214029,0.008892074],"category_scores_gemma":[0.011042773,0.0007696259,0.0008792229,0.005044476,0.0050168424,0.01093659,0.0038977966,0.0039240774,0.00078902644],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021735334,0.000016224458,0.00017278678,0.00003182073,0.0000049169075,0.00002436095,0.0001526996,0.0007443511,0.00025532994,0.9921451,0.00061413296,0.005816469],"study_design_scores_gemma":[0.000005037022,0.000004192422,0.000072483796,0.000006502255,0.000004362831,0.00004510254,0.00003736405,0.0015499875,0.00011580026,0.996851,0.0013039575,0.0000041077906],"about_ca_topic_score_codex":0.0010789118,"about_ca_topic_score_gemma":0.00096208934,"teacher_disagreement_score":0.008892074,"about_ca_system_score_codex":0.001867486,"about_ca_system_score_gemma":0.00055886677,"threshold_uncertainty_score":0.02974701},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9460535,0.0010013296,0.025515959,0.002273813,0.00022456457,0.00005616776,0.0003979783,0.00016323435,0.024313409],"genre_scores_gemma":[0.9846299,0.0004771154,0.009456963,0.00018483019,0.00022558999,0.000095308795,0.00032756416,0.00006093321,0.004541726],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982685,0.0004987526,0.00014473875,0.00031719301,0.00043465602,0.0003362867],"domain_scores_gemma":[0.98022735,0.013720116,0.0025777207,0.0009850059,0.00085769413,0.0016320489],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025483065,0.0008249132,0.001629879,0.004258912,0.0030105151,0.005467752,0.0033293383,0.0029188597,0.0101362085],"category_scores_gemma":[0.017934376,0.00076944695,0.0009508623,0.00268797,0.00449036,0.0070824316,0.0030037286,0.002371542,0.0005290865],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012512456,0.00020948694,0.0063679535,0.00042856063,0.00012592043,0.00038539624,0.0011070272,0.01427022,0.008373619,0.9410181,0.0035867682,0.02287569],"study_design_scores_gemma":[0.00014675956,0.00011374939,0.0022694785,0.000087513705,0.000077931676,0.00051601464,0.00058401906,0.046624873,0.003337798,0.94433784,0.001838921,0.00006507443],"about_ca_topic_score_codex":0.0005189355,"about_ca_topic_score_gemma":0.00065510604,"teacher_disagreement_score":0.0101362085,"about_ca_system_score_codex":0.0019097069,"about_ca_system_score_gemma":0.0009980049,"threshold_uncertainty_score":0.033909023},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03504946,0.0021036048,0.5620961,0.011141055,0.002769195,0.00022244785,0.0013692125,0.0022339069,0.38301495],"genre_scores_gemma":[0.6544635,0.0029569843,0.1974253,0.01788313,0.004950572,0.0008675239,0.0027912804,0.005133896,0.11352776],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9890125,0.0033997917,0.00056621217,0.0034132071,0.0019003692,0.0017079673],"domain_scores_gemma":[0.9787597,0.009694947,0.0008867068,0.0059366296,0.0036740957,0.0010479238],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008834398,0.002292907,0.0029046626,0.0032772692,0.0062710047,0.005892999,0.0042321016,0.0038217125,0.039039847],"category_scores_gemma":[0.029239312,0.0019999319,0.007935881,0.0023296524,0.008701182,0.023660868,0.012404633,0.009533704,0.012502009],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007142014,0.000032229727,0.00018010258,0.00011605541,0.000037800983,0.000116844465,0.00024756484,0.00079425477,0.0006068923,0.98129785,0.010133666,0.00636524],"study_design_scores_gemma":[0.000027993685,0.000025896543,0.00017825572,0.000044613127,0.000034864694,0.00017955135,0.0000819474,0.0037539783,0.0007761388,0.9801257,0.014738749,0.000032293006],"about_ca_topic_score_codex":0.0032986153,"about_ca_topic_score_gemma":0.0030077,"teacher_disagreement_score":0.039039847,"about_ca_system_score_codex":0.002949034,"about_ca_system_score_gemma":0.0020351831,"threshold_uncertainty_score":0.13060129},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5555491,0.008517614,0.33088267,0.009053909,0.00058523205,0.000111102425,0.0009102374,0.0017269623,0.09266321],"genre_scores_gemma":[0.9500619,0.003548023,0.028145012,0.00066850707,0.0014486897,0.00031421107,0.00089934084,0.0005750407,0.01433928],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975594,0.0007862786,0.00009473731,0.0004436936,0.00083723344,0.0002786256],"domain_scores_gemma":[0.95073247,0.03984403,0.0019320302,0.002391145,0.0024411785,0.0026592307],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037956815,0.0013322282,0.0020380954,0.006526991,0.0027124097,0.008014393,0.004549695,0.0026991025,0.010485652],"category_scores_gemma":[0.059023954,0.0015471051,0.0010356727,0.004918992,0.007213987,0.01433897,0.0045902105,0.005147912,0.0009919967],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000089187226,0.000051808907,0.0018457285,0.00016162818,0.000023655868,0.000053794294,0.00041601132,0.0073239123,0.00065459096,0.97513187,0.0031261016,0.011121649],"study_design_scores_gemma":[0.000016577611,0.00001187947,0.0007111902,0.00003775014,0.000020809628,0.00012198127,0.000110848916,0.024777362,0.0002989267,0.97256327,0.001316614,0.000012897232],"about_ca_topic_score_codex":0.0020237262,"about_ca_topic_score_gemma":0.002290358,"teacher_disagreement_score":0.010485652,"about_ca_system_score_codex":0.0034312229,"about_ca_system_score_gemma":0.0015881018,"threshold_uncertainty_score":0.03507799},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9043093,0.0010887441,0.06606505,0.0016358244,0.0001276788,0.000051746247,0.00027180408,0.00036529917,0.026084602],"genre_scores_gemma":[0.98347086,0.00045037328,0.011231449,0.00019614275,0.00019431536,0.000105948806,0.00021147136,0.00010579292,0.0040337276],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989839,0.00029353143,0.000051376806,0.00021656635,0.0002985337,0.00015613677],"domain_scores_gemma":[0.97801524,0.016538614,0.0018849873,0.0012466981,0.0007491525,0.001565274],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001542736,0.000656027,0.0019418353,0.003964047,0.0026728548,0.0047416273,0.0027272967,0.0021057834,0.0041538193],"category_scores_gemma":[0.015683718,0.0020035144,0.0011695342,0.0025335962,0.0050950516,0.0063431878,0.003115038,0.0032843626,0.00045726885],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012766897,0.000096417854,0.0022283325,0.000116493626,0.000044428816,0.00030024067,0.0007347946,0.009115201,0.0022322622,0.97760993,0.0019672178,0.0054270984],"study_design_scores_gemma":[0.00003320858,0.000016762702,0.00089678733,0.000022442508,0.000031142175,0.0003442179,0.00018658329,0.018987004,0.0007366764,0.97813076,0.00059670507,0.000017723305],"about_ca_topic_score_codex":0.0005187275,"about_ca_topic_score_gemma":0.00074034435,"teacher_disagreement_score":0.0047416273,"about_ca_system_score_codex":0.0012064156,"about_ca_system_score_gemma":0.00061439315,"threshold_uncertainty_score":0.013895929},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.56113374,0.0034336136,0.1271844,0.0056277383,0.00065223477,0.000069575355,0.0004521021,0.0009392082,0.3005074],"genre_scores_gemma":[0.96180135,0.0010860324,0.013211676,0.00073784654,0.00046507848,0.00005214417,0.00033881693,0.00024690654,0.022060152],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99877673,0.00028597,0.000064124164,0.0002814194,0.00036737768,0.00022429074],"domain_scores_gemma":[0.99506325,0.003066248,0.0002635188,0.00052944885,0.00041627957,0.00066128245],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014855603,0.0008935026,0.0012258331,0.0029504169,0.0029155891,0.003364981,0.0018321327,0.0013788063,0.00936081],"category_scores_gemma":[0.005988488,0.00090401125,0.0014220305,0.0013945445,0.005366543,0.010684349,0.0048705153,0.0052791378,0.0007478181],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021760428,0.000023210647,0.0001873752,0.000024087425,0.0000045838788,0.000097443524,0.00030568405,0.00021215691,0.00040382496,0.9956797,0.0005578139,0.0024823751],"study_design_scores_gemma":[0.000010274975,0.000008119869,0.00015603953,0.000011887577,0.0000070858428,0.00010640382,0.00007765791,0.00089576823,0.00038101603,0.9965581,0.0017813374,0.0000062528466],"about_ca_topic_score_codex":0.00085937616,"about_ca_topic_score_gemma":0.00084763,"teacher_disagreement_score":0.00936081,"about_ca_system_score_codex":0.0015386319,"about_ca_system_score_gemma":0.00056494493,"threshold_uncertainty_score":0.03131509},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.819901,0.0030269346,0.030896096,0.008493045,0.00047034858,0.00003420366,0.00022920029,0.00023107594,0.13671803],"genre_scores_gemma":[0.99288154,0.00032901907,0.0031813285,0.0004847834,0.00017305113,0.00002174151,0.00009705011,0.0000127781295,0.002818806],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99860805,0.00032487322,0.000098682314,0.0003656063,0.0003428931,0.00025991767],"domain_scores_gemma":[0.99026346,0.0060181078,0.00072004687,0.0012236448,0.0009230546,0.00085168227],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030277444,0.00026779642,0.0011111319,0.0016139614,0.0025523661,0.0026364883,0.0011928725,0.0018504991,0.0057908697],"category_scores_gemma":[0.010603635,0.0004059323,0.00072342803,0.001317469,0.0073353266,0.0057063727,0.0023930976,0.0016371413,0.00049309595],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005225152,0.000017150096,0.001457754,0.000044594064,0.000005991789,0.00008652133,0.00025638603,0.00074938557,0.00041878468,0.9932634,0.0012471721,0.00240049],"study_design_scores_gemma":[0.000028239256,0.0000240203,0.001048881,0.000026062378,0.000010582785,0.0002100863,0.00036877766,0.0036583089,0.00052849326,0.989786,0.004294727,0.000015654683],"about_ca_topic_score_codex":0.0011756456,"about_ca_topic_score_gemma":0.0012960975,"teacher_disagreement_score":0.0057908697,"about_ca_system_score_codex":0.0012299054,"about_ca_system_score_gemma":0.000613881,"threshold_uncertainty_score":0.019372344},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.82781625,0.0036691509,0.10841098,0.0010088485,0.00005835166,0.000059173424,0.000619243,0.00045582067,0.057902206],"genre_scores_gemma":[0.9877123,0.0008436872,0.008352218,0.00015564328,0.00007158883,0.000058670994,0.00027182596,0.00007959745,0.0024543277],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992157,0.00014413286,0.000029486544,0.00022314198,0.00017171087,0.00021568981],"domain_scores_gemma":[0.9935515,0.004366145,0.0005981439,0.00047647455,0.00034083176,0.00066688645],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011357686,0.00059843034,0.0005657279,0.0027471806,0.0010509779,0.0021030828,0.0011364926,0.0007390354,0.003252626],"category_scores_gemma":[0.0061945454,0.0004602614,0.00061014673,0.0013610492,0.0027566168,0.0031838983,0.0015704862,0.0019434476,0.00039118872],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026055897,0.00006130691,0.00892741,0.00014538363,0.000060377388,0.00021345752,0.00080623047,0.054156568,0.019799894,0.898309,0.0028217577,0.01443817],"study_design_scores_gemma":[0.000039915056,0.00011775201,0.010567403,0.00014561706,0.000071304916,0.0004607013,0.00039082248,0.26412398,0.009500525,0.7074045,0.0070886514,0.00008888049],"about_ca_topic_score_codex":0.002774825,"about_ca_topic_score_gemma":0.0017039785,"teacher_disagreement_score":0.003252626,"about_ca_system_score_codex":0.003186551,"about_ca_system_score_gemma":0.00044968823,"threshold_uncertainty_score":0.023120165},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6228972,0.002078366,0.26241693,0.009570775,0.000528075,0.000051543746,0.0004368801,0.00033563044,0.10168459],"genre_scores_gemma":[0.9687591,0.000739954,0.015942013,0.00043980987,0.0006352028,0.000069152324,0.00023245657,0.00015184021,0.013030577],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99893755,0.00036020693,0.000035323366,0.00014871608,0.0003311964,0.00018703533],"domain_scores_gemma":[0.9947924,0.003517359,0.0005050392,0.00041690315,0.00036999735,0.00039820274],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018148809,0.00078641984,0.001024203,0.0032788697,0.0016128094,0.003627804,0.002016141,0.00186243,0.011096831],"category_scores_gemma":[0.008593302,0.00050484797,0.0010222553,0.0011149872,0.0056189257,0.009330697,0.0021699858,0.0036485794,0.000715929],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008355359,0.000012813241,0.00012857484,0.000014751889,0.0000030749343,0.000015112496,0.00006793646,0.0015107101,0.00019787792,0.9961987,0.00045462532,0.0013875521],"study_design_scores_gemma":[0.0000028188347,0.0000034613252,0.00018312305,0.0000069690486,0.0000015683955,0.000036546277,0.000031748386,0.01782172,0.00013382258,0.98134804,0.0004206796,0.000009559532],"about_ca_topic_score_codex":0.0015758624,"about_ca_topic_score_gemma":0.0012927252,"teacher_disagreement_score":0.011096831,"about_ca_system_score_codex":0.002072979,"about_ca_system_score_gemma":0.0006944514,"threshold_uncertainty_score":0.037122607},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.77551025,0.0008085926,0.21530834,0.0011754647,0.000088238834,0.0000711323,0.00026863592,0.0005591215,0.006210264],"genre_scores_gemma":[0.9791266,0.000403126,0.018461555,0.000100096055,0.000076865115,0.00008608977,0.0001485618,0.00008548436,0.0015116151],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99958676,0.00010885826,0.000018848603,0.00013275776,0.000081920836,0.000070957045],"domain_scores_gemma":[0.99475175,0.0034335821,0.00053393946,0.00045728643,0.00027089345,0.0005526263],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016292754,0.00037465573,0.0008781479,0.0016920891,0.0006838897,0.0014035245,0.00095955393,0.00078338495,0.0026789429],"category_scores_gemma":[0.010854452,0.00037399735,0.000465304,0.0006939552,0.0016341242,0.0039703497,0.0010633918,0.000790428,0.0002791404],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00043975798,0.00007997933,0.0035597882,0.00020695421,0.000056369707,0.000573049,0.0004996351,0.09249588,0.024653913,0.85581553,0.003051888,0.01856724],"study_design_scores_gemma":[0.000052658947,0.00009184016,0.0016812836,0.00003492987,0.00003050635,0.00028372245,0.00009998089,0.6524995,0.0038485702,0.3393146,0.0020226003,0.000039771774],"about_ca_topic_score_codex":0.0010294807,"about_ca_topic_score_gemma":0.00054716785,"teacher_disagreement_score":0.0026789429,"about_ca_system_score_codex":0.0011441022,"about_ca_system_score_gemma":0.00047292924,"threshold_uncertainty_score":0.008961916},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.93007636,0.0012501545,0.043854646,0.0009893228,0.000052108797,0.000036735073,0.00040514354,0.00023657281,0.023098951],"genre_scores_gemma":[0.99145836,0.00040541147,0.0058452343,0.000101335856,0.00004080294,0.000060265527,0.00013936684,0.000044873443,0.0019043641],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994947,0.0001439438,0.000022358168,0.00012010599,0.00009028354,0.0001285488],"domain_scores_gemma":[0.9953957,0.0026933283,0.00055409747,0.0004795414,0.0003117199,0.00056550116],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010902482,0.0002499941,0.00051185157,0.0013409652,0.0011959905,0.0019541662,0.000729884,0.0006868381,0.004709175],"category_scores_gemma":[0.010540796,0.00046218856,0.00037038236,0.0007979376,0.001565689,0.0034554163,0.0014076647,0.00083843153,0.00038177255],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006968223,0.00006773258,0.008677724,0.00020968844,0.000045135854,0.00019204292,0.00080660585,0.032092046,0.0093628215,0.9037634,0.0073192474,0.03676665],"study_design_scores_gemma":[0.00006777107,0.000110711495,0.005780526,0.00009472212,0.000053283944,0.0005442908,0.000382023,0.14806473,0.004732131,0.83255464,0.0075544277,0.000060736613],"about_ca_topic_score_codex":0.0013295772,"about_ca_topic_score_gemma":0.0010513033,"teacher_disagreement_score":0.004709175,"about_ca_system_score_codex":0.0011873862,"about_ca_system_score_gemma":0.0006148598,"threshold_uncertainty_score":0.015753806},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.69392717,0.0008969893,0.26959547,0.0012933385,0.00024810142,0.00006128763,0.00030971272,0.0006005607,0.03306734],"genre_scores_gemma":[0.96232575,0.00063841237,0.025321033,0.00025707626,0.0005588606,0.00011089384,0.00037175845,0.00046032763,0.009955962],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99658906,0.00077973236,0.0002688907,0.00083221163,0.0008770781,0.00065308274],"domain_scores_gemma":[0.98195803,0.0098023955,0.0022530528,0.0012057634,0.001894385,0.0028865049],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004034039,0.0018309236,0.0021552427,0.00861723,0.0032723371,0.007866618,0.0051349686,0.0022615304,0.0063464073],"category_scores_gemma":[0.018905552,0.0014542858,0.002126289,0.0052091996,0.007694121,0.017119136,0.0063077467,0.0040549175,0.00073595886],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006863748,0.00004576377,0.00093039364,0.000049254893,0.000025406018,0.00017123006,0.00055635447,0.00081088947,0.0016236964,0.9909943,0.000475255,0.004249023],"study_design_scores_gemma":[0.000014427488,0.000046410758,0.0008627389,0.00003777921,0.00006892626,0.00072601996,0.00033473826,0.014119881,0.0018134107,0.97969776,0.0022298004,0.00004813416],"about_ca_topic_score_codex":0.0010784524,"about_ca_topic_score_gemma":0.00061143615,"teacher_disagreement_score":0.00861723,"about_ca_system_score_codex":0.0027498193,"about_ca_system_score_gemma":0.001190652,"threshold_uncertainty_score":0.02133429},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13566186,0.0013099826,0.82559806,0.0048452127,0.00020346686,0.00021849362,0.0014123439,0.0009931842,0.029757418],"genre_scores_gemma":[0.92720836,0.0011237552,0.048826504,0.0008539806,0.00034957382,0.00060176535,0.00075698004,0.00016635828,0.020112729],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976687,0.0010868767,0.000059510247,0.00050002924,0.0004204754,0.00026453397],"domain_scores_gemma":[0.99217695,0.004217149,0.0010935297,0.0012567816,0.0007034802,0.0005520811],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002809353,0.0010473811,0.001524393,0.0017301611,0.0009321141,0.0024696975,0.0039920732,0.0020635386,0.0069665196],"category_scores_gemma":[0.013366727,0.00064493954,0.0009813901,0.001777272,0.0031423338,0.0058798087,0.0018292668,0.002428176,0.0012849523],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000038443177,0.000025456879,0.00037441502,0.00003009077,0.000014520255,0.00012778184,0.000073694246,0.05091437,0.00027764216,0.94398886,0.0018490424,0.002285662],"study_design_scores_gemma":[0.00003672861,0.000028736004,0.00023761744,0.000013863447,0.0000113906835,0.0001096612,0.00003517466,0.3975272,0.00015651196,0.598983,0.002842512,0.000017571278],"about_ca_topic_score_codex":0.0029248775,"about_ca_topic_score_gemma":0.0025030477,"teacher_disagreement_score":0.0069665196,"about_ca_system_score_codex":0.0023823709,"about_ca_system_score_gemma":0.0006225603,"threshold_uncertainty_score":0.023305357},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.87073016,0.00063014025,0.11672,0.00029819843,0.00003108025,0.00003478885,0.00045244594,0.00016573297,0.010937516],"genre_scores_gemma":[0.97869146,0.00029703364,0.01811657,0.00006907796,0.000028681334,0.000035503566,0.0003551161,0.000047539837,0.002359016],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996443,0.00009433855,0.000020615684,0.00009124016,0.00007458809,0.00007489988],"domain_scores_gemma":[0.9965636,0.0017623191,0.0006262669,0.000359934,0.00031891486,0.00036894114],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004337392,0.00034893776,0.00039170875,0.0011415961,0.0007197343,0.0010104914,0.00047816985,0.00063238334,0.003436753],"category_scores_gemma":[0.0026847927,0.00043301767,0.000519726,0.00088641327,0.0009775334,0.0015606025,0.0010456538,0.0008599734,0.00036284892],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00062217057,0.00013245424,0.013538268,0.0005495765,0.00010708534,0.0012804483,0.0014592598,0.11894978,0.0831667,0.74156195,0.0041773245,0.034455016],"study_design_scores_gemma":[0.000044982862,0.0001815143,0.0060078995,0.0000945732,0.000054009757,0.0015424227,0.0007770693,0.19851881,0.016215185,0.7697978,0.006715076,0.000050723353],"about_ca_topic_score_codex":0.0006675269,"about_ca_topic_score_gemma":0.0011343029,"teacher_disagreement_score":0.003436753,"about_ca_system_score_codex":0.000355875,"about_ca_system_score_gemma":0.00017143958,"threshold_uncertainty_score":0.01149708},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.55268395,0.0028588015,0.41998664,0.0019416761,0.00019676419,0.00023069819,0.00104615,0.0010041401,0.020051226],"genre_scores_gemma":[0.9466032,0.0019606422,0.04103653,0.0005774189,0.00027870914,0.00038040167,0.0011109515,0.00036443272,0.007687679],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9968851,0.0010156828,0.00015185843,0.00076232647,0.0006427672,0.00054217194],"domain_scores_gemma":[0.9806683,0.011784116,0.0023834375,0.0026601795,0.0009586039,0.0015453248],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027453548,0.0014215418,0.0018819324,0.002835044,0.0021755283,0.0033986114,0.0019829273,0.0020629407,0.005329146],"category_scores_gemma":[0.026374748,0.0013586417,0.0016566111,0.0027010594,0.0043601044,0.0080928225,0.0030224577,0.0021414123,0.0010303938],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005693472,0.00012660878,0.0050446345,0.00028170485,0.000113921466,0.0006953968,0.0009085535,0.077409804,0.004638893,0.88764626,0.006607866,0.01595692],"study_design_scores_gemma":[0.0001141811,0.00016858593,0.0021478957,0.000115140516,0.00010216978,0.0013734286,0.00029167134,0.38521898,0.004434021,0.59964144,0.006304173,0.00008836326],"about_ca_topic_score_codex":0.0024459078,"about_ca_topic_score_gemma":0.0020708416,"teacher_disagreement_score":0.005329146,"about_ca_system_score_codex":0.002284811,"about_ca_system_score_gemma":0.00086997775,"threshold_uncertainty_score":0.01782775},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27268106,0.0020137453,0.49057403,0.004624978,0.0015826281,0.00013917442,0.00097464485,0.0016511632,0.22575855],"genre_scores_gemma":[0.8798122,0.001343072,0.062377945,0.0016247863,0.002231742,0.00036981286,0.0022036096,0.0010891735,0.048947606],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9969278,0.000441167,0.0002756396,0.0011268484,0.00073080737,0.0004977802],"domain_scores_gemma":[0.9963731,0.0014730045,0.00040419813,0.0005411818,0.00070837437,0.00050010014],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002462213,0.0012264368,0.001174424,0.003936112,0.002992021,0.008470789,0.0016329056,0.0021374475,0.014359919],"category_scores_gemma":[0.009738918,0.00063765753,0.0023913635,0.0018638099,0.0066627623,0.018104399,0.0050629037,0.004425549,0.0033764937],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008072281,0.000028675315,0.0011548083,0.000075359065,0.000023020353,0.00019327276,0.0005557069,0.00023303986,0.000785864,0.98279923,0.0025514804,0.011518764],"study_design_scores_gemma":[0.000012453698,0.000044297023,0.000840919,0.000041253315,0.000029501625,0.0006800871,0.0003781385,0.003072333,0.0022069237,0.9825141,0.010150798,0.000029195737],"about_ca_topic_score_codex":0.0008123991,"about_ca_topic_score_gemma":0.00039162583,"teacher_disagreement_score":0.014359919,"about_ca_system_score_codex":0.0012239149,"about_ca_system_score_gemma":0.0006708212,"threshold_uncertainty_score":0.04803872},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12716573,0.00030602256,0.85993177,0.0003605225,0.000080815465,0.000084731044,0.00006434967,0.0004601572,0.01154595],"genre_scores_gemma":[0.58969325,0.0002162297,0.40551144,0.00010387565,0.000025599922,0.00014485637,0.00015856451,0.00030050823,0.0038456344],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99938226,0.00031455664,0.000023520153,0.000109531014,0.00011423308,0.000055935343],"domain_scores_gemma":[0.99679166,0.0022807908,0.00017354751,0.00043995815,0.00018261783,0.0001313052],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012101982,0.00059736805,0.00091012416,0.0016371141,0.0011557896,0.0012565838,0.0012275014,0.0012758548,0.0025249093],"category_scores_gemma":[0.0066871573,0.0009888884,0.0012247872,0.00075106544,0.002719794,0.0020184857,0.0020548296,0.0022682727,0.0002976345],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008057441,0.00007754805,0.00056115387,0.00008488575,0.000057280453,0.00007438099,0.00023147168,0.51301676,0.0026423417,0.462977,0.0008731174,0.019323427],"study_design_scores_gemma":[0.00001648675,0.00002096128,0.000079542944,0.000016008822,0.000011603063,0.000016333164,0.00003271198,0.67911845,0.0008717965,0.31896,0.00084593764,0.000010248138],"about_ca_topic_score_codex":0.001595429,"about_ca_topic_score_gemma":0.0030133992,"teacher_disagreement_score":0.0025249093,"about_ca_system_score_codex":0.0015982441,"about_ca_system_score_gemma":0.0007145876,"threshold_uncertainty_score":0.011596084},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9169358,0.0015583744,0.051670033,0.0017573779,0.0000882388,0.00006295657,0.000412109,0.00051810546,0.02699705],"genre_scores_gemma":[0.9902435,0.00036633256,0.0075991014,0.00014984174,0.000056735316,0.000072500545,0.0001600239,0.00005285288,0.0012990058],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99800867,0.0004411835,0.000106847394,0.00048078073,0.00064391457,0.00031873255],"domain_scores_gemma":[0.98663133,0.008011619,0.0016294395,0.001337958,0.0009170161,0.0014725345],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012156229,0.00043038247,0.0007844868,0.0019340382,0.0017351675,0.0027090323,0.0016073519,0.0012716947,0.0039915466],"category_scores_gemma":[0.014609051,0.0008048161,0.0005554892,0.0014548738,0.0028026523,0.0039749327,0.002813326,0.0017617457,0.0003118466],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00046883384,0.000100134836,0.009204932,0.00036859038,0.000079301535,0.00048054958,0.0011925587,0.032480564,0.011857725,0.91743386,0.0040913653,0.022241585],"study_design_scores_gemma":[0.000067817295,0.00008797386,0.0018690883,0.0000718043,0.00004452715,0.00069214596,0.00034763213,0.046425216,0.0070989793,0.9360816,0.0071712774,0.000042020907],"about_ca_topic_score_codex":0.0011369213,"about_ca_topic_score_gemma":0.0014430776,"teacher_disagreement_score":0.0039915466,"about_ca_system_score_codex":0.0022480793,"about_ca_system_score_gemma":0.00088536233,"threshold_uncertainty_score":0.01631105},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9411,0.0003639101,0.013497182,0.0003847166,0.00006721357,0.000022085536,0.00041059748,0.00026324467,0.04389103],"genre_scores_gemma":[0.9925909,0.00015689504,0.002558644,0.000042782496,0.00005454807,0.000011446847,0.00034526474,0.000035001674,0.0042045014],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997807,0.000040305047,0.000007929423,0.000035563513,0.00006509984,0.000070355556],"domain_scores_gemma":[0.99905246,0.00035767868,0.00017849004,0.00007679682,0.00007985492,0.00025466963],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001658448,0.00024068853,0.00048381631,0.0012874275,0.0010195684,0.0012589685,0.0006493921,0.00046065418,0.004058522],"category_scores_gemma":[0.0015231458,0.00024776853,0.000311268,0.0006212747,0.0010460354,0.0013936774,0.0011429643,0.00096792245,0.00044760806],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005428279,0.00010560709,0.009245384,0.00021105119,0.00004557208,0.0007230775,0.0014327186,0.018336218,0.015282558,0.92376953,0.0059266207,0.024378764],"study_design_scores_gemma":[0.000068475376,0.00014929037,0.012780016,0.000045820052,0.000037407262,0.0013211954,0.0008169827,0.047817297,0.0055234283,0.9174703,0.013925795,0.000043994256],"about_ca_topic_score_codex":0.0011049638,"about_ca_topic_score_gemma":0.0009449828,"teacher_disagreement_score":0.004058522,"about_ca_system_score_codex":0.0005093987,"about_ca_system_score_gemma":0.00022751969,"threshold_uncertainty_score":0.013577044},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7989394,0.0025480618,0.110640064,0.0045975363,0.00037561,0.00007762691,0.00041784203,0.0013774758,0.081026375],"genre_scores_gemma":[0.9811287,0.00086970726,0.009325962,0.00030886996,0.0006138765,0.00012350787,0.00037025954,0.00032256905,0.006936507],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987961,0.0003379553,0.00004996821,0.00021976707,0.00041415053,0.00018197969],"domain_scores_gemma":[0.9717452,0.020228561,0.0017830199,0.0018239039,0.0018545248,0.0025648335],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021283117,0.0009642733,0.001962035,0.0063270987,0.0025058493,0.005782055,0.0035816825,0.0026799391,0.009850879],"category_scores_gemma":[0.040089652,0.0012273063,0.0008184111,0.0025698484,0.005452643,0.008209083,0.0035288772,0.003357775,0.0007497468],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009212241,0.000055228895,0.001240312,0.00010056956,0.000016540534,0.00009895524,0.00023567349,0.0056921793,0.0011101773,0.9840567,0.002315181,0.004986309],"study_design_scores_gemma":[0.000027661821,0.000019718249,0.0009821798,0.000038376224,0.000022527065,0.00024765206,0.00014195731,0.042299397,0.00055384083,0.95460653,0.001038168,0.000022052327],"about_ca_topic_score_codex":0.0014030334,"about_ca_topic_score_gemma":0.001308994,"teacher_disagreement_score":0.009850879,"about_ca_system_score_codex":0.0025719148,"about_ca_system_score_gemma":0.0011478192,"threshold_uncertainty_score":0.032954514},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11194803,0.0050217444,0.4144986,0.011912563,0.001388954,0.00008797618,0.0008997054,0.00045550516,0.45378697],"genre_scores_gemma":[0.86099803,0.004996226,0.068159215,0.0031343834,0.0023364297,0.00018899486,0.0006554072,0.0003279048,0.05920336],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99847716,0.00043735758,0.00009539207,0.0003978409,0.00042954014,0.00016274782],"domain_scores_gemma":[0.99691296,0.0015892897,0.0002732303,0.000535188,0.00044524146,0.00024400791],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018657331,0.00082794076,0.0014632201,0.0027343286,0.0021793055,0.0039740587,0.0016874068,0.0021128915,0.011184705],"category_scores_gemma":[0.0062053753,0.0005625289,0.0014372113,0.0026224959,0.0062244325,0.014797838,0.0046423306,0.004459933,0.0013331217],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000037980437,0.0000031492175,0.000034156717,0.000015390795,0.0000022959864,0.000016622764,0.000060668524,0.00013779948,0.00008864353,0.9980825,0.00047690282,0.0010781192],"study_design_scores_gemma":[0.000004455716,0.0000031326297,0.00004884841,0.0000056578183,0.0000024809685,0.000041718275,0.00002608906,0.00043218443,0.000072954805,0.99653155,0.0028269056,0.0000040520417],"about_ca_topic_score_codex":0.0011582832,"about_ca_topic_score_gemma":0.0008146344,"teacher_disagreement_score":0.011184705,"about_ca_system_score_codex":0.0015883106,"about_ca_system_score_gemma":0.0005781298,"threshold_uncertainty_score":0.037416518},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7900825,0.0013252309,0.18202947,0.0009175361,0.000039786,0.00003324866,0.00029036222,0.00030746113,0.024974404],"genre_scores_gemma":[0.975738,0.00061503955,0.019886162,0.00024458588,0.00007596546,0.000050228304,0.00030862607,0.00007393631,0.0030074723],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99963737,0.00011641335,0.0000103540915,0.00008453226,0.00008453451,0.00006683061],"domain_scores_gemma":[0.99578387,0.003087892,0.00030513026,0.00024926747,0.00026602772,0.0003079029],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006044872,0.0002573068,0.00039748094,0.000715333,0.00062192074,0.0006616016,0.00049000187,0.0004811569,0.001799692],"category_scores_gemma":[0.0048866416,0.00032621832,0.00030885174,0.00059218257,0.001220164,0.0019482614,0.0011009261,0.001010775,0.00025172863],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015062248,0.000044137047,0.0026437172,0.00016689615,0.000019637971,0.0005412304,0.00070936856,0.027716143,0.021379331,0.92230475,0.0033935872,0.020930614],"study_design_scores_gemma":[0.000036502573,0.000070804,0.0027110428,0.00003215914,0.00002197015,0.00078358955,0.0001916701,0.08987882,0.00595111,0.8937843,0.0065180543,0.000020063486],"about_ca_topic_score_codex":0.00044416334,"about_ca_topic_score_gemma":0.00049660105,"teacher_disagreement_score":0.001799692,"about_ca_system_score_codex":0.00031556984,"about_ca_system_score_gemma":0.0001788171,"threshold_uncertainty_score":0.0060206056},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6520419,0.0016058747,0.28904113,0.0017645756,0.000089633264,0.0001480535,0.00041556306,0.000478822,0.054414395],"genre_scores_gemma":[0.94996285,0.0005218043,0.041186705,0.00018446549,0.00010678721,0.00016561656,0.00021203578,0.000109834575,0.007549871],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982741,0.0007972216,0.0000645021,0.00032578793,0.00033948838,0.00019894041],"domain_scores_gemma":[0.9914944,0.005466744,0.0012362697,0.0008581347,0.0003905313,0.0005538735],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018005583,0.00066530687,0.0007254076,0.0013039856,0.0009975615,0.0022816446,0.0017214508,0.0012799376,0.008151552],"category_scores_gemma":[0.014256226,0.00056000816,0.00070465007,0.00096312835,0.0024790566,0.008664584,0.0018039485,0.002086703,0.0005118047],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019407629,0.00011188504,0.0019043608,0.00013058724,0.000033234344,0.00008832049,0.00037866272,0.05274135,0.0025483053,0.9252027,0.0028530469,0.0138134565],"study_design_scores_gemma":[0.000030507426,0.00006474259,0.0005736937,0.000029779985,0.000011577945,0.00016316521,0.00014107932,0.16235901,0.0012143833,0.83300346,0.0023879388,0.000020701582],"about_ca_topic_score_codex":0.00070347346,"about_ca_topic_score_gemma":0.00077393523,"teacher_disagreement_score":0.008151552,"about_ca_system_score_codex":0.0020365994,"about_ca_system_score_gemma":0.0006133368,"threshold_uncertainty_score":0.027269661},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24867912,0.001748691,0.69666845,0.002562912,0.00045756449,0.00015953254,0.00039640247,0.00044967313,0.048877615],"genre_scores_gemma":[0.92977464,0.001003405,0.06196363,0.0006480784,0.00074581266,0.00023720377,0.00019333622,0.000104812665,0.0053291274],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99625045,0.0011579476,0.00019069674,0.0005015857,0.0015249985,0.00037428446],"domain_scores_gemma":[0.98799264,0.0065689986,0.0010846044,0.0011859449,0.0019517316,0.0012160381],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0046452926,0.00041252334,0.0011241795,0.00424061,0.0016290916,0.002977009,0.0018453319,0.0013520296,0.00446708],"category_scores_gemma":[0.024828449,0.0005232637,0.001211891,0.0021476664,0.0049011596,0.005947719,0.0039478904,0.0021353217,0.00039217505],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001714776,0.000010414261,0.00030952416,0.000025435918,0.000004866643,0.000043375625,0.00013508846,0.0016069498,0.00042537518,0.99450433,0.000407693,0.002509826],"study_design_scores_gemma":[0.000016043397,0.000037827773,0.00066090125,0.00006377683,0.000011492904,0.00035818768,0.00015284581,0.054676604,0.0006262371,0.9397998,0.0035549684,0.00004135065],"about_ca_topic_score_codex":0.0016390979,"about_ca_topic_score_gemma":0.0008037067,"teacher_disagreement_score":0.0046452926,"about_ca_system_score_codex":0.0021478902,"about_ca_system_score_gemma":0.0008016221,"threshold_uncertainty_score":0.024566948},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6576432,0.0006282274,0.20302264,0.0009022436,0.00015352058,0.00006483703,0.0006213733,0.00033051267,0.13663343],"genre_scores_gemma":[0.9541181,0.0005844447,0.028985197,0.00019952162,0.00008033681,0.00006641964,0.00055696984,0.00008756262,0.015321594],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99969614,0.00007836024,0.000018098313,0.000064486645,0.00007349038,0.000069394606],"domain_scores_gemma":[0.9990994,0.00031867463,0.00018822092,0.00013029568,0.00015232264,0.0001111313],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022325176,0.00035145518,0.00035677856,0.0016190968,0.0011984217,0.0018700643,0.00060692657,0.0007798668,0.004651161],"category_scores_gemma":[0.0017135311,0.00028827754,0.00034669405,0.0013808083,0.0015992784,0.0026271597,0.001190415,0.0013300292,0.0009525606],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021825404,0.000011546811,0.0002012282,0.00001619194,0.00000320116,0.00006954406,0.000094091505,0.0021114657,0.0015370955,0.98807764,0.0007929713,0.007063276],"study_design_scores_gemma":[0.000009016785,0.000013584785,0.0003508718,0.000012049647,0.000005420221,0.00014073856,0.0001344754,0.007622453,0.001357403,0.9856764,0.0046672123,0.000010258383],"about_ca_topic_score_codex":0.0013024725,"about_ca_topic_score_gemma":0.0012267289,"teacher_disagreement_score":0.004651161,"about_ca_system_score_codex":0.00059357914,"about_ca_system_score_gemma":0.0003272684,"threshold_uncertainty_score":0.015559673},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.69446355,0.0011863466,0.1551319,0.0022745652,0.00034202627,0.00007151905,0.0004791457,0.00029186075,0.14575902],"genre_scores_gemma":[0.95134306,0.00076996663,0.033117197,0.0002043135,0.00018323663,0.00007262935,0.00040677993,0.00009511106,0.013807692],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99926156,0.00016367478,0.0000314003,0.000100487094,0.00019739615,0.00024539957],"domain_scores_gemma":[0.9962424,0.0023077598,0.0002909058,0.0004553975,0.00031572254,0.0003878905],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011056231,0.00057473715,0.00042793687,0.0010518909,0.0015774574,0.0024091066,0.0008107117,0.00075411174,0.0061149662],"category_scores_gemma":[0.00436521,0.0003710174,0.0005955211,0.00076763064,0.0032008092,0.0035795404,0.0016795635,0.002166538,0.0011300676],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011277995,0.0000380765,0.00092391483,0.00006272745,0.0000058381356,0.00018863399,0.00032310595,0.00457397,0.0036128375,0.97799623,0.0017797109,0.0103821345],"study_design_scores_gemma":[0.000015455957,0.000059628463,0.0003438149,0.0000360019,0.000011424747,0.00031763854,0.00026501098,0.013138328,0.005058721,0.97402716,0.0066977805,0.000029015235],"about_ca_topic_score_codex":0.00091263716,"about_ca_topic_score_gemma":0.001346111,"teacher_disagreement_score":0.0061149662,"about_ca_system_score_codex":0.00078895723,"about_ca_system_score_gemma":0.0007077863,"threshold_uncertainty_score":0.020456553},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6069943,0.0019760577,0.21269064,0.0034146744,0.00028400664,0.00012761769,0.0009939407,0.0006440963,0.17287475],"genre_scores_gemma":[0.9446682,0.0008810579,0.031520803,0.0004802529,0.00018642007,0.00013815303,0.00048702452,0.00020004039,0.021438045],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99916697,0.00020716706,0.000047808688,0.00018650753,0.00023255796,0.00015911066],"domain_scores_gemma":[0.99395174,0.0033287937,0.0005950903,0.0006818939,0.00064950524,0.00079289556],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007024084,0.00059862854,0.0008419625,0.0019353715,0.0014728709,0.0030210614,0.0019694048,0.0016069876,0.010738921],"category_scores_gemma":[0.0068237446,0.0008071228,0.00066968607,0.0017897538,0.0019018793,0.00556478,0.0019700543,0.0018449867,0.001113471],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011421183,0.000028518749,0.0005802786,0.00009111495,0.000014196638,0.00014945905,0.00023011719,0.00300707,0.0029521172,0.980243,0.002325363,0.010264508],"study_design_scores_gemma":[0.000023696632,0.000013427099,0.00021555081,0.000019956162,0.000010660982,0.00018100966,0.000095995165,0.00803214,0.0012037959,0.98765,0.0025441754,0.000009737997],"about_ca_topic_score_codex":0.001425598,"about_ca_topic_score_gemma":0.0020968784,"teacher_disagreement_score":0.010738921,"about_ca_system_score_codex":0.0010895794,"about_ca_system_score_gemma":0.00070295145,"threshold_uncertainty_score":0.03592521},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27009836,0.0032071664,0.54876614,0.0035587451,0.00025717632,0.000272139,0.0035711646,0.00298803,0.16728114],"genre_scores_gemma":[0.7493417,0.0028511568,0.19615483,0.0016533631,0.0002610423,0.00046231397,0.0035212997,0.0004688457,0.045285523],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994041,0.00015401308,0.00003171303,0.0001665334,0.000118049895,0.00012559874],"domain_scores_gemma":[0.99785006,0.0009951756,0.0002190722,0.00037101252,0.0002880221,0.00027661698],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039978835,0.00044599405,0.00033355947,0.00082128687,0.0014324725,0.0023387147,0.0010108193,0.00061030925,0.012902617],"category_scores_gemma":[0.0021991367,0.00041510147,0.00042123607,0.0020111976,0.0011706097,0.002985136,0.001690763,0.0014549978,0.0020872252],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026720169,0.00013942242,0.002765022,0.00041581906,0.000058404723,0.0004137688,0.0008676479,0.013561129,0.01495377,0.8606574,0.021351717,0.084548675],"study_design_scores_gemma":[0.000092320784,0.00009201402,0.0018829461,0.0001014134,0.0000616236,0.0009354302,0.00070734427,0.06628301,0.011000786,0.8241732,0.094609186,0.000060709477],"about_ca_topic_score_codex":0.003149205,"about_ca_topic_score_gemma":0.0034945586,"teacher_disagreement_score":0.012902617,"about_ca_system_score_codex":0.0018354965,"about_ca_system_score_gemma":0.0008503238,"threshold_uncertainty_score":0.043163538},"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":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012546962,0.06441043,0.459603,0.0053223916,0.003281827,0.000065306675,0.00041637075,0.00089434616,0.4534594],"genre_scores_gemma":[0.41573906,0.055963352,0.19572686,0.0023048378,0.007894327,0.000374974,0.0006881152,0.0009930498,0.3203155],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99938416,0.00018842511,0.00003053069,0.00010242552,0.00024440268,0.00005009313],"domain_scores_gemma":[0.99936,0.00036285672,0.000029312918,0.00013443445,0.00007645467,0.000036940117],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009488654,0.0007690086,0.0005153096,0.0021094207,0.0008940349,0.002519083,0.00071389566,0.00057151885,0.010356529],"category_scores_gemma":[0.001621228,0.00035886932,0.00069926854,0.0015208538,0.0025438454,0.003484694,0.0014312657,0.002175401,0.0034165988],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000029023608,0.0000061040632,0.000039813815,0.00004763972,0.0000051940406,0.000017790393,0.00010484313,0.00044048514,0.00017915269,0.97673506,0.005199517,0.017221507],"study_design_scores_gemma":[0.0000036001884,0.000008464595,0.00011980451,0.00005058735,0.0000059913564,0.000078476485,0.000041234834,0.002241321,0.00038023572,0.8969916,0.100069396,0.000009343691],"about_ca_topic_score_codex":0.0006899133,"about_ca_topic_score_gemma":0.000931336,"teacher_disagreement_score":0.010356529,"about_ca_system_score_codex":0.0016965679,"about_ca_system_score_gemma":0.00062913226,"threshold_uncertainty_score":0.034645975},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2591119,0.0032701504,0.41353247,0.0077306814,0.002827867,0.0001912861,0.0011388019,0.00070743717,0.31148937],"genre_scores_gemma":[0.8766246,0.0012438776,0.07067962,0.002627439,0.0015568858,0.00026556323,0.0007100986,0.00023697068,0.046055056],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99938095,0.00008728375,0.000042411386,0.000250537,0.00012611857,0.00011259725],"domain_scores_gemma":[0.9991748,0.00032044313,0.000078668214,0.0001774678,0.0001341433,0.00011455745],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008357466,0.00056019315,0.000946075,0.0020089105,0.0019506216,0.001834341,0.0012905606,0.0010639066,0.009099713],"category_scores_gemma":[0.002236648,0.00039114492,0.002118129,0.0011475841,0.0026029663,0.0067901667,0.0038296282,0.002533084,0.0010246031],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031513497,0.000013097674,0.00026845338,0.00005397036,0.000014226587,0.00007759676,0.00024862026,0.00041460327,0.0011168015,0.99027866,0.00230766,0.005174827],"study_design_scores_gemma":[0.0000111244735,0.00002415963,0.0006115419,0.000019602418,0.00001856017,0.00020127678,0.00008007345,0.002090759,0.0006706067,0.9848134,0.011445909,0.000013087973],"about_ca_topic_score_codex":0.0011757559,"about_ca_topic_score_gemma":0.0007878649,"teacher_disagreement_score":0.009099713,"about_ca_system_score_codex":0.0013289086,"about_ca_system_score_gemma":0.0004794592,"threshold_uncertainty_score":0.030441582},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18756396,0.005468882,0.3854342,0.112108484,0.006840286,0.00030425066,0.0024713017,0.0019713913,0.29783717],"genre_scores_gemma":[0.85671973,0.0035168957,0.0924035,0.00831488,0.0039032986,0.00039638724,0.0015143387,0.00059589784,0.03263514],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99786985,0.00062624266,0.000113967355,0.00046904307,0.00066039595,0.00026049474],"domain_scores_gemma":[0.98112273,0.01378474,0.0006755914,0.0017750313,0.0015877989,0.0010541654],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033293748,0.0015312735,0.0019001359,0.0024358346,0.0026603015,0.003309425,0.0027472144,0.002550409,0.023054196],"category_scores_gemma":[0.020597955,0.0010978669,0.0024507397,0.0029026568,0.0077174455,0.0130881425,0.009108966,0.009691969,0.0021137965],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000097374366,0.000072609546,0.00047954902,0.00021913246,0.000032189888,0.00019319459,0.0005609462,0.0016480788,0.0007474397,0.9751769,0.013539622,0.0072329855],"study_design_scores_gemma":[0.00005073967,0.000024301597,0.00026229085,0.00004092493,0.00002390253,0.00011384777,0.000113236616,0.0038627114,0.00031415225,0.98590964,0.009267585,0.00001670667],"about_ca_topic_score_codex":0.0028072686,"about_ca_topic_score_gemma":0.0020206296,"teacher_disagreement_score":0.023054196,"about_ca_system_score_codex":0.0026293995,"about_ca_system_score_gemma":0.0011680245,"threshold_uncertainty_score":0.07712394},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.84164447,0.00070777,0.13133857,0.00062203925,0.00006970227,0.0000474493,0.0003130003,0.00030495433,0.024952145],"genre_scores_gemma":[0.98450655,0.00015807246,0.012385604,0.00006244995,0.000063965,0.000052542167,0.00016682394,0.000038237526,0.0025658782],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988367,0.00028639438,0.00007061788,0.0002740658,0.00036277052,0.00016944598],"domain_scores_gemma":[0.9936407,0.0033635865,0.0008333634,0.0007318751,0.00075094355,0.0006796011],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007672269,0.00040309576,0.0005894582,0.0017234841,0.00090404437,0.0014967966,0.0006706841,0.0006514035,0.00373418],"category_scores_gemma":[0.010851729,0.00036505854,0.0003915075,0.0006347274,0.001790512,0.0020796391,0.0014979201,0.0010853414,0.0003997211],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002222833,0.000054608885,0.0021119541,0.00012883348,0.00002424512,0.0003256074,0.00041997555,0.02376737,0.012209987,0.9448682,0.0015276297,0.014339274],"study_design_scores_gemma":[0.000024289184,0.000111205525,0.0016662299,0.000037784426,0.000014336209,0.00046960358,0.00016218529,0.15464415,0.006478954,0.8324686,0.0038879008,0.00003473347],"about_ca_topic_score_codex":0.00039676143,"about_ca_topic_score_gemma":0.0004003734,"teacher_disagreement_score":0.00373418,"about_ca_system_score_codex":0.00096342975,"about_ca_system_score_gemma":0.00032994885,"threshold_uncertainty_score":0.012492061},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9145416,0.00070590293,0.052286405,0.0007035916,0.000080953134,0.00006646986,0.00064496027,0.00030452025,0.030665603],"genre_scores_gemma":[0.9827208,0.00020680403,0.011776734,0.00011562946,0.00002103856,0.000058748232,0.00055543863,0.000043759104,0.004501034],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983228,0.00018423829,0.00010396546,0.00064681406,0.0002831988,0.00045888865],"domain_scores_gemma":[0.9885621,0.004937453,0.0015946701,0.0019292933,0.001134635,0.0018417874],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009843914,0.0005971805,0.0010167529,0.0016455811,0.003204638,0.0032363508,0.002090947,0.0017155152,0.0051227473],"category_scores_gemma":[0.006652794,0.000789571,0.0008763398,0.002275403,0.004063106,0.006389035,0.0036227265,0.0013902435,0.00060112565],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033692035,0.00010284161,0.011470253,0.0002488296,0.0000862377,0.0013462375,0.0015293106,0.0040210416,0.007189121,0.9519518,0.0023254722,0.019391945],"study_design_scores_gemma":[0.000043920885,0.000073539675,0.003765197,0.000060265393,0.00008358176,0.0016728529,0.0013199924,0.011641174,0.0068144593,0.9576833,0.016784286,0.00005736821],"about_ca_topic_score_codex":0.002231184,"about_ca_topic_score_gemma":0.00377703,"teacher_disagreement_score":0.0051227473,"about_ca_system_score_codex":0.0016530952,"about_ca_system_score_gemma":0.0010071319,"threshold_uncertainty_score":0.017137289},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.68096954,0.0016258743,0.27789202,0.0040335427,0.00010601881,0.00015439272,0.0004665664,0.00063056033,0.034121506],"genre_scores_gemma":[0.97252613,0.0010478339,0.017589819,0.0003487923,0.0001497549,0.0001982039,0.00029360096,0.00012974477,0.0077161514],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99720496,0.0012610966,0.00010198349,0.00044885706,0.00048681963,0.00049631955],"domain_scores_gemma":[0.9789828,0.013969201,0.0026846926,0.0016184222,0.00074944826,0.0019954024],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025667863,0.0010695277,0.0016041183,0.0027414907,0.0019971689,0.0029328691,0.0022077458,0.0019276601,0.0047651487],"category_scores_gemma":[0.022712667,0.00089901715,0.0010636587,0.0015216933,0.005500495,0.0068269516,0.003056587,0.0026391312,0.0007219342],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000105915264,0.00005139425,0.0009496085,0.00008483595,0.000028590262,0.00015223955,0.00043090605,0.043761756,0.0012736205,0.9454691,0.0020375664,0.005654468],"study_design_scores_gemma":[0.000041404706,0.0000449554,0.00057102164,0.000030810414,0.000015104514,0.0001606864,0.00013837166,0.19281742,0.00049094524,0.8038088,0.0018537596,0.000026733245],"about_ca_topic_score_codex":0.0026064,"about_ca_topic_score_gemma":0.0020436563,"teacher_disagreement_score":0.0047651487,"about_ca_system_score_codex":0.0026871685,"about_ca_system_score_gemma":0.0009244767,"threshold_uncertainty_score":0.019496858},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43423665,0.0052793818,0.36431047,0.0034069289,0.0005587434,0.00013640197,0.0010308832,0.0005422701,0.1904982],"genre_scores_gemma":[0.90715563,0.0032463241,0.05035798,0.000703969,0.00036606964,0.00018106661,0.0006114911,0.00014990765,0.037227485],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993591,0.0001734802,0.000047823625,0.00013628491,0.00018948627,0.00009384428],"domain_scores_gemma":[0.9973749,0.001449225,0.00031231352,0.00017365401,0.00029696134,0.0003928359],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006709031,0.00045071176,0.0007733901,0.003427799,0.0021843286,0.0038625982,0.0009469404,0.0010657858,0.0055886554],"category_scores_gemma":[0.0034626797,0.0007188531,0.00054047455,0.003443308,0.002640952,0.0058445446,0.0019132248,0.0020500128,0.0008248232],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000060537363,0.000008358101,0.00011971679,0.00002063761,0.00000221539,0.000040373736,0.00017538923,0.00035838742,0.0001665745,0.99607724,0.00041673498,0.0026083672],"study_design_scores_gemma":[0.000005432868,0.0000036050499,0.00008680014,0.000014198192,0.000005489904,0.000070604896,0.00009049885,0.0014891973,0.000121427765,0.99447036,0.0036384794,0.0000039974766],"about_ca_topic_score_codex":0.0014306342,"about_ca_topic_score_gemma":0.002429684,"teacher_disagreement_score":0.0055886554,"about_ca_system_score_codex":0.0015397076,"about_ca_system_score_gemma":0.00058617484,"threshold_uncertainty_score":0.01869589},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.61572725,0.0039787237,0.15732776,0.0027669354,0.0008759576,0.000073180236,0.00067134015,0.00033482362,0.21824409],"genre_scores_gemma":[0.9567046,0.0011167597,0.016556924,0.0003679962,0.00030747024,0.00009943637,0.00025830872,0.00010857788,0.024479905],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99901545,0.00026735902,0.000077659126,0.00019227676,0.00026835912,0.00017893132],"domain_scores_gemma":[0.99791366,0.001019502,0.00019860666,0.00024927966,0.00033564505,0.00028326048],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001569877,0.00092895416,0.0008387391,0.0046120454,0.0023348106,0.004881684,0.0014813402,0.0012759282,0.0063945376],"category_scores_gemma":[0.0043159914,0.0006029845,0.0008479555,0.0027485446,0.004565776,0.0064222673,0.0028454117,0.0038140302,0.0011721322],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017201219,0.000009417637,0.000095971984,0.000015684605,0.000004340982,0.000025634263,0.00018648869,0.00021266361,0.00017467159,0.9972146,0.00022148743,0.0018218242],"study_design_scores_gemma":[0.000008460988,0.000007983804,0.00014239873,0.000011080323,0.0000055086643,0.000058360893,0.00008071996,0.00085535273,0.00019912283,0.99708766,0.0015335769,0.0000097791435],"about_ca_topic_score_codex":0.0011774517,"about_ca_topic_score_gemma":0.00074716983,"teacher_disagreement_score":0.0063945376,"about_ca_system_score_codex":0.002184731,"about_ca_system_score_gemma":0.0009039286,"threshold_uncertainty_score":0.021391869},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33308148,0.002735082,0.3324148,0.008059426,0.0011330467,0.00013947813,0.00095108437,0.0007107875,0.3207748],"genre_scores_gemma":[0.885681,0.002687527,0.050807748,0.0013072672,0.0011948531,0.0002787669,0.00048805305,0.00032924453,0.05722559],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986462,0.00030131344,0.00009871055,0.00029370908,0.0004574287,0.00020274594],"domain_scores_gemma":[0.9958016,0.0023154733,0.00038241362,0.00060717633,0.000494132,0.0003991229],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002265183,0.0009251891,0.0020079557,0.0035923596,0.003436704,0.0042548375,0.0025954219,0.0021461402,0.008801353],"category_scores_gemma":[0.0072495495,0.00091475615,0.0016706318,0.002926437,0.005165194,0.014448192,0.0042220685,0.006165423,0.0014335649],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017019443,0.0000121150415,0.00007420853,0.000018473107,0.000004252045,0.000031016276,0.00007844937,0.00021685493,0.0001218572,0.9971367,0.0006298269,0.0016592132],"study_design_scores_gemma":[0.000011589513,0.0000034849866,0.000043334465,0.0000055647197,0.0000076265023,0.000074590935,0.000027102786,0.0009821026,0.00013539831,0.9972077,0.0014955995,0.000006040699],"about_ca_topic_score_codex":0.00082854833,"about_ca_topic_score_gemma":0.00063653145,"teacher_disagreement_score":0.008801353,"about_ca_system_score_codex":0.0018609248,"about_ca_system_score_gemma":0.0010915071,"threshold_uncertainty_score":0.029443443},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.55336887,0.0023862573,0.35346425,0.002229194,0.00046162357,0.00011400287,0.0006860071,0.0011174333,0.08617238],"genre_scores_gemma":[0.9115136,0.0008853385,0.07410878,0.00040415602,0.0002711859,0.0001369409,0.00062627957,0.00023183331,0.0118217915],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99884796,0.000239464,0.000100847676,0.00035591755,0.00030796503,0.00014787177],"domain_scores_gemma":[0.9967776,0.0019014218,0.0003971391,0.00028989473,0.00036070723,0.00027320493],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012519611,0.0005345698,0.0007081129,0.0009843132,0.0016418643,0.0018808382,0.0007687847,0.00076825416,0.0064507215],"category_scores_gemma":[0.006646884,0.00035263068,0.00081567717,0.001055828,0.0029402226,0.0057979976,0.0022263476,0.0020672893,0.0013809162],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023029173,0.00003886514,0.0008155745,0.00019046644,0.000010231113,0.00063307735,0.0009326873,0.006293635,0.0068897437,0.9586449,0.0019490125,0.023371462],"study_design_scores_gemma":[0.000017172091,0.00004399331,0.00019032451,0.00005050399,0.000009291245,0.0003136577,0.00020942226,0.014017179,0.0034110243,0.97360706,0.008107551,0.000022935295],"about_ca_topic_score_codex":0.00085257314,"about_ca_topic_score_gemma":0.00071141205,"teacher_disagreement_score":0.0064507215,"about_ca_system_score_codex":0.0010053661,"about_ca_system_score_gemma":0.0006823423,"threshold_uncertainty_score":0.021579802},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8889275,0.0015133101,0.0961487,0.0012723937,0.00007170448,0.00008294015,0.00020929147,0.0005015157,0.011272622],"genre_scores_gemma":[0.99357176,0.00029737627,0.00482387,0.000093323164,0.00007229166,0.000052078267,0.000108289496,0.00006387546,0.00091715384],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996511,0.00010022674,0.0000108349905,0.00008838562,0.000060789724,0.00008873248],"domain_scores_gemma":[0.9971072,0.0016360899,0.00052821613,0.00025425234,0.000115786956,0.00035842386],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007825565,0.0004289459,0.00062696665,0.000833216,0.00060506247,0.0011197029,0.0010946086,0.00092375034,0.0028284786],"category_scores_gemma":[0.0061573614,0.00036573975,0.0007357667,0.0005409917,0.0014734651,0.0026216765,0.00086842105,0.0011924192,0.00020367384],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00042096848,0.00018528505,0.0074223126,0.00026936276,0.000076090735,0.0008036949,0.00070051535,0.10529268,0.02490986,0.84216917,0.003939581,0.013810524],"study_design_scores_gemma":[0.00010565548,0.00015484636,0.0038386204,0.00004644669,0.000048926846,0.000421347,0.0001806917,0.66381556,0.0050614905,0.3247009,0.0015880238,0.000037513655],"about_ca_topic_score_codex":0.0024621848,"about_ca_topic_score_gemma":0.0014261996,"teacher_disagreement_score":0.0028284786,"about_ca_system_score_codex":0.0011041673,"about_ca_system_score_gemma":0.0003470413,"threshold_uncertainty_score":0.009462178},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3139586,0.011778426,0.6104341,0.012313168,0.0005236136,0.00023346717,0.002607145,0.0025468648,0.045604676],"genre_scores_gemma":[0.8711822,0.006465332,0.10611111,0.0022463077,0.0011804169,0.0008653993,0.0019120713,0.0019360875,0.008101034],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9934202,0.0019991298,0.00038982046,0.0017938464,0.0013523448,0.001044702],"domain_scores_gemma":[0.83866256,0.13215928,0.0064339037,0.0120285265,0.003827272,0.006888462],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010517984,0.0034951747,0.004583542,0.0076394686,0.0031956532,0.010194893,0.009351167,0.0048113777,0.010240775],"category_scores_gemma":[0.07719286,0.0031588282,0.0025667788,0.0064513385,0.0076889973,0.024353076,0.010398526,0.013333124,0.0017738559],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0018583726,0.00036516937,0.004680716,0.0009574608,0.00030546155,0.00023928437,0.0014558808,0.08737246,0.009507643,0.8432485,0.009660398,0.040348716],"study_design_scores_gemma":[0.000095654184,0.00009660302,0.00070453295,0.00018723734,0.00013313949,0.00023488632,0.00022094627,0.17526008,0.0029156997,0.81772995,0.0023400162,0.00008131727],"about_ca_topic_score_codex":0.0011906866,"about_ca_topic_score_gemma":0.0015803673,"teacher_disagreement_score":0.010517984,"about_ca_system_score_codex":0.005561382,"about_ca_system_score_gemma":0.0020005354,"threshold_uncertainty_score":0.05562508},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07906893,0.0036233654,0.8926946,0.0047265054,0.00043366748,0.00007064017,0.0013213101,0.0014089283,0.016652124],"genre_scores_gemma":[0.7160998,0.0019157453,0.26265776,0.00076797494,0.0011941877,0.00029971427,0.0026447258,0.0008983213,0.013521754],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99532264,0.001957952,0.00017725983,0.0016392912,0.00059224776,0.00031061572],"domain_scores_gemma":[0.9643132,0.028124183,0.0011852887,0.0040931473,0.001548066,0.0007360094],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005128775,0.001200711,0.0025326011,0.0033518905,0.0013528875,0.0039021797,0.003373666,0.0036488408,0.010845619],"category_scores_gemma":[0.06224425,0.0015998579,0.001274971,0.003070504,0.0026344578,0.01277942,0.0034923588,0.0046918187,0.0028090938],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012071164,0.00028648417,0.012231482,0.0010090146,0.00040204264,0.00021069225,0.00045318354,0.1979321,0.008447553,0.47884563,0.030542819,0.2684319],"study_design_scores_gemma":[0.00004431266,0.000077200806,0.0020659417,0.000110680856,0.0000702199,0.00019906713,0.0000820237,0.48036283,0.0035985538,0.5071894,0.006161589,0.00003816727],"about_ca_topic_score_codex":0.0012441428,"about_ca_topic_score_gemma":0.0014379388,"teacher_disagreement_score":0.010845619,"about_ca_system_score_codex":0.0017935537,"about_ca_system_score_gemma":0.001299428,"threshold_uncertainty_score":0.03628224},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8055524,0.0009477846,0.16199,0.0013489813,0.00017265278,0.000056323348,0.00047164623,0.0002982102,0.02916195],"genre_scores_gemma":[0.96109366,0.0006982818,0.027181529,0.0003716176,0.00014243975,0.00007979021,0.00045736082,0.00020425009,0.009771214],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99843794,0.00055121694,0.00010944015,0.0002871227,0.00035304914,0.00026133173],"domain_scores_gemma":[0.9796729,0.012278372,0.0026041921,0.0022291297,0.0015051942,0.0017101845],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019178907,0.0006550758,0.0009787462,0.0023712104,0.0018219062,0.0032054104,0.0015213998,0.0015600177,0.0034810265],"category_scores_gemma":[0.011643311,0.0012171987,0.0008880427,0.0022881015,0.0036917357,0.005519959,0.0022873734,0.0027727291,0.00041859015],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016193306,0.000026917898,0.0015182949,0.000080719474,0.000015899033,0.00019447948,0.00080801,0.003995624,0.0034495203,0.98333794,0.00096863555,0.005442019],"study_design_scores_gemma":[0.0000143960115,0.000009231873,0.00054682174,0.00001711489,0.000015693988,0.00008359864,0.00012278272,0.006156822,0.0008628333,0.9907252,0.0014352639,0.000010254619],"about_ca_topic_score_codex":0.0018468378,"about_ca_topic_score_gemma":0.0032882688,"teacher_disagreement_score":0.0034810265,"about_ca_system_score_codex":0.0014971993,"about_ca_system_score_gemma":0.0006065233,"threshold_uncertainty_score":0.011645198},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.89536536,0.00042498464,0.07385068,0.0008826755,0.000072839124,0.00003606806,0.0006842645,0.0006025337,0.028080683],"genre_scores_gemma":[0.9735649,0.0005535534,0.018689578,0.00012966293,0.00008970464,0.00010829498,0.0008581222,0.000111521214,0.005894723],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995635,0.00010108753,0.000016390568,0.00012592561,0.00012115358,0.0000718007],"domain_scores_gemma":[0.99679273,0.0016544685,0.000510541,0.00036619397,0.00037157247,0.00030439722],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004217055,0.00034618165,0.00040774603,0.0016507054,0.0007642188,0.0013216818,0.0011499932,0.0010661813,0.0047416654],"category_scores_gemma":[0.0066338503,0.00038299704,0.00035281578,0.0009132191,0.0013738038,0.0025720445,0.0010495451,0.00061506435,0.000431256],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00040202783,0.00006951491,0.011097497,0.00036468235,0.00007198599,0.0006188279,0.00044515642,0.08074177,0.047559932,0.802363,0.0065092873,0.04975629],"study_design_scores_gemma":[0.000056604735,0.000087283624,0.009230292,0.000071841314,0.00007700248,0.0018124213,0.0003326783,0.29127783,0.024687015,0.6632449,0.009044204,0.00007798993],"about_ca_topic_score_codex":0.0004837271,"about_ca_topic_score_gemma":0.00053492584,"teacher_disagreement_score":0.0047416654,"about_ca_system_score_codex":0.000869582,"about_ca_system_score_gemma":0.00035689797,"threshold_uncertainty_score":0.015862465},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8440845,0.0022213277,0.070905544,0.0017128757,0.00010032146,0.00006999307,0.00023183771,0.00022901437,0.08044462],"genre_scores_gemma":[0.9678312,0.0010877119,0.012016101,0.00024023135,0.00017629219,0.000097046875,0.00015933858,0.000055022476,0.018337088],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995678,0.0001437524,0.000019600608,0.000070134396,0.00012746194,0.00007121922],"domain_scores_gemma":[0.9967505,0.0020970812,0.00039655683,0.00017369215,0.00022949176,0.00035279137],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005820872,0.0004324325,0.0005917154,0.0026185228,0.0019417411,0.0025492592,0.00095954025,0.0010455875,0.0038680346],"category_scores_gemma":[0.0043650214,0.0006410454,0.00037315403,0.0023952343,0.0034521993,0.0034291022,0.0015703741,0.0014468307,0.00026032614],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016305383,0.000012262934,0.00026454302,0.0000228924,0.0000041729218,0.00010673408,0.0004604275,0.0013807222,0.00049706234,0.99334866,0.00064827665,0.0032379276],"study_design_scores_gemma":[0.000007743432,0.000003377053,0.000163889,0.000005502942,0.0000043602313,0.000056053133,0.00009623701,0.0032890248,0.00015276673,0.99517643,0.0010401659,0.000004555021],"about_ca_topic_score_codex":0.0028646241,"about_ca_topic_score_gemma":0.004866639,"teacher_disagreement_score":0.0038680346,"about_ca_system_score_codex":0.0012385891,"about_ca_system_score_gemma":0.00053924625,"threshold_uncertainty_score":0.01293987},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.70841426,0.0012723709,0.21962646,0.002857253,0.00018314018,0.00026462704,0.0018505096,0.0005962144,0.06493513],"genre_scores_gemma":[0.95250523,0.0006442357,0.03515114,0.0004802946,0.00023782773,0.00027427264,0.0011274241,0.00010781897,0.009471701],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979444,0.00051594607,0.00021445137,0.00036273652,0.00057750876,0.00038500308],"domain_scores_gemma":[0.9894694,0.005654971,0.0014019465,0.0009853574,0.0013787261,0.0011094864],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023612743,0.0005534996,0.0012745612,0.0023801348,0.0012891502,0.0026773545,0.0015356153,0.0017292645,0.009173288],"category_scores_gemma":[0.0148795005,0.0007737022,0.0008467961,0.0019505584,0.0025569992,0.006724168,0.002792926,0.0017168574,0.00079975696],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00080703845,0.00014564805,0.0059364163,0.00032498734,0.000051908446,0.00034380544,0.0007565217,0.023886705,0.007727686,0.93353903,0.0058476194,0.020632632],"study_design_scores_gemma":[0.00011394654,0.00008383562,0.0013861356,0.00004645446,0.000020827458,0.00017855856,0.00027958053,0.04215965,0.0028830098,0.9483456,0.0044543934,0.000048082267],"about_ca_topic_score_codex":0.0012657986,"about_ca_topic_score_gemma":0.0016589115,"teacher_disagreement_score":0.009173288,"about_ca_system_score_codex":0.0017284638,"about_ca_system_score_gemma":0.00092247856,"threshold_uncertainty_score":0.03068763},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21605286,0.0033315467,0.5645575,0.0096702585,0.0011726622,0.00060382887,0.004095501,0.002903771,0.19761208],"genre_scores_gemma":[0.72652954,0.0021606877,0.1740678,0.0030115172,0.0010042684,0.0008481544,0.004806795,0.0014098888,0.08616141],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99738973,0.00072199065,0.00011210594,0.0007525278,0.00038130034,0.0006423888],"domain_scores_gemma":[0.99397534,0.0034941507,0.0004736623,0.0010690985,0.00036303842,0.00062476756],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001712335,0.001396445,0.0015325338,0.0012408834,0.0031612332,0.0028434733,0.0033741388,0.0020713876,0.026338192],"category_scores_gemma":[0.008973916,0.00075441285,0.0020401478,0.0017153315,0.0027856962,0.009492574,0.0045687715,0.0043870914,0.003346089],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023837158,0.00011805168,0.0005489612,0.0004062505,0.00006492703,0.000130382,0.0002775089,0.01801666,0.0013755064,0.9210076,0.029018585,0.02879718],"study_design_scores_gemma":[0.000045610825,0.000045320972,0.00036694584,0.00003826865,0.00003244069,0.00013810092,0.000104007406,0.037120983,0.0010084695,0.94771665,0.013355122,0.000028149958],"about_ca_topic_score_codex":0.0018614385,"about_ca_topic_score_gemma":0.0026700255,"teacher_disagreement_score":0.026338192,"about_ca_system_score_codex":0.002981319,"about_ca_system_score_gemma":0.0016721133,"threshold_uncertainty_score":0.08811003},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3249681,0.002545389,0.5834534,0.0055887247,0.00044965697,0.000070541115,0.0018222678,0.0011161908,0.079985626],"genre_scores_gemma":[0.94416344,0.0010512009,0.03822947,0.00058852055,0.0005092689,0.0001005417,0.00082972663,0.00030399443,0.014223766],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986389,0.00035166935,0.000052121697,0.00027074973,0.0005089549,0.00017759317],"domain_scores_gemma":[0.9896281,0.0074751275,0.0005244771,0.0011896001,0.00069683784,0.0004858491],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015391601,0.00057031325,0.0010511361,0.0020544727,0.001305534,0.0031811662,0.0017525193,0.0011020404,0.011227429],"category_scores_gemma":[0.015724286,0.00047959868,0.0007473628,0.0020367622,0.0022517026,0.0074855494,0.002742997,0.0032150093,0.0010605742],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000054667336,0.000026233029,0.00043422988,0.00009390065,0.0000125697825,0.00006963252,0.00013480298,0.0068746437,0.000602332,0.9827172,0.0031476724,0.0058321366],"study_design_scores_gemma":[0.0000063836205,0.000009673162,0.0002148656,0.000013949188,0.0000068221457,0.00006924185,0.00003578113,0.029540876,0.0005171815,0.96804965,0.0015277766,0.000007812929],"about_ca_topic_score_codex":0.0011963043,"about_ca_topic_score_gemma":0.001615872,"teacher_disagreement_score":0.011227429,"about_ca_system_score_codex":0.0019880089,"about_ca_system_score_gemma":0.0005265345,"threshold_uncertainty_score":0.03755951},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.64310473,0.0007439355,0.28563982,0.0022523226,0.00024966185,0.00018475273,0.0016664129,0.00075437606,0.06540396],"genre_scores_gemma":[0.8575771,0.0005800971,0.11829964,0.00042540132,0.00020399399,0.00024253642,0.0012951236,0.00035982483,0.021016238],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992873,0.00021412218,0.00002529723,0.00021445099,0.000107705804,0.00015118068],"domain_scores_gemma":[0.9960908,0.0019335188,0.0004139152,0.0005684098,0.00036590992,0.00062729226],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007200694,0.0005592758,0.00067545974,0.001213925,0.0020863712,0.0026613544,0.0015180049,0.0010798249,0.006347728],"category_scores_gemma":[0.0034101058,0.00074253615,0.00059727445,0.0014483394,0.0017457829,0.0036772334,0.001383657,0.001541573,0.00082116516],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00050454185,0.00019484869,0.0030887634,0.00028862146,0.00008578768,0.00032774833,0.0007879321,0.013721907,0.017770588,0.9203133,0.009903252,0.033012755],"study_design_scores_gemma":[0.00004908514,0.000041823536,0.0010333216,0.000033119864,0.000033393506,0.00019045285,0.00029930455,0.029483179,0.0037386105,0.95929164,0.0057846196,0.000021537166],"about_ca_topic_score_codex":0.002151375,"about_ca_topic_score_gemma":0.0036356484,"teacher_disagreement_score":0.006347728,"about_ca_system_score_codex":0.0013253512,"about_ca_system_score_gemma":0.0009575224,"threshold_uncertainty_score":0.021235228},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5994314,0.0029132725,0.25965065,0.007703283,0.00047392104,0.00006842808,0.0006790468,0.00039062975,0.12868948],"genre_scores_gemma":[0.9543382,0.0022540437,0.026883174,0.0011126618,0.0012003065,0.00014093121,0.00069422985,0.00018836932,0.013188001],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99904996,0.00032521883,0.00004700738,0.00024329951,0.00021305236,0.00012138166],"domain_scores_gemma":[0.99023294,0.006736746,0.00071050157,0.0006457086,0.0008247632,0.0008492804],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015893793,0.0007862063,0.0011064042,0.0029594235,0.002778271,0.0028605831,0.0017635898,0.0016969807,0.0054792613],"category_scores_gemma":[0.008702227,0.00063305994,0.0009979402,0.0035685857,0.005071453,0.0120697515,0.0028557272,0.00382087,0.0005391892],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023421468,0.0000175315,0.00025153422,0.00002869152,0.0000060259817,0.000038231374,0.00027914564,0.0008794492,0.0005006057,0.99380904,0.0008729927,0.0032933208],"study_design_scores_gemma":[0.0000043111686,0.000008186539,0.00014295364,0.000006515111,0.000004420191,0.000040969873,0.000063352585,0.002490562,0.000099920086,0.99634176,0.00079222536,0.000004745258],"about_ca_topic_score_codex":0.001635479,"about_ca_topic_score_gemma":0.001268275,"teacher_disagreement_score":0.0054792613,"about_ca_system_score_codex":0.0011915477,"about_ca_system_score_gemma":0.00064689317,"threshold_uncertainty_score":0.018329918},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.66216326,0.0009775666,0.27056757,0.0013527843,0.00020036596,0.00007011287,0.00045609544,0.0005864144,0.06362589],"genre_scores_gemma":[0.9519148,0.000601248,0.03198515,0.00022997361,0.00011683395,0.00008358694,0.00043366876,0.00013307668,0.0145016955],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988813,0.0002876688,0.00009343319,0.00020212602,0.00030010575,0.00023540884],"domain_scores_gemma":[0.9918609,0.0049502784,0.0007765321,0.00054528523,0.00078421534,0.0010828996],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015534925,0.00064586254,0.0009880963,0.005026816,0.0027187916,0.0048205927,0.0022687973,0.0017810651,0.007147362],"category_scores_gemma":[0.011087693,0.00088146375,0.0007246976,0.0042637093,0.0033983043,0.009024662,0.0027608187,0.002095166,0.00059171655],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032892392,0.00002735687,0.00078274513,0.000060437877,0.000004754555,0.000092163085,0.0005111007,0.0011923201,0.00055678276,0.98904306,0.0009327505,0.0067635756],"study_design_scores_gemma":[0.000010584411,0.000008967441,0.00024225895,0.000025058762,0.000009168488,0.00010309483,0.00017527075,0.009215084,0.00040972998,0.9883336,0.0014566995,0.0000105512245],"about_ca_topic_score_codex":0.003970587,"about_ca_topic_score_gemma":0.005813116,"teacher_disagreement_score":0.007147362,"about_ca_system_score_codex":0.002293888,"about_ca_system_score_gemma":0.00077206834,"threshold_uncertainty_score":0.023910344},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6473043,0.0075745396,0.10102211,0.010191005,0.0009631848,0.00012917281,0.0010385283,0.0006770337,0.23110011],"genre_scores_gemma":[0.97132653,0.0021895014,0.011533587,0.0005931526,0.0007694398,0.00019654818,0.00026351665,0.00012531379,0.013002364],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99912304,0.0002620461,0.000055992718,0.00023071954,0.00019231047,0.00013588172],"domain_scores_gemma":[0.99408925,0.0034788582,0.00068152376,0.00046397783,0.00044208896,0.00084427727],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001945779,0.000704269,0.0013747684,0.0045519527,0.0026395707,0.0052974406,0.0019791564,0.0018925078,0.00927216],"category_scores_gemma":[0.011131463,0.00086674833,0.00079415244,0.002944093,0.0043952568,0.012189021,0.0023975975,0.0031661172,0.000776758],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000049563634,0.000018013834,0.00037441382,0.000058149257,0.0000089904015,0.000027471484,0.00021762667,0.00088885677,0.0004192664,0.99143034,0.0025389846,0.0039684786],"study_design_scores_gemma":[0.000009608918,0.0000100662,0.00023955996,0.000028164663,0.000011814371,0.00007900844,0.000089098154,0.0045980294,0.00027689524,0.9925638,0.002079596,0.000014370719],"about_ca_topic_score_codex":0.0010608288,"about_ca_topic_score_gemma":0.0008036611,"teacher_disagreement_score":0.00927216,"about_ca_system_score_codex":0.002567945,"about_ca_system_score_gemma":0.0010643004,"threshold_uncertainty_score":0.031018436},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.71259665,0.00074466696,0.2657293,0.0030011924,0.000053084306,0.000120214034,0.000453401,0.00053566514,0.016765779],"genre_scores_gemma":[0.9818288,0.0005166534,0.013635241,0.0002061988,0.000115432,0.0001335046,0.0002547991,0.00008512136,0.0032242388],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99814284,0.0007067683,0.000044412016,0.00041039707,0.00037809118,0.00031743362],"domain_scores_gemma":[0.9574071,0.030169494,0.0051008333,0.004307941,0.0014125915,0.0016020075],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032714147,0.0006184923,0.00077911693,0.0021282255,0.0014079778,0.0022636144,0.0022777435,0.001061496,0.0021795563],"category_scores_gemma":[0.027351027,0.00087631395,0.0006768261,0.0012162136,0.005872347,0.00472452,0.0018544067,0.0025838038,0.0003205711],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00048542282,0.00016092206,0.009827147,0.00013073816,0.00009868182,0.0003081307,0.0007018123,0.09502537,0.008326188,0.8705935,0.0037660256,0.010575964],"study_design_scores_gemma":[0.000120295415,0.00006832116,0.0064730993,0.00003643986,0.00005779978,0.00042570083,0.00013620782,0.5765814,0.003596302,0.4094601,0.0029763735,0.00006798176],"about_ca_topic_score_codex":0.003019578,"about_ca_topic_score_gemma":0.0037918517,"teacher_disagreement_score":0.0032714147,"about_ca_system_score_codex":0.002979531,"about_ca_system_score_gemma":0.0008950262,"threshold_uncertainty_score":0.021618128},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6256072,0.001001325,0.27105507,0.009585175,0.0006824164,0.00017496009,0.0013986325,0.0023468658,0.088148445],"genre_scores_gemma":[0.9484692,0.0002909906,0.03109518,0.0012346372,0.0004965576,0.00016387888,0.00087892177,0.0003478499,0.017022735],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983285,0.00038046998,0.00008154959,0.0005238557,0.00030862846,0.0003770635],"domain_scores_gemma":[0.98988706,0.00520784,0.00081814564,0.0020095473,0.00084066513,0.0012367346],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014486347,0.0004910193,0.0010632039,0.0008423762,0.0022284957,0.0019079809,0.0011995158,0.0015025388,0.013545294],"category_scores_gemma":[0.013913188,0.00061235327,0.0009953685,0.0006283668,0.0027107669,0.0059794625,0.004148215,0.0018651285,0.0019418002],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00039968794,0.00009638811,0.0026654569,0.00027611246,0.00003942409,0.00036578573,0.0008312095,0.010957802,0.014943826,0.92928165,0.01873847,0.021404127],"study_design_scores_gemma":[0.00009380739,0.00015211219,0.00095164275,0.000050826813,0.000026018339,0.0007031631,0.00038502115,0.04671917,0.006157093,0.9186607,0.026062496,0.000037876463],"about_ca_topic_score_codex":0.0009480507,"about_ca_topic_score_gemma":0.001309368,"teacher_disagreement_score":0.013545294,"about_ca_system_score_codex":0.0014918866,"about_ca_system_score_gemma":0.0007694381,"threshold_uncertainty_score":0.045313537},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35647008,0.0020385673,0.6064399,0.004346414,0.00034599027,0.00016142667,0.0014477818,0.0011538619,0.027595906],"genre_scores_gemma":[0.89741504,0.00093105796,0.0921415,0.0005898885,0.00048716812,0.00032682598,0.00070099777,0.0003259428,0.007081555],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9962315,0.00094301044,0.00028486934,0.00095440214,0.0010868511,0.000499322],"domain_scores_gemma":[0.96574533,0.02482118,0.0020452656,0.0032286923,0.002976539,0.0011829325],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030666413,0.0007223223,0.0010569728,0.0017740222,0.001118597,0.0025985467,0.0014539799,0.0011623235,0.0061485353],"category_scores_gemma":[0.031433724,0.0007742259,0.0012859287,0.0011904507,0.0036628784,0.008081424,0.001609273,0.003199527,0.0008835643],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000696419,0.00014033898,0.0056877504,0.00042803402,0.00011871655,0.0003302699,0.0005219042,0.07174565,0.02152661,0.836452,0.0056396034,0.05671275],"study_design_scores_gemma":[0.00005853361,0.00020683504,0.0028531766,0.00008638884,0.00004625455,0.0005874262,0.000086068954,0.23859513,0.009343993,0.73937565,0.008643067,0.00011744098],"about_ca_topic_score_codex":0.0010513129,"about_ca_topic_score_gemma":0.0007403642,"teacher_disagreement_score":0.0061485353,"about_ca_system_score_codex":0.0025844243,"about_ca_system_score_gemma":0.0010692063,"threshold_uncertainty_score":0.020568967},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7602245,0.00081271486,0.13739946,0.0021963788,0.00012737288,0.000116482326,0.0026003341,0.00077842665,0.095744416],"genre_scores_gemma":[0.9597372,0.0002797759,0.03069902,0.00024072672,0.00009043684,0.00026781525,0.0016780313,0.00014593906,0.006861005],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99735224,0.00062689243,0.00015381198,0.000683761,0.0006621882,0.0005210583],"domain_scores_gemma":[0.9897363,0.0063409084,0.0011189064,0.0010562956,0.0007336085,0.001013975],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011492956,0.00057338923,0.00077080826,0.002742402,0.0038933095,0.0035346465,0.0024422703,0.0011466738,0.012371019],"category_scores_gemma":[0.010336051,0.00090644346,0.0011705139,0.0030024168,0.0033184101,0.005153806,0.00473605,0.0024677073,0.0013276518],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024018547,0.00005625234,0.004278098,0.00012894992,0.000058885864,0.00025629837,0.0006897053,0.008799607,0.0025091653,0.96457547,0.0044643003,0.013943098],"study_design_scores_gemma":[0.000045166722,0.000057079647,0.0014733112,0.00003588561,0.000040539697,0.0007752411,0.00052382273,0.030785238,0.0036365585,0.95187986,0.01070297,0.00004429261],"about_ca_topic_score_codex":0.0014167002,"about_ca_topic_score_gemma":0.0011134768,"teacher_disagreement_score":0.012371019,"about_ca_system_score_codex":0.0020540094,"about_ca_system_score_gemma":0.00094531995,"threshold_uncertainty_score":0.041385233},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9617173,0.000405272,0.022169195,0.00025178888,0.00003788469,0.000019801555,0.00020261502,0.000059164635,0.015137006],"genre_scores_gemma":[0.9918824,0.00013949948,0.0053863353,0.000037165726,0.000012439406,0.000019721407,0.000105109495,0.00001546216,0.002401801],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996389,0.000068940506,0.000018586043,0.00009409742,0.000058301288,0.00012119149],"domain_scores_gemma":[0.9987863,0.00047614123,0.00019378857,0.00014525975,0.00015160834,0.00024687915],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00069100526,0.00022615193,0.00039972967,0.0009174926,0.0009997269,0.0013062728,0.00060439104,0.00033626475,0.0042726565],"category_scores_gemma":[0.001628745,0.00026901605,0.0003217416,0.00038016585,0.0013816357,0.0020204114,0.0011318227,0.0005716951,0.00021412793],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011402996,0.000098086646,0.020136926,0.0002836237,0.00010499152,0.00033897744,0.0010401529,0.025749663,0.03289706,0.89045876,0.004158269,0.023593191],"study_design_scores_gemma":[0.00010346363,0.00016549074,0.011696561,0.00009411662,0.00012160804,0.0005631648,0.0007995649,0.10690563,0.015069795,0.8451862,0.01920337,0.00009089999],"about_ca_topic_score_codex":0.0023733126,"about_ca_topic_score_gemma":0.0032716296,"teacher_disagreement_score":0.0042726565,"about_ca_system_score_codex":0.0010166536,"about_ca_system_score_gemma":0.0005548177,"threshold_uncertainty_score":0.014293492},"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":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31091356,0.0020339005,0.47074485,0.007751479,0.00057147816,0.00013127248,0.0013027445,0.00072823995,0.20582247],"genre_scores_gemma":[0.9389716,0.0009666038,0.026543532,0.0019857846,0.00045403137,0.00017126615,0.0005031306,0.00020814396,0.03019596],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99866307,0.00019397915,0.00006232272,0.00030469598,0.0005366734,0.00023925169],"domain_scores_gemma":[0.9956181,0.0020184352,0.00033601318,0.00047272365,0.0010055078,0.00054923573],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016199666,0.00041330507,0.00069693633,0.001462933,0.0018491615,0.0018378472,0.0010537519,0.00083059183,0.009558366],"category_scores_gemma":[0.0071698828,0.00041705885,0.0010560735,0.0008849246,0.003869573,0.006040904,0.003969526,0.0024814846,0.0011092378],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017493818,0.000010798803,0.00071480224,0.000038185455,0.000009306274,0.000087447406,0.00019430199,0.0010737311,0.00078685186,0.9914858,0.0019036096,0.0036778431],"study_design_scores_gemma":[0.000014288447,0.000021661068,0.0009598837,0.000029550189,0.000010854726,0.00037902527,0.00014599228,0.015724828,0.0015722084,0.97266686,0.008446452,0.000028316636],"about_ca_topic_score_codex":0.004181442,"about_ca_topic_score_gemma":0.0022700194,"teacher_disagreement_score":0.009558366,"about_ca_system_score_codex":0.0023352047,"about_ca_system_score_gemma":0.0013458162,"threshold_uncertainty_score":0.031975985},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12833421,0.0008177399,0.7016626,0.0007095994,0.00020205633,0.00042096013,0.008121663,0.0025350961,0.15719607],"genre_scores_gemma":[0.5884139,0.0012784963,0.25932845,0.00048661084,0.00013271545,0.00048457965,0.02411355,0.0018147347,0.12394693],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996964,0.000053855245,0.00001830551,0.00007244279,0.00008742962,0.00007153335],"domain_scores_gemma":[0.9989278,0.000295504,0.000076813245,0.00022465906,0.00033693554,0.00013830776],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028166725,0.000454747,0.00027695208,0.0012367395,0.00050032564,0.0012945574,0.00069172314,0.0003507036,0.02182305],"category_scores_gemma":[0.0014487113,0.00026255453,0.0004691191,0.0010136531,0.0004183747,0.0015846654,0.0009155898,0.00067080936,0.0058807926],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002981355,0.0001596609,0.0014524494,0.00053794315,0.000040988984,0.00045038873,0.00087164337,0.014019824,0.01836351,0.78482896,0.041845463,0.13713099],"study_design_scores_gemma":[0.00004625206,0.000049851453,0.002114568,0.00014579119,0.000054306336,0.0004220238,0.00036418161,0.036422625,0.008963781,0.83243644,0.11895583,0.000024230312],"about_ca_topic_score_codex":0.0026581136,"about_ca_topic_score_gemma":0.0035306853,"teacher_disagreement_score":0.02182305,"about_ca_system_score_codex":0.0006873715,"about_ca_system_score_gemma":0.00046814285,"threshold_uncertainty_score":0.07300538},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.76592547,0.0026118536,0.1291261,0.0017212805,0.00036044544,0.00008872375,0.00042813443,0.0002570733,0.09948085],"genre_scores_gemma":[0.94237345,0.0016583832,0.02954989,0.0003882168,0.00038202864,0.00019117312,0.00055904925,0.00029854145,0.024599208],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993412,0.00016702552,0.000037328544,0.00014905084,0.00016380228,0.00014159801],"domain_scores_gemma":[0.99657464,0.00204579,0.00047537082,0.0002120111,0.00025388884,0.00043841166],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00093373004,0.001017269,0.0008880888,0.0042514913,0.0026698338,0.0033689365,0.0017866198,0.0024407578,0.008290873],"category_scores_gemma":[0.0060346974,0.0008154849,0.0013517457,0.0022630545,0.0035256373,0.005540882,0.0030302787,0.0025425062,0.00074015144],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000077349,0.000020406354,0.00027642824,0.00004920772,0.000011289866,0.00017312118,0.0004890049,0.0020096616,0.0008351514,0.99128765,0.0006268276,0.0041438676],"study_design_scores_gemma":[0.000017356282,0.000015760617,0.00024104663,0.000030372517,0.0000129946075,0.000106583975,0.00021114296,0.00783677,0.00046317975,0.98907244,0.0019757503,0.000016605542],"about_ca_topic_score_codex":0.0025461717,"about_ca_topic_score_gemma":0.0020261065,"teacher_disagreement_score":0.008290873,"about_ca_system_score_codex":0.001992047,"about_ca_system_score_gemma":0.0006191163,"threshold_uncertainty_score":0.02773577},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6027105,0.006384635,0.115509145,0.026592638,0.0021246283,0.00009455083,0.0009367864,0.00054271775,0.24510442],"genre_scores_gemma":[0.97201705,0.0013936006,0.009296028,0.0011752049,0.0007883363,0.00010700581,0.00030299163,0.000036310947,0.014883435],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982236,0.00037038093,0.00007753041,0.00054756197,0.0004829453,0.00029799086],"domain_scores_gemma":[0.99469274,0.0026758465,0.00051164214,0.001015044,0.0005216108,0.00058306486],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024240054,0.0004878383,0.00089929684,0.0013687701,0.002224153,0.0037585478,0.00088708324,0.0014772136,0.006493374],"category_scores_gemma":[0.013142442,0.00041785516,0.0006552931,0.0014523517,0.0046144123,0.00861576,0.0028415096,0.002693918,0.0009400854],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002477312,0.00002060997,0.0010988598,0.00006422347,0.000011388628,0.000108116714,0.00030918448,0.0024094325,0.0008635811,0.9718695,0.008719249,0.014278207],"study_design_scores_gemma":[0.000031695057,0.000017734777,0.00049030443,0.000023754943,0.000008901131,0.00014314044,0.000107341264,0.004896118,0.0007394659,0.98222363,0.0113046225,0.000013426176],"about_ca_topic_score_codex":0.0014035412,"about_ca_topic_score_gemma":0.0007643467,"teacher_disagreement_score":0.006493374,"about_ca_system_score_codex":0.0019092415,"about_ca_system_score_gemma":0.0009291703,"threshold_uncertainty_score":0.021722436},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37316424,0.007594337,0.2576602,0.010424679,0.0006755783,0.00016048206,0.0016894896,0.0006191523,0.34801185],"genre_scores_gemma":[0.9078271,0.004892103,0.040335186,0.00195701,0.0010905436,0.00027718476,0.0014603129,0.00038055266,0.041780006],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998565,0.0005097012,0.000077428325,0.00026079957,0.00036610168,0.00022109594],"domain_scores_gemma":[0.99028766,0.006369873,0.00072464626,0.0007080239,0.000949293,0.000960548],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022403852,0.0014575432,0.00225934,0.0068691857,0.0051950333,0.006086253,0.0033423763,0.002185463,0.0126470495],"category_scores_gemma":[0.009748902,0.0014064267,0.0030580172,0.007416067,0.0066449237,0.021874217,0.0049082437,0.008372278,0.0010806817],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002467563,0.000022750777,0.0003760129,0.0000664248,0.000016374803,0.000040380342,0.00028028764,0.0010181495,0.0001228743,0.99425745,0.0013258503,0.002448665],"study_design_scores_gemma":[0.0000066522302,0.000009315168,0.00033395743,0.000017591146,0.000024693156,0.000053051557,0.00015329939,0.0035766067,0.00011863911,0.9938408,0.0018546106,0.00001065192],"about_ca_topic_score_codex":0.0031322693,"about_ca_topic_score_gemma":0.004124615,"teacher_disagreement_score":0.0126470495,"about_ca_system_score_codex":0.0033761007,"about_ca_system_score_gemma":0.0011303648,"threshold_uncertainty_score":0.04230863},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12989254,0.028869933,0.19223821,0.037561156,0.010813925,0.0000669268,0.0005570432,0.00065495603,0.5993453],"genre_scores_gemma":[0.7838297,0.015175056,0.0416902,0.005076056,0.017159434,0.00016157654,0.00056053547,0.00061065756,0.1357367],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99797803,0.00076936494,0.00007858343,0.00029409956,0.0006833443,0.00019652219],"domain_scores_gemma":[0.9952559,0.0029667206,0.0002272469,0.00048465474,0.00053332513,0.00053217536],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021268579,0.0016099977,0.0022041048,0.003990786,0.0040361295,0.005021848,0.0032102298,0.00272913,0.01038067],"category_scores_gemma":[0.009143458,0.0007440807,0.0013295935,0.004707713,0.006943697,0.010679954,0.005762287,0.0075440058,0.001849555],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009556722,0.00001599095,0.00004735021,0.0000540809,0.000004691795,0.000018278199,0.00008288645,0.00040552788,0.000068013374,0.9939056,0.002503206,0.0028847866],"study_design_scores_gemma":[0.0000038557077,0.0000018600584,0.000022156877,0.000010017535,0.000003950495,0.00002078084,0.000014879283,0.0009389914,0.00004809334,0.9958144,0.0031173374,0.0000035879527],"about_ca_topic_score_codex":0.0008422365,"about_ca_topic_score_gemma":0.0007763895,"teacher_disagreement_score":0.01038067,"about_ca_system_score_codex":0.0023747007,"about_ca_system_score_gemma":0.0013142782,"threshold_uncertainty_score":0.03472674},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95064163,0.00078249146,0.038987424,0.00067214714,0.00003764508,0.000013175957,0.00020040426,0.00028098107,0.008384203],"genre_scores_gemma":[0.99530447,0.00017956787,0.0032805644,0.00004804644,0.000031857922,0.000019617513,0.00012696987,0.00003314444,0.00097571645],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99947256,0.00009213245,0.000022283893,0.00017060654,0.00013089692,0.00011148303],"domain_scores_gemma":[0.9959473,0.0022783254,0.0005207656,0.00054219994,0.00037350119,0.00033788988],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010474115,0.00024026437,0.00072306517,0.0021005163,0.0010601636,0.0018762061,0.0014825029,0.0014388552,0.0035190666],"category_scores_gemma":[0.010739265,0.0004738085,0.00040632763,0.0010205883,0.0024937,0.0029328035,0.0011316723,0.0014435318,0.00029077535],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006259463,0.00016354393,0.02253442,0.00029572984,0.000078511446,0.0013944033,0.00133739,0.031400327,0.042457383,0.8636673,0.00414901,0.03189608],"study_design_scores_gemma":[0.0001383269,0.00033235108,0.061968282,0.00014148708,0.00010716898,0.0041657467,0.0009917127,0.24365678,0.020976847,0.6593531,0.007909761,0.0002584182],"about_ca_topic_score_codex":0.0008531778,"about_ca_topic_score_gemma":0.0006932122,"teacher_disagreement_score":0.0035190666,"about_ca_system_score_codex":0.0014027808,"about_ca_system_score_gemma":0.0002296987,"threshold_uncertainty_score":0.011772394},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04738711,0.0061974376,0.74255663,0.01572253,0.0061449,0.00015945849,0.0010726559,0.000992458,0.17976685],"genre_scores_gemma":[0.5905088,0.008647107,0.29174027,0.01094765,0.0072115394,0.00053078844,0.0010889976,0.0012966362,0.08802805],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999099,0.0002087763,0.00007653471,0.00024112899,0.00027938848,0.00009511599],"domain_scores_gemma":[0.9975051,0.0011840226,0.0002072802,0.00029853926,0.00051122904,0.0002938307],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021052524,0.0016552417,0.0012525974,0.0037947078,0.0014796865,0.0019248767,0.001699227,0.001751427,0.01314587],"category_scores_gemma":[0.0052301837,0.00053590693,0.0018932826,0.0017733596,0.0035691133,0.0073829778,0.005012602,0.006856355,0.0020782305],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000037120677,0.00004415064,0.0002308559,0.00018953466,0.000030169575,0.00016840914,0.00024134335,0.00064009725,0.0024192822,0.97351825,0.006983905,0.015496982],"study_design_scores_gemma":[0.000026640797,0.000028994611,0.0003216006,0.000037222682,0.00003930989,0.00026505865,0.00006457506,0.003669575,0.0008743916,0.9659077,0.028733421,0.000031537893],"about_ca_topic_score_codex":0.0007331801,"about_ca_topic_score_gemma":0.0008434899,"teacher_disagreement_score":0.01314587,"about_ca_system_score_codex":0.0012443892,"about_ca_system_score_gemma":0.00070541265,"threshold_uncertainty_score":0.04397732},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8683781,0.006336981,0.079105556,0.010480393,0.0002391539,0.000040024108,0.0018396986,0.00041675978,0.033163365],"genre_scores_gemma":[0.9893153,0.002033418,0.004780971,0.00036291048,0.00063447695,0.00007830009,0.0004214531,0.00009612319,0.002277096],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978078,0.0009452131,0.00008316237,0.00034981727,0.00050837424,0.0003056044],"domain_scores_gemma":[0.97004807,0.021191755,0.0023478372,0.0024623834,0.0010118253,0.0029380915],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029617148,0.0007747285,0.0019425462,0.0054722945,0.0018833204,0.0060419324,0.002074154,0.0021755365,0.0048264912],"category_scores_gemma":[0.022126641,0.0013251296,0.000839946,0.0027351321,0.005974771,0.013556391,0.003250062,0.0030271413,0.00039378088],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010206329,0.000026278973,0.0014938307,0.00008222897,0.000041918298,0.00006409094,0.00039840673,0.005194509,0.00070848694,0.98608273,0.0023429065,0.0034624988],"study_design_scores_gemma":[0.000015431078,0.000011957374,0.0009140328,0.000025934136,0.000019614534,0.00013480942,0.0001248978,0.018817194,0.00024834627,0.97863036,0.0010378053,0.000019534205],"about_ca_topic_score_codex":0.000833579,"about_ca_topic_score_gemma":0.00064718357,"teacher_disagreement_score":0.0060419324,"about_ca_system_score_codex":0.0019281042,"about_ca_system_score_gemma":0.0005795214,"threshold_uncertainty_score":0.016146183},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6962303,0.0008435991,0.27437535,0.001191097,0.000072588955,0.00007489188,0.00043620507,0.0004685732,0.026307464],"genre_scores_gemma":[0.9362835,0.00034715392,0.057808902,0.00020872874,0.00009016746,0.00008162609,0.00032643272,0.00009668299,0.004756747],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99757916,0.0007392766,0.00018639842,0.0005838245,0.0005573281,0.0003540217],"domain_scores_gemma":[0.9839706,0.008325939,0.0017711358,0.0023239127,0.0013742732,0.0022341528],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018403016,0.0004627972,0.000824809,0.0015818796,0.001673013,0.0035481097,0.0012799681,0.0010441238,0.0034358255],"category_scores_gemma":[0.011950328,0.0008973005,0.0007837703,0.0016122728,0.0038005076,0.0052181403,0.0038445573,0.0018714446,0.00041377186],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019932391,0.00005023776,0.0027769685,0.00011580029,0.000031472275,0.00026470298,0.00085861806,0.012657915,0.008809383,0.9579807,0.0015383577,0.01471644],"study_design_scores_gemma":[0.000025144707,0.000042795928,0.00077963265,0.000031266958,0.000017818214,0.00031452638,0.00023816306,0.039643373,0.0030836998,0.9527928,0.0030099957,0.000020797024],"about_ca_topic_score_codex":0.0010282138,"about_ca_topic_score_gemma":0.0012555412,"teacher_disagreement_score":0.0035481097,"about_ca_system_score_codex":0.0018324832,"about_ca_system_score_gemma":0.0007122335,"threshold_uncertainty_score":0.0132956505},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7340417,0.00037208834,0.2532353,0.00044935188,0.00013642413,0.000030334535,0.000433369,0.00023159082,0.011069743],"genre_scores_gemma":[0.9853585,0.0001112551,0.011968753,0.00003324856,0.00007949983,0.000031062616,0.00031168273,0.00004975911,0.002056332],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99733317,0.0007332866,0.00014614715,0.00061762176,0.00081309135,0.00035676782],"domain_scores_gemma":[0.98129696,0.009981811,0.0018967837,0.0015450368,0.0036726443,0.0016067455],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003364335,0.00041077082,0.00057313434,0.0011006711,0.0004380324,0.00190259,0.0012995673,0.0004493664,0.0025091614],"category_scores_gemma":[0.028725073,0.00023152278,0.00034052492,0.000683015,0.0019326701,0.0026712029,0.001037389,0.0008864947,0.00033323557],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000536093,0.00014357522,0.018826032,0.00026027038,0.00008867542,0.0003110171,0.0005628573,0.06363082,0.011106691,0.8639588,0.0022097384,0.038365345],"study_design_scores_gemma":[0.000035744237,0.00026072463,0.010234393,0.000062674066,0.000032174707,0.0004353192,0.0003623509,0.357599,0.009953538,0.617485,0.0034595195,0.00007952722],"about_ca_topic_score_codex":0.00072429347,"about_ca_topic_score_gemma":0.0005824132,"teacher_disagreement_score":0.003364335,"about_ca_system_score_codex":0.0014083439,"about_ca_system_score_gemma":0.00058553607,"threshold_uncertainty_score":0.017792523},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7486934,0.0010668375,0.17122625,0.003020411,0.00025525616,0.000055504282,0.0004904799,0.00026141945,0.07493044],"genre_scores_gemma":[0.974571,0.0006876815,0.014690783,0.0004856542,0.00053213467,0.000094264884,0.00046746686,0.00009937166,0.008371725],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988617,0.00034994335,0.000059801943,0.00029244384,0.00026243037,0.00017380096],"domain_scores_gemma":[0.99074286,0.0057813493,0.0008912578,0.00062047684,0.00092186563,0.001042295],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014862565,0.00063973264,0.0011259066,0.0022011967,0.0029038645,0.0038674155,0.0019074731,0.0016257934,0.0059895297],"category_scores_gemma":[0.009884391,0.0006323653,0.001003907,0.0031625964,0.0042343168,0.008399702,0.0025520094,0.003185886,0.00046684474],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000510855,0.0000312163,0.00061392377,0.000030361725,0.0000111534555,0.000066348744,0.00033904985,0.0014409686,0.00083531626,0.9918544,0.0008865954,0.0038395608],"study_design_scores_gemma":[0.000012641645,0.000017590599,0.00035052228,0.000008024613,0.000009108935,0.000080778744,0.000100295765,0.0055079274,0.0001791413,0.99280566,0.00091905176,0.000009207427],"about_ca_topic_score_codex":0.0018684488,"about_ca_topic_score_gemma":0.0014939258,"teacher_disagreement_score":0.0059895297,"about_ca_system_score_codex":0.0011159308,"about_ca_system_score_gemma":0.0006833301,"threshold_uncertainty_score":0.020036936},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0734996,0.0070933118,0.55604124,0.024866821,0.003234553,0.0002274036,0.0013323597,0.0011562911,0.3325484],"genre_scores_gemma":[0.5458907,0.0066722413,0.33496845,0.0050641564,0.007724181,0.00047845294,0.0018230249,0.0009668684,0.096411884],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980914,0.00064442074,0.00008163947,0.000398619,0.00062613265,0.00015779909],"domain_scores_gemma":[0.99375725,0.003843168,0.00030510518,0.0011139655,0.0006376087,0.0003429389],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020523025,0.00064317236,0.0013186603,0.002771858,0.0029494942,0.0037803145,0.0024920343,0.0021262022,0.011832958],"category_scores_gemma":[0.010747358,0.00074424705,0.0009236742,0.004846934,0.005720537,0.011299937,0.004700328,0.0045668245,0.0023269884],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000035246576,0.000023364491,0.00015821175,0.0000466546,0.000007689854,0.000035315818,0.00011629568,0.0012189827,0.00028634872,0.97585297,0.0083550345,0.013863807],"study_design_scores_gemma":[0.000010598294,0.000010384465,0.00009149731,0.000014245752,0.000004561965,0.000034529494,0.000016231794,0.0027895435,0.00013886791,0.9874407,0.00943982,0.000009088347],"about_ca_topic_score_codex":0.001627794,"about_ca_topic_score_gemma":0.0018384001,"teacher_disagreement_score":0.011832958,"about_ca_system_score_codex":0.0015490472,"about_ca_system_score_gemma":0.0018087476,"threshold_uncertainty_score":0.039585173},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2537272,0.0049142824,0.18168125,0.025525007,0.0026586559,0.00020764799,0.002337658,0.009310057,0.5196382],"genre_scores_gemma":[0.8601348,0.001832274,0.02558041,0.004379681,0.0018751061,0.00041575546,0.0012955457,0.001633919,0.10285257],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99691784,0.000738647,0.00010195228,0.00086368277,0.0008171976,0.00056066754],"domain_scores_gemma":[0.9798023,0.011766572,0.0013344747,0.0038779415,0.0021111465,0.0011074964],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021347185,0.0014087335,0.0022434955,0.0035662348,0.0043898704,0.009320661,0.004729738,0.0063838703,0.047116995],"category_scores_gemma":[0.030848462,0.0016840134,0.0010192727,0.0024721657,0.0045604627,0.023451565,0.0031327798,0.007969169,0.008019505],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008088207,0.0000659633,0.0007809828,0.00021085601,0.00001883243,0.00004397574,0.00022989161,0.0013261117,0.0015419252,0.96976715,0.010040516,0.01589298],"study_design_scores_gemma":[0.000024628884,0.000014983915,0.00076915516,0.000063613865,0.00002499136,0.00023235724,0.00013865148,0.006037301,0.0010398539,0.98349494,0.008127223,0.00003220122],"about_ca_topic_score_codex":0.0017459356,"about_ca_topic_score_gemma":0.00257971,"teacher_disagreement_score":0.047116995,"about_ca_system_score_codex":0.0036000009,"about_ca_system_score_gemma":0.0019455623,"threshold_uncertainty_score":0.15762204},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.242954,0.0033803908,0.687274,0.0070607327,0.0005000286,0.000071446906,0.0004978106,0.000561482,0.05770005],"genre_scores_gemma":[0.82654756,0.002654477,0.15208404,0.0018204935,0.0009973265,0.00018560498,0.0004099278,0.00040666127,0.014893904],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980647,0.00044230826,0.00007538752,0.0005945441,0.00057130854,0.00025171845],"domain_scores_gemma":[0.9927099,0.0037378536,0.00069110474,0.0015542335,0.0007607701,0.00054608827],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035254867,0.0008044182,0.0014805243,0.0031689992,0.0014236206,0.004043643,0.0026140532,0.0018204256,0.0038299155],"category_scores_gemma":[0.017613975,0.00071802735,0.0012246416,0.0023807792,0.0049117804,0.01287293,0.004031821,0.0038697182,0.0009358569],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000055562778,0.000019282543,0.00046790447,0.000052861404,0.000012083819,0.000048913247,0.00011349646,0.004435448,0.0010948079,0.98491293,0.0012749177,0.0075117634],"study_design_scores_gemma":[0.000010264627,0.0000150713695,0.0001549362,0.000014527583,0.000007241792,0.000060968836,0.000033172564,0.023044009,0.00063469604,0.9732106,0.002802739,0.00001172265],"about_ca_topic_score_codex":0.0012280705,"about_ca_topic_score_gemma":0.00081887055,"teacher_disagreement_score":0.004043643,"about_ca_system_score_codex":0.0021856367,"about_ca_system_score_gemma":0.00087522174,"threshold_uncertainty_score":0.01864475},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30144623,0.019296544,0.16230643,0.015486848,0.0019348481,0.00014304904,0.001209907,0.0005229179,0.49765334],"genre_scores_gemma":[0.8809012,0.013650399,0.04667038,0.0033527769,0.0026295725,0.00028050083,0.0010269084,0.00025003732,0.05123818],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991874,0.00025927325,0.00005987909,0.00015837952,0.00024150452,0.00009342289],"domain_scores_gemma":[0.995544,0.0027411159,0.00029671547,0.0004537065,0.0004914287,0.00047299647],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023556522,0.00090146,0.0014707973,0.0034126963,0.003466697,0.0040535564,0.0022630363,0.001617573,0.009519149],"category_scores_gemma":[0.008353408,0.0009057463,0.0018158131,0.004585951,0.0042569693,0.0141009865,0.003995482,0.005188787,0.001061976],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000038977116,0.00003923639,0.0002478667,0.00011107804,0.000016707445,0.00008708776,0.00023330534,0.0011966971,0.00032193097,0.9886972,0.003879257,0.0051307213],"study_design_scores_gemma":[0.0000076647375,0.000007550484,0.00014228809,0.00002101269,0.000011217812,0.00007436407,0.00007751793,0.0019186264,0.00013375489,0.9947731,0.0028226199,0.00001024441],"about_ca_topic_score_codex":0.0021011003,"about_ca_topic_score_gemma":0.0025402398,"teacher_disagreement_score":0.009519149,"about_ca_system_score_codex":0.0021186965,"about_ca_system_score_gemma":0.0010691981,"threshold_uncertainty_score":0.031844735},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7389738,0.00066969416,0.2475793,0.0015813814,0.00007499432,0.0001444645,0.00060012395,0.0012796278,0.009096686],"genre_scores_gemma":[0.9708274,0.00044837326,0.022966832,0.00018265368,0.000051497344,0.00037455486,0.00073143846,0.00047595814,0.003941241],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988984,0.0003865396,0.000044356453,0.0003090931,0.00021065476,0.00015105295],"domain_scores_gemma":[0.9768123,0.016794823,0.0018202661,0.0019543548,0.0013714837,0.0012467699],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037773524,0.0007090181,0.0007307721,0.0019522653,0.0009992775,0.0016596444,0.002215523,0.0012484893,0.0038294573],"category_scores_gemma":[0.036422934,0.00066079246,0.0007625115,0.0006738212,0.0025404983,0.00347772,0.0019220281,0.002365407,0.0006572502],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000987658,0.0001728434,0.017716365,0.00038017775,0.00021131785,0.00063978764,0.001400035,0.25165305,0.03881551,0.639208,0.006531269,0.04228403],"study_design_scores_gemma":[0.00006165256,0.0001516289,0.0036697173,0.000064780994,0.000039460192,0.00042416138,0.00015870309,0.85313815,0.012907844,0.12743023,0.001864789,0.00008888693],"about_ca_topic_score_codex":0.0013988388,"about_ca_topic_score_gemma":0.0009602952,"teacher_disagreement_score":0.0038294573,"about_ca_system_score_codex":0.0017114067,"about_ca_system_score_gemma":0.0005612564,"threshold_uncertainty_score":0.019976795},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3387819,0.0013255075,0.6201043,0.0027449608,0.00020507073,0.00024142874,0.00097458117,0.00041859772,0.03520368],"genre_scores_gemma":[0.9521537,0.0007151245,0.041421123,0.0006437971,0.00056893734,0.00023870979,0.00056568335,0.000138579,0.0035544615],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9938864,0.0021670565,0.00028509405,0.0014823633,0.0015412737,0.00063778],"domain_scores_gemma":[0.9537617,0.031918652,0.003871316,0.0053508165,0.0036406843,0.0014568078],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032982954,0.00054073834,0.001056003,0.0029747665,0.0014310307,0.0026346107,0.0015416206,0.0022176374,0.0039712396],"category_scores_gemma":[0.03566073,0.00066423015,0.0010500837,0.0020669706,0.0065061,0.007423413,0.0034116472,0.003370405,0.00047125452],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012601237,0.000036926336,0.0031564597,0.00013089563,0.00003212606,0.0002861885,0.00049145607,0.016374413,0.005315319,0.9607129,0.0016306172,0.011706651],"study_design_scores_gemma":[0.000025156472,0.00008184191,0.0014074,0.00004934402,0.000021424183,0.00029283765,0.00019314987,0.0905256,0.0037038948,0.8995575,0.0040965,0.000045323606],"about_ca_topic_score_codex":0.00097633136,"about_ca_topic_score_gemma":0.0005225729,"teacher_disagreement_score":0.0039712396,"about_ca_system_score_codex":0.0019686813,"about_ca_system_score_gemma":0.0007777917,"threshold_uncertainty_score":0.0174433},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7313871,0.0044495002,0.08059835,0.0019235659,0.00045599177,0.00005033935,0.0003458607,0.00034507952,0.18044424],"genre_scores_gemma":[0.9883503,0.0004251236,0.0058883284,0.0001411136,0.00009886828,0.000026913876,0.00007007328,0.000041423948,0.0049579325],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99971277,0.000057711564,0.000011609787,0.00005593591,0.000067857276,0.00009416344],"domain_scores_gemma":[0.99952793,0.00017128409,0.00007712711,0.000050741546,0.00007267968,0.00010027252],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027642053,0.00040039918,0.00029739455,0.001806976,0.001140004,0.0014816173,0.0006569768,0.0006191207,0.0037281767],"category_scores_gemma":[0.0019140436,0.00018594596,0.00020830373,0.00086796406,0.0015395164,0.0016151667,0.0010298437,0.0007794159,0.0003386301],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006172935,0.000015396747,0.0006615286,0.00006136367,0.000005540667,0.0001527398,0.00017241575,0.0044435402,0.0016919482,0.97899866,0.0026249741,0.011110107],"study_design_scores_gemma":[0.0000066896027,0.000014828432,0.00047775806,0.000025651352,0.000007870688,0.00014703309,0.00008000838,0.01667876,0.0009915812,0.97533923,0.0062166154,0.000013873491],"about_ca_topic_score_codex":0.000726733,"about_ca_topic_score_gemma":0.00095691776,"teacher_disagreement_score":0.0037281767,"about_ca_system_score_codex":0.0010428503,"about_ca_system_score_gemma":0.00028085665,"threshold_uncertainty_score":0.0124720335},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12086764,0.012119988,0.5983023,0.009140812,0.0036890311,0.00013690337,0.0014691644,0.0017373182,0.2525368],"genre_scores_gemma":[0.7168609,0.006043722,0.18680343,0.0021379406,0.0044987244,0.00070068194,0.0017199678,0.0018129315,0.07942171],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9944569,0.0011546604,0.00045497925,0.0015406258,0.0017883141,0.0006045128],"domain_scores_gemma":[0.9730822,0.018242735,0.0015655183,0.003283377,0.0019262074,0.0018999447],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0043973625,0.0017815307,0.0021889554,0.004328301,0.0030410702,0.008786685,0.0040065125,0.002483531,0.02136191],"category_scores_gemma":[0.030997163,0.0010536837,0.0015156283,0.0028370274,0.004935914,0.020665623,0.005813383,0.0062606246,0.004909082],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002107315,0.000044677912,0.0006935717,0.00020433738,0.000031573887,0.00010245971,0.00016268576,0.0031784521,0.0027403028,0.95481116,0.006921593,0.03089847],"study_design_scores_gemma":[0.0000120923,0.00002711184,0.0003068416,0.000054283104,0.000028643894,0.0004120457,0.00004173867,0.010847203,0.002101446,0.9761079,0.010030043,0.00003065858],"about_ca_topic_score_codex":0.00021726458,"about_ca_topic_score_gemma":0.00037864043,"teacher_disagreement_score":0.02136191,"about_ca_system_score_codex":0.0023200347,"about_ca_system_score_gemma":0.0010770074,"threshold_uncertainty_score":0.07146275},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.52892756,0.0018771566,0.39681077,0.0033089777,0.0003402761,0.00019492913,0.00062726776,0.000785823,0.06712716],"genre_scores_gemma":[0.8868008,0.0007411472,0.08517778,0.0006225511,0.00028439064,0.00024996014,0.000547436,0.00025756608,0.025318442],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992605,0.0002838503,0.000032639902,0.00015444054,0.00009581972,0.0001728005],"domain_scores_gemma":[0.9971908,0.001952315,0.00025708525,0.00024833175,0.0001343134,0.00021713821],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016370642,0.0005913591,0.001160471,0.0008875207,0.0013556794,0.0016721896,0.0015653983,0.0015029996,0.010046226],"category_scores_gemma":[0.0062469016,0.0004340434,0.0009095138,0.0009334792,0.0015648067,0.0042708227,0.0013991252,0.0016004683,0.0008498187],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020801362,0.000090558395,0.0009361623,0.00021593082,0.000027274837,0.00014112459,0.00027019554,0.024622826,0.0020680113,0.9422343,0.006051926,0.023133818],"study_design_scores_gemma":[0.000101212405,0.00012278208,0.0006209927,0.00005706554,0.000043494812,0.0003542687,0.00034156567,0.17233141,0.0029182315,0.8155155,0.0075424463,0.000050971288],"about_ca_topic_score_codex":0.0009798977,"about_ca_topic_score_gemma":0.001196424,"teacher_disagreement_score":0.010046226,"about_ca_system_score_codex":0.0014505796,"about_ca_system_score_gemma":0.0009042895,"threshold_uncertainty_score":0.03360796},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9141976,0.00036195645,0.078636296,0.00022953394,0.000016372987,0.000024767074,0.00016706834,0.00013067578,0.0062356764],"genre_scores_gemma":[0.97981036,0.00015490071,0.018186055,0.000061572544,0.000027763774,0.000042990632,0.00018353667,0.00004099449,0.0014918295],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993216,0.00020200519,0.00004896906,0.00015173532,0.00014945571,0.00012626644],"domain_scores_gemma":[0.9954815,0.0024465555,0.0008648199,0.0005775368,0.00022823657,0.00040128228],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010882822,0.00029678727,0.0006150177,0.0015332497,0.001106953,0.0018700868,0.0007421913,0.000647713,0.0023402383],"category_scores_gemma":[0.007013522,0.0005455618,0.0005237807,0.001395602,0.001595208,0.0031335023,0.0015036057,0.00062448275,0.00019807841],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00072917604,0.00018354837,0.0117496615,0.00016774047,0.000097416,0.00066243386,0.0010673897,0.13967153,0.010400499,0.7905333,0.002926608,0.04181078],"study_design_scores_gemma":[0.000048123115,0.0001025463,0.0043973327,0.00004138127,0.000036560763,0.00066538394,0.00035133935,0.34204546,0.0043131197,0.6445275,0.0034340618,0.00003717822],"about_ca_topic_score_codex":0.0010440587,"about_ca_topic_score_gemma":0.0010395561,"teacher_disagreement_score":0.0023402383,"about_ca_system_score_codex":0.0012918684,"about_ca_system_score_gemma":0.00024818466,"threshold_uncertainty_score":0.009373248},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5324375,0.0035400223,0.28555718,0.002668014,0.00026326926,0.00022945569,0.0010537873,0.00048496918,0.17376584],"genre_scores_gemma":[0.93206084,0.0012437482,0.056312427,0.000396506,0.00022340003,0.0001887393,0.00036597843,0.00009469886,0.009113678],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99777716,0.0005797057,0.00014659001,0.00061542116,0.0005181553,0.0003630677],"domain_scores_gemma":[0.9878011,0.0061152135,0.0017676749,0.0020392747,0.0010428223,0.0012339513],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019351891,0.00034908397,0.0003747206,0.0023509648,0.0019934,0.002068043,0.00096597953,0.0012674598,0.0042819176],"category_scores_gemma":[0.012132794,0.00061225984,0.000691848,0.0013011533,0.006063982,0.005359144,0.0016782305,0.0014879666,0.00040927186],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000137005445,0.000007853954,0.00053553475,0.000039061204,0.0000041517333,0.00006006227,0.00036316994,0.0013479175,0.0005765513,0.9926594,0.00055810064,0.003834526],"study_design_scores_gemma":[0.000009156661,0.000017043321,0.00081379816,0.000029604782,0.000007080404,0.0003233244,0.00021763917,0.0056633484,0.0005072615,0.9841149,0.008283063,0.000013895106],"about_ca_topic_score_codex":0.0033380047,"about_ca_topic_score_gemma":0.0030763976,"teacher_disagreement_score":0.0042819176,"about_ca_system_score_codex":0.0019530803,"about_ca_system_score_gemma":0.00056008634,"threshold_uncertainty_score":0.014324427},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8723098,0.0012099883,0.09122893,0.0009886415,0.000029686482,0.000037100428,0.00032254134,0.00014212826,0.03373125],"genre_scores_gemma":[0.96431303,0.0008184396,0.028771896,0.00016199023,0.00013517145,0.00014304262,0.00053074345,0.0000663295,0.005059388],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977875,0.00058117695,0.00014525806,0.0005545285,0.00056888786,0.00036267118],"domain_scores_gemma":[0.9874349,0.008611463,0.0013280868,0.0008004772,0.0007945206,0.0010304429],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025773933,0.00046483052,0.0011411329,0.0029190513,0.0035692216,0.0033289602,0.0009590344,0.0013813081,0.0030665263],"category_scores_gemma":[0.009335375,0.0007022199,0.0012272432,0.0023855611,0.005211884,0.009620249,0.0033967188,0.0016964322,0.0003055691],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001547554,0.000032609336,0.003424279,0.000060213424,0.000023389453,0.0003106732,0.0016459009,0.0024555048,0.0025851452,0.98036826,0.00046792536,0.008471333],"study_design_scores_gemma":[0.000025218058,0.00007671657,0.002256856,0.00006504973,0.00005194691,0.00074986584,0.0011101026,0.012827041,0.002786565,0.97414047,0.005873359,0.000036897265],"about_ca_topic_score_codex":0.0016750251,"about_ca_topic_score_gemma":0.0011436734,"teacher_disagreement_score":0.0035692216,"about_ca_system_score_codex":0.0022339371,"about_ca_system_score_gemma":0.00067555916,"threshold_uncertainty_score":0.01620841},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16879737,0.01873335,0.28724012,0.015569625,0.0020677901,0.00012063677,0.000453715,0.00097535073,0.50604206],"genre_scores_gemma":[0.9273642,0.0052708476,0.03040202,0.0016017554,0.0016598916,0.00022291797,0.00016490417,0.00030336823,0.03301006],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970203,0.0005401469,0.000101674465,0.00074017275,0.00090260763,0.0006951834],"domain_scores_gemma":[0.986451,0.009548189,0.0004882259,0.0014503739,0.0010346661,0.0010273908],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038342585,0.0014648939,0.0014708429,0.005554211,0.0051340354,0.003213023,0.0027898904,0.0020566755,0.013386254],"category_scores_gemma":[0.016506046,0.00069682644,0.0011449603,0.0033271036,0.0073763407,0.016173353,0.005976556,0.0056397957,0.0021256276],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000043017175,0.000014053302,0.00022285678,0.000049521106,0.000009312756,0.00008538131,0.00018346847,0.00089121977,0.00039347535,0.98994595,0.0022478823,0.0059138243],"study_design_scores_gemma":[0.000010182292,0.00002045409,0.0001641021,0.00003403676,0.000015756723,0.00021979002,0.0000497211,0.0065392633,0.0009827368,0.9799565,0.011982369,0.000025204374],"about_ca_topic_score_codex":0.0018676495,"about_ca_topic_score_gemma":0.0010753169,"teacher_disagreement_score":0.013386254,"about_ca_system_score_codex":0.0029820306,"about_ca_system_score_gemma":0.0010394739,"threshold_uncertainty_score":0.044781446},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4067413,0.010547938,0.37385818,0.010433832,0.0014972002,0.00014175144,0.0009106175,0.00059508946,0.19527416],"genre_scores_gemma":[0.8784713,0.005988722,0.060793888,0.0017161578,0.0014243907,0.0001812934,0.00077761646,0.00031223166,0.05033437],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983891,0.0004398709,0.00010147052,0.00039743914,0.000434561,0.00023755112],"domain_scores_gemma":[0.9921394,0.005233335,0.00069810805,0.0007677032,0.0005085501,0.0006527892],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020388404,0.0011088479,0.0018670335,0.0042913486,0.002797376,0.004013027,0.0029615473,0.003040174,0.013507303],"category_scores_gemma":[0.013831871,0.0009998498,0.0012296424,0.007493273,0.005396553,0.01462794,0.0052272542,0.004979826,0.0012769671],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032425472,0.000019399025,0.00016803393,0.000043041946,0.000005575794,0.000030418614,0.00021582014,0.00106139,0.00023700492,0.9899559,0.0011157898,0.0071151913],"study_design_scores_gemma":[0.00000613198,0.000005056272,0.00007525476,0.000011144319,0.000004625193,0.000039067538,0.000047631398,0.001662937,0.00007111787,0.99640393,0.0016680928,0.0000049503196],"about_ca_topic_score_codex":0.0015237058,"about_ca_topic_score_gemma":0.001274764,"teacher_disagreement_score":0.013507303,"about_ca_system_score_codex":0.0023861171,"about_ca_system_score_gemma":0.0005751854,"threshold_uncertainty_score":0.04518646},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34587717,0.0033339616,0.35518116,0.010650699,0.0010829008,0.00007762441,0.00063635386,0.00071729394,0.28244287],"genre_scores_gemma":[0.94123805,0.00089247245,0.033954874,0.001194947,0.0005395122,0.000098588585,0.00016731281,0.00015521821,0.021758968],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989316,0.00032305863,0.000051433235,0.00023444809,0.00025282401,0.00020661183],"domain_scores_gemma":[0.9957273,0.0027114465,0.00026451828,0.0005168689,0.00036524553,0.00041471934],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002142878,0.00083009887,0.00097227056,0.0028097003,0.003966537,0.0040497812,0.0016301699,0.0021768122,0.0076475525],"category_scores_gemma":[0.007507795,0.0006290606,0.0015309025,0.0023383019,0.00760325,0.010402373,0.0037120767,0.0046916474,0.0006438813],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012235988,0.0000047866624,0.000043566415,0.000008367592,0.0000014965698,0.00001957337,0.000068102665,0.00017133649,0.00009761342,0.99842924,0.00034334455,0.00080044795],"study_design_scores_gemma":[0.0000057895527,0.0000021458764,0.000033729208,0.0000026312923,0.0000029135226,0.000028111104,0.000015173194,0.0007240939,0.00010256964,0.9983758,0.00070394244,0.0000030807844],"about_ca_topic_score_codex":0.0024257218,"about_ca_topic_score_gemma":0.0017658864,"teacher_disagreement_score":0.0076475525,"about_ca_system_score_codex":0.0025537761,"about_ca_system_score_gemma":0.0009609131,"threshold_uncertainty_score":0.025583565},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.58241916,0.0015102985,0.35490283,0.003308355,0.00023487027,0.00012457781,0.0012669038,0.000894919,0.05533808],"genre_scores_gemma":[0.9527614,0.0010133414,0.020461243,0.00059244473,0.0003346116,0.00018154024,0.00089667074,0.00028413994,0.023474634],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99848574,0.00058472465,0.00006349799,0.0003161536,0.00032542812,0.00022452303],"domain_scores_gemma":[0.98944175,0.0060009747,0.0016107665,0.00095758634,0.0009287974,0.0010601394],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011937148,0.0009737817,0.00091914454,0.0023930853,0.0010860468,0.0032514527,0.0019757967,0.0013315419,0.008389382],"category_scores_gemma":[0.012208282,0.0009482811,0.0007109112,0.0014805335,0.0028356856,0.006314783,0.0032054605,0.0021919892,0.0010661021],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000705763,0.00003423079,0.0004232935,0.000057537585,0.000012435072,0.00006958417,0.00020053175,0.0059530395,0.00058158964,0.98709863,0.0012900301,0.0042085685],"study_design_scores_gemma":[0.000025448791,0.000022545952,0.0003979301,0.00002138993,0.00000978731,0.000106057174,0.00013273212,0.04172578,0.0004276677,0.95566744,0.0014445359,0.000018636943],"about_ca_topic_score_codex":0.0014981256,"about_ca_topic_score_gemma":0.0013742541,"teacher_disagreement_score":0.008389382,"about_ca_system_score_codex":0.0016110076,"about_ca_system_score_gemma":0.0005256462,"threshold_uncertainty_score":0.028065264},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.67754704,0.00089127664,0.122568384,0.002694073,0.0002339747,0.0000871803,0.0006515212,0.00043557864,0.194891],"genre_scores_gemma":[0.96111625,0.00040394632,0.017580505,0.00022063682,0.00013423343,0.00016530766,0.0005592326,0.00015162412,0.019668171],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99717915,0.0007642917,0.00016937433,0.0006644047,0.0007343616,0.0004883349],"domain_scores_gemma":[0.99113524,0.005431159,0.0009340562,0.0008905205,0.0006080866,0.0010008363],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014335588,0.00066634506,0.0013209967,0.0036055413,0.0065519037,0.0069920653,0.002999053,0.0021266656,0.012685824],"category_scores_gemma":[0.00898852,0.0015425186,0.0013257855,0.0043766876,0.0061945366,0.009801308,0.006009862,0.0057543833,0.0012576232],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000041454477,0.000033034885,0.0004495275,0.00002249868,0.000008969675,0.00013669084,0.00043753162,0.0007129981,0.00029151698,0.9944547,0.00059431023,0.002816757],"study_design_scores_gemma":[0.000007576918,0.0000043536234,0.00011374188,0.00000869448,0.000009626381,0.00020676308,0.00018499178,0.0014560639,0.0002614124,0.99641055,0.0013276245,0.000008518747],"about_ca_topic_score_codex":0.001143887,"about_ca_topic_score_gemma":0.0011859557,"teacher_disagreement_score":0.012685824,"about_ca_system_score_codex":0.0017254682,"about_ca_system_score_gemma":0.0010756827,"threshold_uncertainty_score":0.04243833},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8876788,0.0008177971,0.08379375,0.0015840081,0.000059624857,0.000043082284,0.00037064718,0.00019070404,0.02546164],"genre_scores_gemma":[0.988699,0.00021446841,0.008185677,0.00008431261,0.00004038602,0.000025263986,0.00017604565,0.00002954744,0.0025451793],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994893,0.0000998303,0.0000215337,0.00017226132,0.00012489672,0.00009209464],"domain_scores_gemma":[0.9967347,0.0015638877,0.00039649874,0.00038302134,0.00042060507,0.00050127826],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004076938,0.0003701122,0.0005882094,0.00096716377,0.00092153024,0.0013403172,0.0007925614,0.00087330525,0.004751929],"category_scores_gemma":[0.0038235898,0.00045490873,0.00056861766,0.0006976045,0.0019283647,0.003328517,0.0020131136,0.0013187313,0.0003614551],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003430629,0.00011803162,0.00733233,0.00040260065,0.00007527996,0.0004197052,0.0017759389,0.021991828,0.021208342,0.91660607,0.0041508535,0.025576035],"study_design_scores_gemma":[0.00003626621,0.00007273487,0.002385891,0.000041468065,0.000021672322,0.00033354433,0.00040164695,0.024301546,0.004727348,0.9610147,0.006641864,0.00002128594],"about_ca_topic_score_codex":0.0008436651,"about_ca_topic_score_gemma":0.00076880597,"teacher_disagreement_score":0.004751929,"about_ca_system_score_codex":0.00096856826,"about_ca_system_score_gemma":0.0002744162,"threshold_uncertainty_score":0.015896738},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20442456,0.009785388,0.041026756,0.0024146514,0.0015399223,0.000039260525,0.00019037722,0.0002719798,0.7403071],"genre_scores_gemma":[0.86970973,0.003966948,0.00670298,0.00035290755,0.000729578,0.00003919116,0.00014133698,0.00010636654,0.11825106],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99965835,0.00008485785,0.00001555561,0.000053456024,0.000117822216,0.00006984711],"domain_scores_gemma":[0.99938476,0.00029011624,0.000045220888,0.00011613358,0.000095494266,0.00006818468],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030246287,0.0003231597,0.0003579277,0.0009863953,0.00092838757,0.0018699702,0.00038161807,0.00045123257,0.006090183],"category_scores_gemma":[0.0012794915,0.00023680295,0.00028774265,0.00083408866,0.0025138645,0.003558591,0.001325042,0.0016405572,0.0010852705],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010689822,0.000004978412,0.00004794288,0.000027899383,0.0000015453275,0.000041573094,0.00023946124,0.00026007651,0.00039494643,0.99132335,0.0014400028,0.006207507],"study_design_scores_gemma":[0.000003978415,0.000008881933,0.00016121657,0.00002234377,0.0000023683585,0.000094135576,0.00009153059,0.00045739205,0.00028866262,0.980438,0.018425716,0.000005748312],"about_ca_topic_score_codex":0.0007191237,"about_ca_topic_score_gemma":0.0009969078,"teacher_disagreement_score":0.006090183,"about_ca_system_score_codex":0.00085281936,"about_ca_system_score_gemma":0.000376481,"threshold_uncertainty_score":0.020373702},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.82730865,0.0012969873,0.09138803,0.0014306994,0.00017311858,0.00007016537,0.00038691942,0.00035165338,0.0775937],"genre_scores_gemma":[0.96739566,0.0005085291,0.015492629,0.0003514475,0.00019412459,0.000104267936,0.0002866951,0.00018918478,0.015477495],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999316,0.00024461592,0.000039154,0.00014814352,0.00014472903,0.00010730555],"domain_scores_gemma":[0.9965043,0.0019271295,0.00052307226,0.00023462097,0.00029299583,0.0005179414],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008050277,0.00064071047,0.0010821259,0.0022089814,0.0018993564,0.004036308,0.001432568,0.0014560963,0.008382439],"category_scores_gemma":[0.0052788295,0.0008288327,0.0006484619,0.001512736,0.0027864936,0.005415975,0.0024121327,0.0020219984,0.00076938496],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006308158,0.00002779932,0.00050119375,0.000051672156,0.000008166667,0.00011402451,0.00028376083,0.0015091193,0.00080948847,0.9920237,0.0011608349,0.0034472719],"study_design_scores_gemma":[0.000015442694,0.000007806194,0.00024332461,0.000018521108,0.0000076220554,0.00009786003,0.000114076036,0.0073167235,0.00029420806,0.9909512,0.0009277718,0.0000054645166],"about_ca_topic_score_codex":0.0009616566,"about_ca_topic_score_gemma":0.0015186585,"teacher_disagreement_score":0.008382439,"about_ca_system_score_codex":0.0011546644,"about_ca_system_score_gemma":0.00038057344,"threshold_uncertainty_score":0.028042078},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35619962,0.0055128927,0.33003548,0.011407173,0.0012015277,0.00014997383,0.0012369097,0.0007893462,0.29346707],"genre_scores_gemma":[0.9154422,0.0031962825,0.037596423,0.0021651152,0.0012159671,0.0002577592,0.00063778803,0.00027112974,0.039217446],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986909,0.00028671327,0.00010069421,0.00040451877,0.0003096924,0.00020755945],"domain_scores_gemma":[0.99693763,0.0017155678,0.00029724167,0.0004214905,0.00030627058,0.00032182486],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019087464,0.00092194165,0.0017490167,0.0028632747,0.0027619635,0.0034780456,0.0016598982,0.0018352834,0.008436639],"category_scores_gemma":[0.0045853113,0.00067432574,0.0017014245,0.0019939162,0.004914487,0.011098182,0.0050406675,0.0045490214,0.0013268631],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028052182,0.000014625129,0.0001521744,0.000044774068,0.000009747473,0.00004299245,0.00020554982,0.00038437318,0.00044110083,0.99405473,0.0011946158,0.0034273174],"study_design_scores_gemma":[0.000014543702,0.000009490828,0.00014254195,0.000011027637,0.000012648012,0.00007108203,0.000046613804,0.0011973629,0.00021347207,0.9937605,0.0045101643,0.000010526048],"about_ca_topic_score_codex":0.0007794165,"about_ca_topic_score_gemma":0.00054498675,"teacher_disagreement_score":0.008436639,"about_ca_system_score_codex":0.0015174457,"about_ca_system_score_gemma":0.000700852,"threshold_uncertainty_score":0.028223395},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.62367064,0.0014098107,0.2048099,0.0030650063,0.0006161865,0.000105171806,0.0007823849,0.0010236617,0.16451725],"genre_scores_gemma":[0.9309964,0.00081052183,0.020486608,0.0007142162,0.0004550706,0.00011859526,0.00070677744,0.00046290417,0.045248903],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99868363,0.00036638897,0.00007464814,0.0003483491,0.00028848133,0.00023856557],"domain_scores_gemma":[0.99699724,0.0011863617,0.00039119204,0.00038154563,0.00049136893,0.0005524268],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007191971,0.00091500586,0.00058541633,0.0022151722,0.0015085255,0.0043529975,0.001374072,0.0013987515,0.011611467],"category_scores_gemma":[0.0047003324,0.000617188,0.0006265715,0.0013520289,0.002732171,0.006467187,0.003745061,0.0023683726,0.0016470733],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005290495,0.00003103106,0.00025709282,0.000039849307,0.000005811517,0.00006863145,0.0003025223,0.0006079502,0.0008029341,0.9913326,0.0011824026,0.005316214],"study_design_scores_gemma":[0.000014311537,0.000015628317,0.00019383657,0.000017148477,0.000007838098,0.00008314599,0.00016596648,0.004336795,0.00057997706,0.99152863,0.0030468702,0.000009884764],"about_ca_topic_score_codex":0.0009456803,"about_ca_topic_score_gemma":0.0011282734,"teacher_disagreement_score":0.011611467,"about_ca_system_score_codex":0.0014621217,"about_ca_system_score_gemma":0.0004286054,"threshold_uncertainty_score":0.038844228},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.73361117,0.003218067,0.08801276,0.0057619642,0.00039984265,0.00003783927,0.00044866174,0.0002813018,0.1682284],"genre_scores_gemma":[0.9766812,0.00080455595,0.008242444,0.00065374543,0.00038192174,0.00003858303,0.00025523687,0.000063559906,0.01287882],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992551,0.00021266389,0.00004155987,0.0001487052,0.0001796319,0.00016232523],"domain_scores_gemma":[0.99791056,0.0010487494,0.00028295285,0.00022264701,0.00018101574,0.00035399516],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001151885,0.00069413445,0.0010708169,0.0021965182,0.0028125807,0.0045769005,0.00195929,0.0021154708,0.009897765],"category_scores_gemma":[0.004448734,0.0006363492,0.0009196694,0.0021359427,0.0030500004,0.0058338316,0.0029442878,0.0031401077,0.00066206645],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004183389,0.000029940362,0.0004338856,0.000037732407,0.000012964035,0.0000867413,0.00013106891,0.0011456017,0.0003762301,0.99347407,0.0014304679,0.0027995105],"study_design_scores_gemma":[0.000011843934,0.0000061432047,0.00020345906,0.000008753448,0.000009013346,0.00006993718,0.000062056366,0.0039071813,0.00012420726,0.9948578,0.00073371315,0.0000057815614],"about_ca_topic_score_codex":0.00095254194,"about_ca_topic_score_gemma":0.0012161812,"teacher_disagreement_score":0.009897765,"about_ca_system_score_codex":0.001467231,"about_ca_system_score_gemma":0.00043791698,"threshold_uncertainty_score":0.033111334},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6796561,0.0017731035,0.24614413,0.00088466157,0.0004555885,0.00008348661,0.00023408637,0.00034789304,0.07042091],"genre_scores_gemma":[0.96149904,0.00048005304,0.025279464,0.00013418026,0.00015420225,0.00008258229,0.00010092578,0.00006505938,0.01220461],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99926573,0.00017798974,0.000051144096,0.00015018816,0.00020662596,0.00014829353],"domain_scores_gemma":[0.9990964,0.00023206168,0.00014383227,0.000101686026,0.00012925616,0.0002967463],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010730149,0.00059082924,0.00073866366,0.00284437,0.003099274,0.0034296284,0.000987153,0.00097001204,0.004027039],"category_scores_gemma":[0.0016278977,0.0004215735,0.0009003043,0.00135491,0.0047985953,0.0054503004,0.003472238,0.0017615971,0.00082022866],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014612188,0.000010945411,0.00018371444,0.000022472539,0.000004348153,0.00009647899,0.00027151464,0.0003654969,0.00058417936,0.9968389,0.00012725004,0.0014800713],"study_design_scores_gemma":[0.000019568457,0.00007411093,0.00038059623,0.000035126413,0.000016794744,0.00034425152,0.00038531382,0.0035843088,0.0017965942,0.9878665,0.005468101,0.000028740928],"about_ca_topic_score_codex":0.00047394852,"about_ca_topic_score_gemma":0.00032840262,"teacher_disagreement_score":0.004027039,"about_ca_system_score_codex":0.0013599369,"about_ca_system_score_gemma":0.00050411315,"threshold_uncertainty_score":0.013471782},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4552414,0.003165598,0.19187894,0.011627372,0.0012801014,0.000117950294,0.0013517297,0.0013119398,0.33402494],"genre_scores_gemma":[0.94805235,0.0016911653,0.013588525,0.0012377397,0.0013500464,0.00014713618,0.00075850176,0.0003148574,0.032859568],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981103,0.0004891853,0.00008466489,0.0006154989,0.0004890316,0.00021122092],"domain_scores_gemma":[0.9957088,0.0017376028,0.00050830876,0.0005870724,0.00081355346,0.00064470223],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011856316,0.0012580635,0.0013233708,0.0033521818,0.002135669,0.0048887846,0.0012104143,0.0017283018,0.007662552],"category_scores_gemma":[0.0064754826,0.00077916787,0.0009817292,0.0020724246,0.007143739,0.009249546,0.0031011323,0.0039705667,0.0012690532],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021019865,0.000013503588,0.0001425036,0.00002598475,0.000006104739,0.00003344408,0.00018105168,0.00018996594,0.0002700249,0.99537766,0.0011303435,0.0026084038],"study_design_scores_gemma":[0.0000050348735,0.00000320225,0.000059460082,0.000004202856,0.0000030796266,0.000053718377,0.00004187271,0.0005553551,0.000104461345,0.99790347,0.0012632124,0.0000029099203],"about_ca_topic_score_codex":0.0009654744,"about_ca_topic_score_gemma":0.0008232182,"teacher_disagreement_score":0.007662552,"about_ca_system_score_codex":0.0014886439,"about_ca_system_score_gemma":0.0006820149,"threshold_uncertainty_score":0.025633812},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7611335,0.00030082988,0.22425291,0.00080024777,0.000054037122,0.00009465866,0.00077122834,0.00024549165,0.012347065],"genre_scores_gemma":[0.98056555,0.0001922593,0.016368782,0.000105345775,0.000080050646,0.00008838063,0.000549621,0.000071591385,0.0019783166],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982169,0.00054500136,0.00010322655,0.00037188607,0.00047039843,0.00029253835],"domain_scores_gemma":[0.99173987,0.0047664787,0.0009865854,0.0009942062,0.00079879316,0.0007140536],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016255536,0.000553536,0.0008906013,0.0018889263,0.0008432584,0.0019776018,0.00088402454,0.0007810586,0.0023783704],"category_scores_gemma":[0.0072727893,0.00040404257,0.00085253135,0.0009163517,0.0024817726,0.0034375729,0.001253612,0.0009956605,0.00027443402],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003168885,0.00007980602,0.004734979,0.00013232876,0.00007542606,0.00035701334,0.00041861887,0.094683126,0.014703675,0.8629024,0.0017850071,0.019810699],"study_design_scores_gemma":[0.000030483416,0.00008094748,0.0029175996,0.000022398444,0.000021764792,0.0003323785,0.00013246293,0.1943178,0.004160137,0.7966669,0.0012789505,0.00003816548],"about_ca_topic_score_codex":0.0009956823,"about_ca_topic_score_gemma":0.0006956341,"teacher_disagreement_score":0.0023783704,"about_ca_system_score_codex":0.0017075221,"about_ca_system_score_gemma":0.0008513972,"threshold_uncertainty_score":0.012389004},"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":"commentary","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020456538,0.008544383,0.09159479,0.5608379,0.025117576,0.00011030494,0.0003912929,0.0021477316,0.29079947],"genre_scores_gemma":[0.33225116,0.004425984,0.054663856,0.15399443,0.007002947,0.00029660462,0.0004984684,0.0021100324,0.44475642],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99772197,0.00080218184,0.0000759052,0.00038166897,0.0006452397,0.0003730723],"domain_scores_gemma":[0.9908948,0.0028436347,0.0004755031,0.0013803166,0.0027657032,0.0016401055],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026282608,0.0009525352,0.0010927379,0.0017046584,0.0064461655,0.0054304735,0.0017576136,0.006256891,0.042353228],"category_scores_gemma":[0.025972372,0.00045569713,0.0008571784,0.00082972244,0.008149979,0.0137598645,0.005942689,0.010824819,0.021011231],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011883529,0.00007598889,0.0005759405,0.00013256453,0.000045641165,0.00026294513,0.0017294191,0.0007057342,0.0006882714,0.4755314,0.4703224,0.04981092],"study_design_scores_gemma":[0.000023144192,0.0000449012,0.00017460168,0.0001801053,0.000013643319,0.0002556585,0.0019065822,0.0012500702,0.00029467253,0.65673137,0.33909374,0.000031363616],"about_ca_topic_score_codex":0.0035333857,"about_ca_topic_score_gemma":0.0048348173,"teacher_disagreement_score":0.042353228,"about_ca_system_score_codex":0.001900788,"about_ca_system_score_gemma":0.002071833,"threshold_uncertainty_score":0.14168572},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14599688,0.0012396763,0.5610059,0.0026530256,0.0028290614,0.00029162737,0.0025065746,0.005763332,0.27771404],"genre_scores_gemma":[0.6692166,0.0009788318,0.23093626,0.0020479497,0.0006017735,0.00047723384,0.0022800104,0.0024136486,0.09104766],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993286,0.00006123646,0.000051972493,0.0002485857,0.0001612163,0.00014846899],"domain_scores_gemma":[0.9992218,0.00031593558,0.000086513115,0.00011308851,0.00020318016,0.000059515023],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005352974,0.0011851845,0.00063473615,0.0006398591,0.0011695191,0.0022157023,0.0010810008,0.0008338113,0.024869785],"category_scores_gemma":[0.0018598187,0.00056302024,0.001642765,0.00062614493,0.0016461344,0.0029324775,0.0014511324,0.002004761,0.008489721],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010117711,0.00018885291,0.0011892501,0.0007969087,0.00008189517,0.0025418063,0.0010038223,0.002125483,0.07456787,0.79910326,0.03364005,0.083749086],"study_design_scores_gemma":[0.00026505179,0.00047818874,0.0018119843,0.00030500218,0.0002118505,0.0035852322,0.00081832084,0.016863896,0.10507713,0.61860603,0.25177318,0.00020418581],"about_ca_topic_score_codex":0.0009988538,"about_ca_topic_score_gemma":0.0015483061,"teacher_disagreement_score":0.024869785,"about_ca_system_score_codex":0.00095968606,"about_ca_system_score_gemma":0.0007618487,"threshold_uncertainty_score":0.08319765},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43510783,0.0024639608,0.5198125,0.0031664933,0.00014489942,0.0002748187,0.0007527424,0.0009488546,0.037327845],"genre_scores_gemma":[0.8950179,0.0011583312,0.09230239,0.0006436726,0.00015986168,0.0005305321,0.0005261724,0.00027141595,0.009389797],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99703526,0.0011275692,0.00014974522,0.00068805064,0.0006207122,0.00037870315],"domain_scores_gemma":[0.98348063,0.010467997,0.0018516149,0.0018675919,0.0010162799,0.0013159394],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003490899,0.0008583619,0.0015079495,0.0025874844,0.0019887763,0.0027452176,0.0023032387,0.0017322676,0.004823398],"category_scores_gemma":[0.024384025,0.000973849,0.0013199534,0.001940867,0.004170831,0.006158914,0.0039843093,0.0022550956,0.0008093783],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010768243,0.000052642434,0.0008243679,0.00011563441,0.000036982914,0.00015318778,0.0002431892,0.03136717,0.0012549345,0.9544177,0.0022127337,0.009213817],"study_design_scores_gemma":[0.000052604013,0.0000505249,0.00033254782,0.00004253974,0.000023536608,0.00017045748,0.000051407795,0.12588231,0.00086408324,0.8697538,0.0027461546,0.000030025361],"about_ca_topic_score_codex":0.002514904,"about_ca_topic_score_gemma":0.0020077054,"teacher_disagreement_score":0.004823398,"about_ca_system_score_codex":0.0032545526,"about_ca_system_score_gemma":0.0014202604,"threshold_uncertainty_score":0.023613513},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2026125,0.0060849655,0.1764004,0.05246515,0.0070296726,0.00010662558,0.0012560964,0.0014893905,0.55255526],"genre_scores_gemma":[0.89848953,0.0026870973,0.040893257,0.0046509155,0.0029708897,0.00013755444,0.00071810395,0.0004437636,0.049008876],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99907434,0.0002086527,0.000044729706,0.00021385841,0.00031673754,0.00014168811],"domain_scores_gemma":[0.9954287,0.002746348,0.00026257956,0.00057719235,0.00055008684,0.00043504534],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015628173,0.0009419709,0.0014170827,0.002247782,0.0024652763,0.0028744761,0.0021634263,0.0028966705,0.019520832],"category_scores_gemma":[0.00842837,0.0007862786,0.0015444763,0.0020812934,0.005190853,0.0074766064,0.0055877147,0.006343067,0.0034558629],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032060845,0.000033514734,0.00015335307,0.00007643491,0.000011591213,0.00014165997,0.00022234189,0.0005266068,0.00056426233,0.98785466,0.0062967315,0.0040866663],"study_design_scores_gemma":[0.000021498481,0.000009652291,0.0001555095,0.000025455975,0.000010553799,0.00009069292,0.000049835056,0.00206337,0.00022801611,0.9910584,0.00627487,0.000011975696],"about_ca_topic_score_codex":0.0013234636,"about_ca_topic_score_gemma":0.0012226857,"teacher_disagreement_score":0.019520832,"about_ca_system_score_codex":0.0016841401,"about_ca_system_score_gemma":0.0008637934,"threshold_uncertainty_score":0.06530362},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6602718,0.0005725431,0.3018978,0.0008253676,0.000054249056,0.00006592568,0.0005179607,0.00026592828,0.03552846],"genre_scores_gemma":[0.9538793,0.00025246406,0.040553562,0.000113258335,0.00005338427,0.000058889425,0.00041347818,0.00006267204,0.0046132016],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995228,0.00008846594,0.000022570679,0.00010947488,0.00011809691,0.000138698],"domain_scores_gemma":[0.9981875,0.0008563946,0.00023402447,0.00023693191,0.00019535676,0.0002896817],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000593073,0.0003298573,0.00040110707,0.000990222,0.0012137654,0.001399008,0.0006874032,0.0007450808,0.0041918987],"category_scores_gemma":[0.0038946634,0.00046300367,0.00051492493,0.00074098184,0.000939017,0.0019511953,0.0011508606,0.0008771315,0.00032296783],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019332951,0.000065529355,0.0019819203,0.00014979807,0.000027604458,0.00039960933,0.0006534813,0.037266154,0.018933363,0.91803026,0.003269054,0.019029966],"study_design_scores_gemma":[0.000048601683,0.000047857033,0.001261858,0.00003539427,0.000020438698,0.00035376856,0.0003000095,0.19351174,0.0060368846,0.7930668,0.0052986955,0.00001797914],"about_ca_topic_score_codex":0.0015106803,"about_ca_topic_score_gemma":0.0020261565,"teacher_disagreement_score":0.0041918987,"about_ca_system_score_codex":0.00082755025,"about_ca_system_score_gemma":0.00035418588,"threshold_uncertainty_score":0.014023304},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20406823,0.01227728,0.1444946,0.13483222,0.0054239454,0.000050412793,0.00045860812,0.00030620606,0.49808848],"genre_scores_gemma":[0.9220577,0.003532668,0.020422302,0.01051862,0.0040520052,0.000074565025,0.00016432782,0.00020907694,0.0389687],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99894756,0.00040588377,0.00006882834,0.00026686603,0.00021127558,0.000099675286],"domain_scores_gemma":[0.9960814,0.0023251388,0.00020492537,0.0005792323,0.0005254822,0.00028382614],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003231044,0.00046563343,0.0013631689,0.002274694,0.004090781,0.0033918975,0.001644704,0.003804359,0.009216644],"category_scores_gemma":[0.0102311745,0.00046379305,0.0009803603,0.0018982693,0.012912721,0.013272682,0.003847835,0.0048204577,0.0008385933],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000042221955,0.0000031587547,0.0000370328,0.0000053897797,0.0000010076288,0.000014971783,0.00006828643,0.000048983817,0.000030117506,0.99809664,0.00089325255,0.00079677283],"study_design_scores_gemma":[0.000003380764,0.0000013582685,0.000024700335,0.00000379183,7.858214e-7,0.000022689574,0.000032045402,0.00018644358,0.0000148320005,0.99799216,0.0017148474,0.0000029618857],"about_ca_topic_score_codex":0.0021411271,"about_ca_topic_score_gemma":0.0011292605,"teacher_disagreement_score":0.009216644,"about_ca_system_score_codex":0.00253292,"about_ca_system_score_gemma":0.0010633179,"threshold_uncertainty_score":0.030832708},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9268596,0.00026140592,0.04370642,0.00085607375,0.000056660378,0.0000706434,0.00032718177,0.00017070818,0.027691286],"genre_scores_gemma":[0.9809461,0.00016079146,0.012617856,0.00022261495,0.00007592107,0.000056614703,0.0006589925,0.000105927465,0.0051550316],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994411,0.00011767546,0.00002613341,0.0001621767,0.00011860518,0.00013442458],"domain_scores_gemma":[0.99583095,0.0021917128,0.00067692925,0.00025450147,0.00042546698,0.0006204732],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007375628,0.0008720326,0.0009392,0.0028175265,0.0018988748,0.0029891348,0.0015238458,0.0016844864,0.0055790497],"category_scores_gemma":[0.006069439,0.00077903084,0.000648575,0.0012108352,0.002459048,0.0041083666,0.0020990246,0.0019358487,0.0005540688],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003356612,0.00018219404,0.009675967,0.00020030949,0.000039135582,0.0009244444,0.0013644304,0.008275625,0.009185048,0.9537328,0.0041682585,0.011916202],"study_design_scores_gemma":[0.000028763978,0.000034922712,0.0010253033,0.000048054782,0.000022185148,0.00043311346,0.00076459604,0.016536418,0.0019470201,0.97678274,0.0023595325,0.000017349303],"about_ca_topic_score_codex":0.0008239187,"about_ca_topic_score_gemma":0.0011633786,"teacher_disagreement_score":0.0055790497,"about_ca_system_score_codex":0.0010891935,"about_ca_system_score_gemma":0.0006021506,"threshold_uncertainty_score":0.018663824},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.72827095,0.0011450017,0.23100854,0.0008572535,0.000059295922,0.00013498333,0.0016128828,0.0011194936,0.035791554],"genre_scores_gemma":[0.9762818,0.0005075242,0.015758296,0.0002764355,0.00013267898,0.00010728718,0.00109038,0.00016812934,0.0056772917],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993678,0.00009604804,0.000028353648,0.00022995177,0.00013832949,0.00013952894],"domain_scores_gemma":[0.9964282,0.0018804471,0.00052107713,0.00051078567,0.00026417413,0.00039527568],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00079958397,0.0003570884,0.0005524202,0.001415957,0.0009514834,0.0010661031,0.00061282003,0.0006091598,0.0041270247],"category_scores_gemma":[0.0054498515,0.00033053444,0.00059936044,0.0007508544,0.0014718552,0.0021430138,0.0012244759,0.0011752167,0.00037950536],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018830893,0.000077999604,0.005326261,0.00021180502,0.00007118701,0.00047142647,0.001019138,0.019358912,0.014402926,0.90483904,0.0068711145,0.047161873],"study_design_scores_gemma":[0.0000426652,0.00011847208,0.008078982,0.000086537104,0.000075246,0.0015108979,0.00039637808,0.096129306,0.006556995,0.8663869,0.020574622,0.00004299274],"about_ca_topic_score_codex":0.00081582373,"about_ca_topic_score_gemma":0.0007492233,"teacher_disagreement_score":0.0041270247,"about_ca_system_score_codex":0.0005769614,"about_ca_system_score_gemma":0.00031309752,"threshold_uncertainty_score":0.0138062835},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30873975,0.0030223904,0.4995187,0.0069208313,0.00086426904,0.00018802636,0.0006890086,0.00070987747,0.17934705],"genre_scores_gemma":[0.8601199,0.0018308074,0.10345181,0.0011371189,0.0007168379,0.0005934359,0.0008809011,0.0005120852,0.030757057],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99536777,0.0015994968,0.00046558227,0.0011020048,0.0010092037,0.00045597614],"domain_scores_gemma":[0.98589015,0.009754974,0.00068467227,0.0019276785,0.0009284346,0.0008140639],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005000825,0.0013701441,0.0020307049,0.0041244854,0.006968595,0.0090034455,0.0035987797,0.004659352,0.008605766],"category_scores_gemma":[0.017848054,0.002328991,0.0035332278,0.0038400914,0.00781264,0.02005027,0.009484341,0.010558327,0.0012577196],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012459596,0.000013748259,0.00011355378,0.000024099028,0.000004865113,0.000055799366,0.00021636982,0.00016645782,0.00021599996,0.997827,0.00025419236,0.0010954516],"study_design_scores_gemma":[0.00000804873,0.00000625674,0.00005357125,0.000014718963,0.00001377341,0.00014971591,0.00012076762,0.0012330115,0.000379539,0.996117,0.0018937403,0.00000984101],"about_ca_topic_score_codex":0.00035058128,"about_ca_topic_score_gemma":0.00040183982,"teacher_disagreement_score":0.0090034455,"about_ca_system_score_codex":0.0022353895,"about_ca_system_score_gemma":0.001021057,"threshold_uncertainty_score":0.028789222},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.91568816,0.0017321022,0.05773733,0.002018559,0.000110302106,0.000075284304,0.0003474514,0.00039891913,0.021891983],"genre_scores_gemma":[0.9765054,0.0010589522,0.014505938,0.0002924816,0.00015895748,0.00017543751,0.0002912966,0.0001945288,0.0068169106],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99918,0.00026095595,0.000036857462,0.0001958909,0.00016393448,0.00016243922],"domain_scores_gemma":[0.98913527,0.0073476913,0.0012233511,0.00062068144,0.0005414841,0.0011315647],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008491004,0.00080349925,0.0011361988,0.0038212256,0.002370495,0.0036814304,0.0021660784,0.0022248905,0.0045680846],"category_scores_gemma":[0.011317263,0.0014981799,0.0009308521,0.0026788013,0.004065094,0.0056943703,0.003158585,0.0019314997,0.00044337628],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021568264,0.0000696253,0.0019389818,0.00019184235,0.000036519392,0.00030962008,0.0011105302,0.013976316,0.0032041706,0.9665374,0.0023552442,0.010054169],"study_design_scores_gemma":[0.000036813428,0.000024418108,0.0004510332,0.000041238443,0.000029323479,0.0001769728,0.00022550789,0.018624866,0.0007807832,0.97831774,0.0012730033,0.000018385092],"about_ca_topic_score_codex":0.0016786963,"about_ca_topic_score_gemma":0.002231787,"teacher_disagreement_score":0.0045680846,"about_ca_system_score_codex":0.0015251915,"about_ca_system_score_gemma":0.0008657908,"threshold_uncertainty_score":0.015281737},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06921273,0.0029126152,0.8623867,0.0065902364,0.00048726675,0.0001724662,0.0004249149,0.000347087,0.05746599],"genre_scores_gemma":[0.760052,0.0051662805,0.19279629,0.0014988091,0.0016716551,0.0007165945,0.0008819468,0.0003175084,0.036898896],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99623615,0.001926924,0.00012131378,0.00073366746,0.00065202697,0.0003300885],"domain_scores_gemma":[0.9894499,0.008148342,0.00074775534,0.0007060867,0.0005180422,0.00042972562],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030540326,0.0009190272,0.0012335975,0.0014976826,0.0020424246,0.0021526222,0.0025660845,0.0021641995,0.010166361],"category_scores_gemma":[0.01779126,0.00052909955,0.0011896794,0.0025369243,0.0031237628,0.009223592,0.0030869688,0.003629244,0.0013396204],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032518077,0.00003377677,0.00011767876,0.00009189766,0.000014267655,0.00005896524,0.00009778314,0.013242751,0.00018192528,0.9731559,0.0026773133,0.010295301],"study_design_scores_gemma":[0.000019859617,0.000017892544,0.000053916017,0.000014987338,0.0000051567786,0.000062697574,0.000034711975,0.029515818,0.00015638089,0.9663603,0.0037495568,0.000008901393],"about_ca_topic_score_codex":0.0012244916,"about_ca_topic_score_gemma":0.0008619193,"teacher_disagreement_score":0.010166361,"about_ca_system_score_codex":0.0019155334,"about_ca_system_score_gemma":0.0011175617,"threshold_uncertainty_score":0.034009814},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.847598,0.0010933854,0.09288065,0.0018940613,0.00013746644,0.00007922943,0.0007844125,0.0003794175,0.055153433],"genre_scores_gemma":[0.97266895,0.0005235106,0.018538876,0.00021674682,0.0000937396,0.00015749234,0.00036959964,0.00008639124,0.0073446454],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987111,0.00042441307,0.00008955512,0.00025530718,0.0003191863,0.0002004491],"domain_scores_gemma":[0.9939382,0.0033201342,0.000955141,0.0004806487,0.0005259035,0.0007798916],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017433423,0.0006365063,0.0012908095,0.0035965166,0.0029116191,0.0065562474,0.0019293121,0.0016955901,0.008123287],"category_scores_gemma":[0.008210067,0.0012238473,0.0006893024,0.0030183583,0.0030956944,0.008737009,0.0026292833,0.0020457492,0.0008012265],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011188086,0.000037550162,0.0006116418,0.000051036517,0.000010271754,0.000048377766,0.00028427146,0.0035737571,0.00097483624,0.9885117,0.0013996161,0.0043850336],"study_design_scores_gemma":[0.000027618567,0.00001931497,0.0003645477,0.000029314142,0.000014809655,0.00013086705,0.00017622032,0.017128453,0.0006977426,0.9799631,0.0014315663,0.00001654858],"about_ca_topic_score_codex":0.0007073292,"about_ca_topic_score_gemma":0.0012267587,"teacher_disagreement_score":0.008123287,"about_ca_system_score_codex":0.0018289142,"about_ca_system_score_gemma":0.0007848338,"threshold_uncertainty_score":0.027175069},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6534569,0.0023549204,0.21129663,0.00272544,0.00061832153,0.00007357943,0.0005083667,0.00036168227,0.12860408],"genre_scores_gemma":[0.9301343,0.00074614206,0.039873946,0.00037958898,0.00041471,0.00013576676,0.00026119986,0.00013603142,0.027918346],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99833184,0.00041431465,0.00014807697,0.00037957585,0.00050087157,0.00022533353],"domain_scores_gemma":[0.9967069,0.0017073218,0.0004516874,0.00031119667,0.00047201375,0.0003507979],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017568334,0.0006745813,0.0011321914,0.003180746,0.0034587826,0.00662081,0.0014136544,0.0010841587,0.005505163],"category_scores_gemma":[0.0051603382,0.0008727209,0.0009798459,0.0029123458,0.0058353506,0.010610901,0.0035070295,0.002545058,0.0007762519],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026212789,0.00001250067,0.00014936118,0.000019914347,0.000007701822,0.00005982306,0.0003080292,0.00015261152,0.00037343928,0.99667716,0.00033335265,0.0018798034],"study_design_scores_gemma":[0.0000059021995,0.0000053927633,0.00009149935,0.000009692774,0.0000147195115,0.00010723015,0.0001328254,0.00067669956,0.00047442876,0.9963413,0.0021319834,0.000008254157],"about_ca_topic_score_codex":0.0006515203,"about_ca_topic_score_gemma":0.00089110807,"teacher_disagreement_score":0.00662081,"about_ca_system_score_codex":0.0012641468,"about_ca_system_score_gemma":0.0005486118,"threshold_uncertainty_score":0.018416643},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.65308535,0.00035980373,0.28297883,0.0010645047,0.00012925206,0.00017636026,0.00030526172,0.00022197104,0.061678685],"genre_scores_gemma":[0.95940053,0.00016665178,0.031272035,0.00017162849,0.0000412172,0.00013390183,0.00013495126,0.000088196495,0.008590866],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99814606,0.00055999163,0.00008677137,0.00051976874,0.00024823967,0.00043921435],"domain_scores_gemma":[0.99684286,0.0014287565,0.0005061289,0.00041735152,0.00017727276,0.0006276799],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001235212,0.00080147467,0.001104906,0.0008614931,0.0016952237,0.0022899332,0.0015733173,0.0018766632,0.00831966],"category_scores_gemma":[0.007993316,0.0005693595,0.0007016413,0.0005894104,0.003513775,0.0050105625,0.00195572,0.0018344449,0.00055634574],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003783153,0.00007771641,0.0015156284,0.000090889414,0.000051162122,0.0003149034,0.00031327273,0.02582614,0.0046346374,0.95208806,0.0022261092,0.012483114],"study_design_scores_gemma":[0.00008161722,0.00020710223,0.0018456085,0.00005515602,0.00003714109,0.00051321054,0.00055712194,0.14954288,0.003898533,0.8359306,0.0072682295,0.00006281966],"about_ca_topic_score_codex":0.00097339676,"about_ca_topic_score_gemma":0.0008216434,"teacher_disagreement_score":0.00831966,"about_ca_system_score_codex":0.0011038186,"about_ca_system_score_gemma":0.00052486215,"threshold_uncertainty_score":0.027831972},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1340463,0.016730765,0.6461645,0.011991387,0.0015837462,0.00018612202,0.00086439843,0.0018250324,0.18660776],"genre_scores_gemma":[0.8352706,0.007717662,0.11256441,0.00396253,0.002607062,0.00067252695,0.0010273928,0.0011158899,0.035061944],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99560636,0.0011993457,0.0001948622,0.00097650813,0.0010983847,0.0009244997],"domain_scores_gemma":[0.9458281,0.043931905,0.001809775,0.002424144,0.0032555964,0.0027505453],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0077359555,0.002469848,0.0027998697,0.0069766776,0.003043684,0.0071173203,0.0047581457,0.0032921047,0.012474246],"category_scores_gemma":[0.03687883,0.0013127407,0.0029737132,0.005915677,0.008120955,0.017663077,0.00781874,0.009433446,0.0025489368],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015873817,0.00007486341,0.00059846626,0.00015821583,0.000032567274,0.000113725604,0.0002895888,0.0043428815,0.0015458579,0.9792381,0.0048819524,0.008565104],"study_design_scores_gemma":[0.000028114047,0.00006158724,0.00051353814,0.00013174608,0.0000759487,0.0002594629,0.000099283796,0.04508367,0.0018352122,0.94435275,0.0074963067,0.00006243492],"about_ca_topic_score_codex":0.0015098735,"about_ca_topic_score_gemma":0.001006753,"teacher_disagreement_score":0.012474246,"about_ca_system_score_codex":0.0052012443,"about_ca_system_score_gemma":0.0018642533,"threshold_uncertainty_score":0.041730464},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.796561,0.0029025674,0.13173707,0.003478669,0.0002588765,0.00013746023,0.0040791696,0.0013649459,0.05948022],"genre_scores_gemma":[0.94573766,0.0015956528,0.042980168,0.00038455654,0.000397332,0.00022523159,0.0023265816,0.00035615833,0.0059967176],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99664116,0.0005319536,0.00023655068,0.00098193,0.0008614132,0.0007470545],"domain_scores_gemma":[0.95957065,0.030092351,0.0021350682,0.0036331497,0.0015482325,0.0030204507],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002535659,0.0013971525,0.002690459,0.003358276,0.0033949567,0.006205584,0.004958785,0.0030891383,0.011403734],"category_scores_gemma":[0.027268395,0.0017012965,0.0022815848,0.0032779423,0.0038554897,0.011266276,0.004861704,0.0033917234,0.001253412],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0024741383,0.00040652297,0.031387947,0.0015942601,0.00053156656,0.001768961,0.0022511026,0.077203155,0.05554586,0.7665028,0.017225415,0.043108307],"study_design_scores_gemma":[0.00014048978,0.00029006184,0.0091334935,0.00026530089,0.0004403391,0.00489967,0.00067434646,0.25590488,0.021835282,0.6915293,0.014681676,0.00020516296],"about_ca_topic_score_codex":0.0010780704,"about_ca_topic_score_gemma":0.0006331713,"teacher_disagreement_score":0.011403734,"about_ca_system_score_codex":0.0026381789,"about_ca_system_score_gemma":0.00093883317,"threshold_uncertainty_score":0.038149297},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.076685004,0.0025065262,0.56351393,0.0037801352,0.0014417048,0.00012265643,0.0015493565,0.001408653,0.348992],"genre_scores_gemma":[0.7268544,0.0018910004,0.16967112,0.004585039,0.0015299008,0.0001778764,0.0017394002,0.0007680765,0.09278316],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980749,0.00026649356,0.00012555535,0.00052259874,0.0007339867,0.00027649652],"domain_scores_gemma":[0.99722075,0.0013032461,0.0001779726,0.0005562755,0.0005556339,0.00018617886],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021023955,0.00066878647,0.0008031857,0.0017969222,0.0019998034,0.0015045654,0.0011838435,0.001154219,0.023451723],"category_scores_gemma":[0.0034854691,0.00043561915,0.0024470938,0.0014957649,0.002991385,0.0077498946,0.0021355392,0.0028738629,0.0048655677],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000047288628,0.000022717588,0.00031622336,0.00008186614,0.000018601933,0.0001596305,0.00029025538,0.000987611,0.002090713,0.9716333,0.007742063,0.016609816],"study_design_scores_gemma":[0.00001699705,0.00006460764,0.0005739764,0.000028790459,0.000026066107,0.00072516524,0.00006280294,0.0048207706,0.0036416617,0.93790275,0.052101318,0.00003503396],"about_ca_topic_score_codex":0.0011215621,"about_ca_topic_score_gemma":0.00080867787,"teacher_disagreement_score":0.023451723,"about_ca_system_score_codex":0.0012693476,"about_ca_system_score_gemma":0.00074290176,"threshold_uncertainty_score":0.07845378},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7331972,0.0015518088,0.22894824,0.0008306841,0.00006493053,0.00008175739,0.0004709423,0.0005247141,0.034329716],"genre_scores_gemma":[0.98921424,0.00040518842,0.0078010736,0.0001013924,0.000047534082,0.000063650165,0.00016143863,0.000046964164,0.0021584684],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99936324,0.000104934705,0.000030926363,0.0001367268,0.00020286656,0.00016130648],"domain_scores_gemma":[0.99659306,0.0019898573,0.0004020757,0.00020308324,0.0003181885,0.000493831],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006734174,0.00034378373,0.0005750659,0.0023481268,0.0008711029,0.0013413887,0.00097316725,0.0008506277,0.002764744],"category_scores_gemma":[0.007857219,0.00030671147,0.00058138225,0.0009734065,0.0016120226,0.00251605,0.0014837543,0.000965725,0.0002795732],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009891105,0.00003448802,0.002093948,0.00012549617,0.000027561015,0.00029171165,0.000541257,0.022298798,0.0064581167,0.95689046,0.0017170142,0.009422317],"study_design_scores_gemma":[0.000014526921,0.000035012272,0.0011649358,0.000037855556,0.000019780971,0.00034197382,0.00015577527,0.10921477,0.0022358042,0.88433313,0.0024221633,0.00002425745],"about_ca_topic_score_codex":0.0013437452,"about_ca_topic_score_gemma":0.00068483804,"teacher_disagreement_score":0.002764744,"about_ca_system_score_codex":0.0015318904,"about_ca_system_score_gemma":0.0004868834,"threshold_uncertainty_score":0.011114657},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18406163,0.024857437,0.31536752,0.016905297,0.0019130607,0.00020407564,0.0030164525,0.0032183991,0.4504562],"genre_scores_gemma":[0.91563416,0.0063842507,0.04792886,0.001880619,0.0015809358,0.00049685664,0.0014711831,0.00062231347,0.02400076],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99715376,0.00071964785,0.00011178768,0.00046685044,0.0009276955,0.0006203356],"domain_scores_gemma":[0.9713705,0.021083742,0.0013610626,0.00265132,0.0017609292,0.0017724705],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004261892,0.0016195579,0.0015994476,0.005180042,0.0026019115,0.005520666,0.0045772633,0.002299292,0.018644027],"category_scores_gemma":[0.04721404,0.0008972842,0.0010804912,0.0037653064,0.0038380509,0.013714637,0.0060114404,0.005783226,0.004371054],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003468987,0.00015930069,0.0014438255,0.00043787123,0.000055354143,0.00013761432,0.00044191466,0.012455378,0.0022054093,0.92835057,0.02646543,0.027500588],"study_design_scores_gemma":[0.000026717955,0.000044512664,0.00093340455,0.00017272559,0.00004818965,0.00032358387,0.00013736205,0.035545267,0.0013002027,0.9518314,0.009592252,0.000044298722],"about_ca_topic_score_codex":0.0013025686,"about_ca_topic_score_gemma":0.0025202853,"teacher_disagreement_score":0.018644027,"about_ca_system_score_codex":0.0042746025,"about_ca_system_score_gemma":0.0015679118,"threshold_uncertainty_score":0.06237054},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47424233,0.0014476654,0.14085111,0.0014105461,0.00053385645,0.00008637915,0.0006482623,0.0012414546,0.3795384],"genre_scores_gemma":[0.9603086,0.00040921668,0.014187844,0.00033911376,0.00014457294,0.00006830902,0.00033922345,0.00015267282,0.02405041],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99952435,0.00014000604,0.000025850764,0.00008592803,0.000116052586,0.00010783835],"domain_scores_gemma":[0.99848074,0.00068178866,0.00021905894,0.00019066251,0.00016114696,0.0002666996],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043541862,0.0004377659,0.0003155599,0.0016488676,0.0013415375,0.0025259615,0.00079175935,0.0007772401,0.00850135],"category_scores_gemma":[0.0025606519,0.00049084873,0.00045413448,0.00080494955,0.0015701873,0.0029035485,0.0015802085,0.0012979698,0.0012364008],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022759592,0.00002384814,0.0002727914,0.00003141623,0.0000048162415,0.000118554926,0.00014241645,0.00060416263,0.0010816195,0.99123085,0.0021281638,0.0043386],"study_design_scores_gemma":[0.000014452303,0.000011949315,0.00034543764,0.00001777545,0.000008947712,0.0003410298,0.00014133324,0.004357502,0.0010388218,0.98817855,0.0055316873,0.000012539505],"about_ca_topic_score_codex":0.0008647747,"about_ca_topic_score_gemma":0.0014522424,"teacher_disagreement_score":0.00850135,"about_ca_system_score_codex":0.00067223754,"about_ca_system_score_gemma":0.00036212974,"threshold_uncertainty_score":0.02843988},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2693861,0.010671982,0.13228346,0.006294376,0.002346158,0.00006184339,0.0009849122,0.00040905332,0.5775621],"genre_scores_gemma":[0.9566991,0.0031185015,0.020367742,0.0007287005,0.001367402,0.00008366796,0.00030169124,0.00016025237,0.017173087],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988971,0.000267794,0.00006128583,0.0002809384,0.00035916947,0.0001337438],"domain_scores_gemma":[0.9911527,0.006169111,0.0005527967,0.0009136216,0.0004954973,0.00071615237],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014988177,0.00054326066,0.00072181865,0.00255005,0.0016186723,0.0023018967,0.0013894446,0.0009328098,0.0075609935],"category_scores_gemma":[0.009745561,0.0005878735,0.0005954456,0.0020968725,0.0037309546,0.007145576,0.0028071976,0.003348555,0.0009860124],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006472958,0.000023263903,0.0008458387,0.00009668338,0.000013630635,0.00012214093,0.00016161475,0.0009730086,0.0012900151,0.9792155,0.005432998,0.011760668],"study_design_scores_gemma":[0.0000062517884,0.000012729442,0.0006627563,0.00002344328,0.000013239202,0.00020763188,0.00003739158,0.0028543968,0.0008019425,0.9876507,0.0077152736,0.000014208224],"about_ca_topic_score_codex":0.00063184265,"about_ca_topic_score_gemma":0.0009241632,"teacher_disagreement_score":0.0075609935,"about_ca_system_score_codex":0.0008114367,"about_ca_system_score_gemma":0.00048605338,"threshold_uncertainty_score":0.025294065},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43179715,0.0007189473,0.26685917,0.0035760761,0.00075092743,0.000120123805,0.0008909201,0.0008678353,0.2944188],"genre_scores_gemma":[0.9576044,0.00037499156,0.021139827,0.0004697383,0.00040560568,0.00010307943,0.00042404956,0.00023383871,0.019244555],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99864846,0.00019101707,0.000104345105,0.00042788955,0.0003183762,0.00031005367],"domain_scores_gemma":[0.99422765,0.0031792119,0.00033846908,0.0006378354,0.00067561766,0.0009412106],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013452286,0.00068693305,0.00093410205,0.0019321155,0.0028500764,0.003589802,0.0015083008,0.0020943526,0.016624501],"category_scores_gemma":[0.008460282,0.0007023103,0.0011971662,0.0012662846,0.0038718453,0.010281603,0.0037190628,0.003687415,0.0023126912],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000503815,0.000023725815,0.0003263571,0.000043967753,0.0000075099324,0.00017993388,0.00023764891,0.00046700417,0.0020919128,0.99189246,0.0010780358,0.0036010672],"study_design_scores_gemma":[0.000018857369,0.00001786809,0.00020794415,0.000019694979,0.000013113817,0.0003545436,0.00015461426,0.0025612207,0.0015789737,0.99246407,0.0025893215,0.000019767705],"about_ca_topic_score_codex":0.00078548887,"about_ca_topic_score_gemma":0.00071055116,"teacher_disagreement_score":0.016624501,"about_ca_system_score_codex":0.0008631274,"about_ca_system_score_gemma":0.00089221215,"threshold_uncertainty_score":0.05561453},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48754117,0.0013013233,0.057470877,0.00322399,0.00051306706,0.000088571025,0.0009790125,0.00038176976,0.4485003],"genre_scores_gemma":[0.95904374,0.00032703663,0.011218233,0.00035446786,0.00012170628,0.00007988814,0.0002926903,0.00006733803,0.028494846],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99955815,0.00015459546,0.000020600171,0.000074094896,0.00009704035,0.0000954958],"domain_scores_gemma":[0.998847,0.00047892414,0.00019890866,0.00008648817,0.00020655907,0.0001821713],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006655221,0.0003445929,0.00035496525,0.0014957502,0.0014729861,0.0024531165,0.0005592254,0.00062284607,0.015701821],"category_scores_gemma":[0.0021543833,0.00026128397,0.0003039797,0.0007092654,0.0018207177,0.0028285729,0.0012745855,0.0010167892,0.0016805594],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005981833,0.000016700487,0.0002966645,0.00003617089,0.00000516062,0.00007387275,0.00011738126,0.00048567698,0.00076989434,0.9906833,0.0028890634,0.00456627],"study_design_scores_gemma":[0.000016621461,0.000017126267,0.00043799132,0.000025987512,0.0000055008554,0.00015696062,0.00016079475,0.0030021297,0.0009447242,0.98753023,0.0076922965,0.000009774245],"about_ca_topic_score_codex":0.0011825643,"about_ca_topic_score_gemma":0.0015164944,"teacher_disagreement_score":0.015701821,"about_ca_system_score_codex":0.00096008397,"about_ca_system_score_gemma":0.00061430887,"threshold_uncertainty_score":0.052527845},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22224624,0.0100297015,0.13632266,0.008509858,0.001237054,0.00014393791,0.0032747935,0.0020073843,0.61622846],"genre_scores_gemma":[0.9136707,0.0027925833,0.047151472,0.0008749953,0.00075001153,0.00029661847,0.0018918915,0.00041625285,0.03215549],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979195,0.00037007537,0.000076605415,0.00032897422,0.0006858445,0.0006190419],"domain_scores_gemma":[0.98997724,0.007005379,0.0005176183,0.00081079075,0.00070640136,0.0009825068],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022220183,0.0013049684,0.0010683052,0.006548357,0.0034714888,0.004715918,0.0030827702,0.002388294,0.019822823],"category_scores_gemma":[0.013538094,0.0006224885,0.0009622437,0.0029194758,0.0024029948,0.0074824537,0.0029059364,0.0038491075,0.0038696113],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003025141,0.00014437984,0.0020437762,0.00024430885,0.00004613618,0.00015971533,0.00043089798,0.007027599,0.002934551,0.92368746,0.019925348,0.04305346],"study_design_scores_gemma":[0.00002737518,0.000033363776,0.0014613888,0.00013230483,0.000046457542,0.000294877,0.00014644196,0.01488189,0.0034461075,0.95905375,0.020418195,0.000057916735],"about_ca_topic_score_codex":0.0017097986,"about_ca_topic_score_gemma":0.0038674306,"teacher_disagreement_score":0.019822823,"about_ca_system_score_codex":0.0032213356,"about_ca_system_score_gemma":0.0011682087,"threshold_uncertainty_score":0.06631398},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.107452676,0.035381883,0.6228002,0.008029975,0.002015371,0.00025578035,0.0020992549,0.0017424343,0.22022249],"genre_scores_gemma":[0.7609889,0.013690537,0.20567505,0.0020964127,0.0022570954,0.0009442709,0.0016696773,0.0005223368,0.012155741],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99676466,0.00083483936,0.00022360292,0.0006165887,0.0010343436,0.0005258752],"domain_scores_gemma":[0.97834194,0.016905833,0.0010399269,0.0013676113,0.0014893267,0.0008553589],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0055868803,0.0020983336,0.0013843713,0.004368977,0.0016189195,0.002955814,0.0024822024,0.0018269714,0.00924938],"category_scores_gemma":[0.023973295,0.00077891385,0.0012853299,0.0019053719,0.0025936747,0.008921091,0.0035238436,0.0062070102,0.0026714928],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00042446147,0.00026344042,0.0019006667,0.00087793625,0.00011256127,0.00029054377,0.00064907677,0.01668716,0.011302204,0.86702114,0.022324016,0.07814677],"study_design_scores_gemma":[0.00006469956,0.00014975735,0.0017295647,0.00027993947,0.00012871831,0.0007914281,0.00017809452,0.046850536,0.012582701,0.90662485,0.030502316,0.000117409],"about_ca_topic_score_codex":0.0004295447,"about_ca_topic_score_gemma":0.0008482335,"teacher_disagreement_score":0.00924938,"about_ca_system_score_codex":0.002223723,"about_ca_system_score_gemma":0.0009785579,"threshold_uncertainty_score":0.030942261},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6342454,0.0012387497,0.12007795,0.006499389,0.0014125727,0.0004096753,0.0046614744,0.0017284794,0.22972633],"genre_scores_gemma":[0.9528322,0.00035515457,0.033977877,0.0010910118,0.0002920018,0.0002497657,0.0025088808,0.00019067648,0.008502452],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99911433,0.00015859146,0.000093644485,0.00029399837,0.00013817853,0.00020131929],"domain_scores_gemma":[0.9921077,0.0037332107,0.0006700555,0.000650919,0.0013173412,0.0015206671],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00096719095,0.00046024055,0.0008373465,0.0017200197,0.0033408136,0.0022869916,0.0010680167,0.0028737655,0.013873751],"category_scores_gemma":[0.012067312,0.0006139723,0.0008153734,0.00085476495,0.0024590995,0.004032539,0.0020817213,0.002195061,0.0026444497],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007441732,0.00023776699,0.0049938583,0.00044392224,0.000056612113,0.0026338305,0.0010660714,0.003289048,0.028692309,0.926998,0.019683922,0.011160416],"study_design_scores_gemma":[0.00026062594,0.00018889846,0.0035515402,0.00024405932,0.00007943307,0.0032396684,0.0018274555,0.01421552,0.015901938,0.92451715,0.035856612,0.00011710552],"about_ca_topic_score_codex":0.0018334473,"about_ca_topic_score_gemma":0.0022840775,"teacher_disagreement_score":0.013873751,"about_ca_system_score_codex":0.00085905776,"about_ca_system_score_gemma":0.0016913837,"threshold_uncertainty_score":0.04641235},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4465774,0.003689347,0.41352874,0.0109415315,0.0008974811,0.00008384816,0.00074773934,0.0006550188,0.122878924],"genre_scores_gemma":[0.9478989,0.0009143793,0.033673916,0.000552305,0.00035824842,0.00007982899,0.00029909576,0.00022528305,0.015998082],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981908,0.00067479763,0.00006183926,0.0003332424,0.0003916331,0.0003476971],"domain_scores_gemma":[0.9839055,0.012211827,0.0008895467,0.00084204087,0.0008703299,0.0012808007],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029142436,0.0008281017,0.001665912,0.0028420002,0.0028533712,0.0047344407,0.00286954,0.0038511704,0.00920984],"category_scores_gemma":[0.03217947,0.00077542686,0.0010533032,0.001409375,0.008364345,0.011328405,0.0042715226,0.0060233218,0.0009609487],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007989235,0.00001908914,0.00037457258,0.00007188231,0.000010273326,0.00008065699,0.00015860106,0.003891421,0.00026347424,0.9883057,0.0015918704,0.005152579],"study_design_scores_gemma":[0.000009090914,0.000012228263,0.0001778502,0.000040544932,0.000006562043,0.00008263092,0.00011341552,0.016983457,0.0002789294,0.98112535,0.0011466037,0.00002335409],"about_ca_topic_score_codex":0.0018252365,"about_ca_topic_score_gemma":0.0012686851,"teacher_disagreement_score":0.00920984,"about_ca_system_score_codex":0.0025902302,"about_ca_system_score_gemma":0.0012063582,"threshold_uncertainty_score":0.030809999},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8058925,0.00148862,0.11994114,0.00051819364,0.00015000299,0.00009470771,0.0005773424,0.00032751702,0.071009934],"genre_scores_gemma":[0.966084,0.00062502397,0.026122173,0.00008280195,0.00008336347,0.00012754154,0.0002442448,0.000064845815,0.0065659247],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994648,0.00012680372,0.000029827845,0.00013212032,0.0001412698,0.00010515835],"domain_scores_gemma":[0.99685764,0.0016444344,0.00064726383,0.00017737804,0.00026127617,0.00041190351],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00058933353,0.00041113948,0.0002702392,0.002854712,0.0009280448,0.0012824013,0.0006440102,0.0005575694,0.0063753887],"category_scores_gemma":[0.0038714793,0.00027743596,0.00037916872,0.0013522401,0.0017549435,0.003235803,0.00090862514,0.0007755081,0.00051090785],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001387316,0.000041586114,0.0030640033,0.00013118183,0.00002147663,0.00018182232,0.00060647883,0.005688492,0.0063479296,0.9586319,0.0023358753,0.022810567],"study_design_scores_gemma":[0.00002545099,0.00009488332,0.0027299775,0.000049262388,0.000023906166,0.0006349701,0.00036253466,0.02328208,0.0035933438,0.95843714,0.01073025,0.000036200832],"about_ca_topic_score_codex":0.00040213624,"about_ca_topic_score_gemma":0.0005064259,"teacher_disagreement_score":0.0063753887,"about_ca_system_score_codex":0.00085588027,"about_ca_system_score_gemma":0.0003010477,"threshold_uncertainty_score":0.021327853},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31114864,0.004066633,0.07647015,0.030351717,0.0014421104,0.00007180662,0.0015154724,0.0011166221,0.5738169],"genre_scores_gemma":[0.92141014,0.0012107046,0.014067998,0.0027496393,0.00044267255,0.00008068989,0.00067860243,0.00018938495,0.059170175],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99912804,0.000195325,0.00003484338,0.00021326376,0.00016476211,0.00026377817],"domain_scores_gemma":[0.99694663,0.0015788003,0.00026506404,0.0005146689,0.0003494197,0.00034543267],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009704558,0.0005006727,0.000835974,0.0010045398,0.0038464759,0.0039109373,0.0010642406,0.00245462,0.016196078],"category_scores_gemma":[0.006855358,0.0005285597,0.0006936544,0.0016230111,0.0047696643,0.008877936,0.0029629949,0.0032535023,0.0035417648],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004939293,0.000011609133,0.00028981126,0.000034035274,0.000004948296,0.00007866779,0.00015425336,0.0005837208,0.00017795767,0.9852513,0.009690724,0.0036736075],"study_design_scores_gemma":[0.000008112817,0.0000042076144,0.00012700341,0.000012281655,0.0000028612008,0.000057399466,0.00007100871,0.00071346253,0.00009601644,0.99463934,0.004261724,0.000006627984],"about_ca_topic_score_codex":0.0067785294,"about_ca_topic_score_gemma":0.0071176635,"teacher_disagreement_score":0.016196078,"about_ca_system_score_codex":0.0020634416,"about_ca_system_score_gemma":0.0016741212,"threshold_uncertainty_score":0.054181278},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.041127674,0.0089938035,0.21088059,0.012963224,0.0023120465,0.000088949484,0.0013845621,0.00037234538,0.7218769],"genre_scores_gemma":[0.8145055,0.010322623,0.06635415,0.0048896447,0.0029062433,0.00031707314,0.001138243,0.00037755162,0.09918901],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99839514,0.00041590427,0.00007137453,0.00036426427,0.00055672886,0.00019650332],"domain_scores_gemma":[0.99670035,0.0016694906,0.00025514158,0.00051044597,0.00056936056,0.0002952463],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016649337,0.00076943886,0.0010806487,0.00286415,0.0016869458,0.0031212752,0.0017397908,0.001761214,0.015340845],"category_scores_gemma":[0.008490019,0.00037757185,0.00090245437,0.0023653293,0.003485991,0.010342844,0.0046421983,0.004757552,0.0032284893],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009241388,0.0000059412505,0.000083050996,0.00003500296,0.0000047863196,0.00003625483,0.00005333065,0.00023764132,0.00017103316,0.99154586,0.00402817,0.0037897283],"study_design_scores_gemma":[0.000004416375,0.0000043532827,0.00013068147,0.000019983436,0.000004990849,0.00009723451,0.000033479297,0.0014085374,0.00014004065,0.9879005,0.01025049,0.000005344303],"about_ca_topic_score_codex":0.0014426393,"about_ca_topic_score_gemma":0.0013592384,"teacher_disagreement_score":0.015340845,"about_ca_system_score_codex":0.0017972274,"about_ca_system_score_gemma":0.0008010868,"threshold_uncertainty_score":0.051320195},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5937862,0.0076837596,0.09325285,0.006437246,0.0008470918,0.00011296204,0.0025269913,0.0004750132,0.29487786],"genre_scores_gemma":[0.97544086,0.00180764,0.008049451,0.00028815377,0.00034202205,0.0001362746,0.0004664902,0.000068224595,0.013401009],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986644,0.00031557388,0.000085154876,0.00025930366,0.00046591542,0.00020971113],"domain_scores_gemma":[0.9904631,0.0059279045,0.001170233,0.0007213819,0.0007285119,0.0009889895],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013488226,0.00057631946,0.0008461387,0.0047369734,0.0017609358,0.004456335,0.0020306064,0.0013734272,0.007488306],"category_scores_gemma":[0.0127633205,0.00067108724,0.00043645132,0.0024521016,0.0042922474,0.0064935456,0.0023803317,0.0019143221,0.001020389],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000072855335,0.000023314185,0.0006812202,0.000107786225,0.000015754524,0.00005605459,0.00018373494,0.0015002032,0.0008766323,0.98524046,0.002826571,0.008415365],"study_design_scores_gemma":[0.00001314869,0.000013248417,0.00059843116,0.000049458744,0.000016134976,0.0002672835,0.00010657232,0.0052480856,0.0007209741,0.98936427,0.003587871,0.000014577041],"about_ca_topic_score_codex":0.00084979006,"about_ca_topic_score_gemma":0.0010029328,"teacher_disagreement_score":0.007488306,"about_ca_system_score_codex":0.0015597214,"about_ca_system_score_gemma":0.0006865001,"threshold_uncertainty_score":0.025050879},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.067434825,0.0052437866,0.25394142,0.010234043,0.004426872,0.000106136,0.0004532896,0.0014528616,0.6567067],"genre_scores_gemma":[0.80733,0.0039992756,0.10973812,0.004192223,0.0021224332,0.00032083807,0.00028101774,0.00065137935,0.07136467],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99892634,0.0003938725,0.000047469017,0.00020543639,0.00030274127,0.00012407544],"domain_scores_gemma":[0.99509525,0.0032492199,0.0002222939,0.0005783413,0.0003877037,0.0004672694],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00158397,0.00073010597,0.000638791,0.0016747883,0.0021917755,0.0031269467,0.0018249325,0.0015886138,0.024526043],"category_scores_gemma":[0.010689274,0.0003995868,0.00055804575,0.0012032745,0.003836294,0.010235367,0.003677588,0.004585807,0.0030377991],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030467281,0.000013911037,0.00008106034,0.000049988666,0.0000027023334,0.000038114482,0.000075290474,0.0003930213,0.00048285248,0.98655385,0.005804159,0.0064745755],"study_design_scores_gemma":[0.000006881099,0.000012737662,0.00007982942,0.000022698807,0.0000038440953,0.00007446749,0.000040577102,0.0019761638,0.00038428404,0.9864871,0.010901519,0.000009967754],"about_ca_topic_score_codex":0.0006380031,"about_ca_topic_score_gemma":0.00095883425,"teacher_disagreement_score":0.024526043,"about_ca_system_score_codex":0.0010971485,"about_ca_system_score_gemma":0.0005866672,"threshold_uncertainty_score":0.08204776},"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":"review","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018823016,0.47629994,0.18542801,0.03385354,0.0046622823,0.00009040083,0.00087295496,0.0006330984,0.27933678],"genre_scores_gemma":[0.24441764,0.5608939,0.10905397,0.010770142,0.019693619,0.00029291137,0.002544898,0.00066834374,0.051664498],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984131,0.00052795146,0.00011576757,0.00029659085,0.0005218075,0.00012478259],"domain_scores_gemma":[0.9943041,0.004496651,0.00019293163,0.00041865234,0.0004079294,0.0001795902],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033863378,0.0010640156,0.0015617276,0.005246822,0.0021095392,0.0054001524,0.0019677503,0.0025404864,0.01203277],"category_scores_gemma":[0.008992361,0.0010047015,0.00091346714,0.009091586,0.0046810247,0.017807009,0.0027174696,0.005552802,0.0037511704],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031369796,0.000076469216,0.00047726854,0.0008970476,0.00001968313,0.00010133337,0.00022237081,0.0010198376,0.00028713956,0.8927243,0.026274161,0.077869035],"study_design_scores_gemma":[0.000008685614,0.000032295662,0.00047695925,0.0003410619,0.000013760204,0.00042359057,0.00017565757,0.0019745163,0.00025866792,0.8954104,0.100855,0.000029315122],"about_ca_topic_score_codex":0.0011689506,"about_ca_topic_score_gemma":0.0011481051,"teacher_disagreement_score":0.01203277,"about_ca_system_score_codex":0.002253695,"about_ca_system_score_gemma":0.0011723149,"threshold_uncertainty_score":0.04025364},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3290167,0.0011596618,0.023340793,0.01080378,0.003712254,0.000086298256,0.00065403775,0.0013788152,0.62984765],"genre_scores_gemma":[0.8980047,0.0004204941,0.011414844,0.0010261502,0.0005258728,0.00006850918,0.00046015184,0.00023965361,0.08783961],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992644,0.0001071126,0.00002814788,0.00014361217,0.00021312208,0.00024361414],"domain_scores_gemma":[0.99873203,0.0004362901,0.000108739136,0.00014462612,0.00018128852,0.0003970452],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000545903,0.000819738,0.00083748053,0.0024508575,0.0045134635,0.0032841084,0.0013929205,0.0024417567,0.038293734],"category_scores_gemma":[0.0027746388,0.00038336928,0.00072799425,0.0009275167,0.0047394945,0.0047678314,0.0025607308,0.0028914544,0.0061901878],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016534208,0.00005397985,0.0005894939,0.00014554683,0.000016672828,0.00038553606,0.0002962483,0.0001981964,0.0032889273,0.96886617,0.010877044,0.015116878],"study_design_scores_gemma":[0.00003879443,0.000059892045,0.0009002869,0.000048829766,0.000025765661,0.00067884574,0.00032045323,0.0006186147,0.004922699,0.9535684,0.038772877,0.000044456996],"about_ca_topic_score_codex":0.00085083244,"about_ca_topic_score_gemma":0.0015482235,"teacher_disagreement_score":0.038293734,"about_ca_system_score_codex":0.0017815789,"about_ca_system_score_gemma":0.001133102,"threshold_uncertainty_score":0.12810534},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45898187,0.0013612878,0.33063525,0.01985049,0.0018712424,0.00017246527,0.001664308,0.0013116251,0.1841515],"genre_scores_gemma":[0.96722245,0.00049753947,0.020451887,0.001470566,0.00078075635,0.000080866565,0.0005770629,0.000080618614,0.008838249],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9965701,0.000897981,0.00023765373,0.0010244454,0.00086681853,0.0004030531],"domain_scores_gemma":[0.98556155,0.00569255,0.0014920364,0.003656178,0.0023582364,0.0012395786],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0044050077,0.0005936533,0.0011655111,0.0016738129,0.0017133157,0.0028935352,0.001993997,0.0016383326,0.0102681415],"category_scores_gemma":[0.016069908,0.00045160326,0.0010823569,0.0017370031,0.004602399,0.00849576,0.0038142349,0.003641261,0.0011112642],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019272896,0.000054902404,0.0016847658,0.0000917167,0.000023143415,0.00022163366,0.00025719052,0.007491084,0.0024527265,0.9733853,0.0060255094,0.008119426],"study_design_scores_gemma":[0.000048631628,0.000050775525,0.000569394,0.00002930898,0.00001594321,0.00019611727,0.00017649149,0.030580742,0.001195596,0.9571869,0.009929683,0.000020299685],"about_ca_topic_score_codex":0.001910977,"about_ca_topic_score_gemma":0.0015415421,"teacher_disagreement_score":0.0102681415,"about_ca_system_score_codex":0.0015055242,"about_ca_system_score_gemma":0.00075224665,"threshold_uncertainty_score":0.034350395},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38110092,0.0016855554,0.34530064,0.028207142,0.0011875321,0.00016630963,0.0015265202,0.0010709834,0.2397544],"genre_scores_gemma":[0.9398276,0.00089746166,0.036778174,0.0022240104,0.00081733905,0.00017519014,0.0006962953,0.0001298239,0.018454123],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99648213,0.00085408194,0.0001744947,0.0011482685,0.00094625383,0.00039465597],"domain_scores_gemma":[0.99069476,0.0040740524,0.00090884935,0.0024144903,0.0010801328,0.0008276691],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003430489,0.0007199864,0.0010383892,0.0016536626,0.0023135892,0.002941954,0.0020248573,0.0019135034,0.008790104],"category_scores_gemma":[0.01598539,0.0005167826,0.0011517687,0.0017358194,0.0056561823,0.011651182,0.004617322,0.0041971845,0.0013479461],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000640798,0.000024450675,0.0007884868,0.000051782965,0.000009614936,0.000078396246,0.000249014,0.0028233714,0.0009757697,0.9858597,0.003513885,0.005561526],"study_design_scores_gemma":[0.000024538556,0.000028460008,0.00028210928,0.000018075798,0.00000950552,0.00010047795,0.00010991504,0.01198193,0.0007871577,0.97670084,0.00994352,0.000013514501],"about_ca_topic_score_codex":0.0020650614,"about_ca_topic_score_gemma":0.0016477854,"teacher_disagreement_score":0.008790104,"about_ca_system_score_codex":0.0023442428,"about_ca_system_score_gemma":0.000977955,"threshold_uncertainty_score":0.029405832},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5502311,0.0004159095,0.41063845,0.0016432372,0.00013793273,0.0000739517,0.00072140543,0.00067563297,0.035462394],"genre_scores_gemma":[0.96871567,0.0001880576,0.024718227,0.00022539381,0.0001276078,0.00010234622,0.00034313533,0.0002052657,0.005374285],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99914694,0.0002595084,0.00003086858,0.00018015318,0.0002180186,0.00016462055],"domain_scores_gemma":[0.9968924,0.0015180256,0.000294079,0.0003876976,0.00033621938,0.00057161436],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014030259,0.00049081084,0.00078924303,0.001887218,0.0015833518,0.0019838815,0.0011566156,0.0011115676,0.0062523745],"category_scores_gemma":[0.0076392014,0.00047213113,0.00090649363,0.0009757771,0.0031391121,0.0032757607,0.0024012923,0.0012962482,0.000918625],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006479146,0.000023948298,0.00066798605,0.000039057126,0.000011947532,0.00011609629,0.0001656508,0.0071031996,0.0018246884,0.98508805,0.001206693,0.0036879075],"study_design_scores_gemma":[0.000018045082,0.00002492999,0.0004496482,0.000019560292,0.0000074557383,0.00015859719,0.00006539022,0.06779291,0.0017213009,0.9283293,0.0013903413,0.000022636086],"about_ca_topic_score_codex":0.0008912872,"about_ca_topic_score_gemma":0.00073559175,"teacher_disagreement_score":0.0062523745,"about_ca_system_score_codex":0.0016808378,"about_ca_system_score_gemma":0.0007896334,"threshold_uncertainty_score":0.020916283},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8223892,0.0007505786,0.12492107,0.0015539809,0.00019056565,0.00006596885,0.0005420753,0.0004807562,0.04910588],"genre_scores_gemma":[0.97855216,0.0002549612,0.013161335,0.0002955797,0.00007279516,0.00005823346,0.00024527937,0.00007441322,0.0072851623],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984971,0.0003510361,0.00008732115,0.00042173313,0.00028768354,0.00035501807],"domain_scores_gemma":[0.9905318,0.005561245,0.0007457907,0.0015084436,0.0006654204,0.0009872671],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011413465,0.00047273072,0.00075644185,0.00089480873,0.0018051311,0.002612685,0.001191919,0.00092182576,0.00596199],"category_scores_gemma":[0.008771026,0.00055901357,0.0005786612,0.0008229994,0.0019990543,0.0038791369,0.0027886743,0.0013114031,0.0007917979],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00040732964,0.00008450266,0.0033734003,0.00019661253,0.00004035764,0.000493041,0.0009922826,0.012491162,0.012433176,0.93692,0.00444837,0.028119748],"study_design_scores_gemma":[0.000066225046,0.000050615505,0.0007019454,0.00003190019,0.000034875455,0.00031089253,0.0002284251,0.03596515,0.0052505545,0.9501295,0.0072082225,0.000021711074],"about_ca_topic_score_codex":0.0011071407,"about_ca_topic_score_gemma":0.0016524476,"teacher_disagreement_score":0.00596199,"about_ca_system_score_codex":0.0016353483,"about_ca_system_score_gemma":0.000659372,"threshold_uncertainty_score":0.019944847},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.86842996,0.0006391786,0.106054865,0.00076686183,0.000041902586,0.000043208067,0.00065496314,0.00022889243,0.023140086],"genre_scores_gemma":[0.97750264,0.0002998995,0.01746993,0.00009791305,0.00003737658,0.000042944714,0.00046559508,0.000045000696,0.004038609],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990669,0.00015460305,0.00005296155,0.00037360532,0.00018036565,0.00017161964],"domain_scores_gemma":[0.99591273,0.0019690827,0.00064985454,0.00061763974,0.00043714218,0.00041348694],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006257697,0.0003760936,0.0005457813,0.0013378909,0.0012559156,0.0025402762,0.0009883384,0.0005836608,0.0038623419],"category_scores_gemma":[0.0029288519,0.00052682095,0.0006925328,0.0013253386,0.0026011223,0.0043783644,0.0014500045,0.001314513,0.00029321542],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022326378,0.00005885839,0.009813391,0.00014937762,0.000029856952,0.00030629197,0.0009201673,0.010308531,0.008963996,0.957296,0.0011867519,0.010743441],"study_design_scores_gemma":[0.000032001415,0.000039538034,0.0034607428,0.000043581105,0.000035507772,0.00046532066,0.00065238547,0.025471246,0.0077788886,0.95322543,0.008760394,0.000034919358],"about_ca_topic_score_codex":0.0027424162,"about_ca_topic_score_gemma":0.002882994,"teacher_disagreement_score":0.0038623419,"about_ca_system_score_codex":0.0023833502,"about_ca_system_score_gemma":0.00047940755,"threshold_uncertainty_score":0.0172925},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.68977475,0.0045088837,0.12854706,0.011890775,0.00058995245,0.000072678384,0.0009341586,0.00045323168,0.16322856],"genre_scores_gemma":[0.97423744,0.0010643689,0.011436764,0.0005555806,0.0005190664,0.0001289546,0.00019948647,0.00012431342,0.01173417],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99888486,0.00033780877,0.000051988864,0.00028802536,0.00027636962,0.00016086712],"domain_scores_gemma":[0.99274147,0.0047923955,0.0006886542,0.00048290682,0.0005343074,0.0007602235],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001786568,0.00083024363,0.00080886483,0.0027990576,0.0017524577,0.004157833,0.0016714974,0.0017908622,0.01004202],"category_scores_gemma":[0.012868678,0.00068602595,0.00061285915,0.002234017,0.0044724755,0.012992681,0.0027674865,0.002694168,0.0006497632],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005508727,0.000009852079,0.00032815512,0.00004230141,0.0000047992307,0.000020533045,0.00015178364,0.0010766176,0.0003680117,0.99336183,0.0012599841,0.003321006],"study_design_scores_gemma":[0.000008647008,0.000006672465,0.00014692057,0.0000119463975,0.0000067273127,0.000042906806,0.000050805877,0.003294366,0.00020408914,0.99510574,0.0011147294,0.000006480041],"about_ca_topic_score_codex":0.0009509741,"about_ca_topic_score_gemma":0.0008405329,"teacher_disagreement_score":0.01004202,"about_ca_system_score_codex":0.0017803506,"about_ca_system_score_gemma":0.00084005727,"threshold_uncertainty_score":0.033593893},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.83042055,0.0002695488,0.15906532,0.0020933738,0.000048099286,0.000066807595,0.0005650694,0.0005319733,0.0069391336],"genre_scores_gemma":[0.9876188,0.00017951454,0.010079154,0.00014651647,0.00007554056,0.00010054969,0.00040772365,0.000063763255,0.0013284406],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986386,0.00045698657,0.00004925087,0.00036880025,0.00027729402,0.0002090699],"domain_scores_gemma":[0.97106844,0.022681005,0.0022849615,0.0021150173,0.0008347765,0.0010157092],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030982473,0.00031589225,0.00083686033,0.0017807878,0.0007634203,0.0015388025,0.0018376557,0.0012175263,0.0024481323],"category_scores_gemma":[0.0318842,0.0005561056,0.0006190257,0.0010352258,0.0034457205,0.0036775724,0.0016648688,0.0015010386,0.00024606104],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009383582,0.00017429973,0.07423803,0.0003780042,0.00017290209,0.0016357814,0.0010667982,0.25798184,0.024856627,0.60301393,0.0058233375,0.029720066],"study_design_scores_gemma":[0.00006677941,0.0001742124,0.0154776005,0.00005612819,0.000054227112,0.0007412954,0.00025761806,0.8262634,0.004934349,0.15041398,0.0014583732,0.00010193682],"about_ca_topic_score_codex":0.0033809557,"about_ca_topic_score_gemma":0.0032895727,"teacher_disagreement_score":0.0033809557,"about_ca_system_score_codex":0.0015416193,"about_ca_system_score_gemma":0.00058334187,"threshold_uncertainty_score":0.016385317},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.81674355,0.000805029,0.1198345,0.0029247352,0.00015964729,0.000085449115,0.0001837585,0.00020163647,0.05906176],"genre_scores_gemma":[0.9815445,0.00019892932,0.012644694,0.00014061139,0.0001222027,0.00007072118,0.00009085769,0.000039760525,0.005147775],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993932,0.00017040536,0.000024071294,0.00011318679,0.0001873776,0.00011169031],"domain_scores_gemma":[0.998522,0.00076588127,0.00020336593,0.00013114448,0.00017974335,0.00019799657],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00079134863,0.00043452112,0.0009002927,0.0008453566,0.0013595433,0.0020957731,0.00079659215,0.001072053,0.006493254],"category_scores_gemma":[0.0040491926,0.00028455295,0.0005987895,0.00046939356,0.0036878616,0.0027593146,0.002030135,0.001516376,0.00032893123],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019287412,0.000014269017,0.00019127819,0.00002529935,0.000005830076,0.0001223165,0.0002350165,0.006102615,0.0009744718,0.99095106,0.00033106247,0.0010274363],"study_design_scores_gemma":[0.000025550156,0.00002226194,0.00013893784,0.000009881692,0.000004342593,0.00008273839,0.00013549704,0.042087004,0.0004930651,0.95584905,0.0011414709,0.000010161997],"about_ca_topic_score_codex":0.0010511385,"about_ca_topic_score_gemma":0.00069386925,"teacher_disagreement_score":0.006493254,"about_ca_system_score_codex":0.0013491727,"about_ca_system_score_gemma":0.00082179176,"threshold_uncertainty_score":0.021722078},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37963423,0.00650795,0.37846178,0.0062193624,0.00048649855,0.00012661185,0.00072303973,0.0020167546,0.22582382],"genre_scores_gemma":[0.8461958,0.0037157855,0.124330565,0.0010052474,0.00039792026,0.00017409798,0.0007728347,0.000430231,0.022977432],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999084,0.0002790759,0.000038928465,0.00021400655,0.00023512541,0.00014881181],"domain_scores_gemma":[0.99694353,0.0018794928,0.00015960274,0.0005279355,0.00018995386,0.00029955385],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00088327687,0.0005238149,0.00069944013,0.0013363245,0.0016984621,0.002150979,0.0011561695,0.0013795195,0.008777889],"category_scores_gemma":[0.0044252384,0.00083342846,0.00077708304,0.0016709523,0.0027953174,0.0047327895,0.003983057,0.003646082,0.0013992005],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000052144664,0.00002050957,0.0008874756,0.00013005725,0.000012780891,0.00040246136,0.00052417815,0.0046415245,0.0040945373,0.9734274,0.003402366,0.012404529],"study_design_scores_gemma":[0.000024646239,0.00006739415,0.00079128414,0.00007026486,0.000032652333,0.0009208859,0.000380615,0.019154562,0.0061430256,0.94247437,0.029895449,0.0000449898],"about_ca_topic_score_codex":0.00090257946,"about_ca_topic_score_gemma":0.0008497653,"teacher_disagreement_score":0.008777889,"about_ca_system_score_codex":0.0009802048,"about_ca_system_score_gemma":0.00033908643,"threshold_uncertainty_score":0.029364944},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20625326,0.0017280024,0.64276546,0.0039532348,0.00050111325,0.00008494687,0.00071264606,0.0004992224,0.14350209],"genre_scores_gemma":[0.8640367,0.0016291221,0.08759831,0.001090782,0.00055284594,0.00016554502,0.0008929705,0.00034756408,0.043686207],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987213,0.00034747238,0.000048397444,0.0002783697,0.00034645092,0.00025788412],"domain_scores_gemma":[0.99714977,0.0015959264,0.00025858023,0.0002389607,0.0004838578,0.00027300316],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010803301,0.0009193653,0.0005159333,0.002341667,0.0014245774,0.0022474045,0.0014060657,0.0011674073,0.011396458],"category_scores_gemma":[0.0044860505,0.0005132919,0.00097365037,0.00167039,0.0024257714,0.005014222,0.0026578875,0.0030535546,0.0012815729],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011906793,0.0000086469245,0.0003061235,0.000030047448,0.0000044990798,0.000042716703,0.00014562994,0.0034282228,0.00039599926,0.98791647,0.0014554614,0.006254348],"study_design_scores_gemma":[0.000007945437,0.000016014632,0.00041860074,0.00002278125,0.000005780765,0.00006824667,0.00019771102,0.027129067,0.00058672763,0.96335727,0.008176716,0.000013266217],"about_ca_topic_score_codex":0.004458853,"about_ca_topic_score_gemma":0.0029584458,"teacher_disagreement_score":0.011396458,"about_ca_system_score_codex":0.0027247067,"about_ca_system_score_gemma":0.0006389374,"threshold_uncertainty_score":0.03812498},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46661666,0.0016374008,0.4834154,0.0021088691,0.0001510698,0.00013500007,0.00042684592,0.00045954745,0.04504906],"genre_scores_gemma":[0.9537793,0.0005242,0.040568348,0.00024219822,0.00012714938,0.00011422102,0.0001980172,0.00009734611,0.0043493547],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976708,0.0009555044,0.00008236024,0.0004209128,0.0004996086,0.00037071286],"domain_scores_gemma":[0.9892074,0.006593171,0.0010968333,0.0012160629,0.0007222288,0.001164275],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026567753,0.0007209452,0.0008968026,0.0013984685,0.0013586566,0.0031811104,0.0015917349,0.0010201173,0.0056979535],"category_scores_gemma":[0.0089400755,0.0007373133,0.0005892271,0.0015063522,0.0044861776,0.0063409046,0.0033621392,0.0023106819,0.00045269588],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014150287,0.000038713923,0.00060401764,0.00008216829,0.000023753846,0.00012339652,0.00033957706,0.027983543,0.0015126817,0.95874846,0.0016694043,0.008732663],"study_design_scores_gemma":[0.000020654143,0.000029079716,0.00026876328,0.000027556578,0.000010076937,0.0000996471,0.0001752038,0.081329934,0.00085394306,0.9154823,0.00169078,0.000012194896],"about_ca_topic_score_codex":0.0011272534,"about_ca_topic_score_gemma":0.0013136612,"teacher_disagreement_score":0.0056979535,"about_ca_system_score_codex":0.002269065,"about_ca_system_score_gemma":0.00067510124,"threshold_uncertainty_score":0.019061565},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6950106,0.0024807751,0.21964322,0.0037916242,0.00023216534,0.000120610865,0.00076877297,0.00045066842,0.07750146],"genre_scores_gemma":[0.96224594,0.0005595181,0.029078554,0.00018888933,0.0001790341,0.00013011278,0.0005116833,0.00011035337,0.006995872],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99886453,0.00034309173,0.000049501723,0.00024152528,0.00030447854,0.00019680729],"domain_scores_gemma":[0.9941162,0.00420186,0.000474401,0.00035333115,0.00032075585,0.0005333821],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014968272,0.00051846675,0.0010022613,0.0025713218,0.0030857786,0.0031752083,0.0017647562,0.0017529924,0.008856526],"category_scores_gemma":[0.013262245,0.0006832096,0.0007123143,0.001412142,0.002612466,0.0040585683,0.003125869,0.0021982924,0.0005464728],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012646495,0.000040737803,0.001027371,0.00009173072,0.000028099987,0.000104356426,0.00030163722,0.014684869,0.0009280914,0.9699514,0.0036796469,0.009035578],"study_design_scores_gemma":[0.00002955156,0.000022721975,0.00046919668,0.00003403953,0.000015771659,0.00016303224,0.00017086577,0.059569843,0.0007982945,0.9354587,0.00325072,0.000017263395],"about_ca_topic_score_codex":0.0012441534,"about_ca_topic_score_gemma":0.0012846256,"teacher_disagreement_score":0.008856526,"about_ca_system_score_codex":0.0025704622,"about_ca_system_score_gemma":0.00052086223,"threshold_uncertainty_score":0.029628038},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.63069856,0.005690614,0.19594169,0.012025453,0.00042758865,0.0001581367,0.0005836518,0.0010932472,0.15338106],"genre_scores_gemma":[0.9550588,0.0009902667,0.03371658,0.0006720083,0.0002673062,0.00017083141,0.00024339248,0.00013866182,0.008742119],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99859947,0.00076453225,0.000045107983,0.00021315989,0.00017052205,0.00020730922],"domain_scores_gemma":[0.98552644,0.010907887,0.0010808863,0.00095708,0.00052442955,0.001003302],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035210352,0.0006176823,0.0010177575,0.0011971324,0.0022424734,0.0034054306,0.001646364,0.0015186425,0.006409731],"category_scores_gemma":[0.016594656,0.0006579245,0.0005813739,0.0009088594,0.0028794198,0.0070777284,0.0023039335,0.0024733641,0.0009092444],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00046132773,0.00011155962,0.0009684258,0.00021476892,0.000033352957,0.00011655123,0.00037346507,0.033487484,0.002575834,0.92725706,0.0146285845,0.019771667],"study_design_scores_gemma":[0.000066641376,0.00008455699,0.0009497659,0.00006165601,0.00002970883,0.00034951366,0.00017992107,0.17742704,0.0021611368,0.8097532,0.008888471,0.000048425656],"about_ca_topic_score_codex":0.0011979652,"about_ca_topic_score_gemma":0.0013483269,"teacher_disagreement_score":0.006409731,"about_ca_system_score_codex":0.0021596279,"about_ca_system_score_gemma":0.0010132868,"threshold_uncertainty_score":0.021442711},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8212736,0.0011009044,0.14064766,0.0042655426,0.00022462444,0.00015125553,0.0010962957,0.0018441745,0.02939598],"genre_scores_gemma":[0.9693955,0.00055703754,0.01656597,0.0011888029,0.00028690888,0.00026733693,0.0010842336,0.00054910453,0.010104954],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99680734,0.0011882444,0.000117507254,0.00062234595,0.0006900142,0.00057452515],"domain_scores_gemma":[0.9689586,0.01951434,0.0031449497,0.003496262,0.002030956,0.0028548054],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0041577974,0.0015844158,0.0029128275,0.0038970786,0.0022453621,0.004927331,0.0036896404,0.0040948954,0.009228887],"category_scores_gemma":[0.032066938,0.002001455,0.0021098314,0.0018333636,0.0053913468,0.007005563,0.0040601916,0.0044657784,0.0017037953],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011968137,0.00021014802,0.0048006317,0.0004027664,0.00018994455,0.0004885048,0.00097292557,0.031191511,0.0071256016,0.929848,0.010891014,0.01268215],"study_design_scores_gemma":[0.00014427492,0.00006663953,0.0016221058,0.000052420324,0.000064344495,0.000371717,0.0002516946,0.0919882,0.0014649251,0.902359,0.0015626128,0.00005191129],"about_ca_topic_score_codex":0.0012717316,"about_ca_topic_score_gemma":0.0018354608,"teacher_disagreement_score":0.009228887,"about_ca_system_score_codex":0.0026160432,"about_ca_system_score_gemma":0.0014936784,"threshold_uncertainty_score":0.030873716},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.099620335,0.0089671,0.5311542,0.007776873,0.00068536086,0.00017248663,0.002563489,0.0020249358,0.34703517],"genre_scores_gemma":[0.91550815,0.005787521,0.04079462,0.0012352046,0.0009904393,0.00036271632,0.0018951024,0.0011095087,0.032316756],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.996552,0.0009535558,0.00014365106,0.001020125,0.0010362455,0.0002944567],"domain_scores_gemma":[0.9792631,0.013256992,0.0013610036,0.0043703103,0.0012105317,0.00053800637],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025158192,0.0007617224,0.001169615,0.002399909,0.0010895348,0.004379718,0.0013141838,0.0015809602,0.015582024],"category_scores_gemma":[0.024070678,0.00055742613,0.0014411055,0.0014094757,0.0043993294,0.0066193137,0.0031420756,0.0031504433,0.002454057],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000070809634,0.000019467747,0.0005005981,0.00028561003,0.000050572457,0.000094351046,0.0001814065,0.018166054,0.0016421325,0.94131684,0.008189716,0.029482495],"study_design_scores_gemma":[0.0000060071893,0.000018656396,0.00040481996,0.00004392157,0.000014252081,0.00008450504,0.000036935653,0.015628202,0.00094173563,0.9746027,0.00820578,0.0000124906965],"about_ca_topic_score_codex":0.0009204654,"about_ca_topic_score_gemma":0.00046484428,"teacher_disagreement_score":0.015582024,"about_ca_system_score_codex":0.0022508746,"about_ca_system_score_gemma":0.00064332836,"threshold_uncertainty_score":0.052127063},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.76986253,0.0011980118,0.06311804,0.0039135357,0.00034083473,0.00012938058,0.0028006944,0.0007011987,0.15793578],"genre_scores_gemma":[0.9770597,0.00021390781,0.008488902,0.000306176,0.00010750146,0.00007522603,0.0008613352,0.00018100478,0.012706168],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993824,0.00008553583,0.000016256348,0.0002205181,0.00014753257,0.00014783228],"domain_scores_gemma":[0.9972355,0.0015444342,0.00027225912,0.0002782452,0.00024993526,0.0004197052],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057626015,0.00054009986,0.00037851176,0.0015096917,0.0010806981,0.001736154,0.0011523097,0.0007922745,0.018819235],"category_scores_gemma":[0.0041612103,0.00041176568,0.00037674847,0.0012191782,0.0015162894,0.0025172038,0.0011519799,0.001307832,0.0010511961],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007569319,0.00011007885,0.006247235,0.00038483893,0.00007835608,0.0002970772,0.00033466727,0.031459466,0.01809624,0.90222585,0.02026878,0.019740572],"study_design_scores_gemma":[0.00021318298,0.00012759151,0.009211996,0.00007903064,0.00007246044,0.000505956,0.00022207262,0.21600488,0.009205431,0.7492955,0.014977692,0.0000842833],"about_ca_topic_score_codex":0.003788973,"about_ca_topic_score_gemma":0.006749045,"teacher_disagreement_score":0.018819235,"about_ca_system_score_codex":0.0020640641,"about_ca_system_score_gemma":0.00080660684,"threshold_uncertainty_score":0.06295663},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25459442,0.0015361056,0.65230197,0.0022485417,0.00034558948,0.00015436471,0.0026133612,0.0014484314,0.08475712],"genre_scores_gemma":[0.78389394,0.0014819766,0.12688358,0.0007235683,0.0011416498,0.0003675282,0.0040887985,0.0012902567,0.08012877],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987249,0.00021974846,0.00009786102,0.00042661023,0.00034498927,0.00018590144],"domain_scores_gemma":[0.9924344,0.003054871,0.00088566454,0.0007879536,0.0017771802,0.0010599556],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001233862,0.00083624246,0.0010353151,0.0021604327,0.0011764073,0.004840365,0.001271223,0.00076580327,0.011540708],"category_scores_gemma":[0.009770862,0.0007736628,0.0015239032,0.0015312977,0.0022812074,0.0060778335,0.0021238665,0.0026204425,0.002807686],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010785717,0.00004066644,0.0006993929,0.00014110707,0.000017008519,0.000099989884,0.0004434247,0.0028014267,0.0028450028,0.9670894,0.0069582863,0.018756533],"study_design_scores_gemma":[0.000025165193,0.000056553206,0.0009679446,0.000042483138,0.000015408397,0.00042010203,0.00014040837,0.023814088,0.0026536838,0.95793325,0.0138975745,0.000033388893],"about_ca_topic_score_codex":0.0022866018,"about_ca_topic_score_gemma":0.0017856499,"teacher_disagreement_score":0.011540708,"about_ca_system_score_codex":0.0019578778,"about_ca_system_score_gemma":0.00084199785,"threshold_uncertainty_score":0.038607538},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32369518,0.007758456,0.410303,0.011743426,0.0005292715,0.00009141298,0.0011574561,0.00023746851,0.24448441],"genre_scores_gemma":[0.9398187,0.0028030532,0.036714595,0.0008877426,0.0004585213,0.00016961254,0.0006145664,0.00009070847,0.018442491],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99858826,0.0005020285,0.00007143818,0.0002462255,0.00038752082,0.00020452759],"domain_scores_gemma":[0.9915176,0.006231401,0.00071818905,0.00039458124,0.0006020499,0.0005361038],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015910865,0.0006857965,0.0012418145,0.003374062,0.0026510945,0.0040990436,0.0019676427,0.0016551473,0.011801019],"category_scores_gemma":[0.007756303,0.0006492977,0.0011655367,0.004153606,0.005225192,0.008400687,0.004363161,0.0049216887,0.00057541515],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000058777764,0.0000045241654,0.0000672581,0.000016046075,0.0000033180693,0.000013545128,0.000066801804,0.0005553505,0.00006271106,0.99784946,0.00037122483,0.0009839683],"study_design_scores_gemma":[0.0000038417597,0.000002139991,0.000058321777,0.000007092387,0.0000030301335,0.000018675013,0.000043229484,0.0023461755,0.00003818669,0.99678147,0.0006954233,0.0000024892988],"about_ca_topic_score_codex":0.0029531734,"about_ca_topic_score_gemma":0.002665145,"teacher_disagreement_score":0.011801019,"about_ca_system_score_codex":0.002594775,"about_ca_system_score_gemma":0.0008571653,"threshold_uncertainty_score":0.03947842},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49922326,0.00095360953,0.08482496,0.003965,0.00048156996,0.00010437362,0.006236503,0.0007733591,0.40343744],"genre_scores_gemma":[0.9361936,0.00065441435,0.012859323,0.00042954087,0.00031755364,0.00009733293,0.0020402207,0.0003964372,0.047011584],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993667,0.000110306915,0.00002870574,0.00018451345,0.00015041808,0.00015936968],"domain_scores_gemma":[0.9959323,0.0016181691,0.0005249022,0.00041435994,0.00079520734,0.0007150675],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00085653417,0.000558638,0.00042600353,0.002934759,0.0021110817,0.003974259,0.0009757715,0.0007390731,0.029102342],"category_scores_gemma":[0.004225672,0.00034376263,0.00041857577,0.0022127714,0.0021609387,0.0039347042,0.0015529956,0.0014362753,0.004128563],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016187488,0.0000319156,0.0015921113,0.00010486852,0.000020401183,0.000072308605,0.00031259505,0.0025322337,0.003388634,0.96898144,0.012714713,0.010086969],"study_design_scores_gemma":[0.00003825387,0.000040052488,0.0033269234,0.00006626047,0.00003991537,0.00022267761,0.00024966552,0.01613586,0.0045233853,0.953527,0.02179007,0.00003997983],"about_ca_topic_score_codex":0.003235863,"about_ca_topic_score_gemma":0.0047849696,"teacher_disagreement_score":0.029102342,"about_ca_system_score_codex":0.0022421787,"about_ca_system_score_gemma":0.0012278372,"threshold_uncertainty_score":0.097357094},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9562033,0.0015654936,0.015484384,0.0007003057,0.000043173,0.000014934455,0.00022307655,0.00013084325,0.025634456],"genre_scores_gemma":[0.99602026,0.00020405026,0.00227314,0.000042443993,0.000016621307,0.000008974555,0.000042749565,0.000008491438,0.0013832789],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997142,0.000059833237,0.000015237008,0.00006950163,0.00006299312,0.00007809406],"domain_scores_gemma":[0.9989748,0.00041909455,0.00019830563,0.000089814515,0.00009997179,0.00021810831],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054855744,0.00015238905,0.00032367802,0.0014283083,0.0007583173,0.0010110538,0.00047763844,0.00039302575,0.0040076617],"category_scores_gemma":[0.0018154192,0.00018935489,0.00019330088,0.0005815476,0.0009547599,0.0018148352,0.00069195754,0.0003878392,0.00019105947],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00040077235,0.00006055243,0.008615955,0.00017957817,0.000035394103,0.0002560175,0.00063784345,0.013112246,0.010192321,0.9394838,0.004271627,0.022753874],"study_design_scores_gemma":[0.000042325137,0.00009617639,0.0069538606,0.00007049525,0.000041791835,0.0006661292,0.0007076661,0.06848179,0.0063549373,0.906664,0.009876306,0.000044450582],"about_ca_topic_score_codex":0.0030046485,"about_ca_topic_score_gemma":0.0038760887,"teacher_disagreement_score":0.0040076617,"about_ca_system_score_codex":0.0009897258,"about_ca_system_score_gemma":0.0004337249,"threshold_uncertainty_score":0.013406992},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8845861,0.00087803317,0.08531202,0.0013146691,0.000057997848,0.00007919235,0.00039061674,0.0005546639,0.026826607],"genre_scores_gemma":[0.9837953,0.00039261387,0.012231712,0.00014243556,0.000063486244,0.00008555719,0.00020958425,0.00006885323,0.0030105046],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99907887,0.0002608392,0.000045600904,0.00021625712,0.00019482426,0.00020358882],"domain_scores_gemma":[0.99003476,0.0060187723,0.0013206083,0.0006917916,0.00052464276,0.0014094604],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012134671,0.00047450766,0.0006835001,0.0019734174,0.0015290296,0.0022841753,0.0011788135,0.0012551029,0.0054245144],"category_scores_gemma":[0.011636278,0.0009079215,0.0005698536,0.0014553588,0.0034413761,0.0045240982,0.0025684873,0.0014921267,0.00042195324],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020880598,0.00008520973,0.0049422584,0.00022220371,0.000026514846,0.00027180114,0.0006805256,0.020463487,0.004385638,0.95108676,0.004001006,0.013625785],"study_design_scores_gemma":[0.000046422854,0.00006531605,0.0023344138,0.000045066634,0.00002223439,0.00040382816,0.00020479033,0.07015478,0.0014571417,0.92287326,0.0023612855,0.00003137837],"about_ca_topic_score_codex":0.0012681271,"about_ca_topic_score_gemma":0.0018685147,"teacher_disagreement_score":0.0054245144,"about_ca_system_score_codex":0.0017097741,"about_ca_system_score_gemma":0.0006180639,"threshold_uncertainty_score":0.018146873},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.850165,0.0013116869,0.09991458,0.0007250534,0.000036836598,0.00003738359,0.00040011137,0.00027364102,0.04713572],"genre_scores_gemma":[0.984098,0.00042462803,0.011056002,0.000108276574,0.000070807655,0.00006900012,0.00032151304,0.00008241601,0.003769345],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991887,0.00022772014,0.000036250865,0.00020438571,0.00019871103,0.0001442636],"domain_scores_gemma":[0.99772674,0.001147953,0.00035032295,0.00017784328,0.00026964446,0.00032755057],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010326869,0.00030501053,0.0007374858,0.0019312882,0.0013699738,0.002663517,0.00077690533,0.00063213176,0.0032593466],"category_scores_gemma":[0.0047723996,0.00035859575,0.0005393388,0.0007514424,0.0035316213,0.004092722,0.0029284828,0.0013091505,0.00056673744],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012678724,0.00002166459,0.0008911537,0.000058662205,0.000010617487,0.00014659126,0.0007237739,0.0015532587,0.003434115,0.9885387,0.00037418865,0.0041204724],"study_design_scores_gemma":[0.00006420245,0.000071142065,0.0024311936,0.00006795153,0.000025705007,0.00046086824,0.0005113353,0.016059183,0.0035784966,0.9728097,0.0038827641,0.00003747833],"about_ca_topic_score_codex":0.0011398873,"about_ca_topic_score_gemma":0.00045624824,"teacher_disagreement_score":0.0032593466,"about_ca_system_score_codex":0.0010594128,"about_ca_system_score_gemma":0.00041903567,"threshold_uncertainty_score":0.0109036565},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7232598,0.0008647056,0.20823827,0.0039360845,0.0003069221,0.000130807,0.00084835966,0.0003501335,0.062064998],"genre_scores_gemma":[0.9856389,0.00027624867,0.0073994636,0.00014097511,0.00024908935,0.00013319982,0.0002495732,0.000045820678,0.005866644],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99682534,0.0012660067,0.00017874212,0.0005626476,0.0007035021,0.00046386127],"domain_scores_gemma":[0.9781626,0.014643675,0.002408667,0.002193133,0.0008811769,0.0017107475],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035869428,0.00041061145,0.00088709046,0.0023979878,0.0017244288,0.0032314095,0.0014203179,0.0015064325,0.009150594],"category_scores_gemma":[0.019079775,0.0006096866,0.0008354397,0.0011762186,0.0051256134,0.0066861627,0.0030806796,0.0020358728,0.00072050455],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009027505,0.000039295654,0.0014597734,0.00006231809,0.000023766403,0.00017329295,0.00032878324,0.0014040692,0.0006184554,0.9910616,0.0011490798,0.0035892343],"study_design_scores_gemma":[0.000036761405,0.000041470466,0.00092322583,0.000036195026,0.000025225801,0.00040078515,0.00021028088,0.01949404,0.0010500738,0.9758364,0.0019185463,0.00002703225],"about_ca_topic_score_codex":0.00055138365,"about_ca_topic_score_gemma":0.0004643064,"teacher_disagreement_score":0.009150594,"about_ca_system_score_codex":0.0009833064,"about_ca_system_score_gemma":0.0005814487,"threshold_uncertainty_score":0.030611813},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4685513,0.015473723,0.24088731,0.012350109,0.0011835939,0.000138189,0.0050005666,0.0007184541,0.25569677],"genre_scores_gemma":[0.9470117,0.0035669613,0.029615749,0.00053530064,0.0010479328,0.00024116343,0.0011875415,0.00015390819,0.01663973],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975337,0.0007185382,0.00020608435,0.0005647683,0.00067513523,0.00030183635],"domain_scores_gemma":[0.97706443,0.01721114,0.0017632231,0.0013263333,0.0010211016,0.0016138244],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031330243,0.0006986614,0.0012310012,0.004929906,0.0022457372,0.0058869286,0.002693726,0.0017604328,0.008372353],"category_scores_gemma":[0.024329213,0.0009755679,0.0008950027,0.0030130679,0.0057841004,0.014081186,0.002873741,0.0027355028,0.0012549972],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000094292714,0.000030447485,0.0013588469,0.00014312296,0.000034680048,0.000062770276,0.0002400734,0.0018806962,0.00069107313,0.98042107,0.0037855464,0.011257263],"study_design_scores_gemma":[0.000011054885,0.000010068986,0.00058514596,0.00003663276,0.00002206828,0.00027878903,0.00008018907,0.004006383,0.00048282,0.9908597,0.003615967,0.00001126613],"about_ca_topic_score_codex":0.0006350493,"about_ca_topic_score_gemma":0.0007210122,"teacher_disagreement_score":0.008372353,"about_ca_system_score_codex":0.001936022,"about_ca_system_score_gemma":0.00081512757,"threshold_uncertainty_score":0.028008342},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.50969046,0.0010195635,0.43406492,0.0023789357,0.00012486802,0.00010229045,0.0006928365,0.00066041196,0.051265713],"genre_scores_gemma":[0.96446645,0.00037992134,0.027576415,0.00039152484,0.00016454761,0.00014461656,0.00030993644,0.000109714834,0.0064569446],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99944407,0.0000953175,0.000026755879,0.00019302928,0.00016744273,0.00007334626],"domain_scores_gemma":[0.9971685,0.0014878672,0.00037106703,0.00023593666,0.0004615549,0.00027507712],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007993885,0.0003426459,0.00047559448,0.0015514755,0.0014626413,0.0016155143,0.0011088474,0.0009348624,0.0063682063],"category_scores_gemma":[0.0053511714,0.0002929544,0.00065729144,0.001190753,0.0018868346,0.0033384506,0.0018283068,0.0014812894,0.0010135936],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000089337555,0.000026974634,0.0012798334,0.00009931608,0.000029555347,0.00015952485,0.0005209384,0.008006377,0.0076516042,0.96409667,0.0027325668,0.015307186],"study_design_scores_gemma":[0.000012297409,0.000036898404,0.00074612745,0.000016530243,0.000010182202,0.00021161274,0.00009535378,0.042231742,0.0025569445,0.95100695,0.0030572282,0.000018151979],"about_ca_topic_score_codex":0.0008450642,"about_ca_topic_score_gemma":0.0004927647,"teacher_disagreement_score":0.0063682063,"about_ca_system_score_codex":0.001121585,"about_ca_system_score_gemma":0.00029760555,"threshold_uncertainty_score":0.021303833},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36913678,0.004732294,0.41856933,0.016436921,0.0005577172,0.00036498808,0.006278829,0.0045931134,0.17933004],"genre_scores_gemma":[0.8776024,0.002259875,0.0669535,0.0034536817,0.0007444772,0.0006547839,0.0047697118,0.0012034737,0.042358063],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9942344,0.0011083115,0.0002705306,0.0017736121,0.0011417028,0.0014714184],"domain_scores_gemma":[0.9662705,0.024539623,0.0014396006,0.0038596261,0.0016144449,0.0022760637],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002835172,0.001928932,0.0019363592,0.0020265114,0.0031214233,0.008744392,0.004860244,0.0028573421,0.025174657],"category_scores_gemma":[0.020940697,0.0015667045,0.0018710598,0.0030610121,0.0037527797,0.01642837,0.008833851,0.0050340304,0.0056836186],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016550326,0.0004325035,0.0069440543,0.0015195373,0.00022664359,0.00071331236,0.0020725906,0.054193333,0.010011421,0.81097555,0.034896154,0.07635986],"study_design_scores_gemma":[0.00017000327,0.000106480744,0.00085161,0.00011967397,0.0001183901,0.00034723623,0.0002271992,0.09757007,0.003379059,0.88801277,0.009034405,0.000063174026],"about_ca_topic_score_codex":0.0029323073,"about_ca_topic_score_gemma":0.0046990165,"teacher_disagreement_score":0.025174657,"about_ca_system_score_codex":0.0049858307,"about_ca_system_score_gemma":0.0020211893,"threshold_uncertainty_score":0.08421761},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.66046095,0.0016382443,0.25746822,0.0034143927,0.00018632093,0.00020197248,0.0012824563,0.0007037052,0.07464386],"genre_scores_gemma":[0.95667654,0.00079929066,0.03088609,0.00042436144,0.0002163685,0.00021271216,0.00075251726,0.00025487415,0.009777116],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99802667,0.0005424761,0.00004739172,0.00051517435,0.00050286273,0.00036539833],"domain_scores_gemma":[0.98640907,0.008954231,0.0013748053,0.0014373347,0.0007826251,0.0010419006],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014144778,0.0005998325,0.00078001694,0.0021951182,0.0021667052,0.003228468,0.001751222,0.001531183,0.0067475107],"category_scores_gemma":[0.013616186,0.000829518,0.00088212715,0.0020675843,0.005042267,0.004173331,0.0024469332,0.0019674273,0.000632898],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000093265844,0.00004010855,0.0012510223,0.000098718076,0.00002962178,0.00013205982,0.00046350932,0.026268208,0.002777903,0.95732707,0.0045649395,0.0069537107],"study_design_scores_gemma":[0.000048519625,0.000025013853,0.0011505001,0.000031644668,0.000018744196,0.00022380798,0.00011557821,0.09205245,0.0011257244,0.8992696,0.0059117153,0.000026645374],"about_ca_topic_score_codex":0.005359627,"about_ca_topic_score_gemma":0.004419033,"teacher_disagreement_score":0.0067475107,"about_ca_system_score_codex":0.004248577,"about_ca_system_score_gemma":0.0009737854,"threshold_uncertainty_score":0.030825734},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0263195,0.015518528,0.35489392,0.023981113,0.0023843867,0.0001243965,0.002615976,0.001142736,0.5730194],"genre_scores_gemma":[0.51224095,0.016278531,0.03723992,0.0044227904,0.0029520497,0.0003726356,0.003214221,0.0009825322,0.42229626],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994431,0.00023415443,0.000012207389,0.00011230225,0.00014451957,0.00005380146],"domain_scores_gemma":[0.9988317,0.00057477684,0.00009852741,0.00021139273,0.00015759793,0.00012602858],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000603659,0.0010388468,0.00091141457,0.00141651,0.00071886164,0.0022814537,0.001343813,0.0022097297,0.029112335],"category_scores_gemma":[0.00407596,0.00043940565,0.00059643254,0.0015299938,0.0015418504,0.003279426,0.0012965958,0.002429015,0.0065010223],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004360959,0.000011454957,0.00004985734,0.000026585509,0.000006886309,0.000020565605,0.000027764056,0.003113868,0.00007087548,0.9731665,0.017527673,0.0059735426],"study_design_scores_gemma":[0.0000035238781,0.0000025164431,0.000051166204,0.00001546351,0.0000039431557,0.000025893816,0.000014746508,0.010066863,0.000029893865,0.9729654,0.016816255,0.0000042817983],"about_ca_topic_score_codex":0.002084597,"about_ca_topic_score_gemma":0.0022324189,"teacher_disagreement_score":0.029112335,"about_ca_system_score_codex":0.0015139788,"about_ca_system_score_gemma":0.00070656184,"threshold_uncertainty_score":0.09739047},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8787428,0.00052631367,0.09047834,0.000787289,0.00005116142,0.000026690232,0.00021315755,0.00040723,0.02876715],"genre_scores_gemma":[0.98903006,0.00011982679,0.009066562,0.00008453959,0.00003926495,0.000018182134,0.00011398297,0.000047171892,0.0014804178],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99907887,0.000270325,0.000032836328,0.00023400504,0.0002447004,0.0001391222],"domain_scores_gemma":[0.99387854,0.004272138,0.00041807423,0.0004374241,0.00035799725,0.0006357871],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014273735,0.00039273137,0.0007563845,0.0012678046,0.0011444188,0.0015807863,0.0012054627,0.0004832487,0.0034334587],"category_scores_gemma":[0.005216415,0.00042085355,0.000666702,0.0004872458,0.003115577,0.0029366715,0.001921324,0.0019352518,0.00026703792],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018031686,0.00007534308,0.0021591177,0.00012540155,0.000021421723,0.0003343208,0.0006232817,0.0076182107,0.007119024,0.97339183,0.000808311,0.007543464],"study_design_scores_gemma":[0.000021026248,0.00004905796,0.0011148894,0.000025707708,0.000014869428,0.00022029823,0.00016473005,0.043347076,0.0048855618,0.94862133,0.0015181311,0.000017326392],"about_ca_topic_score_codex":0.0005160265,"about_ca_topic_score_gemma":0.0003974434,"teacher_disagreement_score":0.0034334587,"about_ca_system_score_codex":0.000962654,"about_ca_system_score_gemma":0.0003479102,"threshold_uncertainty_score":0.011486113},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.82752943,0.0003674663,0.15413941,0.0008523469,0.000045855926,0.000037851296,0.0003255248,0.00039665418,0.016305445],"genre_scores_gemma":[0.9775524,0.00013633055,0.01914451,0.00011300184,0.000059369675,0.00007988956,0.00037433614,0.000068371766,0.0024717404],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99905866,0.0002908692,0.000036045043,0.00018548642,0.00031453578,0.00011437386],"domain_scores_gemma":[0.99084,0.0059371577,0.0009593256,0.00093140104,0.0008525256,0.00047957472],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00097158906,0.00030504662,0.00059988565,0.0018330938,0.00061440986,0.0015859553,0.0012504518,0.0010222348,0.0029787803],"category_scores_gemma":[0.01687362,0.00041607898,0.00032391972,0.0010065117,0.0015365711,0.0029634626,0.0014173661,0.00086134457,0.00030260478],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004929296,0.00016102799,0.016040254,0.00037400873,0.000058275436,0.00045227748,0.00068733614,0.07704505,0.021948962,0.83622974,0.0061890916,0.04032112],"study_design_scores_gemma":[0.00003608871,0.000057292447,0.004240966,0.000046223708,0.000020057394,0.00061013,0.000121736346,0.41287285,0.0057704453,0.57378525,0.002415607,0.000023273218],"about_ca_topic_score_codex":0.00043323194,"about_ca_topic_score_gemma":0.00074681494,"teacher_disagreement_score":0.0029787803,"about_ca_system_score_codex":0.0010618101,"about_ca_system_score_gemma":0.0004105747,"threshold_uncertainty_score":0.009965003},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45835665,0.0015081648,0.4512109,0.0011069161,0.00020658635,0.0004156668,0.0013874228,0.0013195728,0.08448808],"genre_scores_gemma":[0.8996024,0.00036737334,0.082365856,0.0002424293,0.00017733987,0.00028299208,0.0007916613,0.00014728867,0.016022544],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99774075,0.00045987943,0.00015056426,0.0006746915,0.0006045266,0.0003695256],"domain_scores_gemma":[0.9894503,0.0055363397,0.0012776996,0.0018957118,0.001171085,0.0006688831],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018719041,0.00076264486,0.0011279806,0.0020421573,0.0018808282,0.0027306618,0.0015496403,0.001035146,0.014965632],"category_scores_gemma":[0.009057601,0.0006999302,0.00067373767,0.0013432257,0.0027087978,0.005171358,0.002975099,0.0017024641,0.0015290778],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003323342,0.000074335185,0.0014882152,0.00022445036,0.00005025637,0.00021639222,0.0004006224,0.033392858,0.011261039,0.9180818,0.00635039,0.028127344],"study_design_scores_gemma":[0.0000701558,0.00017381256,0.0010962634,0.00006610948,0.000044051096,0.000553487,0.00020606018,0.12049773,0.010937963,0.84856325,0.017739583,0.000051497413],"about_ca_topic_score_codex":0.0008524488,"about_ca_topic_score_gemma":0.0010361696,"teacher_disagreement_score":0.014965632,"about_ca_system_score_codex":0.001765383,"about_ca_system_score_gemma":0.000812674,"threshold_uncertainty_score":0.05006498},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7574119,0.0054752883,0.06685669,0.013569982,0.0003894502,0.00004463571,0.00062126265,0.00055333023,0.15507753],"genre_scores_gemma":[0.97953266,0.002313417,0.008196551,0.000831211,0.00031863133,0.00005505064,0.0004440085,0.00007506548,0.008233307],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.999435,0.00012652163,0.000024777954,0.00016057593,0.0001216446,0.00013148904],"domain_scores_gemma":[0.9967205,0.002024432,0.0002550621,0.0003324959,0.00032516522,0.00034227924],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014271404,0.00050518295,0.00091458624,0.0020841486,0.0019278381,0.0022228507,0.0011660618,0.0017351725,0.0056219343],"category_scores_gemma":[0.006604337,0.00034135557,0.0009217906,0.001988641,0.0039796154,0.00548694,0.0028628567,0.0026206132,0.00084712857],"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.00010462838,0.000024604322,0.0013027788,0.00009628748,0.000008849728,0.0001568477,0.00048119092,0.0053008804,0.00093106873,0.97826755,0.003650813,0.009674545],"study_design_scores_gemma":[0.000017553106,0.000011953204,0.0003975664,0.000035804645,0.0000058661567,0.00006501798,0.00022224223,0.007111989,0.00040853725,0.9885699,0.00313866,0.000014917045],"about_ca_topic_score_codex":0.0066522234,"about_ca_topic_score_gemma":0.0040093088,"teacher_disagreement_score":0.0066522234,"about_ca_system_score_codex":0.0017120276,"about_ca_system_score_gemma":0.0008809864,"threshold_uncertainty_score":0.018807292},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40793142,0.003157385,0.21881996,0.023323633,0.0011413496,0.0003201143,0.0035198543,0.0010376656,0.34074873],"genre_scores_gemma":[0.845956,0.002218734,0.0510551,0.0020166798,0.0007209143,0.00031036432,0.0022939425,0.00041379913,0.0950144],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990521,0.00029272563,0.000038518865,0.00030270778,0.0001603995,0.00015355632],"domain_scores_gemma":[0.9979557,0.0010737154,0.00017197174,0.0002783394,0.00018368711,0.00033652678],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012181393,0.0009138898,0.0015738695,0.0009861487,0.0022089856,0.003994805,0.0026316363,0.0024442947,0.023739189],"category_scores_gemma":[0.0056837937,0.0007361535,0.00092330284,0.0018527824,0.0018055893,0.010030418,0.0033559834,0.0039605843,0.0021947976],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022183893,0.00015952908,0.00031133284,0.00027215807,0.00007272247,0.00011755401,0.00031022084,0.0066977195,0.0010847962,0.94369984,0.025819115,0.021233203],"study_design_scores_gemma":[0.00005017629,0.000025164096,0.00017431982,0.00003292186,0.000037832928,0.00013628787,0.0001695884,0.019773277,0.0005753062,0.9692142,0.009795013,0.00001588527],"about_ca_topic_score_codex":0.001635697,"about_ca_topic_score_gemma":0.001644942,"teacher_disagreement_score":0.023739189,"about_ca_system_score_codex":0.0015556582,"about_ca_system_score_gemma":0.0012098933,"threshold_uncertainty_score":0.0794155},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.58533543,0.0018514426,0.15697135,0.00487885,0.00041436072,0.00010995812,0.000539807,0.00046151894,0.24943721],"genre_scores_gemma":[0.9375471,0.0008369508,0.016651453,0.00090638944,0.0002813549,0.00016130893,0.00025235093,0.00014645357,0.043216687],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993724,0.00014587393,0.000028096154,0.00016601468,0.00016429067,0.0001232879],"domain_scores_gemma":[0.99769586,0.001078776,0.000307139,0.00029921322,0.00023177106,0.00038725152],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006635933,0.0005461664,0.0008962111,0.0023276804,0.0027519972,0.0025170639,0.0014189808,0.0013374597,0.011294887],"category_scores_gemma":[0.003936213,0.00063961436,0.00076611346,0.0017609508,0.004252061,0.0049280375,0.0036999632,0.0028317461,0.00082681014],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014251875,0.000009659906,0.00011129904,0.000013404009,0.000003080333,0.00003588461,0.0000922492,0.0002974702,0.0002299544,0.996581,0.00059258414,0.0020191881],"study_design_scores_gemma":[0.0000063704215,0.0000032743121,0.000075904405,0.0000037271486,0.0000029930663,0.000039708695,0.000035850975,0.00084797567,0.00011918729,0.9979265,0.0009345794,0.0000038810217],"about_ca_topic_score_codex":0.0011940064,"about_ca_topic_score_gemma":0.0015684172,"teacher_disagreement_score":0.011294887,"about_ca_system_score_codex":0.0013011687,"about_ca_system_score_gemma":0.0007961608,"threshold_uncertainty_score":0.037785232},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4781557,0.018593524,0.2363777,0.014844283,0.000968448,0.000052224295,0.0010201026,0.0007769978,0.24921097],"genre_scores_gemma":[0.9521329,0.0043818597,0.02252657,0.0018178488,0.0006065393,0.00005787586,0.0003959224,0.0001259414,0.017954525],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991103,0.00031897088,0.00003793779,0.00023638415,0.00018426795,0.00011215292],"domain_scores_gemma":[0.9975446,0.0013912731,0.00021530013,0.00030608548,0.0003155831,0.00022709019],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013850307,0.00051044597,0.0008116551,0.0010584223,0.0015226695,0.002227478,0.0009987621,0.0011296511,0.006485107],"category_scores_gemma":[0.005298574,0.00040586482,0.00061833084,0.001338235,0.0030938261,0.007995298,0.0025404936,0.0025155987,0.0012027817],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000050717823,0.000013422785,0.00019040918,0.000079400925,0.00001059683,0.00006620891,0.00017759684,0.0011565152,0.0006729091,0.9911668,0.0026180642,0.0037973672],"study_design_scores_gemma":[0.000016258236,0.000013684725,0.000259923,0.000022535438,0.000012241106,0.0001350236,0.00011395551,0.0031938471,0.00043641057,0.9892757,0.006506698,0.000013704002],"about_ca_topic_score_codex":0.001347026,"about_ca_topic_score_gemma":0.00084705226,"teacher_disagreement_score":0.006485107,"about_ca_system_score_codex":0.0012600146,"about_ca_system_score_gemma":0.00039953348,"threshold_uncertainty_score":0.021694839},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29139847,0.00608996,0.46765745,0.016402116,0.0021885314,0.000121266625,0.00061094586,0.00038681354,0.2151444],"genre_scores_gemma":[0.927251,0.003426414,0.040772483,0.001852127,0.0017551197,0.00010224974,0.00029471453,0.000119631695,0.024426252],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979614,0.00052865496,0.0001197719,0.0004907529,0.00069017836,0.00020931165],"domain_scores_gemma":[0.99538213,0.0027001838,0.00050496083,0.000449767,0.0005519391,0.0004109549],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018617531,0.0005312853,0.0010295375,0.0020739548,0.0015966372,0.0023971607,0.0016057687,0.0018970736,0.008516826],"category_scores_gemma":[0.009131322,0.0003708719,0.0007218592,0.0016077153,0.003917381,0.01501156,0.0050163087,0.004345224,0.0009279953],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002434655,0.000014516404,0.00014736099,0.000055297216,0.000005307715,0.000084185296,0.000095641655,0.001086334,0.00030099796,0.99196905,0.0010198698,0.0051970375],"study_design_scores_gemma":[0.000013242965,0.000015774478,0.00010024645,0.000016730639,0.000003842938,0.0002058531,0.00006712383,0.002723712,0.00032386594,0.99231285,0.0042054,0.000011396667],"about_ca_topic_score_codex":0.0005234929,"about_ca_topic_score_gemma":0.00026344848,"teacher_disagreement_score":0.008516826,"about_ca_system_score_codex":0.0017176961,"about_ca_system_score_gemma":0.00071689236,"threshold_uncertainty_score":0.028491616},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7163265,0.00082397286,0.1532282,0.0019231843,0.0005087422,0.00008097912,0.00022915404,0.00052398036,0.12635538],"genre_scores_gemma":[0.942395,0.00051629794,0.032038912,0.00039866666,0.00016361325,0.000087835986,0.0001904674,0.00021947997,0.023989832],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992212,0.00022277878,0.00004448239,0.00013781899,0.00020621398,0.00016753314],"domain_scores_gemma":[0.99687636,0.0014993397,0.00039501925,0.00026395035,0.00036435938,0.00060098636],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009951271,0.00050145667,0.00083734083,0.0021153642,0.0024640511,0.0037068108,0.0021833458,0.0017380278,0.007896667],"category_scores_gemma":[0.0043715998,0.000728747,0.000862201,0.0015663302,0.0038263116,0.0047420594,0.0029986938,0.0024528005,0.0010279607],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029779098,0.00002139345,0.00025238423,0.000021244707,0.000004305677,0.00008922477,0.00027725886,0.00085942086,0.00076513196,0.99444276,0.00061164686,0.0026254887],"study_design_scores_gemma":[0.000015393136,0.00000747006,0.00013329281,0.000012040731,0.0000062828185,0.00008310427,0.00013481168,0.0045880773,0.00036280233,0.99360985,0.0010393951,0.0000073449464],"about_ca_topic_score_codex":0.0026429421,"about_ca_topic_score_gemma":0.0033349523,"teacher_disagreement_score":0.007896667,"about_ca_system_score_codex":0.0013547364,"about_ca_system_score_gemma":0.0007552764,"threshold_uncertainty_score":0.026416957},"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":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49706098,0.005621649,0.402453,0.0057196906,0.00087880326,0.00026816022,0.0019043564,0.0054242564,0.08066908],"genre_scores_gemma":[0.85593903,0.0016487234,0.12050763,0.0014376,0.00042405337,0.00022196898,0.0012284523,0.0013726417,0.017220002],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99419,0.00080723834,0.00037995115,0.0019057267,0.0014152301,0.0013019287],"domain_scores_gemma":[0.97687316,0.014653186,0.001456262,0.0048565706,0.001379111,0.00078167574],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032382295,0.0012863519,0.0024428382,0.0013732794,0.0025136482,0.006109083,0.0027019433,0.0022505932,0.017536253],"category_scores_gemma":[0.029970586,0.0011022015,0.0017870766,0.003139093,0.0032808462,0.01908496,0.003847369,0.0035446181,0.004136721],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0036807212,0.00061338383,0.0058249934,0.0018600227,0.00034010422,0.00038158253,0.00092005735,0.10601372,0.022078667,0.59051853,0.03871734,0.22905089],"study_design_scores_gemma":[0.00021895212,0.00047979498,0.0007386598,0.00016687783,0.00019544203,0.0008181273,0.00038127505,0.13916858,0.017831786,0.82316875,0.016729787,0.000102042475],"about_ca_topic_score_codex":0.0012654715,"about_ca_topic_score_gemma":0.0016163167,"teacher_disagreement_score":0.017536253,"about_ca_system_score_codex":0.004061437,"about_ca_system_score_gemma":0.0035585589,"threshold_uncertainty_score":0.05866462},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0023137734,0.03367699,0.023429314,0.009076638,0.012435409,0.000024423593,0.00062484393,0.00034262874,0.918076],"genre_scores_gemma":[0.044607803,0.017708644,0.011272456,0.0011906102,0.010677163,0.00004436203,0.00047517524,0.00058233785,0.91344136],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99949825,0.00009951324,0.000018717286,0.000062098494,0.0002770142,0.000044448956],"domain_scores_gemma":[0.9996332,0.000093869756,0.00002206558,0.00007205891,0.00011926015,0.000059489183],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007826355,0.0011861919,0.0007762593,0.003246667,0.0014810581,0.003091718,0.0010626379,0.00091423735,0.056761466],"category_scores_gemma":[0.0017018961,0.00044040405,0.0005654317,0.0036187905,0.0019425312,0.0026272573,0.0011596223,0.0031715366,0.011259802],"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.00000808739,0.000012454549,0.000050765368,0.00006413447,0.000006889793,0.000019963294,0.00009827984,0.000382375,0.00021163413,0.7779501,0.17834306,0.042852376],"study_design_scores_gemma":[0.000006037675,0.000010979165,0.00052368484,0.00006689713,0.000008020328,0.00008583047,0.000054551492,0.0015770765,0.00034156145,0.33237064,0.66493696,0.000017750792],"about_ca_topic_score_codex":0.011736213,"about_ca_topic_score_gemma":0.017030576,"teacher_disagreement_score":0.056761466,"about_ca_system_score_codex":0.0045993486,"about_ca_system_score_gemma":0.001451218,"threshold_uncertainty_score":0.18988603},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.540695,0.00021100591,0.42565858,0.00022795671,0.00008766491,0.00015681915,0.00017373003,0.00033277192,0.032456405],"genre_scores_gemma":[0.9192324,0.00008423893,0.07158641,0.00007288708,0.000017003309,0.00009862891,0.00021183543,0.00008369593,0.008612824],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99966323,0.00009180862,0.000012952877,0.000058480295,0.00012425806,0.000049259485],"domain_scores_gemma":[0.9992162,0.00031060207,0.00008757851,0.00018042838,0.00012836418,0.000076844946],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043754812,0.00018488537,0.0002475605,0.00065473345,0.0004796823,0.0004950556,0.000543299,0.00045168592,0.0051576067],"category_scores_gemma":[0.0017905077,0.000315748,0.00038134845,0.0003310898,0.0008046512,0.0007752743,0.0015672147,0.0004871285,0.00053744105],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012676379,0.00009787337,0.0021948852,0.00018791051,0.000027948814,0.00047516453,0.0007197471,0.02034229,0.040549975,0.8909265,0.002972815,0.041378163],"study_design_scores_gemma":[0.0001088124,0.00024237258,0.0025366407,0.00011532384,0.000042041913,0.0011111362,0.0005985068,0.17242302,0.044393536,0.7518092,0.026569566,0.00004983976],"about_ca_topic_score_codex":0.00019993643,"about_ca_topic_score_gemma":0.00040468358,"teacher_disagreement_score":0.0051576067,"about_ca_system_score_codex":0.0002770157,"about_ca_system_score_gemma":0.00017062547,"threshold_uncertainty_score":0.017253935},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3272538,0.0051929173,0.09854771,0.020605199,0.0011705774,0.00007459396,0.0010425857,0.0008495223,0.54526305],"genre_scores_gemma":[0.9410462,0.0014395532,0.014333538,0.001957823,0.00044043732,0.00008155018,0.00044098936,0.00016459612,0.040095307],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993587,0.00016327908,0.000022021266,0.00015578506,0.00013550404,0.00016471453],"domain_scores_gemma":[0.9972,0.0014992236,0.0002157177,0.0003880897,0.00031497926,0.0003818704],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009343895,0.0004619199,0.0007514635,0.0014193375,0.0025264265,0.003425141,0.0012511243,0.002250623,0.013622701],"category_scores_gemma":[0.0072170473,0.0004914578,0.0005658601,0.0015703944,0.0038078881,0.009093485,0.0026492078,0.0026288393,0.0020731222],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024572264,0.000009062003,0.00020381197,0.00002264679,0.0000032414189,0.000052611445,0.00012318115,0.00042727464,0.00014153623,0.9908434,0.004581291,0.0035673385],"study_design_scores_gemma":[0.000005008473,0.0000023698049,0.000076554985,0.000010587963,0.0000028179031,0.00003098427,0.00006369151,0.0007471327,0.00009413479,0.99565566,0.0033076233,0.0000034851255],"about_ca_topic_score_codex":0.004165259,"about_ca_topic_score_gemma":0.004242087,"teacher_disagreement_score":0.013622701,"about_ca_system_score_codex":0.0015669223,"about_ca_system_score_gemma":0.0010257253,"threshold_uncertainty_score":0.04557246},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47376648,0.0013408295,0.095607385,0.003997454,0.0005521494,0.00009408644,0.0014523917,0.0008959953,0.42229325],"genre_scores_gemma":[0.8904808,0.0007928733,0.027942516,0.00082936254,0.00028130139,0.00014116718,0.0011845999,0.0004381373,0.07790921],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99908483,0.0001438885,0.000048646798,0.0002292944,0.00018173673,0.00031163107],"domain_scores_gemma":[0.9989197,0.00044130208,0.000137876,0.00019947653,0.00015263083,0.00014896721],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004989875,0.0008466799,0.00093945686,0.002193305,0.0035245589,0.004288442,0.0015448196,0.001538845,0.023139847],"category_scores_gemma":[0.0023109217,0.0006817332,0.0010292458,0.0018776022,0.0030466556,0.005733711,0.0032725781,0.002452448,0.0025690077],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006474726,0.000021580188,0.00022295509,0.00004473925,0.000009508772,0.0000844988,0.00013578647,0.0010318535,0.0010054166,0.98684233,0.00309976,0.0074367994],"study_design_scores_gemma":[0.000012288775,0.000008343995,0.00032866292,0.00002340435,0.00001973842,0.0001681466,0.000121436555,0.0036668654,0.0013346199,0.98167586,0.012626598,0.00001407309],"about_ca_topic_score_codex":0.001698382,"about_ca_topic_score_gemma":0.0017714797,"teacher_disagreement_score":0.023139847,"about_ca_system_score_codex":0.002092928,"about_ca_system_score_gemma":0.0006259731,"threshold_uncertainty_score":0.07741046},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.73401767,0.0018960236,0.20306906,0.00305624,0.00029953555,0.00010267951,0.0008806535,0.00035747254,0.056320634],"genre_scores_gemma":[0.95483226,0.0006926484,0.028367117,0.00042440096,0.0003695765,0.0001911055,0.00067609816,0.00017350874,0.014273339],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985916,0.00038060997,0.00007524476,0.0004014761,0.00034435635,0.00020672755],"domain_scores_gemma":[0.9881688,0.007747723,0.0012739132,0.00085201184,0.0007807904,0.0011768611],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019552053,0.00091142184,0.0014522272,0.0031867356,0.0028822387,0.0052064676,0.0026087663,0.0021453714,0.006022762],"category_scores_gemma":[0.01516718,0.0014483857,0.0008887381,0.0027990167,0.0032254844,0.007718595,0.0027767322,0.002870222,0.0006535025],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000085239,0.00004526793,0.000791369,0.000086797845,0.000018956738,0.000098892175,0.00028756727,0.0031142074,0.0010539916,0.98762506,0.0017718422,0.005020871],"study_design_scores_gemma":[0.00002532431,0.000008747676,0.00030840296,0.00002042066,0.000019714016,0.000104472005,0.000084599,0.013709909,0.00036981856,0.9841644,0.0011760843,0.000008176981],"about_ca_topic_score_codex":0.0009812532,"about_ca_topic_score_gemma":0.0013595024,"teacher_disagreement_score":0.006022762,"about_ca_system_score_codex":0.0014698334,"about_ca_system_score_gemma":0.00078112894,"threshold_uncertainty_score":0.020148098},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010257501,0.0013325942,0.9635425,0.0015975812,0.00031951332,0.000016883292,0.000104263876,0.0003322446,0.031728525],"genre_scores_gemma":[0.29279742,0.004953648,0.5809031,0.0025170173,0.0027222093,0.00048902805,0.0004191212,0.0017614834,0.113437034],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99666035,0.0021090985,0.00010495043,0.0004317698,0.00057993224,0.0001139864],"domain_scores_gemma":[0.9935329,0.004849969,0.00018371402,0.0009752563,0.0003567324,0.00010142904],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00433324,0.0012872762,0.0014973226,0.00191526,0.0012544725,0.0037545112,0.002060406,0.0017674607,0.016930025],"category_scores_gemma":[0.016258132,0.0011297615,0.0015241941,0.0022129188,0.006999101,0.008680096,0.0023347416,0.0047962344,0.0039753914],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000045817956,0.0000029752277,0.000024941897,0.000016938448,0.0000055284086,0.000005196709,0.00002923736,0.00076291093,0.00003224051,0.9888355,0.0018010485,0.008478963],"study_design_scores_gemma":[0.0000027405763,0.0000021064934,0.000018412447,0.000008683615,0.0000038940416,0.000014202103,0.000004927137,0.007260531,0.000085702675,0.9867988,0.005794903,0.0000050061176],"about_ca_topic_score_codex":0.0012591856,"about_ca_topic_score_gemma":0.000901564,"teacher_disagreement_score":0.016930025,"about_ca_system_score_codex":0.00206624,"about_ca_system_score_gemma":0.0015015304,"threshold_uncertainty_score":0.056636512},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34120163,0.007230459,0.44566563,0.0143708,0.001066566,0.0002949297,0.0015602852,0.0012034066,0.18740629],"genre_scores_gemma":[0.89779454,0.0044974503,0.052141152,0.00224991,0.0010460673,0.000494055,0.0007776416,0.00033971737,0.040659357],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9963744,0.0010938976,0.0002949109,0.0009066646,0.0007809109,0.0005491542],"domain_scores_gemma":[0.99013746,0.0059145796,0.0012102891,0.001125516,0.0006721007,0.0009400936],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003746851,0.0017224475,0.0036285107,0.0058620144,0.004512645,0.006298399,0.0036863254,0.004400443,0.011429374],"category_scores_gemma":[0.022343878,0.00158789,0.0023836973,0.0044607227,0.00637463,0.018374937,0.0088169705,0.0063305893,0.0025151933],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000054470984,0.00002364166,0.00017016527,0.00008516336,0.000019241588,0.00004765369,0.00020238753,0.0016996367,0.00026851348,0.9910227,0.0016140935,0.0047923885],"study_design_scores_gemma":[0.000018097617,0.0000092983155,0.00006685593,0.000021771448,0.00002178196,0.00007330975,0.000049314625,0.0045442637,0.00013517073,0.9930282,0.002016276,0.000015538475],"about_ca_topic_score_codex":0.0013264682,"about_ca_topic_score_gemma":0.001057505,"teacher_disagreement_score":0.011429374,"about_ca_system_score_codex":0.003583497,"about_ca_system_score_gemma":0.0018669296,"threshold_uncertainty_score":0.03823507},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24776708,0.035635553,0.25120452,0.033301827,0.002652489,0.0001631882,0.0017197747,0.0013369257,0.4262187],"genre_scores_gemma":[0.9180169,0.01184417,0.02193261,0.0018919547,0.0028379445,0.00037870972,0.00071869977,0.00061499095,0.041764162],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981937,0.00044378097,0.00006565957,0.00036539047,0.0005349172,0.00039653908],"domain_scores_gemma":[0.9871241,0.009182099,0.0005634719,0.00093332934,0.0011243697,0.0010727014],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0051748673,0.0022255173,0.0022551753,0.006682857,0.0027170442,0.0059998464,0.003922324,0.0025951737,0.016477916],"category_scores_gemma":[0.02672007,0.0009084338,0.00116289,0.004533232,0.006639512,0.0162869,0.0059756376,0.009635626,0.003142564],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008313116,0.0000416591,0.00038321657,0.00011460771,0.000016561176,0.00005114422,0.00019847076,0.0024463453,0.0004909117,0.98550934,0.0037391428,0.0069254907],"study_design_scores_gemma":[0.000016527929,0.000010171148,0.00030471018,0.00005994797,0.000022701988,0.00006184079,0.000049226153,0.013105336,0.00040466155,0.98243034,0.003513257,0.000021275882],"about_ca_topic_score_codex":0.0019152318,"about_ca_topic_score_gemma":0.001487494,"teacher_disagreement_score":0.016477916,"about_ca_system_score_codex":0.006159057,"about_ca_system_score_gemma":0.0018098793,"threshold_uncertainty_score":0.055124104},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8938794,0.00087584014,0.08211346,0.00035006466,0.000042010663,0.000023541497,0.0001974699,0.00018522014,0.022332931],"genre_scores_gemma":[0.96737033,0.00057614356,0.015223369,0.00005998518,0.00004910886,0.000042935957,0.00027375107,0.00008775842,0.016316598],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994917,0.00007763882,0.000026646992,0.00015295815,0.0001675571,0.000083462706],"domain_scores_gemma":[0.9979734,0.000895849,0.00036696123,0.00011888536,0.00029285662,0.00035194785],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006319312,0.0005699291,0.00044006566,0.0034730628,0.0012514986,0.001966373,0.00060230965,0.0005183586,0.00658191],"category_scores_gemma":[0.001905917,0.00039434002,0.00045985568,0.0011288045,0.0024907936,0.002048208,0.0012364468,0.0010847078,0.00040309652],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030702585,0.000060488233,0.0091874795,0.00017185493,0.000048825776,0.0007592668,0.0013703371,0.01632305,0.030638753,0.92071855,0.0011093868,0.019304903],"study_design_scores_gemma":[0.00007094019,0.00044472626,0.024307085,0.00015946524,0.000079280755,0.0031705336,0.0027810214,0.101046234,0.048917755,0.7867776,0.03208716,0.00015820481],"about_ca_topic_score_codex":0.004169179,"about_ca_topic_score_gemma":0.003036309,"teacher_disagreement_score":0.00658191,"about_ca_system_score_codex":0.0020816124,"about_ca_system_score_gemma":0.00035763675,"threshold_uncertainty_score":0.022018671},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.52671367,0.0043023475,0.37181294,0.0059963656,0.00026176253,0.00013811738,0.0008689652,0.0008299603,0.08907599],"genre_scores_gemma":[0.93475914,0.0011144659,0.053549755,0.000652735,0.0003980158,0.0002614967,0.00059427635,0.00018048735,0.008489676],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988411,0.00036029003,0.00003839961,0.00026792462,0.00025843602,0.00023397389],"domain_scores_gemma":[0.99286807,0.0048419167,0.00063806085,0.0005748912,0.00042567987,0.00065130915],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001212138,0.00097616523,0.0009405114,0.0022156844,0.0020686807,0.002654964,0.0032102603,0.0019023321,0.0065813926],"category_scores_gemma":[0.008786972,0.0008303563,0.0007533456,0.0017362376,0.003474582,0.006117015,0.0028055615,0.0038340348,0.0006405495],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027706858,0.000113635004,0.0026625055,0.00022938751,0.000047651625,0.00015476497,0.00043266977,0.052933846,0.0037697873,0.9108166,0.009345997,0.019216118],"study_design_scores_gemma":[0.00004040179,0.00007159226,0.0018157274,0.00005249774,0.000041946594,0.00030628615,0.00017286025,0.26341602,0.0038651035,0.72337055,0.0067926827,0.00005439398],"about_ca_topic_score_codex":0.0020845593,"about_ca_topic_score_gemma":0.0022482066,"teacher_disagreement_score":0.0065813926,"about_ca_system_score_codex":0.0025365609,"about_ca_system_score_gemma":0.0006203502,"threshold_uncertainty_score":0.022016943},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4932746,0.0012579154,0.36148983,0.0024358293,0.0004034768,0.00050248374,0.0011937779,0.0013711227,0.13807094],"genre_scores_gemma":[0.87709135,0.00059909275,0.102987245,0.00070771464,0.0001689253,0.00029820116,0.00096509984,0.00019847834,0.016983818],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99970907,0.000037196067,0.000010313313,0.00009281274,0.000081257,0.000069223446],"domain_scores_gemma":[0.9990927,0.00016768902,0.0001306098,0.0001578267,0.00011269248,0.00033850185],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036010463,0.000518984,0.00045892163,0.0016102806,0.0017395521,0.001190272,0.0009236861,0.0006903602,0.0042095114],"category_scores_gemma":[0.0012024392,0.00044090647,0.0006442435,0.00086407457,0.0016018952,0.0012065931,0.0019594876,0.0022524602,0.0008206485],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000078805424,0.00007771348,0.001649539,0.00007686546,0.000013283168,0.00057615794,0.00073033816,0.0021723378,0.01461387,0.9523073,0.0050222897,0.022681586],"study_design_scores_gemma":[0.00014402607,0.00013261271,0.0038654066,0.0000770952,0.000045334167,0.0021132773,0.0005269657,0.024844447,0.007219096,0.88177013,0.07919802,0.000063626445],"about_ca_topic_score_codex":0.0016647498,"about_ca_topic_score_gemma":0.0016827015,"teacher_disagreement_score":0.0042095114,"about_ca_system_score_codex":0.0011866671,"about_ca_system_score_gemma":0.0004702328,"threshold_uncertainty_score":0.014082253},"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":"software","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010685481,0.00042420364,0.120176286,0.0022140238,0.0018458208,0.00044589656,0.110219315,0.5363069,0.22729902],"genre_scores_gemma":[0.015321164,0.0009586596,0.077100836,0.002095706,0.0005718072,0.0011268001,0.2000545,0.43253535,0.27023527],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975834,0.0003164848,0.00021212171,0.00042442573,0.0010150904,0.00044839302],"domain_scores_gemma":[0.9941947,0.0018126239,0.00022930467,0.0014208221,0.0019023039,0.0004402282],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0018640644,0.0034916156,0.0018509455,0.0030180595,0.0017484997,0.006131917,0.0052978247,0.0034013952,0.6732566],"category_scores_gemma":[0.013790714,0.0025494448,0.002815103,0.0033275052,0.0016237962,0.0072935577,0.0062110443,0.0053812796,0.61323446],"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.00013863038,0.0000599162,0.00034107934,0.00047358355,0.000024812878,0.00009539091,0.00012185905,0.00039606463,0.00091528264,0.011637146,0.95188105,0.033915244],"study_design_scores_gemma":[0.00011844077,0.000027513246,0.0006257565,0.00023663465,0.000015488813,0.00022381886,0.00007838541,0.0028028903,0.0041389554,0.013870398,0.97778213,0.00007959499],"about_ca_topic_score_codex":0.009748774,"about_ca_topic_score_gemma":0.009130455,"teacher_disagreement_score":0.6732566,"about_ca_system_score_codex":0.002786246,"about_ca_system_score_gemma":0.004183714,"threshold_uncertainty_score":0.4660598},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.91703,0.0006719314,0.04432269,0.001206414,0.00015836197,0.000029921686,0.00018376707,0.00014229835,0.036254495],"genre_scores_gemma":[0.9870083,0.00029020713,0.0047418717,0.00013770298,0.00012838376,0.00003474515,0.00012982046,0.000047662863,0.0074813394],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998705,0.00035350476,0.000076082586,0.00032217806,0.0002935771,0.00024965394],"domain_scores_gemma":[0.99471587,0.002670295,0.00086061825,0.0004121696,0.00038591263,0.0009551679],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013201112,0.0005713565,0.0009236592,0.0022095523,0.0024532452,0.0056903246,0.0019609923,0.0016218795,0.006114601],"category_scores_gemma":[0.007802101,0.0006685599,0.0006757878,0.0016959751,0.0041108546,0.005372031,0.0027026846,0.0024313962,0.0004050991],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009916445,0.00003171627,0.0009920925,0.000034677298,0.000010248986,0.00011849092,0.00032200819,0.001964495,0.0011096217,0.9910841,0.00057956803,0.0036539426],"study_design_scores_gemma":[0.00003196805,0.00001543829,0.0003687151,0.000009970902,0.000011995979,0.00013092971,0.0000922445,0.006364825,0.00044578014,0.99147004,0.0010449867,0.0000130628305],"about_ca_topic_score_codex":0.0012619572,"about_ca_topic_score_gemma":0.001270922,"teacher_disagreement_score":0.006114601,"about_ca_system_score_codex":0.0019408873,"about_ca_system_score_gemma":0.0006630332,"threshold_uncertainty_score":0.02045536},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35557246,0.010683328,0.4154772,0.016016467,0.0009086663,0.00016041183,0.0022151575,0.0012405292,0.19772582],"genre_scores_gemma":[0.9381297,0.0041795606,0.033419278,0.001111333,0.0012243201,0.00027947716,0.0013411551,0.0005238788,0.01979124],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982147,0.00046146804,0.00006089917,0.00043164135,0.0004802203,0.0003509867],"domain_scores_gemma":[0.9803771,0.013823157,0.0010152728,0.0013882006,0.0010439984,0.0023523571],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031143895,0.0021137653,0.0017349834,0.0060972613,0.0021114082,0.0060070883,0.0049362867,0.00208217,0.016133016],"category_scores_gemma":[0.016991155,0.00082334573,0.0014209138,0.0033245129,0.007190935,0.010205865,0.0057809097,0.007906554,0.0013852589],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000138399,0.00005905165,0.0009796674,0.00016724273,0.00003420794,0.00004486376,0.00023585837,0.0121385995,0.0018327521,0.9735416,0.0032950458,0.007532676],"study_design_scores_gemma":[0.000022019716,0.000037603473,0.00094317965,0.00008066484,0.000032899767,0.000067198205,0.000091378744,0.04635586,0.00094687205,0.94787186,0.0035132652,0.00003710758],"about_ca_topic_score_codex":0.0020576448,"about_ca_topic_score_gemma":0.0025774033,"teacher_disagreement_score":0.016133016,"about_ca_system_score_codex":0.0056014988,"about_ca_system_score_gemma":0.0014123713,"threshold_uncertainty_score":0.053970277},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7776269,0.0017497445,0.104008734,0.0034261404,0.00017624279,0.000073404495,0.00077289564,0.0006471302,0.111518875],"genre_scores_gemma":[0.9719614,0.000733352,0.012203071,0.000331545,0.00016500207,0.00011515552,0.0004606994,0.00012181804,0.013907991],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99860543,0.0005424576,0.000056118643,0.00027660734,0.0002965247,0.00022296615],"domain_scores_gemma":[0.9950899,0.0026796542,0.00046988463,0.00039576835,0.00052431267,0.00084044057],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016310883,0.00068017986,0.0010963216,0.0034377084,0.0034734954,0.0039619748,0.0015544787,0.0015778736,0.007225871],"category_scores_gemma":[0.006658301,0.0010901251,0.001100644,0.0018428944,0.0038748777,0.0075694714,0.0038483727,0.00222011,0.00058007234],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034638077,0.000011052522,0.0003552621,0.000028376386,0.0000076292986,0.00009076392,0.00039258,0.0003989623,0.000263469,0.99627185,0.00072874094,0.0014166966],"study_design_scores_gemma":[0.000021960013,0.000010849908,0.0004544403,0.000019260326,0.000017544988,0.00028095927,0.00022672047,0.0027074504,0.00019057833,0.99379057,0.0022652077,0.000014364392],"about_ca_topic_score_codex":0.0014048852,"about_ca_topic_score_gemma":0.0017262051,"teacher_disagreement_score":0.007225871,"about_ca_system_score_codex":0.0018842133,"about_ca_system_score_gemma":0.00067413494,"threshold_uncertainty_score":0.024172962},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45873716,0.0009291836,0.3024422,0.006860966,0.0006420064,0.00026023053,0.0031915477,0.0011692676,0.2257674],"genre_scores_gemma":[0.942921,0.00042155368,0.029017132,0.0015943324,0.00028276956,0.00034956864,0.0016187816,0.0002799874,0.023514744],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986621,0.00029320465,0.00012882841,0.00040117776,0.00023061354,0.00028403604],"domain_scores_gemma":[0.99483323,0.0029709535,0.00032065678,0.0004888891,0.0007077843,0.0006784376],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014534862,0.00060071243,0.0014787666,0.0022968887,0.0033071153,0.003691476,0.001644755,0.0027744041,0.021423671],"category_scores_gemma":[0.00978086,0.0008881201,0.0010642897,0.0025445132,0.0025344833,0.007882041,0.0037131363,0.003959377,0.0026269897],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001062439,0.00003496839,0.0005597104,0.000062874045,0.000009346196,0.00011133988,0.00033465307,0.0006722802,0.0018623965,0.9880184,0.003092064,0.0051357504],"study_design_scores_gemma":[0.000047921385,0.000024472536,0.00031377588,0.000026672878,0.0000150134565,0.00015791567,0.00021301817,0.0042402544,0.0013151302,0.98965317,0.003973677,0.000019069794],"about_ca_topic_score_codex":0.0013098601,"about_ca_topic_score_gemma":0.0016691206,"teacher_disagreement_score":0.021423671,"about_ca_system_score_codex":0.001376756,"about_ca_system_score_gemma":0.0009314358,"threshold_uncertainty_score":0.07166928},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7983863,0.0015757269,0.16216475,0.0023911702,0.00013479828,0.00007803327,0.0004919807,0.0006973606,0.034079894],"genre_scores_gemma":[0.97963595,0.00035240478,0.015803661,0.00022745629,0.00007525612,0.00004895094,0.00013857726,0.00004519742,0.0036725204],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99852115,0.00037288826,0.00010790204,0.0003780311,0.000371389,0.00024869296],"domain_scores_gemma":[0.9931531,0.0034761275,0.0009633402,0.001053287,0.00063805137,0.0007161043],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017501944,0.00024915603,0.00061696896,0.0019229769,0.0016497548,0.002293592,0.0011895887,0.0010752395,0.005707403],"category_scores_gemma":[0.00907014,0.0006043,0.0005481207,0.002196772,0.002987893,0.007891431,0.003193102,0.0012481551,0.00042823845],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001401949,0.000042105425,0.0015318285,0.000094743256,0.000017279703,0.00020542485,0.00044352288,0.005209004,0.0022809731,0.97819114,0.0013837862,0.010459955],"study_design_scores_gemma":[0.000019267018,0.000019724845,0.00035903582,0.000021377044,0.00000892029,0.00013731758,0.00015754215,0.012611927,0.0013919963,0.982851,0.002409756,0.000012225531],"about_ca_topic_score_codex":0.0012042101,"about_ca_topic_score_gemma":0.0011789595,"teacher_disagreement_score":0.005707403,"about_ca_system_score_codex":0.0019112144,"about_ca_system_score_gemma":0.00067792484,"threshold_uncertainty_score":0.019093215},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5094823,0.0023298175,0.4102736,0.006627424,0.00082225323,0.0002361997,0.0018654497,0.0015828364,0.06678003],"genre_scores_gemma":[0.92588186,0.00087540544,0.06053301,0.0008505456,0.0006564752,0.00031662753,0.0011469495,0.0005144594,0.009224726],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99576193,0.0011041336,0.00024341771,0.0010790142,0.00096791505,0.0008435537],"domain_scores_gemma":[0.9269524,0.05902693,0.0023915078,0.0043392773,0.001994141,0.00529578],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00449636,0.0018371991,0.0029151596,0.0022341413,0.0028025697,0.008961728,0.007003441,0.0044534067,0.014499899],"category_scores_gemma":[0.035399217,0.0018493333,0.0027046672,0.0021067315,0.0049566897,0.0105526,0.0052947984,0.0062035937,0.0011582203],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0026198877,0.0007166672,0.007032234,0.0010577483,0.0005061284,0.0008912131,0.001209304,0.09547589,0.036537047,0.8044114,0.015458685,0.03408368],"study_design_scores_gemma":[0.00020673966,0.00026933273,0.0014705609,0.000113560236,0.00025387274,0.0005715957,0.00019104488,0.29176557,0.0053242943,0.696388,0.0033646147,0.000080845595],"about_ca_topic_score_codex":0.00090275455,"about_ca_topic_score_gemma":0.00094821234,"teacher_disagreement_score":0.014499899,"about_ca_system_score_codex":0.0024427616,"about_ca_system_score_gemma":0.0015123916,"threshold_uncertainty_score":0.048507035},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38515866,0.00062387256,0.5782756,0.0017393267,0.00022724613,0.0001985129,0.00084226136,0.0013241025,0.03161035],"genre_scores_gemma":[0.87658554,0.00018033116,0.11347161,0.00025791686,0.000118307704,0.0001421096,0.0007109967,0.00033354395,0.008199533],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9966092,0.0011037102,0.00019383199,0.0011354751,0.00053033134,0.00042738696],"domain_scores_gemma":[0.98241836,0.011821594,0.0010119968,0.0029201664,0.0011442528,0.0006837453],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002711253,0.0009221894,0.0012660006,0.0029177608,0.0020198133,0.0031964702,0.0024887694,0.0022483692,0.014938958],"category_scores_gemma":[0.024891775,0.0010438254,0.0011634778,0.0022022831,0.0032010088,0.012777485,0.0048742355,0.0035358293,0.0020807923],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009901475,0.00037769426,0.0115915295,0.00045874997,0.000112142625,0.00042835483,0.0016887955,0.009995121,0.007898056,0.77824277,0.010052952,0.17816378],"study_design_scores_gemma":[0.000037364014,0.00006229513,0.00070422905,0.000043749038,0.000038472943,0.00018771194,0.0005056954,0.020571465,0.0023823886,0.97292906,0.0025087046,0.000028942031],"about_ca_topic_score_codex":0.00058725604,"about_ca_topic_score_gemma":0.0008011665,"teacher_disagreement_score":0.014938958,"about_ca_system_score_codex":0.00071568455,"about_ca_system_score_gemma":0.0008360334,"threshold_uncertainty_score":0.049975753},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6181584,0.0016642218,0.35220453,0.0028639191,0.00013269769,0.000051081704,0.00045941895,0.00044286382,0.024022881],"genre_scores_gemma":[0.9559556,0.00042595656,0.038241044,0.0002146537,0.00017602844,0.00010745175,0.00028038098,0.00008591558,0.0045129983],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987502,0.00039891904,0.000051809227,0.0003000927,0.00036547813,0.00013349084],"domain_scores_gemma":[0.9907746,0.006597256,0.0009497448,0.000603472,0.0004729209,0.0006020801],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016276188,0.00072401704,0.0009946963,0.0018403253,0.001402461,0.002523405,0.001843526,0.0014337117,0.0029198534],"category_scores_gemma":[0.016752988,0.00051251065,0.0005864548,0.0013981841,0.0028176473,0.0051950356,0.0022328333,0.0019504061,0.00039705713],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017882092,0.00004712623,0.0018497122,0.00015353369,0.000037846374,0.00012069331,0.00035116606,0.10281532,0.0028849996,0.8744701,0.0022480318,0.014842643],"study_design_scores_gemma":[0.0000134710135,0.00003780735,0.00050159474,0.000021069285,0.000009881334,0.00008843134,0.00007092476,0.28987408,0.0014285638,0.7066053,0.0013296371,0.000019152854],"about_ca_topic_score_codex":0.00082462165,"about_ca_topic_score_gemma":0.00081058004,"teacher_disagreement_score":0.0029198534,"about_ca_system_score_codex":0.0021150007,"about_ca_system_score_gemma":0.00041528154,"threshold_uncertainty_score":0.015345454},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9131715,0.0007949918,0.06482173,0.0033659758,0.00009963551,0.00003907908,0.00090887764,0.0005120496,0.016286222],"genre_scores_gemma":[0.985474,0.0006107004,0.007526447,0.0001739847,0.00025691383,0.0001360697,0.0007866198,0.00010874879,0.0049265726],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99766904,0.0006585607,0.00010230553,0.0007982565,0.00044927886,0.00032249527],"domain_scores_gemma":[0.9840103,0.009139349,0.0019746635,0.0021481968,0.0013661184,0.001361359],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028742345,0.0005594693,0.001133967,0.0030324273,0.0011133893,0.0035164808,0.002600275,0.0014454693,0.0042088656],"category_scores_gemma":[0.020120818,0.0007392657,0.00062145764,0.0012491917,0.005899214,0.0065102656,0.00217199,0.0021928072,0.0007136573],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00044848112,0.000109967936,0.014085061,0.00019754644,0.00006578821,0.00023951154,0.00087754935,0.0102301445,0.015558902,0.93297803,0.0045272945,0.020681657],"study_design_scores_gemma":[0.000091175,0.0001809038,0.020345429,0.000112336435,0.00007021144,0.0015777167,0.0006595135,0.12944326,0.015880344,0.8223744,0.009065039,0.00019973911],"about_ca_topic_score_codex":0.0009990218,"about_ca_topic_score_gemma":0.00053886604,"teacher_disagreement_score":0.0042088656,"about_ca_system_score_codex":0.002356595,"about_ca_system_score_gemma":0.0007519779,"threshold_uncertainty_score":0.017098308},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3897483,0.003967088,0.17261823,0.014651902,0.0012070531,0.00006766904,0.000710725,0.0005075522,0.41652137],"genre_scores_gemma":[0.9508032,0.0013028146,0.010981376,0.0014918925,0.0008054556,0.00007023168,0.00025646086,0.00014703507,0.034141473],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987872,0.0003711588,0.000058419966,0.00024935327,0.0003593602,0.00017451562],"domain_scores_gemma":[0.9977253,0.0010099265,0.00025309977,0.00035066242,0.00029710084,0.00036389928],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00137349,0.000792336,0.0014047856,0.0017876746,0.0035797176,0.003072738,0.0017822098,0.0017918233,0.010616294],"category_scores_gemma":[0.0045825476,0.0005293324,0.0008662992,0.0024653852,0.004941951,0.010898805,0.003934873,0.0042169113,0.0010893471],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015036159,0.0000070993483,0.000046385616,0.000019808756,0.0000025415077,0.000019601088,0.00006221495,0.00017411976,0.00013287757,0.99805295,0.0006372691,0.000830017],"study_design_scores_gemma":[0.000007642336,0.0000050940594,0.00006679747,0.000005878405,0.000005583099,0.00005395884,0.000038887003,0.0008518299,0.00011856277,0.9969488,0.0018920898,0.0000049033492],"about_ca_topic_score_codex":0.0011363616,"about_ca_topic_score_gemma":0.0007703178,"teacher_disagreement_score":0.010616294,"about_ca_system_score_codex":0.0016618354,"about_ca_system_score_gemma":0.00077312405,"threshold_uncertainty_score":0.03551507},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.90970516,0.0009997413,0.062026966,0.002891421,0.000103858474,0.000045968405,0.0004394306,0.00046311907,0.023324233],"genre_scores_gemma":[0.9948285,0.00028371878,0.002790939,0.00016659191,0.000050863557,0.000038645867,0.00015217686,0.000056476998,0.001632066],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992545,0.00030446387,0.00001880256,0.00015260135,0.00011707349,0.00015243044],"domain_scores_gemma":[0.99403065,0.0034024252,0.00088056683,0.0006680288,0.00036215896,0.000656159],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010319975,0.00030519586,0.0005612891,0.0025422317,0.0010682131,0.0017459823,0.00066722796,0.0009550801,0.0030533688],"category_scores_gemma":[0.01055041,0.00047829357,0.0004336811,0.0007685485,0.0025341397,0.0022868717,0.0014693331,0.0010838573,0.00035145637],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00059462665,0.000071520655,0.01241366,0.00018184012,0.00010984454,0.00052103907,0.00058723293,0.11421741,0.020524465,0.82206964,0.007906075,0.020802664],"study_design_scores_gemma":[0.00004680992,0.00008430818,0.0070727402,0.00007245729,0.000033509357,0.00031429378,0.00018072782,0.35645205,0.004654535,0.62726486,0.0037661341,0.00005763124],"about_ca_topic_score_codex":0.0011108625,"about_ca_topic_score_gemma":0.0007941792,"teacher_disagreement_score":0.0030533688,"about_ca_system_score_codex":0.0019830056,"about_ca_system_score_gemma":0.00040000374,"threshold_uncertainty_score":0.014387727},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3665656,0.009889099,0.21273659,0.023037577,0.001507888,0.0001927216,0.0024861984,0.0023566787,0.3812277],"genre_scores_gemma":[0.93004996,0.0036532138,0.033880416,0.002907315,0.0022552714,0.00030999913,0.0013873642,0.0010121193,0.024544286],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9952094,0.0010438684,0.0002895358,0.0014122798,0.0011438092,0.00090120715],"domain_scores_gemma":[0.93941915,0.04805484,0.0014217761,0.004864888,0.0020190263,0.0042203283],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005060212,0.0017884065,0.003004626,0.0043807994,0.0041377153,0.008328485,0.005024105,0.003565786,0.01780474],"category_scores_gemma":[0.030431585,0.0019851509,0.003341587,0.0033928698,0.007821382,0.024756601,0.009180395,0.012161913,0.0019146986],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002443099,0.00011326069,0.0012072893,0.00017695683,0.000034251654,0.00018344006,0.0004881736,0.0012988889,0.0016511787,0.9818279,0.003166939,0.009607375],"study_design_scores_gemma":[0.000030413607,0.00003753277,0.00036364756,0.000059387246,0.0000490074,0.00017686104,0.00006958265,0.003860529,0.00091465726,0.9904661,0.003948351,0.000023997683],"about_ca_topic_score_codex":0.000693782,"about_ca_topic_score_gemma":0.0007684742,"teacher_disagreement_score":0.01780474,"about_ca_system_score_codex":0.0027084965,"about_ca_system_score_gemma":0.0014109692,"threshold_uncertainty_score":0.059562802},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7265833,0.0015981034,0.19935973,0.0011240498,0.00006849718,0.000085663865,0.0016029612,0.0007221933,0.06885538],"genre_scores_gemma":[0.9465254,0.0007583754,0.042708766,0.0003564842,0.0000721319,0.00009080283,0.0018664885,0.00017219193,0.0074494006],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990221,0.00022675689,0.00006570279,0.00034351143,0.00015432568,0.00018748961],"domain_scores_gemma":[0.99527353,0.0029095665,0.00068818755,0.00046162689,0.00031012623,0.00035696328],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066587114,0.0005065133,0.0007101528,0.0010284882,0.0012377882,0.0011818733,0.001385922,0.0007306667,0.0062349746],"category_scores_gemma":[0.006041944,0.0004884539,0.0005780411,0.0010831526,0.001234699,0.0032946998,0.0015839535,0.0008452861,0.0009610302],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00064880226,0.0001514616,0.00594139,0.0006456826,0.0000882607,0.0007290847,0.0008637168,0.03125522,0.028258238,0.8721623,0.009904281,0.049351484],"study_design_scores_gemma":[0.00007311491,0.00012660792,0.0046879435,0.00013612602,0.00008261335,0.0016289267,0.0005735241,0.07358071,0.015840238,0.8833384,0.019886363,0.000045561508],"about_ca_topic_score_codex":0.0011675645,"about_ca_topic_score_gemma":0.0017118558,"teacher_disagreement_score":0.0062349746,"about_ca_system_score_codex":0.00075646094,"about_ca_system_score_gemma":0.00040142954,"threshold_uncertainty_score":0.02085805},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5499694,0.0014807961,0.27511826,0.003321294,0.00030164426,0.000120823686,0.0024938846,0.0008488698,0.166345],"genre_scores_gemma":[0.92882276,0.0012758425,0.0399266,0.0009781227,0.0003500162,0.00022988708,0.0029353532,0.00044026223,0.02504118],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990896,0.00021360218,0.000042156666,0.00027847104,0.0002560236,0.000120116296],"domain_scores_gemma":[0.99687755,0.0013748461,0.0006254761,0.00037861505,0.00039801787,0.00034559902],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048811926,0.00094737986,0.0012238089,0.003199623,0.0024163418,0.005897668,0.0016807225,0.0018936141,0.012190406],"category_scores_gemma":[0.0036372084,0.00096673163,0.0009857964,0.0038466072,0.0035875787,0.010652797,0.002216048,0.0037285003,0.0014727552],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000033388158,0.00001784697,0.00029575403,0.000041256917,0.000013132838,0.00005584142,0.00017181042,0.00078690174,0.00044959024,0.9914858,0.0015240622,0.0051246514],"study_design_scores_gemma":[0.000005340967,0.0000063496605,0.00024234572,0.000013083218,0.0000071206887,0.00009717621,0.00011813207,0.0023093717,0.00031829017,0.9946116,0.0022652822,0.0000058605874],"about_ca_topic_score_codex":0.0008065872,"about_ca_topic_score_gemma":0.0007510856,"teacher_disagreement_score":0.012190406,"about_ca_system_score_codex":0.001010079,"about_ca_system_score_gemma":0.0004027428,"threshold_uncertainty_score":0.04078096},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6419961,0.0038566056,0.08437265,0.0037405568,0.0004415815,0.000082622646,0.0007972594,0.00040868425,0.2643039],"genre_scores_gemma":[0.9776589,0.0013166787,0.009117398,0.0003249958,0.00022495791,0.00009907616,0.0002254033,0.00006806834,0.010964567],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990595,0.00029207612,0.000059251608,0.00018149156,0.00022512751,0.00018259676],"domain_scores_gemma":[0.9936488,0.0038979014,0.0008308613,0.00033078343,0.0005312897,0.0007603511],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011929702,0.00053968275,0.0007307561,0.0036367208,0.0020183837,0.0032095264,0.0013097179,0.001001878,0.0074105794],"category_scores_gemma":[0.008400647,0.0005067828,0.00048130157,0.00220047,0.0037391966,0.008399086,0.0027639554,0.0019666746,0.0010934961],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000039721534,0.000019695733,0.00036863863,0.000061169085,0.000005831372,0.000046966834,0.00030011122,0.0010609333,0.0003932837,0.9913283,0.0016124061,0.0047629443],"study_design_scores_gemma":[0.000009182077,0.000009670121,0.00029865783,0.000034972345,0.000006323858,0.000107775726,0.000160469,0.0038693878,0.00028254604,0.9929733,0.0022358822,0.000011859248],"about_ca_topic_score_codex":0.0013518429,"about_ca_topic_score_gemma":0.0017468003,"teacher_disagreement_score":0.0074105794,"about_ca_system_score_codex":0.0018906441,"about_ca_system_score_gemma":0.0006612697,"threshold_uncertainty_score":0.024790883},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26875725,0.0020059266,0.19330947,0.0025285664,0.00075007667,0.00012676638,0.0017333453,0.0010063814,0.5297822],"genre_scores_gemma":[0.89819145,0.00090545433,0.027379824,0.0007207894,0.00028140433,0.00013906352,0.0009004577,0.00026603165,0.07121546],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993345,0.00013233827,0.000035485624,0.00018474415,0.00017700443,0.00013584427],"domain_scores_gemma":[0.9989666,0.00034426217,0.000105288826,0.00022877322,0.00014393048,0.00021113436],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00069856487,0.0004277668,0.0004942017,0.0023801404,0.0025518201,0.0023991787,0.00088041794,0.0011016924,0.015120131],"category_scores_gemma":[0.00256584,0.0004387686,0.0007058501,0.0017332284,0.0018269331,0.0057653286,0.0032604793,0.001530732,0.0017627741],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028210414,0.00001749636,0.0003585589,0.000034141896,0.0000069799844,0.00019411203,0.0002639269,0.00054258294,0.00064806745,0.9860387,0.0039076908,0.0079595465],"study_design_scores_gemma":[0.00001592869,0.000017003238,0.0004991864,0.000032433345,0.000012746038,0.00069253694,0.00022157958,0.004055756,0.0007475223,0.9625691,0.031118495,0.000017660212],"about_ca_topic_score_codex":0.0018475498,"about_ca_topic_score_gemma":0.0013311653,"teacher_disagreement_score":0.015120131,"about_ca_system_score_codex":0.0012247366,"about_ca_system_score_gemma":0.00045765648,"threshold_uncertainty_score":0.050581813},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08696577,0.001853852,0.90004903,0.004705983,0.00016676332,0.00020220262,0.0011984285,0.00042678157,0.0044311658],"genre_scores_gemma":[0.7432603,0.0012151465,0.24818078,0.002143118,0.00059606385,0.0010678264,0.0020209698,0.0002502607,0.0012655507],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9721513,0.015876018,0.0018823906,0.005402627,0.0038665405,0.00082110526],"domain_scores_gemma":[0.69942266,0.24409242,0.019296544,0.02816292,0.005626279,0.0033992457],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.044097677,0.0016407806,0.0030134073,0.009231433,0.0037892752,0.008258731,0.0035002455,0.002661543,0.002201887],"category_scores_gemma":[0.19300106,0.0014397393,0.0026274896,0.0090770135,0.011739405,0.025174933,0.009150511,0.007008987,0.00030212651],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015195485,0.0001592672,0.035650145,0.0005229537,0.00062069634,0.00032546703,0.001786387,0.054655425,0.0013014572,0.87456965,0.0035634516,0.02669303],"study_design_scores_gemma":[0.000018830337,0.000054188382,0.0025898174,0.000088613655,0.000037328864,0.00014545386,0.00027869872,0.1239362,0.0006202815,0.87030435,0.0018801735,0.0000460648],"about_ca_topic_score_codex":0.002521627,"about_ca_topic_score_gemma":0.0036255796,"teacher_disagreement_score":0.044097677,"about_ca_system_score_codex":0.004373001,"about_ca_system_score_gemma":0.0036339283,"threshold_uncertainty_score":0.2332136},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.79613054,0.001988806,0.119255826,0.005616685,0.00028436922,0.0000685385,0.00039306964,0.00034122352,0.07592095],"genre_scores_gemma":[0.98246217,0.00030788744,0.013029839,0.00029173223,0.000110023175,0.000047451387,0.000163693,0.00003572127,0.0035514578],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998931,0.00021239449,0.00003742634,0.00032730322,0.0002362624,0.00025566065],"domain_scores_gemma":[0.9959319,0.002225953,0.00047616032,0.0005998566,0.0003167477,0.00044936698],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010104929,0.0002650205,0.00068618683,0.001097757,0.0017216408,0.0017766969,0.0013673434,0.001737442,0.0071660313],"category_scores_gemma":[0.007952524,0.00046151833,0.00051474926,0.0010402467,0.002451894,0.003791288,0.002051209,0.0017899155,0.00044505228],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028017093,0.00007880773,0.0030611258,0.000098768076,0.000020628439,0.00037509756,0.00050989405,0.015110493,0.0027346697,0.9539668,0.007071567,0.016691914],"study_design_scores_gemma":[0.000052080224,0.00003180177,0.00081402407,0.000028805709,0.0000103338525,0.00032351093,0.0002966283,0.036196973,0.0012259086,0.95630753,0.0046969396,0.000015486094],"about_ca_topic_score_codex":0.0017066436,"about_ca_topic_score_gemma":0.0014843132,"teacher_disagreement_score":0.0071660313,"about_ca_system_score_codex":0.00109674,"about_ca_system_score_gemma":0.00043797458,"threshold_uncertainty_score":0.02397275},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3953893,0.0019302741,0.48988223,0.0058647715,0.0005346164,0.00009009125,0.00092044106,0.00039407064,0.10499433],"genre_scores_gemma":[0.9250371,0.0005686693,0.054995406,0.00046645285,0.00021737508,0.00010833461,0.00060796615,0.00013601246,0.017862706],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99871194,0.00048386032,0.000055142318,0.00023909962,0.00037372697,0.00013626019],"domain_scores_gemma":[0.99681073,0.0021285377,0.00014557857,0.0004305,0.00021763003,0.0002670747],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017940702,0.00036590855,0.001072102,0.000719099,0.0009992793,0.0026454257,0.0017941949,0.0013160043,0.013616563],"category_scores_gemma":[0.0076177013,0.00036962205,0.0006162293,0.0009327191,0.002462118,0.0051573818,0.0027714954,0.0020193732,0.0007720536],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004280074,0.000018835048,0.00013543683,0.00004460869,0.000010747332,0.0000534716,0.000055542467,0.006435262,0.00026483528,0.9863555,0.0018155767,0.004767372],"study_design_scores_gemma":[0.000020293735,0.0000125521165,0.000057395562,0.000013376728,0.0000046487676,0.000065856504,0.000042293555,0.050723836,0.00029277583,0.9465611,0.002198997,0.000006903733],"about_ca_topic_score_codex":0.0007411908,"about_ca_topic_score_gemma":0.00051792,"teacher_disagreement_score":0.013616563,"about_ca_system_score_codex":0.0012455644,"about_ca_system_score_gemma":0.00066093577,"threshold_uncertainty_score":0.045551956},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9516187,0.00044040722,0.030612167,0.0012340511,0.000046312325,0.000041057847,0.00038673097,0.00038946242,0.015231096],"genre_scores_gemma":[0.9915957,0.0001412816,0.0051465556,0.00017422205,0.000059692113,0.000045802204,0.0002561409,0.000074561016,0.0025061301],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995235,0.0001386858,0.000017893586,0.000116352254,0.00010124982,0.00010229609],"domain_scores_gemma":[0.99459946,0.0028751825,0.00066276715,0.0003949376,0.00040234276,0.0010653517],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00084315194,0.00039331248,0.0010857452,0.0021217896,0.0011712752,0.002464821,0.001606157,0.0013996643,0.0042687813],"category_scores_gemma":[0.007936875,0.00065891346,0.00051653903,0.00063548976,0.0020570632,0.0028522671,0.0018188216,0.0014043294,0.00047305683],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006685885,0.0001923281,0.007276567,0.00030039262,0.000073122974,0.0007256221,0.00078208453,0.03074343,0.01835651,0.9268338,0.006564677,0.0074828],"study_design_scores_gemma":[0.00010845996,0.00008667195,0.006803346,0.00006441693,0.00005017876,0.0007717851,0.00041219988,0.2158288,0.003254508,0.7711926,0.0013854333,0.000041603427],"about_ca_topic_score_codex":0.0015947903,"about_ca_topic_score_gemma":0.0015818599,"teacher_disagreement_score":0.0042687813,"about_ca_system_score_codex":0.0011971644,"about_ca_system_score_gemma":0.0005024507,"threshold_uncertainty_score":0.014280558},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.84889835,0.0008908522,0.055650193,0.0023403172,0.00014214634,0.00006779098,0.0010438235,0.0007214052,0.09024504],"genre_scores_gemma":[0.984718,0.00025884496,0.008387473,0.0001655139,0.00007941914,0.000059441012,0.0004041353,0.00010173044,0.0058253286],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994271,0.00016602708,0.000033037344,0.00013379255,0.00013563302,0.00010448593],"domain_scores_gemma":[0.9958812,0.0022331388,0.0004915436,0.00048417706,0.00037788655,0.0005321432],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00095789606,0.00033069457,0.00045241113,0.001421577,0.0009077274,0.00183181,0.00057177275,0.00056791404,0.010438396],"category_scores_gemma":[0.004547044,0.00028056116,0.00046731313,0.00069292,0.0015102589,0.003559903,0.0012129835,0.0008374573,0.00073978305],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004927813,0.0000650461,0.0020394735,0.00019564731,0.000030434494,0.0003167134,0.0006697595,0.0147496965,0.00621082,0.9515741,0.0073416634,0.016313905],"study_design_scores_gemma":[0.000059736536,0.00005634595,0.001923842,0.00003814809,0.000023593419,0.0003484104,0.00029033676,0.03858573,0.0032013035,0.94657,0.008868149,0.00003445653],"about_ca_topic_score_codex":0.0009982869,"about_ca_topic_score_gemma":0.0011859727,"teacher_disagreement_score":0.010438396,"about_ca_system_score_codex":0.0012247296,"about_ca_system_score_gemma":0.00048347606,"threshold_uncertainty_score":0.034919858},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027207553,0.0064837863,0.9289687,0.0034776076,0.00044056537,0.000067222,0.00022589928,0.00046293694,0.032665674],"genre_scores_gemma":[0.6259644,0.013448784,0.28573188,0.0021752883,0.0033099395,0.0010645391,0.00087084,0.0011343156,0.066299945],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99649197,0.0022136355,0.00008903764,0.00032396658,0.00071275886,0.00016857185],"domain_scores_gemma":[0.9782547,0.017286636,0.00072367996,0.00200731,0.0009866122,0.0007410782],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0056133494,0.0015758774,0.0026138942,0.006253942,0.0015595261,0.0032040486,0.0031934618,0.0024892539,0.006400257],"category_scores_gemma":[0.024316303,0.0013389162,0.0016534525,0.00402197,0.0065889535,0.008535114,0.003974976,0.0065954807,0.0013993698],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009122291,0.00001692343,0.00008628254,0.00004215804,0.0000118393955,0.000009031589,0.000047209454,0.0030921518,0.000080020145,0.99160516,0.0008893786,0.0041107708],"study_design_scores_gemma":[0.0000069179982,0.0000036472711,0.00003941462,0.000018522142,0.0000037955292,0.000010957839,0.000010958873,0.021621807,0.00005503879,0.97691226,0.0013110576,0.0000057066604],"about_ca_topic_score_codex":0.0014231896,"about_ca_topic_score_gemma":0.0016033112,"teacher_disagreement_score":0.006400257,"about_ca_system_score_codex":0.001996364,"about_ca_system_score_gemma":0.0011004641,"threshold_uncertainty_score":0.02968657},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.59756035,0.01004728,0.20376098,0.010779165,0.0005862422,0.00014413326,0.00089006673,0.00050122937,0.17573048],"genre_scores_gemma":[0.97260946,0.0018489527,0.009736539,0.0006874896,0.0006523463,0.00012093921,0.00039872716,0.00013547842,0.013810112],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993735,0.00020044205,0.00002887592,0.00012769204,0.0001539762,0.00011563253],"domain_scores_gemma":[0.9941818,0.004253804,0.0004619154,0.00046276377,0.00026697534,0.00037257854],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009887688,0.00036592354,0.0007810735,0.0013590894,0.0009308685,0.0021004255,0.0011187604,0.0015224136,0.009636528],"category_scores_gemma":[0.009518924,0.00047093706,0.000778885,0.0014668935,0.0028026842,0.0049815224,0.0018261117,0.00218391,0.00069383945],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000060933173,0.000021901033,0.0005535387,0.00007514583,0.000008257339,0.00009153392,0.00018772048,0.0026745196,0.0010151569,0.9827184,0.0034526195,0.009140259],"study_design_scores_gemma":[0.000016988059,0.000013312505,0.0004486409,0.000020033267,0.000008226311,0.00019966731,0.000063531,0.013226523,0.00041201417,0.9837794,0.0018020935,0.000009488774],"about_ca_topic_score_codex":0.0015411554,"about_ca_topic_score_gemma":0.0014333916,"teacher_disagreement_score":0.009636528,"about_ca_system_score_codex":0.0010013855,"about_ca_system_score_gemma":0.00047557816,"threshold_uncertainty_score":0.03223735},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.63650346,0.0063199108,0.2679695,0.007788799,0.0003752787,0.000119445715,0.0009202509,0.0007069643,0.07929642],"genre_scores_gemma":[0.9808436,0.0017985286,0.011250457,0.0004553029,0.00046826052,0.0001053862,0.0002869315,0.00012656394,0.0046648122],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99915576,0.00028082094,0.000035480898,0.0002006757,0.00018580595,0.0001413947],"domain_scores_gemma":[0.98718554,0.0092326915,0.001298348,0.0010635644,0.00042378763,0.0007960642],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013715227,0.00035168795,0.00092175015,0.0012326527,0.00090599665,0.002189222,0.0013632502,0.0012509294,0.008203096],"category_scores_gemma":[0.01602584,0.0005309815,0.00064213783,0.001284003,0.0026132988,0.006109352,0.0015679492,0.0019312449,0.0004732691],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008165692,0.000022801165,0.00074697606,0.0000836649,0.000011010214,0.00009043252,0.00018579082,0.0051056193,0.0014562953,0.98182136,0.0027907642,0.0076034917],"study_design_scores_gemma":[0.00002560244,0.000022396769,0.0008804696,0.000028358485,0.000012264881,0.00021483033,0.00008369209,0.05204053,0.0005838336,0.94384986,0.0022454557,0.0000128053525],"about_ca_topic_score_codex":0.0018151911,"about_ca_topic_score_gemma":0.0012687752,"teacher_disagreement_score":0.008203096,"about_ca_system_score_codex":0.001386872,"about_ca_system_score_gemma":0.00047812224,"threshold_uncertainty_score":0.027442038},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5962045,0.00062645617,0.22524121,0.004340976,0.00018472785,0.00034848155,0.0007523039,0.0006320036,0.17166933],"genre_scores_gemma":[0.97296053,0.00018051598,0.016279783,0.00031429777,0.000062328276,0.00018896382,0.00018312906,0.00008476492,0.009745678],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985298,0.0005778398,0.000054817694,0.0002892382,0.00025012367,0.00029814054],"domain_scores_gemma":[0.99164563,0.005625109,0.00042871985,0.00044318242,0.0004188227,0.0014384495],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015961295,0.0007509309,0.0008187637,0.00089092937,0.0015184792,0.0023315204,0.0011321283,0.001083546,0.011846883],"category_scores_gemma":[0.009976592,0.0005212185,0.0005446167,0.00046739663,0.003030748,0.005439466,0.0021072177,0.001643293,0.00075654057],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005777049,0.00012150459,0.0018522124,0.00018181613,0.00003735646,0.00022436054,0.0007212877,0.030741304,0.006161924,0.9403021,0.0050028153,0.014075572],"study_design_scores_gemma":[0.0000921252,0.00013899947,0.0006105869,0.00004545964,0.000023034441,0.00014897797,0.0002510818,0.17790967,0.0024522224,0.81153506,0.006762181,0.000030567087],"about_ca_topic_score_codex":0.002361583,"about_ca_topic_score_gemma":0.002072683,"teacher_disagreement_score":0.011846883,"about_ca_system_score_codex":0.0030341838,"about_ca_system_score_gemma":0.0016499056,"threshold_uncertainty_score":0.039631724},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7088031,0.0023672641,0.21743156,0.0015359876,0.000107486965,0.000059991817,0.00033041477,0.0001442699,0.06921995],"genre_scores_gemma":[0.9750124,0.0008378685,0.017508144,0.00011769038,0.00017392848,0.000058042126,0.00019053943,0.000028309063,0.006073176],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99926513,0.00019460522,0.000034748406,0.0001724745,0.00021261939,0.00012038581],"domain_scores_gemma":[0.9984308,0.0007840902,0.00024986165,0.0001368381,0.00015039908,0.00024793873],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008896175,0.00044709144,0.00048817,0.0019991049,0.0017304627,0.0026269385,0.0006760129,0.0005764664,0.0034700737],"category_scores_gemma":[0.0019690045,0.00039863543,0.0006551969,0.0014230357,0.0040849145,0.0061300774,0.002607862,0.001681795,0.00027532215],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000062429867,0.000005071709,0.00022115133,0.000018043469,0.000004534668,0.000038754846,0.00015367313,0.00060902117,0.00030087164,0.9970983,0.00013796009,0.0014063658],"study_design_scores_gemma":[0.000009305354,0.000010626966,0.00034119745,0.00001779093,0.000008837354,0.000112437534,0.000190553,0.003354184,0.00039147405,0.99229676,0.0032587126,0.000008096552],"about_ca_topic_score_codex":0.0009975443,"about_ca_topic_score_gemma":0.000700988,"teacher_disagreement_score":0.0034700737,"about_ca_system_score_codex":0.0015116134,"about_ca_system_score_gemma":0.00042839852,"threshold_uncertainty_score":0.011608541},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.79712486,0.0008409761,0.16163167,0.0022131735,0.00013494762,0.000095900854,0.0012435496,0.00038407068,0.036330767],"genre_scores_gemma":[0.97675043,0.00025146062,0.016492529,0.00018980846,0.00023659041,0.000110230925,0.00071717484,0.000116215844,0.0051355334],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99683255,0.0006939285,0.00014855138,0.00057827274,0.0012453242,0.0005013375],"domain_scores_gemma":[0.9816683,0.013218817,0.0012427894,0.0015189553,0.001116732,0.0012343886],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002037788,0.0006136833,0.0017696781,0.0024785718,0.002040903,0.0045140805,0.001958653,0.0011477327,0.0077031194],"category_scores_gemma":[0.015657563,0.00074875436,0.001186302,0.0018403605,0.0039177756,0.007350275,0.003972315,0.0023688946,0.00074185716],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00046191746,0.00006991907,0.0023496186,0.00018421136,0.000053995227,0.00022526394,0.00057421764,0.009898659,0.005208452,0.9616186,0.0023953451,0.01695975],"study_design_scores_gemma":[0.000040430223,0.000044042732,0.0005612078,0.000038603448,0.000031777898,0.0002273941,0.000119374185,0.035122734,0.003978212,0.9566099,0.0031974951,0.000028799186],"about_ca_topic_score_codex":0.00065287657,"about_ca_topic_score_gemma":0.00050444866,"teacher_disagreement_score":0.0077031194,"about_ca_system_score_codex":0.0019822856,"about_ca_system_score_gemma":0.00070860196,"threshold_uncertainty_score":0.025769532},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.88674664,0.0003433384,0.07307738,0.0005659511,0.00010035819,0.00007362577,0.00051138736,0.00017849776,0.03840283],"genre_scores_gemma":[0.9549319,0.0002557856,0.03227113,0.00016897464,0.00004635892,0.00006975232,0.00058525975,0.00007212982,0.011598727],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996475,0.00008683082,0.000017624776,0.000096271564,0.00007559087,0.00007617654],"domain_scores_gemma":[0.99907875,0.0004102154,0.00016655207,0.00011283296,0.00007633284,0.00015534357],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023741266,0.00032179008,0.0004542003,0.00055248,0.0008405573,0.0010371237,0.00096821715,0.0008171943,0.007238131],"category_scores_gemma":[0.001209167,0.00038677143,0.00032700767,0.0008425962,0.0011271514,0.0013456156,0.0009383556,0.0006344035,0.00091316516],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006243718,0.00016318263,0.0034896878,0.00042500973,0.00005711127,0.0027012262,0.0018397708,0.015973762,0.050625842,0.8894428,0.007064134,0.02759308],"study_design_scores_gemma":[0.00014576879,0.00013155794,0.0035232878,0.000053552158,0.00004571342,0.0017472598,0.00064704777,0.057167064,0.009804553,0.9095242,0.017179428,0.000030634394],"about_ca_topic_score_codex":0.0014391526,"about_ca_topic_score_gemma":0.00218396,"teacher_disagreement_score":0.007238131,"about_ca_system_score_codex":0.0005168851,"about_ca_system_score_gemma":0.00022064969,"threshold_uncertainty_score":0.02421391},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6863608,0.0032267738,0.18682617,0.001193809,0.00038867476,0.00014051987,0.00060463016,0.0006340211,0.120624624],"genre_scores_gemma":[0.95902294,0.00086944463,0.024166629,0.00030241685,0.00044312992,0.00021513451,0.00060904166,0.00020772954,0.014163547],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99750704,0.0006465053,0.00020242528,0.00044577263,0.0008434958,0.0003549051],"domain_scores_gemma":[0.995523,0.0029158522,0.00036582028,0.0003315088,0.00040509473,0.00045870058],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017312082,0.00093962916,0.0013137652,0.0043712906,0.0038807127,0.0044339104,0.0013228158,0.0009015125,0.005988408],"category_scores_gemma":[0.005387697,0.00085062283,0.0015809768,0.0021463272,0.005146203,0.0075354963,0.0052378327,0.0018706208,0.00089848967],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000052976957,0.0000254059,0.00041933072,0.000057190377,0.000016225249,0.00016741786,0.0007443345,0.00091891875,0.0009582008,0.99162686,0.00045515705,0.0045579667],"study_design_scores_gemma":[0.000011940742,0.000018550321,0.00023559023,0.000026173297,0.000015684558,0.00013266025,0.00014487575,0.0043067364,0.00079601805,0.9921933,0.002102051,0.000016487844],"about_ca_topic_score_codex":0.0010203021,"about_ca_topic_score_gemma":0.00079810456,"teacher_disagreement_score":0.005988408,"about_ca_system_score_codex":0.0017462224,"about_ca_system_score_gemma":0.0006347228,"threshold_uncertainty_score":0.02003324},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15860109,0.0010525618,0.7926125,0.0023251313,0.0003051836,0.00006462799,0.00044447216,0.0007153619,0.043879062],"genre_scores_gemma":[0.9321107,0.0007612451,0.047199737,0.0006060112,0.00032981238,0.00017738233,0.00036430315,0.00060158595,0.017849151],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976829,0.0004899558,0.000097894765,0.00059970043,0.000760342,0.00036913858],"domain_scores_gemma":[0.9954144,0.0019444737,0.000501015,0.00066892616,0.00087390223,0.0005973078],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002352746,0.00083575095,0.0012267242,0.0021041417,0.0019051752,0.0031609884,0.0021762922,0.0014213821,0.0074753854],"category_scores_gemma":[0.010958936,0.00052790745,0.0021703753,0.0011335274,0.0036059392,0.007734905,0.0037090231,0.004086864,0.0010497931],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008429307,0.0000058045093,0.00013599878,0.000020126045,0.0000067029423,0.000027965225,0.00007587309,0.0021338179,0.00047963974,0.9953967,0.0003962842,0.0013125939],"study_design_scores_gemma":[0.0000050516473,0.000023160474,0.00019203099,0.0000119550195,0.000006336765,0.00007191148,0.00006606928,0.037672363,0.0010769316,0.9593098,0.0015497673,0.000014593746],"about_ca_topic_score_codex":0.0037822868,"about_ca_topic_score_gemma":0.0022563739,"teacher_disagreement_score":0.0074753854,"about_ca_system_score_codex":0.0036990056,"about_ca_system_score_gemma":0.0014174281,"threshold_uncertainty_score":0.026838303},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.81273925,0.0010266928,0.1302121,0.0013617952,0.000053198353,0.00007860917,0.0010783686,0.00044304386,0.05300695],"genre_scores_gemma":[0.9602915,0.00052861223,0.027984971,0.0003040412,0.00007261307,0.000108392276,0.00084563723,0.000083091945,0.009781236],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991761,0.00019433493,0.00004875077,0.00027341762,0.00015204304,0.00015548515],"domain_scores_gemma":[0.9960141,0.0020301726,0.0004819324,0.00043464164,0.00042153476,0.00061765895],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00072498084,0.00044430816,0.0005466705,0.0010706282,0.0011964805,0.001548809,0.0006783753,0.0007130332,0.0068332944],"category_scores_gemma":[0.00482927,0.00055391365,0.00051478186,0.0011465155,0.0019922128,0.0041258684,0.0019400691,0.001128932,0.00090979424],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030879874,0.0000726229,0.004332884,0.00024264469,0.000038160317,0.00029817555,0.0011487532,0.009186105,0.012734422,0.9489299,0.0033225748,0.019384934],"study_design_scores_gemma":[0.00005007032,0.000077474295,0.002545984,0.000051895855,0.000028207969,0.0006213962,0.0007187968,0.03600208,0.006737371,0.9433133,0.009820156,0.00003327349],"about_ca_topic_score_codex":0.0010812255,"about_ca_topic_score_gemma":0.0012104511,"teacher_disagreement_score":0.0068332944,"about_ca_system_score_codex":0.0011719386,"about_ca_system_score_gemma":0.00046168463,"threshold_uncertainty_score":0.022859633},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.62183684,0.0029278481,0.1464112,0.057871062,0.0013035097,0.00009284951,0.0009610776,0.0022314985,0.16636416],"genre_scores_gemma":[0.97332126,0.00070464326,0.015051525,0.002981015,0.00071599986,0.00007946105,0.00022077127,0.00025186775,0.0066734203],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977933,0.0005650727,0.00007333517,0.0006216677,0.00048731916,0.00045924948],"domain_scores_gemma":[0.97720325,0.017266393,0.0009815616,0.002907554,0.00087122084,0.00076998264],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028229174,0.0005156664,0.0010288307,0.0014977013,0.0022860505,0.0022163116,0.0018170903,0.0024135604,0.010171376],"category_scores_gemma":[0.020757845,0.00055074575,0.0009551625,0.0017657132,0.0071566096,0.008096468,0.004130489,0.0040661194,0.00081300706],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020247443,0.000028394059,0.00097249285,0.00007809599,0.000010326752,0.00018994899,0.0003724645,0.0031819087,0.0013963643,0.9750641,0.011613798,0.00688972],"study_design_scores_gemma":[0.00006825114,0.000031936146,0.000723248,0.000025363466,0.000012975757,0.00031041683,0.00021660113,0.013022923,0.0017498215,0.9740242,0.009787561,0.000026872987],"about_ca_topic_score_codex":0.0016318782,"about_ca_topic_score_gemma":0.0010571283,"teacher_disagreement_score":0.010171376,"about_ca_system_score_codex":0.0020211653,"about_ca_system_score_gemma":0.0005501877,"threshold_uncertainty_score":0.034026682},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13269055,0.0026322196,0.62743175,0.010645023,0.0014593796,0.00014243615,0.0009995553,0.0016916543,0.2223074],"genre_scores_gemma":[0.7987672,0.0019236687,0.14993833,0.0035656753,0.0008624714,0.00027879895,0.00054746657,0.00058426533,0.043532014],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975732,0.00036758994,0.00012187786,0.001015877,0.0005743171,0.00034718035],"domain_scores_gemma":[0.9949386,0.0025280672,0.0003263077,0.0011377219,0.00073307997,0.00033620122],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025594598,0.00069847493,0.001014948,0.0013791504,0.002482925,0.0021789996,0.0021902088,0.0013641865,0.013158209],"category_scores_gemma":[0.0108922385,0.0005373719,0.0017016788,0.001917898,0.0047370456,0.013608068,0.004815069,0.0041816244,0.002470231],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004465718,0.000016356656,0.00040293374,0.000087329936,0.0000158508,0.00012328949,0.00034888875,0.0008760349,0.0009624775,0.97902703,0.0049131946,0.0131820515],"study_design_scores_gemma":[0.000015067218,0.000024047604,0.00021592522,0.000020346051,0.000013558692,0.00020437462,0.000065043685,0.0027260268,0.0010371207,0.9828886,0.012773774,0.000016298229],"about_ca_topic_score_codex":0.0013464245,"about_ca_topic_score_gemma":0.0011100982,"teacher_disagreement_score":0.013158209,"about_ca_system_score_codex":0.0015980402,"about_ca_system_score_gemma":0.00089082617,"threshold_uncertainty_score":0.044018567},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7585171,0.0012423316,0.1920194,0.0013628581,0.00015864217,0.00008938281,0.00095286436,0.0004905559,0.0451669],"genre_scores_gemma":[0.97524697,0.0003272403,0.0179452,0.0003835318,0.000074609794,0.000092347895,0.00045162177,0.00012722357,0.0053513064],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991308,0.00015905878,0.000044883935,0.0002523791,0.00014699607,0.00026591035],"domain_scores_gemma":[0.9946461,0.0026069654,0.0005705382,0.0008920945,0.00045140734,0.0008329696],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010661936,0.0006848119,0.00077258126,0.001111485,0.0014215931,0.0021705416,0.0018739089,0.001126098,0.008729117],"category_scores_gemma":[0.009697374,0.00079460884,0.00086300937,0.0009137574,0.001995359,0.0046451166,0.003351199,0.0024099252,0.00078799174],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005000833,0.000081420214,0.0050053806,0.00041385597,0.00007493259,0.0006295084,0.0006786775,0.03797913,0.01181493,0.924541,0.0048022857,0.013478726],"study_design_scores_gemma":[0.00006385844,0.00008315448,0.0018231435,0.00006738218,0.00004454935,0.00043728246,0.00035936444,0.11238773,0.006803166,0.873756,0.004132423,0.00004197607],"about_ca_topic_score_codex":0.0012777738,"about_ca_topic_score_gemma":0.0020484116,"teacher_disagreement_score":0.008729117,"about_ca_system_score_codex":0.00096274994,"about_ca_system_score_gemma":0.00049551565,"threshold_uncertainty_score":0.029201865},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7001936,0.0014903317,0.24454151,0.000841023,0.00027711404,0.00007544689,0.00045341565,0.00041305562,0.0517146],"genre_scores_gemma":[0.92965275,0.0011181592,0.042400718,0.00034365163,0.0003883006,0.00018315978,0.0008279781,0.00031588765,0.024769284],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984993,0.00032221677,0.00010180946,0.00030170268,0.0005481255,0.00022694794],"domain_scores_gemma":[0.9895335,0.0063681398,0.0012512959,0.0007691482,0.0010969265,0.0009808916],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013039074,0.0013329992,0.0016666442,0.00506541,0.0026493955,0.0043298076,0.0029444362,0.0018304687,0.0043467507],"category_scores_gemma":[0.010737954,0.0011118477,0.0013576846,0.0029279066,0.0035105473,0.0064725135,0.0034234654,0.0026899164,0.00086491223],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014393702,0.000053888223,0.00060892565,0.000084143125,0.000026521515,0.00038186793,0.000508369,0.0044838325,0.0049007945,0.9819886,0.00068502803,0.006134239],"study_design_scores_gemma":[0.000024972103,0.00005815077,0.0008516669,0.00006319481,0.000024435536,0.00058780564,0.00030842095,0.04088393,0.0034826617,0.9518695,0.001804102,0.000041221625],"about_ca_topic_score_codex":0.0019108878,"about_ca_topic_score_gemma":0.0010688254,"teacher_disagreement_score":0.00506541,"about_ca_system_score_codex":0.0019475977,"about_ca_system_score_gemma":0.0005204042,"threshold_uncertainty_score":0.014541328},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8154352,0.0028782052,0.0942228,0.003996038,0.00019678642,0.000046046203,0.00041034937,0.00016790048,0.08264679],"genre_scores_gemma":[0.9795218,0.0011982212,0.010876336,0.0002521373,0.00021873399,0.00004616196,0.00030280353,0.000043178825,0.007540672],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99930835,0.00022122929,0.00004486747,0.00014259547,0.00018197895,0.000100894445],"domain_scores_gemma":[0.9921572,0.005727693,0.0004657805,0.00050107914,0.0004903799,0.0006578507],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017243623,0.0005860433,0.00089794875,0.002851608,0.0018707375,0.0030185233,0.0014275128,0.0015254043,0.0050625317],"category_scores_gemma":[0.008511038,0.0006417441,0.00064476527,0.0018680334,0.005768918,0.010472129,0.0043471367,0.0029383444,0.00037733043],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000055445915,0.000033450684,0.0007755479,0.000060232767,0.000008748171,0.000084814084,0.0006091689,0.0008515274,0.0005902629,0.9921657,0.00044077597,0.0043243095],"study_design_scores_gemma":[0.00000782806,0.000012521068,0.00027786664,0.000014745154,0.0000044320545,0.000052245305,0.00018092513,0.0018073939,0.0002089599,0.9968232,0.0006056503,0.0000042362813],"about_ca_topic_score_codex":0.0010711745,"about_ca_topic_score_gemma":0.0010169477,"teacher_disagreement_score":0.0050625317,"about_ca_system_score_codex":0.0013361985,"about_ca_system_score_gemma":0.00052130874,"threshold_uncertainty_score":0.016935825},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14635585,0.0007152518,0.6865996,0.0018143384,0.000566758,0.0007311375,0.004364288,0.007130693,0.15172203],"genre_scores_gemma":[0.4700256,0.00090123195,0.43672058,0.0011105564,0.0003079234,0.001418016,0.012800462,0.0025961287,0.07411941],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9967865,0.0012183316,0.00019890955,0.00069616333,0.0005692692,0.0005307731],"domain_scores_gemma":[0.99448496,0.00213726,0.00050251867,0.0016212671,0.00081716717,0.0004367699],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018382557,0.0010426029,0.0010936434,0.0020487683,0.0029956887,0.0024575803,0.0021240655,0.0018000613,0.033797067],"category_scores_gemma":[0.013164137,0.0012634619,0.0014647662,0.004429812,0.0016512335,0.0066979127,0.0070447843,0.0019730944,0.0097202705],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005025376,0.0003018907,0.0029539124,0.00055359746,0.00011883826,0.0012491702,0.0018469534,0.021873761,0.009300652,0.7928229,0.027731754,0.1407441],"study_design_scores_gemma":[0.000054633958,0.000120244986,0.0011284596,0.00014308275,0.00011619918,0.00050495175,0.00054209726,0.07504077,0.006046298,0.84239185,0.073849246,0.00006223289],"about_ca_topic_score_codex":0.0021614898,"about_ca_topic_score_gemma":0.0033552055,"teacher_disagreement_score":0.033797067,"about_ca_system_score_codex":0.0016219537,"about_ca_system_score_gemma":0.001182763,"threshold_uncertainty_score":0.11306244},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6002835,0.006225819,0.10958894,0.025234155,0.0012725592,0.00014322094,0.0018983891,0.0007223829,0.25463107],"genre_scores_gemma":[0.9628739,0.00332779,0.013274099,0.0013609765,0.00087866466,0.00014648239,0.0012800539,0.00016842116,0.01668963],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984262,0.00040414624,0.00010941601,0.0003417736,0.0003506443,0.00036792253],"domain_scores_gemma":[0.9873876,0.008212005,0.0010594439,0.0013249011,0.0009515233,0.0010644809],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030169224,0.0006831983,0.0017594529,0.002590467,0.0037032973,0.00481365,0.0018608209,0.0030088238,0.010210413],"category_scores_gemma":[0.017700747,0.000772409,0.0012593552,0.0026171906,0.0065176566,0.015795795,0.0051308973,0.0041755605,0.0021142382],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012243846,0.000050199742,0.0011236292,0.00012130968,0.000014665911,0.0001251237,0.00039408918,0.0026634808,0.00033655987,0.98412216,0.005096543,0.005829718],"study_design_scores_gemma":[0.000017779652,0.000008273166,0.00018794295,0.00002697801,0.0000064368587,0.00008228869,0.00015736143,0.0035753117,0.000087255015,0.9940975,0.001742104,0.000010846978],"about_ca_topic_score_codex":0.0022490742,"about_ca_topic_score_gemma":0.0018452562,"teacher_disagreement_score":0.010210413,"about_ca_system_score_codex":0.0019986313,"about_ca_system_score_gemma":0.0011705016,"threshold_uncertainty_score":0.034157276},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7504642,0.0028546024,0.17967354,0.0029010011,0.00018964527,0.000050942836,0.0007060194,0.00044211702,0.06271795],"genre_scores_gemma":[0.9511446,0.0020326106,0.02993216,0.00039251568,0.00031139748,0.00012975433,0.00058507314,0.0002986059,0.015173495],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994128,0.000112364076,0.000021625976,0.00011692699,0.00019309207,0.00014316251],"domain_scores_gemma":[0.99673444,0.0020697857,0.00029421164,0.00032432427,0.00025267387,0.0003244898],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00085833896,0.0006974107,0.00056520966,0.002059453,0.0010444551,0.0021419423,0.0013271783,0.0007299592,0.005765361],"category_scores_gemma":[0.005996989,0.00046234918,0.00045376606,0.00195231,0.0021106426,0.0063249464,0.001964508,0.0016056509,0.00091720646],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018146822,0.00007530919,0.0030152474,0.00015258061,0.00004668087,0.0001291888,0.00043414798,0.011187559,0.0049529155,0.9413282,0.0046489458,0.03384776],"study_design_scores_gemma":[0.000022926239,0.000039317685,0.0015962565,0.0000369759,0.000041106734,0.00019752055,0.00017408501,0.035897747,0.0023604531,0.95347804,0.0061277836,0.000027821583],"about_ca_topic_score_codex":0.0014617103,"about_ca_topic_score_gemma":0.0013887818,"teacher_disagreement_score":0.005765361,"about_ca_system_score_codex":0.0013956391,"about_ca_system_score_gemma":0.00043133064,"threshold_uncertainty_score":0.01928699},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025887895,0.0010877817,0.5614155,0.011685766,0.0011843441,0.00012996656,0.0026178523,0.0016357109,0.39435515],"genre_scores_gemma":[0.70893353,0.0018455065,0.155721,0.005280287,0.0013926895,0.0005605967,0.0030595562,0.0018889834,0.12131784],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99844366,0.00039356976,0.00010389241,0.0003403669,0.0005090263,0.00020949509],"domain_scores_gemma":[0.99586725,0.002284797,0.0002617018,0.0005681836,0.00083681504,0.0001813568],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020481434,0.00061057834,0.00060380343,0.0019342335,0.0024098183,0.0045585,0.0013008589,0.0012883248,0.027517023],"category_scores_gemma":[0.0066335234,0.0005239914,0.0015336447,0.0011219756,0.004465655,0.00947668,0.0017772552,0.0051486986,0.0057192137],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000022153895,0.0000048273046,0.000029433866,0.000008433409,0.0000013135929,0.000011214629,0.000052524305,0.00007351756,0.00005377573,0.99548054,0.0031290052,0.0011530189],"study_design_scores_gemma":[0.0000042317743,0.000002378857,0.00005469331,0.000012185028,0.0000023859388,0.0000296417,0.00003004186,0.0010832251,0.00019882486,0.9896582,0.00891756,0.000006775886],"about_ca_topic_score_codex":0.002992644,"about_ca_topic_score_gemma":0.003925375,"teacher_disagreement_score":0.027517023,"about_ca_system_score_codex":0.002415187,"about_ca_system_score_gemma":0.0011802398,"threshold_uncertainty_score":0.09205359},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8610023,0.0012471166,0.10039117,0.0006746798,0.00006506565,0.000052202202,0.0012093269,0.00028478436,0.03507336],"genre_scores_gemma":[0.9628906,0.00039116293,0.030120129,0.00010231379,0.00007301521,0.00014356797,0.0008879166,0.00012697482,0.005264245],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99895334,0.00027285505,0.000062685,0.00019954583,0.0003241532,0.0001874853],"domain_scores_gemma":[0.9971162,0.0018056575,0.0002958829,0.00027485794,0.00018948935,0.00031792652],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00090297475,0.0007344458,0.0010469536,0.002870985,0.0021450142,0.002839111,0.0028736005,0.000692161,0.0054598935],"category_scores_gemma":[0.005291459,0.0007479456,0.00096820237,0.0019676697,0.003039099,0.0037692364,0.0022042748,0.0011181543,0.00065936765],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023562524,0.00008369265,0.0025207484,0.0002778868,0.000049168193,0.00018237041,0.00048457968,0.018028865,0.0043593626,0.9577091,0.0027824736,0.0132861985],"study_design_scores_gemma":[0.000037566326,0.000042067873,0.0017799992,0.00006215273,0.000030584342,0.00046798328,0.00026439063,0.078960754,0.0074345125,0.9069979,0.0038546002,0.000067508496],"about_ca_topic_score_codex":0.0017397054,"about_ca_topic_score_gemma":0.0019061919,"teacher_disagreement_score":0.0054598935,"about_ca_system_score_codex":0.0016740487,"about_ca_system_score_gemma":0.0007206395,"threshold_uncertainty_score":0.018265188},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4699522,0.0060437243,0.31595817,0.0042474153,0.0009347486,0.00017758028,0.0012146838,0.0013254851,0.20014593],"genre_scores_gemma":[0.93358606,0.002556567,0.044834577,0.000767244,0.0002769613,0.00022075007,0.0009072339,0.00030824984,0.01654221],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99880254,0.00014902206,0.00006102017,0.00038172284,0.00028511113,0.0003206098],"domain_scores_gemma":[0.9941286,0.003921485,0.000366663,0.00072087185,0.00033527173,0.0005271909],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00088799867,0.000952278,0.0008666385,0.0020734635,0.0014842199,0.0026622505,0.0022789966,0.0011949639,0.008657959],"category_scores_gemma":[0.0066113546,0.00067715195,0.0013428611,0.0015586102,0.0022847382,0.0057970965,0.002632291,0.004900255,0.0016851921],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003506466,0.00017693284,0.005030006,0.0007194056,0.00007206443,0.00066281034,0.00074718613,0.036880065,0.028380653,0.84191555,0.0145990895,0.07046561],"study_design_scores_gemma":[0.00003889679,0.00013059612,0.0037386527,0.00015046968,0.00009512893,0.0012468018,0.00025963027,0.079732925,0.022781007,0.86888254,0.022853214,0.00009013827],"about_ca_topic_score_codex":0.00085445715,"about_ca_topic_score_gemma":0.0011285336,"teacher_disagreement_score":0.008657959,"about_ca_system_score_codex":0.0014092858,"about_ca_system_score_gemma":0.0005618074,"threshold_uncertainty_score":0.028963745},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1893476,0.0063549997,0.7126157,0.0034868154,0.0011202547,0.00017059778,0.00066261203,0.0010889332,0.08515255],"genre_scores_gemma":[0.8255623,0.0025464133,0.15274975,0.0007723505,0.0012341761,0.00035553286,0.00050560985,0.0004741349,0.0157996],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983303,0.0005639603,0.00015723171,0.0003103758,0.00045135838,0.00018673419],"domain_scores_gemma":[0.99033165,0.0061239055,0.0006861307,0.0010331306,0.00089021615,0.00093488],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003017209,0.0017042811,0.002060193,0.01393465,0.0027830177,0.0076134386,0.0038841092,0.0022169456,0.006490108],"category_scores_gemma":[0.016851265,0.0011775857,0.001584793,0.0078001553,0.007239659,0.016347103,0.006232062,0.004337348,0.000893426],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016640277,0.000021338317,0.00033488683,0.00003832529,0.00000746617,0.000058493726,0.00029079075,0.00079120696,0.000240602,0.9910289,0.0009837911,0.0061875535],"study_design_scores_gemma":[0.000003344649,0.0000029834464,0.000054293076,0.000015526342,0.000005597698,0.000030176228,0.00005024882,0.0035293722,0.00009443647,0.99479115,0.0014166277,0.0000063503708],"about_ca_topic_score_codex":0.00148643,"about_ca_topic_score_gemma":0.0017378216,"teacher_disagreement_score":0.01393465,"about_ca_system_score_codex":0.002172305,"about_ca_system_score_gemma":0.0009965863,"threshold_uncertainty_score":0.021711588},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9800613,0.0003814666,0.011193519,0.0007941687,0.00001814714,0.0000068345303,0.000071934715,0.00004739094,0.007425233],"genre_scores_gemma":[0.99560297,0.00018101756,0.00260004,0.000041221097,0.000052744916,0.000016932452,0.00008103732,0.000019531317,0.0014044944],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99929667,0.0002214097,0.00003235731,0.00013322331,0.00016371379,0.00015258158],"domain_scores_gemma":[0.98886514,0.0072301626,0.0017325495,0.0009505211,0.0003538775,0.00086784374],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00096234406,0.00029399918,0.00037380756,0.0015114775,0.0013141205,0.002194622,0.0009406032,0.0009219991,0.002946419],"category_scores_gemma":[0.009536762,0.00028635186,0.00035465098,0.0008793703,0.003743037,0.004781862,0.0015495333,0.0012259422,0.00030887383],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026862524,0.000108983724,0.008524328,0.000079941594,0.000030017894,0.00025869283,0.00097054517,0.017507298,0.0061151036,0.9507717,0.00088378956,0.014480919],"study_design_scores_gemma":[0.000020074589,0.000043937976,0.0013006958,0.000013930574,0.000010288947,0.00008163595,0.00019670991,0.027147615,0.002352093,0.9677985,0.0010171289,0.000017387612],"about_ca_topic_score_codex":0.000822549,"about_ca_topic_score_gemma":0.0011352132,"teacher_disagreement_score":0.002946419,"about_ca_system_score_codex":0.0014068969,"about_ca_system_score_gemma":0.0006667535,"threshold_uncertainty_score":0.010207772},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.100252494,0.00081250165,0.8807533,0.00031220034,0.00014378043,0.00009416573,0.00021137782,0.00038147633,0.017038744],"genre_scores_gemma":[0.7271965,0.00084932055,0.2569609,0.00038089033,0.00028023528,0.00028963428,0.00049161434,0.0002429088,0.013308015],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991246,0.00029990159,0.000031487183,0.0001486054,0.0002906962,0.00010468657],"domain_scores_gemma":[0.99774903,0.0010250859,0.00013979961,0.0005045423,0.00038665385,0.00019488917],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012808912,0.0005911644,0.0007508751,0.0025393905,0.0005182405,0.0011855841,0.0014758573,0.00059784285,0.0054273754],"category_scores_gemma":[0.0060165967,0.0003518184,0.0006622346,0.0018525099,0.0014177143,0.0018208347,0.001695377,0.0018161028,0.00082725624],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020890035,0.00009776827,0.0015731624,0.00016590882,0.00007321821,0.00012346958,0.00017972136,0.09309384,0.008751839,0.75999904,0.00456167,0.13117142],"study_design_scores_gemma":[0.00003832567,0.000088650435,0.00089340063,0.000051688632,0.000025406864,0.00014678958,0.000041759406,0.57203746,0.0041985367,0.4125903,0.009855075,0.000032660853],"about_ca_topic_score_codex":0.0009982336,"about_ca_topic_score_gemma":0.0011728901,"teacher_disagreement_score":0.0054273754,"about_ca_system_score_codex":0.00090732233,"about_ca_system_score_gemma":0.00050646643,"threshold_uncertainty_score":0.01815641},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5329194,0.0020861381,0.27501076,0.005099014,0.0002758958,0.00014549326,0.0019785282,0.0026296317,0.17985511],"genre_scores_gemma":[0.90641576,0.0011320933,0.044295676,0.0010496555,0.00033760484,0.00022674257,0.0016190249,0.0009989411,0.04392448],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982638,0.00026262042,0.000051257284,0.00057766575,0.0005002126,0.00034453708],"domain_scores_gemma":[0.9896291,0.0062220567,0.00090141676,0.0014454483,0.0010291068,0.0007728557],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00086505443,0.0010410537,0.0009492655,0.0014821106,0.0021383313,0.0037211766,0.0027616576,0.0019667316,0.017033482],"category_scores_gemma":[0.008548371,0.00096958794,0.0009961625,0.0017192332,0.0044077523,0.006170012,0.0023422174,0.004119373,0.0033235224],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019647513,0.000057601133,0.0016535076,0.00020528631,0.000032360218,0.00023476945,0.0005381835,0.013870427,0.0066858833,0.9606368,0.005835122,0.010053536],"study_design_scores_gemma":[0.000055643493,0.000056038047,0.0012141278,0.00004088832,0.000032975036,0.0003057583,0.00014123264,0.034622915,0.0024294602,0.95102304,0.010031616,0.00004633249],"about_ca_topic_score_codex":0.004558407,"about_ca_topic_score_gemma":0.0067424765,"teacher_disagreement_score":0.017033482,"about_ca_system_score_codex":0.0030724795,"about_ca_system_score_gemma":0.0011434638,"threshold_uncertainty_score":0.056982696},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48666278,0.0011166264,0.48744813,0.0010457771,0.00017806946,0.00014717312,0.00023401498,0.00038992442,0.022777539],"genre_scores_gemma":[0.9225587,0.00084771315,0.065334596,0.00020597014,0.00016653664,0.00029202708,0.00018035657,0.00022426095,0.010189807],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987827,0.00043168044,0.00007134063,0.00020997094,0.00037714117,0.0001271007],"domain_scores_gemma":[0.9957632,0.0025756697,0.00043101038,0.0005913752,0.00029984533,0.00033890942],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013294682,0.00074274215,0.0007712256,0.001085483,0.00084478804,0.0015338449,0.001016395,0.0008981888,0.004501063],"category_scores_gemma":[0.009699238,0.00033613064,0.0005813016,0.0011828701,0.0016483158,0.003322485,0.0024956628,0.0012253119,0.0005722471],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003758088,0.0001293549,0.0014449105,0.00019852367,0.00004722137,0.000577225,0.0006044986,0.24332182,0.01897932,0.6908252,0.0023028634,0.041193135],"study_design_scores_gemma":[0.00003956787,0.00015418416,0.0006909488,0.000027239945,0.000008760229,0.0003276035,0.00020975785,0.59678006,0.0044096317,0.39402494,0.0032995027,0.000027773813],"about_ca_topic_score_codex":0.0007174764,"about_ca_topic_score_gemma":0.000353102,"teacher_disagreement_score":0.004501063,"about_ca_system_score_codex":0.0013850181,"about_ca_system_score_gemma":0.00052106875,"threshold_uncertainty_score":0.015057623},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7434441,0.0014244573,0.23490366,0.0022644026,0.0002815635,0.0002453516,0.0005982614,0.0013740138,0.015464256],"genre_scores_gemma":[0.959006,0.0003978344,0.03507428,0.00074578304,0.00013123816,0.00017391272,0.00062212837,0.00017994466,0.0036688654],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9962095,0.0014335259,0.00016776352,0.0010978843,0.00054236467,0.00054892455],"domain_scores_gemma":[0.9749697,0.0146665145,0.0027078574,0.0046029254,0.0012250188,0.0018280636],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0044130622,0.0012628452,0.0016926515,0.0014543316,0.0019170109,0.0026592328,0.002884627,0.0019493604,0.005798847],"category_scores_gemma":[0.035385944,0.0018560198,0.0016873425,0.0009091682,0.0039658137,0.008437504,0.0057030893,0.0034271863,0.0016463852],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0029056617,0.00028157711,0.0156106325,0.0006488279,0.0003206416,0.0012836886,0.0021458205,0.07690967,0.016342416,0.82456666,0.01291237,0.046072017],"study_design_scores_gemma":[0.00032284675,0.00056535495,0.003507894,0.0001846859,0.00019363132,0.0012291997,0.0005643326,0.39226794,0.012956822,0.58249784,0.005536898,0.00017261751],"about_ca_topic_score_codex":0.0015549214,"about_ca_topic_score_gemma":0.0014163704,"teacher_disagreement_score":0.005798847,"about_ca_system_score_codex":0.0012344656,"about_ca_system_score_gemma":0.0007927317,"threshold_uncertainty_score":0.023338795},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7247537,0.00078522647,0.23802222,0.0008950566,0.00004435559,0.000121061246,0.00023485148,0.00026221023,0.03488138],"genre_scores_gemma":[0.9654867,0.00040171135,0.028060744,0.00020182467,0.0000463264,0.00013424666,0.00018657367,0.000042087126,0.005439733],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99944216,0.00014943368,0.000027827602,0.0001109705,0.00016784882,0.00010165624],"domain_scores_gemma":[0.9961545,0.0023769264,0.00047037317,0.00017132101,0.00041246312,0.0004144263],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006161938,0.00037162963,0.00044773988,0.0012417614,0.0010531252,0.0010067726,0.00087579014,0.0007423773,0.0031696004],"category_scores_gemma":[0.004370423,0.00045263694,0.00026269627,0.000851609,0.0021565864,0.0016545053,0.0014358192,0.00095591776,0.00027194893],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000040580297,0.000021395372,0.00091382995,0.00008417459,0.000015418445,0.0005664372,0.0005072794,0.012731167,0.005921723,0.97102314,0.0010269431,0.0071478803],"study_design_scores_gemma":[0.00003114063,0.000027418942,0.00055268174,0.00002542931,0.000012240685,0.00024877355,0.00022312446,0.04953808,0.0020668928,0.9434973,0.0037601232,0.00001673957],"about_ca_topic_score_codex":0.0019484996,"about_ca_topic_score_gemma":0.0025754806,"teacher_disagreement_score":0.0031696004,"about_ca_system_score_codex":0.0007751118,"about_ca_system_score_gemma":0.0005956213,"threshold_uncertainty_score":0.010603368},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8808312,0.0006499255,0.07174901,0.00042647065,0.00004677795,0.000020108013,0.00015503608,0.00013501356,0.045986544],"genre_scores_gemma":[0.99141777,0.0002075485,0.0053802268,0.000043965574,0.000054103806,0.000011609978,0.00009434368,0.000013118243,0.0027772808],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99966586,0.00006156847,0.000018237759,0.00008213683,0.0001031853,0.00006896585],"domain_scores_gemma":[0.99883646,0.00045965795,0.00023470225,0.000096605414,0.00014635068,0.00022624865],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003762365,0.0002871704,0.00026705037,0.0016629321,0.0007786998,0.001580198,0.0004776332,0.000418717,0.0026777785],"category_scores_gemma":[0.001383817,0.00021971714,0.00025791442,0.00087872584,0.0013714442,0.0025825251,0.0011603567,0.00079414295,0.00021373018],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023071021,0.000014306966,0.000831098,0.000017478797,0.0000058279743,0.00013865088,0.00028220032,0.0012984341,0.001986191,0.9909094,0.00032155775,0.0041717226],"study_design_scores_gemma":[0.000007478732,0.000016307937,0.0009471936,0.000013424808,0.000011584348,0.0002652651,0.00025851058,0.01473466,0.0018240386,0.97854555,0.0033663542,0.000009589457],"about_ca_topic_score_codex":0.00059956097,"about_ca_topic_score_gemma":0.00091615523,"teacher_disagreement_score":0.0026777785,"about_ca_system_score_codex":0.00080545445,"about_ca_system_score_gemma":0.00024010682,"threshold_uncertainty_score":0.008958042},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.71682256,0.0014832389,0.2374472,0.0049940394,0.00017539211,0.00012197979,0.0008815658,0.0013801357,0.03669382],"genre_scores_gemma":[0.98230237,0.00048991584,0.010956837,0.0004610819,0.00013015798,0.0001074234,0.00030303645,0.00020813332,0.0050410004],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986541,0.00030891114,0.000038550035,0.000567302,0.00022605511,0.00020501838],"domain_scores_gemma":[0.98116755,0.011848464,0.0024252152,0.0021118172,0.0011601329,0.0012867146],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017065948,0.00063651905,0.0011377523,0.0012491703,0.0013110883,0.0021571273,0.0016278636,0.0013256605,0.004795078],"category_scores_gemma":[0.020520782,0.00064137485,0.001211487,0.00082298607,0.0034138625,0.0043548313,0.00236512,0.0024583952,0.0007458381],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004691586,0.00013345935,0.007915988,0.0008044025,0.00016553164,0.0011875997,0.0013211898,0.03569325,0.023307223,0.9025699,0.008349372,0.018082965],"study_design_scores_gemma":[0.00008016049,0.00012000293,0.0048836726,0.00009206333,0.00009295225,0.0014989964,0.0003252877,0.19267417,0.008835367,0.7864014,0.004922896,0.00007296463],"about_ca_topic_score_codex":0.0019149429,"about_ca_topic_score_gemma":0.0018567955,"teacher_disagreement_score":0.004795078,"about_ca_system_score_codex":0.0018052737,"about_ca_system_score_gemma":0.0009805163,"threshold_uncertainty_score":0.0160411},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42279,0.0012102157,0.531363,0.0022840933,0.00011350508,0.000115366,0.0008283182,0.00074613426,0.04054933],"genre_scores_gemma":[0.8915528,0.0010924296,0.09365148,0.0005680074,0.00021390193,0.00038840293,0.0010031704,0.00021123275,0.011318494],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983317,0.00050046947,0.00008764489,0.00045687796,0.00041528535,0.00020812414],"domain_scores_gemma":[0.9782929,0.01586845,0.001237057,0.002277365,0.0012375031,0.0010867974],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019897881,0.0006215519,0.0008493496,0.0021947643,0.0012715032,0.0029771733,0.0025510555,0.001523544,0.005868058],"category_scores_gemma":[0.032113116,0.0007818405,0.00082746823,0.0017108603,0.0024808259,0.007484614,0.0027321086,0.0022909313,0.000818782],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017322472,0.00009798254,0.008526269,0.00032052366,0.00005220256,0.00026355818,0.00062300055,0.031470653,0.005473892,0.90936774,0.0059919325,0.03763898],"study_design_scores_gemma":[0.000023118015,0.000046939178,0.0015209279,0.000067769266,0.000030450135,0.0004893771,0.0001260194,0.1778888,0.0026365295,0.8136363,0.0035086754,0.000025130767],"about_ca_topic_score_codex":0.00095782767,"about_ca_topic_score_gemma":0.0017245724,"teacher_disagreement_score":0.005868058,"about_ca_system_score_codex":0.0022317022,"about_ca_system_score_gemma":0.00081204425,"threshold_uncertainty_score":0.019630551},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5523868,0.0019075224,0.23303202,0.002075128,0.00044365585,0.000062751045,0.00033300475,0.00060457346,0.20915449],"genre_scores_gemma":[0.97804505,0.00039144018,0.008542049,0.00021876943,0.00033071623,0.000048362086,0.00014071682,0.00010438196,0.01217845],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982168,0.00041760443,0.00010545561,0.00031186017,0.000687876,0.00026034584],"domain_scores_gemma":[0.9973017,0.0013395308,0.00021325106,0.00028843072,0.00058875786,0.00026831374],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012732787,0.0005661141,0.00083402666,0.0035692863,0.0020558224,0.0029121826,0.0008098454,0.00054743496,0.008434963],"category_scores_gemma":[0.004802434,0.00038898856,0.0006731568,0.0012959599,0.002918159,0.0066265017,0.003964832,0.0020451234,0.001162607],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024159346,0.000008936529,0.00030853384,0.000045409633,0.000007471658,0.000060385555,0.00029432224,0.0005808211,0.0011367139,0.9929518,0.00071319885,0.0038682008],"study_design_scores_gemma":[0.0000043403215,0.000017444732,0.00038314983,0.000019658528,0.000015325912,0.0001381167,0.0001306086,0.004669395,0.002242125,0.9880129,0.0043540397,0.000012820431],"about_ca_topic_score_codex":0.00044272337,"about_ca_topic_score_gemma":0.00042060608,"teacher_disagreement_score":0.008434963,"about_ca_system_score_codex":0.0011152086,"about_ca_system_score_gemma":0.00031283198,"threshold_uncertainty_score":0.028217733},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.74199164,0.0017149942,0.14323595,0.0011894001,0.00009972948,0.000073231124,0.0007884783,0.00036448246,0.11054221],"genre_scores_gemma":[0.96886337,0.00068399316,0.02064056,0.00018141704,0.00008051346,0.000097076096,0.00045089592,0.000093678245,0.008908604],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992999,0.0001695708,0.00003783001,0.00016529554,0.00019522339,0.00013209235],"domain_scores_gemma":[0.99628997,0.0019806013,0.00047046834,0.0004359345,0.0004324529,0.0003906745],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005322103,0.0004529756,0.0005880279,0.0018350459,0.0013120838,0.0020774167,0.0010358652,0.0007741082,0.006660298],"category_scores_gemma":[0.0052340454,0.0005484314,0.00048048134,0.0014731342,0.0016180883,0.0033572835,0.001448385,0.00096579216,0.00066543714],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014159967,0.000026735635,0.0010182748,0.00011074375,0.000019467549,0.00021511521,0.00038886987,0.007663184,0.0049566724,0.97047555,0.0021991828,0.012784756],"study_design_scores_gemma":[0.000018603569,0.000021635866,0.0004765541,0.00002369862,0.000012430584,0.00038715597,0.00016438749,0.015999889,0.0026929276,0.975868,0.004321101,0.000013702125],"about_ca_topic_score_codex":0.0011579831,"about_ca_topic_score_gemma":0.0015684927,"teacher_disagreement_score":0.006660298,"about_ca_system_score_codex":0.0007167288,"about_ca_system_score_gemma":0.0004117829,"threshold_uncertainty_score":0.022280991},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8967598,0.0009559617,0.05830287,0.00089017866,0.000054780816,0.000044269582,0.00036258998,0.0002334266,0.04239619],"genre_scores_gemma":[0.9870422,0.00030134892,0.008980146,0.000091678456,0.000056836405,0.000054507345,0.00027048032,0.000038267335,0.003164516],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99941814,0.00007526647,0.00003084129,0.00013121699,0.00019724584,0.00014729843],"domain_scores_gemma":[0.9968238,0.0015088407,0.00047214876,0.00024778058,0.00023662111,0.0007109314],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005683903,0.00045595504,0.0004891556,0.0018028256,0.001045737,0.0024686605,0.000951121,0.0007002038,0.0054002423],"category_scores_gemma":[0.004644852,0.0005325812,0.00034509195,0.0010092234,0.0020392227,0.0032637164,0.0019123318,0.0011144069,0.00048162974],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00032964977,0.00008362703,0.0052548405,0.0002446154,0.000026954684,0.00030618947,0.0008558447,0.011993971,0.018963326,0.94159913,0.0037299697,0.01661175],"study_design_scores_gemma":[0.000064721,0.00010386936,0.0031064677,0.000075822405,0.000035029163,0.0008020147,0.00044608096,0.07279463,0.019584209,0.8938837,0.009062746,0.000040723295],"about_ca_topic_score_codex":0.00090310216,"about_ca_topic_score_gemma":0.0009597135,"teacher_disagreement_score":0.0054002423,"about_ca_system_score_codex":0.0014494109,"about_ca_system_score_gemma":0.0003622216,"threshold_uncertainty_score":0.018065631},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23566808,0.0029373139,0.5752477,0.0028152466,0.0006461009,0.000261281,0.0012679016,0.0009333473,0.18022308],"genre_scores_gemma":[0.78461814,0.004402093,0.15592405,0.0017711511,0.00068727595,0.0005176608,0.0028780485,0.0005603202,0.04864127],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983359,0.00046873835,0.00008845338,0.00038616153,0.00044988754,0.0002709181],"domain_scores_gemma":[0.9901669,0.006592524,0.0006872726,0.0011267879,0.00074886327,0.0006776651],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010724039,0.00088402664,0.0011223102,0.0023371775,0.0018543811,0.0023264042,0.0018056004,0.001487341,0.013842236],"category_scores_gemma":[0.012207758,0.0007678589,0.0011515789,0.0031827074,0.0021673765,0.006119262,0.0037517194,0.0026924668,0.0022454872],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009589486,0.000043910568,0.00089958304,0.00019660124,0.000020169438,0.00032673773,0.0005379755,0.014167086,0.0015082762,0.9506037,0.0055842106,0.026015965],"study_design_scores_gemma":[0.00003519509,0.000027666469,0.0003166779,0.000057370773,0.000016889995,0.00021034667,0.000111723646,0.04631187,0.0006035063,0.9397675,0.012524407,0.000016771219],"about_ca_topic_score_codex":0.0048661977,"about_ca_topic_score_gemma":0.0065393364,"teacher_disagreement_score":0.013842236,"about_ca_system_score_codex":0.0019823536,"about_ca_system_score_gemma":0.00071754376,"threshold_uncertainty_score":0.04630685},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6501152,0.0033140474,0.22347192,0.01617182,0.0004138026,0.00015432702,0.0016207843,0.002455111,0.10228293],"genre_scores_gemma":[0.9747515,0.0006010835,0.01498475,0.001369845,0.0004272132,0.00026549274,0.000497171,0.0003220785,0.006780808],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99733526,0.00062130945,0.00012289773,0.00080394675,0.00065703446,0.00045954174],"domain_scores_gemma":[0.9769313,0.015222282,0.0013940552,0.002796924,0.001148286,0.00250723],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003182892,0.00042161572,0.0012618538,0.0023681847,0.0027893225,0.005337519,0.0018588896,0.002431018,0.008172377],"category_scores_gemma":[0.03259899,0.000716613,0.0010447308,0.0012037938,0.0059736636,0.011442991,0.004204567,0.004155417,0.0012059618],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013279352,0.000040104016,0.0017689567,0.00008881839,0.000014666885,0.00010687654,0.00043985702,0.002950033,0.0014512278,0.98344064,0.004173022,0.0053929375],"study_design_scores_gemma":[0.000028823917,0.000028078986,0.0008130494,0.000040899984,0.00001472016,0.00022209626,0.00011267223,0.028315984,0.0011376697,0.9663893,0.0028717967,0.000024878453],"about_ca_topic_score_codex":0.0014484932,"about_ca_topic_score_gemma":0.00093390705,"teacher_disagreement_score":0.008172377,"about_ca_system_score_codex":0.002685762,"about_ca_system_score_gemma":0.0009648725,"threshold_uncertainty_score":0.02733928},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29905552,0.0011674289,0.6677644,0.0016803938,0.00010756238,0.00006372635,0.00018895311,0.00022221162,0.029749798],"genre_scores_gemma":[0.90738124,0.001135796,0.07913379,0.00035010773,0.00026788557,0.00015682414,0.00026863415,0.00013530282,0.011170312],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99914396,0.0002708301,0.000035357833,0.00016433773,0.00021440162,0.00017104823],"domain_scores_gemma":[0.9971334,0.0017086162,0.00034360026,0.0002702307,0.00023957215,0.0003045558],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016371642,0.000683951,0.00070764945,0.001572797,0.0009441912,0.0015149473,0.00093863276,0.0009801306,0.004287263],"category_scores_gemma":[0.006454227,0.00057753717,0.0007457948,0.00089874014,0.002712179,0.0028988915,0.0018222365,0.0016118668,0.0004623805],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022655859,0.000024565417,0.00040857392,0.000054807915,0.000009375688,0.00006709541,0.00018670899,0.012205083,0.0019933982,0.97859097,0.0009789198,0.0054577845],"study_design_scores_gemma":[0.00001334413,0.000021486145,0.0003181119,0.000021602065,0.0000068840136,0.00008156781,0.00017342153,0.09044727,0.0009231849,0.9068188,0.0011594554,0.000014786983],"about_ca_topic_score_codex":0.0010771917,"about_ca_topic_score_gemma":0.0008888503,"teacher_disagreement_score":0.004287263,"about_ca_system_score_codex":0.0011469371,"about_ca_system_score_gemma":0.00045346332,"threshold_uncertainty_score":0.014342368},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.53870726,0.0010412183,0.4170837,0.0018313256,0.0000537896,0.00007028921,0.0009552,0.0007561801,0.039501037],"genre_scores_gemma":[0.97530043,0.0004917707,0.01946406,0.00024768375,0.00014613789,0.00015454857,0.00041258312,0.00012992245,0.003652768],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99612266,0.0012106242,0.00018905175,0.0008828342,0.0011464792,0.00044831945],"domain_scores_gemma":[0.9582676,0.031120203,0.0030729854,0.0030552598,0.0024030618,0.0020808491],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027121296,0.00060300983,0.0011759945,0.0026043085,0.0019791657,0.004152535,0.001723746,0.0010034693,0.0038785418],"category_scores_gemma":[0.02351767,0.0012189111,0.0013572004,0.0016464369,0.006589968,0.008006947,0.0027945775,0.00348195,0.00046545084],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000082615894,0.00004555422,0.0019372614,0.00008235779,0.000038893384,0.00014642418,0.0005393255,0.0051676244,0.0017611231,0.98359144,0.00090302626,0.0057042465],"study_design_scores_gemma":[0.000018249511,0.000015361213,0.0011500645,0.000024178657,0.000018245715,0.00024946444,0.00011746402,0.025895208,0.0010966494,0.9702459,0.0011427221,0.000026433274],"about_ca_topic_score_codex":0.0022481808,"about_ca_topic_score_gemma":0.001464239,"teacher_disagreement_score":0.004152535,"about_ca_system_score_codex":0.00213802,"about_ca_system_score_gemma":0.0008271435,"threshold_uncertainty_score":0.015512466},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11000999,0.016759662,0.4638306,0.024745319,0.002850458,0.00027710575,0.0026844568,0.0024418514,0.37640065],"genre_scores_gemma":[0.7798715,0.010049776,0.118048854,0.0048024035,0.006394491,0.000719771,0.0027917149,0.002252368,0.07506909],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99362683,0.00091911264,0.00017401908,0.0018207806,0.0019565034,0.0015026871],"domain_scores_gemma":[0.9718502,0.018617278,0.0017514842,0.0032503235,0.002382866,0.0021478308],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003912405,0.0029160092,0.0018971781,0.0058816597,0.0035356025,0.005886373,0.005558284,0.0024319722,0.031455755],"category_scores_gemma":[0.028352493,0.001659541,0.0024450377,0.0058968714,0.007550542,0.021054462,0.00886731,0.016837563,0.0070695635],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00066393137,0.0003040079,0.0025744408,0.0005144545,0.000083762985,0.00024314046,0.0007685157,0.022188071,0.0073135076,0.8679907,0.031227635,0.0661278],"study_design_scores_gemma":[0.00008282632,0.000108835055,0.0020025678,0.00018515569,0.00010012643,0.00031941547,0.00023975738,0.06917685,0.0041382527,0.8937558,0.029765023,0.00012540344],"about_ca_topic_score_codex":0.00576541,"about_ca_topic_score_gemma":0.009968378,"teacher_disagreement_score":0.031455755,"about_ca_system_score_codex":0.007932274,"about_ca_system_score_gemma":0.0023400947,"threshold_uncertainty_score":0.105229974},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7136372,0.0011494233,0.25180286,0.0016884282,0.00015315255,0.00014656084,0.00035298042,0.00086905545,0.030200494],"genre_scores_gemma":[0.96485937,0.00047683192,0.023657344,0.00035509153,0.0001133981,0.00010813353,0.00024471505,0.00023319341,0.009951952],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99791557,0.00092057604,0.00003883702,0.0003669832,0.00037935682,0.00037871304],"domain_scores_gemma":[0.98911345,0.0066830735,0.0013625904,0.0012129229,0.00076302205,0.0008649356],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012558422,0.0005613169,0.00081778126,0.0011735383,0.0015057147,0.002449057,0.0025111695,0.0015729467,0.0072148037],"category_scores_gemma":[0.013610077,0.00060023053,0.00064819347,0.0010365923,0.0027944364,0.004322672,0.0018553019,0.0016397663,0.0009992875],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008932731,0.00020271023,0.006459963,0.0003363252,0.000083314066,0.0005323338,0.00075002905,0.1032497,0.0191833,0.82453305,0.009319292,0.034456715],"study_design_scores_gemma":[0.0001077199,0.00015082097,0.002048235,0.00006507083,0.00004340538,0.0005220151,0.0002016982,0.6031773,0.009064461,0.3781547,0.006384911,0.00007962304],"about_ca_topic_score_codex":0.0018553319,"about_ca_topic_score_gemma":0.0019173666,"teacher_disagreement_score":0.0072148037,"about_ca_system_score_codex":0.0023942557,"about_ca_system_score_gemma":0.0005354862,"threshold_uncertainty_score":0.024135947},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.733561,0.00071768917,0.2343143,0.0017133557,0.00006654478,0.000102860366,0.00057439995,0.00036715422,0.028582778],"genre_scores_gemma":[0.98956794,0.00023951205,0.00830349,0.00015480322,0.00009613948,0.000073968324,0.00021671236,0.00004757825,0.0012998502],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988881,0.00035382592,0.00005771501,0.00025639535,0.00024210544,0.00020186635],"domain_scores_gemma":[0.9893881,0.0058110524,0.001964853,0.000903962,0.0008188292,0.0011131506],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015532492,0.00048162974,0.00068748614,0.0026827967,0.0010319346,0.0018491872,0.0016935904,0.0013159717,0.0034889122],"category_scores_gemma":[0.014261702,0.0004732849,0.00066430453,0.0009769878,0.002287627,0.0046081217,0.0020407778,0.001495488,0.00032010075],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007240599,0.000040310766,0.0031920925,0.000075608135,0.000018256229,0.00036742436,0.0003525293,0.016189246,0.003583082,0.9722353,0.001296308,0.0025773474],"study_design_scores_gemma":[0.000037264006,0.0000674394,0.0040184646,0.00003535893,0.000029161758,0.00056679756,0.00018767142,0.1614041,0.0018770098,0.82983947,0.0019016,0.00003561682],"about_ca_topic_score_codex":0.0011973002,"about_ca_topic_score_gemma":0.0012179571,"teacher_disagreement_score":0.0034889122,"about_ca_system_score_codex":0.0012807656,"about_ca_system_score_gemma":0.0003056664,"threshold_uncertainty_score":0.011671543},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.92881626,0.0005540383,0.040593624,0.0004905365,0.000039914823,0.000024915702,0.0001477799,0.00011117173,0.029221773],"genre_scores_gemma":[0.9864922,0.00021693109,0.007615895,0.000086071756,0.00004546273,0.000029425535,0.00012394403,0.000024042272,0.0053660604],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99963164,0.00006887778,0.000018583994,0.00008263024,0.000099888624,0.00009838024],"domain_scores_gemma":[0.9987815,0.000655437,0.0001808085,0.000097763965,0.00008870883,0.00019577655],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033017667,0.00034910164,0.00034742992,0.0008580041,0.0007074111,0.0017234243,0.0005585856,0.00049768714,0.0036081239],"category_scores_gemma":[0.0019928168,0.00035092185,0.0002712151,0.0005766736,0.0013398496,0.0027843586,0.0016645058,0.0009527698,0.00031609167],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012734575,0.000031265026,0.0014886147,0.00009847032,0.000008781703,0.00022859081,0.00050967454,0.002715027,0.006738447,0.97906256,0.00092389295,0.008067246],"study_design_scores_gemma":[0.000046206347,0.0000629827,0.0012151033,0.0000320087,0.000021726772,0.0004600251,0.00029585106,0.025452973,0.0071734055,0.9581459,0.007078821,0.000014954096],"about_ca_topic_score_codex":0.00055286137,"about_ca_topic_score_gemma":0.00079408963,"teacher_disagreement_score":0.0036081239,"about_ca_system_score_codex":0.00084764976,"about_ca_system_score_gemma":0.00020171568,"threshold_uncertainty_score":0.012070417},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2890477,0.0046354085,0.49617252,0.0037373137,0.0010008484,0.00008838307,0.000614434,0.000887067,0.20381641],"genre_scores_gemma":[0.92721766,0.0018361856,0.045974687,0.000743406,0.00049587106,0.00008961507,0.00027366303,0.00020239374,0.02316646],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99847156,0.00045423815,0.000079757054,0.00025427144,0.00050472136,0.00023545908],"domain_scores_gemma":[0.99502486,0.0028484182,0.0005259666,0.0006841878,0.0005698282,0.00034670767],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003071761,0.0006543881,0.0007273455,0.0027027002,0.0017204062,0.0023140493,0.0017182006,0.0013034758,0.008763193],"category_scores_gemma":[0.008364859,0.0005072148,0.0013155093,0.00162163,0.00404546,0.009391787,0.003478183,0.003164909,0.0012403115],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008738027,0.000004627592,0.0001869554,0.000024327916,0.0000045208594,0.000056209512,0.000121506484,0.0004296074,0.00033184068,0.9959818,0.0007486547,0.0021012938],"study_design_scores_gemma":[0.000007768426,0.000024286115,0.0002465635,0.000018811113,0.000014155796,0.00019667599,0.000098997654,0.0031537109,0.0011206217,0.9895955,0.005511858,0.0000111234485],"about_ca_topic_score_codex":0.00060682796,"about_ca_topic_score_gemma":0.0005099499,"teacher_disagreement_score":0.008763193,"about_ca_system_score_codex":0.001579846,"about_ca_system_score_gemma":0.00044574265,"threshold_uncertainty_score":0.02931583},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14991455,0.0055688093,0.6787244,0.004818631,0.0006505914,0.00017075807,0.0011735768,0.001314538,0.15766409],"genre_scores_gemma":[0.7673604,0.005340847,0.17425996,0.0022223424,0.0017489048,0.00044477798,0.0018837638,0.0014964419,0.045242567],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9954802,0.001018526,0.00022503019,0.0011914029,0.0015549443,0.0005299582],"domain_scores_gemma":[0.99108803,0.005839898,0.000817024,0.00085061544,0.00085496,0.0005495675],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030567877,0.0017306514,0.0013873541,0.0030907202,0.0021113208,0.004718658,0.0018680639,0.0018172078,0.014895605],"category_scores_gemma":[0.015157625,0.0011818142,0.0016482233,0.003414109,0.004598539,0.014642311,0.0049992995,0.0057308227,0.0033159303],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000934439,0.000027590373,0.00032351195,0.00016003978,0.00002052692,0.000075395765,0.00024091722,0.0034656364,0.0016633777,0.9752763,0.0031796964,0.01547364],"study_design_scores_gemma":[0.000012813169,0.000041093626,0.00017340542,0.000042240194,0.000020751328,0.00016137719,0.00006257419,0.010753745,0.0021739742,0.9777499,0.008792689,0.00001535662],"about_ca_topic_score_codex":0.0008010108,"about_ca_topic_score_gemma":0.00062254164,"teacher_disagreement_score":0.014895605,"about_ca_system_score_codex":0.0020278292,"about_ca_system_score_gemma":0.00082935253,"threshold_uncertainty_score":0.049830794},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.72668964,0.0044013946,0.24019632,0.0029292614,0.00010359067,0.000157222,0.00068915414,0.0003726419,0.024460778],"genre_scores_gemma":[0.9628334,0.0018405109,0.028295804,0.00028600977,0.00017234101,0.00026792596,0.000546137,0.00012440063,0.0056334],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99870086,0.0005376492,0.000061457904,0.00026965793,0.0002684051,0.00016202027],"domain_scores_gemma":[0.99149525,0.0047532097,0.0013530378,0.00071846135,0.00066941977,0.0010106364],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001987045,0.0007237983,0.0010474594,0.0036958228,0.0017604731,0.0021508264,0.001608808,0.0016655901,0.0034812072],"category_scores_gemma":[0.016521342,0.000811039,0.0010516129,0.0020365384,0.0038899065,0.0047348607,0.0025562674,0.0015931907,0.00043076172],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006223687,0.000024036179,0.0016197128,0.00008800223,0.000026778569,0.00014255702,0.00035922736,0.016796665,0.0009359899,0.97230667,0.0013637313,0.0062744054],"study_design_scores_gemma":[0.000020198278,0.000025370826,0.0007436724,0.000028113705,0.000008470255,0.000175419,0.00007948283,0.060288925,0.00031722078,0.9362796,0.0020153408,0.000018151124],"about_ca_topic_score_codex":0.0019460004,"about_ca_topic_score_gemma":0.0014575807,"teacher_disagreement_score":0.0036958228,"about_ca_system_score_codex":0.0025894048,"about_ca_system_score_gemma":0.00066602184,"threshold_uncertainty_score":0.018787563},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9106143,0.0034277434,0.059507705,0.0018109545,0.00010436359,0.000060874634,0.00020587005,0.00026043208,0.024007851],"genre_scores_gemma":[0.97940505,0.0019181679,0.014386871,0.0001880634,0.00010109697,0.00010979563,0.0001568231,0.00006718537,0.0036668642],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996141,0.00009362836,0.000013707705,0.000094002164,0.000082811566,0.00010170632],"domain_scores_gemma":[0.99644727,0.0024427339,0.00033736063,0.00020202438,0.00022961192,0.00034099276],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006123226,0.00084118306,0.00056173006,0.002402045,0.0014081071,0.0017364962,0.0012040822,0.0012139393,0.0018122274],"category_scores_gemma":[0.0075983796,0.0005167491,0.0006873132,0.0013672151,0.002219584,0.0027500337,0.0016641208,0.0010587616,0.00026015716],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002612928,0.00008707455,0.0045386963,0.0003025643,0.00006540736,0.00080606516,0.00085092237,0.043400314,0.013555453,0.9081979,0.0033874607,0.024546903],"study_design_scores_gemma":[0.00003971277,0.000082468,0.0012409601,0.00007765533,0.000045711382,0.00053561234,0.00019351956,0.07036781,0.0037162064,0.91964287,0.004026027,0.000031533047],"about_ca_topic_score_codex":0.0011249568,"about_ca_topic_score_gemma":0.0012460052,"teacher_disagreement_score":0.002402045,"about_ca_system_score_codex":0.001312904,"about_ca_system_score_gemma":0.0005111144,"threshold_uncertainty_score":0.009525776},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9541809,0.00042927347,0.020501949,0.0008618159,0.0000832448,0.000018134686,0.00016625915,0.00013380195,0.02362457],"genre_scores_gemma":[0.9945098,0.0001693542,0.0025077907,0.0000657505,0.00008993389,0.000023343222,0.00013850973,0.000026313308,0.0024691478],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989893,0.00017003865,0.000055098433,0.00020619266,0.00037121796,0.00020812302],"domain_scores_gemma":[0.99462974,0.0028809519,0.0006777789,0.0006197969,0.0005245028,0.00066723215],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010903089,0.00037174407,0.000566361,0.0019852,0.0012460081,0.0021074275,0.00084324315,0.0008560136,0.0051019914],"category_scores_gemma":[0.011158099,0.00032200827,0.00027515396,0.0010288277,0.002989605,0.003351446,0.0022492337,0.001263956,0.0006066831],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003789862,0.000078938516,0.01288824,0.00017603129,0.000015527085,0.00046517068,0.0011294202,0.0048753,0.0076699313,0.94169956,0.005040662,0.025582232],"study_design_scores_gemma":[0.000041842388,0.00004982663,0.0026030443,0.000044923006,0.000021016394,0.00076378393,0.0002943695,0.036685284,0.0036497968,0.9513777,0.004438599,0.000029816894],"about_ca_topic_score_codex":0.00088022836,"about_ca_topic_score_gemma":0.0007359725,"teacher_disagreement_score":0.0051019914,"about_ca_system_score_codex":0.0008304054,"about_ca_system_score_gemma":0.00033918876,"threshold_uncertainty_score":0.01706779},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.61453724,0.0021225756,0.26117173,0.025963582,0.00035265743,0.00014562186,0.0010485214,0.0012656644,0.09339231],"genre_scores_gemma":[0.9747276,0.00086595514,0.012671857,0.0021787307,0.00034688617,0.00029444828,0.00043051675,0.00019597005,0.008288217],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99731296,0.00070681935,0.0000972464,0.00091219775,0.00047858985,0.00049204705],"domain_scores_gemma":[0.97784775,0.015191512,0.0016303196,0.0027015063,0.0012463146,0.0013824663],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038373983,0.0006410369,0.001984672,0.0024056481,0.0031460524,0.0033265438,0.002272909,0.0030382136,0.007046102],"category_scores_gemma":[0.037311614,0.0008417424,0.00118204,0.0015405987,0.006165122,0.01122519,0.00365779,0.0044056373,0.0011532409],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013108236,0.000043033302,0.0020249733,0.000083134815,0.000020938422,0.0001336356,0.0004570368,0.005928922,0.000931314,0.9772742,0.0052575325,0.0077141672],"study_design_scores_gemma":[0.000039406485,0.000027658738,0.0007155409,0.000026263624,0.000008484484,0.00018005344,0.00009730168,0.029234795,0.00056063756,0.9661062,0.0029829163,0.00002081614],"about_ca_topic_score_codex":0.002772119,"about_ca_topic_score_gemma":0.0020635917,"teacher_disagreement_score":0.007046102,"about_ca_system_score_codex":0.0028800017,"about_ca_system_score_gemma":0.0009495911,"threshold_uncertainty_score":0.02357155},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29823825,0.006370861,0.53057617,0.0025137563,0.0005509747,0.00014404394,0.0016261559,0.0013333447,0.1586465],"genre_scores_gemma":[0.88336927,0.002416303,0.09243616,0.000912745,0.0007596284,0.00038656848,0.0014584844,0.00043349018,0.017827274],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9964071,0.00058244716,0.00025646196,0.0011095986,0.0011894586,0.00045490213],"domain_scores_gemma":[0.9882152,0.0075829295,0.00093495555,0.0011124802,0.0013377417,0.0008165645],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028385955,0.0007229256,0.0011303788,0.0063494514,0.004142076,0.0049870615,0.0016773416,0.0010928442,0.010696634],"category_scores_gemma":[0.009470742,0.00090456137,0.0020633698,0.003966151,0.004397227,0.013120506,0.006012483,0.0035969263,0.0014343173],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001904761,0.000016677053,0.00049380143,0.000060919927,0.000014573618,0.000083319384,0.00045886077,0.00041100098,0.00055172027,0.99038357,0.0010577724,0.0064487713],"study_design_scores_gemma":[0.000007842715,0.00001832925,0.00035572765,0.000035461733,0.000017545994,0.00030784326,0.0002721785,0.003747203,0.0012239211,0.98625815,0.0077394634,0.00001630724],"about_ca_topic_score_codex":0.00089766044,"about_ca_topic_score_gemma":0.00055258506,"teacher_disagreement_score":0.010696634,"about_ca_system_score_codex":0.0029096843,"about_ca_system_score_gemma":0.00068804587,"threshold_uncertainty_score":0.035783768},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1597564,0.012060719,0.58430254,0.013698521,0.0029247752,0.00030982407,0.0019945654,0.0010182678,0.22393441],"genre_scores_gemma":[0.7627969,0.008705433,0.17905344,0.0068259975,0.0035481567,0.00043253577,0.0016934057,0.0007128219,0.036231272],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99492526,0.0010451489,0.00027622498,0.0018950939,0.0013976052,0.00046067126],"domain_scores_gemma":[0.982755,0.010352575,0.00071862625,0.0027919891,0.002599648,0.0007822132],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004400395,0.0012232239,0.001701755,0.0035594804,0.0030419943,0.0034531034,0.0029618135,0.0019895667,0.007328614],"category_scores_gemma":[0.028653752,0.0008061312,0.0025542087,0.0038490032,0.0066079143,0.016985094,0.0061917077,0.006776959,0.0014825058],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004295035,0.000021684877,0.00070885284,0.00011715602,0.00002018735,0.00008760826,0.0004554477,0.001577327,0.0006821029,0.98364615,0.00320438,0.009436124],"study_design_scores_gemma":[0.00002688979,0.00003502838,0.00038472196,0.00006807942,0.000022169243,0.00015093698,0.00014429055,0.0050729574,0.00088469294,0.96034867,0.032837585,0.000024082941],"about_ca_topic_score_codex":0.0065852534,"about_ca_topic_score_gemma":0.0031400495,"teacher_disagreement_score":0.007328614,"about_ca_system_score_codex":0.0032926977,"about_ca_system_score_gemma":0.0016312669,"threshold_uncertainty_score":0.024516582},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6480502,0.000489653,0.32964125,0.0010098178,0.00006975834,0.000037682905,0.0002659331,0.00025175817,0.020183992],"genre_scores_gemma":[0.97887635,0.00020846754,0.015348127,0.00018098869,0.00009860192,0.00005328182,0.0001533401,0.00005866447,0.005022152],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99943703,0.00010698858,0.000019582276,0.00017511245,0.00016205946,0.00009927085],"domain_scores_gemma":[0.9968335,0.0018212365,0.00043596458,0.00021851553,0.00036820225,0.00032253444],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00075116067,0.00044222904,0.0004156481,0.0012831631,0.0011254267,0.0011955342,0.0007447468,0.0006589699,0.0045395824],"category_scores_gemma":[0.00571014,0.00022603467,0.0005147117,0.00069565466,0.0016057235,0.002318545,0.0013530453,0.0011630101,0.0006800853],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019994561,0.00006116926,0.0037091253,0.000110021014,0.000032510925,0.00024511167,0.00060860923,0.01179285,0.020135762,0.9403565,0.0019917372,0.020756522],"study_design_scores_gemma":[0.000033378135,0.0001541333,0.0026463978,0.000027269318,0.00003581655,0.00050498376,0.00018301269,0.1449255,0.014766799,0.8333049,0.0033717041,0.000045924975],"about_ca_topic_score_codex":0.00068923965,"about_ca_topic_score_gemma":0.00054064044,"teacher_disagreement_score":0.0045395824,"about_ca_system_score_codex":0.00097631646,"about_ca_system_score_gemma":0.0003767413,"threshold_uncertainty_score":0.015186429},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03433769,0.0022981928,0.9276221,0.0016725857,0.00015274018,0.000041207866,0.00009031812,0.00013481909,0.033650383],"genre_scores_gemma":[0.72890294,0.0034241497,0.2449241,0.00086570246,0.001023287,0.00026957385,0.00023847255,0.00019233374,0.020159403],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987967,0.00040117788,0.000059449376,0.00020912873,0.00044296964,0.00009061767],"domain_scores_gemma":[0.9975471,0.0014442264,0.000195482,0.00034583278,0.00027732874,0.00019005436],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019751189,0.00056323176,0.0007430292,0.0026030145,0.0015076539,0.0028598406,0.0019564973,0.0011764651,0.0042764805],"category_scores_gemma":[0.0036077814,0.00052168255,0.0013547016,0.0017499336,0.00592343,0.009177416,0.003006063,0.0034523357,0.00051461905],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000010523216,0.0000031952707,0.00003211231,0.000011266161,0.0000024119124,0.000014072566,0.000055843637,0.0004522323,0.00014179782,0.9982187,0.000082486535,0.0009848683],"study_design_scores_gemma":[0.0000025256345,0.000008124891,0.000052434454,0.00001062828,0.000002605623,0.000052653886,0.000038664362,0.005389958,0.00023171313,0.99095356,0.0032530744,0.0000039714487],"about_ca_topic_score_codex":0.00062593404,"about_ca_topic_score_gemma":0.00048642157,"teacher_disagreement_score":0.0042764805,"about_ca_system_score_codex":0.0022233424,"about_ca_system_score_gemma":0.0007349072,"threshold_uncertainty_score":0.01613158},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.59600866,0.0015764365,0.38468933,0.0017439564,0.00015440867,0.00019096005,0.0010849931,0.00088061386,0.013670679],"genre_scores_gemma":[0.9651981,0.0008941621,0.023257514,0.00029342598,0.00009255637,0.0001794834,0.0006464062,0.00011419305,0.009324134],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99873406,0.0004453386,0.000049370847,0.00035044178,0.00017870769,0.0002420044],"domain_scores_gemma":[0.9922017,0.0044323523,0.0010963122,0.00059905014,0.00053030805,0.0011401778],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023676362,0.00077876623,0.0014436645,0.0020198808,0.0014215906,0.0018554139,0.0018745778,0.0017136495,0.0041333083],"category_scores_gemma":[0.012281018,0.0007749334,0.0011372089,0.0011135966,0.0023079277,0.0030874058,0.0019397819,0.0017834626,0.000670889],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003040983,0.00011172076,0.005427602,0.00019301186,0.00011852847,0.0011588794,0.00057560933,0.17710924,0.0038784218,0.79907227,0.0036505146,0.008400127],"study_design_scores_gemma":[0.00012674266,0.000094403775,0.0012485465,0.000046701673,0.000046120047,0.00029533374,0.00015490924,0.61621124,0.00072556845,0.3780614,0.0029361043,0.000052934163],"about_ca_topic_score_codex":0.005237244,"about_ca_topic_score_gemma":0.007774417,"teacher_disagreement_score":0.005237244,"about_ca_system_score_codex":0.0028132338,"about_ca_system_score_gemma":0.0008524505,"threshold_uncertainty_score":0.020411551},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6123438,0.0030188668,0.32282308,0.0029854763,0.00027065838,0.000049294027,0.00028249886,0.00026238474,0.057964012],"genre_scores_gemma":[0.9775185,0.000882288,0.015503596,0.0002022938,0.00038737606,0.000064024855,0.00010421807,0.00007659192,0.0052611497],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99904245,0.00033934796,0.000030355808,0.0001795887,0.00028025566,0.0001279548],"domain_scores_gemma":[0.9915844,0.005955719,0.0008901444,0.00070069556,0.00039456133,0.00047446488],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022085642,0.00059540424,0.0009118997,0.0024854986,0.0010102965,0.002114875,0.001360779,0.0009750987,0.0037747482],"category_scores_gemma":[0.01306396,0.00055668206,0.00074729626,0.0011430042,0.004764841,0.0046592564,0.0021500795,0.002399133,0.0003716484],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026401678,0.000014040987,0.0003571166,0.00003503553,0.000010586945,0.00007401371,0.00015614687,0.0040146415,0.0008742818,0.9907947,0.00071648485,0.0029264728],"study_design_scores_gemma":[0.000008570713,0.000008914682,0.00037605825,0.000017794075,0.000005114908,0.000103205966,0.00006189999,0.02745432,0.00038059652,0.9706824,0.00089108833,0.000009990924],"about_ca_topic_score_codex":0.0005233996,"about_ca_topic_score_gemma":0.00048508277,"teacher_disagreement_score":0.0037747482,"about_ca_system_score_codex":0.0010967212,"about_ca_system_score_gemma":0.00033335792,"threshold_uncertainty_score":0.01262784},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22168502,0.009439234,0.6804742,0.009256814,0.00047398265,0.0002799006,0.0023480207,0.0017191679,0.07432366],"genre_scores_gemma":[0.8392925,0.00617304,0.13266674,0.0019199122,0.0014932177,0.0011590241,0.0022281844,0.0011797531,0.013887605],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99145085,0.0027654017,0.00034353812,0.0021315261,0.002354255,0.00095437304],"domain_scores_gemma":[0.9159815,0.06596764,0.004378477,0.0069803176,0.0033764557,0.0033156364],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007984039,0.0027844857,0.0025372887,0.0061175805,0.002401419,0.0048293434,0.0064844773,0.0032052028,0.00736743],"category_scores_gemma":[0.08553341,0.0018038651,0.002514307,0.003524212,0.0067415787,0.0145467995,0.0066595725,0.009939557,0.0014643094],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00049633114,0.00021039546,0.0037723973,0.0006417314,0.0001787711,0.00029804005,0.00057702785,0.093036056,0.007982438,0.84974724,0.008454621,0.034605015],"study_design_scores_gemma":[0.0000410612,0.00009989598,0.0019101199,0.00015107683,0.00006500164,0.00051395106,0.00010794463,0.31456894,0.004471493,0.6720895,0.0058870465,0.00009395669],"about_ca_topic_score_codex":0.0010872912,"about_ca_topic_score_gemma":0.0009218608,"teacher_disagreement_score":0.007984039,"about_ca_system_score_codex":0.0057742046,"about_ca_system_score_gemma":0.0012901629,"threshold_uncertainty_score":0.04222417},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.050071683,0.0026934051,0.85322857,0.0015947255,0.00043135518,0.00010477837,0.00041783124,0.00050054566,0.090957016],"genre_scores_gemma":[0.85482407,0.0051090233,0.11728441,0.0008990903,0.0021592132,0.00081957004,0.0006873231,0.00083021994,0.017387077],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9962172,0.0008426534,0.0001683421,0.0007496155,0.0015490359,0.0004730758],"domain_scores_gemma":[0.9659462,0.024498839,0.0023924569,0.0025749728,0.0031383298,0.0014492804],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033612605,0.0019346891,0.0013401973,0.0058820387,0.0016705317,0.0033111037,0.0026931749,0.001674515,0.011072975],"category_scores_gemma":[0.028942598,0.00086988654,0.0016958645,0.0027019163,0.0041614063,0.010306403,0.004391559,0.0064074597,0.0027049284],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000052042487,0.000049517133,0.00048630036,0.00013932913,0.000035149926,0.000095001065,0.00023464089,0.020091703,0.0035290378,0.9615861,0.002671802,0.011029365],"study_design_scores_gemma":[0.000008736241,0.00002053901,0.00035378555,0.000056936813,0.000017288126,0.000098069526,0.000048338006,0.07307585,0.0019581565,0.9215734,0.0027552468,0.000033599066],"about_ca_topic_score_codex":0.00063911715,"about_ca_topic_score_gemma":0.00058448245,"teacher_disagreement_score":0.011072975,"about_ca_system_score_codex":0.0025316544,"about_ca_system_score_gemma":0.0006494351,"threshold_uncertainty_score":0.037042737},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3468099,0.0028592912,0.5182898,0.0035566185,0.00027079732,0.00018449566,0.00091653684,0.00055407954,0.12655854],"genre_scores_gemma":[0.91565704,0.0011695664,0.061629266,0.00037157527,0.00036070647,0.00030558478,0.0005519219,0.00011635505,0.019837964],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.996714,0.0009375559,0.0001908335,0.0007538544,0.00090849545,0.0004953395],"domain_scores_gemma":[0.9910563,0.0048572114,0.0009781503,0.0016331761,0.0007343929,0.0007407471],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029629006,0.00057603687,0.000941913,0.0033704306,0.0034245995,0.0044632307,0.0015321962,0.0017799286,0.008032215],"category_scores_gemma":[0.011467495,0.0007358063,0.00097028847,0.004188948,0.0049230643,0.008057516,0.005042899,0.0027479907,0.001393641],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010031103,0.0000054472093,0.00018043997,0.000012609582,0.0000036320687,0.000015824227,0.0001295925,0.0012017258,0.000092096634,0.99494225,0.0004327543,0.0029736941],"study_design_scores_gemma":[0.000007797517,0.000006450722,0.00014258851,0.000014522073,0.0000053676517,0.000050234707,0.000051286843,0.0077253254,0.00015832708,0.987519,0.0043124645,0.0000065777067],"about_ca_topic_score_codex":0.0011720535,"about_ca_topic_score_gemma":0.00084715924,"teacher_disagreement_score":0.008032215,"about_ca_system_score_codex":0.0026001884,"about_ca_system_score_gemma":0.0011308474,"threshold_uncertainty_score":0.02687037},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8999591,0.000501353,0.06285128,0.0018647664,0.0000469621,0.000040518935,0.00039789322,0.0003224157,0.034015603],"genre_scores_gemma":[0.98606735,0.000289834,0.0075833197,0.00023426968,0.000051048442,0.000060696093,0.00029295776,0.000047408947,0.0053731627],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991155,0.00018848838,0.00004112062,0.00023235932,0.00026686586,0.000155561],"domain_scores_gemma":[0.9938281,0.0039339457,0.0005744048,0.0005048827,0.000449189,0.0007095602],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00071419345,0.00032618534,0.00074914115,0.0017366771,0.0018182867,0.00249004,0.0013155651,0.0011717689,0.0054759807],"category_scores_gemma":[0.009902475,0.0007455418,0.0005239163,0.0012026282,0.0032756901,0.0046302015,0.003173446,0.0018520207,0.00076318503],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022755572,0.00007358808,0.0035022409,0.00013066939,0.000025801024,0.0006336274,0.0020940227,0.011693034,0.0033093994,0.9606764,0.0027536699,0.014879989],"study_design_scores_gemma":[0.00002513701,0.000029381948,0.00069446163,0.000023324592,0.000008298013,0.0003242544,0.00040138653,0.025969435,0.0016961036,0.9686558,0.0021593997,0.000012958429],"about_ca_topic_score_codex":0.0015880065,"about_ca_topic_score_gemma":0.0015963947,"teacher_disagreement_score":0.0054759807,"about_ca_system_score_codex":0.00094253646,"about_ca_system_score_gemma":0.0003683808,"threshold_uncertainty_score":0.018318951},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41625148,0.003350693,0.49302852,0.0022379989,0.0003626864,0.00011513082,0.0007974959,0.0004629169,0.0833931],"genre_scores_gemma":[0.8979735,0.0020901328,0.08647438,0.0005945609,0.0005879493,0.00018576847,0.0010755633,0.0002291481,0.0107890675],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981102,0.0005765132,0.000108366134,0.0005791928,0.00040504202,0.0002207012],"domain_scores_gemma":[0.99581224,0.0022707144,0.0005060692,0.00066361803,0.00036229513,0.00038499932],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010835578,0.00061562937,0.0009643524,0.0019736136,0.0020896879,0.0036428235,0.0016371405,0.0020591817,0.004790677],"category_scores_gemma":[0.007817712,0.00081120164,0.00081716035,0.0028502268,0.0034803285,0.010715118,0.0028818618,0.0019195479,0.0006756931],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030203846,0.00002697242,0.00051756756,0.000061275445,0.000010118489,0.00011893393,0.00024429223,0.007290118,0.00081955304,0.98051435,0.0017729767,0.0085935285],"study_design_scores_gemma":[0.0000050523386,0.00001120861,0.0001814829,0.00002974069,0.0000043013715,0.0001312057,0.00013042733,0.0236663,0.0006842124,0.9716361,0.003511064,0.000008883084],"about_ca_topic_score_codex":0.0010980159,"about_ca_topic_score_gemma":0.0009548472,"teacher_disagreement_score":0.004790677,"about_ca_system_score_codex":0.0015919685,"about_ca_system_score_gemma":0.00053079886,"threshold_uncertainty_score":0.016026378},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7331259,0.0024619,0.14658935,0.0020049808,0.00016253989,0.00007402743,0.0005412047,0.0012865464,0.113753565],"genre_scores_gemma":[0.9677582,0.00079905015,0.020193834,0.0003125448,0.0001335776,0.00008107054,0.0004329198,0.00021568172,0.010073206],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988374,0.00019479352,0.00005652695,0.0003204581,0.00037838603,0.00021238148],"domain_scores_gemma":[0.99625444,0.0021425989,0.00021225045,0.00048177203,0.0003659983,0.0005428877],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011374495,0.0005814346,0.00067894324,0.0012858075,0.0014990952,0.0017667348,0.0009929262,0.0008199418,0.005240107],"category_scores_gemma":[0.0047772643,0.00051013904,0.0010255992,0.00054972724,0.0029607406,0.0053987927,0.0037177943,0.0024205602,0.0006361472],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000113107155,0.00004190492,0.001022812,0.000119920296,0.000014478446,0.00040664754,0.0007795609,0.0020966704,0.009149771,0.9729595,0.0013035723,0.011992031],"study_design_scores_gemma":[0.000022187434,0.000041349245,0.00067631825,0.000043512122,0.000019697325,0.00044858851,0.00021703301,0.008038609,0.0077926954,0.97520614,0.007478248,0.000015544521],"about_ca_topic_score_codex":0.00041503142,"about_ca_topic_score_gemma":0.00044176323,"teacher_disagreement_score":0.005240107,"about_ca_system_score_codex":0.0010205101,"about_ca_system_score_gemma":0.00027956095,"threshold_uncertainty_score":0.017529905},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12682922,0.020991554,0.37981495,0.01635998,0.0018786604,0.0001846319,0.0023458467,0.0007251293,0.45087],"genre_scores_gemma":[0.8128979,0.013729142,0.09927813,0.0049711447,0.0023297088,0.0005801991,0.001792421,0.0006681504,0.06375325],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985291,0.00018668786,0.000056441044,0.00053965754,0.00040173074,0.00028641842],"domain_scores_gemma":[0.98945916,0.006264377,0.0006677186,0.0012125805,0.0011745471,0.0012215961],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020130859,0.0010075475,0.00085558306,0.0047208914,0.0023415925,0.0034742812,0.0021918672,0.0015873346,0.011027119],"category_scores_gemma":[0.010354525,0.000637928,0.0010654574,0.0047654104,0.0043101916,0.008042031,0.003991469,0.0052989284,0.0013067892],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008635792,0.00003843807,0.00087887334,0.0001512553,0.000014797489,0.000059881797,0.0002800447,0.0036478,0.0013360294,0.9724894,0.006158631,0.014858291],"study_design_scores_gemma":[0.00003976549,0.000044539185,0.0015798134,0.00014260941,0.000045181463,0.00027067392,0.00016430438,0.01781209,0.002328963,0.93342716,0.044094022,0.000050845076],"about_ca_topic_score_codex":0.004451671,"about_ca_topic_score_gemma":0.0041127875,"teacher_disagreement_score":0.011027119,"about_ca_system_score_codex":0.005749341,"about_ca_system_score_gemma":0.0017336707,"threshold_uncertainty_score":0.04171461},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8347038,0.0008631894,0.12951592,0.0010882976,0.000050920236,0.000030201683,0.00019538663,0.00034168173,0.033210628],"genre_scores_gemma":[0.9816626,0.00023215933,0.015426356,0.00008347947,0.000048090427,0.000026325559,0.00012346222,0.000051468818,0.002346055],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993297,0.00019164622,0.000023765397,0.00018583937,0.00016103884,0.00010805462],"domain_scores_gemma":[0.9959609,0.0028450612,0.00034816738,0.0002522583,0.00021537898,0.00037833586],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011899428,0.00041879647,0.0005677601,0.0012551354,0.0012022349,0.0014097187,0.001454468,0.0004825435,0.0026825517],"category_scores_gemma":[0.004349127,0.00040560876,0.00063231826,0.000602919,0.003508905,0.003266448,0.0018627945,0.002048047,0.00027929427],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009500747,0.000046671397,0.001498368,0.00011099313,0.000016451355,0.00023492967,0.0006135545,0.006923651,0.003918681,0.97851586,0.00050900097,0.007516853],"study_design_scores_gemma":[0.000010226382,0.000028066539,0.0004871697,0.000014770814,0.000008452078,0.00010193796,0.0001289005,0.02736395,0.0025892037,0.9681855,0.0010709218,0.000010916251],"about_ca_topic_score_codex":0.0007047424,"about_ca_topic_score_gemma":0.00053310767,"teacher_disagreement_score":0.0026825517,"about_ca_system_score_codex":0.0010455606,"about_ca_system_score_gemma":0.00032477317,"threshold_uncertainty_score":0.008973956},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.74899334,0.0030202498,0.22296408,0.0016686777,0.00008654014,0.00003995918,0.0003841307,0.00037649678,0.02246656],"genre_scores_gemma":[0.98735225,0.0010649032,0.009110824,0.00006769489,0.00011336035,0.00004931854,0.00015271975,0.000087429675,0.0020014886],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993936,0.00021049526,0.000025277177,0.00012325123,0.00016504354,0.00008235153],"domain_scores_gemma":[0.9900107,0.006939731,0.0013012977,0.0006903419,0.0004891454,0.0005687378],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001585417,0.00044577068,0.0006139349,0.0026545764,0.00079897617,0.0016886451,0.0009762057,0.0009868466,0.0017031904],"category_scores_gemma":[0.011652248,0.00033308152,0.00049605506,0.0013222975,0.0036963127,0.003935349,0.0014166792,0.0010376108,0.00024261215],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004465239,0.000035504447,0.0033719188,0.00012275,0.000024254916,0.00018437822,0.00032653843,0.04863043,0.004554726,0.9351894,0.00081174093,0.0067036743],"study_design_scores_gemma":[0.000006381686,0.000022593646,0.0019925355,0.000028292363,0.0000098835735,0.00022824194,0.000076014025,0.114709385,0.0014525752,0.88040036,0.0010563895,0.000017393571],"about_ca_topic_score_codex":0.0008289752,"about_ca_topic_score_gemma":0.00058484526,"teacher_disagreement_score":0.0026545764,"about_ca_system_score_codex":0.0014507531,"about_ca_system_score_gemma":0.0003186566,"threshold_uncertainty_score":0.010525942},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.837583,0.0003962093,0.07254869,0.0010991585,0.00006292043,0.00005448686,0.00027171453,0.0003882907,0.08759555],"genre_scores_gemma":[0.98364496,0.00019874473,0.010113024,0.00017520486,0.000035125486,0.00003120948,0.00011028597,0.000028497729,0.0056629498],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994697,0.00007881438,0.00001473779,0.00009997898,0.0002144296,0.00012225243],"domain_scores_gemma":[0.9979656,0.00083445455,0.00027446967,0.00040876033,0.0002602955,0.00025644846],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003421729,0.00019045944,0.00029132536,0.00086192746,0.0011828572,0.0011384061,0.00054885313,0.00045880946,0.003907014],"category_scores_gemma":[0.0018101351,0.00029653215,0.00034959702,0.0009155382,0.0020327584,0.0019515036,0.0016803474,0.0016363333,0.00036049675],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005498195,0.000028243718,0.0013290339,0.0000425234,0.0000067228552,0.00021624657,0.00059093046,0.0025869322,0.002758047,0.9785212,0.0015895056,0.012275547],"study_design_scores_gemma":[0.000021045686,0.00003445564,0.0014279872,0.000010024199,0.000008630758,0.000378563,0.0002742453,0.009384374,0.0030913565,0.9775965,0.0077564167,0.000016407192],"about_ca_topic_score_codex":0.0043499633,"about_ca_topic_score_gemma":0.0042509018,"teacher_disagreement_score":0.0043499633,"about_ca_system_score_codex":0.0011035942,"about_ca_system_score_gemma":0.00082220376,"threshold_uncertainty_score":0.013070285},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7938812,0.00077198946,0.18978937,0.001079062,0.00007090872,0.00015521719,0.00039551803,0.00068964565,0.013167109],"genre_scores_gemma":[0.98066723,0.00028563122,0.014898257,0.00019477725,0.00004192915,0.00018363446,0.00020302014,0.00008202849,0.0034434092],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99862206,0.0005050141,0.000052424213,0.00030274835,0.0003167089,0.00020114047],"domain_scores_gemma":[0.98958963,0.0057945815,0.0015782249,0.0011535743,0.0008497961,0.0010341668],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019619649,0.00041268044,0.0008074578,0.0024813474,0.001135498,0.0016375366,0.0012710661,0.0010245655,0.0025103504],"category_scores_gemma":[0.015704358,0.00078319805,0.00061685045,0.0010393759,0.0025674552,0.002628547,0.0017239387,0.00096081465,0.00030514286],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017222969,0.000056850866,0.0027933065,0.000097837015,0.000054058044,0.0002986552,0.00042348966,0.04864218,0.0026687938,0.9318259,0.002846002,0.0101206135],"study_design_scores_gemma":[0.00007203909,0.000045573957,0.00092435424,0.00002421352,0.000020829013,0.00016764436,0.00008854657,0.19239007,0.0010829978,0.8032834,0.0018701401,0.00003015612],"about_ca_topic_score_codex":0.0024122498,"about_ca_topic_score_gemma":0.0023963673,"teacher_disagreement_score":0.0025103504,"about_ca_system_score_codex":0.0020394963,"about_ca_system_score_gemma":0.0008594372,"threshold_uncertainty_score":0.014797628},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33625582,0.005888796,0.5117495,0.008349735,0.0008391929,0.0001811752,0.0021982882,0.0018124735,0.13272505],"genre_scores_gemma":[0.9200945,0.0024260152,0.05596689,0.001433428,0.00081103545,0.00030576854,0.0010973649,0.0007114974,0.017153602],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99810934,0.0002661571,0.0000750007,0.0007286142,0.00035058334,0.00047034232],"domain_scores_gemma":[0.9867166,0.007635163,0.00077166373,0.0025228932,0.0008100033,0.0015437595],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014526892,0.0016958968,0.0015660347,0.0015463739,0.0024226222,0.0026692105,0.003268156,0.0018101103,0.014758454],"category_scores_gemma":[0.012964314,0.00086111604,0.002126886,0.0014129821,0.0029943176,0.007814011,0.005410381,0.004511347,0.0027306902],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008462428,0.00029930766,0.008445372,0.001084383,0.0002084936,0.00080396124,0.0013022247,0.054533213,0.07340546,0.77385885,0.025539143,0.05967338],"study_design_scores_gemma":[0.00010336353,0.00047291038,0.0051710685,0.00021605934,0.00025434073,0.0026367041,0.00045415177,0.2162734,0.026797527,0.6985995,0.04883372,0.00018719932],"about_ca_topic_score_codex":0.001687353,"about_ca_topic_score_gemma":0.002410957,"teacher_disagreement_score":0.014758454,"about_ca_system_score_codex":0.0022421468,"about_ca_system_score_gemma":0.000989255,"threshold_uncertainty_score":0.049372017},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23037401,0.005610469,0.70478106,0.0021304705,0.00024063507,0.00008684799,0.00044717672,0.0006357287,0.055693652],"genre_scores_gemma":[0.92880046,0.0022358273,0.06052748,0.00037449345,0.00036127944,0.00016724928,0.00034185487,0.00018261616,0.0070088236],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99853003,0.000512334,0.00008051359,0.00025383517,0.00050317205,0.00012011774],"domain_scores_gemma":[0.9938053,0.0036987937,0.0006889088,0.0005915564,0.0006203113,0.00059512863],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014554225,0.00059735304,0.0008188054,0.0038841625,0.0012916537,0.0024560483,0.0012990612,0.0010237464,0.002885265],"category_scores_gemma":[0.010048536,0.00042171055,0.0011102284,0.0018588745,0.0037882423,0.003890402,0.0024413874,0.0016236842,0.0003840868],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008081148,0.000013497003,0.0004532809,0.000026678257,0.000007936379,0.00007799575,0.00012067184,0.0051549682,0.00029227926,0.9898178,0.00026502842,0.0037617928],"study_design_scores_gemma":[0.0000039435686,0.000010782593,0.00014920313,0.000018958415,0.0000040841533,0.00008446691,0.000060970968,0.030976158,0.00020937965,0.9663571,0.0021165418,0.00000827253],"about_ca_topic_score_codex":0.0018757766,"about_ca_topic_score_gemma":0.00088322174,"teacher_disagreement_score":0.0038841625,"about_ca_system_score_codex":0.0019439677,"about_ca_system_score_gemma":0.00059131114,"threshold_uncertainty_score":0.0141044855},"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":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11915114,0.0013851606,0.8169609,0.001771676,0.00023568678,0.0000897884,0.00036307095,0.00067055586,0.059372094],"genre_scores_gemma":[0.85173035,0.001836108,0.10139029,0.0017894914,0.0004992647,0.00029743928,0.0005547367,0.00047277,0.041429456],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992449,0.00020885198,0.000025582236,0.00016350717,0.0002277638,0.00012933914],"domain_scores_gemma":[0.994107,0.003281022,0.00070649444,0.0006903533,0.00067363714,0.0005414732],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0017651956,0.0008413791,0.0007043103,0.0017706073,0.0011168331,0.0013465387,0.0019134999,0.0016028518,0.008606348],"category_scores_gemma":[0.013418707,0.0004559722,0.0011669314,0.0009374204,0.002382108,0.0045048543,0.002115924,0.0028916837,0.0018654037],"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.000031408596,0.000035738554,0.0011663985,0.00007168686,0.00001653416,0.00015660073,0.00016156209,0.0153420605,0.001235561,0.9691836,0.003442755,0.0091561405],"study_design_scores_gemma":[0.000011064685,0.00006058939,0.0009908384,0.000065330634,0.000023335799,0.0004351072,0.00009711666,0.3391881,0.0016001267,0.65062726,0.0068607037,0.000040438525],"about_ca_topic_score_codex":0.0019504961,"about_ca_topic_score_gemma":0.002700624,"teacher_disagreement_score":0.9913936,"about_ca_system_score_codex":0.001420721,"about_ca_system_score_gemma":0.0006851452,"threshold_uncertainty_score":0},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5975334,0.007695328,0.2980943,0.013073501,0.0006235398,0.000098214325,0.0006481197,0.00016544494,0.0820682],"genre_scores_gemma":[0.93547165,0.0034354066,0.037276033,0.0006237523,0.00095523294,0.00014594581,0.0004387405,0.00009571451,0.02155741],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99804306,0.0009295364,0.000118678756,0.00029401385,0.00041938544,0.00019525753],"domain_scores_gemma":[0.99316025,0.0042914664,0.00079525163,0.00045673316,0.0005193286,0.0007769974],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003288533,0.001052124,0.0019270454,0.0030745568,0.0023392744,0.004589803,0.0029190497,0.0031397361,0.0051158452],"category_scores_gemma":[0.013073289,0.0006193527,0.0008310771,0.0030362369,0.005096928,0.013036365,0.003999484,0.0044480036,0.00041803328],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024335028,0.00001103281,0.00011151981,0.00002912955,0.0000064276037,0.000028818473,0.00008479774,0.0030909015,0.0000821536,0.9933822,0.00059014856,0.0025585487],"study_design_scores_gemma":[0.000009623688,0.0000069136727,0.00006192995,0.000011367347,0.0000029044913,0.000034631816,0.00006352756,0.008086654,0.000059590184,0.99092627,0.00072769757,0.0000088882925],"about_ca_topic_score_codex":0.0014205809,"about_ca_topic_score_gemma":0.0010186475,"teacher_disagreement_score":0.0051158452,"about_ca_system_score_codex":0.0027293193,"about_ca_system_score_gemma":0.0010184612,"threshold_uncertainty_score":0.01980275},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.65259457,0.0012339957,0.04256928,0.003292617,0.00045726256,0.00007039868,0.00058630976,0.000424926,0.29877064],"genre_scores_gemma":[0.9648918,0.00046959586,0.0054245326,0.00034750561,0.00033924237,0.00008592651,0.00030841242,0.00010615366,0.028026843],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99912137,0.00023170655,0.00004903018,0.00020105076,0.00020696725,0.0001897987],"domain_scores_gemma":[0.9975356,0.0010219024,0.0003122036,0.0002218325,0.00031814488,0.00059039146],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010502562,0.0009108711,0.001022987,0.004922807,0.0030233013,0.004490094,0.0014384594,0.0012728489,0.0120952455],"category_scores_gemma":[0.003999446,0.0006415876,0.0008269957,0.0020719692,0.0042712004,0.006701654,0.0032733541,0.0037160164,0.0013282095],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025690746,0.000014412508,0.00022963321,0.000018193767,0.0000046325417,0.000033419255,0.00015726835,0.00035059353,0.0001778388,0.9957985,0.00074120634,0.002448461],"study_design_scores_gemma":[0.000008698479,0.0000101433025,0.00054027495,0.000017408018,0.000011007952,0.000117707525,0.000085072315,0.0016474809,0.00021092902,0.99414873,0.003190583,0.000011902036],"about_ca_topic_score_codex":0.0007902119,"about_ca_topic_score_gemma":0.0011024767,"teacher_disagreement_score":0.0120952455,"about_ca_system_score_codex":0.0017249032,"about_ca_system_score_gemma":0.0006084942,"threshold_uncertainty_score":0.040462613},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5698498,0.0033515699,0.31845227,0.009095696,0.0005170119,0.00021430088,0.0028063874,0.0019095986,0.09380349],"genre_scores_gemma":[0.97877514,0.00095503044,0.010227169,0.0008484376,0.00042819252,0.00022317845,0.0010173408,0.0006653689,0.006860103],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9934942,0.0030661905,0.00027574983,0.0011757233,0.0011225947,0.00086556916],"domain_scores_gemma":[0.80908936,0.14484651,0.013082932,0.020395841,0.006347296,0.0062380536],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.011242827,0.0013499921,0.0023713952,0.0041421545,0.002414509,0.004653221,0.0043002577,0.0032487554,0.009766494],"category_scores_gemma":[0.10832898,0.0010877972,0.0016412265,0.0015510551,0.007405022,0.0088133495,0.006123669,0.0044168704,0.0014479217],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008120835,0.0001275972,0.0038082446,0.0003487123,0.00025563198,0.00026258387,0.00044611673,0.12860012,0.002334012,0.83754796,0.012184534,0.013272415],"study_design_scores_gemma":[0.00007030486,0.00010277671,0.0015022068,0.00012782207,0.00006496477,0.00016755763,0.00012498403,0.23891312,0.0014745268,0.75586337,0.0015105254,0.00007775881],"about_ca_topic_score_codex":0.0029018342,"about_ca_topic_score_gemma":0.0018848188,"teacher_disagreement_score":0.011242827,"about_ca_system_score_codex":0.0034448875,"about_ca_system_score_gemma":0.0016611938,"threshold_uncertainty_score":0.059458435},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08368582,0.009194315,0.7926295,0.006229594,0.002376521,0.00008112015,0.0003584159,0.000613806,0.10483093],"genre_scores_gemma":[0.7642866,0.0089450395,0.18524103,0.0012441421,0.0053176326,0.00033955637,0.00037934113,0.0007490811,0.033497643],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99780375,0.001061191,0.00014913296,0.00034666946,0.00047750518,0.00016178476],"domain_scores_gemma":[0.9890743,0.008040034,0.0004886222,0.00068120874,0.0009876203,0.0007282435],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0046588653,0.0016701046,0.0018075737,0.008581838,0.0021207095,0.003595869,0.0028934719,0.001999044,0.007593488],"category_scores_gemma":[0.025878351,0.00072573917,0.0019335644,0.0040080105,0.005147905,0.01008841,0.00646074,0.00560114,0.0011723952],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000039270857,0.00002146176,0.00041755618,0.00015656967,0.000026649672,0.000114397946,0.00024379682,0.0023005519,0.0009831106,0.9841053,0.00127238,0.01031899],"study_design_scores_gemma":[0.00000795464,0.000027112543,0.00031627133,0.00004766793,0.00003399047,0.00021016657,0.00005972544,0.02279253,0.00064588606,0.97152865,0.0042989976,0.00003098565],"about_ca_topic_score_codex":0.0011990601,"about_ca_topic_score_gemma":0.000747261,"teacher_disagreement_score":0.008581838,"about_ca_system_score_codex":0.0018498411,"about_ca_system_score_gemma":0.0009258068,"threshold_uncertainty_score":0.025402725},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03545482,0.009732758,0.25947955,0.02393876,0.024288833,0.00024230224,0.005942713,0.0064271027,0.63449305],"genre_scores_gemma":[0.24644454,0.004027128,0.15233237,0.009920145,0.0046970453,0.0003332958,0.00468725,0.004138283,0.57342],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99875,0.00019193844,0.0000723157,0.00050008093,0.00027750907,0.00020825164],"domain_scores_gemma":[0.99800223,0.0004497434,0.00016046826,0.0006743677,0.00046515517,0.00024794767],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00069660135,0.001257798,0.0010025937,0.001229773,0.004231296,0.0039696447,0.0014967204,0.001246486,0.099476606],"category_scores_gemma":[0.0042122384,0.0009666143,0.0012421871,0.0016432859,0.0034153487,0.007502961,0.0035566117,0.0038099017,0.040064115],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034217365,0.00007732199,0.00085245725,0.00029097896,0.0000501026,0.0010846835,0.00093929155,0.00049701845,0.007663793,0.78470325,0.14381905,0.059679937],"study_design_scores_gemma":[0.000024164148,0.00009332681,0.0008087573,0.00014192947,0.00003659711,0.0014261509,0.0003187486,0.0014074664,0.0051106694,0.34818923,0.642365,0.00007797011],"about_ca_topic_score_codex":0.002009968,"about_ca_topic_score_gemma":0.003664948,"teacher_disagreement_score":0.099476606,"about_ca_system_score_codex":0.0014798731,"about_ca_system_score_gemma":0.00096625334,"threshold_uncertainty_score":0.3327824},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40667185,0.005594463,0.3792483,0.01615515,0.0012959987,0.00011034156,0.00068426965,0.000532451,0.18970725],"genre_scores_gemma":[0.911952,0.0036004232,0.051509317,0.00143422,0.00197142,0.00014473723,0.0008892193,0.00015458993,0.028344035],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99872535,0.0003902757,0.000051432133,0.00019375663,0.00035833355,0.000280794],"domain_scores_gemma":[0.9954951,0.0030924757,0.00026591937,0.00038649753,0.0003575174,0.00040242466],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002077223,0.0008114386,0.001132898,0.0021580234,0.00300441,0.0034627141,0.0017515844,0.0017000603,0.0088354545],"category_scores_gemma":[0.007994232,0.0005439677,0.00071505597,0.0027586299,0.0038792328,0.011737662,0.0051527866,0.005126564,0.0019987663],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000059775222,0.00006707345,0.0005193676,0.00007137733,0.000009806585,0.00014085993,0.00032986354,0.0025649029,0.00037491214,0.9760724,0.0036842956,0.016105453],"study_design_scores_gemma":[0.000011865177,0.000015656358,0.00009230221,0.0000256653,0.000007117107,0.00009575412,0.00015335837,0.0050644726,0.00029333023,0.990948,0.0032837004,0.000008562189],"about_ca_topic_score_codex":0.001061927,"about_ca_topic_score_gemma":0.00087157905,"teacher_disagreement_score":0.0088354545,"about_ca_system_score_codex":0.001184131,"about_ca_system_score_gemma":0.00082777225,"threshold_uncertainty_score":0.029557586},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0838286,0.0021123735,0.34864634,0.0064591854,0.00091530563,0.00033711252,0.030229403,0.010838768,0.5166329],"genre_scores_gemma":[0.463854,0.0044681523,0.153223,0.0025486993,0.0006013516,0.0005644246,0.05232424,0.007197038,0.31521904],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99924684,0.000105860025,0.00004640104,0.00023527074,0.00023415244,0.00013137054],"domain_scores_gemma":[0.9963559,0.0013172274,0.0003282696,0.0009834634,0.00074143877,0.00027372528],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065403647,0.0007364524,0.00076933065,0.0011104548,0.0011206121,0.00330773,0.0014375137,0.00076744484,0.054420553],"category_scores_gemma":[0.004979561,0.00060792116,0.00070834643,0.0021370386,0.0007739397,0.004532683,0.0011927548,0.0010663911,0.026413674],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000514688,0.00017472243,0.0024648344,0.0011296518,0.00010801537,0.00055207725,0.0010076468,0.004952955,0.019854879,0.49281725,0.29136798,0.18505539],"study_design_scores_gemma":[0.00006222123,0.00004928173,0.0025947022,0.00012344832,0.000045471515,0.00096936227,0.0004569126,0.006291308,0.013492617,0.4452892,0.5305777,0.000047788315],"about_ca_topic_score_codex":0.0021958828,"about_ca_topic_score_gemma":0.0035561316,"teacher_disagreement_score":0.054420553,"about_ca_system_score_codex":0.0012943742,"about_ca_system_score_gemma":0.0008352017,"threshold_uncertainty_score":0.18205494},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3554748,0.004248202,0.5071817,0.0025219587,0.0005287379,0.000049562695,0.00016049985,0.00042851627,0.12940608],"genre_scores_gemma":[0.9336288,0.001959444,0.04060084,0.00030043573,0.00055738376,0.00004408669,0.00011351618,0.00016660993,0.022629008],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993722,0.00021493481,0.000023048993,0.00009631915,0.00018486532,0.00010870004],"domain_scores_gemma":[0.99806374,0.0013543671,0.00018327653,0.00012073414,0.00017939649,0.00009851027],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001097286,0.0004899372,0.00045913254,0.0019317203,0.0009351078,0.0013890966,0.0005812861,0.00064192584,0.0069967317],"category_scores_gemma":[0.0036696594,0.00021876123,0.0007803113,0.0011770054,0.0030935511,0.004102303,0.0012141035,0.0018079559,0.0006131036],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011219974,0.000009377787,0.00014288737,0.000032625638,0.0000039315078,0.000075744465,0.00021708597,0.0014715089,0.000919423,0.99144125,0.00047865705,0.0051963725],"study_design_scores_gemma":[0.000008881394,0.000030343226,0.0002830414,0.0000296427,0.0000071287686,0.00023407472,0.0001847163,0.016994758,0.0013049584,0.97558916,0.0053177443,0.000015527658],"about_ca_topic_score_codex":0.0008518378,"about_ca_topic_score_gemma":0.00044858106,"teacher_disagreement_score":0.0069967317,"about_ca_system_score_codex":0.001077438,"about_ca_system_score_gemma":0.00034066034,"threshold_uncertainty_score":0.023406386},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.649437,0.0015551682,0.31482312,0.0022855862,0.00025167273,0.00010815677,0.00046755152,0.00078569993,0.030285949],"genre_scores_gemma":[0.9764415,0.0005748541,0.017942565,0.00026793443,0.00017042826,0.0001408287,0.0002907272,0.0001454688,0.0040257243],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991585,0.00033970474,0.000013758035,0.00015586529,0.00015421139,0.00017786935],"domain_scores_gemma":[0.989219,0.007839326,0.0008065877,0.0007056719,0.00075219094,0.0006770949],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024434053,0.00038565142,0.00064037065,0.0018018829,0.0012230474,0.0015474218,0.0012064208,0.00079419103,0.0034792293],"category_scores_gemma":[0.016166601,0.0005678312,0.00046430266,0.0008001095,0.0029059474,0.002410418,0.0009706185,0.0011991211,0.00036182144],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012924788,0.0000434092,0.002776025,0.000084538726,0.000029850386,0.00016564068,0.00020715239,0.058187056,0.0029340922,0.9250754,0.0042739552,0.0060936157],"study_design_scores_gemma":[0.00004701945,0.000026953197,0.0019131436,0.000039539253,0.000013922193,0.00016724413,0.00007069356,0.4512822,0.0008181844,0.54372144,0.0018685753,0.000031120402],"about_ca_topic_score_codex":0.004216637,"about_ca_topic_score_gemma":0.0038310054,"teacher_disagreement_score":0.004216637,"about_ca_system_score_codex":0.002240833,"about_ca_system_score_gemma":0.00089333416,"threshold_uncertainty_score":0.016258478},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27988958,0.011667196,0.22960249,0.015103943,0.002152728,0.00010076997,0.00097261544,0.0010909614,0.45941973],"genre_scores_gemma":[0.9297113,0.0029864819,0.019552644,0.0010012795,0.0013961135,0.00013936586,0.00032333782,0.00023896126,0.044650663],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99871933,0.0002598108,0.00007744997,0.00036391287,0.00036050763,0.00021895315],"domain_scores_gemma":[0.9958916,0.0023899,0.0003058981,0.00038938626,0.00041675445,0.0006064447],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020795173,0.0010766607,0.001633897,0.005343446,0.005379126,0.0046313205,0.0023323316,0.001650362,0.015691184],"category_scores_gemma":[0.0063841,0.0008971714,0.0011138386,0.0036660642,0.0066047753,0.0154219875,0.004781905,0.0046641068,0.001694509],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018900873,0.000009056733,0.00008733351,0.000022920165,0.000006404057,0.000030136036,0.0001340947,0.00013756835,0.00014431166,0.99648076,0.00087818835,0.0020503576],"study_design_scores_gemma":[0.000011628919,0.0000037943869,0.000084018015,0.000006690128,0.000011846513,0.000055007746,0.000032114815,0.0005399589,0.00016137083,0.99573034,0.003354216,0.000009131492],"about_ca_topic_score_codex":0.0017248786,"about_ca_topic_score_gemma":0.0015888438,"teacher_disagreement_score":0.015691184,"about_ca_system_score_codex":0.0034277826,"about_ca_system_score_gemma":0.001580982,"threshold_uncertainty_score":0.05249226},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.456572,0.004809194,0.41565868,0.018561421,0.001105408,0.00008329408,0.00045716774,0.0002994419,0.102453426],"genre_scores_gemma":[0.8969307,0.0026018762,0.054100685,0.0013825195,0.0017666992,0.00014665796,0.0006539628,0.0003444834,0.042072363],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989833,0.0004564447,0.00005278689,0.00019183796,0.00018664334,0.00012895172],"domain_scores_gemma":[0.9917143,0.0064988043,0.0003503818,0.00033623053,0.0004666603,0.0006336419],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034256869,0.0012447301,0.002034361,0.0023964618,0.0021393,0.0034552997,0.0029033965,0.0032186818,0.009448193],"category_scores_gemma":[0.015536157,0.0008756604,0.0013177539,0.0018164478,0.004900671,0.010091391,0.003848632,0.004799882,0.0007335844],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005658846,0.000028442606,0.00016162623,0.000052409792,0.000013426935,0.00006515572,0.00018066545,0.0021606314,0.00030371058,0.99129444,0.0018980944,0.0037848454],"study_design_scores_gemma":[0.000013696232,0.000011794341,0.000104029474,0.000011731039,0.000005514081,0.000039587092,0.00006125302,0.011653495,0.000108878565,0.9872355,0.00074371934,0.000010868016],"about_ca_topic_score_codex":0.0018513703,"about_ca_topic_score_gemma":0.0012620811,"teacher_disagreement_score":0.009448193,"about_ca_system_score_codex":0.0020115373,"about_ca_system_score_gemma":0.0009596957,"threshold_uncertainty_score":0.03160739},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.52773064,0.0013532602,0.43232244,0.0029145244,0.00017014763,0.000058033424,0.00023775351,0.00032488993,0.03488832],"genre_scores_gemma":[0.95920527,0.0007676448,0.034829885,0.00039713836,0.00040641165,0.00008278144,0.00016190577,0.00008294446,0.0040659807],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99896646,0.00027859316,0.00004046996,0.00029232894,0.00028826788,0.00013383284],"domain_scores_gemma":[0.99201596,0.005329875,0.0008635439,0.0007579984,0.0004254259,0.000607239],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016364643,0.0007245623,0.00066212576,0.002695626,0.0012689746,0.002199599,0.001172799,0.00083045405,0.003839745],"category_scores_gemma":[0.014304924,0.00042158156,0.0008462217,0.0015325265,0.0040132217,0.0047242776,0.0032382295,0.0032141078,0.00040749562],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009908088,0.000052299514,0.0023946383,0.00012544253,0.000022443512,0.00017701017,0.00041097697,0.009682329,0.006555873,0.9589202,0.0019276999,0.019631995],"study_design_scores_gemma":[0.0000243613,0.00009648874,0.0028222236,0.000034703,0.000022124323,0.0007094024,0.00018223173,0.1494179,0.0060620937,0.83715844,0.0034304538,0.000039605242],"about_ca_topic_score_codex":0.0006453361,"about_ca_topic_score_gemma":0.00046921975,"teacher_disagreement_score":0.003839745,"about_ca_system_score_codex":0.001352707,"about_ca_system_score_gemma":0.0003550473,"threshold_uncertainty_score":0.012845159},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3945166,0.00077073905,0.5691022,0.00029169957,0.00007714593,0.00012534996,0.00072644785,0.0005013004,0.03388858],"genre_scores_gemma":[0.8087213,0.00061148,0.17489886,0.00020426711,0.0000706558,0.0002561573,0.0012859772,0.00021870337,0.013732574],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993311,0.00015704555,0.00003905554,0.0002092584,0.00013109713,0.00013244539],"domain_scores_gemma":[0.9986304,0.0004483962,0.00020180408,0.00035156342,0.0001761594,0.00019169484],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046786756,0.00050030276,0.00041722687,0.0010450383,0.00082377734,0.0013507226,0.00092653354,0.00031755873,0.004209875],"category_scores_gemma":[0.002032008,0.00048535032,0.00059,0.0012109356,0.0011265895,0.0025420068,0.001508626,0.0010370768,0.00042846464],"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.00015748956,0.00004988318,0.0008284401,0.00013228325,0.000026280873,0.00018586578,0.0006459779,0.015410902,0.0065416526,0.9433848,0.0021617687,0.030474517],"study_design_scores_gemma":[0.000031168303,0.00004724896,0.0007769089,0.00003961738,0.000027363576,0.00018836839,0.00021990805,0.03511942,0.0025921909,0.95070356,0.010236134,0.00001801758],"about_ca_topic_score_codex":0.0016096644,"about_ca_topic_score_gemma":0.0020314762,"teacher_disagreement_score":0.004209875,"about_ca_system_score_codex":0.0009565846,"about_ca_system_score_gemma":0.0004008464,"threshold_uncertainty_score":0.014083445},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.52112865,0.001855209,0.41054645,0.0023538822,0.00045278788,0.00006308489,0.00040379044,0.000965254,0.062230825],"genre_scores_gemma":[0.9277935,0.0005045739,0.060526893,0.0005522749,0.0004128785,0.000119045726,0.00024420983,0.00027188266,0.009574665],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99834454,0.00035712894,0.00012439581,0.0003352273,0.00054572325,0.00029303486],"domain_scores_gemma":[0.99492514,0.0027236023,0.00064568233,0.0007328694,0.0005134686,0.0004592101],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018859043,0.00064569357,0.00068727223,0.0014187754,0.0012587503,0.002155452,0.0011443611,0.00073844194,0.0037812162],"category_scores_gemma":[0.009023289,0.000568103,0.0011349515,0.0012238753,0.0035221048,0.005317993,0.0027238373,0.0026495466,0.0009248322],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016669865,0.0000436223,0.0016543632,0.0001032183,0.000016937958,0.0004524033,0.00036570342,0.0060016033,0.0061105588,0.95990556,0.0021416596,0.023037719],"study_design_scores_gemma":[0.000019088136,0.00010866042,0.0012067647,0.000040209994,0.000018446559,0.00073657645,0.00010567405,0.040187642,0.0063763317,0.94563156,0.005531971,0.000037094233],"about_ca_topic_score_codex":0.00050845207,"about_ca_topic_score_gemma":0.000318876,"teacher_disagreement_score":0.0037812162,"about_ca_system_score_codex":0.0012137752,"about_ca_system_score_gemma":0.0005924959,"threshold_uncertainty_score":0.0126494765},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.62265015,0.003763805,0.16353548,0.07279175,0.0012649554,0.00015027383,0.0016106622,0.0014579596,0.13277495],"genre_scores_gemma":[0.9669251,0.0013110338,0.014070043,0.0048160036,0.001048691,0.00023749594,0.0004924972,0.000251189,0.010847925],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.996563,0.0010937187,0.0001756303,0.0010476673,0.0006885339,0.00043141996],"domain_scores_gemma":[0.9571296,0.031393975,0.0021490115,0.006318329,0.0016286941,0.0013804453],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0044245785,0.0009819326,0.0036725092,0.0029793002,0.003616453,0.0057000965,0.0029805212,0.0063714692,0.008111282],"category_scores_gemma":[0.03693131,0.0014427066,0.0018293696,0.0026917104,0.009299533,0.01741437,0.004882963,0.005911629,0.0011289121],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009832424,0.00003633836,0.0012260082,0.00011549078,0.000039835166,0.000118790595,0.00030023785,0.0027676476,0.00048225152,0.9834517,0.007411651,0.0039517567],"study_design_scores_gemma":[0.000032209384,0.0000074065824,0.0002231976,0.00002002856,0.000011846583,0.000101367994,0.000060033013,0.0042251153,0.00019182317,0.9939203,0.001195028,0.000011498165],"about_ca_topic_score_codex":0.00094730576,"about_ca_topic_score_gemma":0.0008671861,"teacher_disagreement_score":0.008111282,"about_ca_system_score_codex":0.0021415225,"about_ca_system_score_gemma":0.0010694584,"threshold_uncertainty_score":0.027134895},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6394386,0.000984568,0.3072208,0.011090883,0.00016642002,0.00014919716,0.00067728444,0.0009759427,0.039296325],"genre_scores_gemma":[0.9776363,0.00044298917,0.015876481,0.0011108574,0.00012325238,0.00030173163,0.0003012489,0.00015017728,0.0040569664],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997267,0.00063608354,0.0001314083,0.0009802249,0.00043812333,0.0005472574],"domain_scores_gemma":[0.97217464,0.018346084,0.0025108783,0.004005714,0.0015296508,0.001432945],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004672244,0.00055693544,0.0018856226,0.0020542694,0.0028209197,0.0027603868,0.0023980709,0.0028054363,0.0042108507],"category_scores_gemma":[0.037615485,0.00079324556,0.0012631778,0.0012747166,0.0058143535,0.008173919,0.0028952719,0.003468348,0.0007314905],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00037536418,0.00009864036,0.004995557,0.00013453049,0.00004906284,0.0002213386,0.00066913344,0.021788787,0.0030251944,0.9495022,0.0054398016,0.013700508],"study_design_scores_gemma":[0.00009751324,0.00007910574,0.0017917659,0.000039637547,0.000018497802,0.00030527386,0.00018394792,0.097255416,0.002374662,0.89478934,0.0030172379,0.0000475393],"about_ca_topic_score_codex":0.0024108777,"about_ca_topic_score_gemma":0.0023492933,"teacher_disagreement_score":0.004672244,"about_ca_system_score_codex":0.00292821,"about_ca_system_score_gemma":0.0012868334,"threshold_uncertainty_score":0.024709463},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39847603,0.0013316402,0.5589958,0.0022089689,0.00024163553,0.00025098864,0.00093054684,0.0006157009,0.036948778],"genre_scores_gemma":[0.88771045,0.0016069843,0.089963384,0.0006076074,0.00022079615,0.00043260967,0.000856793,0.00022443559,0.018376987],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985306,0.0005510011,0.000054263175,0.00034750774,0.0002497082,0.00026679],"domain_scores_gemma":[0.99568295,0.0021207945,0.0009268997,0.0006023841,0.0002968503,0.00037017642],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001586533,0.0006903727,0.00092743046,0.0018485385,0.0013357832,0.0019446755,0.001224873,0.0011761939,0.00458552],"category_scores_gemma":[0.0096585965,0.0006670382,0.0010880148,0.0019351222,0.004097582,0.0041873986,0.0020583174,0.0016234012,0.000756873],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000093908304,0.000032968594,0.00093514944,0.000083427694,0.000024957017,0.000113428876,0.00015434492,0.031223241,0.0014989313,0.95548046,0.0022379851,0.008121233],"study_design_scores_gemma":[0.000043916756,0.000041254323,0.00072372495,0.000030153824,0.000015733503,0.000110071654,0.0000616931,0.11549576,0.00087882526,0.87956125,0.0030046208,0.00003298222],"about_ca_topic_score_codex":0.0047200937,"about_ca_topic_score_gemma":0.0043975944,"teacher_disagreement_score":0.0047200937,"about_ca_system_score_codex":0.003028166,"about_ca_system_score_gemma":0.0014627255,"threshold_uncertainty_score":0.021970987},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.83906895,0.0012519903,0.120661,0.001101152,0.0000929437,0.000047869693,0.00043591112,0.00030802906,0.037032116],"genre_scores_gemma":[0.9836347,0.0002541482,0.01366655,0.00012242697,0.0000987603,0.00006142972,0.0002715586,0.000020598563,0.0018698397],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978225,0.0003622249,0.00012320123,0.0007095808,0.00061729277,0.00036513884],"domain_scores_gemma":[0.99159765,0.004947891,0.0010560584,0.0010997962,0.00060306804,0.0006954144],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016076487,0.0004991219,0.00064150564,0.0024676202,0.0019574156,0.001985355,0.0011160111,0.0010428518,0.004459808],"category_scores_gemma":[0.006127257,0.00037330226,0.0005783463,0.0016193743,0.0032184264,0.006229175,0.002980242,0.001969402,0.00028003685],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009907303,0.000049645172,0.0029709768,0.00008043358,0.00001982897,0.00015973444,0.0002999108,0.0027487592,0.0045475173,0.97793764,0.0008980724,0.010188355],"study_design_scores_gemma":[0.000020268511,0.000042497613,0.0012947376,0.00002502295,0.00001942273,0.0002909743,0.000116975425,0.01693907,0.0043242006,0.9737492,0.0031632967,0.0000143428],"about_ca_topic_score_codex":0.00050113414,"about_ca_topic_score_gemma":0.0006332105,"teacher_disagreement_score":0.004459808,"about_ca_system_score_codex":0.0011726024,"about_ca_system_score_gemma":0.0004372992,"threshold_uncertainty_score":0.014919519},"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":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21209164,0.0012000286,0.6862205,0.0032546127,0.0005211613,0.0001554062,0.0011516347,0.00053078984,0.094874255],"genre_scores_gemma":[0.85525423,0.00074923376,0.13149035,0.0006501334,0.00020696627,0.00017335362,0.00082755723,0.00017374422,0.010474467],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9995209,0.000082305094,0.000029086767,0.0001402176,0.00010123304,0.00012629271],"domain_scores_gemma":[0.99803585,0.00097455736,0.00021358844,0.00023388876,0.0002706355,0.00027153184],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00067783927,0.00052785384,0.00053786795,0.00087521254,0.001153964,0.00095233234,0.00092148286,0.001124594,0.009973852],"category_scores_gemma":[0.0047192113,0.0002896023,0.0007190456,0.0005075862,0.001100438,0.0025995271,0.001330059,0.0013939404,0.0016391674],"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.00025242358,0.000109264765,0.0019813473,0.0007327967,0.000038536735,0.0006401674,0.00047038894,0.032200854,0.061358128,0.8524715,0.014123529,0.035621185],"study_design_scores_gemma":[0.000062244835,0.00026276277,0.0015392549,0.00015499588,0.000047830297,0.0013905492,0.00048128175,0.1274416,0.040105417,0.7965642,0.031875998,0.00007385176],"about_ca_topic_score_codex":0.0007355823,"about_ca_topic_score_gemma":0.0012578329,"teacher_disagreement_score":0.9900262,"about_ca_system_score_codex":0.00074026186,"about_ca_system_score_gemma":0.00054878276,"threshold_uncertainty_score":0},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07452982,0.0028955701,0.5904801,0.013928559,0.0017940971,0.00050212484,0.0011754407,0.0029275378,0.3117668],"genre_scores_gemma":[0.5151887,0.0013110905,0.33447307,0.002016092,0.00016462749,0.00069941167,0.0012372831,0.00068949355,0.14422028],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990194,0.00033904886,0.00004870753,0.00024233108,0.0001607354,0.00018974276],"domain_scores_gemma":[0.99918467,0.0004330289,0.000048261587,0.00011164965,0.000096968295,0.00012547601],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008041046,0.001114787,0.00087035244,0.00045504927,0.0014376896,0.003613516,0.0016075416,0.0016585373,0.034413647],"category_scores_gemma":[0.0039455397,0.0005397347,0.0007113375,0.00038844714,0.0017305196,0.004960251,0.002579931,0.0018281197,0.0047525987],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004131379,0.00013315989,0.0010981271,0.000275864,0.00006885723,0.0005865837,0.0012433334,0.024144059,0.001812564,0.8690437,0.030932983,0.070247695],"study_design_scores_gemma":[0.00015711652,0.00013213539,0.00029489113,0.00015438958,0.000031225005,0.00038351174,0.00068361417,0.0842895,0.001807045,0.62656105,0.28542718,0.000078298835],"about_ca_topic_score_codex":0.0041069947,"about_ca_topic_score_gemma":0.0055400957,"teacher_disagreement_score":0.034413647,"about_ca_system_score_codex":0.0013038582,"about_ca_system_score_gemma":0.0006288595,"threshold_uncertainty_score":0.11512506},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.69743145,0.0005604395,0.2566589,0.002340636,0.000046184567,0.00005192185,0.00021559483,0.00016927964,0.042525496],"genre_scores_gemma":[0.9890766,0.0001578789,0.0077539417,0.00008569691,0.000062141815,0.00002654235,0.000053616917,0.000018540293,0.0027650525],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983882,0.0003648975,0.0000636476,0.00034904387,0.00060064544,0.00023355665],"domain_scores_gemma":[0.99311274,0.00393227,0.000722838,0.0012153784,0.0005519547,0.00046477164],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013788877,0.0002339555,0.0005106423,0.0010403086,0.001174401,0.0023195415,0.00084344647,0.00074362213,0.0040429668],"category_scores_gemma":[0.011219888,0.00030359853,0.0005156,0.0007437054,0.005419487,0.0050140843,0.0024041336,0.0018446496,0.00028577255],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011829004,0.000008689324,0.00051544205,0.000014490421,0.0000026662726,0.00004695219,0.00013861971,0.0027403925,0.00049929565,0.99366623,0.00027218493,0.0020832215],"study_design_scores_gemma":[0.000005376636,0.000009812039,0.00039979265,0.0000051476486,0.0000021674323,0.00010583187,0.000061106206,0.034772016,0.0004871484,0.9634789,0.0006652738,0.0000075200605],"about_ca_topic_score_codex":0.00082150096,"about_ca_topic_score_gemma":0.00069614575,"teacher_disagreement_score":0.0040429668,"about_ca_system_score_codex":0.0017586983,"about_ca_system_score_gemma":0.00067260244,"threshold_uncertainty_score":0.013525009},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9523982,0.0004291384,0.030357482,0.0008731685,0.000037403155,0.000020783851,0.00017822244,0.00020270211,0.015502913],"genre_scores_gemma":[0.98843294,0.00015072,0.008769741,0.00006020598,0.000034229368,0.000041745247,0.000102390884,0.000030847015,0.002377179],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995566,0.00008304469,0.000030497573,0.00011935375,0.0001294392,0.00008104363],"domain_scores_gemma":[0.9957189,0.0022154078,0.0005146621,0.00040620827,0.00052142877,0.00062335597],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011254128,0.00024703378,0.0004923541,0.0011856288,0.0016418229,0.0019265797,0.0009775665,0.0006384191,0.0031489981],"category_scores_gemma":[0.0076213293,0.00026407742,0.0004266904,0.0005283381,0.0025772036,0.0025549824,0.00096515386,0.0010468554,0.0003166023],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00060291117,0.00008789882,0.010439718,0.0001900283,0.000035366025,0.0004497474,0.0012590282,0.012707238,0.028946465,0.9158147,0.002587033,0.026879873],"study_design_scores_gemma":[0.000053764194,0.00016492924,0.0062846257,0.00009300993,0.000035991594,0.001014036,0.0005660718,0.055864327,0.010956,0.9183969,0.0065013533,0.000068974965],"about_ca_topic_score_codex":0.0010931195,"about_ca_topic_score_gemma":0.0009373597,"teacher_disagreement_score":0.0031489981,"about_ca_system_score_codex":0.0011903419,"about_ca_system_score_gemma":0.0007056843,"threshold_uncertainty_score":0.010534465},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7955277,0.003219855,0.05901614,0.005623426,0.00062034937,0.00004118143,0.0004865307,0.00029434913,0.13517056],"genre_scores_gemma":[0.984012,0.0008409691,0.0056878864,0.00040780223,0.0005095606,0.00006036895,0.0002118409,0.000088555695,0.008180915],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988366,0.000464359,0.000057196878,0.00017979722,0.00025012752,0.00021195397],"domain_scores_gemma":[0.987927,0.00850974,0.0009914875,0.00050726434,0.00069382106,0.0013706434],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022322596,0.00066725054,0.0013237157,0.004914758,0.0023951011,0.0041606673,0.0022487724,0.0015256352,0.0076998137],"category_scores_gemma":[0.011650925,0.00078548404,0.00066388526,0.0023688416,0.005004067,0.009585131,0.002514667,0.00273702,0.00064035726],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007483859,0.000027865091,0.00082693924,0.000045171528,0.000009960689,0.000051636478,0.0001945257,0.002671161,0.0003637339,0.99066025,0.001278084,0.0037958086],"study_design_scores_gemma":[0.000011259563,0.0000135698965,0.0007446136,0.00002647069,0.000010601447,0.00009390628,0.00007492283,0.011213545,0.00018631804,0.98635364,0.0012541476,0.00001704088],"about_ca_topic_score_codex":0.0015949726,"about_ca_topic_score_gemma":0.0018343794,"teacher_disagreement_score":0.0076998137,"about_ca_system_score_codex":0.0020338043,"about_ca_system_score_gemma":0.0007623967,"threshold_uncertainty_score":0.025758445},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7853542,0.00042135164,0.16290228,0.00059381133,0.00010806757,0.0001348609,0.00018087956,0.0002719097,0.050032627],"genre_scores_gemma":[0.95971274,0.00012817094,0.03387687,0.00011211394,0.000029159637,0.00014715431,0.0001303792,0.000106632644,0.005756741],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990132,0.00023764839,0.000044879333,0.00019043936,0.0003451751,0.00016868614],"domain_scores_gemma":[0.99783605,0.000992921,0.00018386418,0.0005124649,0.00023959106,0.00023508267],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009962645,0.00033454606,0.0004928859,0.0010437921,0.0015439962,0.0014470753,0.0008370341,0.0008187349,0.00669619],"category_scores_gemma":[0.005398726,0.00035743375,0.00059784285,0.0006161967,0.0019616708,0.001876448,0.0017752328,0.0013619978,0.00050753856],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006966524,0.000034556986,0.00073987315,0.000045386154,0.000007538038,0.0000878183,0.00013664308,0.006570579,0.0036062251,0.97885203,0.0007802238,0.009069487],"study_design_scores_gemma":[0.000026596574,0.00006214371,0.0004326107,0.00001725512,0.0000067901087,0.00010996452,0.00007227465,0.05715436,0.004704872,0.9349594,0.0024387033,0.000014953983],"about_ca_topic_score_codex":0.0006363292,"about_ca_topic_score_gemma":0.00083521364,"teacher_disagreement_score":0.00669619,"about_ca_system_score_codex":0.00079369615,"about_ca_system_score_gemma":0.0006140162,"threshold_uncertainty_score":0.022400975},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7579276,0.0034140616,0.20500405,0.0046360083,0.0002097424,0.0001840081,0.0016741758,0.00079318724,0.026157163],"genre_scores_gemma":[0.98062205,0.00095167983,0.010735855,0.00043404792,0.00034167254,0.0002073517,0.00085696694,0.00017474606,0.0056755743],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9918498,0.002880738,0.00048371838,0.0020364858,0.0016365504,0.0011128238],"domain_scores_gemma":[0.9105068,0.069693506,0.006847657,0.005638286,0.002964074,0.004349793],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010431468,0.0011049749,0.003426364,0.006743322,0.003126349,0.008241034,0.003968892,0.0023929204,0.013362809],"category_scores_gemma":[0.08251724,0.0016031914,0.0019350225,0.0038841446,0.009866294,0.010812801,0.005969594,0.0026747328,0.0012904236],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003562573,0.00007666543,0.009425923,0.0002574983,0.00019114398,0.00047762532,0.0008396447,0.024772817,0.0019103483,0.94519794,0.0043444135,0.012149701],"study_design_scores_gemma":[0.00012662007,0.00014457156,0.0054420587,0.00017682543,0.0001093761,0.0012062973,0.00040323407,0.13095517,0.0035434277,0.8515476,0.006207432,0.00013747021],"about_ca_topic_score_codex":0.0019219668,"about_ca_topic_score_gemma":0.0010770212,"teacher_disagreement_score":0.013362809,"about_ca_system_score_codex":0.003950342,"about_ca_system_score_gemma":0.0010078384,"threshold_uncertainty_score":0.055167556},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.65728754,0.002089081,0.24686624,0.0065239854,0.00059593114,0.00009376623,0.0014147528,0.00054030184,0.08458837],"genre_scores_gemma":[0.9365656,0.0011004619,0.053889528,0.0010201479,0.00023335767,0.00012279025,0.00082883274,0.000395312,0.005844113],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99866223,0.00029645165,0.000051092447,0.000334994,0.00027248485,0.00038269488],"domain_scores_gemma":[0.98766196,0.007963576,0.0009018085,0.0014221943,0.00079920643,0.0012512791],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015465638,0.0006926681,0.000990834,0.0008984031,0.0013365842,0.0017500002,0.0013590474,0.001346272,0.009392457],"category_scores_gemma":[0.016239556,0.0006788384,0.0010764289,0.0007388516,0.0022266433,0.0038844694,0.0022766546,0.0027663696,0.0014528123],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012848579,0.00020607663,0.009119035,0.00074861804,0.000096485455,0.00074348395,0.0011506758,0.06261375,0.060481496,0.796721,0.023291592,0.04354298],"study_design_scores_gemma":[0.00015794947,0.0002703149,0.0044501973,0.00017669571,0.00007977573,0.0013072268,0.000664304,0.17401133,0.0169669,0.7858239,0.016018031,0.000073269875],"about_ca_topic_score_codex":0.001921162,"about_ca_topic_score_gemma":0.0024761928,"teacher_disagreement_score":0.009392457,"about_ca_system_score_codex":0.0012566318,"about_ca_system_score_gemma":0.00073272263,"threshold_uncertainty_score":0.031420946},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40131977,0.0048247823,0.28456712,0.006359099,0.00075351394,0.00008040548,0.0005634905,0.00057903817,0.30095282],"genre_scores_gemma":[0.9603074,0.001289233,0.016775655,0.00080824964,0.0003647878,0.00008347942,0.00021217913,0.00008018503,0.020078804],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99882215,0.0003948519,0.000053192525,0.00022403777,0.0003635691,0.00014217326],"domain_scores_gemma":[0.99752647,0.0012350777,0.00022141516,0.00037802785,0.00036941277,0.00026959268],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014384497,0.0005055717,0.00070438185,0.0013065882,0.0019656762,0.0020090167,0.0013007431,0.0010517782,0.0061112517],"category_scores_gemma":[0.0053835385,0.00034968118,0.0005213122,0.0015244023,0.0036094117,0.0068040574,0.002939131,0.0023237881,0.0008868644],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012469001,0.000006275048,0.00008614227,0.000028629582,0.0000035506941,0.000031658703,0.000101188605,0.0005103558,0.00024634568,0.996626,0.00069135916,0.0016560922],"study_design_scores_gemma":[0.0000073906604,0.000010271391,0.00010033547,0.000014117496,0.000005198611,0.000090370886,0.00005801674,0.003342738,0.0003178514,0.992605,0.0034418032,0.00000689878],"about_ca_topic_score_codex":0.0011094665,"about_ca_topic_score_gemma":0.0006931838,"teacher_disagreement_score":0.0061112517,"about_ca_system_score_codex":0.001490578,"about_ca_system_score_gemma":0.0006278145,"threshold_uncertainty_score":0.020444214},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6900994,0.0020830936,0.20165193,0.0010257572,0.00075015984,0.00009749302,0.0009296025,0.00053310796,0.10282933],"genre_scores_gemma":[0.94049406,0.00059017376,0.034273535,0.00026262345,0.00056332524,0.00024145578,0.0009503445,0.00020152176,0.022422897],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9968839,0.0007439004,0.00033178696,0.00051578105,0.0011948518,0.00032972437],"domain_scores_gemma":[0.9941427,0.0032569007,0.0005214775,0.0005168576,0.0008935771,0.0006685235],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014706223,0.00080352253,0.0017626381,0.005200354,0.003363702,0.0066395057,0.002277414,0.0010825013,0.007051635],"category_scores_gemma":[0.0073631345,0.00093060645,0.0014880167,0.0027207406,0.003490315,0.0068089506,0.0048122047,0.0015894588,0.001047445],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012533928,0.00005638741,0.0010959989,0.00009297794,0.000089597306,0.00022470736,0.00059242296,0.0011233226,0.0017537953,0.98570794,0.001044676,0.008092795],"study_design_scores_gemma":[0.000012287468,0.000021883712,0.00053972163,0.000034947167,0.000047279456,0.00035932797,0.00021105929,0.0042965687,0.0013856122,0.9901024,0.0029678885,0.00002101231],"about_ca_topic_score_codex":0.00032814476,"about_ca_topic_score_gemma":0.0003845398,"teacher_disagreement_score":0.007051635,"about_ca_system_score_codex":0.000978584,"about_ca_system_score_gemma":0.0005778158,"threshold_uncertainty_score":0.023590088},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.86639726,0.00084636046,0.030821584,0.0016407048,0.00014078539,0.000028355811,0.00019378826,0.00023870806,0.099692486],"genre_scores_gemma":[0.9848934,0.00034580572,0.003489699,0.00017567501,0.00011793497,0.000036723395,0.00013537904,0.000056315403,0.010749143],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999453,0.0001758506,0.000021370566,0.00008826822,0.00013022871,0.00013134553],"domain_scores_gemma":[0.9982936,0.0007811591,0.00024434563,0.00013619076,0.0001906586,0.00035411076],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00088558334,0.00055291015,0.00076424645,0.0035407804,0.002936945,0.003217287,0.0011452608,0.0011896606,0.0062301545],"category_scores_gemma":[0.0032202366,0.00059997773,0.0005409894,0.0014642843,0.0027253067,0.004173301,0.0021450375,0.002075734,0.00048791128],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003308988,0.000013430963,0.00038793983,0.000012583517,0.000005555611,0.00010711392,0.00023579708,0.00064975745,0.00041643786,0.9958062,0.0006280305,0.0017041302],"study_design_scores_gemma":[0.000011883613,0.0000073526844,0.0004421271,0.00001307003,0.0000070589003,0.0001375926,0.00021397063,0.0035856552,0.000279573,0.99389714,0.0013952405,0.000009345148],"about_ca_topic_score_codex":0.0016585096,"about_ca_topic_score_gemma":0.0021138226,"teacher_disagreement_score":0.0062301545,"about_ca_system_score_codex":0.0016347069,"about_ca_system_score_gemma":0.00044309994,"threshold_uncertainty_score":0.020841897},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.71409863,0.00260193,0.15654157,0.0026325919,0.00032465832,0.00009421103,0.0005437745,0.00059153466,0.12257111],"genre_scores_gemma":[0.9385271,0.0012340576,0.019686544,0.00043583332,0.00030528364,0.00015711809,0.0004091693,0.00024505725,0.038999725],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99836534,0.0005225081,0.000083417326,0.0003182793,0.00037771626,0.0003326903],"domain_scores_gemma":[0.988791,0.006958184,0.0012879861,0.00074494875,0.0008876478,0.0013302355],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013296107,0.0009265852,0.0018420016,0.0045133433,0.0030769769,0.0046551563,0.0024422968,0.0019897239,0.010138759],"category_scores_gemma":[0.010428351,0.0011383264,0.0011477525,0.00271046,0.004457543,0.0077463835,0.003840502,0.0027495984,0.0012326193],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004354621,0.000024945486,0.00021390128,0.00004410989,0.00001116342,0.00014148142,0.00042181587,0.001345198,0.00038252404,0.99325573,0.0011841734,0.0029312905],"study_design_scores_gemma":[0.000013130982,0.00000928783,0.00015819252,0.000018089244,0.000012170607,0.00014458173,0.00015759756,0.00711027,0.00023490052,0.9905461,0.0015816897,0.000014022398],"about_ca_topic_score_codex":0.0029024582,"about_ca_topic_score_gemma":0.0028900206,"teacher_disagreement_score":0.010138759,"about_ca_system_score_codex":0.0013872947,"about_ca_system_score_gemma":0.0008741907,"threshold_uncertainty_score":0.033917487},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00318017,0.073053606,0.12330923,0.0037944932,0.0034104337,0.00006770986,0.00026161512,0.00089890324,0.7920239],"genre_scores_gemma":[0.10588638,0.10695157,0.12665349,0.0027962348,0.0065343035,0.0002042078,0.0007572447,0.0011181723,0.6490984],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991573,0.00012785815,0.000043300384,0.00013382753,0.00047297843,0.00006472038],"domain_scores_gemma":[0.99885786,0.00057732733,0.000047095036,0.0001630994,0.00028192313,0.00007255778],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007692479,0.0008743965,0.00084244844,0.0032663606,0.0011595191,0.0038950504,0.000841436,0.0012012572,0.037703916],"category_scores_gemma":[0.0028685876,0.0004234472,0.0007398813,0.0039864844,0.00248374,0.0045687347,0.0019056159,0.002823362,0.01731931],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001059185,0.000017371583,0.00009597421,0.00026821284,0.0000066222706,0.00011155597,0.0002592248,0.0010541369,0.0008922601,0.82126504,0.0430452,0.13297392],"study_design_scores_gemma":[0.0000027611986,0.000012721297,0.00019580065,0.00017427304,0.0000042571364,0.0004421646,0.00008400429,0.0025070384,0.00053024193,0.43706495,0.5589664,0.000015411219],"about_ca_topic_score_codex":0.0008534432,"about_ca_topic_score_gemma":0.00083254225,"teacher_disagreement_score":0.037703916,"about_ca_system_score_codex":0.0016431896,"about_ca_system_score_gemma":0.0009447617,"threshold_uncertainty_score":0.12613213},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.79701316,0.00044961958,0.19343625,0.0007264274,0.00005134035,0.00012663972,0.0005742802,0.00084382336,0.0067785624],"genre_scores_gemma":[0.9743635,0.00023351947,0.0218116,0.0001279131,0.000041684547,0.00011609714,0.00035271657,0.000121175915,0.0028317827],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986646,0.00042939265,0.00007233118,0.0003518364,0.00024849016,0.00023331516],"domain_scores_gemma":[0.97348714,0.017788256,0.0032355255,0.002855762,0.0013250726,0.0013081946],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029108883,0.00034625147,0.0006664949,0.002142982,0.0010410849,0.0018050084,0.0014641957,0.0009734937,0.003542438],"category_scores_gemma":[0.025955008,0.00074656913,0.00065147964,0.0010742669,0.0026845299,0.0038850335,0.0011025639,0.0013188897,0.00045508638],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012120632,0.0003357771,0.032913778,0.00048811806,0.00013695884,0.0010281631,0.0010060689,0.28779244,0.02965934,0.6017395,0.005733832,0.03795401],"study_design_scores_gemma":[0.00008268032,0.00020602114,0.0057410244,0.000075641474,0.000036861195,0.00047863042,0.00016801077,0.6634137,0.0062285876,0.32107568,0.0024391708,0.000054022967],"about_ca_topic_score_codex":0.0018125129,"about_ca_topic_score_gemma":0.0026231308,"teacher_disagreement_score":0.003542438,"about_ca_system_score_codex":0.0023634837,"about_ca_system_score_gemma":0.0006675495,"threshold_uncertainty_score":0.017148376},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49066615,0.0016014477,0.37932438,0.0051647294,0.00036010277,0.00015605801,0.00082067255,0.00018582378,0.1217207],"genre_scores_gemma":[0.9302599,0.00071971706,0.040198736,0.00029037351,0.00031352043,0.00018193376,0.00041944667,0.000081463564,0.027534975],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99891114,0.00044729162,0.000056253888,0.00020649197,0.00023490611,0.00014389846],"domain_scores_gemma":[0.9963658,0.0022936908,0.000470392,0.00023676603,0.00029229678,0.00034112294],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011080471,0.0005448971,0.0012249314,0.0017813364,0.0024273056,0.0045915945,0.0018883941,0.0029183978,0.013080902],"category_scores_gemma":[0.005766509,0.00062359276,0.0010371306,0.0027750283,0.0027317659,0.005883774,0.0027800591,0.002664576,0.00055866095],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000133371705,0.000020393878,0.0001230077,0.00002199347,0.0000073469505,0.000047792317,0.00008021359,0.007545926,0.00019742601,0.98952764,0.0007615052,0.0016534377],"study_design_scores_gemma":[0.000012115179,0.0000049360397,0.000078507896,0.0000064807573,0.00000408229,0.000038339313,0.00007172248,0.032981873,0.000119335695,0.9657449,0.0009318457,0.000005876665],"about_ca_topic_score_codex":0.0022954359,"about_ca_topic_score_gemma":0.0018832119,"teacher_disagreement_score":0.013080902,"about_ca_system_score_codex":0.0023507022,"about_ca_system_score_gemma":0.0009343592,"threshold_uncertainty_score":0.043759942},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.88415956,0.00088934554,0.086801864,0.00085312215,0.00008157868,0.00003321389,0.0007340362,0.0002963949,0.026150862],"genre_scores_gemma":[0.9797937,0.00017850626,0.016635282,0.00007215297,0.00006508328,0.000039380175,0.0003045028,0.000042130145,0.0028692617],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998784,0.0002251743,0.000099587145,0.00036211536,0.00039128138,0.00013791183],"domain_scores_gemma":[0.9943984,0.0027106532,0.00076504383,0.0006955136,0.0007520266,0.0006783403],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000926489,0.0002879331,0.0008087931,0.0029454583,0.0021630577,0.0034858317,0.0013044277,0.0007156016,0.004376914],"category_scores_gemma":[0.0071102646,0.0005761401,0.0005697042,0.0020156298,0.0033264172,0.0060300343,0.0026214547,0.0010261441,0.0004144437],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001222122,0.000018083067,0.0026380292,0.00009969979,0.000019164661,0.00016434911,0.00059600046,0.0028632383,0.0037025718,0.9820655,0.0008815514,0.0068296352],"study_design_scores_gemma":[0.000020875437,0.000044012606,0.0019220938,0.000050001596,0.00003444818,0.00083569257,0.00046662806,0.017241396,0.005442654,0.96646065,0.0074414397,0.000040023333],"about_ca_topic_score_codex":0.00052823615,"about_ca_topic_score_gemma":0.0005803497,"teacher_disagreement_score":0.004376914,"about_ca_system_score_codex":0.0015793743,"about_ca_system_score_gemma":0.0004304697,"threshold_uncertainty_score":0.014642239},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7784556,0.0025464725,0.07290309,0.017325383,0.0007242118,0.000041561318,0.00038250015,0.00034427329,0.12727688],"genre_scores_gemma":[0.98368937,0.0007437724,0.0047893883,0.0005808465,0.0006191156,0.000035022505,0.00017562466,0.00004471069,0.009322122],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99880755,0.0004117926,0.00005583162,0.00022633166,0.0002921905,0.0002062948],"domain_scores_gemma":[0.9950854,0.0027376513,0.0004682848,0.0006251817,0.00051897886,0.00056438276],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002082827,0.0005918158,0.0013292714,0.0022606752,0.0022627306,0.0032559605,0.0011241693,0.0021803842,0.005394539],"category_scores_gemma":[0.008407228,0.00045367694,0.0007929051,0.0016731874,0.0072634825,0.011146731,0.0037749796,0.002972441,0.0005617713],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000035395606,0.000010587031,0.00022470094,0.000018244576,0.0000036694626,0.000028023976,0.00014048263,0.0007097447,0.00017200147,0.99646,0.00075444113,0.0014427159],"study_design_scores_gemma":[0.00000982977,0.0000035507073,0.00008112422,0.000005977496,0.0000019083684,0.000016682041,0.00005063854,0.0015722045,0.00008073186,0.99741995,0.0007534511,0.0000039344263],"about_ca_topic_score_codex":0.0017160353,"about_ca_topic_score_gemma":0.0010254581,"teacher_disagreement_score":0.005394539,"about_ca_system_score_codex":0.0015595922,"about_ca_system_score_gemma":0.00083502743,"threshold_uncertainty_score":0.018046558},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20093037,0.009783629,0.15149306,0.1628327,0.005358239,0.00012648621,0.0019964606,0.0023271986,0.46515185],"genre_scores_gemma":[0.84917134,0.003488613,0.024732662,0.014945099,0.0037912838,0.00028180648,0.001032916,0.00056302495,0.1019932],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99784493,0.000490757,0.000052954918,0.0007069125,0.0005222248,0.0003822885],"domain_scores_gemma":[0.99295723,0.004075954,0.00025279168,0.00140048,0.0006894631,0.0006239958],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027068031,0.0007275437,0.0012376427,0.0014949413,0.0029419523,0.0037574267,0.0020469052,0.003033164,0.020221159],"category_scores_gemma":[0.013372407,0.00057510514,0.001301178,0.001471786,0.006122659,0.01600938,0.003957104,0.0072000776,0.005147214],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008309946,0.000035591787,0.0003947781,0.00004452993,0.000013198018,0.000047277983,0.00017995744,0.0011548082,0.00024755034,0.96851736,0.020506667,0.008775283],"study_design_scores_gemma":[0.000021883725,0.000014270368,0.0001324458,0.000017446444,0.000004044879,0.000031130552,0.000048228496,0.0022994764,0.00024403432,0.9813286,0.015850892,0.0000075285448],"about_ca_topic_score_codex":0.0034248189,"about_ca_topic_score_gemma":0.0021430403,"teacher_disagreement_score":0.020221159,"about_ca_system_score_codex":0.00394998,"about_ca_system_score_gemma":0.0017251208,"threshold_uncertainty_score":0.067646444},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.83655626,0.0016344979,0.06354183,0.003155644,0.0002568986,0.000039684506,0.0003829907,0.0002065934,0.09422561],"genre_scores_gemma":[0.98533416,0.00044009028,0.004675587,0.00016078241,0.00033728467,0.00005045684,0.00016359963,0.000043738026,0.008794432],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99931026,0.0001975406,0.000040109546,0.00013403565,0.0002038845,0.00011414111],"domain_scores_gemma":[0.9959785,0.0023345826,0.000547482,0.00022927727,0.0003818554,0.0005283412],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001032627,0.0006785771,0.00085882004,0.0042132726,0.002478058,0.004714119,0.0014712722,0.0012873496,0.007052136],"category_scores_gemma":[0.007479738,0.0006191735,0.00060104684,0.0019458446,0.004046932,0.0070389723,0.0020853123,0.0022554016,0.00060935953],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030312876,0.00001705132,0.00032599014,0.000021538386,0.000005365891,0.000029742027,0.0002179746,0.0015522545,0.0002876332,0.9948932,0.0006222774,0.0019966292],"study_design_scores_gemma":[0.000006128839,0.000006441027,0.00024988546,0.0000075852668,0.0000037873183,0.000037985697,0.00006613524,0.0055576274,0.00015236098,0.9933656,0.0005390887,0.0000073808924],"about_ca_topic_score_codex":0.0010284499,"about_ca_topic_score_gemma":0.0011986609,"teacher_disagreement_score":0.007052136,"about_ca_system_score_codex":0.0018021187,"about_ca_system_score_gemma":0.0005018012,"threshold_uncertainty_score":0.023591697},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8782135,0.00084463035,0.059959587,0.006883617,0.00008733591,0.000049784147,0.00042966433,0.00031607406,0.053215753],"genre_scores_gemma":[0.9927785,0.00023506625,0.003886293,0.0004031257,0.00003128119,0.00005702699,0.00014998156,0.000037756217,0.0024211046],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99885035,0.00028157115,0.000042441134,0.00027910937,0.00023506438,0.00031151334],"domain_scores_gemma":[0.9905896,0.0062945373,0.00068344636,0.0009725156,0.00067592185,0.00078391033],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013683098,0.0004719133,0.0011166591,0.0014033929,0.0018005128,0.0026416164,0.0012582858,0.0015261772,0.0058809905],"category_scores_gemma":[0.01133715,0.000490969,0.0005657619,0.0011452258,0.00335816,0.006676741,0.0027844778,0.0019162646,0.00041037393],"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.00020453996,0.000047257374,0.0019346838,0.000098400065,0.000016579219,0.00020725201,0.0007045046,0.01250512,0.00243757,0.9724887,0.0038795285,0.0054757707],"study_design_scores_gemma":[0.000041564323,0.000023135266,0.00087723014,0.000029661314,0.000009009634,0.00014119873,0.0004402402,0.03357045,0.001672249,0.9589998,0.004178677,0.000016819053],"about_ca_topic_score_codex":0.0031747627,"about_ca_topic_score_gemma":0.0025625254,"teacher_disagreement_score":0.0058809905,"about_ca_system_score_codex":0.0017459017,"about_ca_system_score_gemma":0.00064748555,"threshold_uncertainty_score":0.019673824},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35080877,0.009423574,0.18395385,0.06941043,0.0044204537,0.00007518637,0.00070987816,0.0009149099,0.38028297],"genre_scores_gemma":[0.9420719,0.002846546,0.023004452,0.0035665943,0.0015896803,0.00010772636,0.00023356178,0.00014922344,0.026430395],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990721,0.00020348147,0.00004383602,0.000262696,0.00024660878,0.00017124483],"domain_scores_gemma":[0.99555176,0.0029608447,0.00026465935,0.00059589656,0.00028052035,0.00034623157],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025186099,0.0006538327,0.00089716195,0.0020243824,0.0021981031,0.0026021258,0.0017556103,0.0018856926,0.0063047283],"category_scores_gemma":[0.00936433,0.00038717446,0.00072182727,0.002223481,0.0055800336,0.007819939,0.0034304175,0.0040974435,0.0011856802],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000086908265,0.000030277704,0.000786021,0.0000661384,0.000008196054,0.00012423629,0.00025162759,0.003112419,0.0007600626,0.9717629,0.01011047,0.012900834],"study_design_scores_gemma":[0.00001924477,0.000025079691,0.00047825443,0.000022221262,0.000009231496,0.0001123518,0.00010371647,0.009031631,0.0006903622,0.9746115,0.014872732,0.000023625147],"about_ca_topic_score_codex":0.0017642867,"about_ca_topic_score_gemma":0.0015512945,"teacher_disagreement_score":0.0063047283,"about_ca_system_score_codex":0.002222049,"about_ca_system_score_gemma":0.00084046595,"threshold_uncertainty_score":0.021091461},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.56556165,0.0014915006,0.4021268,0.0030601288,0.00013488522,0.000056047786,0.0008701577,0.00037786047,0.026320923],"genre_scores_gemma":[0.97958446,0.00051534653,0.014830301,0.0002235375,0.00013218897,0.00006664861,0.00024635482,0.00010519372,0.004295931],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985139,0.0004757014,0.000060191524,0.000234507,0.00044080993,0.00027495882],"domain_scores_gemma":[0.9762205,0.015886065,0.0023602273,0.0013245648,0.0027342048,0.0014744614],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030163887,0.00056871463,0.00086221984,0.0017167986,0.00091634167,0.0025840448,0.0013336481,0.00078085734,0.003120867],"category_scores_gemma":[0.028907428,0.0004983482,0.00077107275,0.0010090455,0.003932317,0.003134447,0.0012581857,0.0021470934,0.00036980232],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013284323,0.000040715466,0.006818219,0.000117081916,0.000029006515,0.0004773037,0.00026820847,0.046410426,0.0058882507,0.9308636,0.0022087924,0.0067455648],"study_design_scores_gemma":[0.000018061683,0.00007350759,0.00663263,0.000054319185,0.00001828573,0.00059539074,0.00012971947,0.51334786,0.0039306814,0.47283748,0.0022982473,0.00006384014],"about_ca_topic_score_codex":0.002904976,"about_ca_topic_score_gemma":0.0022294999,"teacher_disagreement_score":0.003120867,"about_ca_system_score_codex":0.0028539873,"about_ca_system_score_gemma":0.0011069129,"threshold_uncertainty_score":0.02070725},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43212205,0.00018178139,0.55452365,0.0003966599,0.00006290104,0.00032310802,0.0009184709,0.004460607,0.007010824],"genre_scores_gemma":[0.6495495,0.00008365296,0.343399,0.00017536628,0.000018818318,0.00025306203,0.0026641262,0.0004414716,0.0034150071],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99934036,0.00016433305,0.000033784727,0.00017164076,0.00017748824,0.00011225836],"domain_scores_gemma":[0.9975314,0.0010756213,0.0001361395,0.00085639715,0.00027347592,0.00012684007],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00067259354,0.00041798025,0.00049341354,0.00070384296,0.00045703023,0.00047302368,0.0011560979,0.0005522565,0.0030137815],"category_scores_gemma":[0.0045122486,0.00043215707,0.0007392221,0.0007680518,0.00059508224,0.0009731361,0.0012634053,0.00041787012,0.00061720534],"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.0016962922,0.0004871371,0.016130447,0.00060509384,0.0001916694,0.00077458395,0.0009343168,0.29641595,0.15604065,0.083926216,0.023387311,0.4194104],"study_design_scores_gemma":[0.00014830283,0.00017028594,0.0016702249,0.000016559696,0.000040068713,0.0003326357,0.00015521873,0.9192558,0.04502311,0.028991282,0.0041734185,0.000023129784],"about_ca_topic_score_codex":0.002188338,"about_ca_topic_score_gemma":0.0045440863,"teacher_disagreement_score":0.0030137815,"about_ca_system_score_codex":0.00070889853,"about_ca_system_score_gemma":0.00065561663,"threshold_uncertainty_score":0.010082126},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6400264,0.0014104111,0.28416732,0.0012692653,0.0001888245,0.00007154984,0.0006659883,0.00075706484,0.07144326],"genre_scores_gemma":[0.95145905,0.0011450672,0.036542643,0.0003498923,0.00013976393,0.00008551896,0.0010138253,0.00018883205,0.00907556],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999316,0.00010873135,0.000028275088,0.00014084658,0.00024305072,0.00016317761],"domain_scores_gemma":[0.99589044,0.0022628452,0.000489892,0.00054603367,0.00038394495,0.0004269421],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034550493,0.00035567352,0.00038180716,0.00081078825,0.0009682978,0.0013152813,0.0013377481,0.00067990675,0.00713051],"category_scores_gemma":[0.004383533,0.0005238431,0.0005540496,0.0013037856,0.00096619804,0.0032671993,0.0018112495,0.0018364717,0.001249985],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022541567,0.00015244547,0.0036036114,0.00039296434,0.000040077313,0.0008242202,0.0011500836,0.017873887,0.019514399,0.91003853,0.0071579283,0.03902636],"study_design_scores_gemma":[0.000059338774,0.00009996326,0.0023393047,0.00006707338,0.00006124166,0.0010067385,0.00029165595,0.067630015,0.012124197,0.8987558,0.017537028,0.000027757787],"about_ca_topic_score_codex":0.0010875672,"about_ca_topic_score_gemma":0.0018454047,"teacher_disagreement_score":0.00713051,"about_ca_system_score_codex":0.00077655044,"about_ca_system_score_gemma":0.00031977563,"threshold_uncertainty_score":0.023853898},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.76731426,0.0015890774,0.10018454,0.0015980201,0.00029416836,0.00008526634,0.0006729087,0.00019946392,0.12806219],"genre_scores_gemma":[0.9463948,0.0014450226,0.026808647,0.00023999391,0.00028867408,0.00012646744,0.000600922,0.00014351083,0.023951853],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990822,0.0003161051,0.000051269966,0.00018855529,0.00021497904,0.00014689744],"domain_scores_gemma":[0.9986749,0.00047217333,0.00027215978,0.00009878355,0.00024177025,0.00024014078],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010463333,0.0011139442,0.00063853565,0.003732708,0.0024379408,0.00455776,0.0010393081,0.0011657948,0.0046598674],"category_scores_gemma":[0.0018310961,0.00072797306,0.0006719621,0.002167133,0.003492699,0.005260618,0.001886497,0.002555658,0.0010040839],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000043595464,0.000016669945,0.00021079229,0.000016932701,0.000004376135,0.00007777708,0.0003004549,0.00048714984,0.0005614361,0.99512297,0.00046422757,0.0026935497],"study_design_scores_gemma":[0.000027204298,0.000026253092,0.0003412309,0.00002216618,0.0000087496755,0.00015729354,0.00028771537,0.0020305344,0.00056632963,0.99240816,0.0041094623,0.0000147613255],"about_ca_topic_score_codex":0.0018995779,"about_ca_topic_score_gemma":0.0018684169,"teacher_disagreement_score":0.0046598674,"about_ca_system_score_codex":0.0011970196,"about_ca_system_score_gemma":0.0006168534,"threshold_uncertainty_score":0.01558876},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05455123,0.0039194557,0.76378584,0.011642971,0.0010080218,0.000095889765,0.00033824833,0.00040312542,0.16425514],"genre_scores_gemma":[0.7160086,0.0025215894,0.25058663,0.0028371126,0.002671724,0.00039281818,0.00046236144,0.0003395744,0.024179554],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99737,0.0009986677,0.00009248033,0.0007202523,0.0005574244,0.000261168],"domain_scores_gemma":[0.99604046,0.0019397844,0.0002697652,0.0009061779,0.0005111911,0.00033259336],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0041712606,0.0011921466,0.0012857273,0.004315862,0.0027846408,0.003627101,0.0035042912,0.0022901893,0.008615881],"category_scores_gemma":[0.008434904,0.00065385795,0.0014907541,0.00287402,0.009001182,0.014042552,0.0058136256,0.0055743926,0.0010237962],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000045620754,0.0000056092335,0.00007029415,0.000008947166,0.0000018791052,0.000017863855,0.000065360524,0.0004908687,0.00009119549,0.9974974,0.0005124451,0.0012337274],"study_design_scores_gemma":[0.000005482772,0.000010149207,0.000047429603,0.0000086909085,0.0000025138108,0.000033004733,0.000037578735,0.004034787,0.000077333236,0.99084455,0.004893061,0.0000055159076],"about_ca_topic_score_codex":0.0017448515,"about_ca_topic_score_gemma":0.0015579491,"teacher_disagreement_score":0.008615881,"about_ca_system_score_codex":0.002518138,"about_ca_system_score_gemma":0.0010048848,"threshold_uncertainty_score":0.028823018},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.82233506,0.00087868684,0.09279991,0.003841804,0.00023262909,0.00016168223,0.001795212,0.00075906125,0.077196],"genre_scores_gemma":[0.92028445,0.00069477304,0.05326925,0.00063800387,0.00023513396,0.00022920742,0.0013183614,0.00046703898,0.022863787],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99807227,0.00047685154,0.00013352344,0.00054690335,0.0003162114,0.00045424709],"domain_scores_gemma":[0.98425585,0.010535808,0.0013590036,0.0016326989,0.00084540364,0.0013712209],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017487794,0.0013351261,0.0014638096,0.002558733,0.0030317598,0.0072254743,0.004058711,0.0036999898,0.016293932],"category_scores_gemma":[0.008098674,0.0019728427,0.0013875498,0.0030124078,0.0038442435,0.008931131,0.003292488,0.0033425635,0.0016057404],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011462583,0.00024654376,0.004707215,0.0005058489,0.00011396984,0.00045317586,0.0012769918,0.01478503,0.025288425,0.9193606,0.008827451,0.023288408],"study_design_scores_gemma":[0.0001145567,0.00005565526,0.0014337763,0.000051677856,0.00008538354,0.00040670973,0.00030485302,0.024696838,0.0058946167,0.9623837,0.004520238,0.000052094645],"about_ca_topic_score_codex":0.0013314176,"about_ca_topic_score_gemma":0.0028818017,"teacher_disagreement_score":0.016293932,"about_ca_system_score_codex":0.0028096053,"about_ca_system_score_gemma":0.0011237668,"threshold_uncertainty_score":0.054508686},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.583144,0.009767229,0.25789824,0.006803666,0.00051078416,0.00007715064,0.0012542477,0.0005363471,0.14000832],"genre_scores_gemma":[0.9418038,0.0025300675,0.044046417,0.00047938744,0.00040539066,0.00009587885,0.0004258252,0.000100404126,0.010112875],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988445,0.00021981796,0.000044365228,0.00035367705,0.00030673525,0.00023088629],"domain_scores_gemma":[0.9947962,0.0034105608,0.0002754353,0.0006501768,0.00041857958,0.00044896264],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018009063,0.001052119,0.0010854412,0.0034691917,0.0012547104,0.0025815722,0.0019375309,0.0012020007,0.006616628],"category_scores_gemma":[0.008596357,0.00044085016,0.0010731019,0.001753282,0.0030476162,0.006514949,0.004020192,0.0033616198,0.000837279],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025983262,0.00006380475,0.0044651045,0.00027195527,0.00007934444,0.00024214374,0.00065569725,0.013909391,0.010200638,0.9387166,0.0055720108,0.02556351],"study_design_scores_gemma":[0.000038998744,0.00012229155,0.0060760584,0.0001243258,0.00014547724,0.00076561136,0.0003273781,0.074742995,0.011208264,0.8847556,0.02157071,0.00012228117],"about_ca_topic_score_codex":0.0015702642,"about_ca_topic_score_gemma":0.0012434538,"teacher_disagreement_score":0.006616628,"about_ca_system_score_codex":0.0025493503,"about_ca_system_score_gemma":0.000651928,"threshold_uncertainty_score":0.02213478},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8585574,0.0013377939,0.106465355,0.0018087497,0.000105333966,0.00009922995,0.00039246987,0.00036131375,0.030872416],"genre_scores_gemma":[0.98206204,0.0007637033,0.013235097,0.00022384293,0.00011095928,0.00018105721,0.00020596829,0.00008503252,0.0031323005],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993512,0.00026581637,0.0000323563,0.00011553581,0.00011150671,0.00012351206],"domain_scores_gemma":[0.98819155,0.008167058,0.0012655014,0.00072826556,0.00054305245,0.001104555],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011647003,0.00056536484,0.000973701,0.0016192355,0.0014877314,0.0017230527,0.0013642431,0.0011506572,0.0046731047],"category_scores_gemma":[0.014068692,0.0007587966,0.00050610665,0.0009805103,0.0026828505,0.0027949095,0.0016482812,0.0009101268,0.00048223796],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028978175,0.00011925226,0.0036169784,0.00030703412,0.00007234429,0.00081221404,0.00040581357,0.038561333,0.005360884,0.9319291,0.004522105,0.0140031725],"study_design_scores_gemma":[0.00016799,0.00012965142,0.001762954,0.00009257281,0.000044711185,0.00046278196,0.0001980318,0.22379424,0.0017931713,0.7687581,0.00273814,0.00005760873],"about_ca_topic_score_codex":0.0014702387,"about_ca_topic_score_gemma":0.0016472177,"teacher_disagreement_score":0.0046731047,"about_ca_system_score_codex":0.0011905641,"about_ca_system_score_gemma":0.00093825767,"threshold_uncertainty_score":0.015633047},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8176355,0.0009935445,0.15546753,0.00094995595,0.00006643557,0.00010207895,0.0009469258,0.00055398047,0.023284012],"genre_scores_gemma":[0.96827,0.0006648208,0.025024688,0.0002661667,0.000074391064,0.00014146134,0.001503332,0.00011526309,0.003939814],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982968,0.00045947664,0.00011129816,0.00055139035,0.00026047527,0.0003206208],"domain_scores_gemma":[0.99296653,0.002924666,0.0013645225,0.00091124274,0.0007973008,0.0010356434],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013262111,0.00047399415,0.00066644786,0.0020122249,0.0018200679,0.0016868367,0.0009904399,0.0010279332,0.005561801],"category_scores_gemma":[0.005952646,0.00086393824,0.000933264,0.00155955,0.0020946236,0.0035006478,0.0024763555,0.0017805549,0.0006614572],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00044891555,0.00013632988,0.010625857,0.00032161648,0.00008802665,0.0010226751,0.0022281217,0.019653197,0.016973412,0.9102245,0.0053745764,0.032902848],"study_design_scores_gemma":[0.000093903574,0.00024143026,0.0043527815,0.00012934284,0.0000657974,0.002653277,0.0015375223,0.057536133,0.005794182,0.9115051,0.01601229,0.00007824701],"about_ca_topic_score_codex":0.0020909032,"about_ca_topic_score_gemma":0.0019099333,"teacher_disagreement_score":0.005561801,"about_ca_system_score_codex":0.0015906685,"about_ca_system_score_gemma":0.0005734748,"threshold_uncertainty_score":0.018606067},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95056784,0.00032455588,0.025136426,0.0004831337,0.000016050162,0.00003403151,0.000096843716,0.000080583195,0.023260484],"genre_scores_gemma":[0.986257,0.00024353796,0.009093834,0.00005361766,0.000024574374,0.00004199017,0.00009190137,0.000020685728,0.0041728658],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99946815,0.00014776926,0.000022560622,0.00012846856,0.00012008162,0.00011305923],"domain_scores_gemma":[0.99872833,0.00060608145,0.00026346327,0.00011176886,0.000083312785,0.00020693161],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006591735,0.00045587507,0.0006281961,0.0015745657,0.002226357,0.0021570926,0.0008882653,0.0010641245,0.003915266],"category_scores_gemma":[0.00231585,0.0003861129,0.00050579756,0.001311463,0.0026112688,0.0036557417,0.0014299804,0.00096881646,0.0003516707],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014228573,0.00006180513,0.0018514816,0.0000735199,0.000022306787,0.00040996136,0.0005523545,0.017270565,0.0044434685,0.9681722,0.00076221797,0.0062377863],"study_design_scores_gemma":[0.000063659274,0.000049870432,0.000988776,0.000031668544,0.000014224435,0.0003488329,0.00039064378,0.060449176,0.0030062357,0.9302341,0.0043993215,0.000023415278],"about_ca_topic_score_codex":0.0010869214,"about_ca_topic_score_gemma":0.0010555756,"teacher_disagreement_score":0.003915266,"about_ca_system_score_codex":0.0019882019,"about_ca_system_score_gemma":0.0003392326,"threshold_uncertainty_score":0.0144254565},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.69335455,0.000853697,0.18877451,0.0026711458,0.0003262849,0.00015809195,0.00097122614,0.00047104477,0.11241945],"genre_scores_gemma":[0.96536034,0.00076164224,0.021861825,0.00050502445,0.00017134254,0.00014963231,0.0008282764,0.00010685899,0.010254951],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999033,0.00013291345,0.000058058504,0.00038362583,0.00017881948,0.00021363836],"domain_scores_gemma":[0.996278,0.001637146,0.0005776556,0.0007288114,0.00038400316,0.00039443665],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011281467,0.00055251975,0.0008199473,0.0010968444,0.0018530233,0.0026762993,0.0012691341,0.000843244,0.0050379727],"category_scores_gemma":[0.005346029,0.00050855096,0.0009851167,0.0009616544,0.0025924079,0.0052705854,0.0029909883,0.0019003528,0.0007444165],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002625858,0.00006903395,0.0020888739,0.00018022816,0.00003551825,0.00028665425,0.0005310448,0.0037958792,0.0057056495,0.97129256,0.002916909,0.012835049],"study_design_scores_gemma":[0.0000720387,0.000075043245,0.0013275684,0.000048541937,0.00006577791,0.00044641824,0.00038223798,0.021542585,0.005832476,0.9589488,0.011223013,0.00003555728],"about_ca_topic_score_codex":0.0015782252,"about_ca_topic_score_gemma":0.0015830615,"teacher_disagreement_score":0.0050379727,"about_ca_system_score_codex":0.001116203,"about_ca_system_score_gemma":0.0009967772,"threshold_uncertainty_score":0.01685369},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8101275,0.0003420035,0.16364633,0.0006481476,0.000039315248,0.000065333385,0.0007644157,0.00045583252,0.023911178],"genre_scores_gemma":[0.9766133,0.00026407838,0.018970234,0.00014594298,0.000042698524,0.00007020581,0.00077750825,0.00006108213,0.0030549285],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995647,0.0001079941,0.000017842485,0.00009642503,0.00011044488,0.000102576094],"domain_scores_gemma":[0.9968592,0.0016470251,0.00043206706,0.0004239332,0.00030402438,0.0003337275],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003778185,0.000339759,0.00032519578,0.0007399773,0.0005678323,0.0007357898,0.0007363264,0.00039785696,0.0028362763],"category_scores_gemma":[0.003248544,0.00046790217,0.0004005798,0.0007865004,0.0008793175,0.0014781175,0.0014003736,0.0009273775,0.00035807342],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002450974,0.00018647114,0.008590824,0.0003320214,0.000072152034,0.0009414003,0.0009144095,0.03369879,0.03246741,0.87876177,0.008236674,0.03555289],"study_design_scores_gemma":[0.000064834174,0.00008412246,0.004613093,0.00004371643,0.000049913117,0.0007678039,0.00028316662,0.18284789,0.011391407,0.79158515,0.008250059,0.0000189261],"about_ca_topic_score_codex":0.0011160887,"about_ca_topic_score_gemma":0.0019116992,"teacher_disagreement_score":0.0028362763,"about_ca_system_score_codex":0.0006767897,"about_ca_system_score_gemma":0.00032096496,"threshold_uncertainty_score":0.009488344},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8645391,0.00046498945,0.10120373,0.0019788276,0.00010960297,0.00005349646,0.00053065096,0.00030953935,0.030810107],"genre_scores_gemma":[0.99284947,0.00009639982,0.0040805405,0.00013178177,0.000046800003,0.0000308013,0.0001258123,0.000031531974,0.0026068068],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99911875,0.00024504203,0.000024864145,0.00024486147,0.00020615627,0.00016023406],"domain_scores_gemma":[0.9939534,0.0034606413,0.00060265814,0.0008983688,0.00052523636,0.00055973546],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001259426,0.0002506184,0.00054160727,0.0013170782,0.0012409284,0.0015294593,0.00080435333,0.0006967278,0.006291368],"category_scores_gemma":[0.0074936454,0.0002582737,0.000435061,0.000682393,0.0026832677,0.0024093622,0.0011756608,0.00090992165,0.00026098348],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004291553,0.000043329925,0.004508466,0.000111621266,0.00004715343,0.00016944674,0.00024174637,0.038459335,0.014968061,0.9303495,0.002843617,0.0078284275],"study_design_scores_gemma":[0.000049940056,0.00008178754,0.0039695785,0.000028230046,0.000031204097,0.0003817994,0.0001556583,0.131003,0.0068331677,0.8527251,0.0046931887,0.00004739245],"about_ca_topic_score_codex":0.0024578972,"about_ca_topic_score_gemma":0.0018503001,"teacher_disagreement_score":0.006291368,"about_ca_system_score_codex":0.0020906606,"about_ca_system_score_gemma":0.00065445673,"threshold_uncertainty_score":0.021046698},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7949329,0.0005550308,0.18758662,0.0006672023,0.00020394691,0.00012834797,0.0016111188,0.0011089973,0.013205876],"genre_scores_gemma":[0.950491,0.00017845786,0.040523734,0.0002507627,0.00006980331,0.00011766583,0.0032043322,0.00044822265,0.004716093],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984226,0.00061085535,0.000062101266,0.0003895064,0.00033606947,0.00017878557],"domain_scores_gemma":[0.9901906,0.0055941576,0.0006653199,0.0013672468,0.0014089888,0.0007736837],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014242376,0.0005519147,0.0009161452,0.0032297308,0.0009782247,0.0018601489,0.0025161982,0.0019988024,0.008014996],"category_scores_gemma":[0.020617528,0.00077810005,0.00094424473,0.0017676617,0.0016545895,0.0030924662,0.0020076097,0.002128511,0.0009373454],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001637558,0.0003195016,0.01284899,0.00049017044,0.00017466769,0.0010172059,0.0013508792,0.16444269,0.020768004,0.7561659,0.0091751125,0.0316094],"study_design_scores_gemma":[0.00016871048,0.00019484237,0.003589321,0.00010817683,0.000055913904,0.00051117566,0.00065527175,0.4803423,0.006451256,0.5019285,0.0059246253,0.000069941525],"about_ca_topic_score_codex":0.0023025353,"about_ca_topic_score_gemma":0.004073684,"teacher_disagreement_score":0.008014996,"about_ca_system_score_codex":0.0015647373,"about_ca_system_score_gemma":0.0007931722,"threshold_uncertainty_score":0.026812851},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.80826926,0.0032403907,0.12185196,0.0039904476,0.0002850721,0.00008040867,0.00037492186,0.0003800398,0.06152749],"genre_scores_gemma":[0.98135835,0.00060164795,0.01311656,0.00023295266,0.00016420243,0.00004500344,0.0001271625,0.00003094218,0.004323108],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993616,0.0001464092,0.000043829157,0.0001577539,0.00020087312,0.00008956014],"domain_scores_gemma":[0.99697924,0.0014491868,0.0005786149,0.00036103194,0.00035978376,0.0002722333],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00073257665,0.00033097022,0.00040044976,0.0012818999,0.0010292395,0.0020826824,0.00083074934,0.0010775616,0.0051899445],"category_scores_gemma":[0.0045069316,0.00039659467,0.00038766363,0.0013843918,0.0019508656,0.0042590173,0.0014637705,0.0010924252,0.0003303221],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006623116,0.000038424547,0.0012330166,0.00013386171,0.00001929331,0.00017842892,0.000351579,0.005006101,0.0033342736,0.97692525,0.002131672,0.010581884],"study_design_scores_gemma":[0.000016060889,0.000021530164,0.0005188463,0.000028749584,0.00000983959,0.00018522472,0.00015196859,0.014290772,0.0018310138,0.9779574,0.004979229,0.000009309817],"about_ca_topic_score_codex":0.0008866223,"about_ca_topic_score_gemma":0.0009850557,"teacher_disagreement_score":0.0051899445,"about_ca_system_score_codex":0.001240936,"about_ca_system_score_gemma":0.00042128866,"threshold_uncertainty_score":0.017362118},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9511895,0.0003104683,0.034387447,0.0009352604,0.00003608569,0.000021102725,0.00023464944,0.00022754545,0.012657893],"genre_scores_gemma":[0.99650097,0.00008207834,0.0021789141,0.00014746735,0.000022669201,0.000020829466,0.000111635476,0.000019145828,0.00091627066],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993261,0.0002128545,0.00003145088,0.00015886489,0.0001294501,0.00014121787],"domain_scores_gemma":[0.99389124,0.0035809537,0.001009156,0.00053960725,0.0005031353,0.0004758729],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008710091,0.00031054564,0.0005832193,0.0012306707,0.0012812713,0.0013867862,0.0006960811,0.00085403793,0.003418684],"category_scores_gemma":[0.0070183324,0.00040745735,0.0006644812,0.00070732506,0.0025437316,0.0018506742,0.0012142493,0.0009919887,0.00027242873],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00068298663,0.00014246824,0.01717488,0.00024272922,0.00012021573,0.0005974761,0.000943473,0.033680633,0.012320566,0.9067345,0.006619446,0.020740567],"study_design_scores_gemma":[0.000083361905,0.00011740641,0.0067013777,0.00006208966,0.000064471846,0.0007103224,0.00044057626,0.08932359,0.0057773404,0.89211696,0.0045509282,0.00005164786],"about_ca_topic_score_codex":0.0016545824,"about_ca_topic_score_gemma":0.0014185004,"teacher_disagreement_score":0.003418684,"about_ca_system_score_codex":0.00091720204,"about_ca_system_score_gemma":0.00045063486,"threshold_uncertainty_score":0.011436641},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3621414,0.005751598,0.4771728,0.011198456,0.0008215901,0.00008802911,0.0007420997,0.0013216231,0.14076237],"genre_scores_gemma":[0.9515263,0.0018661886,0.030566035,0.0010463998,0.0010653376,0.000114888535,0.00045404426,0.00017593434,0.013185],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9968637,0.0008367948,0.0001914249,0.0008110115,0.00088447484,0.00041253876],"domain_scores_gemma":[0.9920108,0.005343858,0.00036660244,0.001411685,0.0005552507,0.00031189361],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026374161,0.00062032446,0.0009925308,0.0012562554,0.0020746635,0.003024105,0.0016905683,0.00140713,0.0059226216],"category_scores_gemma":[0.013012551,0.00056384515,0.0009316964,0.002018235,0.0042033494,0.011878666,0.004515707,0.0026263052,0.0010214346],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010145889,0.000023306522,0.0011796503,0.00010078759,0.000011498262,0.00014055884,0.00025058593,0.002376788,0.00082650786,0.9780164,0.002197132,0.0147753805],"study_design_scores_gemma":[0.000019741028,0.000034172408,0.0007254171,0.0000524245,0.000023263965,0.00036181568,0.00014145777,0.009071075,0.002580725,0.97317886,0.013789933,0.000020981453],"about_ca_topic_score_codex":0.00087361736,"about_ca_topic_score_gemma":0.0005521023,"teacher_disagreement_score":0.0059226216,"about_ca_system_score_codex":0.0011087032,"about_ca_system_score_gemma":0.00046196242,"threshold_uncertainty_score":0.01981312},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45483848,0.008695363,0.18593752,0.009403214,0.00068422116,0.00017275699,0.00085162855,0.00047280264,0.338944],"genre_scores_gemma":[0.9349355,0.0050192843,0.025730759,0.00063009356,0.00063029915,0.0002792165,0.0003429555,0.00012756718,0.032304343],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991609,0.0002817519,0.000047943955,0.00016623632,0.00020777759,0.00013546002],"domain_scores_gemma":[0.997454,0.0015536639,0.000268936,0.00021435048,0.00026423178,0.00024481086],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014746316,0.0008384003,0.000959299,0.0050767316,0.0026669241,0.0036809337,0.0011313753,0.0019148781,0.008513226],"category_scores_gemma":[0.008021383,0.00049259514,0.0009419417,0.0031759753,0.0042979247,0.009953621,0.0033959409,0.0037182625,0.0008945334],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000963163,0.000004056508,0.000051019295,0.00002204172,0.0000025883876,0.00002455953,0.00014379492,0.00019120534,0.00009411103,0.99789256,0.0003556448,0.0012089524],"study_design_scores_gemma":[0.000010289887,0.0000045587517,0.00008374587,0.000010466892,0.0000046862338,0.000074841,0.00006240689,0.0010274703,0.000079649,0.9964856,0.0021515149,0.000004795937],"about_ca_topic_score_codex":0.0008648373,"about_ca_topic_score_gemma":0.00044492248,"teacher_disagreement_score":0.008513226,"about_ca_system_score_codex":0.0022515494,"about_ca_system_score_gemma":0.0009065666,"threshold_uncertainty_score":0.028479517},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.035215452,0.002565012,0.6694011,0.0045031765,0.0013453378,0.00018462284,0.0034342557,0.0037789918,0.2795721],"genre_scores_gemma":[0.5749499,0.0043357643,0.1904488,0.004817553,0.0025611059,0.00085916446,0.007632001,0.0046878243,0.20970781],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99529994,0.0007721908,0.00044437504,0.0012727061,0.0015398952,0.0006708372],"domain_scores_gemma":[0.9945452,0.0026484665,0.00028427245,0.0010873069,0.001060763,0.0003739721],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029332794,0.0017681279,0.0018081676,0.0046271263,0.005927938,0.009166629,0.0033461414,0.0021120321,0.0501324],"category_scores_gemma":[0.011175269,0.001974056,0.003421616,0.0066858646,0.005449265,0.027370002,0.010584338,0.0056934603,0.013314902],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030226473,0.000014940888,0.00016657046,0.00008801427,0.000018148523,0.0000726924,0.00022017161,0.00042975438,0.00023281807,0.9822825,0.0057480927,0.010696005],"study_design_scores_gemma":[0.000013025214,0.000013636698,0.000090176356,0.000044893146,0.000028685045,0.00012424652,0.0001263181,0.0012143626,0.0004673334,0.97742903,0.020434078,0.000014178109],"about_ca_topic_score_codex":0.0033433565,"about_ca_topic_score_gemma":0.0034018366,"teacher_disagreement_score":0.0501324,"about_ca_system_score_codex":0.0031408167,"about_ca_system_score_gemma":0.0019725938,"threshold_uncertainty_score":0.16770959},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21636517,0.010130638,0.47895688,0.010874186,0.00072979485,0.00026501584,0.0033806895,0.0029109989,0.27638644],"genre_scores_gemma":[0.8900531,0.004328734,0.07608929,0.0015268642,0.0010044102,0.0005404883,0.0015162757,0.0013311852,0.023609692],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9951959,0.0007370309,0.0001129489,0.0012993286,0.0014822484,0.0011725433],"domain_scores_gemma":[0.97316134,0.01823188,0.0011492445,0.0041115247,0.001607301,0.0017387406],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030648296,0.001726187,0.0017366854,0.0035721667,0.0030057272,0.005393677,0.0036358468,0.001888254,0.016557237],"category_scores_gemma":[0.020661864,0.001570567,0.0012260274,0.003917299,0.0055204853,0.010713137,0.0053961743,0.006735521,0.0025641383],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005902883,0.00025357204,0.0024778985,0.00043177494,0.000099597666,0.00026383973,0.00048567046,0.07862829,0.0148582775,0.84758484,0.0214694,0.032856546],"study_design_scores_gemma":[0.00007298734,0.00006336861,0.0019260631,0.00013453032,0.00006499892,0.00021047404,0.000115618466,0.13500482,0.005553342,0.84149057,0.015289607,0.00007359628],"about_ca_topic_score_codex":0.009048583,"about_ca_topic_score_gemma":0.014802469,"teacher_disagreement_score":0.016557237,"about_ca_system_score_codex":0.006725868,"about_ca_system_score_gemma":0.002547188,"threshold_uncertainty_score":0.055389524},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3634124,0.0013819665,0.58788615,0.00339779,0.00025491833,0.0003136524,0.0007196843,0.0010562792,0.041577198],"genre_scores_gemma":[0.925832,0.001270324,0.043786377,0.0004659459,0.00028436535,0.000702161,0.00061057595,0.00029460105,0.02675354],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997633,0.00095037225,0.00009284551,0.00045617297,0.00046970783,0.0003978121],"domain_scores_gemma":[0.9796912,0.014155029,0.0019155837,0.00141738,0.0013292278,0.0014915806],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0053518894,0.0009604132,0.0014148585,0.00237126,0.0014357311,0.0026982632,0.0026901735,0.0019584864,0.011311135],"category_scores_gemma":[0.029612405,0.000974683,0.0010364302,0.0013544906,0.004785601,0.006796953,0.0025184636,0.0035845188,0.0013691351],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014486395,0.00004120621,0.0010497824,0.00008776025,0.000020985626,0.0001684758,0.00022398954,0.022559103,0.0019241651,0.9633654,0.0022337665,0.0081806],"study_design_scores_gemma":[0.0001063976,0.0001385001,0.0012365849,0.000089796005,0.000039141676,0.00034947266,0.00014314208,0.46754518,0.0027843865,0.523483,0.0040022787,0.00008227966],"about_ca_topic_score_codex":0.0015890517,"about_ca_topic_score_gemma":0.001069219,"teacher_disagreement_score":0.011311135,"about_ca_system_score_codex":0.002566968,"about_ca_system_score_gemma":0.0013372112,"threshold_uncertainty_score":0.037839532},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7025323,0.0067660124,0.1505261,0.006195466,0.0004451046,0.00011320655,0.000497823,0.0006274309,0.13229643],"genre_scores_gemma":[0.958869,0.001503452,0.0269228,0.00046125182,0.00034306856,0.000102614096,0.0002447413,0.00007250771,0.011480557],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99919456,0.00021207401,0.000056461697,0.0002070144,0.00021972081,0.00011008279],"domain_scores_gemma":[0.9966646,0.002057573,0.00046668705,0.00029518167,0.000291886,0.00022402398],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008081544,0.00038413532,0.0004790227,0.001708452,0.0013519768,0.0024124724,0.0009351425,0.0011137866,0.0054452936],"category_scores_gemma":[0.00494417,0.00050359976,0.00052749476,0.0020191397,0.002791884,0.0060396707,0.0017809989,0.0015117215,0.00047037067],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000047370933,0.000026889249,0.0006995945,0.00014464009,0.000012616471,0.00014506915,0.00048251788,0.001923894,0.0017563165,0.97933745,0.0019800738,0.013443492],"study_design_scores_gemma":[0.000009706529,0.000019934063,0.00027166217,0.000024573275,0.0000086494,0.00014590785,0.00013052604,0.0039911745,0.0007156399,0.98878294,0.0058923806,0.0000068604036],"about_ca_topic_score_codex":0.0012107193,"about_ca_topic_score_gemma":0.0013696913,"teacher_disagreement_score":0.0054452936,"about_ca_system_score_codex":0.0019214747,"about_ca_system_score_gemma":0.0004832144,"threshold_uncertainty_score":0.018216372},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20426999,0.0017506522,0.765956,0.0044861874,0.00014344355,0.00017607922,0.000996499,0.00096124026,0.021260023],"genre_scores_gemma":[0.92839515,0.0018949602,0.060050774,0.00060447806,0.00040911837,0.0005028025,0.0008962398,0.00045874462,0.0067877015],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977169,0.0011163645,0.00006950521,0.00046351805,0.00034970065,0.00028412358],"domain_scores_gemma":[0.9510412,0.040595576,0.0028922525,0.0025659956,0.0014705666,0.0014343915],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0039729,0.001095847,0.0010728203,0.0038012117,0.0013550138,0.0021092924,0.0029898242,0.002242964,0.0056375205],"category_scores_gemma":[0.040400695,0.0010725392,0.0014304584,0.002861157,0.0050950907,0.005632783,0.0025783007,0.0031138344,0.00049678615],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013260661,0.000064999214,0.0035672584,0.00012764735,0.000042019747,0.00019165226,0.00029257216,0.2195444,0.0019510338,0.7641533,0.003069031,0.006863459],"study_design_scores_gemma":[0.000037657384,0.00003137373,0.0017111476,0.00004477823,0.000022339236,0.00013842554,0.0000788285,0.66179204,0.0009043717,0.3338989,0.0012828902,0.00005721501],"about_ca_topic_score_codex":0.0072354963,"about_ca_topic_score_gemma":0.00758559,"teacher_disagreement_score":0.0072354963,"about_ca_system_score_codex":0.005181563,"about_ca_system_score_gemma":0.0013717271,"threshold_uncertainty_score":0.037595093},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9169005,0.00054557226,0.05240258,0.00071277877,0.000060108858,0.000040285424,0.00020211775,0.00007922309,0.029056752],"genre_scores_gemma":[0.9856468,0.00027819007,0.011020779,0.00007094696,0.000045885892,0.000041501284,0.00014721723,0.00001927719,0.002729407],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99886996,0.00030132922,0.000045368262,0.00027707592,0.0003400696,0.00016610886],"domain_scores_gemma":[0.99726236,0.0014051336,0.00049676246,0.0002379933,0.00021641326,0.0003813844],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00075677206,0.00047373123,0.00065188395,0.0022142807,0.0018005685,0.002422939,0.0012027675,0.00084026624,0.0035947533],"category_scores_gemma":[0.0034198912,0.0003548094,0.0004560361,0.0018124715,0.0041252514,0.0036293298,0.0022399216,0.00095678883,0.00032444604],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000046063604,0.00002098679,0.00047978692,0.00003962287,0.0000073799947,0.00012197757,0.0003505125,0.0035761225,0.0010478176,0.99036753,0.00038242136,0.0035597964],"study_design_scores_gemma":[0.000022968143,0.000021624077,0.0007732581,0.000021194426,0.000008335313,0.00019743259,0.00030946435,0.0150924055,0.0009149594,0.9797682,0.0028518776,0.000018318455],"about_ca_topic_score_codex":0.002540352,"about_ca_topic_score_gemma":0.002486842,"teacher_disagreement_score":0.0035947533,"about_ca_system_score_codex":0.0018895846,"about_ca_system_score_gemma":0.00043176074,"threshold_uncertainty_score":0.013709962},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5996611,0.001423368,0.25689957,0.0063340873,0.00042933458,0.000104182654,0.00070757844,0.00085226615,0.13358855],"genre_scores_gemma":[0.93000174,0.00033776337,0.030236714,0.00093103765,0.0002830601,0.00016548755,0.0005108033,0.00013119014,0.037402246],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983683,0.00048634148,0.00007406644,0.00039687293,0.00043223816,0.00024215814],"domain_scores_gemma":[0.9937762,0.0033645374,0.0006199377,0.00075984607,0.0007184014,0.000761132],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010644747,0.00050327776,0.0007490006,0.0017740916,0.0020626562,0.0029245813,0.0010940431,0.001514909,0.0049711196],"category_scores_gemma":[0.005436253,0.00051221345,0.0008722982,0.0008160002,0.003821498,0.004889726,0.0027983005,0.002692705,0.00088934705],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017959694,0.000011071,0.00010776813,0.000013140232,0.000004681305,0.000060119273,0.000089639325,0.0005398457,0.000498722,0.99729246,0.00045526403,0.00090932794],"study_design_scores_gemma":[0.000020144385,0.000025294443,0.00018739252,0.000012832788,0.000005669843,0.00009980771,0.000046375295,0.0064878454,0.00055493007,0.98988056,0.0026666673,0.000012524357],"about_ca_topic_score_codex":0.00088750466,"about_ca_topic_score_gemma":0.0012317917,"teacher_disagreement_score":0.0049711196,"about_ca_system_score_codex":0.0018292817,"about_ca_system_score_gemma":0.0007220082,"threshold_uncertainty_score":0.016630054},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40674898,0.006303775,0.32297593,0.009227514,0.0007176488,0.00014249643,0.002648413,0.0009530474,0.2502822],"genre_scores_gemma":[0.9245317,0.0034661307,0.045932468,0.0019344558,0.00074880733,0.0003673997,0.0013157516,0.0002595711,0.02144375],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975273,0.00051757094,0.00016072707,0.0007333979,0.00064428383,0.00041673653],"domain_scores_gemma":[0.99444723,0.0032241386,0.00052659225,0.0008146649,0.0005425032,0.00044488613],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019794889,0.000633292,0.0014444663,0.003036417,0.0029504253,0.0027221488,0.0015092677,0.0016287194,0.010314144],"category_scores_gemma":[0.009863952,0.00073884946,0.0018294766,0.0023314196,0.0034651451,0.009360182,0.0041286065,0.0028423257,0.0017000497],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000051044928,0.000019733943,0.0009248955,0.00008656328,0.000019745501,0.00009575544,0.00023899021,0.0015653137,0.0005129818,0.9821488,0.0046153194,0.00972075],"study_design_scores_gemma":[0.00002107819,0.00002182226,0.0005358986,0.000033447603,0.000017604416,0.00033690958,0.00012233004,0.0067169173,0.0004948072,0.98123103,0.010445875,0.000022184353],"about_ca_topic_score_codex":0.0014120217,"about_ca_topic_score_gemma":0.0008384171,"teacher_disagreement_score":0.010314144,"about_ca_system_score_codex":0.0017230962,"about_ca_system_score_gemma":0.0007646107,"threshold_uncertainty_score":0.034504235},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4623529,0.0003724005,0.49979225,0.0010915294,0.00010985214,0.0002514766,0.00019901556,0.00026814308,0.03556248],"genre_scores_gemma":[0.91978604,0.00023118519,0.07294935,0.00018298703,0.000041659812,0.00021893266,0.00012905049,0.000073273695,0.006387521],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981623,0.00077988184,0.00006868522,0.00034491744,0.00034024214,0.00030405913],"domain_scores_gemma":[0.99522215,0.0027210943,0.00034457791,0.0006845643,0.00037026807,0.0006574425],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017528707,0.0006263106,0.00075810234,0.00054148334,0.0011629255,0.0023001288,0.0015134125,0.0009591203,0.0038495648],"category_scores_gemma":[0.005560333,0.00055637065,0.0006302591,0.00072204776,0.0036372358,0.004574963,0.002246282,0.0022788804,0.0003065869],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027032677,0.0001124412,0.0011037618,0.00008914108,0.000030045216,0.0001445307,0.0005216975,0.04409649,0.0053174105,0.93752867,0.0014105001,0.009375022],"study_design_scores_gemma":[0.00010307511,0.00010412069,0.00054147874,0.000032910684,0.000035127046,0.00018793666,0.00022810971,0.2546786,0.0035151022,0.7347448,0.005796168,0.000032539236],"about_ca_topic_score_codex":0.00369072,"about_ca_topic_score_gemma":0.0031578136,"teacher_disagreement_score":0.0038495648,"about_ca_system_score_codex":0.0017175621,"about_ca_system_score_gemma":0.0012613396,"threshold_uncertainty_score":0.01287806},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.70888096,0.003909279,0.19577731,0.005487493,0.0006355488,0.00006961696,0.00020116365,0.00021579898,0.08482284],"genre_scores_gemma":[0.9372756,0.002316371,0.032956876,0.000671306,0.0011886305,0.0001244308,0.00037707452,0.00017970143,0.024909956],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987966,0.0004070661,0.00009072324,0.0001758996,0.00035674724,0.00017303765],"domain_scores_gemma":[0.9941777,0.0041746944,0.00044879178,0.00025518774,0.00045659192,0.00048694125],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002611464,0.0009000362,0.0012279353,0.003289712,0.0021594986,0.0034037253,0.0015990007,0.002350115,0.0053935004],"category_scores_gemma":[0.011974619,0.00062522537,0.001062112,0.0016717582,0.004416474,0.008608948,0.0037303022,0.003115962,0.00068687054],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000057606892,0.000039053823,0.00040629558,0.000063852945,0.000010429366,0.00020633776,0.00040102404,0.0029055916,0.00047751213,0.9904805,0.0008502975,0.004101406],"study_design_scores_gemma":[0.000008942564,0.000014052388,0.00010632392,0.000018384033,0.000005640063,0.000103002465,0.00011956268,0.010973332,0.00021946612,0.9876373,0.0007829799,0.000011013512],"about_ca_topic_score_codex":0.0008380645,"about_ca_topic_score_gemma":0.00071813003,"teacher_disagreement_score":0.0053935004,"about_ca_system_score_codex":0.0013813574,"about_ca_system_score_gemma":0.00075376645,"threshold_uncertainty_score":0.0180431},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.83535296,0.00056440843,0.15627576,0.00088501145,0.00004481046,0.000083188024,0.0006320917,0.00074044615,0.0054212674],"genre_scores_gemma":[0.9901612,0.0002197709,0.0076233954,0.00008439841,0.00005767725,0.0000868893,0.00040183731,0.0000956738,0.0012690921],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985298,0.0005891592,0.00005120776,0.00036651146,0.00029293302,0.00017035981],"domain_scores_gemma":[0.9819834,0.010861135,0.0021507938,0.0024167304,0.0016411762,0.0009467112],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032812546,0.00042881237,0.0009165538,0.0025750103,0.0005556354,0.0015489771,0.001551471,0.0009880988,0.0026169466],"category_scores_gemma":[0.024230687,0.00056427176,0.0006005212,0.00090006844,0.0027339673,0.0028665317,0.0013526265,0.0010328818,0.0003650885],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008729458,0.00015945963,0.031898133,0.0003355133,0.00016384874,0.0009623756,0.0008246501,0.17469558,0.031208415,0.7245827,0.0051165815,0.029179847],"study_design_scores_gemma":[0.00007485973,0.00013123477,0.01059709,0.000060057133,0.000056920577,0.00078713545,0.00015925999,0.6612735,0.008143295,0.31636477,0.0022823443,0.00006952473],"about_ca_topic_score_codex":0.0012308077,"about_ca_topic_score_gemma":0.00082943315,"teacher_disagreement_score":0.0032812546,"about_ca_system_score_codex":0.0019086564,"about_ca_system_score_gemma":0.0003969048,"threshold_uncertainty_score":0.017353117},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.86319095,0.0011258179,0.12687068,0.0010657585,0.00004532198,0.00003469698,0.00012112539,0.00016100817,0.007384629],"genre_scores_gemma":[0.99215204,0.00019210743,0.0069486164,0.000073571995,0.000040049494,0.0000248797,0.000056606143,0.000021034111,0.0004909895],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99959797,0.00016068087,0.000013773422,0.000081976155,0.00008526302,0.00006019921],"domain_scores_gemma":[0.99368906,0.0036142892,0.0011162126,0.00036485764,0.0005370929,0.0006784404],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013519446,0.0002465427,0.0005810271,0.0018586853,0.0008294983,0.0012647477,0.00076297845,0.0008662484,0.0014817506],"category_scores_gemma":[0.0099402005,0.0004397815,0.00025353368,0.00061652187,0.0021090826,0.0019587816,0.0011258749,0.00072432373,0.00017605284],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000110405344,0.000039539053,0.0028368165,0.000077977646,0.000031054984,0.00026450667,0.00025941138,0.041867267,0.004139816,0.94344074,0.0018010713,0.005131323],"study_design_scores_gemma":[0.00004210197,0.000042975284,0.0014670547,0.000033065502,0.00001605327,0.00028163556,0.00011143784,0.17985608,0.0014174813,0.81516075,0.0015498511,0.000021594476],"about_ca_topic_score_codex":0.0005303528,"about_ca_topic_score_gemma":0.0004925209,"teacher_disagreement_score":0.0018586853,"about_ca_system_score_codex":0.0009419314,"about_ca_system_score_gemma":0.00032894503,"threshold_uncertainty_score":0.0071498156},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.84789556,0.00064405485,0.04314545,0.0012814822,0.0003041479,0.00009534325,0.00048541315,0.0005909008,0.1055576],"genre_scores_gemma":[0.9580654,0.0004903808,0.022670375,0.00026154192,0.00014957126,0.00007739375,0.00043509604,0.00015801823,0.017692223],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993735,0.00012685973,0.000050579452,0.00013782187,0.00013549699,0.00017573552],"domain_scores_gemma":[0.99745697,0.0012621566,0.00035352563,0.00039423513,0.00016380526,0.0003693194],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005065903,0.00085825555,0.00092802534,0.0020959575,0.0028901554,0.0040456634,0.0010582111,0.0015995556,0.008895349],"category_scores_gemma":[0.0031577311,0.00075451884,0.00061065226,0.0023904922,0.002017364,0.004264807,0.0029329013,0.0021441886,0.0013603605],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00042222426,0.00021636876,0.0016495818,0.00013453863,0.00003652327,0.00073205546,0.0009592136,0.0025622207,0.01060815,0.9581002,0.0044687027,0.020110225],"study_design_scores_gemma":[0.000049442013,0.00012142654,0.00074563816,0.000044211632,0.000029307728,0.00062616187,0.00047207493,0.007089209,0.004461777,0.9816118,0.0047291648,0.000019681684],"about_ca_topic_score_codex":0.0005299124,"about_ca_topic_score_gemma":0.0005208617,"teacher_disagreement_score":0.008895349,"about_ca_system_score_codex":0.0007449903,"about_ca_system_score_gemma":0.0005665589,"threshold_uncertainty_score":0.029757857},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8496251,0.0009415713,0.08545287,0.0009693573,0.00018785972,0.00008624615,0.00036887586,0.00038868756,0.061979443],"genre_scores_gemma":[0.9640342,0.00067526527,0.020117754,0.00026455586,0.00015941034,0.00013240446,0.0004450571,0.00017538015,0.013995987],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991972,0.0002546842,0.00005418931,0.00015512954,0.00018692824,0.00015197304],"domain_scores_gemma":[0.9950499,0.0028998223,0.0008177335,0.00034934044,0.00030411573,0.00057906774],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006837738,0.0006283125,0.0009436561,0.0035586855,0.0026149873,0.004866161,0.0017477126,0.0020239402,0.0070287813],"category_scores_gemma":[0.0054473598,0.0011853323,0.0007654736,0.003499861,0.0031276406,0.00497881,0.002154111,0.0015467788,0.00080591196],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007549073,0.00007398996,0.00078411185,0.00007968804,0.000015774298,0.00023926882,0.0007715233,0.004231879,0.0014454658,0.98239774,0.0017862353,0.008098754],"study_design_scores_gemma":[0.000012491953,0.00001272839,0.0002566302,0.000024120309,0.000009766206,0.00011268177,0.00015045864,0.010436149,0.00043227233,0.98746455,0.0010792662,0.000008936558],"about_ca_topic_score_codex":0.0016377447,"about_ca_topic_score_gemma":0.0021199004,"teacher_disagreement_score":0.0070287813,"about_ca_system_score_codex":0.0012503488,"about_ca_system_score_gemma":0.0005956778,"threshold_uncertainty_score":0.023513615},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6874482,0.00071139267,0.25641558,0.0030279867,0.00016275737,0.00016362095,0.0018049589,0.001316985,0.048948538],"genre_scores_gemma":[0.9646085,0.00033596499,0.027741505,0.00027227195,0.00011800505,0.00016246214,0.00054128567,0.0002535865,0.0059664063],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998159,0.0004755693,0.00009076723,0.0005322663,0.000315555,0.00042677613],"domain_scores_gemma":[0.984201,0.010240054,0.0011854306,0.0015695891,0.0008187095,0.00198518],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021899932,0.001087548,0.0015322763,0.0017609666,0.0017266119,0.0042862236,0.002906203,0.0016621692,0.018123994],"category_scores_gemma":[0.014951038,0.00075291324,0.0010631871,0.0017749285,0.0025333767,0.01195926,0.0036582767,0.002716773,0.0010931711],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0021519088,0.00029420358,0.0054283277,0.00052560016,0.00010934226,0.00032214777,0.0007541631,0.044980127,0.010163818,0.89744246,0.008159905,0.02966805],"study_design_scores_gemma":[0.000109596454,0.00014379703,0.0013443043,0.00005860488,0.00008577102,0.00031332535,0.00025635082,0.12120515,0.0030776993,0.871116,0.002225361,0.000064047934],"about_ca_topic_score_codex":0.0010512087,"about_ca_topic_score_gemma":0.0013024006,"teacher_disagreement_score":0.018123994,"about_ca_system_score_codex":0.0021359406,"about_ca_system_score_gemma":0.0013797415,"threshold_uncertainty_score":0.06063074},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34996912,0.0044663334,0.24619491,0.003501619,0.0005156319,0.000065372384,0.00091548555,0.00079148624,0.39358014],"genre_scores_gemma":[0.9421119,0.0011785239,0.012662836,0.0007889461,0.0003584997,0.00007342843,0.0006217701,0.00049372396,0.041710358],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993556,0.00012315292,0.000024627128,0.00016012003,0.0001432748,0.00019314954],"domain_scores_gemma":[0.9972366,0.0016364934,0.00018762758,0.0003272695,0.00029073993,0.0003211995],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009929915,0.0007383652,0.00090722635,0.0021011753,0.0025787791,0.002855418,0.0015496425,0.00075873255,0.011300454],"category_scores_gemma":[0.0037248076,0.0004681955,0.001393931,0.0016356846,0.004353618,0.0074500223,0.0034911246,0.0024885174,0.0014825199],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022334505,0.000011223706,0.0001630661,0.00005218859,0.000007812621,0.00003993706,0.00022766794,0.00070145994,0.00026529722,0.99415356,0.0018722643,0.0024831176],"study_design_scores_gemma":[0.000010141508,0.000008119994,0.00016414303,0.000020176261,0.000016931821,0.000052419655,0.00009619518,0.0025906365,0.00043058294,0.9930803,0.0035221316,0.000008034684],"about_ca_topic_score_codex":0.0035320492,"about_ca_topic_score_gemma":0.0035696304,"teacher_disagreement_score":0.011300454,"about_ca_system_score_codex":0.0028042346,"about_ca_system_score_gemma":0.00090769277,"threshold_uncertainty_score":0.03780377},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9542077,0.00041737774,0.029674536,0.00055854087,0.000023216538,0.00003883447,0.0008672045,0.00016657854,0.014046068],"genre_scores_gemma":[0.9900231,0.00015364544,0.0076447614,0.000062039784,0.000047454727,0.000034600947,0.00060384755,0.000029519255,0.0014010465],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99901617,0.00017535097,0.000034881803,0.0002423578,0.00026480443,0.00026636562],"domain_scores_gemma":[0.9921312,0.005433524,0.00083229016,0.0005376345,0.0003209585,0.00074438995],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00070684194,0.00051842106,0.0007099684,0.0018647051,0.0014984858,0.0018287565,0.001091879,0.0009109795,0.005017516],"category_scores_gemma":[0.005099823,0.0006161753,0.0006113773,0.0019395578,0.0016251002,0.0024916811,0.001263431,0.0009963342,0.0002511281],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0025538674,0.00065591687,0.050436508,0.0009156559,0.00042253642,0.0023960967,0.0019829918,0.19802243,0.06222633,0.5951726,0.016914435,0.06830067],"study_design_scores_gemma":[0.00013872456,0.00019736036,0.028338024,0.000099520985,0.00013439223,0.0020144058,0.00051677186,0.4212068,0.02264531,0.51480514,0.009827393,0.00007613035],"about_ca_topic_score_codex":0.0024096854,"about_ca_topic_score_gemma":0.0025298789,"teacher_disagreement_score":0.005017516,"about_ca_system_score_codex":0.001368985,"about_ca_system_score_gemma":0.0005264851,"threshold_uncertainty_score":0.016785264},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.66213614,0.0013928784,0.2919968,0.0006281237,0.00008197869,0.0000933391,0.0009495652,0.00048730953,0.04223387],"genre_scores_gemma":[0.9558298,0.00041258812,0.035849545,0.00015331189,0.0001245824,0.00012060956,0.0009441571,0.00008006219,0.006485289],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99873275,0.00019411536,0.00007602544,0.0003088957,0.0004568379,0.00023129726],"domain_scores_gemma":[0.99566084,0.0024949268,0.00042481843,0.00039240732,0.00048170265,0.0005453333],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001178154,0.00042355174,0.00071007526,0.0018507871,0.0013753192,0.0026177668,0.0009366754,0.00040370837,0.0052045765],"category_scores_gemma":[0.004222285,0.0006171921,0.0006938679,0.0010135922,0.0023312266,0.0037440672,0.0030157736,0.0011704474,0.0004679158],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000112543785,0.000049764993,0.0036627962,0.00013119535,0.000021368456,0.0002984687,0.0008712869,0.003674706,0.0036360603,0.97585243,0.0012469954,0.010442279],"study_design_scores_gemma":[0.000050659608,0.00015362058,0.0035042043,0.00008165889,0.000047771773,0.0010533452,0.00052334083,0.0689168,0.008075697,0.90255,0.0150092095,0.000033785247],"about_ca_topic_score_codex":0.0011769386,"about_ca_topic_score_gemma":0.0008642351,"teacher_disagreement_score":0.0052045765,"about_ca_system_score_codex":0.0014833361,"about_ca_system_score_gemma":0.000500205,"threshold_uncertainty_score":0.017411053},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7707298,0.001128285,0.18385632,0.0011411157,0.00013836863,0.0000856178,0.0008793749,0.00045218854,0.04158889],"genre_scores_gemma":[0.97632295,0.0002942568,0.01734625,0.00033652296,0.000063236155,0.00008229054,0.00042687193,0.00011364861,0.005014065],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992067,0.00014525285,0.00004100782,0.00022816271,0.00013243408,0.00024650988],"domain_scores_gemma":[0.99545383,0.0021429115,0.00048743893,0.00077934755,0.0004060802,0.0007303117],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009406574,0.0006405822,0.0007197165,0.0010294949,0.0013739426,0.002002461,0.0016822338,0.0010020225,0.008602639],"category_scores_gemma":[0.008146842,0.0007477012,0.0008002289,0.00088670553,0.0018592727,0.0042909537,0.0031888948,0.002182243,0.0007473998],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005278997,0.00008777,0.006043233,0.00045478783,0.00008145129,0.00074037275,0.00076312653,0.039522376,0.01485566,0.91636,0.0049130693,0.015650203],"study_design_scores_gemma":[0.00007097788,0.00009643891,0.0023237923,0.00007141045,0.00005067247,0.000538975,0.0004388977,0.11509134,0.008524189,0.8678184,0.004929333,0.00004557164],"about_ca_topic_score_codex":0.0012642189,"about_ca_topic_score_gemma":0.0020302054,"teacher_disagreement_score":0.008602639,"about_ca_system_score_codex":0.00089401874,"about_ca_system_score_gemma":0.0004543118,"threshold_uncertainty_score":0.028778732},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32390034,0.004276951,0.10719624,0.03535304,0.002694179,0.000094332674,0.00049707195,0.0005786559,0.52540916],"genre_scores_gemma":[0.9487973,0.0012872022,0.012549073,0.002663962,0.0011296676,0.00007471137,0.00023706596,0.0001462132,0.033114836],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990017,0.0002659988,0.00003583269,0.00021923616,0.00026051354,0.00021668238],"domain_scores_gemma":[0.9974152,0.0012156594,0.00021090923,0.00050643616,0.0003604658,0.00029126715],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021445826,0.00058410934,0.0013080811,0.0019717426,0.0038491862,0.0029753027,0.0015748454,0.003271931,0.009477366],"category_scores_gemma":[0.008914888,0.00038750548,0.0011512015,0.00171471,0.0073543745,0.010268898,0.00404971,0.004626829,0.0010113134],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010533096,0.000006107599,0.000058766942,0.000009639743,0.000001938807,0.000021400314,0.00008582892,0.00022853272,0.00006349805,0.9976386,0.00090621726,0.00096898206],"study_design_scores_gemma":[0.000006665791,0.0000017575063,0.000044199613,0.0000049319397,0.0000011972483,0.000013676728,0.00002692423,0.000731402,0.000034460696,0.99822015,0.00091107964,0.000003449991],"about_ca_topic_score_codex":0.0047782776,"about_ca_topic_score_gemma":0.0027354732,"teacher_disagreement_score":0.009477366,"about_ca_system_score_codex":0.002704077,"about_ca_system_score_gemma":0.0014910828,"threshold_uncertainty_score":0.031704962},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35870227,0.0055657774,0.5696387,0.0038614026,0.00052193156,0.00007817241,0.0010151004,0.0006757144,0.059940957],"genre_scores_gemma":[0.8655771,0.0020023887,0.12307231,0.0005843165,0.0006363811,0.00019212585,0.0006497755,0.00023123425,0.0070543154],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981927,0.00045741376,0.00009403982,0.00044238422,0.00055188633,0.00026163258],"domain_scores_gemma":[0.9792921,0.0150839845,0.0014550032,0.002259346,0.0011108578,0.00079860043],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0039252746,0.0013179271,0.0010982387,0.0035747017,0.0012341365,0.0032632933,0.0027004688,0.0014198032,0.0051491093],"category_scores_gemma":[0.025188357,0.0006514067,0.0012548807,0.0013084817,0.0044289185,0.008793087,0.004104961,0.0052086837,0.0007141594],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029194469,0.000079527934,0.004129933,0.0003463953,0.000091341106,0.000101535086,0.0005178516,0.041972917,0.007280842,0.909714,0.0048980555,0.030575685],"study_design_scores_gemma":[0.00003745025,0.00022181653,0.005130983,0.00016582898,0.00011880028,0.00037190222,0.00031492693,0.2801277,0.012120467,0.68921256,0.012055558,0.00012195495],"about_ca_topic_score_codex":0.0008595371,"about_ca_topic_score_gemma":0.0011250842,"teacher_disagreement_score":0.0051491093,"about_ca_system_score_codex":0.0022521506,"about_ca_system_score_gemma":0.0006041903,"threshold_uncertainty_score":0.020759106},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6531066,0.0027280902,0.19399151,0.008367915,0.0005318148,0.00016572255,0.0010080038,0.00044170182,0.1396586],"genre_scores_gemma":[0.95921725,0.0012910521,0.025652532,0.0008311436,0.00037552216,0.00018512028,0.000568625,0.000076631244,0.011802212],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986052,0.00034103385,0.000091569964,0.00037964433,0.00035926182,0.00022336388],"domain_scores_gemma":[0.9946398,0.002849216,0.00070883747,0.00070229615,0.0005982083,0.000501716],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022808611,0.0004710197,0.0011396344,0.0025497407,0.0025169454,0.002882491,0.0012657661,0.0012971566,0.0066933143],"category_scores_gemma":[0.008136941,0.00049122015,0.0011056603,0.0015781544,0.0029897657,0.0076801064,0.0029352044,0.0018929952,0.0007101078],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008750693,0.00002243918,0.0003506577,0.000058272675,0.000014563585,0.00008555691,0.00020174282,0.0028479411,0.0006802635,0.9882088,0.0023051293,0.0051372373],"study_design_scores_gemma":[0.00002801449,0.000014421696,0.00019995094,0.000016733004,0.000009342435,0.000058153422,0.00008222993,0.011478352,0.00031404602,0.9838389,0.003948957,0.000010827826],"about_ca_topic_score_codex":0.0023058963,"about_ca_topic_score_gemma":0.0016905842,"teacher_disagreement_score":0.0066933143,"about_ca_system_score_codex":0.0018981725,"about_ca_system_score_gemma":0.000758395,"threshold_uncertainty_score":0.02239132},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.81204545,0.0009893591,0.10296791,0.0021613825,0.0001667471,0.00007309303,0.0007644507,0.0007333689,0.08009824],"genre_scores_gemma":[0.9558944,0.00044585016,0.026593996,0.0006156471,0.00007097319,0.00008838671,0.00065569486,0.00017896594,0.015456053],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989882,0.00022509022,0.000056781715,0.00034791097,0.00014613051,0.00023580862],"domain_scores_gemma":[0.99625385,0.0019272027,0.00055084476,0.0005379936,0.00032889555,0.0004012747],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010702183,0.00055259187,0.0008464031,0.00083395,0.0021006684,0.0024408973,0.00088925776,0.000989125,0.007761851],"category_scores_gemma":[0.0036197796,0.0006308543,0.0011273469,0.0009860421,0.00354845,0.0057003372,0.0018616954,0.0018770795,0.00093337253],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015401987,0.00004122346,0.0012500598,0.00016233258,0.000037220416,0.00017664563,0.00053605356,0.0038322092,0.002544168,0.9794892,0.0032756126,0.008501213],"study_design_scores_gemma":[0.000025204423,0.000046504905,0.00077565305,0.000030101171,0.00003160279,0.00031438228,0.00024482247,0.006200625,0.001854178,0.9824551,0.007994363,0.000027601587],"about_ca_topic_score_codex":0.0012937395,"about_ca_topic_score_gemma":0.0019346991,"teacher_disagreement_score":0.007761851,"about_ca_system_score_codex":0.0013538077,"about_ca_system_score_gemma":0.00069295993,"threshold_uncertainty_score":0.025966048},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.72144103,0.0011853088,0.1857321,0.0020068446,0.0003158613,0.00011413421,0.0006718918,0.0003634149,0.08816939],"genre_scores_gemma":[0.9488563,0.00071324146,0.020909395,0.00035430628,0.0002824617,0.00007848803,0.0007622746,0.00019005094,0.027853487],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995888,0.000060088183,0.000026954513,0.000108635184,0.000118748125,0.00009671985],"domain_scores_gemma":[0.99886,0.00037776234,0.00016306272,0.0001278006,0.00018822735,0.00028313755],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007383462,0.0007008714,0.0011026846,0.0031404481,0.0016206154,0.0038741117,0.0011124075,0.0013854621,0.00940085],"category_scores_gemma":[0.0027416693,0.00067437947,0.0011838474,0.0012608411,0.002466258,0.004984823,0.0024527863,0.0028687106,0.0007373741],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032817006,0.000019403828,0.0002851429,0.00002029627,0.000006529046,0.000063079264,0.00025128113,0.00060243346,0.0007093051,0.994692,0.00071748317,0.002600173],"study_design_scores_gemma":[0.000021111378,0.000018504013,0.0004952897,0.00001997594,0.000010642228,0.000113043796,0.0002503551,0.008347814,0.00035755933,0.9882753,0.00207848,0.00001189662],"about_ca_topic_score_codex":0.001436471,"about_ca_topic_score_gemma":0.0011469022,"teacher_disagreement_score":0.00940085,"about_ca_system_score_codex":0.0018206768,"about_ca_system_score_gemma":0.00041177624,"threshold_uncertainty_score":0.03144896},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6041214,0.0019811387,0.15670861,0.0015506754,0.00058939174,0.00013047065,0.0017287595,0.0016950362,0.2314945],"genre_scores_gemma":[0.94747853,0.00064307655,0.025498258,0.00021952731,0.00016878905,0.0001447025,0.001312528,0.00031419515,0.024220489],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99740916,0.00050470914,0.0002255028,0.00078946707,0.00064578094,0.00042537914],"domain_scores_gemma":[0.990991,0.004409384,0.00093025435,0.0017817524,0.0011997974,0.0006878741],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010371493,0.0006254611,0.0012284478,0.0038754754,0.0052598515,0.006078263,0.0017473442,0.0017444514,0.018394642],"category_scores_gemma":[0.011366273,0.0009569492,0.00093390705,0.0046973242,0.0046870094,0.011650826,0.0046768454,0.002373282,0.0023009782],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000044805976,0.00003643683,0.0021680458,0.00008559264,0.000020300584,0.00060369214,0.00084834924,0.0003581628,0.00072728074,0.9827351,0.0021891694,0.010183176],"study_design_scores_gemma":[0.0000061226247,0.000012579834,0.00080279127,0.000044770444,0.000017552935,0.0011420572,0.00072869123,0.0010810008,0.0009406159,0.9823744,0.012829932,0.000019532195],"about_ca_topic_score_codex":0.00045100183,"about_ca_topic_score_gemma":0.0006222537,"teacher_disagreement_score":0.018394642,"about_ca_system_score_codex":0.0010976352,"about_ca_system_score_gemma":0.0005610393,"threshold_uncertainty_score":0.061536252},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4962264,0.0038462395,0.15392917,0.0075238706,0.0009640781,0.00009794753,0.0004911662,0.000998942,0.33592212],"genre_scores_gemma":[0.9440339,0.0013137094,0.019485744,0.0010047007,0.00035423893,0.00008922746,0.00022125433,0.00024998342,0.033247177],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99943763,0.00016070058,0.0000266066,0.00013617855,0.00013527443,0.00010364366],"domain_scores_gemma":[0.9981376,0.0008311282,0.00013684592,0.0004167919,0.00020715682,0.0002705178],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006272162,0.00045719036,0.0007758755,0.0015249795,0.0025672195,0.003053395,0.0013711152,0.0015104025,0.0118029835],"category_scores_gemma":[0.0043070717,0.00057113904,0.00059886056,0.0009838111,0.0040173787,0.010009288,0.0032546408,0.0023925593,0.000860637],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017314296,0.000017644614,0.00019669566,0.00004124802,0.0000043409796,0.00007118222,0.0002124371,0.00047671475,0.0003939622,0.9918677,0.0015086352,0.0051922114],"study_design_scores_gemma":[0.000004542451,0.0000039742195,0.00006186846,0.00001584114,0.000003942604,0.000073872274,0.00011986264,0.00097561034,0.00013657902,0.99685425,0.001744461,0.000005153485],"about_ca_topic_score_codex":0.00082219404,"about_ca_topic_score_gemma":0.001509057,"teacher_disagreement_score":0.0118029835,"about_ca_system_score_codex":0.0010499295,"about_ca_system_score_gemma":0.0006181464,"threshold_uncertainty_score":0.03948486},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3105728,0.0071019717,0.24328256,0.014702837,0.0025140129,0.00029275258,0.0012749817,0.00072497607,0.419533],"genre_scores_gemma":[0.90158206,0.0036406086,0.042145588,0.0031337682,0.0014619904,0.00025273242,0.00062246417,0.0003035856,0.046857156],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987948,0.00040717272,0.00005718892,0.00028741718,0.00025382137,0.00019964436],"domain_scores_gemma":[0.9968458,0.0012315735,0.00035216793,0.00040298622,0.0005988493,0.00056860957],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020527812,0.0007724142,0.0021154154,0.003994118,0.0045808605,0.003126722,0.0024715508,0.0021907757,0.009729854],"category_scores_gemma":[0.007832398,0.00057093654,0.001761204,0.00303382,0.0039507644,0.0065172333,0.005538578,0.0037863061,0.0013339282],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016001084,0.000010079541,0.00010471559,0.000022164411,0.0000046910986,0.000029822004,0.000086501044,0.0006314954,0.00012005301,0.9959288,0.0015615462,0.0014841006],"study_design_scores_gemma":[0.000015610298,0.000011628347,0.00018478638,0.000028960829,0.000013218554,0.00011521883,0.00012235959,0.0068936134,0.00011629417,0.98713416,0.0053444197,0.00001964891],"about_ca_topic_score_codex":0.004445656,"about_ca_topic_score_gemma":0.0030924177,"teacher_disagreement_score":0.009729854,"about_ca_system_score_codex":0.0031205304,"about_ca_system_score_gemma":0.001423189,"threshold_uncertainty_score":0.03254962},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23693833,0.0011402881,0.7293204,0.0028595368,0.00019004755,0.00024784156,0.0016867826,0.00094929535,0.026667573],"genre_scores_gemma":[0.9324346,0.0007025921,0.05703286,0.00091365643,0.0002955216,0.00054168864,0.00084035547,0.00015255471,0.0070861196],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99419564,0.0020088386,0.00028549897,0.001758446,0.0011219378,0.0006296664],"domain_scores_gemma":[0.97906464,0.0123344455,0.0026353952,0.0036438287,0.0013972713,0.0009243947],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004044674,0.0005980993,0.0012690979,0.0016361028,0.0013625718,0.0023523655,0.0021252139,0.001994874,0.005243727],"category_scores_gemma":[0.029597528,0.0006787614,0.0010540893,0.0028088053,0.0042768274,0.010834279,0.002484931,0.0017958235,0.00080604176],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026889026,0.00006295355,0.0014025539,0.00016747299,0.000051221643,0.00018256351,0.00027099557,0.04154843,0.0032615452,0.9310643,0.003226057,0.018492963],"study_design_scores_gemma":[0.000060348913,0.00008144209,0.0010096999,0.00004237969,0.000027032464,0.0004377326,0.00009927673,0.23978545,0.0025169277,0.7512751,0.0046202154,0.000044432174],"about_ca_topic_score_codex":0.0017390134,"about_ca_topic_score_gemma":0.0013476465,"teacher_disagreement_score":0.005243727,"about_ca_system_score_codex":0.0030289607,"about_ca_system_score_gemma":0.0015205938,"threshold_uncertainty_score":0.02197671},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.83789957,0.0014095581,0.13661861,0.005036747,0.00018579047,0.00015914827,0.0012833242,0.00080648,0.016600892],"genre_scores_gemma":[0.9821846,0.00050925254,0.0122101065,0.0005396116,0.00016444681,0.00018768293,0.000610407,0.00013622112,0.003457599],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9962121,0.0012809994,0.00016979605,0.0013073385,0.0004884843,0.0005412316],"domain_scores_gemma":[0.9652143,0.020880647,0.0045601577,0.004975612,0.0013207737,0.00304851],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0046642544,0.0011335501,0.0016032838,0.0024855046,0.0022935846,0.0036822995,0.004159693,0.0027348502,0.0050051664],"category_scores_gemma":[0.04053422,0.0015526599,0.0015714795,0.0014764203,0.005773055,0.011069482,0.0043338574,0.0027463026,0.000878291],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015646449,0.00030570634,0.022340497,0.00056777464,0.0003257214,0.00038769117,0.00101205,0.17135355,0.010974034,0.7458466,0.013085708,0.03223606],"study_design_scores_gemma":[0.00018039472,0.00019867999,0.0032710137,0.000071084694,0.00012012582,0.00039155685,0.000195926,0.48945388,0.0046253926,0.49826476,0.0031419916,0.000085277796],"about_ca_topic_score_codex":0.0020956246,"about_ca_topic_score_gemma":0.0022179086,"teacher_disagreement_score":0.0050051664,"about_ca_system_score_codex":0.0040011727,"about_ca_system_score_gemma":0.0014055644,"threshold_uncertainty_score":0.02903068},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5625457,0.0041366983,0.1784255,0.007114343,0.00055824796,0.00012020433,0.003657904,0.0009500158,0.24249135],"genre_scores_gemma":[0.9435785,0.0013102269,0.020632382,0.0006065564,0.00086924224,0.0001698974,0.0016176649,0.00039132356,0.030824099],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99705577,0.0005669461,0.00021530404,0.00063752034,0.0010473331,0.00047715497],"domain_scores_gemma":[0.9856091,0.010056543,0.00089929963,0.0014617365,0.0007945084,0.0011788013],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002224429,0.00096937374,0.0015256106,0.0038156975,0.002403435,0.0060168332,0.0023385799,0.0011775851,0.016706958],"category_scores_gemma":[0.01070863,0.00094493676,0.0014859693,0.002663313,0.0043752333,0.012734944,0.0045295972,0.003041355,0.0016128055],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014292997,0.000040371655,0.00089116854,0.00014429381,0.00003295821,0.00009711209,0.0003268818,0.0030941227,0.0012273896,0.9830005,0.0033447647,0.0076573743],"study_design_scores_gemma":[0.00002562486,0.000028305118,0.0005575355,0.000035807578,0.00003710507,0.00016038878,0.00013841629,0.007197233,0.00142419,0.98445475,0.0059202905,0.000020301637],"about_ca_topic_score_codex":0.0009058465,"about_ca_topic_score_gemma":0.0011454549,"teacher_disagreement_score":0.016706958,"about_ca_system_score_codex":0.0028843128,"about_ca_system_score_gemma":0.0008452592,"threshold_uncertainty_score":0.05589038},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6405981,0.0034069992,0.17955169,0.025061043,0.0010976285,0.00008616753,0.0007836471,0.0007874532,0.1486273],"genre_scores_gemma":[0.97870994,0.0006382652,0.011547894,0.0023756626,0.000701636,0.00007185444,0.00025737754,0.00010677912,0.005590501],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99816126,0.0006513596,0.000065707805,0.00039112841,0.00039644114,0.00033416724],"domain_scores_gemma":[0.9890505,0.007293419,0.0007657519,0.0011760932,0.0009705259,0.00074377615],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003127528,0.00048033296,0.0012093184,0.001129401,0.0017385788,0.0029745318,0.0018712307,0.0026594857,0.0067155613],"category_scores_gemma":[0.018666418,0.0004738785,0.0009643096,0.000912479,0.003599592,0.007988335,0.0027310227,0.0047990573,0.0010001385],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000130522,0.000044231878,0.00092518533,0.000074901385,0.000013914832,0.000094779905,0.00016807503,0.0028199812,0.0009265159,0.98550826,0.0048705577,0.0044229496],"study_design_scores_gemma":[0.00001914826,0.000016932252,0.0002713344,0.000017094815,0.0000066255766,0.000070202994,0.00006186029,0.018520437,0.00039569027,0.97916096,0.0014463519,0.000013524697],"about_ca_topic_score_codex":0.0010892776,"about_ca_topic_score_gemma":0.0006403216,"teacher_disagreement_score":0.0067155613,"about_ca_system_score_codex":0.0015589865,"about_ca_system_score_gemma":0.00084994227,"threshold_uncertainty_score":0.022465825},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8672687,0.00070997456,0.09825412,0.00053233723,0.000115680086,0.000089594105,0.0002898119,0.00023452702,0.032505207],"genre_scores_gemma":[0.9709282,0.00037868923,0.02109857,0.00011628091,0.000086200365,0.0001578565,0.00051705627,0.00012474824,0.0065924446],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979855,0.00033049317,0.00018931895,0.0005614583,0.0005935956,0.0003397657],"domain_scores_gemma":[0.99470913,0.002626242,0.00071911764,0.000647888,0.00072175596,0.0005758831],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016914746,0.00080491,0.0014010186,0.0025831808,0.0029788709,0.0031533076,0.0017711477,0.0010961081,0.007725454],"category_scores_gemma":[0.0073061697,0.0005282301,0.0013705146,0.0011121836,0.003981818,0.0045994925,0.0038215907,0.0023157783,0.0006535994],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00056447135,0.000074674586,0.004134464,0.00015309844,0.00006299232,0.00069517305,0.0017280758,0.0040157647,0.014444722,0.95344454,0.00088115386,0.019800913],"study_design_scores_gemma":[0.00010824959,0.00039130007,0.0028468512,0.00011382171,0.00007123386,0.0015205435,0.0015059232,0.033873018,0.026040334,0.9233754,0.010068834,0.00008446098],"about_ca_topic_score_codex":0.0007522606,"about_ca_topic_score_gemma":0.00043493038,"teacher_disagreement_score":0.007725454,"about_ca_system_score_codex":0.0014555217,"about_ca_system_score_gemma":0.000490696,"threshold_uncertainty_score":0.025844216},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23990422,0.0026507608,0.4777239,0.006207471,0.0010642142,0.0002570802,0.0022381262,0.0019728513,0.26798147],"genre_scores_gemma":[0.81044954,0.0013823756,0.10352758,0.0014390261,0.0009770433,0.00048857665,0.0023415096,0.0010245056,0.07836982],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9965209,0.00073598826,0.00028130724,0.00060650334,0.0012100945,0.00064528984],"domain_scores_gemma":[0.98733926,0.008144488,0.00080253946,0.0014600869,0.0016135985,0.0006400749],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028012425,0.0013567009,0.0017118638,0.0035374172,0.0018391283,0.0043489556,0.003559893,0.0017661419,0.026374124],"category_scores_gemma":[0.023196148,0.0008020335,0.0024637394,0.0025321613,0.0027481802,0.0086104665,0.0044833464,0.0050518624,0.003739621],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000683851,0.000032327895,0.00059468404,0.00020414405,0.000026058144,0.000088964596,0.00026615124,0.0032302283,0.0007846652,0.97873586,0.0046550967,0.011313358],"study_design_scores_gemma":[0.000024287086,0.000012640992,0.00020834965,0.000041519037,0.000023461811,0.000057546687,0.00004732407,0.040482067,0.0013139484,0.95427114,0.0034959167,0.000021821397],"about_ca_topic_score_codex":0.0031522033,"about_ca_topic_score_gemma":0.0039796266,"teacher_disagreement_score":0.026374124,"about_ca_system_score_codex":0.0038752323,"about_ca_system_score_gemma":0.0015608052,"threshold_uncertainty_score":0.08823025},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9048602,0.0005611788,0.06550307,0.001553214,0.00007318016,0.00005620542,0.0004202249,0.00031027416,0.026662512],"genre_scores_gemma":[0.98354673,0.00017963588,0.011436166,0.0001825173,0.000054756863,0.000043125772,0.00033519624,0.000045101857,0.0041768015],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995709,0.00008067426,0.000018377967,0.00011865894,0.00010893701,0.0001025117],"domain_scores_gemma":[0.99675876,0.0017264106,0.00042476904,0.00041535607,0.00032591043,0.0003487457],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003968424,0.0002447753,0.00039330346,0.0011647786,0.00097144704,0.0013278004,0.00091494137,0.00076033,0.006009996],"category_scores_gemma":[0.0036509337,0.00043220172,0.00040452875,0.0012653761,0.0013889895,0.0023986092,0.0013604985,0.00080520695,0.00033161833],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00032651564,0.000081339094,0.0065110633,0.0001916493,0.000042074276,0.00091241836,0.00080539077,0.027588306,0.022027869,0.92226267,0.005453589,0.0137971],"study_design_scores_gemma":[0.000095600844,0.000055192715,0.0044996063,0.000043206554,0.000039099217,0.0011198366,0.0003274298,0.10224044,0.008855157,0.87307465,0.009618252,0.000031390387],"about_ca_topic_score_codex":0.003018037,"about_ca_topic_score_gemma":0.0035812773,"teacher_disagreement_score":0.006009996,"about_ca_system_score_codex":0.0014611677,"about_ca_system_score_gemma":0.00039958223,"threshold_uncertainty_score":0.020105422},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.90119064,0.00073841074,0.030054316,0.0022614512,0.000127745,0.000050469254,0.0002637846,0.00020334533,0.06510983],"genre_scores_gemma":[0.98829925,0.00030527136,0.004143825,0.00019449565,0.00014668092,0.00003666701,0.0001950317,0.000052048912,0.006626684],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99968684,0.00008509869,0.000015601143,0.000058735204,0.000085593885,0.00006814222],"domain_scores_gemma":[0.9965359,0.0017864772,0.0005157812,0.00017824395,0.00042283896,0.0005607891],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004614334,0.00046309156,0.00072336086,0.003727144,0.0021446275,0.0034658748,0.0010759302,0.001176567,0.006490225],"category_scores_gemma":[0.005025349,0.0005714145,0.0003640255,0.0014917388,0.0030679272,0.0040589576,0.0016832647,0.0015510641,0.00047222315],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028250337,0.000020202971,0.00049655343,0.000037904643,0.0000039417355,0.00007971136,0.0003182652,0.0010038812,0.00053753756,0.9947497,0.00093997363,0.0017841163],"study_design_scores_gemma":[0.000009973958,0.0000073966294,0.00029911147,0.000015554495,0.0000041923404,0.00010288019,0.00016028708,0.004434602,0.00019391038,0.99408805,0.0006780519,0.0000060483344],"about_ca_topic_score_codex":0.0015092993,"about_ca_topic_score_gemma":0.0022797827,"teacher_disagreement_score":0.006490225,"about_ca_system_score_codex":0.0012397191,"about_ca_system_score_gemma":0.00053341413,"threshold_uncertainty_score":0.021712005},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47470972,0.0071841003,0.26383603,0.017996052,0.00044411304,0.00017770969,0.002517218,0.0012514705,0.2318836],"genre_scores_gemma":[0.9467706,0.0018668448,0.0350768,0.0008835511,0.0003741344,0.00013232409,0.0009356283,0.0003866551,0.01357361],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99841595,0.00021311583,0.000051379728,0.00040546973,0.00042378457,0.0004902321],"domain_scores_gemma":[0.9860249,0.009834797,0.0007730802,0.0013513139,0.00080392807,0.0012119641],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00221684,0.00081735663,0.001100374,0.0020180927,0.0026289595,0.0035060265,0.0030746008,0.0013665915,0.010857365],"category_scores_gemma":[0.01122301,0.0005524823,0.0012926174,0.002283733,0.0043829484,0.008777922,0.0033284603,0.0055218916,0.0012926876],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011582015,0.00031046852,0.0077461703,0.0007087751,0.00007826081,0.0004006275,0.0009580777,0.04462103,0.014414477,0.8673538,0.018966194,0.043283828],"study_design_scores_gemma":[0.00009379375,0.0001039391,0.0024936465,0.00013149562,0.000087965156,0.00037007665,0.00018432598,0.114134766,0.0059573357,0.8658967,0.010497742,0.000048303544],"about_ca_topic_score_codex":0.005767351,"about_ca_topic_score_gemma":0.009689831,"teacher_disagreement_score":0.010857365,"about_ca_system_score_codex":0.0056508775,"about_ca_system_score_gemma":0.0017005516,"threshold_uncertainty_score":0.041000187},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16488886,0.006023823,0.5337382,0.011199603,0.0004878452,0.0006552056,0.00411328,0.003674186,0.27521902],"genre_scores_gemma":[0.86099184,0.0039854837,0.07538862,0.0043743677,0.0007614499,0.0021358996,0.0038276007,0.0018375014,0.046697337],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.994497,0.0013655704,0.00018246331,0.0009873492,0.0011971869,0.0017704553],"domain_scores_gemma":[0.9479067,0.04236847,0.0018702807,0.0025562604,0.0017667483,0.0035315913],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0039057508,0.0042762063,0.003089959,0.0036094752,0.0034947796,0.0073315287,0.007221481,0.003280082,0.02968604],"category_scores_gemma":[0.03786219,0.0015931186,0.0023953666,0.0037917062,0.005720423,0.016292669,0.007046205,0.008533512,0.004681176],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005631578,0.0003664695,0.0015877924,0.00073380314,0.0001115438,0.00020765919,0.0009913738,0.08331976,0.0033475622,0.86283046,0.02109834,0.024842013],"study_design_scores_gemma":[0.00007470139,0.000083699015,0.00018995392,0.00011467213,0.000050330855,0.00010782647,0.00012607993,0.20127174,0.0012558595,0.79239213,0.0042822845,0.000050762294],"about_ca_topic_score_codex":0.0048613627,"about_ca_topic_score_gemma":0.006392521,"teacher_disagreement_score":0.02968604,"about_ca_system_score_codex":0.008665629,"about_ca_system_score_gemma":0.004290978,"threshold_uncertainty_score":0.09930968},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8666999,0.00032157652,0.12494091,0.0006108762,0.000025903155,0.000032286163,0.0005048113,0.00027933018,0.0065844236],"genre_scores_gemma":[0.98221093,0.00013347724,0.015117982,0.0000805435,0.00003455303,0.00007840073,0.00037976092,0.000049011225,0.0019153085],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985745,0.000329879,0.00008791535,0.00034981788,0.0004780516,0.00017974542],"domain_scores_gemma":[0.9915953,0.0044273497,0.0012120074,0.0014764703,0.000720261,0.0005686104],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001385121,0.000307854,0.0009771693,0.0015637521,0.0013332436,0.0033205824,0.0015827593,0.00089716155,0.003636142],"category_scores_gemma":[0.015280259,0.00059082895,0.0005524028,0.0016186198,0.002557537,0.0052622026,0.0025613059,0.0010839248,0.0003445297],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005855551,0.000067159606,0.008563541,0.00016140325,0.000052387426,0.00039711615,0.00081746257,0.032738734,0.009053135,0.9305358,0.0015439354,0.015483783],"study_design_scores_gemma":[0.00006128679,0.00014556451,0.0035402754,0.00006441245,0.000058512676,0.0010235977,0.0005207,0.23385207,0.009548999,0.7471065,0.0040109213,0.000067240755],"about_ca_topic_score_codex":0.0006459801,"about_ca_topic_score_gemma":0.00056920655,"teacher_disagreement_score":0.003636142,"about_ca_system_score_codex":0.0015435508,"about_ca_system_score_gemma":0.00064734765,"threshold_uncertainty_score":0.012164116},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2334754,0.0036350754,0.55252516,0.0044058487,0.0005813046,0.00025616496,0.0014627939,0.000680988,0.20297723],"genre_scores_gemma":[0.86382216,0.002539804,0.10742456,0.002306932,0.00075355504,0.00057151285,0.0011688949,0.00031747745,0.021095065],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99750656,0.00049730414,0.00014985402,0.0007430572,0.00067029824,0.00043298822],"domain_scores_gemma":[0.9952928,0.0025610835,0.00038296948,0.00088493153,0.0005202755,0.0003579421],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024916586,0.0007887934,0.0013492473,0.002546832,0.0029063453,0.002574011,0.0018537686,0.0014422998,0.0067196526],"category_scores_gemma":[0.008051877,0.000738865,0.002232473,0.0020544082,0.005025795,0.009745515,0.00634277,0.0036998137,0.0012827372],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000046739937,0.000028738328,0.0007800036,0.00010760313,0.000019167657,0.00012008543,0.00038374198,0.0018198588,0.0011782731,0.98434573,0.002646063,0.0085240705],"study_design_scores_gemma":[0.000039366794,0.000070390444,0.0010412973,0.00006333083,0.00004013026,0.0005373083,0.0002948385,0.015927732,0.002288544,0.9625264,0.017128637,0.000042129534],"about_ca_topic_score_codex":0.001958669,"about_ca_topic_score_gemma":0.0018210167,"teacher_disagreement_score":0.0067196526,"about_ca_system_score_codex":0.002063582,"about_ca_system_score_gemma":0.0009761522,"threshold_uncertainty_score":0.022479475},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.53644925,0.0017648427,0.3757211,0.0025584896,0.00023808546,0.00019649835,0.00120356,0.0012308209,0.080637306],"genre_scores_gemma":[0.94490474,0.0005488273,0.039801266,0.0005929051,0.00018538746,0.00025675053,0.000990082,0.000388893,0.012331127],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999073,0.00024533528,0.000028186001,0.00023826082,0.0002543402,0.0001607488],"domain_scores_gemma":[0.9939382,0.0035628523,0.0007226107,0.000623852,0.0005381552,0.00061422226],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011836545,0.00051286543,0.00086826266,0.0016866938,0.0014475156,0.0016994091,0.001592158,0.0011358238,0.007871157],"category_scores_gemma":[0.01068938,0.0006520281,0.0008642602,0.0009449733,0.0018769571,0.0032562546,0.0018588498,0.002355781,0.00078559626],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001287656,0.00004842813,0.0013317597,0.00011849237,0.000023420502,0.00014202131,0.00022470187,0.021616943,0.003475841,0.95880675,0.0049700267,0.00911275],"study_design_scores_gemma":[0.000060983188,0.000071721915,0.0016489072,0.000046565106,0.000028847024,0.00062824326,0.00016957702,0.18995887,0.002791443,0.7961199,0.008435323,0.00003954406],"about_ca_topic_score_codex":0.0015136192,"about_ca_topic_score_gemma":0.0013887858,"teacher_disagreement_score":0.007871157,"about_ca_system_score_codex":0.0014388203,"about_ca_system_score_gemma":0.0004926367,"threshold_uncertainty_score":0.026331604},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.80872387,0.00063412136,0.15736449,0.0007989939,0.00011647042,0.000048903134,0.0005151458,0.00035347964,0.03144457],"genre_scores_gemma":[0.98411405,0.00023386604,0.0107461335,0.00010643152,0.00017414572,0.0000423185,0.00025752513,0.000040291623,0.004285292],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983171,0.0003884626,0.00009096326,0.0003010114,0.00065790024,0.00024465797],"domain_scores_gemma":[0.9902638,0.0050664274,0.0014333059,0.0010252778,0.0011477682,0.0010633795],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012704247,0.00069496554,0.00062625326,0.0018757507,0.0008156589,0.0024755346,0.0007492301,0.0006287259,0.0057484093],"category_scores_gemma":[0.0088803945,0.00031437443,0.00036434634,0.000708884,0.002186783,0.0026309919,0.0019483346,0.0011826144,0.0010549603],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00050905923,0.0001565193,0.0042502633,0.00023660567,0.00005383271,0.0003283602,0.0007132808,0.022038298,0.02536574,0.921257,0.0028476405,0.022243332],"study_design_scores_gemma":[0.00006195781,0.00033568617,0.0023161054,0.000056583653,0.000035852445,0.00061060017,0.00031763903,0.0678841,0.020261226,0.90151453,0.006523048,0.0000825939],"about_ca_topic_score_codex":0.0002857761,"about_ca_topic_score_gemma":0.0002729797,"teacher_disagreement_score":0.0057484093,"about_ca_system_score_codex":0.0004364203,"about_ca_system_score_gemma":0.0003648858,"threshold_uncertainty_score":0.019230366},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37414438,0.0056740916,0.46945563,0.004368602,0.00045507157,0.00021417851,0.0028145437,0.0008943607,0.14197908],"genre_scores_gemma":[0.92940366,0.004691066,0.04518085,0.0010414977,0.00053535885,0.00045536648,0.0016666489,0.00013272018,0.016892761],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99689436,0.00059997896,0.00023241877,0.0009716059,0.0007293117,0.0005723194],"domain_scores_gemma":[0.99355537,0.0035977957,0.0009056371,0.0007706344,0.00075691985,0.0004136078],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023476724,0.000746899,0.0018291222,0.0030015134,0.0029359427,0.0028056523,0.0015425069,0.0017087604,0.008625221],"category_scores_gemma":[0.011512163,0.0008387655,0.0018031552,0.0025792562,0.001993256,0.007876629,0.0030923868,0.0024208815,0.0014963961],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016002504,0.000037455917,0.001581435,0.00020448393,0.00006326049,0.00031327675,0.00043914065,0.008125967,0.0012811046,0.96210414,0.0049875756,0.020702194],"study_design_scores_gemma":[0.000058347796,0.00007795425,0.0011588578,0.00008689635,0.000068914356,0.00094751734,0.0002731692,0.030855788,0.001232057,0.9439171,0.0212709,0.000052455984],"about_ca_topic_score_codex":0.0015152602,"about_ca_topic_score_gemma":0.0006351459,"teacher_disagreement_score":0.008625221,"about_ca_system_score_codex":0.001934191,"about_ca_system_score_gemma":0.00097126287,"threshold_uncertainty_score":0.028854191},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6563473,0.0005075697,0.27409402,0.0012029136,0.00011508556,0.00008934888,0.0005013235,0.00031476025,0.06682768],"genre_scores_gemma":[0.92810035,0.00047675215,0.06112081,0.00034997019,0.00012912901,0.00013368377,0.0005917612,0.000091506816,0.009006052],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994491,0.00013171215,0.000018891102,0.00018694489,0.00014261976,0.00007075133],"domain_scores_gemma":[0.9981939,0.0011155687,0.00024816234,0.00014636092,0.0001536124,0.00014229931],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041512577,0.0003357633,0.00033174382,0.0009129024,0.0009113143,0.0010086711,0.00046984793,0.000330086,0.0039331405],"category_scores_gemma":[0.002319625,0.00017734815,0.0005002863,0.0006585917,0.0015627079,0.0023541197,0.00086244626,0.0010463868,0.00036380158],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000086439235,0.000025350322,0.00043913507,0.00006394154,0.000007703752,0.00012267206,0.00039022035,0.0049784733,0.0046591777,0.9775814,0.0009469554,0.0106984945],"study_design_scores_gemma":[0.000025677722,0.00010565372,0.0014098352,0.000047817735,0.00002108143,0.00053700636,0.0002775017,0.034005724,0.004786507,0.946702,0.012055895,0.000025407533],"about_ca_topic_score_codex":0.0008692043,"about_ca_topic_score_gemma":0.0009129364,"teacher_disagreement_score":0.0039331405,"about_ca_system_score_codex":0.0007245412,"about_ca_system_score_gemma":0.00044558267,"threshold_uncertainty_score":0.013157666},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0127070695,0.0056909663,0.9096902,0.0032985273,0.0012957354,0.0001656671,0.0013541208,0.0011384814,0.064659186],"genre_scores_gemma":[0.50741416,0.013836099,0.37399432,0.00882357,0.005906079,0.001877221,0.0038185862,0.0026780348,0.08165188],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9866735,0.0032691834,0.00060300267,0.002355777,0.00486169,0.0022367514],"domain_scores_gemma":[0.9410651,0.035723418,0.002508407,0.008861023,0.010522128,0.0013199116],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.012251144,0.0031040332,0.0030153336,0.004913531,0.0023631654,0.0042122784,0.0059547825,0.0023655938,0.01801136],"category_scores_gemma":[0.052451573,0.0016690482,0.004822574,0.005364868,0.0067442264,0.015478261,0.0072012637,0.013759329,0.007108867],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031206355,0.00010311944,0.0018995359,0.0005326692,0.00016065523,0.00051021273,0.0005016329,0.02318637,0.004188757,0.8941949,0.023787718,0.05062237],"study_design_scores_gemma":[0.00006482699,0.00016338931,0.0015752818,0.00025303915,0.0001763628,0.0007098879,0.000109212466,0.12900299,0.0067670667,0.82414407,0.036858577,0.00017531973],"about_ca_topic_score_codex":0.0045537828,"about_ca_topic_score_gemma":0.0034044788,"teacher_disagreement_score":0.01801136,"about_ca_system_score_codex":0.0057992046,"about_ca_system_score_gemma":0.0032907187,"threshold_uncertainty_score":0.064790964},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.673963,0.0009067998,0.2788772,0.0007947387,0.00007156503,0.0001143547,0.00053581205,0.0006190677,0.044117447],"genre_scores_gemma":[0.96110445,0.0005394868,0.030092398,0.00020664978,0.000091101545,0.00023339305,0.00033722026,0.00013500979,0.0072601875],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99861276,0.00039279283,0.00006674028,0.00025048916,0.00036529158,0.00031181792],"domain_scores_gemma":[0.99343055,0.0039369795,0.0006687368,0.00067108916,0.0005661953,0.00072643877],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012364927,0.00061509537,0.0008790285,0.0014945448,0.0011768052,0.001806055,0.001123693,0.0010730389,0.00422733],"category_scores_gemma":[0.01545652,0.00075435,0.0008798623,0.0008741932,0.0023175813,0.0034139876,0.002424198,0.0013795142,0.00069697184],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015875527,0.00005644185,0.002686538,0.0001431649,0.00004173888,0.00035481955,0.00046482222,0.02798624,0.008411138,0.94071966,0.0020502338,0.016926412],"study_design_scores_gemma":[0.000035238052,0.00008885515,0.0023080783,0.000054907447,0.000028558832,0.0005004797,0.00018339313,0.13517879,0.0045168116,0.85363376,0.0034212947,0.00004979604],"about_ca_topic_score_codex":0.0012530312,"about_ca_topic_score_gemma":0.0012476061,"teacher_disagreement_score":0.00422733,"about_ca_system_score_codex":0.0013419962,"about_ca_system_score_gemma":0.00063959113,"threshold_uncertainty_score":0.014141858},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3508357,0.0039023627,0.43299118,0.0041038427,0.0009614535,0.00019734066,0.0021623257,0.0008590369,0.20398669],"genre_scores_gemma":[0.9224367,0.002813628,0.051763143,0.0013703501,0.00087610533,0.0003292523,0.0015682048,0.00023784541,0.018604828],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9968991,0.0006326793,0.0002534252,0.0008427555,0.0007626804,0.0006093203],"domain_scores_gemma":[0.9940817,0.0029523238,0.0008161949,0.0010546454,0.0006308582,0.0004641274],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025333455,0.00094502146,0.001744027,0.0021272504,0.0028178308,0.0036416573,0.0011751832,0.0019542407,0.009541619],"category_scores_gemma":[0.008968854,0.0006503289,0.0019910622,0.0021578665,0.0038824603,0.00751791,0.003763082,0.003950809,0.0022228612],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000108167864,0.000018137274,0.00070901593,0.00008928969,0.000020523394,0.00014588707,0.00015898752,0.0027684544,0.00085978006,0.9856221,0.0019673235,0.007532404],"study_design_scores_gemma":[0.00003430402,0.000055855362,0.0005978657,0.00005067514,0.000033931694,0.00041423022,0.00012074369,0.01326904,0.0012856838,0.9731257,0.0109653585,0.000046648343],"about_ca_topic_score_codex":0.0010163583,"about_ca_topic_score_gemma":0.0006482256,"teacher_disagreement_score":0.009541619,"about_ca_system_score_codex":0.0014888139,"about_ca_system_score_gemma":0.0010872739,"threshold_uncertainty_score":0.031919956},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8288275,0.0010959418,0.10886456,0.0020362083,0.0003466157,0.000040955885,0.0002854035,0.00044612217,0.05805673],"genre_scores_gemma":[0.9562892,0.00071129744,0.0215082,0.0003042328,0.00024983202,0.000062339175,0.00033648484,0.00032107317,0.02021732],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99943775,0.00014365325,0.000023682058,0.00012979252,0.00012688774,0.0001382143],"domain_scores_gemma":[0.99572045,0.0022282475,0.00038111096,0.00038351514,0.0004777607,0.0008088874],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006508376,0.00065557606,0.0007704066,0.0017606919,0.0016979309,0.003397781,0.0014360688,0.0009921266,0.0056921025],"category_scores_gemma":[0.0042478815,0.0008211084,0.0006514023,0.0011651297,0.0022267979,0.0037852328,0.002434141,0.001978561,0.00071365084],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010086251,0.00003382291,0.0012612637,0.000079141246,0.000008687916,0.00012439984,0.00050183124,0.0033328151,0.003908007,0.9823961,0.002239474,0.0060135447],"study_design_scores_gemma":[0.000020283735,0.000020062953,0.00090010505,0.000030551357,0.00001307677,0.00015576994,0.00029903735,0.015413772,0.001718006,0.9774889,0.003927572,0.000012924285],"about_ca_topic_score_codex":0.0015984906,"about_ca_topic_score_gemma":0.0016127256,"teacher_disagreement_score":0.0056921025,"about_ca_system_score_codex":0.0015205279,"about_ca_system_score_gemma":0.00054825837,"threshold_uncertainty_score":0.019041955},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.81342375,0.001690415,0.12484996,0.0007466719,0.00016029614,0.00004251648,0.00027147573,0.00029949492,0.05851544],"genre_scores_gemma":[0.97236156,0.0007507584,0.019259956,0.00009984141,0.00010879093,0.000050531053,0.00014897296,0.00006103282,0.0071584703],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996419,0.000056344616,0.000019561425,0.000116610434,0.0000930907,0.00007250588],"domain_scores_gemma":[0.997465,0.0014944134,0.0003107913,0.00020586078,0.00021731229,0.00030652637],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039113036,0.00046353583,0.00042815375,0.0020147525,0.0010129595,0.0013010566,0.00080753164,0.0004912241,0.0043498906],"category_scores_gemma":[0.0034303882,0.00032129226,0.0004051566,0.000819159,0.0020989927,0.0026435505,0.0014935617,0.001083033,0.0005980702],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010218473,0.000027219145,0.0015645092,0.0001514577,0.000020021065,0.00022105924,0.00058627763,0.008789151,0.0087049,0.95621455,0.0014166213,0.022202002],"study_design_scores_gemma":[0.000009435491,0.000051197167,0.0008505028,0.00003871345,0.000022109076,0.00030761983,0.000230757,0.03523143,0.006708995,0.9509084,0.0056157387,0.000024990013],"about_ca_topic_score_codex":0.00047632176,"about_ca_topic_score_gemma":0.0006440731,"teacher_disagreement_score":0.0043498906,"about_ca_system_score_codex":0.00074783445,"about_ca_system_score_gemma":0.00028014526,"threshold_uncertainty_score":0.014551818},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0960625,0.012918795,0.057440005,0.015474349,0.0021892712,0.0000330583,0.0003698968,0.00034710098,0.815165],"genre_scores_gemma":[0.8599004,0.004602598,0.013224396,0.0020478196,0.0012392711,0.00009034335,0.00024804848,0.00032756265,0.118319534],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99960333,0.00009948917,0.000020218811,0.00007830979,0.0001325635,0.00006607893],"domain_scores_gemma":[0.9992893,0.0002979465,0.0000619977,0.00013753874,0.000106003026,0.000107240376],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008094527,0.00046549566,0.0007569004,0.0010453445,0.0023972597,0.0053085983,0.0009712092,0.0017016132,0.009558149],"category_scores_gemma":[0.0029169272,0.00042884794,0.00045820762,0.00077692576,0.0065504545,0.014635386,0.0020391382,0.0031764973,0.001739477],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000042020547,0.0000013396533,0.00001518638,0.0000069281687,9.730313e-7,0.0000064750184,0.00014481474,0.00003960926,0.00006569052,0.9979615,0.0005854994,0.0011678231],"study_design_scores_gemma":[0.0000017508017,0.0000018064608,0.000027054966,0.0000073466017,9.010395e-7,0.000015665202,0.00011136045,0.00011653503,0.000059780705,0.9955232,0.0041314964,0.0000030469537],"about_ca_topic_score_codex":0.0012570933,"about_ca_topic_score_gemma":0.0011535715,"teacher_disagreement_score":0.009558149,"about_ca_system_score_codex":0.0012927812,"about_ca_system_score_gemma":0.0005686729,"threshold_uncertainty_score":0.03197515},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41945803,0.004288678,0.2724353,0.0051617343,0.0007486848,0.000118202406,0.00040237696,0.00028805164,0.29709888],"genre_scores_gemma":[0.9523747,0.0014201378,0.03438389,0.00067399733,0.00037604742,0.00019792802,0.00023442144,0.000055113003,0.010283821],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99850214,0.00050871447,0.000079362064,0.00028878756,0.00039578576,0.00022526171],"domain_scores_gemma":[0.99722594,0.0015661482,0.00043521074,0.00024457384,0.0002602207,0.0002678858],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024744691,0.00054077234,0.0011165794,0.0022260626,0.0027884515,0.0029227422,0.0014919882,0.0016288117,0.0053305235],"category_scores_gemma":[0.0076060384,0.0005555096,0.0009498702,0.0016205296,0.005336901,0.008710487,0.006384239,0.002714153,0.00093495456],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012484496,0.0000051448433,0.00008860998,0.000013734127,0.0000035413784,0.000044587567,0.00009091526,0.00027880256,0.000118258635,0.9975126,0.00031043644,0.0015208827],"study_design_scores_gemma":[0.000012538152,0.000011256461,0.00010825486,0.000021499185,0.000005907255,0.00012958894,0.00008022401,0.0025740606,0.00024207424,0.99406415,0.0027425908,0.0000078514595],"about_ca_topic_score_codex":0.00072639826,"about_ca_topic_score_gemma":0.00035010418,"teacher_disagreement_score":0.0053305235,"about_ca_system_score_codex":0.0019215818,"about_ca_system_score_gemma":0.0006441336,"threshold_uncertainty_score":0.017832398},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.50375384,0.0035828792,0.18879735,0.0043246304,0.00056722015,0.00006126571,0.00079300697,0.0010232056,0.29709664],"genre_scores_gemma":[0.97070515,0.00070640526,0.013426008,0.00036331223,0.00055399054,0.000048863905,0.00031248972,0.000101331425,0.013782507],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99879766,0.0002543193,0.00006711251,0.00025411567,0.00041363327,0.0002131536],"domain_scores_gemma":[0.9965432,0.0023230067,0.00021445255,0.00035927608,0.00026966722,0.0002903832],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014836349,0.00043610757,0.0009832863,0.002073949,0.00172837,0.0021572567,0.00091460755,0.0007838906,0.0073968214],"category_scores_gemma":[0.006402174,0.00033921268,0.0009867568,0.0011281756,0.0028479346,0.0038649568,0.0024392307,0.0020630213,0.0010108497],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000044427572,0.00001983883,0.0005437206,0.000051531133,0.000014611895,0.000117130236,0.00030411765,0.0013298568,0.00075321115,0.989994,0.0011904633,0.005637171],"study_design_scores_gemma":[0.0000128640395,0.00002100178,0.0008835509,0.000019549954,0.000012291164,0.00023852612,0.00011308362,0.0062700426,0.00077154173,0.98473245,0.0069095064,0.00001547631],"about_ca_topic_score_codex":0.0009140622,"about_ca_topic_score_gemma":0.0008869878,"teacher_disagreement_score":0.0073968214,"about_ca_system_score_codex":0.0013530357,"about_ca_system_score_gemma":0.0004108074,"threshold_uncertainty_score":0.024744809},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5749078,0.012521401,0.19366261,0.0034407314,0.0006268527,0.00008237953,0.0009455192,0.00037984186,0.21343286],"genre_scores_gemma":[0.96660155,0.002606523,0.014689146,0.0002465146,0.0002449368,0.0001245124,0.0002803216,0.000048866877,0.015157504],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995308,0.0001122804,0.00002868024,0.00011303235,0.00015259186,0.00006250358],"domain_scores_gemma":[0.99830854,0.000955967,0.0002475252,0.00016034186,0.00017910523,0.00014856349],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007681578,0.00038214325,0.00046000257,0.0017467319,0.00088737236,0.002812106,0.000705089,0.00074145786,0.00669377],"category_scores_gemma":[0.0037283006,0.00033838017,0.00035826565,0.0017015574,0.002140461,0.004761794,0.0014181581,0.0013194839,0.0006603657],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024903291,0.000010226511,0.00020129111,0.00005862443,0.000005123078,0.000017586373,0.00012393713,0.0014925291,0.0008240182,0.9886203,0.0018544451,0.006766999],"study_design_scores_gemma":[0.000008311773,0.000017520953,0.0005308433,0.000041618237,0.000007765946,0.0001392412,0.00010753037,0.006738873,0.0008206939,0.98519915,0.006379604,0.000008842892],"about_ca_topic_score_codex":0.0003311438,"about_ca_topic_score_gemma":0.00042589655,"teacher_disagreement_score":0.00669377,"about_ca_system_score_codex":0.0011865117,"about_ca_system_score_gemma":0.0003503407,"threshold_uncertainty_score":0.022392929},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8145558,0.0009185153,0.11208326,0.00202236,0.00016111461,0.00010364248,0.0008914526,0.0007448458,0.06851901],"genre_scores_gemma":[0.95576674,0.00041324532,0.030290144,0.0006064758,0.0000648813,0.00010133682,0.00074770633,0.0001510234,0.011858452],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99898833,0.00024651358,0.000056413824,0.00031911847,0.00013124853,0.00025831617],"domain_scores_gemma":[0.99572104,0.0022102043,0.0007159583,0.0005597179,0.00037467715,0.0004183243],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009946853,0.0006019458,0.0008272483,0.0008291,0.0022586337,0.002116241,0.00081893656,0.0010355479,0.007783504],"category_scores_gemma":[0.0040892055,0.0006912958,0.001188331,0.0011229075,0.0033679695,0.0055402196,0.0017365663,0.0016393118,0.0010295048],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022843637,0.000054221153,0.0017439347,0.00021512457,0.000057777484,0.00024367463,0.00064695656,0.0068289624,0.0034916403,0.9696824,0.004843462,0.011963437],"study_design_scores_gemma":[0.00003103418,0.000058754966,0.00089726027,0.000028887805,0.000039018683,0.00037847811,0.0002312948,0.0077492907,0.0019731787,0.98138547,0.0071909595,0.00003642561],"about_ca_topic_score_codex":0.0012299774,"about_ca_topic_score_gemma":0.0020809933,"teacher_disagreement_score":0.007783504,"about_ca_system_score_codex":0.0011813213,"about_ca_system_score_gemma":0.0008523631,"threshold_uncertainty_score":0.026038408},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6969633,0.003179366,0.101695925,0.06349928,0.0006376123,0.00017452559,0.0017602849,0.0008823402,0.13120729],"genre_scores_gemma":[0.9902436,0.0006893332,0.0034028618,0.00069551903,0.00048544476,0.00006035517,0.000298063,0.00012064963,0.004004236],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9953656,0.0018891401,0.00018925969,0.001240043,0.00080449984,0.00051149726],"domain_scores_gemma":[0.96548194,0.021877654,0.0038416812,0.003416256,0.002310911,0.0030715724],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004493019,0.0004076897,0.0015492565,0.0021931776,0.0023817827,0.007899063,0.0017567748,0.0035009624,0.011366777],"category_scores_gemma":[0.04744826,0.0010128119,0.00076750334,0.0020524296,0.009785654,0.018871328,0.0034047458,0.0035007144,0.0013607317],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009440496,0.00004667906,0.005169575,0.0001231758,0.00004769505,0.00037484526,0.00092511805,0.0013309666,0.00045654675,0.97594565,0.00529444,0.010190944],"study_design_scores_gemma":[0.000026204709,0.00002473676,0.0023525306,0.000039619317,0.000030033187,0.0006370113,0.0011023218,0.0048384424,0.0004260002,0.9855886,0.0048956815,0.0000387361],"about_ca_topic_score_codex":0.0012656352,"about_ca_topic_score_gemma":0.0008395939,"teacher_disagreement_score":0.011366777,"about_ca_system_score_codex":0.0015647857,"about_ca_system_score_gemma":0.000772246,"threshold_uncertainty_score":0.038025677},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5749078,0.012521401,0.19366261,0.0034407314,0.0006268527,0.00008237953,0.0009455192,0.00037984186,0.21343286],"genre_scores_gemma":[0.96660155,0.002606523,0.014689146,0.0002465146,0.0002449368,0.0001245124,0.0002803216,0.000048866877,0.015157504],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995308,0.0001122804,0.00002868024,0.00011303235,0.00015259186,0.00006250358],"domain_scores_gemma":[0.99830854,0.000955967,0.0002475252,0.00016034186,0.00017910523,0.00014856349],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007681578,0.00038214325,0.00046000257,0.0017467319,0.00088737236,0.002812106,0.000705089,0.00074145786,0.00669377],"category_scores_gemma":[0.0037283006,0.00033838017,0.00035826565,0.0017015574,0.002140461,0.004761794,0.0014181581,0.0013194839,0.0006603657],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024903291,0.000010226511,0.00020129111,0.00005862443,0.000005123078,0.000017586373,0.00012393713,0.0014925291,0.0008240182,0.9886203,0.0018544451,0.006766999],"study_design_scores_gemma":[0.000008311773,0.000017520953,0.0005308433,0.000041618237,0.000007765946,0.0001392412,0.00010753037,0.006738873,0.0008206939,0.98519915,0.006379604,0.000008842892],"about_ca_topic_score_codex":0.0003311438,"about_ca_topic_score_gemma":0.00042589655,"teacher_disagreement_score":0.00669377,"about_ca_system_score_codex":0.0011865117,"about_ca_system_score_gemma":0.0003503407,"threshold_uncertainty_score":0.022392929},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30002895,0.0015352272,0.40385836,0.0070966724,0.0004514877,0.00021705919,0.0015207195,0.0006730407,0.28461847],"genre_scores_gemma":[0.88769364,0.0006906803,0.055417985,0.0011377392,0.0006306734,0.00038939127,0.0010740042,0.0002486902,0.052717216],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981622,0.0005777687,0.00006386117,0.0006452413,0.0003675482,0.0001833126],"domain_scores_gemma":[0.99168664,0.00511575,0.0006553381,0.0011693634,0.0007571884,0.00061578176],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011437971,0.00041487973,0.0011851873,0.0015895988,0.0035001321,0.0040032277,0.0015322325,0.0013840464,0.014785818],"category_scores_gemma":[0.0071214084,0.0008582261,0.0008132465,0.001879401,0.0041317367,0.006757527,0.002681163,0.0037545147,0.0011258567],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012806319,0.000010557162,0.00008415037,0.000015592628,0.0000038075145,0.00002039078,0.00009543675,0.00027923586,0.00020662599,0.9964889,0.0011045609,0.0016779192],"study_design_scores_gemma":[0.000011974253,0.000003297366,0.000105814455,0.000004736715,0.000004439415,0.00007599509,0.000043996803,0.002152884,0.00018340588,0.9945176,0.0028915294,0.0000042875745],"about_ca_topic_score_codex":0.0009930525,"about_ca_topic_score_gemma":0.0013707889,"teacher_disagreement_score":0.014785818,"about_ca_system_score_codex":0.0012214716,"about_ca_system_score_gemma":0.0007121375,"threshold_uncertainty_score":0.04946351},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5216283,0.0015723045,0.13534291,0.0024632714,0.0007024914,0.00015041191,0.0019443227,0.00086732785,0.33532858],"genre_scores_gemma":[0.92940277,0.0004169526,0.02484512,0.0005730524,0.00023966988,0.00013865053,0.001154796,0.00013903597,0.043090053],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995376,0.0000665084,0.000021084576,0.00007605965,0.00015627353,0.00014249739],"domain_scores_gemma":[0.999453,0.00012724836,0.000063461805,0.00005879942,0.00016686077,0.00013063771],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038710173,0.000457602,0.00031863322,0.001239764,0.0014016432,0.0021709618,0.000745604,0.00040591432,0.011766543],"category_scores_gemma":[0.0007988521,0.00022391943,0.00040648205,0.00078392006,0.0013965287,0.0010914063,0.0018360742,0.001222995,0.0020626984],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006749007,0.000029489374,0.00018578445,0.000038243736,0.00000832814,0.00008797716,0.0002141899,0.00069373404,0.0028209023,0.9806199,0.0027046462,0.012529233],"study_design_scores_gemma":[0.000037305206,0.0000654673,0.0010029181,0.00004438518,0.000018632947,0.00021907155,0.00030004903,0.0056814626,0.0060726134,0.948623,0.037890285,0.000044734617],"about_ca_topic_score_codex":0.0023769916,"about_ca_topic_score_gemma":0.0024324316,"teacher_disagreement_score":0.011766543,"about_ca_system_score_codex":0.0010883558,"about_ca_system_score_gemma":0.0006681969,"threshold_uncertainty_score":0.039363027},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8096286,0.0026226575,0.12834278,0.0013248989,0.00019704814,0.000075290984,0.00045929878,0.00025845034,0.05709101],"genre_scores_gemma":[0.9552126,0.0011562873,0.03300822,0.00014686992,0.00026133948,0.00012220674,0.0003762639,0.00007091025,0.009645353],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982014,0.00037774318,0.0001423362,0.00033856113,0.00068270054,0.0002573517],"domain_scores_gemma":[0.99571437,0.002843031,0.0004177403,0.00035293744,0.00028414692,0.00038779827],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001472749,0.0007100834,0.0011508563,0.005065506,0.00226094,0.0035631775,0.0015317439,0.0011203404,0.005588722],"category_scores_gemma":[0.007798299,0.00055817736,0.0008233948,0.0036309666,0.0040403586,0.008731441,0.003449902,0.001410284,0.00058785494],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010252417,0.00003987385,0.0022404776,0.00013532197,0.000029042003,0.00027039435,0.0006023824,0.004136373,0.0023576466,0.970711,0.001179308,0.018195536],"study_design_scores_gemma":[0.000010874812,0.00002140817,0.0004713813,0.000040189432,0.000020756852,0.000467412,0.00014997061,0.008008088,0.0018646452,0.9857091,0.0032185488,0.000017692988],"about_ca_topic_score_codex":0.00047257103,"about_ca_topic_score_gemma":0.00049598585,"teacher_disagreement_score":0.005588722,"about_ca_system_score_codex":0.0013616347,"about_ca_system_score_gemma":0.0005346788,"threshold_uncertainty_score":0.01869607},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.93794703,0.00040758876,0.055263747,0.0003034864,0.000024204159,0.00004137845,0.00026644426,0.00015714082,0.005589017],"genre_scores_gemma":[0.98822427,0.00015377854,0.009751776,0.00007168294,0.000021702503,0.000055829387,0.00019908187,0.000057843157,0.0014639708],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978331,0.0007922509,0.000116588184,0.0004918668,0.00045520664,0.0003109884],"domain_scores_gemma":[0.9807773,0.009756612,0.0033354056,0.0030843944,0.0012809684,0.0017653543],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018353489,0.0004640894,0.0007666109,0.001850979,0.0012885334,0.0021816895,0.001867781,0.0011053128,0.002876925],"category_scores_gemma":[0.01647071,0.0006303305,0.0004019021,0.001524369,0.0032177258,0.0034685456,0.0015828498,0.0010855524,0.00030267372],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013020862,0.00013890064,0.022656241,0.00028414192,0.00010326975,0.0005561592,0.0011799941,0.1141121,0.023264231,0.8130116,0.0035333715,0.019857988],"study_design_scores_gemma":[0.00012169995,0.00014113268,0.009972288,0.000040400886,0.000062282386,0.0007189757,0.00046353208,0.486919,0.011238607,0.48625678,0.003977851,0.000087432934],"about_ca_topic_score_codex":0.001962725,"about_ca_topic_score_gemma":0.0018288672,"teacher_disagreement_score":0.002876925,"about_ca_system_score_codex":0.0017621676,"about_ca_system_score_gemma":0.00043342134,"threshold_uncertainty_score":0.012785494},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6719897,0.0012479912,0.27675956,0.00069452985,0.00012338626,0.00004363584,0.00019361688,0.000576345,0.0483713],"genre_scores_gemma":[0.966426,0.00041648667,0.028357388,0.00011438303,0.000068920606,0.000040526655,0.00014146595,0.000060775834,0.0043740747],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99937505,0.00013413206,0.00003912936,0.00016348541,0.00018285486,0.00010538142],"domain_scores_gemma":[0.9982292,0.00086325326,0.00030353278,0.00023688354,0.00013377707,0.00023341192],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053114403,0.0002157325,0.00040766908,0.0010696428,0.0010463698,0.0015465674,0.00059551996,0.00082950504,0.0032356526],"category_scores_gemma":[0.0026617467,0.00035532986,0.0004675551,0.00061005715,0.0025549997,0.0023868778,0.0013233557,0.000887898,0.00035585786],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025672281,0.000011859433,0.00058374234,0.00004548783,0.0000058252913,0.00014753133,0.00030154883,0.008635878,0.0025264826,0.981218,0.00050924066,0.0059888675],"study_design_scores_gemma":[0.000007825301,0.000023237995,0.00032296946,0.000019866618,0.0000054776206,0.00018472897,0.00017434233,0.028944733,0.0013728873,0.96567166,0.003263564,0.00000863446],"about_ca_topic_score_codex":0.000760833,"about_ca_topic_score_gemma":0.00080631376,"teacher_disagreement_score":0.0032356526,"about_ca_system_score_codex":0.00071982516,"about_ca_system_score_gemma":0.00025196682,"threshold_uncertainty_score":0.010824263},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.79127157,0.00097360637,0.06248151,0.039919496,0.001047003,0.000105112835,0.0015580849,0.0014931933,0.101150356],"genre_scores_gemma":[0.9792181,0.000441402,0.01042231,0.0019125124,0.0006317891,0.0000927839,0.0012224767,0.0002045306,0.005854163],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979619,0.0004719676,0.0001118034,0.0007073528,0.0004223426,0.0003246113],"domain_scores_gemma":[0.9739754,0.020529808,0.0013323962,0.002107213,0.0008733393,0.001181721],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018908413,0.0008048008,0.00136987,0.0019274994,0.0038464991,0.0044743,0.0033657504,0.004776877,0.015036937],"category_scores_gemma":[0.015949173,0.0012819293,0.0014044264,0.0030296375,0.005792843,0.009616943,0.004158439,0.0049481853,0.0010497841],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006141439,0.00018885014,0.003978979,0.0003360536,0.000054556425,0.001197296,0.0017908071,0.0057161315,0.004257438,0.9508526,0.021691574,0.00932155],"study_design_scores_gemma":[0.00018233634,0.000049684477,0.0014260116,0.00004709481,0.00004962746,0.0011774489,0.00057465216,0.021207755,0.0018053373,0.9674664,0.005976187,0.00003748043],"about_ca_topic_score_codex":0.0020481553,"about_ca_topic_score_gemma":0.0017628832,"teacher_disagreement_score":0.015036937,"about_ca_system_score_codex":0.0016471392,"about_ca_system_score_gemma":0.0006488403,"threshold_uncertainty_score":0.05030358},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48883557,0.004722089,0.26823637,0.0034534808,0.00053874723,0.00011639602,0.0015711127,0.001186773,0.23133956],"genre_scores_gemma":[0.919781,0.0018679434,0.06309582,0.0005501625,0.00017524342,0.00023759891,0.0006594691,0.00035681127,0.013275827],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989203,0.00021208679,0.00004003295,0.00022560185,0.00024984806,0.0003521454],"domain_scores_gemma":[0.99565756,0.0024570606,0.0002553761,0.0007172939,0.00035058238,0.00056202605],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011739586,0.001153754,0.0006975695,0.0019667905,0.0023887393,0.0029042761,0.0019976003,0.0008748427,0.00821698],"category_scores_gemma":[0.004556968,0.00049354497,0.0007125608,0.001371703,0.004085931,0.0042867567,0.0033104112,0.0027705873,0.0013770872],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023871995,0.000069063615,0.0014840926,0.00020026747,0.000018658482,0.00007130202,0.00033548663,0.016823292,0.0070117405,0.9528373,0.0067514647,0.014158575],"study_design_scores_gemma":[0.0000394625,0.000052123047,0.0014707493,0.000110268644,0.000026487049,0.00015894533,0.00016032721,0.07944183,0.0059707905,0.8988167,0.013670893,0.00008148135],"about_ca_topic_score_codex":0.0046756803,"about_ca_topic_score_gemma":0.009218137,"teacher_disagreement_score":0.00821698,"about_ca_system_score_codex":0.0033951988,"about_ca_system_score_gemma":0.0011152836,"threshold_uncertainty_score":0.02748853},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3979147,0.0019954783,0.41102582,0.0191952,0.0014161698,0.0004519115,0.0019075621,0.0025148753,0.16357833],"genre_scores_gemma":[0.88252085,0.00092595967,0.08361474,0.0033615658,0.00054108293,0.00040425302,0.0016854128,0.000491608,0.026454408],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9963599,0.0007105843,0.00015753615,0.0012527925,0.00080378575,0.00071542495],"domain_scores_gemma":[0.98197466,0.009522263,0.0013745667,0.004510671,0.0016147371,0.001003188],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034214733,0.0011838238,0.0017068719,0.002020473,0.0038976504,0.003501641,0.0038996357,0.0027675433,0.015915897],"category_scores_gemma":[0.03216002,0.00088925526,0.0030358473,0.0027747366,0.004103673,0.012588635,0.00499411,0.007101803,0.0020459595],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00060534605,0.00023117384,0.0041683777,0.0002616911,0.00006150058,0.00033769573,0.000995017,0.02338237,0.002644135,0.92363834,0.019363958,0.024310386],"study_design_scores_gemma":[0.0001549364,0.00006220243,0.0010897452,0.000059270147,0.000049020884,0.00021384974,0.00019934299,0.104414225,0.0015200445,0.88069385,0.011484895,0.00005869835],"about_ca_topic_score_codex":0.009112182,"about_ca_topic_score_gemma":0.008407843,"teacher_disagreement_score":0.015915897,"about_ca_system_score_codex":0.0058231005,"about_ca_system_score_gemma":0.0023925868,"threshold_uncertainty_score":0.053243995},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7941623,0.0008776564,0.14624897,0.0016335095,0.00020087311,0.000043148575,0.000341887,0.00027073696,0.056220837],"genre_scores_gemma":[0.98106486,0.00034004537,0.013753942,0.00028837266,0.00008793351,0.000032793738,0.0002914107,0.000048064856,0.004092482],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993179,0.00011656719,0.000032687884,0.00018177739,0.00018884885,0.00016229284],"domain_scores_gemma":[0.99754924,0.0010591793,0.0003738746,0.0005141781,0.00024260991,0.00026090775],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008279213,0.0003100008,0.00035585024,0.00088314683,0.00094038364,0.0014009433,0.00087223493,0.0007373485,0.0038888443],"category_scores_gemma":[0.0028550378,0.00027098792,0.000642323,0.0010168246,0.0017488085,0.003211269,0.0014555667,0.001084025,0.00031239088],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014926394,0.00006214277,0.006168996,0.00007248091,0.00003270571,0.0003995878,0.00044251137,0.016555024,0.0044067064,0.9585711,0.003108287,0.010031118],"study_design_scores_gemma":[0.00003546934,0.000035320347,0.0028660754,0.000033582495,0.00003083805,0.00034007322,0.00039590857,0.035095308,0.0029791428,0.9507346,0.007420176,0.000033419143],"about_ca_topic_score_codex":0.0019174532,"about_ca_topic_score_gemma":0.0022959197,"teacher_disagreement_score":0.0038888443,"about_ca_system_score_codex":0.00086453866,"about_ca_system_score_gemma":0.00041105694,"threshold_uncertainty_score":0.013009489},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7295953,0.012681366,0.12457909,0.006579709,0.00035492444,0.000077827746,0.00061729667,0.000602803,0.12491173],"genre_scores_gemma":[0.9778006,0.0017532734,0.014620454,0.0003892414,0.00020910791,0.00006383723,0.00013999773,0.00008838898,0.0049349912],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99882215,0.00036149673,0.00004318167,0.00032702732,0.00028512598,0.00016091131],"domain_scores_gemma":[0.9940758,0.0039858376,0.00043704614,0.0006016699,0.00034115033,0.000558458],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018481999,0.00059160317,0.00073358475,0.0025795815,0.0010068911,0.0020766181,0.0013661106,0.0010139056,0.006414759],"category_scores_gemma":[0.009189264,0.00048505157,0.00052337593,0.0012835163,0.0035908802,0.0063629886,0.002495455,0.0019386183,0.00042202184],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016759914,0.000032563785,0.001108503,0.00014418672,0.000020391522,0.000064316926,0.0002365703,0.010352892,0.0023891306,0.9723857,0.002889462,0.010208707],"study_design_scores_gemma":[0.000014772156,0.0000280982,0.00061966584,0.000052242143,0.0000140855855,0.00010471517,0.00007866774,0.030746223,0.0013034667,0.96196586,0.005055183,0.000017070612],"about_ca_topic_score_codex":0.0018263219,"about_ca_topic_score_gemma":0.0021878371,"teacher_disagreement_score":0.006414759,"about_ca_system_score_codex":0.0020052963,"about_ca_system_score_gemma":0.00050268637,"threshold_uncertainty_score":0.02145952},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.90279657,0.0014016522,0.06644301,0.0011536909,0.00004666859,0.000024998319,0.0006940664,0.00035721582,0.027082177],"genre_scores_gemma":[0.99074614,0.00038825464,0.006995549,0.00011011012,0.00004998659,0.000049569786,0.00042097727,0.00006432879,0.0011751489],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982084,0.00043554642,0.00006808201,0.00040878088,0.00048115835,0.00039809587],"domain_scores_gemma":[0.9891802,0.006449978,0.0011417583,0.0012867444,0.0010073849,0.00093391107],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001053374,0.0004929413,0.00087832025,0.002877285,0.0017744453,0.0034338196,0.0016976174,0.00096782786,0.003938893],"category_scores_gemma":[0.012849259,0.0006102048,0.0007528641,0.0019465217,0.00280601,0.0063341362,0.003910618,0.001971357,0.0003212809],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00041180686,0.000098825636,0.01981604,0.00025437868,0.00012033705,0.00044838528,0.001489774,0.03232607,0.01135043,0.91132283,0.0052199075,0.017141277],"study_design_scores_gemma":[0.00003746441,0.00007866839,0.010450303,0.00008485825,0.00007986792,0.0016832592,0.0006765122,0.20243804,0.006868369,0.7697412,0.007801288,0.000060153026],"about_ca_topic_score_codex":0.0013580589,"about_ca_topic_score_gemma":0.0009849309,"teacher_disagreement_score":0.003938893,"about_ca_system_score_codex":0.00243523,"about_ca_system_score_gemma":0.0005097667,"threshold_uncertainty_score":0.017668962},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00031154344,0.0017409126,0.0030468346,0.0031185262,0.003732047,0.00007976839,0.0014964744,0.00052381755,0.98595005],"genre_scores_gemma":[0.0013339767,0.0012200868,0.0010573734,0.0010583731,0.0007456761,0.00005415308,0.001222812,0.00020303542,0.9931045],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99934727,0.000069929665,0.000022042908,0.00013434712,0.00035178426,0.00007465487],"domain_scores_gemma":[0.99905163,0.00012775748,0.000036889927,0.00013611169,0.00044331097,0.00020427874],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0005489167,0.0008302353,0.0005709986,0.0017207502,0.0014733346,0.004809556,0.001602793,0.0016701763,0.60381854],"category_scores_gemma":[0.0023877295,0.00031212682,0.00052042597,0.0016541815,0.00069261825,0.003708838,0.0023371407,0.0019706488,0.4932863],"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.000017504075,0.000030408428,0.000084873456,0.00013139994,0.0000018146285,0.000029723173,0.00011551357,0.00009732126,0.00028068956,0.047602117,0.83592546,0.11568313],"study_design_scores_gemma":[0.0000013606463,0.0000042974025,0.000057383084,0.000046819394,7.9973927e-7,0.000022030406,0.000036163834,0.000019808362,0.000055094537,0.005038547,0.99471587,0.0000018274119],"about_ca_topic_score_codex":0.0019187023,"about_ca_topic_score_gemma":0.0030960639,"teacher_disagreement_score":0.39618146,"about_ca_system_score_codex":0.0015381163,"about_ca_system_score_gemma":0.0020745876,"threshold_uncertainty_score":0.5651047},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.83667785,0.00025600626,0.15409563,0.00072611345,0.000054000448,0.000098511795,0.00025417152,0.00036199272,0.0074757654],"genre_scores_gemma":[0.990772,0.000110453555,0.006165189,0.00010846501,0.00003142665,0.00009230377,0.00013585384,0.00004312741,0.0025411807],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990778,0.00035172733,0.000036577352,0.00020404889,0.00017217381,0.00015758627],"domain_scores_gemma":[0.99181247,0.0050792363,0.0012069249,0.0006938405,0.00058915647,0.0006183293],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017855358,0.00035777193,0.0008532672,0.0016621201,0.0006527963,0.0016174075,0.0010286224,0.0011801482,0.002936233],"category_scores_gemma":[0.009108109,0.0005344544,0.0008036458,0.0005955838,0.0020872601,0.0016850837,0.0011378938,0.0008894222,0.00032928295],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023343878,0.000056493478,0.003696641,0.0000761522,0.00006596536,0.0006806004,0.00044796636,0.0964929,0.0059235697,0.885576,0.0014719171,0.005278394],"study_design_scores_gemma":[0.00009028806,0.00006665409,0.0018165184,0.000023689356,0.000020729785,0.00014500186,0.00008675658,0.40658274,0.0016207143,0.5884701,0.0010237736,0.000052986677],"about_ca_topic_score_codex":0.0024521775,"about_ca_topic_score_gemma":0.0020623626,"teacher_disagreement_score":0.002936233,"about_ca_system_score_codex":0.0012912337,"about_ca_system_score_gemma":0.00055634096,"threshold_uncertainty_score":0.009822726},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8362709,0.000774265,0.15098894,0.00048565003,0.000040409726,0.00007043503,0.00043959846,0.0001636736,0.010766076],"genre_scores_gemma":[0.96573913,0.0003698481,0.03193467,0.00007924891,0.000034594123,0.0000955958,0.00022999042,0.000034439934,0.0014825857],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99893826,0.000310304,0.00008570657,0.00025442208,0.00023492705,0.00017627538],"domain_scores_gemma":[0.992015,0.00485885,0.0012328204,0.0005406794,0.0007166989,0.00063597783],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009049191,0.0004457998,0.0006262968,0.001975776,0.0009641195,0.0015257819,0.00075908226,0.00070867996,0.0027088572],"category_scores_gemma":[0.008175049,0.000685094,0.00047659356,0.0013718023,0.0021146857,0.0030696793,0.0015340472,0.00075086835,0.00018724528],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003338159,0.00005726209,0.004240411,0.00020076027,0.000055255532,0.0006211895,0.00078741345,0.028629981,0.010241874,0.94027364,0.0010976505,0.013460655],"study_design_scores_gemma":[0.000064964726,0.000056873625,0.0012408133,0.000058547404,0.000030395175,0.00049346284,0.00029966448,0.062443748,0.005033141,0.9267138,0.0035318185,0.00003267797],"about_ca_topic_score_codex":0.0011636385,"about_ca_topic_score_gemma":0.0013564528,"teacher_disagreement_score":0.0027088572,"about_ca_system_score_codex":0.0010324287,"about_ca_system_score_gemma":0.0006842633,"threshold_uncertainty_score":0.009061992},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9298268,0.0007292501,0.047954686,0.000545446,0.000045096775,0.0000342946,0.00010135305,0.00022410862,0.020538915],"genre_scores_gemma":[0.990195,0.00016515503,0.0069763516,0.000083378305,0.000026909443,0.000029518695,0.00009850822,0.000025188696,0.0023999603],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992712,0.00030620064,0.00003202918,0.00015246453,0.00013781157,0.00010027899],"domain_scores_gemma":[0.9970804,0.0014938228,0.00040071298,0.0003811023,0.00023332391,0.00041068945],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007308268,0.00045428754,0.00064757443,0.0011218196,0.0012347597,0.0012694437,0.00089715683,0.00078379194,0.0037862773],"category_scores_gemma":[0.0040849843,0.00039450475,0.00044964493,0.0005364302,0.002061474,0.0035150591,0.0019830454,0.0010672093,0.00035219442],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00040132596,0.00013641971,0.0025830073,0.00027039737,0.000049666123,0.00074347836,0.001225453,0.015953196,0.020116573,0.944008,0.0024181965,0.012094298],"study_design_scores_gemma":[0.000048860016,0.000084207284,0.0009144067,0.000035524594,0.000024579043,0.00063495536,0.0003214282,0.04305366,0.0044952417,0.94754946,0.0028135802,0.000024071529],"about_ca_topic_score_codex":0.00068376295,"about_ca_topic_score_gemma":0.0009961966,"teacher_disagreement_score":0.0037862773,"about_ca_system_score_codex":0.0007821375,"about_ca_system_score_gemma":0.00034717514,"threshold_uncertainty_score":0.012666345},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8772391,0.0006375115,0.09782911,0.001434433,0.000075156466,0.000061332794,0.0005426692,0.00040852337,0.02177215],"genre_scores_gemma":[0.98970383,0.0003222941,0.007102263,0.00017400048,0.000044647062,0.00007754506,0.00022132134,0.000063256266,0.0022908247],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992267,0.00016974364,0.00003066845,0.0003075839,0.00013356395,0.00013184722],"domain_scores_gemma":[0.98906684,0.0061419923,0.001509302,0.0016119607,0.0008177773,0.0008520703],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001333758,0.00034873787,0.0004578402,0.0019445932,0.0012543077,0.0018658832,0.0014215817,0.00067750184,0.0037606445],"category_scores_gemma":[0.010985523,0.0004213499,0.00033200553,0.0010829283,0.0031450507,0.0022174856,0.0010637657,0.0011399492,0.00034984326],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00054349005,0.00012186876,0.033890765,0.0003244015,0.0001115992,0.00026259315,0.0005497518,0.06162089,0.029019522,0.8279403,0.0058515677,0.03976317],"study_design_scores_gemma":[0.00010304555,0.00017450031,0.020563437,0.000104763356,0.000105057705,0.0012729774,0.00035701346,0.21372083,0.0229341,0.7295286,0.010979504,0.00015611034],"about_ca_topic_score_codex":0.0022213124,"about_ca_topic_score_gemma":0.0020217039,"teacher_disagreement_score":0.0037606445,"about_ca_system_score_codex":0.0025242392,"about_ca_system_score_gemma":0.00079355063,"threshold_uncertainty_score":0.01831472},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5187362,0.00040835893,0.4648634,0.00094240124,0.000081765844,0.00011745404,0.00012893196,0.0005067826,0.014214789],"genre_scores_gemma":[0.95070046,0.0002324568,0.04337145,0.0002209066,0.00003752757,0.00008973862,0.00008964623,0.000108016604,0.005149782],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99848866,0.0006146962,0.000039853185,0.00030376084,0.00030428765,0.00024877832],"domain_scores_gemma":[0.9916407,0.0055381632,0.0006910596,0.0011766958,0.00055516104,0.00039827282],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019252734,0.0003091664,0.0006364383,0.0011324524,0.00083847746,0.0011739815,0.0012238158,0.0009962437,0.002575401],"category_scores_gemma":[0.012943468,0.00046772242,0.00072517915,0.00054861075,0.0031917063,0.0021261557,0.0015728013,0.0012191858,0.00035660074],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025493535,0.000052720887,0.0027042418,0.0001228878,0.000053792144,0.000259313,0.00039286792,0.13075875,0.015317276,0.8343968,0.0016672583,0.014019131],"study_design_scores_gemma":[0.000045019602,0.00005285961,0.00091826014,0.000017493683,0.000018482491,0.0001679657,0.00006708438,0.520689,0.00440871,0.47132656,0.0022563052,0.000032220916],"about_ca_topic_score_codex":0.0020410002,"about_ca_topic_score_gemma":0.002012039,"teacher_disagreement_score":0.002575401,"about_ca_system_score_codex":0.0020457122,"about_ca_system_score_gemma":0.0005882257,"threshold_uncertainty_score":0.014842689},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6000707,0.0011282586,0.3562633,0.0033788595,0.00009159299,0.0002962495,0.0005487786,0.000989143,0.037233107],"genre_scores_gemma":[0.9834292,0.00025438122,0.012788969,0.00040576875,0.000046427853,0.0001608715,0.0001403098,0.00007138793,0.002702736],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99681973,0.00086090056,0.00017359774,0.00071527204,0.0007198893,0.00071061903],"domain_scores_gemma":[0.9733899,0.01833614,0.002377475,0.0018131838,0.0009924504,0.0030908417],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036845098,0.0009102737,0.0020491534,0.0021191149,0.0015565123,0.005239165,0.002721433,0.003401143,0.0067449445],"category_scores_gemma":[0.029642861,0.0008663615,0.0012135053,0.0008813937,0.0048664496,0.007624186,0.0033723293,0.004517928,0.000759372],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005525796,0.00018709748,0.0032945648,0.00026176372,0.00014088473,0.000389697,0.0008195101,0.039715864,0.010290691,0.92977166,0.0034042662,0.011171397],"study_design_scores_gemma":[0.00012437868,0.00018356681,0.00067618006,0.000045511908,0.000053791984,0.00026169722,0.00016956752,0.19487275,0.0032818208,0.79848486,0.0017749225,0.00007110368],"about_ca_topic_score_codex":0.0013942297,"about_ca_topic_score_gemma":0.00082314137,"teacher_disagreement_score":0.0067449445,"about_ca_system_score_codex":0.0025386491,"about_ca_system_score_gemma":0.0012105181,"threshold_uncertainty_score":0.022564113},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4637005,0.0021093048,0.36622652,0.0017904133,0.00041683338,0.00012034931,0.0004018676,0.00047764782,0.16475661],"genre_scores_gemma":[0.96527207,0.0005616933,0.025178378,0.00028211303,0.00019730117,0.00010463338,0.0001670677,0.00008655001,0.008150198],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988728,0.00024024198,0.00007508873,0.00030804318,0.00031783213,0.00018593129],"domain_scores_gemma":[0.99397945,0.0033097793,0.00064691214,0.0006942361,0.00052509265,0.0008445537],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016958031,0.0005124093,0.0005182074,0.0030110248,0.0018448707,0.0041074883,0.0013027732,0.00078952877,0.005178091],"category_scores_gemma":[0.0060680932,0.00045477762,0.0007990329,0.0015021239,0.004333923,0.0071125473,0.0034379505,0.0021574579,0.00059670315],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008930173,0.000005931381,0.00016388076,0.00000957926,0.0000023027198,0.000021854454,0.00010847838,0.00025019445,0.00029265988,0.9973067,0.00018934759,0.0016400246],"study_design_scores_gemma":[0.000010351974,0.000012976386,0.00019284459,0.000007717226,0.0000065054514,0.00009642372,0.00007992175,0.0029088785,0.00088341726,0.992751,0.0030415556,0.000008299455],"about_ca_topic_score_codex":0.00066396117,"about_ca_topic_score_gemma":0.00058017496,"teacher_disagreement_score":0.005178091,"about_ca_system_score_codex":0.0018087435,"about_ca_system_score_gemma":0.00046358796,"threshold_uncertainty_score":0.017322421},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5997883,0.001851855,0.37377006,0.0047181766,0.00015848965,0.00018227856,0.00064793683,0.00063127535,0.018251693],"genre_scores_gemma":[0.97181714,0.0011296246,0.018975534,0.0003826961,0.00034195755,0.00040382968,0.0004393985,0.0001836639,0.006326228],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99842215,0.0006409757,0.00006453419,0.0003419111,0.0003283721,0.00020206452],"domain_scores_gemma":[0.95111597,0.037901632,0.002701866,0.0022115961,0.0029773295,0.0030916398],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00683919,0.0007243607,0.0016402119,0.0051599853,0.0017527514,0.0034093976,0.003686285,0.0026945996,0.0066458774],"category_scores_gemma":[0.0416034,0.001075655,0.0010686788,0.0018444001,0.006897512,0.008115814,0.0028602649,0.0035116938,0.0005902993],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007809277,0.000063092724,0.0012965531,0.000103127895,0.000029148096,0.00012444724,0.00037765846,0.009810412,0.0010353385,0.9824687,0.0011546562,0.0034587134],"study_design_scores_gemma":[0.000044315202,0.000041169293,0.00078800577,0.00005503956,0.00002222099,0.00019842747,0.00016989566,0.1701136,0.0005736785,0.8272589,0.00068729836,0.000047474947],"about_ca_topic_score_codex":0.0014636653,"about_ca_topic_score_gemma":0.0010350548,"teacher_disagreement_score":0.00683919,"about_ca_system_score_codex":0.0025424988,"about_ca_system_score_gemma":0.0009584845,"threshold_uncertainty_score":0.03616953},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0031537833,0.017996255,0.028636448,0.0058185183,0.0013703832,0.000025710151,0.0003644688,0.00020539005,0.94242895],"genre_scores_gemma":[0.18818131,0.041409116,0.03746896,0.00611774,0.007428583,0.00057103066,0.0020970614,0.0012742741,0.715452],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990716,0.0002015041,0.000035681504,0.00017882058,0.00041587578,0.00009646868],"domain_scores_gemma":[0.9992244,0.000372991,0.000034527457,0.0001617667,0.00015226821,0.000053983735],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065936765,0.0013240555,0.0010625584,0.0026155557,0.0021302495,0.0047940155,0.0016377814,0.0015080299,0.04834182],"category_scores_gemma":[0.0033213731,0.0006664247,0.00082547386,0.003544226,0.0034649891,0.008590524,0.0026207704,0.0048072087,0.014454868],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000099951285,0.000023562494,0.000031007305,0.00008805732,0.000004648934,0.000018062045,0.000079839236,0.000585562,0.00014416498,0.9297338,0.040318754,0.028962491],"study_design_scores_gemma":[0.000003419426,0.0000041611015,0.00006849047,0.00008087091,0.0000059970284,0.00004217616,0.000042776897,0.0006985751,0.00015208263,0.88473576,0.11415868,0.000007058615],"about_ca_topic_score_codex":0.0014671205,"about_ca_topic_score_gemma":0.0017578381,"teacher_disagreement_score":0.04834182,"about_ca_system_score_codex":0.0033371593,"about_ca_system_score_gemma":0.001004961,"threshold_uncertainty_score":0.16171944},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008883694,0.016449308,0.045551676,0.019506449,0.0022333392,0.0000812033,0.0017994868,0.00033687567,0.9051579],"genre_scores_gemma":[0.23787543,0.035097547,0.051142287,0.0069436245,0.007218905,0.00040596796,0.006621774,0.0007232517,0.65397125],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984219,0.00034136235,0.00008839876,0.0004199137,0.00056249235,0.00016586849],"domain_scores_gemma":[0.9980678,0.0010535207,0.00011387685,0.00034272115,0.00026487315,0.0001572451],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00095975236,0.0011565544,0.0009685955,0.0019810805,0.0036267168,0.0072225058,0.0017196499,0.0020452908,0.056822844],"category_scores_gemma":[0.004222253,0.000428205,0.0011299558,0.0033972533,0.0033532158,0.009056475,0.00321528,0.0044951737,0.016693812],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011410908,0.00001719783,0.000096582145,0.00012455357,0.000010569077,0.000050638806,0.00013115807,0.00034412,0.00009123874,0.92732584,0.049828537,0.021968175],"study_design_scores_gemma":[0.00000741526,0.000004235472,0.00012496162,0.000051084797,0.000005228963,0.000177801,0.0000892931,0.0004879355,0.00009690734,0.8028158,0.19613402,0.000005383168],"about_ca_topic_score_codex":0.001399429,"about_ca_topic_score_gemma":0.0017448098,"teacher_disagreement_score":0.056822844,"about_ca_system_score_codex":0.0031113178,"about_ca_system_score_gemma":0.0018036641,"threshold_uncertainty_score":0.19009131},"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":"commentary","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00043052292,0.0014028614,0.00011674206,0.7650535,0.22116563,0.000037114867,0.00014173127,0.000083930325,0.011567952],"genre_scores_gemma":[0.0028195477,0.00093234447,0.0002708595,0.77574,0.110768154,0.00013901599,0.00010106609,0.00004758574,0.10918143],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9959954,0.00045755782,0.0002079843,0.00056426646,0.0019091347,0.0008656216],"domain_scores_gemma":[0.98829424,0.0028149677,0.00081799884,0.0004407354,0.0029435407,0.004688482],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0054328223,0.0014921401,0.0021600246,0.0013456399,0.0050353967,0.008501961,0.0023017281,0.059139233,0.05396582],"category_scores_gemma":[0.020970663,0.0009441966,0.0025321674,0.00083136064,0.0026274796,0.0039690924,0.0034149205,0.03828973,0.044229742],"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.000026101565,0.000035374636,0.00013306676,0.000026656482,0.000008297017,0.00009369017,0.000020564341,0.000016637654,0.000048500755,0.001242,0.99589926,0.0024498801],"study_design_scores_gemma":[0.00008172954,0.000050575658,0.0011237443,0.00016699893,0.000028788654,0.00012392933,0.00015338707,0.0001302329,0.00012485392,0.0019985565,0.9959875,0.000029722112],"about_ca_topic_score_codex":0.0037582442,"about_ca_topic_score_gemma":0.009825007,"teacher_disagreement_score":0.059139233,"about_ca_system_score_codex":0.003389951,"about_ca_system_score_gemma":0.0071976273,"threshold_uncertainty_score":0.18053365},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8075803,0.00089018827,0.17402895,0.00079547125,0.00007192651,0.000106587766,0.00057305396,0.00048159092,0.015471933],"genre_scores_gemma":[0.9852347,0.00030165544,0.012239127,0.00009582408,0.000047341815,0.00009008778,0.00016385964,0.00006127736,0.0017662185],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990702,0.00035919956,0.00003269303,0.00022736115,0.00016534078,0.00014521445],"domain_scores_gemma":[0.99112856,0.0049836356,0.0012187721,0.001232532,0.0007009748,0.00073554134],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015778248,0.00037262612,0.00045275,0.0018525796,0.00085285184,0.0012912515,0.0011363021,0.0005809524,0.0026093605],"category_scores_gemma":[0.010642445,0.0003433237,0.0003259317,0.00096108014,0.0022767023,0.0016686193,0.0009932063,0.00072750944,0.00020481211],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00044464975,0.00006133174,0.006421666,0.00018489381,0.000060027258,0.00020597105,0.00028361077,0.12656645,0.01602576,0.8280367,0.0035636004,0.018145327],"study_design_scores_gemma":[0.0000615431,0.00007690613,0.0041309847,0.000046283763,0.000031546173,0.00033222703,0.000097217344,0.4017112,0.004857702,0.5843278,0.004262283,0.000064398395],"about_ca_topic_score_codex":0.0022514306,"about_ca_topic_score_gemma":0.0022293578,"teacher_disagreement_score":0.0026093605,"about_ca_system_score_codex":0.0019246158,"about_ca_system_score_gemma":0.00069347525,"threshold_uncertainty_score":0.013964176},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.87842387,0.00021660587,0.112755604,0.00074924337,0.000028804092,0.000038689457,0.00015435116,0.00019902003,0.0074338256],"genre_scores_gemma":[0.99094766,0.00011349735,0.0072554434,0.00006664871,0.0000148100535,0.000035772016,0.00007922281,0.000043847984,0.0014431248],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994746,0.00018947781,0.000010812311,0.000117194126,0.00011389292,0.00009407683],"domain_scores_gemma":[0.9943112,0.003420488,0.00072102493,0.0005795439,0.00045751611,0.0005101886],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001713434,0.00025403552,0.00040486897,0.0015725371,0.0008658849,0.0009230535,0.0011088612,0.0005669708,0.0027453548],"category_scores_gemma":[0.008579071,0.00028342172,0.00031488133,0.0005504096,0.0032325261,0.001638821,0.0010061407,0.00075322366,0.00018697392],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00039315608,0.000051082938,0.0076754084,0.00008265581,0.000052537223,0.00015123542,0.00023710856,0.27337593,0.01669079,0.6904032,0.0020360143,0.008850895],"study_design_scores_gemma":[0.000046896097,0.000057252906,0.0030907786,0.000027280706,0.00001666914,0.00012332239,0.000077306424,0.7482586,0.00476426,0.24217227,0.0013217387,0.00004363662],"about_ca_topic_score_codex":0.0034549285,"about_ca_topic_score_gemma":0.0026491496,"teacher_disagreement_score":0.0034549285,"about_ca_system_score_codex":0.0024074467,"about_ca_system_score_gemma":0.0008697962,"threshold_uncertainty_score":0.01746732},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.59098524,0.009787236,0.18795566,0.0069411956,0.00060470635,0.00013408206,0.0013544223,0.0005269971,0.20171043],"genre_scores_gemma":[0.9660017,0.0024884536,0.014575904,0.00034101927,0.00039911683,0.00021577081,0.0002998511,0.000097833865,0.015580351],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99938846,0.00013679886,0.000030235446,0.00013286417,0.00021844744,0.00009307313],"domain_scores_gemma":[0.9953551,0.0030561837,0.00047079404,0.00041888707,0.0003612303,0.0003377687],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010876947,0.00038017528,0.00045885428,0.0017592333,0.00083504175,0.0028717373,0.00087407907,0.000912143,0.0073367087],"category_scores_gemma":[0.007083518,0.00045516988,0.00035515917,0.0014066055,0.002307483,0.006360734,0.0014493412,0.0013744457,0.00068083947],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000048702772,0.000015338723,0.000458993,0.000082402425,0.0000060558855,0.00002270969,0.00014515786,0.003215412,0.0015772297,0.9826999,0.0028616772,0.008866437],"study_design_scores_gemma":[0.000012635127,0.000019037088,0.0007180598,0.000038719612,0.000008541304,0.00015433172,0.000100070974,0.011509886,0.001311809,0.9802807,0.00583444,0.000011740251],"about_ca_topic_score_codex":0.0003182173,"about_ca_topic_score_gemma":0.00041334683,"teacher_disagreement_score":0.0073367087,"about_ca_system_score_codex":0.0012451955,"about_ca_system_score_gemma":0.00046202407,"threshold_uncertainty_score":0.024543703},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.62269336,0.0009687875,0.266997,0.002047429,0.00033869306,0.00012779358,0.0005545478,0.00042213508,0.105850264],"genre_scores_gemma":[0.962935,0.00033235777,0.028134767,0.0003232552,0.00018807268,0.00009445027,0.0002818076,0.0000763845,0.0076339287],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996333,0.00006676039,0.000018867178,0.000119056866,0.000095901916,0.00006607209],"domain_scores_gemma":[0.9991167,0.00024861144,0.00017923143,0.0001799748,0.00008640978,0.00018907066],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036019113,0.00024792354,0.00028178707,0.0010338874,0.0009419071,0.0016612104,0.0005088169,0.00058074313,0.0024013116],"category_scores_gemma":[0.0008762234,0.00013719573,0.00048235478,0.00048190737,0.002467457,0.002506516,0.0009466814,0.0010230795,0.00019040369],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020429039,0.000021852502,0.00070981093,0.000017675846,0.000004256253,0.0000965882,0.00015315162,0.0015653849,0.001795362,0.9879787,0.00088238425,0.006754348],"study_design_scores_gemma":[0.000010811806,0.000020989977,0.0011434576,0.000021232052,0.000006869112,0.00034481304,0.00016669848,0.018824076,0.0012155761,0.9625107,0.015716892,0.000017909422],"about_ca_topic_score_codex":0.001179679,"about_ca_topic_score_gemma":0.0009955538,"teacher_disagreement_score":0.0024013116,"about_ca_system_score_codex":0.0011729521,"about_ca_system_score_gemma":0.00042067067,"threshold_uncertainty_score":0.008510351},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42181784,0.008005936,0.2995629,0.011588758,0.0012217779,0.00020896464,0.0013410328,0.0015637175,0.2546891],"genre_scores_gemma":[0.94501096,0.0017502987,0.03831734,0.0013840768,0.0008968608,0.000185735,0.00067178684,0.0007024951,0.011080458],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99772996,0.00058896636,0.000059396138,0.0005916229,0.00060106226,0.00042903825],"domain_scores_gemma":[0.98791784,0.00722468,0.00069104676,0.0019318716,0.00096366176,0.0012708725],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024220357,0.0011336651,0.0019443829,0.0033832109,0.0021471893,0.0030403042,0.0033705425,0.0014452471,0.012945503],"category_scores_gemma":[0.012929725,0.00074428035,0.0011889231,0.0022827662,0.0037263667,0.008536998,0.0031575495,0.005470074,0.0018123336],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025719142,0.00015061635,0.0016268847,0.00022860682,0.00005297013,0.00031402102,0.00024966933,0.013849424,0.0040739877,0.9396361,0.022073815,0.017486624],"study_design_scores_gemma":[0.00003965141,0.000065762564,0.0013469714,0.00008405418,0.000041639454,0.00042048426,0.00007831993,0.11882388,0.0038572152,0.86020416,0.014986281,0.000051497165],"about_ca_topic_score_codex":0.0013426315,"about_ca_topic_score_gemma":0.0010345845,"teacher_disagreement_score":0.012945503,"about_ca_system_score_codex":0.003549919,"about_ca_system_score_gemma":0.0009954339,"threshold_uncertainty_score":0.043307006},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.59733695,0.011874659,0.25525728,0.0040839235,0.0013034362,0.00011439313,0.0010518965,0.0006270837,0.1283503],"genre_scores_gemma":[0.934809,0.0016612731,0.056875985,0.00073168654,0.000525331,0.000073102005,0.00029706632,0.00013714602,0.004889491],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990683,0.00022392334,0.0000411872,0.00026699807,0.00025993702,0.00013953637],"domain_scores_gemma":[0.9963403,0.0020076903,0.0004508375,0.00045507037,0.00039266876,0.00035349742],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007244073,0.0005210057,0.00046630035,0.002224048,0.0008176792,0.0016437115,0.0007824301,0.0006193701,0.0032209344],"category_scores_gemma":[0.004149803,0.00036161454,0.00030636718,0.0022783882,0.0017055357,0.0021306502,0.0009094974,0.0018889839,0.00037990592],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002618568,0.00004314846,0.0032034223,0.00020078848,0.000020853933,0.00023671551,0.00040919168,0.012076366,0.010073115,0.9150347,0.008499143,0.049940724],"study_design_scores_gemma":[0.000046521385,0.00017816674,0.004820162,0.00008890085,0.000032191863,0.00096281315,0.00024523758,0.0489686,0.005293279,0.89287984,0.04642621,0.000057983998],"about_ca_topic_score_codex":0.0024386367,"about_ca_topic_score_gemma":0.002131662,"teacher_disagreement_score":0.0032209344,"about_ca_system_score_codex":0.0012145675,"about_ca_system_score_gemma":0.00040821082,"threshold_uncertainty_score":0.010775149},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.73686695,0.0006267789,0.17775358,0.0007880358,0.00013851795,0.000092609975,0.0006193987,0.0011923664,0.08192174],"genre_scores_gemma":[0.9582159,0.000324914,0.03217739,0.0002378465,0.00008396764,0.000055828405,0.00093274657,0.00018522197,0.007786238],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99934953,0.000119394594,0.000023633896,0.000169038,0.00015519686,0.00018326516],"domain_scores_gemma":[0.9972134,0.0012987811,0.00041301147,0.00048645757,0.00030208007,0.00028630657],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039458578,0.0006086569,0.00032950874,0.0009553945,0.0010943167,0.0013928986,0.0006448943,0.0003906798,0.004470986],"category_scores_gemma":[0.002360824,0.00033076108,0.00050349155,0.00090563507,0.0011768719,0.0010652128,0.001013825,0.0010205329,0.00059261644],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003810622,0.00013541114,0.0075412667,0.00029820396,0.000059041093,0.00057822186,0.0006798298,0.06457923,0.03802225,0.8112611,0.012955534,0.06350883],"study_design_scores_gemma":[0.00006063582,0.00017471585,0.005413743,0.000059587393,0.00007500273,0.0013791879,0.00033070552,0.1855592,0.024507966,0.75297815,0.029396564,0.00006456004],"about_ca_topic_score_codex":0.004037217,"about_ca_topic_score_gemma":0.005054849,"teacher_disagreement_score":0.004470986,"about_ca_system_score_codex":0.0014846376,"about_ca_system_score_gemma":0.00089251436,"threshold_uncertainty_score":0.014956892},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.83046645,0.000565601,0.15412493,0.00084440585,0.000048773498,0.00011514905,0.00028183553,0.0004685032,0.013084365],"genre_scores_gemma":[0.98961115,0.00014455455,0.008515707,0.00012637257,0.000039403443,0.00005702195,0.00017723072,0.00004659836,0.0012820339],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986532,0.0005208277,0.00005724782,0.00025900936,0.00033349506,0.00017624894],"domain_scores_gemma":[0.9899767,0.0054856064,0.0017609522,0.001396776,0.0007162651,0.0006638188],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012752139,0.00030325257,0.00062263303,0.0015010337,0.00076595554,0.0011181612,0.0007860003,0.00061356457,0.002195538],"category_scores_gemma":[0.011923226,0.00045015698,0.0005822345,0.00062361767,0.0016428228,0.0018624584,0.0015111702,0.0008047681,0.00028648402],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006924726,0.00013939278,0.014527563,0.00035312213,0.00014210072,0.001032385,0.0011381917,0.08038769,0.015350385,0.8438443,0.005973579,0.03641885],"study_design_scores_gemma":[0.000089895184,0.0001401174,0.0032898618,0.000051946427,0.00005171821,0.0010525123,0.00020520577,0.31545073,0.006361345,0.66847014,0.004807665,0.000028893302],"about_ca_topic_score_codex":0.0008659038,"about_ca_topic_score_gemma":0.00074109196,"teacher_disagreement_score":0.002195538,"about_ca_system_score_codex":0.000882955,"about_ca_system_score_gemma":0.0003850987,"threshold_uncertainty_score":0.0073447824},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007165515,0.0018181927,0.06397863,0.0023814326,0.0034334024,0.00024621937,0.005904488,0.0136771975,0.9013949],"genre_scores_gemma":[0.086215004,0.002867672,0.06901661,0.0017369143,0.00045657516,0.00046512982,0.009620905,0.0064273644,0.82319367],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997614,0.00003005855,0.000015382802,0.00006022036,0.000068059424,0.00006488024],"domain_scores_gemma":[0.99956137,0.000064265914,0.00002671506,0.00011458331,0.00012471277,0.000108309454],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00020003904,0.0007717362,0.0007938486,0.0009444301,0.0016152913,0.0034332632,0.0010418553,0.00095191196,0.42634606],"category_scores_gemma":[0.0013740034,0.00043705603,0.00080191734,0.0012048561,0.00059242814,0.004161329,0.002666006,0.00146979,0.17893784],"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.00038315542,0.000087208435,0.00052235264,0.00035778308,0.000024318206,0.0002019768,0.00017258659,0.0008934313,0.002321832,0.18773074,0.5613647,0.24593984],"study_design_scores_gemma":[0.00002427035,0.000035134108,0.00024278165,0.00008711131,0.000011810479,0.0001850058,0.00011432823,0.00083877373,0.000974013,0.039689686,0.9577824,0.000014759369],"about_ca_topic_score_codex":0.0015813863,"about_ca_topic_score_gemma":0.002892876,"teacher_disagreement_score":0.42634606,"about_ca_system_score_codex":0.0008432126,"about_ca_system_score_gemma":0.00079081114,"threshold_uncertainty_score":0.8182477},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.055345215,0.11460552,0.031846844,0.036857903,0.011325576,0.00012115538,0.0014188043,0.00087536004,0.74760365],"genre_scores_gemma":[0.44257653,0.08425693,0.049891967,0.005033755,0.00737254,0.00020132963,0.0027300143,0.0006897201,0.40724728],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99846786,0.00035505558,0.00011788083,0.00031674517,0.00065173185,0.0000906952],"domain_scores_gemma":[0.996336,0.0010259023,0.00027815942,0.0008381899,0.0011107516,0.0004109915],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.001738108,0.00054910406,0.0008552998,0.0017830678,0.0021597163,0.006115977,0.0007659869,0.00083140814,0.055478655],"category_scores_gemma":[0.009024053,0.00034534556,0.0006460198,0.0020552727,0.0021250166,0.0041659474,0.0021021992,0.001618049,0.015451174],"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.00021173323,0.00014489646,0.0060692746,0.0006462582,0.00007497655,0.00019093219,0.00083411584,0.0011678259,0.0015178786,0.5550852,0.17609371,0.2579632],"study_design_scores_gemma":[0.000034498255,0.000074746196,0.0039462345,0.0002963131,0.0000630457,0.0006081522,0.0005837489,0.0015227144,0.0007969872,0.2440929,0.7479584,0.00002230087],"about_ca_topic_score_codex":0.0019961274,"about_ca_topic_score_gemma":0.0031608036,"teacher_disagreement_score":0.94452137,"about_ca_system_score_codex":0.002392077,"about_ca_system_score_gemma":0.0025294928,"threshold_uncertainty_score":0.18559462},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.92632526,0.00036668993,0.052077003,0.00037952405,0.00003948338,0.000040544168,0.00022056152,0.00018626427,0.020364601],"genre_scores_gemma":[0.9924084,0.00009613532,0.00527015,0.000049955986,0.00002496274,0.000026966816,0.00010130071,0.000024471654,0.0019975535],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993463,0.00013948603,0.000037497215,0.00015905758,0.00020372549,0.000113906],"domain_scores_gemma":[0.99555016,0.0021259433,0.00056785805,0.0005629057,0.00047550845,0.0007175873],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007136872,0.0002701014,0.0005184979,0.0008237063,0.0008598022,0.0014180723,0.000750033,0.00053235993,0.0070091034],"category_scores_gemma":[0.0051817424,0.00040525358,0.0003534238,0.00056890957,0.001482656,0.0028851826,0.0018595719,0.0009153586,0.00046407167],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035858745,0.000100392535,0.0045898687,0.0003140792,0.000047581943,0.0005821931,0.0007085887,0.015552037,0.019681275,0.9411143,0.0031526412,0.013798455],"study_design_scores_gemma":[0.00005557115,0.0002702175,0.0021284183,0.00003173105,0.000042216074,0.0010476916,0.00020476842,0.08961102,0.0087277545,0.893948,0.0039066207,0.000025973568],"about_ca_topic_score_codex":0.0002640467,"about_ca_topic_score_gemma":0.00032412424,"teacher_disagreement_score":0.0070091034,"about_ca_system_score_codex":0.00061350694,"about_ca_system_score_gemma":0.00030177474,"threshold_uncertainty_score":0.023447752},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4415412,0.0023779252,0.31595707,0.026055476,0.0021838585,0.000085949,0.00083249353,0.0011216119,0.20984434],"genre_scores_gemma":[0.96164644,0.0004590633,0.027463734,0.0014125508,0.0006670044,0.00006793927,0.0002206009,0.00007603454,0.007986775],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99935097,0.00015276838,0.0000276908,0.00017369997,0.00020057579,0.00009432302],"domain_scores_gemma":[0.9948027,0.0034014832,0.00033242092,0.0006743883,0.0005313814,0.00025765123],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016404557,0.00034886258,0.00047779395,0.0010337721,0.0011895932,0.0012486546,0.00087156374,0.0010874843,0.011873808],"category_scores_gemma":[0.009373492,0.00026308652,0.00058975373,0.0007187558,0.0034074571,0.0042268764,0.0027810626,0.0029825382,0.0005100009],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000325048,0.000018426717,0.00030908178,0.000038746934,0.0000045007855,0.00007549661,0.00014017726,0.0011268584,0.0006922314,0.9910659,0.003391417,0.0031046406],"study_design_scores_gemma":[0.000019331683,0.00001635906,0.00033229074,0.000022158938,0.0000038647217,0.00014233892,0.000063317995,0.010197604,0.0007932092,0.98060995,0.007789814,0.000009782068],"about_ca_topic_score_codex":0.0008815373,"about_ca_topic_score_gemma":0.00061847694,"teacher_disagreement_score":0.011873808,"about_ca_system_score_codex":0.0012497052,"about_ca_system_score_gemma":0.0005507379,"threshold_uncertainty_score":0.039721847},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0121872015,0.03301122,0.005019147,0.0073122545,0.0021141684,0.00009523576,0.0066705407,0.0020658537,0.9315243],"genre_scores_gemma":[0.03865149,0.022463502,0.007343677,0.0007029524,0.00032811944,0.00010625399,0.006056775,0.0016117785,0.9227354],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99776745,0.0001922196,0.00011752693,0.0009648445,0.0006247951,0.00033313793],"domain_scores_gemma":[0.99792635,0.0006511486,0.00023611283,0.00033583242,0.0004541958,0.0003962749],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.000998725,0.0023256748,0.0013723994,0.0030507646,0.002582907,0.009385298,0.0023332604,0.0029874668,0.42470807],"category_scores_gemma":[0.0026874535,0.0009960714,0.0010116493,0.00271756,0.0016607273,0.0036046803,0.005667828,0.0022037672,0.41431877],"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.001104651,0.00048670353,0.004676504,0.0018689655,0.00012914845,0.0024398477,0.00075831363,0.0037524104,0.008479878,0.09548649,0.2925286,0.5882886],"study_design_scores_gemma":[0.00003395305,0.000053649772,0.0016170937,0.00050970755,0.000017235981,0.0006308988,0.0002625434,0.0005865663,0.0014114109,0.009999568,0.9848526,0.00002479412],"about_ca_topic_score_codex":0.005243098,"about_ca_topic_score_gemma":0.005746941,"teacher_disagreement_score":0.57529193,"about_ca_system_score_codex":0.002880896,"about_ca_system_score_gemma":0.0034137508,"threshold_uncertainty_score":0.8205841},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0029255361,0.009963727,0.014799309,0.015026711,0.0075361575,0.00081843697,0.085698076,0.004937094,0.8582949],"genre_scores_gemma":[0.024585176,0.01126451,0.013849673,0.013665493,0.0027629638,0.0015675792,0.10891925,0.003729018,0.81965643],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99769056,0.00039733687,0.00019154804,0.0007174135,0.0006481903,0.00035496496],"domain_scores_gemma":[0.99733317,0.0005281492,0.00016342063,0.0004704425,0.0010434208,0.0004613807],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0020650015,0.0016709389,0.0014693548,0.0026113843,0.0030429284,0.0073255175,0.004462464,0.0031950409,0.58540976],"category_scores_gemma":[0.008205933,0.0006696032,0.001243364,0.0039735925,0.0012119971,0.0056850635,0.004208464,0.0028778706,0.4396297],"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.00016886547,0.0000919206,0.00070147164,0.00063189695,0.000015736383,0.0001541293,0.00033107167,0.0002186545,0.00027140407,0.05097248,0.87067384,0.07576866],"study_design_scores_gemma":[0.000010093854,0.00001393373,0.00032107843,0.00016026746,0.0000048755137,0.000069213165,0.00009336362,0.000054364853,0.000096510834,0.005929252,0.9932387,0.000008248017],"about_ca_topic_score_codex":0.011669492,"about_ca_topic_score_gemma":0.008014041,"teacher_disagreement_score":0.41459024,"about_ca_system_score_codex":0.0038375934,"about_ca_system_score_gemma":0.0043338984,"threshold_uncertainty_score":0},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.82458735,0.00066312595,0.13736388,0.00070015417,0.000060044313,0.000056146702,0.00024786108,0.00011085868,0.036210533],"genre_scores_gemma":[0.98587835,0.0003333507,0.010267827,0.000044339984,0.00008072274,0.000059886017,0.00014141985,0.00004358725,0.00315056],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976507,0.0007448838,0.00015818283,0.00043701744,0.0007375805,0.00027162305],"domain_scores_gemma":[0.986272,0.008285183,0.0017867456,0.0011193737,0.0013298985,0.0012069157],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024253284,0.00052684004,0.00093061925,0.003100886,0.0017409845,0.0039070104,0.0010719881,0.0007561233,0.0053293738],"category_scores_gemma":[0.012602607,0.00077628816,0.00090704695,0.00204186,0.006784728,0.008790955,0.0036611003,0.0016145748,0.0004792968],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000058287198,0.000017389422,0.00094311865,0.000046575802,0.000022365608,0.00014303488,0.000578762,0.0019549509,0.0010976621,0.9917532,0.00020913279,0.0031754717],"study_design_scores_gemma":[0.000009644057,0.000019313138,0.00035389088,0.000017849728,0.000010818934,0.00020548624,0.0002071698,0.004675583,0.00071028806,0.9928947,0.00088433333,0.000010989244],"about_ca_topic_score_codex":0.00050128915,"about_ca_topic_score_gemma":0.00037646573,"teacher_disagreement_score":0.0053293738,"about_ca_system_score_codex":0.00081031857,"about_ca_system_score_gemma":0.00037076513,"threshold_uncertainty_score":0.017828524},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94154686,0.00017361117,0.047452487,0.00020346914,0.000011727525,0.00003061977,0.00040915658,0.00022448257,0.009947727],"genre_scores_gemma":[0.98363,0.000093030554,0.014411287,0.00004050406,0.00001814981,0.0000715769,0.0003957167,0.000048980524,0.0012907529],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99953353,0.00013592992,0.0000221389,0.00010915694,0.0001045132,0.00009471562],"domain_scores_gemma":[0.99596953,0.0021381902,0.00078648893,0.00037770785,0.00034780405,0.00038035854],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057598256,0.00026214533,0.00029488347,0.0017850387,0.00075092306,0.0011212534,0.00073665986,0.00040308596,0.0031352337],"category_scores_gemma":[0.00525533,0.0006246658,0.00039565307,0.0009795103,0.0014513342,0.0014657883,0.0007269217,0.0004195289,0.0001661254],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00043759053,0.00015341489,0.030244065,0.00023502213,0.000060622886,0.00048131176,0.0012892351,0.14687496,0.024656372,0.76639205,0.0033308552,0.025844548],"study_design_scores_gemma":[0.000066623514,0.00009924735,0.02036236,0.000049668586,0.000029050416,0.00073962123,0.00062256755,0.4600218,0.013457832,0.5012173,0.0032797793,0.00005415172],"about_ca_topic_score_codex":0.0018234781,"about_ca_topic_score_gemma":0.0020946835,"teacher_disagreement_score":0.0031352337,"about_ca_system_score_codex":0.0014413759,"about_ca_system_score_gemma":0.0004349648,"threshold_uncertainty_score":0.010488391},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25363436,0.010544539,0.41465625,0.023690255,0.003555983,0.0007374748,0.003402751,0.0031720228,0.28660634],"genre_scores_gemma":[0.87816805,0.0039929193,0.0865093,0.0038889295,0.0022772197,0.00059956964,0.003051942,0.0007772672,0.020734796],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9925903,0.00121638,0.000296114,0.0020477981,0.0018886225,0.001960713],"domain_scores_gemma":[0.96744263,0.018977776,0.001711122,0.0065617315,0.0032524278,0.0020542073],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0056058057,0.0025525216,0.002924081,0.003254542,0.0039592036,0.0047223996,0.006920679,0.0027891425,0.024892054],"category_scores_gemma":[0.038307775,0.0013050291,0.003941307,0.004090532,0.0046666684,0.020643886,0.008318728,0.010710862,0.0047390135],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002250862,0.0007207087,0.009624,0.0008485786,0.00028941096,0.000761544,0.0013600851,0.085528366,0.009694112,0.7061627,0.07773172,0.105027996],"study_design_scores_gemma":[0.0002702763,0.00021212896,0.002056549,0.00017111427,0.00022966617,0.0003976409,0.00036506323,0.21808743,0.0042035556,0.7537539,0.020098021,0.0001546384],"about_ca_topic_score_codex":0.01161889,"about_ca_topic_score_gemma":0.011303555,"teacher_disagreement_score":0.024892054,"about_ca_system_score_codex":0.005891985,"about_ca_system_score_gemma":0.0024936385,"threshold_uncertainty_score":0.08327222},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6872551,0.0008394506,0.25990692,0.007939357,0.0001796307,0.00065320823,0.002062048,0.00091310183,0.040251248],"genre_scores_gemma":[0.933204,0.00033266647,0.056166124,0.00039884873,0.0001045036,0.00036935828,0.0013570106,0.00016499107,0.007902497],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9932249,0.0022933183,0.00043568062,0.001410569,0.0012722227,0.0013632332],"domain_scores_gemma":[0.9712435,0.023817617,0.0012370629,0.0015476843,0.0006610586,0.0014931008],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002689241,0.0014264603,0.0018861252,0.0011885783,0.0020417327,0.006780809,0.0035676484,0.003325625,0.00919929],"category_scores_gemma":[0.018614553,0.00096355326,0.0020060225,0.0016611321,0.004434104,0.010623262,0.0051171095,0.004321408,0.0005867805],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012199914,0.00071669417,0.0052246726,0.00070426275,0.00029738713,0.0007926029,0.0019516662,0.22929037,0.004419395,0.70933586,0.007926543,0.03812059],"study_design_scores_gemma":[0.00025065197,0.000077274264,0.0005360532,0.000032940556,0.000050433886,0.0001717992,0.00022483022,0.28201792,0.0010521469,0.71350574,0.0020423115,0.000037770245],"about_ca_topic_score_codex":0.0060705096,"about_ca_topic_score_gemma":0.0038495716,"teacher_disagreement_score":0.00919929,"about_ca_system_score_codex":0.0050421623,"about_ca_system_score_gemma":0.0025464382,"threshold_uncertainty_score":0.036583662},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.88266283,0.00044177857,0.10613587,0.0007324925,0.000078997866,0.000046689845,0.00069492636,0.00043140486,0.008774934],"genre_scores_gemma":[0.9764614,0.00018096589,0.018476387,0.00025435167,0.000071532624,0.000084561616,0.0013885441,0.00018097814,0.0029012477],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99872905,0.0004710439,0.000048918748,0.0003504474,0.00022992471,0.00017066344],"domain_scores_gemma":[0.9911067,0.005026318,0.00091267313,0.0010650282,0.00092931656,0.00095991185],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017412747,0.0005572782,0.00090633123,0.0029193815,0.001141589,0.0022044259,0.0018295358,0.0017627683,0.004198367],"category_scores_gemma":[0.017198442,0.0005535263,0.0006122345,0.0013375641,0.002833854,0.004848239,0.0023071272,0.001848866,0.00036606885],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005365688,0.00009813744,0.006331826,0.00016834446,0.000054677264,0.00030689206,0.0007741707,0.046935994,0.01043042,0.92271125,0.0019496942,0.009702056],"study_design_scores_gemma":[0.00007223094,0.00014501796,0.003479525,0.00006510392,0.000028100063,0.0003133819,0.0005427803,0.20170088,0.0045096474,0.7860496,0.0030336787,0.000060100327],"about_ca_topic_score_codex":0.0017058946,"about_ca_topic_score_gemma":0.0021602795,"teacher_disagreement_score":0.004198367,"about_ca_system_score_codex":0.001364551,"about_ca_system_score_gemma":0.000585423,"threshold_uncertainty_score":0.0140449405},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.83936745,0.0007166775,0.14136116,0.0018284412,0.00019888362,0.00011648993,0.00061379146,0.00085336267,0.014943683],"genre_scores_gemma":[0.9774564,0.00020711799,0.015615722,0.00051443593,0.00009059686,0.00009964601,0.00049690634,0.00012830076,0.0053907256],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974607,0.0010649856,0.00008774514,0.00068840594,0.00033090517,0.00036713353],"domain_scores_gemma":[0.98044133,0.011436869,0.0020409464,0.0029087227,0.0010935229,0.0020786612],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035901333,0.0009481812,0.0016561814,0.0016096375,0.0012468541,0.0021261172,0.0019751575,0.0016761897,0.007996841],"category_scores_gemma":[0.024064155,0.0017508843,0.001117501,0.0006325271,0.0033287783,0.0043346537,0.003133736,0.002363298,0.0014808931],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015725469,0.00020136412,0.00811109,0.00046157982,0.00025474018,0.0010618245,0.0009733606,0.060059145,0.010730231,0.8836611,0.013073407,0.01983949],"study_design_scores_gemma":[0.00021771004,0.00033242168,0.0030705084,0.00014647633,0.00010729179,0.00060164556,0.0003727618,0.27648354,0.004486647,0.71126336,0.0028112058,0.00010645694],"about_ca_topic_score_codex":0.0017305797,"about_ca_topic_score_gemma":0.0017495321,"teacher_disagreement_score":0.007996841,"about_ca_system_score_codex":0.001229913,"about_ca_system_score_gemma":0.00063484383,"threshold_uncertainty_score":0.026752055},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.77840763,0.0013764194,0.09082688,0.0039720177,0.00017946218,0.000086437314,0.0012114304,0.0016067047,0.12233302],"genre_scores_gemma":[0.9686835,0.0004363981,0.013935265,0.00065736735,0.00010027263,0.00009786896,0.00063596055,0.00015532068,0.015298138],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99912745,0.00018080196,0.000027346365,0.00028658268,0.00014874434,0.00022904825],"domain_scores_gemma":[0.9949662,0.0024332772,0.00044534585,0.00079125346,0.0006654589,0.00069836865],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001030464,0.0005678837,0.0008580381,0.0013901865,0.0024503397,0.0030893043,0.00071822177,0.000926571,0.0062649515],"category_scores_gemma":[0.004058678,0.000674852,0.0007893867,0.0012155175,0.003675272,0.003869253,0.0016628505,0.001215539,0.00079881743],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001704002,0.00003446677,0.0021366442,0.0002252829,0.0000642686,0.00035134537,0.00078380725,0.0075715072,0.0047121863,0.96803033,0.007306326,0.008613411],"study_design_scores_gemma":[0.00003248777,0.000058284342,0.0021363713,0.000036569887,0.000037939946,0.00065827405,0.00038254,0.014398341,0.0023587078,0.96442056,0.015448875,0.00003107007],"about_ca_topic_score_codex":0.0019920792,"about_ca_topic_score_gemma":0.003376529,"teacher_disagreement_score":0.0062649515,"about_ca_system_score_codex":0.001957808,"about_ca_system_score_gemma":0.00055723253,"threshold_uncertainty_score":0.020958364},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8570437,0.00089646794,0.11870891,0.0016565312,0.00008524526,0.00003962957,0.0014150304,0.00025886076,0.019895675],"genre_scores_gemma":[0.97492224,0.0005935448,0.02074227,0.00015945252,0.00013665493,0.00011021994,0.0011245549,0.00014478386,0.002066237],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9969632,0.0008464598,0.00019900363,0.0006173655,0.00086104753,0.00051295897],"domain_scores_gemma":[0.96983284,0.02396579,0.0021311,0.002082712,0.00086625014,0.001121244],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031280986,0.0007571768,0.0014061863,0.0024910837,0.0017432584,0.0041038757,0.0025210585,0.0010527817,0.0031984276],"category_scores_gemma":[0.02036949,0.0007291402,0.001076456,0.002031482,0.0027789513,0.0069697374,0.003314752,0.001902541,0.00038169217],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012448606,0.00012759534,0.030378105,0.00041632503,0.00015946088,0.00060564047,0.0014320376,0.11344086,0.013834911,0.81240565,0.0048566777,0.021097824],"study_design_scores_gemma":[0.000091814174,0.00012914011,0.009430998,0.00012357776,0.00009046265,0.0014149228,0.00076108536,0.40195602,0.011509104,0.5686115,0.0057650725,0.00011635047],"about_ca_topic_score_codex":0.0011196192,"about_ca_topic_score_gemma":0.00087441015,"teacher_disagreement_score":0.0041038757,"about_ca_system_score_codex":0.0015792451,"about_ca_system_score_gemma":0.00052657194,"threshold_uncertainty_score":0.01654315},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.68998873,0.0021329746,0.061983604,0.039557442,0.0007826115,0.00016642186,0.0016331124,0.001547057,0.20220801],"genre_scores_gemma":[0.97191745,0.00081482314,0.0138044795,0.0034225145,0.00046599112,0.00019119805,0.0007359885,0.000112665904,0.008534791],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99814224,0.00042681742,0.000091734524,0.00048538766,0.0004931386,0.0003607659],"domain_scores_gemma":[0.9913066,0.00607916,0.0006393035,0.0007898821,0.0005924226,0.00059258874],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012582833,0.00068144384,0.0009676979,0.0022708466,0.0028530227,0.0030280494,0.002089839,0.003324252,0.009998077],"category_scores_gemma":[0.01394437,0.00067632966,0.0009235211,0.0024397436,0.004695051,0.0056205643,0.004496322,0.0035528939,0.001066162],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034335066,0.00006804788,0.0021038968,0.00015971872,0.00004204039,0.0004934049,0.0005691076,0.0059855557,0.0011556909,0.9530333,0.021422347,0.014623547],"study_design_scores_gemma":[0.00020370288,0.0000866426,0.0015164745,0.00008114316,0.00008286281,0.0012464535,0.00041695256,0.02658274,0.002582437,0.94201016,0.025102222,0.000088135865],"about_ca_topic_score_codex":0.0017360664,"about_ca_topic_score_gemma":0.0014218708,"teacher_disagreement_score":0.009998077,"about_ca_system_score_codex":0.0013972503,"about_ca_system_score_gemma":0.0007401066,"threshold_uncertainty_score":0.033446908},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7657896,0.0024147283,0.20020288,0.0017237553,0.000113853595,0.00004970643,0.0004351865,0.0006913843,0.028578911],"genre_scores_gemma":[0.9839684,0.0005407285,0.013528364,0.00023645333,0.00010332344,0.000032944034,0.00015719779,0.00007959182,0.0013530144],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99881387,0.0001974745,0.000060037364,0.0004100474,0.0002102496,0.00030834446],"domain_scores_gemma":[0.9904265,0.006074713,0.0008799617,0.00089960475,0.0006268815,0.0010924825],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017842377,0.00063823117,0.0017374975,0.0018054148,0.0018835984,0.0029184823,0.0014896068,0.0011633697,0.0047562514],"category_scores_gemma":[0.012553624,0.0009290844,0.0007533212,0.0019227802,0.0023505646,0.006533292,0.003340458,0.0018501125,0.0005007185],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005114675,0.0002129978,0.011039937,0.000671505,0.00015928382,0.0011463834,0.0022228707,0.038940296,0.02339871,0.88618475,0.0063928477,0.029118901],"study_design_scores_gemma":[0.00006458046,0.00014872635,0.003644955,0.00011607113,0.00015476055,0.001407712,0.0007986294,0.08778218,0.0074906535,0.89161944,0.006724316,0.000047999813],"about_ca_topic_score_codex":0.0011237657,"about_ca_topic_score_gemma":0.0010917297,"teacher_disagreement_score":0.0047562514,"about_ca_system_score_codex":0.0010736668,"about_ca_system_score_gemma":0.00041733528,"threshold_uncertainty_score":0.015911222},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8995505,0.0010405021,0.045620486,0.0017890078,0.00008235841,0.000077230055,0.00096762663,0.00023811276,0.050634116],"genre_scores_gemma":[0.9755628,0.00074371666,0.010442156,0.00023975172,0.0002227899,0.00015863904,0.0009170998,0.000091595466,0.0116214715],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987925,0.0003420221,0.000040586237,0.00025500433,0.0003322219,0.00023756962],"domain_scores_gemma":[0.9822167,0.014570631,0.0009395317,0.00046917866,0.00051920564,0.0012847884],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010641742,0.0006379772,0.0012241388,0.0031104335,0.0026199354,0.0038300683,0.0013833981,0.001543204,0.0076450673],"category_scores_gemma":[0.007725618,0.0011368147,0.00078662107,0.002939651,0.00214476,0.0039667967,0.0019288202,0.0020031636,0.00055448065],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007686539,0.000285851,0.0053116973,0.00045803358,0.00011712064,0.00088349346,0.0015927638,0.025887575,0.008106125,0.9251286,0.008965293,0.022494858],"study_design_scores_gemma":[0.00010416936,0.000069945076,0.004871718,0.00006892651,0.00007244989,0.0006433575,0.00035834423,0.0634268,0.002393663,0.92360985,0.004350417,0.000030470545],"about_ca_topic_score_codex":0.0016882311,"about_ca_topic_score_gemma":0.0020417967,"teacher_disagreement_score":0.0076450673,"about_ca_system_score_codex":0.0016298845,"about_ca_system_score_gemma":0.0007182286,"threshold_uncertainty_score":0.02557528},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.77605635,0.002644337,0.18444084,0.001142226,0.00009151348,0.00012538637,0.0008865016,0.00027009172,0.034342825],"genre_scores_gemma":[0.9247145,0.0016149675,0.06495029,0.00017879426,0.000088901266,0.00023920159,0.0010537304,0.0001741009,0.006985415],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988738,0.00027193347,0.00007944796,0.0002684201,0.00032232443,0.00018405258],"domain_scores_gemma":[0.9949733,0.0029025332,0.0009119687,0.0004353139,0.00042400535,0.0003527792],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061161566,0.0005290537,0.0006051176,0.0025824795,0.0013448065,0.0015163898,0.0015584462,0.0011245582,0.0038968208],"category_scores_gemma":[0.008887697,0.0007283169,0.00057139166,0.0025296756,0.0017517479,0.0028624388,0.0018433961,0.0008172737,0.00046391334],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00056233665,0.000115929695,0.014107465,0.00071692484,0.00015162579,0.0006647813,0.0016775116,0.16748159,0.0228412,0.67773503,0.0072377156,0.10670796],"study_design_scores_gemma":[0.000063839754,0.00012378633,0.003155036,0.00015997235,0.0000637668,0.00068721507,0.0006172223,0.29343927,0.011699179,0.67539954,0.014525532,0.00006571948],"about_ca_topic_score_codex":0.002276853,"about_ca_topic_score_gemma":0.0025933255,"teacher_disagreement_score":0.0038968208,"about_ca_system_score_codex":0.0017161694,"about_ca_system_score_gemma":0.00048846763,"threshold_uncertainty_score":0.013036191},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.75889665,0.0025946537,0.19908544,0.0026061805,0.00013075031,0.000036538106,0.00034675217,0.0009976709,0.035305373],"genre_scores_gemma":[0.9871296,0.0005229457,0.010570611,0.0002360715,0.00012458295,0.00002676915,0.00012853838,0.00008961691,0.0011712176],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993703,0.00013574566,0.000025869713,0.00018610037,0.00014300716,0.00013909831],"domain_scores_gemma":[0.9874692,0.00883935,0.0008696663,0.0010801259,0.00077212154,0.0009696176],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001528542,0.00043306992,0.00094787276,0.0013406613,0.0011469016,0.0017811642,0.0014821006,0.0009838528,0.0039052872],"category_scores_gemma":[0.018042434,0.00044038938,0.0005415146,0.0011336618,0.002158114,0.0051335557,0.0021168897,0.0017531535,0.00036393394],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00043243793,0.00020203831,0.018090513,0.0006586004,0.00013766388,0.001073242,0.0013681193,0.06437512,0.024873858,0.8396676,0.010429301,0.03869158],"study_design_scores_gemma":[0.00004273447,0.00011234899,0.0057995655,0.00011746326,0.00011591456,0.0015846355,0.0005620341,0.2419919,0.0078266775,0.7370671,0.004739929,0.000039620438],"about_ca_topic_score_codex":0.00078162935,"about_ca_topic_score_gemma":0.0009224249,"teacher_disagreement_score":0.0039052872,"about_ca_system_score_codex":0.0010577111,"about_ca_system_score_gemma":0.0003994672,"threshold_uncertainty_score":0.013064504},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.67654824,0.0017879328,0.046399757,0.035508078,0.0012238927,0.00009209209,0.0007823342,0.00077920686,0.23687851],"genre_scores_gemma":[0.98225015,0.00038480744,0.0067911604,0.001154272,0.00043012746,0.00007834153,0.00025681048,0.000092854876,0.008561559],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984597,0.000387976,0.000060176662,0.00042054098,0.00037781466,0.00029382258],"domain_scores_gemma":[0.9879605,0.008908351,0.0006907073,0.0012896343,0.00049644354,0.0006542907],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020538364,0.0007742831,0.0014669271,0.0028013024,0.0041390653,0.0047728005,0.0026899278,0.004796114,0.015413939],"category_scores_gemma":[0.017502004,0.00088851876,0.0008587321,0.0032093022,0.008891204,0.010429509,0.0046897926,0.0043704854,0.0010174244],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012878608,0.000037605554,0.000600048,0.0000623947,0.000009688329,0.0001359623,0.00036313676,0.0016458101,0.00040874787,0.98970747,0.0045140292,0.0023863595],"study_design_scores_gemma":[0.00006157514,0.00000858578,0.00033724456,0.00002041437,0.000010558344,0.00012252164,0.00022244212,0.0079606045,0.00043964686,0.98742664,0.0033750762,0.000014707048],"about_ca_topic_score_codex":0.0021054659,"about_ca_topic_score_gemma":0.0018078645,"teacher_disagreement_score":0.015413939,"about_ca_system_score_codex":0.002383433,"about_ca_system_score_gemma":0.0008029554,"threshold_uncertainty_score":0.051564753},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8034601,0.0019746763,0.11891001,0.0023158544,0.00016434032,0.00009045371,0.00069207937,0.0010497163,0.07134275],"genre_scores_gemma":[0.9564883,0.001004288,0.031151164,0.0003869874,0.00016280546,0.00010215045,0.0006644518,0.00012669644,0.009913072],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99958855,0.00007954326,0.000018766956,0.00015150542,0.00009427268,0.000067389265],"domain_scores_gemma":[0.9983425,0.0007712807,0.0003666297,0.00026752416,0.000105757965,0.00014615477],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002443453,0.00034789776,0.000412978,0.0011718632,0.0010248554,0.0012665428,0.000639932,0.00077357946,0.004269483],"category_scores_gemma":[0.0025651301,0.00048523096,0.0005413871,0.00096356065,0.0016470279,0.00259637,0.0015524124,0.0010494201,0.00049847533],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024545586,0.000059402922,0.0029123,0.00032481636,0.000044783355,0.0008032492,0.0011116841,0.015105427,0.017859496,0.9370132,0.004279375,0.020240784],"study_design_scores_gemma":[0.00004006376,0.000050504594,0.0033371428,0.000052551288,0.000044096832,0.0015148997,0.00044142993,0.020718578,0.004862483,0.95298517,0.015914325,0.00003878298],"about_ca_topic_score_codex":0.0010096885,"about_ca_topic_score_gemma":0.001518205,"teacher_disagreement_score":0.004269483,"about_ca_system_score_codex":0.0006601259,"about_ca_system_score_gemma":0.00034135248,"threshold_uncertainty_score":0.014282823},"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":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16721408,0.0041072797,0.7290615,0.0024349615,0.00045206863,0.00019066327,0.0008090483,0.00038357565,0.095346846],"genre_scores_gemma":[0.8540718,0.0036454087,0.12599292,0.0009986437,0.0008237794,0.00036018697,0.0005239517,0.00018643274,0.013396909],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972773,0.00067718414,0.00015447279,0.00069084344,0.0008036777,0.0003966151],"domain_scores_gemma":[0.9938803,0.0032399525,0.0006187628,0.0010792572,0.0007749069,0.00040683843],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033426369,0.00064532534,0.001377871,0.0026489873,0.0023112756,0.0027670274,0.001680909,0.0010138955,0.0038031861],"category_scores_gemma":[0.010807268,0.0005927227,0.0016416078,0.002549046,0.004383812,0.0080833435,0.0047490452,0.0032223677,0.0007163099],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000039807583,0.000014148018,0.0004050044,0.00006888046,0.0000140778275,0.00011535625,0.00021680907,0.004499656,0.0008843882,0.9849186,0.0012635976,0.0075598317],"study_design_scores_gemma":[0.000027513206,0.000056562505,0.00069299544,0.00006021007,0.000027063748,0.0004861582,0.00015102506,0.029768897,0.001429139,0.95029765,0.01697114,0.000031772503],"about_ca_topic_score_codex":0.0013819311,"about_ca_topic_score_gemma":0.0009761429,"teacher_disagreement_score":0.0038031861,"about_ca_system_score_codex":0.0022058224,"about_ca_system_score_gemma":0.00089361676,"threshold_uncertainty_score":0.017677784},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.50091565,0.005971124,0.38813877,0.0030385442,0.0004930866,0.00018260985,0.003236928,0.0009193337,0.09710398],"genre_scores_gemma":[0.84621984,0.003004159,0.13176583,0.0008225714,0.00047127865,0.0005735851,0.0027279793,0.00061294046,0.01380172],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997439,0.00043823235,0.000121461875,0.00079276855,0.0006217303,0.0005866423],"domain_scores_gemma":[0.9894308,0.0066461386,0.0006182128,0.0016798029,0.0007664179,0.0008586953],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020797104,0.0013612813,0.0019799015,0.0025606505,0.002696783,0.0026094958,0.0050308644,0.001788157,0.010642847],"category_scores_gemma":[0.016134605,0.0015353324,0.0020293717,0.0021848558,0.0032408838,0.012908832,0.003730692,0.004395695,0.0019012095],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00073054415,0.00020745191,0.0076021217,0.00062657485,0.00013356129,0.00032512692,0.0008127797,0.07526905,0.007453562,0.8501365,0.015009284,0.04169339],"study_design_scores_gemma":[0.00007805233,0.0001414212,0.0030354983,0.00022181676,0.00011995247,0.0005315166,0.00028682538,0.3283892,0.0070838244,0.6436964,0.016246798,0.00016867874],"about_ca_topic_score_codex":0.0026544705,"about_ca_topic_score_gemma":0.003508633,"teacher_disagreement_score":0.010642847,"about_ca_system_score_codex":0.0024157085,"about_ca_system_score_gemma":0.0011888326,"threshold_uncertainty_score":0.03560388},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.78451955,0.0013688833,0.13083011,0.00033324445,0.00010438927,0.00003597636,0.0005018863,0.00025925992,0.08204669],"genre_scores_gemma":[0.9604648,0.00046134385,0.025810242,0.00011653908,0.00007071776,0.0000773609,0.0004134438,0.000030120213,0.012555422],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995938,0.00005621277,0.000022229327,0.00012687402,0.000107087435,0.000093735995],"domain_scores_gemma":[0.9992499,0.00030754553,0.000106691834,0.0001226501,0.00012480607,0.00008828832],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003053402,0.0001740056,0.0002645426,0.0007636099,0.0009049234,0.0010215678,0.00040388387,0.00017398802,0.0029058466],"category_scores_gemma":[0.0010235996,0.00023003094,0.0002190714,0.0005801448,0.00095459574,0.0015773838,0.00081381784,0.00033418203,0.00031621102],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011310527,0.00003059817,0.0024653,0.00010679831,0.000013788519,0.00047146727,0.00065790414,0.0023302482,0.019896246,0.9375953,0.0017343056,0.034584858],"study_design_scores_gemma":[0.00002661281,0.000044587585,0.005327128,0.00004810949,0.00001996413,0.00127323,0.00060183834,0.01551844,0.012276793,0.9308526,0.033984218,0.000026471365],"about_ca_topic_score_codex":0.0017749488,"about_ca_topic_score_gemma":0.0029103665,"teacher_disagreement_score":0.0029058466,"about_ca_system_score_codex":0.0005148702,"about_ca_system_score_gemma":0.0002896335,"threshold_uncertainty_score":0.009721041},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.739355,0.0014271077,0.19350407,0.0011930455,0.00017349135,0.000055135464,0.0007133919,0.0005294014,0.06304941],"genre_scores_gemma":[0.951442,0.0005527555,0.023825714,0.00021439436,0.0002210652,0.00012546296,0.0012869645,0.00016005582,0.022171585],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986212,0.00030737228,0.00010218689,0.00033117202,0.0004576398,0.00018045428],"domain_scores_gemma":[0.99543506,0.002338012,0.00060601474,0.0003557737,0.0007269278,0.00053820753],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010486266,0.0009281324,0.00092689606,0.0022718224,0.0012712629,0.0032013326,0.0010749584,0.000666547,0.00607038],"category_scores_gemma":[0.0065716477,0.00045776446,0.0010911993,0.00085280923,0.0024765297,0.003854501,0.0025103374,0.0018017996,0.001049719],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010443629,0.000020348025,0.00080568076,0.00009471725,0.00002479827,0.0002552001,0.0003376454,0.0040046205,0.0025735856,0.9859037,0.0011552902,0.004720039],"study_design_scores_gemma":[0.00005285511,0.00014473264,0.0023304473,0.00007704365,0.000033770506,0.00045283526,0.00038566414,0.04404796,0.003993482,0.93977475,0.008651258,0.00005516694],"about_ca_topic_score_codex":0.0012929154,"about_ca_topic_score_gemma":0.0011010976,"teacher_disagreement_score":0.00607038,"about_ca_system_score_codex":0.0015555981,"about_ca_system_score_gemma":0.0005203191,"threshold_uncertainty_score":0.020307422},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.080229826,0.00023863792,0.91170406,0.000667446,0.00006142515,0.0001319253,0.00025836597,0.0012778863,0.005430478],"genre_scores_gemma":[0.53920585,0.0002111422,0.45505887,0.00021661351,0.000079406025,0.00045617635,0.0005594992,0.0004218306,0.0037906365],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980337,0.00071540324,0.00007266909,0.0004377063,0.00046925968,0.00027126362],"domain_scores_gemma":[0.9917957,0.0058894064,0.0005006303,0.0010844665,0.0004328433,0.00029699702],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028582637,0.0010401802,0.0014475163,0.0018509156,0.00080257026,0.0024256746,0.003474603,0.0015130976,0.004861227],"category_scores_gemma":[0.013343467,0.00087900006,0.0013040017,0.0023988283,0.0023353903,0.0067723873,0.0033812725,0.0027357945,0.00064682314],"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.0003528256,0.00013844125,0.0014582253,0.00016700207,0.0000702878,0.00009035216,0.00017007954,0.54750645,0.0037159647,0.38818216,0.005848436,0.052299667],"study_design_scores_gemma":[0.000018692732,0.000016726808,0.000077083896,0.0000107974665,0.0000067282926,0.000021439992,0.000019392559,0.8826057,0.0010562044,0.115555085,0.0006041317,0.000008168415],"about_ca_topic_score_codex":0.002730702,"about_ca_topic_score_gemma":0.002589969,"teacher_disagreement_score":0.004861227,"about_ca_system_score_codex":0.003016964,"about_ca_system_score_gemma":0.001882253,"threshold_uncertainty_score":0.021889687},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12242247,0.019984787,0.07641495,0.06546195,0.014663333,0.00008913022,0.00112699,0.0019542777,0.69788206],"genre_scores_gemma":[0.67183805,0.007752789,0.032125138,0.0055336477,0.002447159,0.000052409985,0.0007648306,0.0006270791,0.278859],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99952936,0.00006951562,0.000016198117,0.0001118264,0.00017344342,0.00009961443],"domain_scores_gemma":[0.99947375,0.00011194234,0.000045531564,0.00007864936,0.00015365674,0.00013642969],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056701835,0.00055910787,0.00037173595,0.0011135653,0.002813905,0.0023633803,0.00055246416,0.0013699385,0.03579739],"category_scores_gemma":[0.0021500979,0.0002468906,0.00036241952,0.0007773678,0.0025417241,0.004086123,0.0015831181,0.0020722838,0.006598368],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023505093,0.000028478906,0.0008737525,0.00014216155,0.000012444004,0.000544259,0.0011143304,0.0014618932,0.0052290335,0.7673666,0.118719645,0.104272395],"study_design_scores_gemma":[0.000020791715,0.000105839965,0.0011295186,0.00017668288,0.00001246168,0.00053997664,0.0013144441,0.002091375,0.0027075,0.2597034,0.7321491,0.00004894184],"about_ca_topic_score_codex":0.002724911,"about_ca_topic_score_gemma":0.0035355773,"teacher_disagreement_score":0.03579739,"about_ca_system_score_codex":0.0017016586,"about_ca_system_score_gemma":0.0006712894,"threshold_uncertainty_score":0.119754195},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13821504,0.0014025789,0.66100895,0.0036935208,0.0004042815,0.000079636295,0.00035653292,0.00035529776,0.1944841],"genre_scores_gemma":[0.88563454,0.0011161354,0.06030451,0.0009769723,0.0004135958,0.00013269029,0.00043617858,0.00044970048,0.05053571],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985323,0.00045748122,0.00006173476,0.00028644636,0.00049058435,0.00017143361],"domain_scores_gemma":[0.99654824,0.001544399,0.0004160334,0.0007505647,0.00037842305,0.00036241947],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019046521,0.000659307,0.0014080309,0.0015215693,0.0014671764,0.0035396987,0.0018439149,0.0020943636,0.009762133],"category_scores_gemma":[0.007943892,0.0011046134,0.0011707804,0.0010291806,0.005277032,0.008583489,0.005089703,0.0045268866,0.0011280006],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000686516,0.0000034246066,0.00003335908,0.00001098025,0.0000024783471,0.000017730532,0.000034237954,0.0013728377,0.00011441825,0.9968106,0.00039072757,0.0012022333],"study_design_scores_gemma":[0.000006145047,0.000008761704,0.000081226215,0.0000107586875,0.0000027990122,0.00007566914,0.000044768694,0.015080961,0.00013772275,0.98346657,0.0010776818,0.000006926664],"about_ca_topic_score_codex":0.0005575643,"about_ca_topic_score_gemma":0.00050730107,"teacher_disagreement_score":0.009762133,"about_ca_system_score_codex":0.0009955016,"about_ca_system_score_gemma":0.0007388435,"threshold_uncertainty_score":0.032657623},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5935069,0.0022416757,0.18821754,0.0062923366,0.0010152891,0.00008234267,0.0002722717,0.0003075114,0.20806418],"genre_scores_gemma":[0.9163258,0.0011939913,0.031771366,0.0007918212,0.00083297124,0.00014289719,0.00034933325,0.00019622337,0.048395507],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989956,0.0002948372,0.000064119195,0.00015073235,0.00032909127,0.00016577303],"domain_scores_gemma":[0.9966618,0.002010292,0.00030061518,0.00019601386,0.00036754913,0.0004637],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013968427,0.00082989753,0.0012742807,0.0028254096,0.0030946352,0.004319855,0.0016487216,0.0031250743,0.008381737],"category_scores_gemma":[0.0066441554,0.0005745772,0.0012251653,0.001859094,0.004192191,0.0072004735,0.003440124,0.0048622326,0.00072056573],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017317048,0.000021648331,0.00007833037,0.000025714233,0.00000405781,0.00006931266,0.00013385093,0.0006884453,0.00024294385,0.9965474,0.0006197379,0.0015513682],"study_design_scores_gemma":[0.000004191504,0.000005873219,0.000047186633,0.0000071789163,0.0000026288312,0.00007325449,0.000081772894,0.0030130288,0.00018970316,0.99605125,0.00051830604,0.000005735503],"about_ca_topic_score_codex":0.00089722994,"about_ca_topic_score_gemma":0.0007299182,"teacher_disagreement_score":0.008381737,"about_ca_system_score_codex":0.0014720451,"about_ca_system_score_gemma":0.00090748316,"threshold_uncertainty_score":0.028039634},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.83609974,0.00064837304,0.12809272,0.0008788413,0.00009984114,0.000094079456,0.00023801636,0.00010105774,0.033747308],"genre_scores_gemma":[0.98398906,0.00014722088,0.012967094,0.00008024422,0.00005451658,0.000060805345,0.00011257403,0.000020098474,0.0025682633],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999416,0.0001501095,0.000049597304,0.00011045604,0.0001774108,0.00009651132],"domain_scores_gemma":[0.99724066,0.00093442405,0.0005992271,0.000314316,0.0004386917,0.00047259138],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007656212,0.00025979974,0.00056989485,0.0014725695,0.001316759,0.0014698607,0.0005284726,0.0007286061,0.0034654718],"category_scores_gemma":[0.0039196853,0.00031787468,0.00041159906,0.00050273933,0.0019970026,0.002061459,0.0019036724,0.0012609973,0.0002616569],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000037642574,0.000026578578,0.003165983,0.000048916085,0.000011190955,0.00011059295,0.00032990013,0.006833464,0.0052872645,0.98055285,0.0005726308,0.0030230293],"study_design_scores_gemma":[0.00001955492,0.000059277398,0.0034053933,0.000037037866,0.0000074192317,0.0003766782,0.0002766728,0.14082405,0.0020862313,0.8485819,0.0042966194,0.00002909088],"about_ca_topic_score_codex":0.0005496222,"about_ca_topic_score_gemma":0.000529028,"teacher_disagreement_score":0.0034654718,"about_ca_system_score_codex":0.0011234842,"about_ca_system_score_gemma":0.00062847213,"threshold_uncertainty_score":0.011593163},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.64067036,0.0014246874,0.3159706,0.0010843853,0.00008241783,0.00007005184,0.00058071787,0.00019828885,0.03991854],"genre_scores_gemma":[0.98289144,0.00039871,0.013022212,0.00015621916,0.00013083594,0.00007085768,0.00022664145,0.000043556178,0.0030593914],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99834657,0.0003412894,0.00010201858,0.00041287788,0.0006289131,0.00016835684],"domain_scores_gemma":[0.98610014,0.009758662,0.0011287243,0.0008176198,0.001273099,0.0009217168],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022338787,0.0003323098,0.0010370476,0.0035187292,0.0017466431,0.0035673752,0.0013976276,0.0009974317,0.0057800463],"category_scores_gemma":[0.013152515,0.0005559646,0.00088514976,0.0018199501,0.0041911565,0.0064841635,0.0032653846,0.0021682254,0.00038537252],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003126314,0.000033416414,0.0021392605,0.00007252259,0.0000151003605,0.00007947877,0.0004493539,0.0028489437,0.0010495952,0.9885401,0.0004101266,0.0043308735],"study_design_scores_gemma":[0.000015412477,0.000034393965,0.0023883653,0.000031262738,0.000019399742,0.0005134007,0.0003417611,0.027638374,0.0014160248,0.96418345,0.0033924188,0.00002575785],"about_ca_topic_score_codex":0.00064438937,"about_ca_topic_score_gemma":0.0006647491,"teacher_disagreement_score":0.0057800463,"about_ca_system_score_codex":0.0015335184,"about_ca_system_score_gemma":0.00033819667,"threshold_uncertainty_score":0.019336164},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8383828,0.00057317154,0.09263264,0.0008631235,0.0000847341,0.00011583912,0.000663012,0.00034549597,0.06633927],"genre_scores_gemma":[0.967888,0.0002532059,0.017645823,0.00021050604,0.00006646,0.00009625837,0.001165167,0.00007154789,0.012603146],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99900216,0.00013699582,0.00003454013,0.0003316844,0.0002657798,0.00022880449],"domain_scores_gemma":[0.998228,0.00055279606,0.00018202404,0.0004742414,0.0002130936,0.00034973735],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003539906,0.00034961852,0.00052024145,0.0007841797,0.001257483,0.0015306481,0.0010505059,0.00066221476,0.0074227178],"category_scores_gemma":[0.0035889803,0.00042464532,0.0006057904,0.0008721835,0.0013583545,0.0025300533,0.0024089783,0.0011653645,0.000544645],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029600633,0.0001222057,0.004139691,0.00012589461,0.000051629315,0.0003655551,0.0010589623,0.012591786,0.019955764,0.9238959,0.0046378644,0.032758728],"study_design_scores_gemma":[0.00011804571,0.000081308,0.004229576,0.000033671397,0.00006820569,0.00072224444,0.0004690128,0.054602508,0.009888773,0.9080345,0.021725867,0.000026252139],"about_ca_topic_score_codex":0.0019189387,"about_ca_topic_score_gemma":0.0028243728,"teacher_disagreement_score":0.0074227178,"about_ca_system_score_codex":0.0011006251,"about_ca_system_score_gemma":0.0004655826,"threshold_uncertainty_score":0.024831474},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26169738,0.0029494765,0.5691344,0.0032658456,0.0006505439,0.00013529946,0.0007878487,0.0005384867,0.16084073],"genre_scores_gemma":[0.9106945,0.002625873,0.0652601,0.00087327656,0.00073648855,0.00016350497,0.0004301563,0.0001815578,0.019034646],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99844354,0.00038386136,0.00011107201,0.00044114157,0.00039447384,0.00022601195],"domain_scores_gemma":[0.9961867,0.0020578124,0.00042751792,0.0004890946,0.0004696078,0.00036935665],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019129936,0.00073871715,0.0014731165,0.0037210155,0.0022885567,0.0028966446,0.0017974201,0.0016394085,0.0072375317],"category_scores_gemma":[0.008503705,0.0007945979,0.001920461,0.0031124344,0.0025212863,0.008450597,0.004503625,0.0031559095,0.0007894487],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029589664,0.000016997425,0.00037896412,0.00005076866,0.000013309433,0.00008616115,0.00017954955,0.0020420763,0.0005164118,0.9892492,0.0011155766,0.006321302],"study_design_scores_gemma":[0.000013497478,0.00001758423,0.00028786756,0.00002685221,0.00002093068,0.00022307796,0.00006788257,0.008992512,0.00033958993,0.9857115,0.004283317,0.000015419177],"about_ca_topic_score_codex":0.0010119462,"about_ca_topic_score_gemma":0.00065097195,"teacher_disagreement_score":0.0072375317,"about_ca_system_score_codex":0.0015705408,"about_ca_system_score_gemma":0.0007824837,"threshold_uncertainty_score":0.024211943},"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":"commentary","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011761229,0.0822616,0.03330599,0.58268416,0.030175304,0.000034956825,0.00043960763,0.00024820687,0.259089],"genre_scores_gemma":[0.60735434,0.0623842,0.027583942,0.106694184,0.04665842,0.00018104204,0.00022614322,0.00091473665,0.148003],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99526113,0.0024702004,0.00016889175,0.0006310416,0.0011960462,0.00027268863],"domain_scores_gemma":[0.99018073,0.0066813296,0.00031257517,0.0010806277,0.001187067,0.0005577029],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0067128395,0.0007906552,0.001216033,0.0017224418,0.004446146,0.0064941463,0.00083551765,0.0043044267,0.004771025],"category_scores_gemma":[0.023606936,0.00042964384,0.0005260582,0.0010716037,0.022688929,0.020617122,0.0047443463,0.012083821,0.0020820077],"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.000032128486,0.000009031361,0.000060049057,0.000040548228,0.000008004051,0.000031270854,0.000610356,0.00014553334,0.00006130014,0.951277,0.04200608,0.0057185935],"study_design_scores_gemma":[0.000015751157,0.00000750666,0.000041522566,0.00007019048,0.0000026866069,0.00004502321,0.0002464697,0.00024018485,0.00006569658,0.8380778,0.16117069,0.000016492782],"about_ca_topic_score_codex":0.0016483855,"about_ca_topic_score_gemma":0.0018228611,"teacher_disagreement_score":0.0067128395,"about_ca_system_score_codex":0.0032224657,"about_ca_system_score_gemma":0.0016205172,"threshold_uncertainty_score":0.0355013},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.73591155,0.00057609327,0.09286172,0.0015226911,0.0005866702,0.000075579825,0.00034103912,0.0006671363,0.16745754],"genre_scores_gemma":[0.9497271,0.00026693527,0.020613875,0.00035482628,0.00021180413,0.00007286644,0.00024101106,0.00027441868,0.028237198],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99909186,0.00022152314,0.000067744426,0.00018277673,0.00021466745,0.00022148278],"domain_scores_gemma":[0.9966664,0.0017712994,0.00037403955,0.0004275566,0.00026219644,0.0004984766],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00095425296,0.00064966816,0.0008424067,0.0019203594,0.0026247194,0.004360001,0.0016170078,0.0014562586,0.009516044],"category_scores_gemma":[0.004556706,0.0010034078,0.0008239901,0.0015968104,0.0026421414,0.00522571,0.002795287,0.0027921654,0.0009607784],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006493803,0.00005804167,0.00044549548,0.00003565118,0.0000095604,0.00016822743,0.0002388405,0.0012510779,0.0015451676,0.9915421,0.0014678895,0.0031729585],"study_design_scores_gemma":[0.000024000992,0.000011810012,0.00022703288,0.00001474296,0.000013640992,0.00020462592,0.00011678752,0.0060115578,0.000823002,0.99089843,0.0016389576,0.000015494492],"about_ca_topic_score_codex":0.00070066104,"about_ca_topic_score_gemma":0.0013725052,"teacher_disagreement_score":0.009516044,"about_ca_system_score_codex":0.0012034429,"about_ca_system_score_gemma":0.00061605906,"threshold_uncertainty_score":0.031834304},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37742096,0.0036749654,0.28148884,0.04376866,0.0010366087,0.00014173282,0.0012207913,0.0016931801,0.28955424],"genre_scores_gemma":[0.9439083,0.0012428969,0.035528377,0.0030464919,0.0005462859,0.00020847045,0.0005220161,0.00021134887,0.0147858765],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99655175,0.0006204313,0.00015063144,0.0011272207,0.00074738514,0.00080255256],"domain_scores_gemma":[0.99052703,0.0059487154,0.00053985725,0.0019311766,0.0005572763,0.0004960363],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035121627,0.00063538505,0.0015046978,0.0010306549,0.0035028895,0.004690136,0.003530308,0.003702907,0.01359201],"category_scores_gemma":[0.013073862,0.00077482924,0.0018774271,0.0012799856,0.004868427,0.011310105,0.004292245,0.005450373,0.0019268879],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011173933,0.000045111872,0.00083192706,0.00011403777,0.000017617138,0.00027010523,0.0002963802,0.0020897589,0.0009430224,0.9807571,0.006882837,0.0076403427],"study_design_scores_gemma":[0.000032954773,0.000012872433,0.00024369614,0.000038625087,0.000015558095,0.00023810085,0.00017467041,0.012257528,0.0014240599,0.9798386,0.0057009975,0.000022453345],"about_ca_topic_score_codex":0.001820897,"about_ca_topic_score_gemma":0.0017873318,"teacher_disagreement_score":0.01359201,"about_ca_system_score_codex":0.0019270026,"about_ca_system_score_gemma":0.0010839439,"threshold_uncertainty_score":0.04546976},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7059644,0.0009079932,0.21451552,0.002405838,0.0002225099,0.00019965357,0.0018632871,0.00078760396,0.07313313],"genre_scores_gemma":[0.9547858,0.0005132696,0.03384341,0.0005490698,0.00026907824,0.00028568995,0.0019076864,0.00025430883,0.0075916005],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99685764,0.00047502696,0.00029048647,0.0009603471,0.0006745869,0.0007419445],"domain_scores_gemma":[0.98774856,0.006675213,0.0009806979,0.0017645594,0.001328078,0.0015028586],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002905602,0.00061524636,0.0012480933,0.001788553,0.003305464,0.0038791718,0.0015648573,0.0028544231,0.009718669],"category_scores_gemma":[0.016194666,0.0015955232,0.0015283484,0.0016449655,0.0039792093,0.009151108,0.0046024583,0.0045774,0.0014108683],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026642042,0.00010340537,0.0035721036,0.00016523013,0.000039209157,0.0006103641,0.0014175543,0.0034898,0.014551599,0.96543115,0.0026445396,0.007708837],"study_design_scores_gemma":[0.00016810677,0.00025472653,0.0034866945,0.00012563939,0.00009425691,0.00194648,0.001645909,0.022990339,0.01908949,0.93227595,0.017823502,0.00009897106],"about_ca_topic_score_codex":0.0010557183,"about_ca_topic_score_gemma":0.0011388361,"teacher_disagreement_score":0.009718669,"about_ca_system_score_codex":0.0013104024,"about_ca_system_score_gemma":0.00094590697,"threshold_uncertainty_score":0.03251213},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.79851633,0.001966976,0.073298335,0.0023009728,0.00030071248,0.00010015044,0.0012437255,0.00039191602,0.121880986],"genre_scores_gemma":[0.9259421,0.0011226786,0.020660395,0.00045243866,0.00026924396,0.00028721258,0.0019124794,0.00034585324,0.049007617],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99866104,0.00027985068,0.00007285749,0.00030253155,0.0003456845,0.00033801276],"domain_scores_gemma":[0.9943699,0.0033806441,0.0005776203,0.00031948392,0.0005904177,0.0007618853],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012244525,0.0009341135,0.0014263801,0.003966744,0.00585413,0.0058802995,0.0019644557,0.0014763951,0.007585773],"category_scores_gemma":[0.005760479,0.0010502527,0.0013034771,0.002697769,0.004727247,0.006651376,0.0037715666,0.0027174074,0.0012194139],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030804984,0.0000454237,0.00070255826,0.00010146012,0.000021177839,0.00038790124,0.0010480009,0.0011004983,0.0027930343,0.9874019,0.0019615248,0.0041285804],"study_design_scores_gemma":[0.00004236028,0.00002313876,0.0008926472,0.00006134164,0.000020649497,0.00030727944,0.0005912187,0.0037550218,0.001427788,0.98800695,0.0048475033,0.000024134502],"about_ca_topic_score_codex":0.004369162,"about_ca_topic_score_gemma":0.0036500234,"teacher_disagreement_score":0.007585773,"about_ca_system_score_codex":0.0032318132,"about_ca_system_score_gemma":0.00100844,"threshold_uncertainty_score":0.025376916},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5859237,0.0016723116,0.09832472,0.007277632,0.00062167697,0.00011504069,0.0010167484,0.0014300437,0.30361816],"genre_scores_gemma":[0.94637644,0.00080089096,0.012901212,0.0012269418,0.00025611857,0.00013218098,0.0005944223,0.00024496712,0.03746682],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99904627,0.00020243721,0.000040812847,0.00026376414,0.00018107025,0.0002656324],"domain_scores_gemma":[0.9953615,0.0024271887,0.00036047382,0.0005651648,0.000634162,0.0006514197],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010324105,0.00095958554,0.0018282293,0.002458826,0.0052659526,0.0055404846,0.0012563283,0.0015454441,0.009170823],"category_scores_gemma":[0.003204598,0.0011053897,0.0016432467,0.0026351796,0.0057469266,0.0077457894,0.0033378475,0.0033269562,0.0010441865],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000053762065,0.000019451061,0.00037489404,0.00006575749,0.000025362435,0.00011422499,0.00045649667,0.0006205664,0.0005248663,0.9926588,0.0023594468,0.002726394],"study_design_scores_gemma":[0.000012799718,0.000015606141,0.00030600672,0.000016339272,0.000021494963,0.00014014138,0.00017117408,0.00095975795,0.00028790292,0.9944681,0.0035893968,0.0000111533645],"about_ca_topic_score_codex":0.0018072581,"about_ca_topic_score_gemma":0.0029694496,"teacher_disagreement_score":0.009170823,"about_ca_system_score_codex":0.00184672,"about_ca_system_score_gemma":0.00078196643,"threshold_uncertainty_score":0.030679464},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47520986,0.00092880824,0.45676246,0.0017770726,0.00017315344,0.00008008844,0.00047554824,0.00046579645,0.064127095],"genre_scores_gemma":[0.9417974,0.0002759327,0.04637938,0.00024192002,0.00010335159,0.000096161886,0.00019041888,0.00012552501,0.010789899],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987482,0.00041771718,0.000040616767,0.0003939048,0.000253294,0.00014632058],"domain_scores_gemma":[0.99734396,0.0013336762,0.00028149906,0.00041262418,0.00025592285,0.00037228246],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016049616,0.0005330906,0.00070440094,0.00084934075,0.0008586776,0.0015629855,0.0015495016,0.0011303368,0.0058591054],"category_scores_gemma":[0.0064057964,0.00037387654,0.00046499693,0.00063492556,0.0020197933,0.004124086,0.0022996322,0.0014678185,0.00055019895],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011679526,0.000066747634,0.00097021286,0.000098355784,0.000027523058,0.000091488655,0.00013928035,0.030243592,0.0043554264,0.9430017,0.002484465,0.018404389],"study_design_scores_gemma":[0.000015555757,0.00004938219,0.00045207192,0.000023064938,0.000011148838,0.0002041108,0.000106504114,0.12387408,0.0023598569,0.87030745,0.0025791798,0.000017610784],"about_ca_topic_score_codex":0.00063369353,"about_ca_topic_score_gemma":0.00086971576,"teacher_disagreement_score":0.0058591054,"about_ca_system_score_codex":0.0012229821,"about_ca_system_score_gemma":0.0005209737,"threshold_uncertainty_score":0.01960069},"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":"editorial","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00045712045,0.0016246042,0.004277626,0.06636785,0.92122614,0.000024180863,0.0015782383,0.00085513806,0.0035890953],"genre_scores_gemma":[0.08846973,0.008116151,0.017050104,0.09760284,0.61247456,0.00036419497,0.0030980879,0.0034432933,0.16938105],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9939405,0.0016548871,0.0007921084,0.0011210626,0.0020949538,0.00039657883],"domain_scores_gemma":[0.930694,0.025109809,0.0033871727,0.0067450623,0.031470917,0.002593025],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0064754365,0.002357373,0.0021207107,0.0048360284,0.0032833733,0.004673974,0.004429427,0.0075345226,0.0604732],"category_scores_gemma":[0.13693391,0.0015383133,0.0015491158,0.0041092564,0.0042245486,0.0052323523,0.0024675345,0.011313946,0.024153046],"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.00006832993,0.000005704202,0.00014408474,0.0002635357,0.000038295748,0.00017300346,0.00008576495,0.00018168616,0.0000654457,0.0090287,0.98366034,0.0062852087],"study_design_scores_gemma":[0.00014792285,0.000036577698,0.0012085858,0.0004774259,0.00015468865,0.0011230145,0.0001757068,0.0028444107,0.0007226093,0.035756595,0.9572294,0.00012317655],"about_ca_topic_score_codex":0.009740202,"about_ca_topic_score_gemma":0.009235464,"teacher_disagreement_score":0.0604732,"about_ca_system_score_codex":0.0047856625,"about_ca_system_score_gemma":0.004355437,"threshold_uncertainty_score":0.20230299},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.59102064,0.0011556268,0.28221458,0.003199169,0.00021478397,0.00007881524,0.00041535747,0.0002574386,0.12144362],"genre_scores_gemma":[0.9716608,0.00070000236,0.016186615,0.0002865508,0.00017992617,0.000080132,0.0001300811,0.000043028816,0.010733068],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996043,0.000094514166,0.00001933033,0.000119669574,0.00011214664,0.0000501691],"domain_scores_gemma":[0.9985114,0.00067712524,0.00020412933,0.00019561184,0.00026963014,0.00014215436],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00094463973,0.0002119185,0.00048633883,0.0012341576,0.00115188,0.001374076,0.0005680924,0.0005995453,0.0035019892],"category_scores_gemma":[0.0033234418,0.00023890793,0.00046726968,0.00067166245,0.00220118,0.0026230025,0.0014010045,0.0012219463,0.00041862702],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008931653,0.0000034553543,0.00020480597,0.000014104427,0.0000040344357,0.00003797776,0.00009633011,0.001432501,0.00052053423,0.9949287,0.00050109584,0.0022475536],"study_design_scores_gemma":[0.000008503012,0.00001019001,0.0002990956,0.000009032457,0.0000054791726,0.00010740562,0.00006726376,0.012806229,0.00070840365,0.98186064,0.004109944,0.0000078313105],"about_ca_topic_score_codex":0.0008924358,"about_ca_topic_score_gemma":0.0005241957,"teacher_disagreement_score":0.0035019892,"about_ca_system_score_codex":0.00088881387,"about_ca_system_score_gemma":0.00036040187,"threshold_uncertainty_score":0.011715293},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6055572,0.0036072535,0.12932692,0.006624897,0.00062735373,0.000107341395,0.0009221692,0.00047628232,0.2527505],"genre_scores_gemma":[0.97268516,0.00069119775,0.0081194565,0.00036878823,0.00028309296,0.00007400657,0.00022960379,0.000053897595,0.017494727],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991855,0.00021461942,0.000053263357,0.00023440774,0.00014991855,0.00016229194],"domain_scores_gemma":[0.99735934,0.0013470185,0.0004687454,0.00019864783,0.00023832853,0.00038781686],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010951025,0.00054146064,0.0008319371,0.0014401849,0.0029612249,0.0044869212,0.00077421,0.0012569268,0.0076629184],"category_scores_gemma":[0.0033423954,0.0006791008,0.0007845792,0.0017068052,0.002712349,0.004655764,0.0026575185,0.0024248012,0.00091422244],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000078007484,0.000024390616,0.00063732796,0.00004600853,0.000014256652,0.000115450646,0.00014244742,0.00051281333,0.00078940415,0.99007154,0.0015223726,0.006045955],"study_design_scores_gemma":[0.000044341592,0.000021675425,0.0005150201,0.000010688606,0.000020037163,0.00025723552,0.000087492524,0.0028096845,0.0005516833,0.9921942,0.0034762751,0.000011644041],"about_ca_topic_score_codex":0.0009035738,"about_ca_topic_score_gemma":0.0007339365,"teacher_disagreement_score":0.0076629184,"about_ca_system_score_codex":0.0010197156,"about_ca_system_score_gemma":0.00055757543,"threshold_uncertainty_score":0.025635004},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7070663,0.000405673,0.19199227,0.00026845653,0.000078503996,0.00007533876,0.00030466678,0.0003942638,0.09941454],"genre_scores_gemma":[0.9396247,0.00032390284,0.0413195,0.00012416134,0.000034981487,0.000118681164,0.00057834265,0.00013917257,0.017736576],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99949193,0.00007357234,0.000020218178,0.00015223723,0.00015179737,0.000110155255],"domain_scores_gemma":[0.99909437,0.00027097604,0.0001395963,0.0002647643,0.000095727446,0.00013459715],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026282805,0.000294331,0.00031536684,0.0006637334,0.00086540444,0.0012270994,0.0011106466,0.00045120847,0.005981022],"category_scores_gemma":[0.0017364589,0.00037475472,0.00052978087,0.000680907,0.0015192349,0.002180464,0.0024627224,0.0016264027,0.00091911486],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000064523454,0.000055590448,0.0014138503,0.00005556702,0.000012989689,0.00022678467,0.0008769362,0.004973577,0.0068597137,0.96537316,0.0009036797,0.019183699],"study_design_scores_gemma":[0.000029936236,0.000068547335,0.0013341003,0.00004101487,0.000029244102,0.00028406043,0.00049154286,0.02293865,0.008641108,0.9495444,0.016582621,0.000014809705],"about_ca_topic_score_codex":0.0011225566,"about_ca_topic_score_gemma":0.0017862779,"teacher_disagreement_score":0.005981022,"about_ca_system_score_codex":0.0007376552,"about_ca_system_score_gemma":0.00034832372,"threshold_uncertainty_score":0.020008504},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8717348,0.0030867988,0.078485064,0.0038007456,0.00041818287,0.00005158408,0.00034662263,0.00034989102,0.041726384],"genre_scores_gemma":[0.978127,0.0009652034,0.013614673,0.00017548702,0.00065746123,0.000088328394,0.00015343634,0.000101079015,0.0061172554],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971002,0.001079015,0.00022243014,0.00061286567,0.0005934611,0.00039208704],"domain_scores_gemma":[0.9702206,0.020966932,0.002838641,0.0014245501,0.0010461088,0.0035030881],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006988593,0.0013089841,0.0027729664,0.008558481,0.0046888874,0.0075600166,0.00437713,0.00397718,0.005693161],"category_scores_gemma":[0.030084137,0.0012539488,0.0015879528,0.004622365,0.011517684,0.016350308,0.0050059482,0.003689856,0.00052440364],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025459568,0.00008352804,0.0017352025,0.00011662266,0.000025758238,0.00017990392,0.000609879,0.0029468555,0.0012375687,0.98662937,0.0007121393,0.0054685543],"study_design_scores_gemma":[0.0000275444,0.000036048496,0.00059048424,0.000065814645,0.000033878056,0.00035282428,0.00018273934,0.010926272,0.00087019417,0.98582757,0.0010479721,0.000038662034],"about_ca_topic_score_codex":0.00058462424,"about_ca_topic_score_gemma":0.00046263292,"teacher_disagreement_score":0.008558481,"about_ca_system_score_codex":0.0031663703,"about_ca_system_score_gemma":0.0009731185,"threshold_uncertainty_score":0.036959708},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36134562,0.002807741,0.53996545,0.0055211014,0.00042613037,0.00006987737,0.00025042004,0.00041813066,0.08919552],"genre_scores_gemma":[0.95027083,0.0013097731,0.0330542,0.0010022247,0.00059940276,0.00011422861,0.00012395401,0.00024289581,0.013282591],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99819356,0.00060290284,0.00006813393,0.00034231987,0.00052603526,0.00026693175],"domain_scores_gemma":[0.98329264,0.011656632,0.0013492006,0.0012835845,0.001462687,0.00095534156],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004960411,0.001063404,0.0008494035,0.002486804,0.0014082843,0.0027516584,0.0015340209,0.0013202148,0.0063777263],"category_scores_gemma":[0.028744083,0.0005632559,0.0013477671,0.0010419338,0.006307113,0.00877623,0.0036565948,0.0036392184,0.0008846106],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017142838,0.000013835798,0.0003111139,0.00003151057,0.0000065577888,0.00006277512,0.00017188488,0.0012141293,0.00073895155,0.9951997,0.00041302302,0.0018193051],"study_design_scores_gemma":[0.00001592336,0.000037494578,0.0006650809,0.000038112936,0.000014845998,0.0003354193,0.00009871178,0.043323264,0.0013398378,0.9519821,0.0021234856,0.000025757457],"about_ca_topic_score_codex":0.0010023954,"about_ca_topic_score_gemma":0.0004511433,"teacher_disagreement_score":0.0063777263,"about_ca_system_score_codex":0.0019717838,"about_ca_system_score_gemma":0.0008272814,"threshold_uncertainty_score":0.026233494},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9038259,0.0008703956,0.0531022,0.0008153786,0.00007379146,0.000020021855,0.00010177891,0.00032727016,0.040863246],"genre_scores_gemma":[0.99155253,0.00018347849,0.0050242674,0.00010680305,0.00004259362,0.000028570163,0.000045645673,0.00007037954,0.0029457337],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99936146,0.00015076555,0.000024707917,0.00018685419,0.00012586403,0.00015043952],"domain_scores_gemma":[0.9962178,0.0015927083,0.00065714854,0.0004662977,0.00035165268,0.0007144322],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010224875,0.0003625306,0.0004491632,0.0014865545,0.0013372876,0.0019182649,0.00094864797,0.00073329604,0.0035340171],"category_scores_gemma":[0.006259996,0.00044393836,0.0004010075,0.0005095199,0.0026408113,0.0031084453,0.0020383203,0.0012594848,0.00035767665],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006724752,0.00003152718,0.0015874087,0.000044014778,0.00001109953,0.00012345568,0.00034378938,0.0064404476,0.004071057,0.98105466,0.0010277411,0.0051974105],"study_design_scores_gemma":[0.000018888422,0.000038685037,0.0018848953,0.00002993356,0.000014658768,0.00030921787,0.00022972788,0.054521125,0.0029045686,0.93729526,0.0027208994,0.000032203974],"about_ca_topic_score_codex":0.0011295355,"about_ca_topic_score_gemma":0.0011564415,"teacher_disagreement_score":0.0035340171,"about_ca_system_score_codex":0.001349962,"about_ca_system_score_gemma":0.00034508193,"threshold_uncertainty_score":0.011822462},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7759363,0.0012268854,0.1767406,0.0015003784,0.00015552629,0.00009282347,0.001054999,0.00078001566,0.042512484],"genre_scores_gemma":[0.9493668,0.00063431024,0.035582542,0.00037303296,0.00016188622,0.00013816403,0.0009842,0.00019143872,0.012567647],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99924433,0.00012193705,0.000028309134,0.00025128087,0.00019753454,0.00015662255],"domain_scores_gemma":[0.9972128,0.001224644,0.0004983199,0.00046343548,0.00027870497,0.0003221093],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004139918,0.00060712936,0.0006235416,0.0011007163,0.0017784161,0.0016737563,0.0010101377,0.001074688,0.006127225],"category_scores_gemma":[0.004475111,0.0005336076,0.00051847025,0.0014782767,0.0013304366,0.0039209793,0.0012093333,0.0011216999,0.0008355957],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006501038,0.00013846406,0.0053915908,0.00039182705,0.000083153376,0.0006191885,0.00074678345,0.05821841,0.037996702,0.83571094,0.008129983,0.051922817],"study_design_scores_gemma":[0.00007781797,0.00015413735,0.0034181818,0.000059747043,0.000047585094,0.0010930627,0.00029558263,0.08698352,0.008982829,0.8790695,0.019771367,0.00004661161],"about_ca_topic_score_codex":0.0011516332,"about_ca_topic_score_gemma":0.0011861224,"teacher_disagreement_score":0.006127225,"about_ca_system_score_codex":0.0013846357,"about_ca_system_score_gemma":0.0004619309,"threshold_uncertainty_score":0.02049768},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.862401,0.00084657955,0.07782566,0.001286145,0.00020607933,0.00004168143,0.00023087673,0.00024561374,0.05691629],"genre_scores_gemma":[0.9811091,0.00035508224,0.008685158,0.00020757008,0.00022308127,0.00004019986,0.00027761405,0.00006322583,0.009039075],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99927586,0.00014787377,0.000048700247,0.000215557,0.0002016795,0.00011030835],"domain_scores_gemma":[0.9986533,0.00058791216,0.00021352418,0.00024817404,0.00013296727,0.0001640482],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005062336,0.00044017954,0.00062564417,0.0015364103,0.0012779648,0.0024208284,0.0007006797,0.0006277086,0.0035716817],"category_scores_gemma":[0.0032344793,0.00034077695,0.00076992915,0.0011532453,0.0024379094,0.004498401,0.002919673,0.001457741,0.00059692725],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000052146297,0.00002708381,0.0012542905,0.00005050781,0.000014636196,0.00024965903,0.00076521694,0.0018136832,0.0023987046,0.9861282,0.000921163,0.006324704],"study_design_scores_gemma":[0.000013993976,0.000025118465,0.00048178123,0.000025301375,0.000022265061,0.0004404925,0.00037657205,0.009266508,0.0028660183,0.97846687,0.008002091,0.000013108454],"about_ca_topic_score_codex":0.00041423299,"about_ca_topic_score_gemma":0.0003561995,"teacher_disagreement_score":0.0035716817,"about_ca_system_score_codex":0.0007180592,"about_ca_system_score_gemma":0.0002554281,"threshold_uncertainty_score":0.011948466},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9175661,0.0003075201,0.061900616,0.0008248145,0.00016156731,0.000061085884,0.00018402713,0.00018346916,0.018810712],"genre_scores_gemma":[0.9882207,0.00013437183,0.00491373,0.00009185673,0.000076998585,0.000032366133,0.00009410539,0.00007810805,0.0063577266],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995646,0.00014812754,0.000019941665,0.00007327,0.00011666582,0.00007747318],"domain_scores_gemma":[0.9955778,0.0021763921,0.0006431394,0.00035162558,0.00033190384,0.0009191002],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00068263104,0.0005509153,0.0009792999,0.0020347338,0.0009223392,0.0018950369,0.0014874834,0.0011503509,0.0063456646],"category_scores_gemma":[0.006716516,0.0007198698,0.00060169224,0.00079060247,0.0023360483,0.0026259993,0.0016362969,0.0010897575,0.00037733364],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003858094,0.00013583322,0.0020041957,0.000117257245,0.000056301807,0.0010517184,0.0005471088,0.08693123,0.008938379,0.8912512,0.0024675028,0.0061134277],"study_design_scores_gemma":[0.000057106306,0.00006225669,0.0010970216,0.000019417885,0.000022269489,0.00027277746,0.00027749562,0.3008521,0.0012310701,0.69514924,0.00092940585,0.000029784582],"about_ca_topic_score_codex":0.001850589,"about_ca_topic_score_gemma":0.0016920151,"teacher_disagreement_score":0.0063456646,"about_ca_system_score_codex":0.00083239545,"about_ca_system_score_gemma":0.00038849603,"threshold_uncertainty_score":0.021228373},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22441165,0.010507482,0.31517568,0.064528495,0.0028726612,0.00021870607,0.003414701,0.001837319,0.37703335],"genre_scores_gemma":[0.76744646,0.0058109,0.091855116,0.008269333,0.0023005,0.000663183,0.003698504,0.0013148744,0.11864112],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99750525,0.00075383537,0.00011832568,0.0006205649,0.00045813303,0.00054385216],"domain_scores_gemma":[0.99108773,0.0062468494,0.00055891526,0.00058992865,0.0008439892,0.00067256606],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032145493,0.0016905852,0.0028841938,0.0021302598,0.0043873284,0.005890737,0.0027495539,0.003632644,0.02526852],"category_scores_gemma":[0.01791451,0.00091930013,0.002332103,0.002992132,0.0051088287,0.016788842,0.0063624554,0.009319266,0.0036432594],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025012626,0.00005024912,0.0006539246,0.00027782965,0.00005274174,0.00012646984,0.00033919205,0.0025150236,0.00022303792,0.9613808,0.023716997,0.010413593],"study_design_scores_gemma":[0.000047803715,0.00001633154,0.0001470411,0.000047804268,0.000019958972,0.000070077585,0.000117795185,0.006296962,0.00013125472,0.98812264,0.004967237,0.000015019201],"about_ca_topic_score_codex":0.0029380121,"about_ca_topic_score_gemma":0.0032042738,"teacher_disagreement_score":0.02526852,"about_ca_system_score_codex":0.0033990168,"about_ca_system_score_gemma":0.0031977606,"threshold_uncertainty_score":0.084531665},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3865418,0.005906972,0.1790473,0.04554951,0.0031741192,0.00016485716,0.0017489557,0.0017518662,0.37611467],"genre_scores_gemma":[0.95063406,0.0011499983,0.025390854,0.004565589,0.0019726402,0.00019338024,0.0011246187,0.00031382393,0.014655111],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99367005,0.0012023664,0.00025928707,0.0016278477,0.0019666327,0.0012738293],"domain_scores_gemma":[0.9829707,0.0109621845,0.00095154956,0.0025348049,0.0016285281,0.00095225713],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004404907,0.0009933993,0.001955679,0.0025285243,0.004762709,0.0063502877,0.003080441,0.004236686,0.024309523],"category_scores_gemma":[0.028099144,0.0010263553,0.0012385418,0.0026638045,0.0068931915,0.011793159,0.0060432237,0.009787323,0.0031134184],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00040112954,0.00012727357,0.002088505,0.0002879199,0.00003446507,0.00033238681,0.00050134637,0.005059898,0.0018000709,0.9465805,0.026959201,0.015827192],"study_design_scores_gemma":[0.000086523374,0.0000710113,0.00070597953,0.00011133102,0.000036354595,0.0005650128,0.0002133756,0.022030951,0.0018702645,0.9504331,0.023821404,0.000054673375],"about_ca_topic_score_codex":0.001718122,"about_ca_topic_score_gemma":0.0011656226,"teacher_disagreement_score":0.024309523,"about_ca_system_score_codex":0.0024256501,"about_ca_system_score_gemma":0.00096334954,"threshold_uncertainty_score":0.081323445},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6723021,0.006615053,0.17224626,0.007321076,0.001187766,0.0000919189,0.0008248705,0.00048863434,0.13892233],"genre_scores_gemma":[0.9508816,0.0015724709,0.034909874,0.000538796,0.0010269246,0.00012788846,0.00049096573,0.0002266673,0.010224834],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992261,0.00017161311,0.00004175806,0.00023437345,0.00017289443,0.00015332462],"domain_scores_gemma":[0.9946674,0.003431381,0.00059271476,0.00034699801,0.0003471647,0.00061434496],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014481705,0.00086757087,0.0009484464,0.0020186394,0.0020211,0.0028505574,0.0012882702,0.0011900199,0.009044393],"category_scores_gemma":[0.008192032,0.0004953508,0.0006999476,0.0013627154,0.0045591877,0.007273127,0.0036402284,0.002835432,0.0014387682],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000117502605,0.000017198401,0.00084701093,0.00013642063,0.000014990414,0.00012684698,0.00041506017,0.0013647724,0.0031563512,0.98424995,0.0024582495,0.007095583],"study_design_scores_gemma":[0.000026622769,0.00005663438,0.0011302318,0.00007357136,0.000032396645,0.00034525624,0.00013919937,0.009668736,0.0024451218,0.97748476,0.008547408,0.000050024733],"about_ca_topic_score_codex":0.000515789,"about_ca_topic_score_gemma":0.00043172514,"teacher_disagreement_score":0.009044393,"about_ca_system_score_codex":0.0013907797,"about_ca_system_score_gemma":0.0005746402,"threshold_uncertainty_score":0.03025645},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8000202,0.0010788597,0.1049643,0.002768434,0.00026214344,0.00007962401,0.00081152853,0.00037471522,0.08964012],"genre_scores_gemma":[0.97418493,0.0004907203,0.013503841,0.00030604555,0.00019780431,0.00006981619,0.00049356266,0.00013987542,0.010613396],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991748,0.0002104012,0.00004034444,0.00017698492,0.00023548811,0.00016195978],"domain_scores_gemma":[0.9958753,0.0018797219,0.0007388836,0.00043126574,0.0004891127,0.00058567734],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008633902,0.00065016677,0.0012039021,0.0034245064,0.003699772,0.004492313,0.0018360696,0.0019312745,0.009548453],"category_scores_gemma":[0.005177932,0.0007532789,0.00068874424,0.003050196,0.005220732,0.008055146,0.004006031,0.002957398,0.0012905205],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004208894,0.000014554389,0.00028764,0.000021516968,0.0000053159483,0.000107682565,0.00030247823,0.0014824765,0.000367128,0.99427646,0.00084452814,0.0022480453],"study_design_scores_gemma":[0.000008000439,0.0000099759445,0.00012210952,0.00001251734,0.0000037352077,0.00007720816,0.00018398289,0.0030483857,0.0001374814,0.9953999,0.0009887848,0.000007893646],"about_ca_topic_score_codex":0.0012922173,"about_ca_topic_score_gemma":0.0010623732,"teacher_disagreement_score":0.009548453,"about_ca_system_score_codex":0.0011459668,"about_ca_system_score_gemma":0.0006157227,"threshold_uncertainty_score":0.031942785},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.92597526,0.0005680151,0.060583852,0.0005951736,0.000061705476,0.000046622492,0.00046123966,0.00020406734,0.011503935],"genre_scores_gemma":[0.98679787,0.00031252432,0.011235159,0.00006244135,0.000053296273,0.000056127457,0.00026146823,0.000071456765,0.001149628],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99901736,0.00023476602,0.00006122988,0.00025517927,0.00023483387,0.00019657289],"domain_scores_gemma":[0.9816705,0.0120827975,0.0025400417,0.0011786825,0.0013018128,0.001226189],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013678871,0.00044926233,0.0005490858,0.00231204,0.00081714283,0.0028558373,0.0010489393,0.00070755434,0.0025775272],"category_scores_gemma":[0.01740154,0.0006426285,0.0004109968,0.0012607271,0.0026859753,0.0040374063,0.0010612706,0.00098324,0.00042100585],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009281007,0.0001912425,0.084513985,0.00043501257,0.00006996097,0.0005155257,0.00093342306,0.06095303,0.035570275,0.764541,0.0051950538,0.04615338],"study_design_scores_gemma":[0.000079961625,0.00017189058,0.025870387,0.00013751705,0.00009684589,0.0012710893,0.00076777325,0.35692137,0.027936008,0.58095604,0.005618497,0.00017252647],"about_ca_topic_score_codex":0.0019205533,"about_ca_topic_score_gemma":0.001671105,"teacher_disagreement_score":0.0028558373,"about_ca_system_score_codex":0.001529602,"about_ca_system_score_gemma":0.00058122486,"threshold_uncertainty_score":0.011098087},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14672025,0.015906537,0.73717767,0.0089431545,0.0014201077,0.00009643506,0.00064349757,0.00080123526,0.08829112],"genre_scores_gemma":[0.91553795,0.0074610156,0.054335035,0.0019829343,0.0015413704,0.0002666862,0.00040490145,0.00037283276,0.018097248],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978154,0.00060890696,0.00009199829,0.00044553296,0.0006317721,0.00040645583],"domain_scores_gemma":[0.9740139,0.016739003,0.0011007363,0.0024321482,0.003775104,0.001939064],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005941959,0.0013325734,0.0023266054,0.0033682368,0.001825392,0.0039822473,0.003626181,0.0024933051,0.007690995],"category_scores_gemma":[0.02801853,0.00066429406,0.0009772838,0.0020297184,0.0042759115,0.007939861,0.004700214,0.005932447,0.0012426855],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015118397,0.00006371268,0.00088136276,0.00022078052,0.00004138058,0.00014992779,0.00022098969,0.012143062,0.0030620566,0.959505,0.005925655,0.01763489],"study_design_scores_gemma":[0.000017379125,0.00007983441,0.0006917786,0.00026094745,0.000034653116,0.00036727017,0.00014015079,0.10766407,0.0021681087,0.8794712,0.009037548,0.00006710754],"about_ca_topic_score_codex":0.0007504212,"about_ca_topic_score_gemma":0.000613693,"teacher_disagreement_score":0.007690995,"about_ca_system_score_codex":0.0028465416,"about_ca_system_score_gemma":0.0015538578,"threshold_uncertainty_score":0.031424463},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45585623,0.0019352962,0.21881612,0.0033964862,0.0006191876,0.00007852367,0.0005634693,0.0005459457,0.31818876],"genre_scores_gemma":[0.91006917,0.00104875,0.02270514,0.0006399899,0.00055689365,0.00010693178,0.00048779076,0.0003791976,0.06400618],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986411,0.00030687786,0.000096967415,0.0003110364,0.0004122009,0.00023189087],"domain_scores_gemma":[0.99734795,0.0014072754,0.00027174034,0.00023015353,0.00036127862,0.00038151495],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007533313,0.0009393038,0.0014048136,0.003464882,0.002621992,0.006044983,0.0013977428,0.0010540547,0.015487882],"category_scores_gemma":[0.0034248093,0.0009106316,0.0014067045,0.002481403,0.0042532943,0.0071712034,0.0040753577,0.0039542466,0.0022352396],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020910391,0.000015086763,0.000090747046,0.000018232957,0.0000050400677,0.0000823029,0.00021738214,0.00027533455,0.0003581263,0.99615026,0.00040308773,0.0023635752],"study_design_scores_gemma":[0.000009124111,0.000015757956,0.00021471764,0.000015186713,0.0000142333565,0.0001666129,0.00019087878,0.0022018717,0.00056311203,0.9937856,0.0028120691,0.000010819186],"about_ca_topic_score_codex":0.0010611957,"about_ca_topic_score_gemma":0.0010667705,"teacher_disagreement_score":0.015487882,"about_ca_system_score_codex":0.0014956276,"about_ca_system_score_gemma":0.0004972386,"threshold_uncertainty_score":0.051812112},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.82523346,0.0020026967,0.12826204,0.0015756666,0.00006939605,0.00009583049,0.001056207,0.00082999223,0.040874686],"genre_scores_gemma":[0.9760884,0.0009363702,0.017291954,0.0001382438,0.0001413595,0.00018712952,0.0010679527,0.00026292654,0.0038856429],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980405,0.00069469854,0.00007101138,0.000356415,0.00046660987,0.00037077698],"domain_scores_gemma":[0.97805095,0.01612427,0.0017733112,0.0010717827,0.0014273674,0.0015523834],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020356362,0.0007572792,0.0011867863,0.0046384367,0.0025402484,0.0024696493,0.0020816093,0.001027179,0.0060191867],"category_scores_gemma":[0.018698413,0.0008134647,0.0007571147,0.0030016333,0.0039944383,0.0057426756,0.0023135077,0.0021700643,0.0007766907],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00055233843,0.00020200781,0.013552104,0.00029698832,0.00008731848,0.00035025514,0.0019109335,0.04146602,0.003135986,0.9062585,0.008037899,0.02414968],"study_design_scores_gemma":[0.00006110113,0.00020788622,0.012063949,0.00018447352,0.00010964691,0.00108042,0.0014878872,0.342091,0.0055761198,0.62901676,0.007989792,0.00013100958],"about_ca_topic_score_codex":0.0052355896,"about_ca_topic_score_gemma":0.0035652742,"teacher_disagreement_score":0.0060191867,"about_ca_system_score_codex":0.0026886335,"about_ca_system_score_gemma":0.00091322867,"threshold_uncertainty_score":0.020136118},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30312398,0.0023954364,0.46395588,0.013664317,0.0015799217,0.00045617472,0.0028074242,0.00070189853,0.21131498],"genre_scores_gemma":[0.81035423,0.0012518787,0.09351918,0.0015825637,0.0013810503,0.00055857695,0.002801465,0.00072339503,0.08782773],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9964876,0.0011473772,0.0001474551,0.00091177144,0.0006452846,0.0006605342],"domain_scores_gemma":[0.98682076,0.0094166715,0.00074970897,0.0011439631,0.0008807157,0.000988147],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029236989,0.0012930126,0.00271664,0.0013883197,0.0025915166,0.004547579,0.0038056765,0.0029707993,0.0318855],"category_scores_gemma":[0.020120475,0.0008642973,0.0014554933,0.0022070769,0.0041508456,0.008755571,0.003950306,0.0051093595,0.0026655304],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034891418,0.00020844766,0.0007051068,0.0004437595,0.00007942905,0.00025596452,0.0003460133,0.030262532,0.0009188905,0.9056174,0.033330195,0.027483294],"study_design_scores_gemma":[0.00009808621,0.000073904535,0.00031559393,0.00005539773,0.00003087456,0.00046087292,0.0001598881,0.11859159,0.0011060328,0.8683033,0.0107687805,0.000035681845],"about_ca_topic_score_codex":0.0016535533,"about_ca_topic_score_gemma":0.0010336087,"teacher_disagreement_score":0.0318855,"about_ca_system_score_codex":0.0026905497,"about_ca_system_score_gemma":0.0015719628,"threshold_uncertainty_score":0.10666764},"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":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011097404,0.18845065,0.025596254,0.064306185,0.008478344,0.00002363862,0.00038152075,0.0008830935,0.7007829],"genre_scores_gemma":[0.22997415,0.2522825,0.0558454,0.021741757,0.016287036,0.00013331154,0.0014312344,0.0010235182,0.4212811],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99929976,0.00012119556,0.00002603472,0.00015453972,0.00032069636,0.00007767397],"domain_scores_gemma":[0.99805224,0.0012028379,0.000062735875,0.00021949576,0.00028277692,0.00017994926],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016462863,0.00061935565,0.00058132905,0.0016364479,0.0011212645,0.0030519932,0.0012487159,0.0014719043,0.013761088],"category_scores_gemma":[0.0039884783,0.0004939587,0.0003217861,0.0021902493,0.0031742891,0.009478951,0.0022110676,0.004450065,0.0071294135],"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.000032114815,0.000027950517,0.000094686846,0.000271545,0.000004942417,0.00004235413,0.00021968142,0.000961525,0.00034877306,0.86983824,0.071258016,0.05690013],"study_design_scores_gemma":[0.000009677459,0.00001472788,0.00011611317,0.00015765673,0.0000042677193,0.000092777576,0.00007082589,0.0010632955,0.00041034547,0.5421075,0.45594203,0.00001078158],"about_ca_topic_score_codex":0.001581616,"about_ca_topic_score_gemma":0.0017714225,"teacher_disagreement_score":0.013761088,"about_ca_system_score_codex":0.004107416,"about_ca_system_score_gemma":0.0019136883,"threshold_uncertainty_score":0.04603535},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5797981,0.0009148361,0.40329942,0.0008765361,0.00004844583,0.0000696846,0.00049458025,0.00056052714,0.013937917],"genre_scores_gemma":[0.89253926,0.0005143693,0.10001293,0.00034283698,0.000046679103,0.00013686884,0.0005616885,0.0001061126,0.005739236],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99891937,0.00029652033,0.000060206665,0.00035382013,0.0002215601,0.00014843438],"domain_scores_gemma":[0.99305797,0.0036282756,0.0009317423,0.00140006,0.0004923934,0.00048954005],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001105297,0.0004462873,0.0005301794,0.001004445,0.0010240196,0.0015072562,0.0014235935,0.0008643006,0.003270796],"category_scores_gemma":[0.0066246996,0.0006761215,0.00075863925,0.0012624977,0.0018481171,0.0046385294,0.0024453844,0.0015577088,0.0004097711],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003626037,0.00009858635,0.004890904,0.0002979879,0.00008596361,0.00042581483,0.0005790402,0.03249235,0.016258786,0.91068685,0.0020935799,0.031727605],"study_design_scores_gemma":[0.000056357618,0.00007728058,0.0013083018,0.000049207018,0.000045990906,0.0004102136,0.00021727664,0.061216287,0.0076777753,0.923167,0.005744153,0.000030084984],"about_ca_topic_score_codex":0.0011881691,"about_ca_topic_score_gemma":0.0014570589,"teacher_disagreement_score":0.003270796,"about_ca_system_score_codex":0.0012366882,"about_ca_system_score_gemma":0.0005457485,"threshold_uncertainty_score":0.010941923},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40999445,0.002496192,0.46776947,0.0063304864,0.00033380385,0.00023500653,0.0019547688,0.0013802297,0.109505616],"genre_scores_gemma":[0.93359417,0.0009508293,0.050497733,0.0011337993,0.00037168027,0.00042887122,0.0011265639,0.00032855017,0.011567725],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99698097,0.0007061132,0.00025496676,0.0009030244,0.0006864513,0.00046841882],"domain_scores_gemma":[0.98600554,0.009981339,0.00085358386,0.0012252956,0.0008381429,0.0010959733],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024781253,0.0007474063,0.0011323284,0.0013417675,0.0016738479,0.003652282,0.0024973915,0.0018686481,0.01140525],"category_scores_gemma":[0.01952424,0.00082668447,0.0013227931,0.0017314901,0.002991695,0.014240863,0.003890524,0.003585355,0.0009492542],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012085377,0.00006195371,0.0010144345,0.00016294757,0.000024405788,0.00012504197,0.00041887048,0.0066936626,0.0020378123,0.9750473,0.0040982524,0.010194495],"study_design_scores_gemma":[0.00002808332,0.000024621575,0.00040803652,0.000026336138,0.000014569656,0.00015741444,0.000108339904,0.029225703,0.00095754623,0.96611273,0.0029173351,0.000019278903],"about_ca_topic_score_codex":0.0014896607,"about_ca_topic_score_gemma":0.0010113699,"teacher_disagreement_score":0.01140525,"about_ca_system_score_codex":0.0024119536,"about_ca_system_score_gemma":0.0009993616,"threshold_uncertainty_score":0.038154423},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.84849244,0.0012466577,0.050952125,0.0021552837,0.00018507836,0.0001139239,0.0014800213,0.00048412048,0.09489025],"genre_scores_gemma":[0.98819643,0.00020368937,0.008766522,0.00019294691,0.000037734233,0.00003513898,0.00037402127,0.00003858968,0.0021550069],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986204,0.00031744255,0.000113629336,0.0004178733,0.00025605154,0.00027449604],"domain_scores_gemma":[0.99348503,0.0031540515,0.0010059424,0.0008832896,0.0005432446,0.0009283628],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019925295,0.00066331757,0.00065389875,0.0011513897,0.00199065,0.0030658192,0.0010435574,0.001162777,0.008558436],"category_scores_gemma":[0.007362705,0.0004706059,0.0007476574,0.0007538918,0.0029720003,0.0068604406,0.0017463497,0.0017283041,0.0008448988],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011605641,0.00010159753,0.011221568,0.00025364515,0.000068572845,0.00024240828,0.0005041551,0.007141193,0.0065914015,0.9482875,0.007729944,0.016697522],"study_design_scores_gemma":[0.00011536388,0.00025705725,0.006125677,0.00011833754,0.0000627408,0.0007054384,0.0006242743,0.04042276,0.01389598,0.9263405,0.011248865,0.00008291926],"about_ca_topic_score_codex":0.0015558944,"about_ca_topic_score_gemma":0.002097569,"teacher_disagreement_score":0.008558436,"about_ca_system_score_codex":0.0014764871,"about_ca_system_score_gemma":0.0011210585,"threshold_uncertainty_score":0.028630793},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.459829,0.0036930868,0.2876574,0.0025887254,0.0007001581,0.00010954623,0.00045387208,0.00048058192,0.24448758],"genre_scores_gemma":[0.8968466,0.0017073461,0.07712071,0.0009420425,0.00047884748,0.00015478229,0.0004052302,0.000246414,0.022098038],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989825,0.00024231704,0.00009088501,0.00021695095,0.0002838723,0.00018347516],"domain_scores_gemma":[0.99650866,0.0024134268,0.0002275477,0.0003318731,0.000310166,0.00020837804],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019316477,0.0006363977,0.0006562443,0.0020252273,0.0017356368,0.0025529917,0.0009012213,0.0011464052,0.005490063],"category_scores_gemma":[0.006200214,0.00046435,0.0016653873,0.0009450629,0.003564668,0.007361727,0.0025096103,0.0031565726,0.00072236505],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028762037,0.000017074193,0.00021289673,0.00004866602,0.0000071156146,0.00015661177,0.00034093915,0.0006207433,0.0008493821,0.99197304,0.00067088625,0.0050740205],"study_design_scores_gemma":[0.000009215909,0.00001640277,0.00014698897,0.00001849301,0.00000806601,0.00022931812,0.0001501493,0.0021253552,0.0012777646,0.99171317,0.004291119,0.000013968513],"about_ca_topic_score_codex":0.0004419022,"about_ca_topic_score_gemma":0.0005414514,"teacher_disagreement_score":0.005490063,"about_ca_system_score_codex":0.00090802065,"about_ca_system_score_gemma":0.00040831396,"threshold_uncertainty_score":0.018366098},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20742495,0.0021491426,0.7638792,0.0019390165,0.00025610975,0.00009385699,0.00048441443,0.000835089,0.022938157],"genre_scores_gemma":[0.9238444,0.0028055562,0.06353148,0.00056696363,0.00069315085,0.00023102945,0.0005887218,0.00057112676,0.007167386],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977422,0.00085753435,0.00007785049,0.00049851666,0.0005737733,0.00025015027],"domain_scores_gemma":[0.96862286,0.02248186,0.0024790461,0.0031240787,0.0020346874,0.0012575925],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004172653,0.0009887199,0.001341942,0.003903711,0.00091409095,0.0021321368,0.0034654813,0.0017422007,0.007971386],"category_scores_gemma":[0.038543623,0.00082392065,0.001288677,0.0022358182,0.0038668665,0.007985478,0.0027646625,0.0034829543,0.0011654994],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015247245,0.000079550424,0.0033776413,0.00021786893,0.00004923286,0.00031941573,0.00033335757,0.11147054,0.0038734805,0.86257195,0.0032250078,0.014329467],"study_design_scores_gemma":[0.000028412302,0.000040644365,0.0015023216,0.000057190297,0.000024893856,0.00023847276,0.00007142818,0.45657182,0.0019192393,0.53768843,0.0018011522,0.000055988963],"about_ca_topic_score_codex":0.00263243,"about_ca_topic_score_gemma":0.0022418278,"teacher_disagreement_score":0.007971386,"about_ca_system_score_codex":0.0013072025,"about_ca_system_score_gemma":0.0005086772,"threshold_uncertainty_score":0.02666694},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8694395,0.0005642734,0.10169343,0.00044757375,0.000040823077,0.000048047797,0.00026068295,0.0000867301,0.02741897],"genre_scores_gemma":[0.9912934,0.00011143613,0.006789293,0.000036993417,0.00003968405,0.000026634787,0.00011380926,0.000022103473,0.0015666963],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991454,0.00020659083,0.000059258113,0.00018969504,0.00027531327,0.0001237749],"domain_scores_gemma":[0.991839,0.004280982,0.0011583618,0.0004435769,0.0011883584,0.0010896736],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014718454,0.0003585573,0.00048114653,0.0029380233,0.0012558043,0.0015618132,0.0006455385,0.00085137045,0.004986309],"category_scores_gemma":[0.008990114,0.00041937298,0.0004905407,0.0010777937,0.0022171459,0.0026571557,0.0018860966,0.0010974904,0.0003753375],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002780774,0.000049555332,0.0080010975,0.00010745415,0.000035494144,0.00031455953,0.0007808452,0.013712731,0.014283408,0.9512906,0.0010999182,0.0100461785],"study_design_scores_gemma":[0.00005762684,0.0002070383,0.006371715,0.000074052994,0.000039943407,0.0011482121,0.0008393108,0.110638246,0.012050897,0.8630124,0.00550873,0.00005183031],"about_ca_topic_score_codex":0.0004866709,"about_ca_topic_score_gemma":0.00042391242,"teacher_disagreement_score":0.004986309,"about_ca_system_score_codex":0.0008029156,"about_ca_system_score_gemma":0.00018178085,"threshold_uncertainty_score":0.016680896},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.82271785,0.0009030324,0.06995237,0.0024398624,0.0003982499,0.00008562142,0.00057612447,0.00036853403,0.102558285],"genre_scores_gemma":[0.9796625,0.00020727151,0.0090328995,0.00021143215,0.00022095439,0.000040889216,0.00024557504,0.000065179964,0.010313245],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990017,0.00017952555,0.00009976295,0.00027510256,0.00025046823,0.00019342873],"domain_scores_gemma":[0.9984268,0.000484374,0.00028082868,0.0003040724,0.000222656,0.00028128],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001282667,0.00053018046,0.0005504702,0.0012933686,0.0012875384,0.0028211398,0.0007240919,0.00083636283,0.006347361],"category_scores_gemma":[0.0025256886,0.0003272113,0.0006750394,0.00068404095,0.0049728183,0.004333962,0.0017829838,0.0022392299,0.0007348028],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000060621922,0.000015392221,0.0007130101,0.00003773471,0.0000045548422,0.00009308371,0.00046539638,0.00052625884,0.0014624243,0.99218553,0.0008750901,0.0035608918],"study_design_scores_gemma":[0.000017567669,0.000039116785,0.0006871544,0.000021192252,0.000004778374,0.0001319366,0.00023672925,0.0023412472,0.0013536809,0.9910409,0.0041076574,0.000018134198],"about_ca_topic_score_codex":0.0012438595,"about_ca_topic_score_gemma":0.0007349247,"teacher_disagreement_score":0.006347361,"about_ca_system_score_codex":0.0017938236,"about_ca_system_score_gemma":0.00062608946,"threshold_uncertainty_score":0.021234035},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44299474,0.0035454761,0.4642967,0.009581676,0.0007530606,0.00019343857,0.0006140232,0.0006803572,0.07734049],"genre_scores_gemma":[0.9157995,0.0014941383,0.042151403,0.00055155286,0.0004762375,0.000393238,0.00036671155,0.0005375767,0.0382297],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99922776,0.00024520158,0.00004449108,0.00017710472,0.00015705041,0.00014840347],"domain_scores_gemma":[0.99309736,0.0036876542,0.00078136614,0.0002629149,0.0008440911,0.0013266101],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028369266,0.0013032877,0.0013001349,0.0023236533,0.0022659397,0.00424369,0.0026326855,0.0025212623,0.012432429],"category_scores_gemma":[0.016565919,0.0010071669,0.0011696935,0.00091191666,0.004041268,0.009173838,0.0034450807,0.0053054867,0.0012438234],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007260456,0.000027752538,0.00024038524,0.000107135194,0.000019232075,0.000081565355,0.00015476054,0.005300733,0.0013843727,0.9888404,0.0012581018,0.0025129507],"study_design_scores_gemma":[0.000034148678,0.000040970055,0.0006072246,0.000068887304,0.000020834694,0.0001508378,0.00022070187,0.08323411,0.0010867742,0.91301775,0.0014633456,0.000054465916],"about_ca_topic_score_codex":0.0012564193,"about_ca_topic_score_gemma":0.0012542796,"teacher_disagreement_score":0.012432429,"about_ca_system_score_codex":0.0030330038,"about_ca_system_score_gemma":0.00216743,"threshold_uncertainty_score":0.04159063},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45229137,0.0070655174,0.46765205,0.003910152,0.00067464437,0.00011048992,0.001340469,0.000967955,0.06598727],"genre_scores_gemma":[0.9266448,0.001666511,0.062320556,0.00044300253,0.00046769602,0.0001566974,0.00080756115,0.00021945007,0.0072736572],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988387,0.0005380617,0.00003468809,0.0002185925,0.00022442683,0.00014555527],"domain_scores_gemma":[0.99505144,0.0030254994,0.00048739108,0.0005840739,0.0005450027,0.0003064921],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001402133,0.00067489315,0.0008037653,0.0025735598,0.0008686669,0.0019202251,0.0012434899,0.0008592379,0.004921754],"category_scores_gemma":[0.010593475,0.00051936577,0.0006108854,0.0015947083,0.002087715,0.0048813503,0.0016454613,0.0017063974,0.0012040507],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011842633,0.00010515707,0.0097294105,0.00037923089,0.00011697682,0.0002978906,0.00035009597,0.26795492,0.007353546,0.6113885,0.018577594,0.082562394],"study_design_scores_gemma":[0.000027111277,0.00008425932,0.0025032884,0.00011262536,0.000021228077,0.00018021303,0.0001502801,0.52058506,0.0038647612,0.4637418,0.008679379,0.00005000099],"about_ca_topic_score_codex":0.0017839125,"about_ca_topic_score_gemma":0.00107072,"teacher_disagreement_score":0.004921754,"about_ca_system_score_codex":0.0013575921,"about_ca_system_score_gemma":0.0004785139,"threshold_uncertainty_score":0.016464949},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.71164745,0.0011567839,0.2537971,0.0029015031,0.00030127986,0.000044876055,0.00030187995,0.0004093006,0.029439786],"genre_scores_gemma":[0.9849688,0.00028299124,0.010840516,0.00017068257,0.0003272213,0.00005312848,0.00012229256,0.00011143331,0.0031228964],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983621,0.0005103364,0.000068352354,0.00028001514,0.00043835628,0.00034088874],"domain_scores_gemma":[0.9850808,0.010980768,0.0011616787,0.0009977634,0.00082387804,0.00095512124],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033241354,0.0006293044,0.0012054512,0.0028198147,0.000952331,0.0027735047,0.001749618,0.001316991,0.0068772053],"category_scores_gemma":[0.023857016,0.0004168625,0.00074667163,0.0012952591,0.0045970483,0.0063018226,0.0019171807,0.0021417057,0.00071687053],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017223223,0.00003478631,0.001110287,0.0000711587,0.00001624197,0.0001000332,0.00017814421,0.00904064,0.0035860508,0.97730494,0.0012775487,0.0071078064],"study_design_scores_gemma":[0.000022425296,0.00006715484,0.0011463999,0.000058843132,0.000017725173,0.00029261285,0.00009175092,0.09279349,0.0039346837,0.9001854,0.0013382931,0.000051187264],"about_ca_topic_score_codex":0.00036700058,"about_ca_topic_score_gemma":0.00019785324,"teacher_disagreement_score":0.0068772053,"about_ca_system_score_codex":0.001439348,"about_ca_system_score_gemma":0.0005454167,"threshold_uncertainty_score":0.023006558},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3713725,0.0011058053,0.5486858,0.005915656,0.00027346046,0.00007234271,0.00021011429,0.0002399538,0.072124444],"genre_scores_gemma":[0.97735983,0.0002721008,0.011402532,0.00033480683,0.000079377125,0.00006560481,0.000049176,0.00005056201,0.01038611],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994717,0.00026844174,0.000014809533,0.00008213991,0.00008246619,0.00008049566],"domain_scores_gemma":[0.995353,0.003511689,0.0003142807,0.00013438179,0.0002725175,0.00041405536],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016958565,0.0008083305,0.0013458533,0.0009002742,0.00086835737,0.0029754287,0.0018150061,0.002721349,0.0049072052],"category_scores_gemma":[0.009744025,0.0006357436,0.00059914344,0.00066605676,0.003143329,0.004825332,0.0018893706,0.0023378413,0.00025984755],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000053287393,0.0000365411,0.00015085522,0.000045735178,0.000018750965,0.00007126318,0.000085277105,0.055471722,0.0005112793,0.94051623,0.0010593791,0.00197963],"study_design_scores_gemma":[0.000024693652,0.000018949302,0.00012039127,0.000014701233,0.0000068084832,0.000021962673,0.000059042242,0.2783672,0.00010861602,0.7209586,0.00028419457,0.000014872612],"about_ca_topic_score_codex":0.0024327822,"about_ca_topic_score_gemma":0.0023058194,"teacher_disagreement_score":0.0049072052,"about_ca_system_score_codex":0.0020400893,"about_ca_system_score_gemma":0.0012961754,"threshold_uncertainty_score":0.016416192},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8744326,0.0018864005,0.07180456,0.0015072816,0.00011443305,0.000048550726,0.0006536477,0.0002587275,0.049293768],"genre_scores_gemma":[0.97845024,0.0005827487,0.015043239,0.00015234927,0.00015269792,0.000079872014,0.00035391672,0.000041990967,0.005143065],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987325,0.00024374698,0.00009848381,0.00035077176,0.0003775112,0.0001970252],"domain_scores_gemma":[0.9936439,0.0037238977,0.0008379932,0.0005919352,0.0004351691,0.00076698634],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013808202,0.0005021694,0.0009656082,0.003168764,0.0023229094,0.004349428,0.0015194518,0.0012154967,0.0035911105],"category_scores_gemma":[0.006246614,0.0006699261,0.00066337077,0.0020252378,0.005041411,0.007707611,0.0030876216,0.0022332019,0.00040825768],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000045950863,0.000017039789,0.0012010235,0.00007494955,0.000007848943,0.000087281536,0.0003811016,0.0024211726,0.0012985993,0.9910851,0.0005474275,0.0028324833],"study_design_scores_gemma":[0.000014943633,0.000017299953,0.0011166922,0.00004094526,0.000011648406,0.00031386412,0.0003180324,0.011676891,0.0016753002,0.9816004,0.0031876178,0.000026323212],"about_ca_topic_score_codex":0.0011188276,"about_ca_topic_score_gemma":0.000887511,"teacher_disagreement_score":0.004349428,"about_ca_system_score_codex":0.0027577665,"about_ca_system_score_gemma":0.00052921206,"threshold_uncertainty_score":0.02000916},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5271712,0.0027090157,0.2135711,0.0034686069,0.0010125064,0.00008265172,0.0005186193,0.00069168274,0.25077465],"genre_scores_gemma":[0.9162193,0.0011768824,0.024359357,0.0008193252,0.0006292723,0.00013878618,0.00027532893,0.0003687034,0.056013107],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990038,0.00037293264,0.000061003022,0.00017508747,0.00019238952,0.00019481445],"domain_scores_gemma":[0.99786586,0.0008563089,0.00030556825,0.00021075757,0.00025093637,0.00051052216],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011282832,0.00086169917,0.0012218708,0.0031785513,0.0032737383,0.0049546203,0.0015317067,0.0015926288,0.0108001195],"category_scores_gemma":[0.0033538516,0.000929118,0.0009774682,0.0025880667,0.0040645245,0.009099683,0.0030998734,0.003308763,0.0014511725],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008773962,0.000008120619,0.000040027237,0.00000882235,0.0000022005513,0.00003010103,0.00009380749,0.0002199666,0.00013827722,0.9983891,0.000294586,0.0007662067],"study_design_scores_gemma":[0.0000040039677,0.0000030961457,0.000048337366,0.0000068649083,0.0000024345816,0.000041714506,0.0000648487,0.0011719754,0.000097004486,0.9976452,0.00091029046,0.000004102427],"about_ca_topic_score_codex":0.0018773242,"about_ca_topic_score_gemma":0.0021252858,"teacher_disagreement_score":0.0108001195,"about_ca_system_score_codex":0.0015432832,"about_ca_system_score_gemma":0.000597897,"threshold_uncertainty_score":0.03613001},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7907565,0.00036307174,0.18436868,0.0014849416,0.00006104696,0.00015191494,0.00037318256,0.0003544869,0.022086106],"genre_scores_gemma":[0.9859548,0.0001635011,0.009912731,0.00019281627,0.000027740885,0.000092320784,0.0001510858,0.000092496164,0.0034125128],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99885595,0.0004389321,0.000032473094,0.00027224235,0.00016106831,0.00023924746],"domain_scores_gemma":[0.994859,0.0025300016,0.00084544206,0.00061569427,0.00022414316,0.00092574465],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011070443,0.0005908999,0.0011079303,0.0014441897,0.0013086537,0.0018750089,0.0017011199,0.0013990293,0.007262234],"category_scores_gemma":[0.0075083487,0.00053739187,0.000605423,0.000723927,0.0031265141,0.0030369442,0.0015754154,0.001535741,0.0007546074],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00073607505,0.00019214067,0.0070123924,0.00032979346,0.0001545595,0.0011414374,0.00051656755,0.23557289,0.02150649,0.7117829,0.007370855,0.013684066],"study_design_scores_gemma":[0.00006997409,0.00013851092,0.0030246258,0.00009045171,0.000036557187,0.0005157158,0.00026701583,0.74186677,0.005571192,0.24534291,0.0030099659,0.00006633953],"about_ca_topic_score_codex":0.002784667,"about_ca_topic_score_gemma":0.0020349321,"teacher_disagreement_score":0.007262234,"about_ca_system_score_codex":0.0016661135,"about_ca_system_score_gemma":0.00061076315,"threshold_uncertainty_score":0.024294555},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.89163876,0.00015648117,0.08632699,0.00043098305,0.00007506145,0.000029456556,0.0000612407,0.00025920698,0.021021873],"genre_scores_gemma":[0.9920014,0.000050514678,0.0042418404,0.00006109158,0.00006329377,0.00002297689,0.000044576496,0.00005400757,0.0034602676],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99879634,0.0003434978,0.00007337152,0.00013901074,0.0004051164,0.00024277403],"domain_scores_gemma":[0.99563736,0.0023343605,0.00059169147,0.00044583163,0.00045701725,0.00053367764],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012162066,0.00033884827,0.00061617,0.001605385,0.0012255114,0.002001998,0.0008549075,0.0006666766,0.0048545967],"category_scores_gemma":[0.0077982442,0.00035244366,0.0004716343,0.00059670064,0.0023793865,0.0027675563,0.0016287054,0.0010399825,0.00041587718],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020666771,0.00008953694,0.002543452,0.00008030097,0.00002206378,0.0010151686,0.0005100635,0.008233715,0.0128802005,0.96573514,0.0008623055,0.007821428],"study_design_scores_gemma":[0.00003129819,0.00014748456,0.0024048302,0.000042106036,0.000021756297,0.0015246335,0.00029257752,0.11175356,0.014694348,0.8668419,0.0021838534,0.000061596504],"about_ca_topic_score_codex":0.00023864952,"about_ca_topic_score_gemma":0.0002578665,"teacher_disagreement_score":0.0048545967,"about_ca_system_score_codex":0.00064495584,"about_ca_system_score_gemma":0.00032979032,"threshold_uncertainty_score":0.01624024},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40910375,0.0034649232,0.0913248,0.040619977,0.0029938521,0.000056511635,0.0005391882,0.001404039,0.45049298],"genre_scores_gemma":[0.9571347,0.00094686315,0.008553344,0.0034638583,0.0021564434,0.00011855722,0.0005164866,0.0003524239,0.026757184],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979919,0.00051051413,0.000066851615,0.0005474591,0.00046779015,0.00041550287],"domain_scores_gemma":[0.9875936,0.007876568,0.0007797988,0.0018968702,0.0009714809,0.00088164303],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026161391,0.0010223254,0.0026316703,0.002185355,0.0041756025,0.0054832436,0.0030684683,0.0043594297,0.01738468],"category_scores_gemma":[0.020307735,0.00090640463,0.0012354532,0.0013288473,0.007114537,0.017783038,0.0039478755,0.008064059,0.0020240385],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008437682,0.00004249066,0.0004741116,0.000059440208,0.000014002328,0.000065663495,0.00012988198,0.0007425734,0.00053073105,0.9907115,0.0040888754,0.0030562568],"study_design_scores_gemma":[0.000018936384,0.000006606148,0.00014073498,0.000014295118,0.000005737201,0.000051036353,0.000042313088,0.0029519908,0.00016752748,0.99566406,0.00093004014,0.000006709975],"about_ca_topic_score_codex":0.0010566798,"about_ca_topic_score_gemma":0.0011331172,"teacher_disagreement_score":0.01738468,"about_ca_system_score_codex":0.0019588338,"about_ca_system_score_gemma":0.0012199705,"threshold_uncertainty_score":0.058157563},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35534742,0.0021942223,0.56908864,0.0031954532,0.00028973998,0.00015108948,0.00018554625,0.000684663,0.06886334],"genre_scores_gemma":[0.91059977,0.0009319988,0.08194072,0.00061373546,0.00019728973,0.00018653969,0.000087325316,0.00013179544,0.005310944],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9967976,0.0016012639,0.00015639408,0.0005881136,0.00050098205,0.00035572393],"domain_scores_gemma":[0.9912969,0.00566113,0.0006302144,0.0013573625,0.00044891363,0.00060553744],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004814397,0.00056398916,0.00092621887,0.0017078746,0.0027177576,0.0029874486,0.0013830635,0.0018685991,0.0028022951],"category_scores_gemma":[0.0104863895,0.00086264435,0.0011248469,0.0009955069,0.00802037,0.009737414,0.0054792613,0.0033693754,0.00052203273],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016892041,0.000011715939,0.00020803235,0.000022515796,0.0000032259757,0.00004323699,0.00030433747,0.00058678247,0.00038079912,0.9957734,0.00025317766,0.0023958746],"study_design_scores_gemma":[0.000011248299,0.000028768718,0.00014085937,0.000026124912,0.000012977865,0.0001582782,0.0001460776,0.0060191453,0.0006333116,0.9905036,0.0023017016,0.000017821929],"about_ca_topic_score_codex":0.00063528115,"about_ca_topic_score_gemma":0.00057993585,"teacher_disagreement_score":0.004814397,"about_ca_system_score_codex":0.0012563542,"about_ca_system_score_gemma":0.00071248575,"threshold_uncertainty_score":0.025461316},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07650815,0.017905656,0.83169764,0.0070271855,0.0018617115,0.000097814904,0.00071536814,0.001000395,0.06318617],"genre_scores_gemma":[0.82726896,0.015277391,0.12208602,0.0036161973,0.004473911,0.0005185662,0.00096995046,0.0011617237,0.024627302],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9957409,0.0010282183,0.00020402338,0.0009121598,0.0013924476,0.0007221884],"domain_scores_gemma":[0.9673102,0.021206181,0.0010250564,0.0040611923,0.004746847,0.0016506183],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008136291,0.002354309,0.0033399248,0.0049456055,0.0021413695,0.004395695,0.0061662854,0.0035067329,0.010195879],"category_scores_gemma":[0.03889861,0.0009877539,0.0017744876,0.0031125897,0.0041648773,0.012902181,0.0058566723,0.011783411,0.0026614442],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003465264,0.00016027328,0.0013140072,0.00059684005,0.000106325155,0.00030024044,0.00039982417,0.037180934,0.011097467,0.88977236,0.015573811,0.04315139],"study_design_scores_gemma":[0.00003389045,0.00015241506,0.0009889875,0.00042298352,0.00009235602,0.0005886268,0.00014119835,0.20429687,0.006700829,0.7666624,0.019765623,0.0001537456],"about_ca_topic_score_codex":0.0010952329,"about_ca_topic_score_gemma":0.00088296214,"teacher_disagreement_score":0.010195879,"about_ca_system_score_codex":0.0036399602,"about_ca_system_score_gemma":0.0017182129,"threshold_uncertainty_score":0.04302931},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23019879,0.006341376,0.41923395,0.01975465,0.00096085697,0.0003682065,0.0054799593,0.008354877,0.30930743],"genre_scores_gemma":[0.7679588,0.001921922,0.19828378,0.0030418981,0.0003563462,0.0004161487,0.0022380524,0.0011047099,0.024678295],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971276,0.00072148367,0.00011788696,0.00067316595,0.0007112383,0.00064865634],"domain_scores_gemma":[0.9859314,0.010792387,0.00043806105,0.001599646,0.00060309266,0.0006354093],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032838462,0.0010219943,0.0011170508,0.0011732907,0.0015652396,0.0033956312,0.0025403982,0.0016709189,0.02701426],"category_scores_gemma":[0.0127591025,0.0006255431,0.0014115954,0.0011461366,0.0019749685,0.008771921,0.0025115174,0.0038096213,0.004425083],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016800542,0.00042146206,0.002600298,0.0010119282,0.00016113615,0.0004219821,0.0006016273,0.067911945,0.021861125,0.7155559,0.05290896,0.13486359],"study_design_scores_gemma":[0.00016578987,0.0003091897,0.0015087215,0.00022628612,0.00015602227,0.0007954007,0.00025052606,0.16321088,0.019692514,0.7599991,0.05357638,0.00010915674],"about_ca_topic_score_codex":0.0020146882,"about_ca_topic_score_gemma":0.004301103,"teacher_disagreement_score":0.02701426,"about_ca_system_score_codex":0.0026606356,"about_ca_system_score_gemma":0.002466069,"threshold_uncertainty_score":0.09037167},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02711509,0.0009424423,0.95594406,0.0005465995,0.0002496852,0.00009220459,0.00012675267,0.0011262832,0.013856895],"genre_scores_gemma":[0.34670788,0.0010110008,0.6419624,0.00040729967,0.00042380524,0.00029591608,0.00032691105,0.00073415035,0.008130618],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99828905,0.0006777897,0.0000801808,0.00034288538,0.0005025998,0.000107494714],"domain_scores_gemma":[0.99547464,0.0019706213,0.0002932572,0.0014191525,0.00062309427,0.00021923518],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019138969,0.00092400383,0.00085393625,0.002588447,0.0008022334,0.00227607,0.0029436857,0.0010490143,0.008586513],"category_scores_gemma":[0.009757174,0.0005354742,0.00077205064,0.0010370762,0.0014794519,0.008491756,0.003036973,0.0022661272,0.0018675277],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027762385,0.0002695086,0.002335108,0.00050862844,0.00010049032,0.00025647742,0.00032827308,0.09707888,0.01501751,0.63868785,0.008636411,0.2365032],"study_design_scores_gemma":[0.000036598914,0.00012507466,0.00043721055,0.00006061953,0.000019444322,0.0002844644,0.00014932404,0.41079304,0.007524722,0.5618306,0.018682031,0.000056899113],"about_ca_topic_score_codex":0.00076191407,"about_ca_topic_score_gemma":0.00085343275,"teacher_disagreement_score":0.008586513,"about_ca_system_score_codex":0.0010282241,"about_ca_system_score_gemma":0.00072899566,"threshold_uncertainty_score":0.02872479},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25502038,0.0013658784,0.6956945,0.0025908388,0.0003781806,0.00032915265,0.0007770404,0.00048982323,0.04335421],"genre_scores_gemma":[0.49990526,0.0014643084,0.4581297,0.0008420688,0.0008749565,0.00062275375,0.0026009008,0.00050210685,0.035057954],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99677163,0.0008182369,0.0002678355,0.0009795644,0.0007692033,0.00039361502],"domain_scores_gemma":[0.9927746,0.0051976424,0.00050043024,0.00083404925,0.0003902342,0.000303117],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025188266,0.0015896335,0.0018264602,0.0014016645,0.0017953799,0.0036783218,0.0023546831,0.0025209745,0.010067232],"category_scores_gemma":[0.013025376,0.0009180296,0.0027276843,0.0021627983,0.0033614777,0.008915385,0.0036773188,0.004890086,0.0015747456],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005964449,0.00034020335,0.0013108599,0.0008140564,0.00011999502,0.00067164935,0.0011839345,0.039552804,0.0055611245,0.8477027,0.0066612335,0.09548508],"study_design_scores_gemma":[0.00010969625,0.00011731241,0.0002547121,0.00006154975,0.00005315016,0.00044889844,0.0003410388,0.057230227,0.0044823666,0.9298746,0.006964255,0.00006215341],"about_ca_topic_score_codex":0.0007164198,"about_ca_topic_score_gemma":0.0009815613,"teacher_disagreement_score":0.010067232,"about_ca_system_score_codex":0.001206269,"about_ca_system_score_gemma":0.0011729571,"threshold_uncertainty_score":0.033678234},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20981693,0.009829567,0.30414665,0.19532447,0.004897375,0.0002180538,0.00068571646,0.0015950572,0.27348614],"genre_scores_gemma":[0.7422348,0.0069442275,0.1151746,0.030174483,0.0023103792,0.0004243265,0.000509493,0.00061153795,0.10161619],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989993,0.00036068092,0.000034878052,0.00025160576,0.00021361385,0.00013989124],"domain_scores_gemma":[0.9969656,0.001847112,0.00014247229,0.0004766268,0.00033375356,0.0002343992],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021797493,0.0006760493,0.0010074602,0.0010821976,0.0031793765,0.0018145371,0.0021867997,0.0042426707,0.011427541],"category_scores_gemma":[0.008650862,0.00057688024,0.0008352296,0.0013086998,0.0061384584,0.010746258,0.003907768,0.0038068392,0.0023107238],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000043867618,0.000023263236,0.00022345949,0.000055943987,0.000007343519,0.00009910906,0.0003690413,0.0009923428,0.00041487542,0.971395,0.015918944,0.010456678],"study_design_scores_gemma":[0.000022877106,0.000023281977,0.00015300799,0.000037416135,0.000005821422,0.00013551039,0.00024261349,0.0018138519,0.00032016676,0.97401506,0.023214674,0.000015731664],"about_ca_topic_score_codex":0.0022657316,"about_ca_topic_score_gemma":0.0021368251,"teacher_disagreement_score":0.011427541,"about_ca_system_score_codex":0.0016375319,"about_ca_system_score_gemma":0.0011492443,"threshold_uncertainty_score":0.03822899},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.91930985,0.00013940355,0.06818043,0.0003390299,0.000015601569,0.000027199038,0.00017430531,0.00008825532,0.0117259165],"genre_scores_gemma":[0.985886,0.000104355364,0.011020673,0.0000461693,0.00004097104,0.000039065693,0.00019606699,0.000026778142,0.0026398913],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99961495,0.000095377814,0.000018045419,0.00011363516,0.00007476994,0.00008333174],"domain_scores_gemma":[0.9980527,0.0009799089,0.00030636,0.00025631365,0.0001506425,0.0002541432],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049788336,0.0002071439,0.0003746647,0.0012720744,0.0014081253,0.0010441343,0.0003979736,0.0003609393,0.0036564819],"category_scores_gemma":[0.001984789,0.0003140473,0.0005892829,0.0008232618,0.0025053727,0.003187299,0.0014151044,0.0009220835,0.00019637166],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010562542,0.000032988497,0.003304464,0.000071521965,0.000016519049,0.00022076227,0.0009529935,0.0051693493,0.008373444,0.9721452,0.0005680195,0.009039026],"study_design_scores_gemma":[0.000024507211,0.000055284763,0.0040977737,0.00001650318,0.000012900151,0.0003958539,0.0005026712,0.023213832,0.0047266674,0.9635742,0.0033565117,0.000023357685],"about_ca_topic_score_codex":0.00067490054,"about_ca_topic_score_gemma":0.0008313242,"teacher_disagreement_score":0.0036564819,"about_ca_system_score_codex":0.0005460818,"about_ca_system_score_gemma":0.00029433405,"threshold_uncertainty_score":0.012232125},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4323204,0.003890818,0.14700674,0.004845197,0.0014680076,0.00007143674,0.00047352535,0.0006178324,0.40930596],"genre_scores_gemma":[0.91472846,0.0016651857,0.023786398,0.0009836,0.0005888225,0.00011270251,0.00023642695,0.00035184703,0.057546567],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99945503,0.00018805842,0.000020266967,0.000106452506,0.0001274212,0.00010288853],"domain_scores_gemma":[0.99773395,0.0011381743,0.00026963948,0.0002612633,0.0002837588,0.00031316874],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006654502,0.0007519288,0.0009360536,0.0032706202,0.002015699,0.0026496865,0.0014874026,0.0012973505,0.012509764],"category_scores_gemma":[0.0048092804,0.0005054137,0.0006240368,0.0022307732,0.0028447055,0.0053623905,0.0025166245,0.0027892815,0.0015853649],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015542599,0.0000061685487,0.00009949392,0.000022694672,0.0000021234134,0.000020514646,0.00010522723,0.0010423381,0.00019599992,0.99348974,0.0014265017,0.0035737818],"study_design_scores_gemma":[0.0000040514515,0.0000076689275,0.00018335,0.000025810288,0.000004414988,0.000064737724,0.000057468875,0.0053787106,0.00018480055,0.99009305,0.003987309,0.000008768737],"about_ca_topic_score_codex":0.001260897,"about_ca_topic_score_gemma":0.001816267,"teacher_disagreement_score":0.012509764,"about_ca_system_score_codex":0.0016534975,"about_ca_system_score_gemma":0.00044491698,"threshold_uncertainty_score":0.041849315},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.84014714,0.0002774544,0.14231597,0.00043042196,0.000026907515,0.00007315986,0.00045363806,0.00019357936,0.016081724],"genre_scores_gemma":[0.98726904,0.00013826856,0.009701587,0.00004868713,0.00003480485,0.000051216,0.00022013142,0.00004000054,0.0024961398],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99918324,0.00019818211,0.00003054913,0.00023227291,0.00020487518,0.00015093014],"domain_scores_gemma":[0.9965629,0.0015934149,0.0006436048,0.0005003704,0.00027003157,0.00042959946],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007672321,0.00036776724,0.00046391357,0.0017735022,0.00083961827,0.0013924562,0.000749088,0.00056288234,0.0039053482],"category_scores_gemma":[0.004724742,0.00028026817,0.0005225824,0.0011313742,0.002286589,0.002501473,0.001974151,0.00078807847,0.00022209108],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013580578,0.000060175582,0.004173525,0.00007801958,0.000031233958,0.00022325471,0.00047212976,0.031563144,0.009495299,0.93564785,0.0011754374,0.016943999],"study_design_scores_gemma":[0.000027587432,0.00009351543,0.0051448178,0.000031236457,0.00002518751,0.0003039804,0.00020087778,0.20531364,0.0048141493,0.7814238,0.0025899145,0.000031244414],"about_ca_topic_score_codex":0.0016928054,"about_ca_topic_score_gemma":0.0022529156,"teacher_disagreement_score":0.0039053482,"about_ca_system_score_codex":0.0015768223,"about_ca_system_score_gemma":0.0005269352,"threshold_uncertainty_score":0.013064742},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15232727,0.0014456857,0.14754663,0.005139395,0.001435173,0.00016632659,0.0011961726,0.0022891029,0.6884543],"genre_scores_gemma":[0.80739623,0.0008889133,0.02196,0.0020570103,0.000578939,0.0001873632,0.0009816381,0.0010500726,0.16489983],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99905235,0.00010660566,0.000044691966,0.0002806476,0.00027519814,0.00024055112],"domain_scores_gemma":[0.9979061,0.00061690336,0.0001627418,0.00055025757,0.0003489823,0.00041502318],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00058214355,0.0005456671,0.0011046001,0.0021423693,0.0019162704,0.0038986614,0.0015048569,0.0020952108,0.054587696],"category_scores_gemma":[0.005312608,0.0005226476,0.00077935343,0.0010627528,0.002071223,0.0072228927,0.00372013,0.0037997712,0.0071887528],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002363121,0.000017395523,0.00012906751,0.00002799756,0.000004804792,0.000031896947,0.000056589215,0.00026365905,0.0008716907,0.9885783,0.004938798,0.0050560874],"study_design_scores_gemma":[0.00000903158,0.0000074208197,0.0001710117,0.0000118438675,0.0000053841018,0.000094137795,0.00005182521,0.0021132973,0.00069350953,0.9919219,0.004912837,0.000007743175],"about_ca_topic_score_codex":0.00064279675,"about_ca_topic_score_gemma":0.0007056722,"teacher_disagreement_score":0.054587696,"about_ca_system_score_codex":0.0013915933,"about_ca_system_score_gemma":0.0009043929,"threshold_uncertainty_score":0.18261403},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.721262,0.00036249222,0.27198014,0.00067010813,0.000035758683,0.00008646348,0.000398127,0.0005390672,0.004665845],"genre_scores_gemma":[0.9393922,0.00013322326,0.058262244,0.00007794521,0.00004796325,0.000051919582,0.0004526173,0.00008429518,0.0014976294],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99906546,0.00022620775,0.000053670152,0.00030211857,0.00019735309,0.00015514134],"domain_scores_gemma":[0.98995066,0.006107581,0.0012038199,0.0013595662,0.0006682921,0.000710147],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011360889,0.0006009507,0.0009151537,0.0016881557,0.0011749391,0.0014002069,0.001337905,0.00075470516,0.0027159925],"category_scores_gemma":[0.010006308,0.0007113144,0.0007304908,0.0009907627,0.0018386241,0.0032871268,0.0019529001,0.0008437841,0.0003348556],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014986591,0.0006036383,0.035772815,0.0008982193,0.00030101574,0.0013153652,0.0027138104,0.21725541,0.074912965,0.51508856,0.012632938,0.13700657],"study_design_scores_gemma":[0.00008954102,0.0002801819,0.0034486095,0.000054475466,0.000050341994,0.00091711775,0.0004495716,0.2993877,0.013923512,0.6774296,0.003920125,0.000049254442],"about_ca_topic_score_codex":0.0015570801,"about_ca_topic_score_gemma":0.0014109483,"teacher_disagreement_score":0.0027159925,"about_ca_system_score_codex":0.0007838267,"about_ca_system_score_gemma":0.0005345346,"threshold_uncertainty_score":0.009085953},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.70830923,0.0019133029,0.12671597,0.0014096211,0.00030786797,0.000041236064,0.000248672,0.00033607704,0.1607181],"genre_scores_gemma":[0.9836663,0.0003243185,0.009680986,0.00016694676,0.00020599746,0.00004688078,0.00011236155,0.000045085362,0.0057510054],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993705,0.00014584778,0.000028002076,0.0001349529,0.00015597258,0.00016475227],"domain_scores_gemma":[0.99804,0.00091981096,0.00027687816,0.00024713078,0.00020346948,0.00031278716],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061670115,0.00047192976,0.0005100189,0.0020550976,0.0011026006,0.0018755274,0.0006656227,0.00067247206,0.0050327554],"category_scores_gemma":[0.0030560596,0.00023434332,0.0005587297,0.00085625466,0.00296845,0.0021657126,0.0013684715,0.0015510102,0.00048396876],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022320697,0.000010415846,0.00034514753,0.000021293114,0.0000045348543,0.000030979347,0.00011382594,0.0029787067,0.0010066198,0.98871267,0.0007986667,0.00595478],"study_design_scores_gemma":[0.000009240049,0.000028401051,0.0010345118,0.000020556485,0.0000054182287,0.000096539676,0.000071724484,0.023523493,0.0009317441,0.96937144,0.0048885127,0.000018530403],"about_ca_topic_score_codex":0.00081897166,"about_ca_topic_score_gemma":0.00068884075,"teacher_disagreement_score":0.0050327554,"about_ca_system_score_codex":0.0011479176,"about_ca_system_score_gemma":0.0002632785,"threshold_uncertainty_score":0.016836226},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45192838,0.0009325132,0.51126206,0.004036558,0.00018889518,0.00029096552,0.0037779578,0.0028703318,0.02471236],"genre_scores_gemma":[0.6875749,0.0007914704,0.2895139,0.0008262185,0.00016316955,0.00033576292,0.0057864883,0.0010727477,0.013935336],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986578,0.00032415838,0.000069627305,0.00044743862,0.00024166744,0.00025922828],"domain_scores_gemma":[0.9926959,0.004974072,0.00051065325,0.0011228251,0.00034028036,0.00035632058],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001263903,0.00090884854,0.0009992527,0.00083317637,0.001328073,0.0025196595,0.0031027647,0.0014372173,0.00893793],"category_scores_gemma":[0.00795983,0.00088519865,0.0015006013,0.0017226272,0.0014390005,0.008100447,0.0024321931,0.0021940428,0.0018078852],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0017155217,0.0005777412,0.008277726,0.0021326754,0.0002321364,0.00079457986,0.0018379427,0.1962046,0.04236872,0.5032764,0.055430546,0.18715134],"study_design_scores_gemma":[0.00015410181,0.000078643585,0.0011829654,0.00007640716,0.00007138039,0.0004101684,0.00024028057,0.21010846,0.0126077905,0.7637738,0.011250047,0.00004591056],"about_ca_topic_score_codex":0.0028288725,"about_ca_topic_score_gemma":0.005345106,"teacher_disagreement_score":0.00893793,"about_ca_system_score_codex":0.0016498592,"about_ca_system_score_gemma":0.0011209613,"threshold_uncertainty_score":0.029900312},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11567365,0.0009999368,0.8596258,0.0024234015,0.00012976432,0.00024618037,0.00093178934,0.0012131304,0.018756313],"genre_scores_gemma":[0.8669946,0.0015546326,0.10516403,0.0019062121,0.00048880815,0.0011685733,0.002257512,0.0011583178,0.019307397],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9936009,0.0026257015,0.00023534335,0.00164788,0.0012568263,0.0006332915],"domain_scores_gemma":[0.9515074,0.03361725,0.004126249,0.0054980307,0.0029994892,0.0022514958],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006962094,0.0025351932,0.0021570104,0.004025492,0.0018316775,0.0033882307,0.0049189287,0.0031916532,0.010181526],"category_scores_gemma":[0.04289083,0.0019283098,0.002332601,0.002582454,0.0036228884,0.012514177,0.0062832916,0.0052602408,0.0023166211],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021758083,0.00013490423,0.0011291961,0.00025523483,0.00010279232,0.0002610253,0.00043949854,0.07691548,0.0029855391,0.8991653,0.006055059,0.012338391],"study_design_scores_gemma":[0.000101323705,0.0001084841,0.0006519358,0.00007284417,0.0000618369,0.0002390786,0.00008621403,0.46455258,0.002259832,0.5286831,0.0031130072,0.000069821974],"about_ca_topic_score_codex":0.0016436246,"about_ca_topic_score_gemma":0.0015222621,"teacher_disagreement_score":0.010181526,"about_ca_system_score_codex":0.0040175025,"about_ca_system_score_gemma":0.0011467972,"threshold_uncertainty_score":0.036819518},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.88838583,0.00089682284,0.060684714,0.003322388,0.00013856532,0.000038323942,0.00074758404,0.00026097687,0.045524888],"genre_scores_gemma":[0.9823976,0.0005454774,0.00915486,0.00022183494,0.00024986616,0.000077601835,0.0003880332,0.00012291767,0.0068417317],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99886465,0.00030283284,0.00007545133,0.00023156132,0.00033445246,0.00019100905],"domain_scores_gemma":[0.9755697,0.01870498,0.0019274093,0.0012940952,0.0010373605,0.0014664915],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001909337,0.0005237712,0.0013975118,0.0025900158,0.0021048177,0.0062452615,0.0023723363,0.0016372809,0.0075511066],"category_scores_gemma":[0.015125933,0.00073266396,0.0009126568,0.002838061,0.0053882794,0.011190703,0.0030914033,0.0029557832,0.00050537876],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000110390465,0.000033945227,0.0005202826,0.000046125988,0.000011164896,0.000070198505,0.00036996513,0.0031755185,0.0012079237,0.9899182,0.00082380977,0.0037124688],"study_design_scores_gemma":[0.000013303375,0.000014648318,0.00025837676,0.000015159049,0.000010041502,0.00008341161,0.000102505604,0.0073869484,0.00043319742,0.99111485,0.0005566648,0.0000108512],"about_ca_topic_score_codex":0.0008925548,"about_ca_topic_score_gemma":0.00075677066,"teacher_disagreement_score":0.0075511066,"about_ca_system_score_codex":0.0016990039,"about_ca_system_score_gemma":0.00093085115,"threshold_uncertainty_score":0.025260985},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.82454544,0.0011563079,0.074191585,0.0006230759,0.00016275024,0.00003164483,0.000272766,0.0003479118,0.098668456],"genre_scores_gemma":[0.9787279,0.00026950703,0.013463656,0.000101853424,0.00006157271,0.00002407881,0.000089079585,0.00006757992,0.007194706],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99906737,0.0001807261,0.00004859036,0.00023972319,0.00023512263,0.00022855312],"domain_scores_gemma":[0.9986987,0.0005406766,0.00017067713,0.00028883008,0.00018363184,0.0001174772],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057005376,0.00037288805,0.0006487991,0.0011003248,0.0015022283,0.0028019196,0.00080357346,0.00043806166,0.0062062107],"category_scores_gemma":[0.0018871104,0.0003748228,0.0005008956,0.0010986342,0.0024466978,0.0031271547,0.0015804742,0.00094182376,0.00069626916],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000056055113,0.000014365395,0.00029563528,0.00004267149,0.000007447922,0.00015367004,0.0003689379,0.0010451018,0.003045669,0.9888643,0.00058910897,0.005517077],"study_design_scores_gemma":[0.0000143211755,0.000021467102,0.00034898272,0.000019762394,0.000014548964,0.00022646971,0.0001980886,0.0039128275,0.0034934036,0.9845061,0.007229639,0.000014397342],"about_ca_topic_score_codex":0.0020181886,"about_ca_topic_score_gemma":0.0023506281,"teacher_disagreement_score":0.0062062107,"about_ca_system_score_codex":0.0011083939,"about_ca_system_score_gemma":0.00033591248,"threshold_uncertainty_score":0.020761847},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015018138,0.14279924,0.02218347,0.06052518,0.0035234634,0.000030089586,0.00019234236,0.00018787333,0.75554025],"genre_scores_gemma":[0.566129,0.044803686,0.012802569,0.0069792485,0.0032989336,0.00013268027,0.00020395136,0.0005913241,0.36505863],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994178,0.0003325272,0.000016389837,0.000083235725,0.00009593914,0.00005407751],"domain_scores_gemma":[0.9993242,0.0004742757,0.00003254904,0.00006346689,0.000068845104,0.00003664036],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001153638,0.00052289275,0.0005253274,0.0015418233,0.0023685927,0.005439739,0.00056408136,0.0016224333,0.0093898615],"category_scores_gemma":[0.0026058485,0.0004097711,0.00022155832,0.0015776153,0.01523106,0.010048525,0.0022678776,0.003385363,0.001982264],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008217736,0.0000066631806,0.000031268726,0.00002253334,0.0000014993736,0.000013019588,0.001150868,0.00007212616,0.00003146835,0.98049587,0.012402012,0.0057645263],"study_design_scores_gemma":[0.0000044401986,0.000004075834,0.00007011747,0.00009353423,0.0000018467078,0.000039466475,0.00092752243,0.00013734149,0.000074588075,0.82018656,0.17845461,0.000005799528],"about_ca_topic_score_codex":0.0031979673,"about_ca_topic_score_gemma":0.0051093837,"teacher_disagreement_score":0.0093898615,"about_ca_system_score_codex":0.0030031092,"about_ca_system_score_gemma":0.0015785025,"threshold_uncertainty_score":0.031412184},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30602342,0.010787929,0.24908876,0.028272241,0.002439001,0.00010189658,0.0008867584,0.0004544463,0.40194544],"genre_scores_gemma":[0.90572613,0.0048622815,0.028730175,0.0023831066,0.0033300132,0.00020833574,0.0004246208,0.00028921379,0.054046173],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979595,0.0008134499,0.00007886967,0.00043956278,0.00045167227,0.00025687768],"domain_scores_gemma":[0.9911823,0.0062096375,0.00065582054,0.00040366343,0.0006745118,0.0008740468],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028623764,0.001063478,0.0023276107,0.008066519,0.004262153,0.0053057163,0.0029242493,0.003281434,0.011441761],"category_scores_gemma":[0.016152948,0.0010258934,0.0014087899,0.0062236898,0.010682257,0.018314268,0.0047384286,0.00629209,0.0012588222],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008821564,0.000005705306,0.00006065543,0.000011857338,0.0000015702393,0.000008227489,0.000073367184,0.0003091373,0.000033793654,0.9975141,0.00073866383,0.0012342058],"study_design_scores_gemma":[0.0000039266984,0.000003217449,0.000079531725,0.000010223297,0.0000028495124,0.00002188293,0.00003209749,0.0020136808,0.000050350685,0.9961085,0.0016654405,0.00000837135],"about_ca_topic_score_codex":0.0053409403,"about_ca_topic_score_gemma":0.00354969,"teacher_disagreement_score":0.011441761,"about_ca_system_score_codex":0.004170941,"about_ca_system_score_gemma":0.0013780352,"threshold_uncertainty_score":0.038276553},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41552767,0.0010739298,0.5412369,0.0023585248,0.00026009386,0.00017347165,0.0004590498,0.0014979778,0.03741244],"genre_scores_gemma":[0.8540655,0.00035697376,0.13045596,0.0005255347,0.00010639308,0.00017158016,0.00025126373,0.00031910377,0.013747722],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9967179,0.00082564703,0.00013499692,0.0010484514,0.0006287098,0.0006444139],"domain_scores_gemma":[0.98407894,0.009928143,0.0008390747,0.0032926633,0.0008753708,0.0009856825],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031119846,0.00093837484,0.0013480546,0.001229756,0.0019603774,0.0028113346,0.0042706486,0.0029411414,0.010041536],"category_scores_gemma":[0.018754542,0.00088376517,0.0014030902,0.0016818879,0.002790007,0.008931752,0.004801005,0.0029249303,0.001502224],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007325042,0.0002571864,0.0037754679,0.0005008434,0.000112224145,0.00053534016,0.000979229,0.07857304,0.030067418,0.8221646,0.0068303337,0.055471763],"study_design_scores_gemma":[0.0001403275,0.00021755624,0.0005389549,0.000051024796,0.00007323603,0.0005652729,0.00023625104,0.19638303,0.016250988,0.77290887,0.012582386,0.00005205916],"about_ca_topic_score_codex":0.00095688313,"about_ca_topic_score_gemma":0.0014519659,"teacher_disagreement_score":0.010041536,"about_ca_system_score_codex":0.002202364,"about_ca_system_score_gemma":0.0009976997,"threshold_uncertainty_score":0.033592284},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.86091334,0.0011283164,0.08604263,0.0011923139,0.000054966753,0.000052566375,0.0004015757,0.00029850687,0.049915668],"genre_scores_gemma":[0.9857971,0.0002641314,0.011575794,0.00009302999,0.00003981293,0.000042000658,0.00017543253,0.00002655079,0.0019859867],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992908,0.0002107894,0.000034568107,0.00014975258,0.00021021604,0.000103843005],"domain_scores_gemma":[0.9968526,0.0016307448,0.00044193584,0.00041502458,0.00027701518,0.00038275754],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00087540934,0.00024642356,0.00047080152,0.0017214818,0.0016206693,0.0014555008,0.00076302397,0.0008735924,0.0028446852],"category_scores_gemma":[0.003938921,0.00039060498,0.00056967,0.001018551,0.0028116833,0.0032126599,0.0014529112,0.00102759,0.00016436528],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027149637,0.000015930369,0.0014679462,0.00004926875,0.000009509701,0.00019539092,0.00034263096,0.0033225198,0.0007664845,0.989791,0.000848582,0.0031636595],"study_design_scores_gemma":[0.000020582202,0.000025096728,0.0015315529,0.00003244161,0.000015226901,0.0009286189,0.00029617306,0.028491622,0.001114391,0.9616287,0.005894187,0.000021445294],"about_ca_topic_score_codex":0.00077138253,"about_ca_topic_score_gemma":0.0007829164,"teacher_disagreement_score":0.0028446852,"about_ca_system_score_codex":0.001371714,"about_ca_system_score_gemma":0.00025759445,"threshold_uncertainty_score":0.009952486},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.068889454,0.011505371,0.10306962,0.01683188,0.0026104283,0.000047522863,0.00048548658,0.0004695709,0.7960906],"genre_scores_gemma":[0.83399886,0.0047690156,0.013626703,0.0027185394,0.00294999,0.00013074912,0.00036425272,0.00035629497,0.14108565],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99900323,0.00038886844,0.000044841756,0.00021211451,0.00023079969,0.000120063996],"domain_scores_gemma":[0.99855846,0.0006286019,0.00014405043,0.00023836557,0.00020963071,0.00022088985],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009904348,0.0007755177,0.0010324277,0.0023515455,0.0033421938,0.0065729436,0.0011071907,0.0017229979,0.017049855],"category_scores_gemma":[0.004305148,0.0005521307,0.0007230951,0.0021077131,0.009699482,0.012492351,0.0032647077,0.004630786,0.0024464617],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000013677222,0.0000014582117,0.000009125522,0.00000359069,6.40193e-7,0.0000048940938,0.00004587124,0.000033634962,0.000013260156,0.9988844,0.00058741675,0.00041447315],"study_design_scores_gemma":[0.0000013318389,0.0000010132783,0.000011043719,0.0000031903453,8.048153e-7,0.000017124985,0.000042438907,0.00011635664,0.000021234768,0.9954336,0.0043501663,0.0000015592527],"about_ca_topic_score_codex":0.0013344034,"about_ca_topic_score_gemma":0.00087212026,"teacher_disagreement_score":0.017049855,"about_ca_system_score_codex":0.0017445724,"about_ca_system_score_gemma":0.00083781534,"threshold_uncertainty_score":0.057037413},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6731144,0.0023123503,0.25703365,0.0078007677,0.0010444032,0.00021007148,0.0036173281,0.0029927217,0.05187425],"genre_scores_gemma":[0.846962,0.001217121,0.11662238,0.0017377262,0.00071733515,0.0001652261,0.0042270767,0.001011406,0.027339716],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99864453,0.00018668218,0.00010138137,0.00055016635,0.00025593053,0.00026125574],"domain_scores_gemma":[0.98370427,0.008523013,0.0015651506,0.0035512422,0.0009610674,0.0016952333],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011103785,0.00096675893,0.0019607618,0.0010921005,0.002482697,0.0037227485,0.0027212908,0.003070323,0.016174074],"category_scores_gemma":[0.012821358,0.0012939705,0.0016931639,0.0018314535,0.0016529418,0.010769154,0.0028705674,0.0042801914,0.004180634],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0024997634,0.0014218915,0.013133237,0.0030679835,0.0006587576,0.0029605865,0.0013927363,0.09210985,0.045726243,0.38355598,0.11900044,0.33447245],"study_design_scores_gemma":[0.000058458067,0.00010883548,0.0018735708,0.00011147468,0.00006645611,0.0009577522,0.00041933233,0.051846713,0.007729952,0.92892396,0.007863265,0.00004012855],"about_ca_topic_score_codex":0.0008456273,"about_ca_topic_score_gemma":0.0012267716,"teacher_disagreement_score":0.016174074,"about_ca_system_score_codex":0.00051332614,"about_ca_system_score_gemma":0.0007200214,"threshold_uncertainty_score":0.054107666},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.74999386,0.00086049055,0.23255344,0.000938481,0.00007275312,0.000063306914,0.0006781088,0.00042507343,0.014414472],"genre_scores_gemma":[0.98086953,0.00026561655,0.016456245,0.0001425301,0.00004731491,0.00005511158,0.0002473546,0.00009225582,0.0018239253],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99851125,0.0003954362,0.00009011011,0.00047274018,0.00028235203,0.0002481035],"domain_scores_gemma":[0.990182,0.0052525713,0.00097127404,0.0017146425,0.00077823765,0.0011013914],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017094446,0.0004967677,0.0010986845,0.0014257466,0.0008960817,0.002136394,0.0017460304,0.0007046551,0.0042914995],"category_scores_gemma":[0.013356757,0.00067519356,0.000616747,0.0010580443,0.0019583679,0.005775417,0.0025559464,0.0015523444,0.00044300623],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013303291,0.00016530608,0.008361233,0.00044927094,0.00014925546,0.0003626259,0.0009174519,0.07205859,0.02005905,0.85665596,0.0043779365,0.035113007],"study_design_scores_gemma":[0.000059156057,0.00010946826,0.0018486136,0.0000541084,0.000076473865,0.00063609006,0.00028487114,0.32719418,0.009439018,0.65564907,0.0046073226,0.00004160402],"about_ca_topic_score_codex":0.0005926371,"about_ca_topic_score_gemma":0.00062427303,"teacher_disagreement_score":0.0042914995,"about_ca_system_score_codex":0.00094498496,"about_ca_system_score_gemma":0.00043754143,"threshold_uncertainty_score":0.014356494},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.65494335,0.00048602736,0.32533708,0.0021334332,0.000083527906,0.00010806203,0.00014449062,0.00024012121,0.016523883],"genre_scores_gemma":[0.97800475,0.00023856695,0.017490856,0.00019706294,0.00005897073,0.00012198667,0.000074753014,0.00005053847,0.003762508],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985066,0.0007679558,0.00004280073,0.00025107377,0.00026008018,0.00017139553],"domain_scores_gemma":[0.97032374,0.023547197,0.0017101604,0.0019729175,0.0013857929,0.0010601785],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005165565,0.00037163726,0.00088296545,0.0012377511,0.00092749717,0.0016788578,0.001783487,0.0015825733,0.0039267605],"category_scores_gemma":[0.029134803,0.00034395108,0.00073945423,0.0006569627,0.0043780426,0.004029549,0.0017746026,0.0017408927,0.0003691048],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008317869,0.000029260518,0.00093800423,0.00003453204,0.000015118438,0.000074718846,0.0001682021,0.03454301,0.0016621958,0.9588394,0.0005172111,0.0030950825],"study_design_scores_gemma":[0.000054416145,0.00007285686,0.0008905025,0.000023848133,0.000017993792,0.00012570698,0.00013081558,0.4087405,0.0014427517,0.5875412,0.0009207844,0.00003861598],"about_ca_topic_score_codex":0.00160605,"about_ca_topic_score_gemma":0.001112123,"teacher_disagreement_score":0.005165565,"about_ca_system_score_codex":0.0014437035,"about_ca_system_score_gemma":0.0007748304,"threshold_uncertainty_score":0.027318418},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42101583,0.0021151337,0.13154666,0.016988264,0.0011492069,0.00010271847,0.00092256075,0.00082970713,0.42532998],"genre_scores_gemma":[0.96607447,0.0005964474,0.016152985,0.0016448083,0.0005954897,0.000057531066,0.00023630513,0.000100020676,0.014542048],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99793136,0.0004673406,0.00011890438,0.00063351897,0.0005098582,0.00033891384],"domain_scores_gemma":[0.9914562,0.0043388065,0.0006170056,0.0016803449,0.0012322449,0.0006754356],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026436802,0.0003660191,0.00081992545,0.0021308458,0.003280843,0.0027724497,0.0015493466,0.0011602339,0.0077446643],"category_scores_gemma":[0.009727254,0.00045663596,0.0010478331,0.0017079423,0.004791971,0.007442164,0.0034612552,0.0024003456,0.00072703575],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003748769,0.0000111226,0.00033793572,0.000026212865,0.0000060710254,0.00016558985,0.00021761707,0.0004644483,0.0007109252,0.9915889,0.0024505185,0.003983265],"study_design_scores_gemma":[0.000029743687,0.000025503534,0.00058795343,0.000033284676,0.000012776009,0.00035343223,0.00012369493,0.004533974,0.0013132114,0.97173405,0.021230258,0.000022037919],"about_ca_topic_score_codex":0.00822937,"about_ca_topic_score_gemma":0.0060893837,"teacher_disagreement_score":0.00822937,"about_ca_system_score_codex":0.0029142657,"about_ca_system_score_gemma":0.001203701,"threshold_uncertainty_score":0.02590853},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7393279,0.0017173835,0.14625585,0.0010814918,0.00015331095,0.000047000896,0.00039050583,0.00021109387,0.110815465],"genre_scores_gemma":[0.9761593,0.0006666582,0.014064778,0.00015689478,0.000119421195,0.000051765062,0.00044273943,0.000091626825,0.008246927],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99945253,0.00016292358,0.000025749532,0.000088712564,0.00016661358,0.00010357484],"domain_scores_gemma":[0.99831474,0.0008326622,0.00031053528,0.0001379908,0.00015156438,0.00025257346],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066241674,0.00077348255,0.00065220834,0.0019252497,0.0012997474,0.0016839587,0.0011999249,0.0009572447,0.00552701],"category_scores_gemma":[0.0036310563,0.00036746342,0.00049402344,0.0010272098,0.0015251581,0.0032115255,0.0015862618,0.0013852167,0.0004956961],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000085972046,0.000041824453,0.0006685639,0.00013370148,0.000016592618,0.000115196126,0.00015490397,0.0143059,0.0023373791,0.9723403,0.0016381957,0.008161477],"study_design_scores_gemma":[0.000017870772,0.00003790527,0.00067205325,0.00004222847,0.000018079685,0.00023062572,0.00017485797,0.055520926,0.002138115,0.93739456,0.0037250314,0.000027724971],"about_ca_topic_score_codex":0.00038959848,"about_ca_topic_score_gemma":0.0006446614,"teacher_disagreement_score":0.00552701,"about_ca_system_score_codex":0.00096790405,"about_ca_system_score_gemma":0.00033573864,"threshold_uncertainty_score":0.018489718},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.71623075,0.0015630068,0.22435504,0.0008288972,0.000089077796,0.00006871808,0.00026082803,0.00014952561,0.05645421],"genre_scores_gemma":[0.9461671,0.0007250464,0.04398778,0.00012919329,0.00007981806,0.00010026659,0.00019971776,0.000053280495,0.0085578],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993937,0.00025826602,0.000023518944,0.00014409532,0.00009329258,0.00008713657],"domain_scores_gemma":[0.9979159,0.0012090193,0.0003224997,0.00012466013,0.0002120769,0.00021577335],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000740688,0.00040003844,0.00040101763,0.001146818,0.00070091285,0.0011132987,0.0006713178,0.00045122675,0.0035820736],"category_scores_gemma":[0.0036491025,0.00037791935,0.00044805947,0.0006434798,0.0018418763,0.0018194112,0.0008956186,0.00082337233,0.00034134387],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008371884,0.000019479354,0.0012594996,0.00009979589,0.000015543126,0.00010037086,0.000319597,0.0154927,0.0022564563,0.97096497,0.0018641776,0.0075237816],"study_design_scores_gemma":[0.00003535652,0.000101504935,0.0012931855,0.00003938291,0.000030102794,0.0004563562,0.00019691192,0.11742694,0.0018061032,0.87022066,0.008365542,0.000027963228],"about_ca_topic_score_codex":0.0010371282,"about_ca_topic_score_gemma":0.0009383087,"teacher_disagreement_score":0.0035820736,"about_ca_system_score_codex":0.00063342875,"about_ca_system_score_gemma":0.0004580013,"threshold_uncertainty_score":0.011983156},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15954697,0.18250954,0.030314343,0.27214855,0.011575256,0.0000586253,0.0009622832,0.00029865545,0.3425858],"genre_scores_gemma":[0.8428506,0.06879462,0.008201598,0.018286001,0.013723989,0.00009367796,0.0004542059,0.00016170132,0.04743365],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984383,0.00054099556,0.000074294556,0.00037242981,0.00039986265,0.00017413452],"domain_scores_gemma":[0.99135953,0.0056125885,0.00041830316,0.0012576819,0.00087798125,0.0004739132],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0041714725,0.00035762653,0.00076255796,0.0016008926,0.0019368368,0.0038364162,0.0006644397,0.002262651,0.0068422933],"category_scores_gemma":[0.016060932,0.00039229693,0.0004246708,0.0020809567,0.0110376915,0.014622801,0.0036779356,0.0043690125,0.0014029499],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000670539,0.000022036538,0.00037922236,0.00007660038,0.000010429496,0.00004348036,0.0005629237,0.00056869903,0.00014551402,0.9628545,0.011521451,0.02374806],"study_design_scores_gemma":[0.00001396002,0.000015991725,0.00052306114,0.00015887209,0.0000066024645,0.00005493678,0.00033584808,0.00055063795,0.00015933625,0.8796591,0.118504345,0.000017200176],"about_ca_topic_score_codex":0.0015925127,"about_ca_topic_score_gemma":0.0014298768,"teacher_disagreement_score":0.0068422933,"about_ca_system_score_codex":0.0029251932,"about_ca_system_score_gemma":0.001013431,"threshold_uncertainty_score":0.022889733},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48047477,0.00047406307,0.49937403,0.0015747251,0.000048626483,0.000110807225,0.00020857352,0.00033386424,0.017400537],"genre_scores_gemma":[0.973722,0.0002257632,0.020690722,0.00022478956,0.00003805092,0.000116102055,0.0000981224,0.00006380089,0.004820638],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983335,0.0008733445,0.00005371314,0.00022136956,0.00027402467,0.00024398489],"domain_scores_gemma":[0.9911022,0.005378135,0.0011833754,0.0012331118,0.00048424705,0.00061889045],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025128352,0.00043534805,0.0008334428,0.0010178544,0.0008648995,0.0015178806,0.0016133884,0.0015795842,0.0050955787],"category_scores_gemma":[0.011596443,0.0005324442,0.00071048987,0.0008447788,0.0030754707,0.0046570967,0.0020290492,0.0015115602,0.00045586698],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000093751056,0.000045963065,0.00047883467,0.000045109406,0.000018503402,0.00011460861,0.00012850462,0.074299864,0.0012998133,0.91869575,0.0009276515,0.0038516861],"study_design_scores_gemma":[0.000042438685,0.0000495739,0.00018436598,0.00001425323,0.00001023964,0.0000753668,0.00007175478,0.3581682,0.0007501901,0.63954264,0.0010711823,0.00001977318],"about_ca_topic_score_codex":0.001822836,"about_ca_topic_score_gemma":0.0015243313,"teacher_disagreement_score":0.0050955787,"about_ca_system_score_codex":0.0018237481,"about_ca_system_score_gemma":0.0009659311,"threshold_uncertainty_score":0.017046392},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29193884,0.008256953,0.40242276,0.005722608,0.00091201364,0.00014653604,0.000974511,0.00062554196,0.28900018],"genre_scores_gemma":[0.92335224,0.0017203845,0.051177096,0.0009806555,0.00039568217,0.00024001101,0.00044812684,0.00021390061,0.021471757],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999491,0.00012185787,0.000034451597,0.00010926018,0.00014796514,0.000095420655],"domain_scores_gemma":[0.9993592,0.00028055476,0.000076136195,0.00007345405,0.00012490831,0.00008581532],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00082815177,0.0006224259,0.0004950834,0.0029082084,0.0024303324,0.0031268706,0.00067157444,0.00084757054,0.0045443815],"category_scores_gemma":[0.0015272298,0.0003897885,0.0009194717,0.0016031937,0.0052942275,0.003896921,0.0020483627,0.0018062957,0.0011561039],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008619154,0.0000039133033,0.000092520444,0.000017495275,0.00000257936,0.000041712774,0.00016457541,0.00023551373,0.00048031833,0.9966186,0.0005648627,0.0017692501],"study_design_scores_gemma":[0.000005166366,0.00001132307,0.0002097932,0.000018723664,0.0000070510932,0.00010380991,0.00015445049,0.0017059288,0.00096821936,0.98652446,0.010279192,0.000011875397],"about_ca_topic_score_codex":0.0013610169,"about_ca_topic_score_gemma":0.001540986,"teacher_disagreement_score":0.0045443815,"about_ca_system_score_codex":0.002011141,"about_ca_system_score_gemma":0.00065566663,"threshold_uncertainty_score":0.015202463},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41604933,0.009853283,0.29129353,0.007414175,0.0012378661,0.00010789026,0.0011164269,0.001194998,0.27173242],"genre_scores_gemma":[0.91509855,0.0034165948,0.042521376,0.00086634775,0.001229254,0.00012464426,0.0005358408,0.0002651579,0.035942227],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99803203,0.0006891084,0.00015681582,0.0004247898,0.0004659391,0.00023130742],"domain_scores_gemma":[0.9930227,0.004064506,0.000760151,0.0006521792,0.0006642863,0.0008362211],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027555788,0.0010350868,0.0017683088,0.008315299,0.0040281652,0.0070108594,0.0028960167,0.0026269073,0.008826306],"category_scores_gemma":[0.008195848,0.0014186146,0.0013499825,0.0059733074,0.008279237,0.016501704,0.0054381327,0.005734712,0.0012398857],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008383926,0.000007983178,0.000060976192,0.000021525188,0.0000020643624,0.000024747662,0.00015427351,0.00019718961,0.00008840303,0.99805224,0.00023107837,0.0011511691],"study_design_scores_gemma":[0.0000053977146,0.000003853032,0.00005352654,0.000018349578,0.0000036953281,0.000052225645,0.00007721189,0.0010005287,0.00009740718,0.99750537,0.0011743506,0.000008113027],"about_ca_topic_score_codex":0.0017150227,"about_ca_topic_score_gemma":0.0014571595,"teacher_disagreement_score":0.008826306,"about_ca_system_score_codex":0.0034361912,"about_ca_system_score_gemma":0.00080738706,"threshold_uncertainty_score":0.029526949},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6803673,0.003050663,0.23745383,0.005778972,0.00028501143,0.00030292151,0.0019950282,0.00087307283,0.06989322],"genre_scores_gemma":[0.9420085,0.0013485111,0.03845403,0.0005874632,0.00016269863,0.00025044582,0.0011995403,0.00013797077,0.015850779],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986727,0.00048742507,0.000070256276,0.00036992843,0.00019182112,0.00020793926],"domain_scores_gemma":[0.99615675,0.002144074,0.00075181614,0.00034331187,0.00026721475,0.0003368486],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009773555,0.0006981638,0.0010884783,0.0012202977,0.0011812842,0.0020930662,0.0015050239,0.0014396625,0.00634706],"category_scores_gemma":[0.005709826,0.0007143881,0.0011961375,0.0014746744,0.001602188,0.004159486,0.002129134,0.0015621486,0.00101832],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005939701,0.00011035495,0.0023453257,0.00040624253,0.00012752075,0.000492492,0.000584415,0.05079459,0.0040714005,0.88988024,0.016088864,0.034504578],"study_design_scores_gemma":[0.00022773557,0.00009733291,0.0020459166,0.0000907066,0.00011790284,0.00074902555,0.00050665543,0.13513991,0.0040183957,0.83181995,0.025111586,0.00007483112],"about_ca_topic_score_codex":0.0026109768,"about_ca_topic_score_gemma":0.0019624534,"teacher_disagreement_score":0.00634706,"about_ca_system_score_codex":0.0016319574,"about_ca_system_score_gemma":0.0007053642,"threshold_uncertainty_score":0.021233022},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.62709224,0.0011640853,0.31304017,0.003712037,0.00020200778,0.00023031388,0.0015467876,0.0008708492,0.052141454],"genre_scores_gemma":[0.9595966,0.00042672426,0.03254961,0.0006079591,0.0001820744,0.00024791533,0.00076848833,0.0001205499,0.0055001765],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979372,0.0004891911,0.00020364787,0.00058061455,0.00040355173,0.00038583894],"domain_scores_gemma":[0.986498,0.00969603,0.0010549038,0.00087156775,0.0007414888,0.0011380387],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021222006,0.0006385813,0.000971796,0.0010733963,0.0011473366,0.0025889075,0.0019194384,0.001652225,0.008592238],"category_scores_gemma":[0.014982426,0.0006765882,0.0010001808,0.001249985,0.0022313697,0.009763003,0.0026187967,0.0024462102,0.0005244111],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00043164258,0.00017828296,0.0037505173,0.00039641833,0.00006532477,0.0004102775,0.0007401219,0.020739002,0.008639853,0.9391988,0.0064412556,0.019008601],"study_design_scores_gemma":[0.000059790975,0.00007363476,0.001150061,0.000038515296,0.000025638641,0.00036767623,0.00024399241,0.06510563,0.002663523,0.92778647,0.0024494962,0.00003570085],"about_ca_topic_score_codex":0.0009758747,"about_ca_topic_score_gemma":0.00073967205,"teacher_disagreement_score":0.008592238,"about_ca_system_score_codex":0.0015748071,"about_ca_system_score_gemma":0.0008055081,"threshold_uncertainty_score":0.028743923},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.246215,0.0038607842,0.55369365,0.005969831,0.0006015092,0.0002104537,0.0014354632,0.002527501,0.1854858],"genre_scores_gemma":[0.8757457,0.001976694,0.08882926,0.0016614713,0.00057383004,0.00028828182,0.0014376245,0.0009975395,0.028489564],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99703467,0.0005569708,0.0001298482,0.0007651578,0.0008479975,0.0006653876],"domain_scores_gemma":[0.9800978,0.013114843,0.0010495541,0.0035157555,0.0013568717,0.0008652495],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002036201,0.0008197864,0.0010000122,0.0018600684,0.0020831234,0.0032983378,0.0023109424,0.0013862455,0.011622905],"category_scores_gemma":[0.01454893,0.0006297775,0.0016291941,0.002097637,0.003321555,0.009535843,0.0044091777,0.0054045976,0.002647437],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00036034692,0.00013519649,0.0016912306,0.0005147672,0.00008548353,0.000426851,0.0005129231,0.021940075,0.010399347,0.9052408,0.015824532,0.042868376],"study_design_scores_gemma":[0.00005445331,0.000057038826,0.00093190523,0.00007469792,0.00008922854,0.00042058298,0.00012813142,0.068259895,0.016553722,0.8854254,0.0279571,0.00004782792],"about_ca_topic_score_codex":0.0020828985,"about_ca_topic_score_gemma":0.0022701824,"teacher_disagreement_score":0.011622905,"about_ca_system_score_codex":0.0029632824,"about_ca_system_score_gemma":0.0012066362,"threshold_uncertainty_score":0.038882494},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14182067,0.002691693,0.7637954,0.0037155391,0.00097187154,0.000068296795,0.00031747366,0.0004342536,0.08618479],"genre_scores_gemma":[0.7998972,0.0028183686,0.15165225,0.0021678742,0.001681788,0.0003426835,0.00051419536,0.00085141894,0.04007424],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976525,0.00082209206,0.00019299735,0.00035142837,0.0007539244,0.00022714875],"domain_scores_gemma":[0.991958,0.0052068816,0.0005301998,0.0005209367,0.0010481115,0.0007358488],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004964146,0.0012995284,0.0014630808,0.0045859944,0.0020395983,0.005169793,0.0021513423,0.002084594,0.00761011],"category_scores_gemma":[0.014818381,0.00086117804,0.0026373032,0.0020027508,0.006362473,0.011698173,0.0051238844,0.007306996,0.00087253883],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009537677,0.000012086422,0.000062699975,0.000023344604,0.0000073840556,0.000024638577,0.00012286894,0.0005070297,0.00022648313,0.9973137,0.00029030576,0.0013998757],"study_design_scores_gemma":[0.0000048440606,0.0000073416736,0.000068322086,0.000011083154,0.000005068386,0.0000438822,0.00003854819,0.0080795055,0.00020589086,0.9909032,0.00062283175,0.000009603625],"about_ca_topic_score_codex":0.0012839185,"about_ca_topic_score_gemma":0.00091909384,"teacher_disagreement_score":0.00761011,"about_ca_system_score_codex":0.0023641144,"about_ca_system_score_gemma":0.0009926396,"threshold_uncertainty_score":0.026253223},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6107336,0.00380142,0.08763264,0.003938344,0.00068597397,0.00007938279,0.00088400586,0.0005065252,0.29173806],"genre_scores_gemma":[0.9491571,0.0016259119,0.012741918,0.0005180647,0.0005017215,0.00017647826,0.0003506289,0.00014105222,0.03478717],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992156,0.00029428402,0.000046577905,0.00012751088,0.0001635429,0.00015249211],"domain_scores_gemma":[0.99676466,0.0019510295,0.00044357523,0.00019055586,0.00031222752,0.00033793252],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00088107964,0.0006769955,0.0006051631,0.0047870115,0.0017057575,0.0039978093,0.0014462658,0.0011061756,0.010750634],"category_scores_gemma":[0.005894689,0.0006367295,0.00059199467,0.0030696606,0.0032818676,0.0055620256,0.0018038969,0.0024187164,0.0012857689],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027385298,0.000009274452,0.0001677217,0.00003479982,0.0000048705983,0.000024239502,0.00019451103,0.00090029516,0.00021141255,0.99359137,0.0009731545,0.0038608985],"study_design_scores_gemma":[0.0000068055965,0.000010169661,0.0003349359,0.00001880984,0.00000907409,0.00006640401,0.0000783685,0.0030907062,0.00028361153,0.992871,0.003216156,0.000013957293],"about_ca_topic_score_codex":0.0012191162,"about_ca_topic_score_gemma":0.0011432535,"teacher_disagreement_score":0.010750634,"about_ca_system_score_codex":0.001669023,"about_ca_system_score_gemma":0.0006801812,"threshold_uncertainty_score":0.03596443},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.84030503,0.0007435854,0.14684543,0.001815656,0.000056876637,0.000054346958,0.0003752351,0.00033198303,0.009471917],"genre_scores_gemma":[0.9746684,0.00020942916,0.022378376,0.00021101758,0.000051352978,0.00005118835,0.00026396321,0.00007697755,0.0020893002],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985362,0.00051399134,0.00006360072,0.0003911905,0.0003013584,0.00019363883],"domain_scores_gemma":[0.9901599,0.006215111,0.001178637,0.0010317671,0.0006081798,0.00080653414],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001370041,0.00033687876,0.00090506434,0.00087929197,0.0011269378,0.0014158188,0.0015143349,0.0012462676,0.0036673588],"category_scores_gemma":[0.015123112,0.0007814729,0.0005305126,0.00095737743,0.0019561055,0.003827446,0.00180104,0.0015519749,0.00032927227],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00061163254,0.0001275904,0.010134089,0.00035593458,0.00008315382,0.0004812996,0.0008935156,0.142252,0.010678395,0.8073462,0.0040694405,0.0229667],"study_design_scores_gemma":[0.00007095121,0.00010278877,0.0018496361,0.000048400627,0.0000232047,0.000334058,0.00033760708,0.24409093,0.004068156,0.7449863,0.0040545934,0.000033412216],"about_ca_topic_score_codex":0.0016886378,"about_ca_topic_score_gemma":0.001475265,"teacher_disagreement_score":0.0036673588,"about_ca_system_score_codex":0.0018158737,"about_ca_system_score_gemma":0.000577873,"threshold_uncertainty_score":0.01317513},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49698606,0.002351952,0.3878249,0.0013353579,0.0004046832,0.00010826802,0.000247991,0.0005277088,0.110213056],"genre_scores_gemma":[0.91618276,0.000875421,0.06782882,0.00038335347,0.00016808033,0.00012009502,0.00013509346,0.00008321223,0.014223212],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990095,0.0003182742,0.000055875083,0.00020684561,0.00026010224,0.00014945207],"domain_scores_gemma":[0.99860543,0.0005410232,0.00021993936,0.00022097293,0.00018151083,0.00023101339],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012782376,0.0005563887,0.00042083891,0.0015466132,0.0015061486,0.0013722739,0.001051109,0.0007815813,0.0046266625],"category_scores_gemma":[0.0029846588,0.00039585037,0.00074126926,0.00104585,0.0030247604,0.005086806,0.0022482087,0.0018383126,0.0006721888],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012009425,0.000008775906,0.00010593364,0.000025334302,0.0000032991763,0.000045307923,0.00015644978,0.0016502059,0.0006508035,0.9938506,0.00040123242,0.0030900093],"study_design_scores_gemma":[0.000009421889,0.000025877169,0.00013658912,0.000016069676,0.0000040878354,0.00011174636,0.00009175444,0.006052669,0.0005292808,0.9893612,0.0036463437,0.000015064151],"about_ca_topic_score_codex":0.0011182374,"about_ca_topic_score_gemma":0.0011766073,"teacher_disagreement_score":0.0046266625,"about_ca_system_score_codex":0.0011510783,"about_ca_system_score_gemma":0.0005595733,"threshold_uncertainty_score":0.015477717},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6866066,0.0016932297,0.20941052,0.0030039786,0.00024339528,0.00009232368,0.00078094966,0.00056461233,0.09760444],"genre_scores_gemma":[0.9677711,0.0005177499,0.019473681,0.00040751128,0.0001536598,0.000098546094,0.0004209723,0.000094126284,0.011062726],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987919,0.00028761977,0.000057530866,0.00029710744,0.00029868443,0.0002672171],"domain_scores_gemma":[0.9962614,0.0022783203,0.0003803753,0.00029338486,0.00025907648,0.00052742235],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011501461,0.0007402456,0.0007370063,0.0014729679,0.001640654,0.0037085845,0.0011168758,0.00089279213,0.010489908],"category_scores_gemma":[0.0064280233,0.00054037565,0.00057925936,0.0011999216,0.0027380057,0.0064526955,0.0028361536,0.002432331,0.0011766069],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000089354704,0.00003718533,0.00032842913,0.000053480126,0.0000063221123,0.000048272712,0.00020061599,0.0037565117,0.0009781949,0.9879071,0.0016614712,0.0049329977],"study_design_scores_gemma":[0.000029876739,0.000033651442,0.00038234092,0.000040072977,0.000009580384,0.0001097032,0.00013895413,0.035698265,0.0012216943,0.9587201,0.0035874352,0.000028389857],"about_ca_topic_score_codex":0.0017956516,"about_ca_topic_score_gemma":0.0019456827,"teacher_disagreement_score":0.010489908,"about_ca_system_score_codex":0.0019469302,"about_ca_system_score_gemma":0.00079778826,"threshold_uncertainty_score":0.035092235},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5672765,0.0005669364,0.39383897,0.0010782167,0.00014775393,0.00026174568,0.00071251194,0.0005618538,0.035555538],"genre_scores_gemma":[0.95208114,0.00019864882,0.04099023,0.0003099779,0.0000924373,0.00020809485,0.00047549533,0.00013831232,0.005505655],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99344265,0.0021097357,0.00023879722,0.002003859,0.0014528019,0.0007522412],"domain_scores_gemma":[0.9823064,0.007832595,0.0020760954,0.0032033254,0.002559578,0.0020219728],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024526406,0.0006159337,0.0012303822,0.0030374741,0.002633254,0.0032858693,0.0022008407,0.0014368752,0.0059618345],"category_scores_gemma":[0.017202826,0.00072539895,0.00094110164,0.0020991566,0.005202693,0.006729667,0.0056182593,0.0018556489,0.0007058605],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026545257,0.00007468677,0.0044690496,0.00016404138,0.00008142808,0.000507115,0.0009140118,0.009502465,0.005730739,0.95508826,0.0027024657,0.0205003],"study_design_scores_gemma":[0.000025764466,0.000115125265,0.0012310867,0.000035676352,0.00003751347,0.00073109183,0.0005047621,0.027139492,0.0027570825,0.96111184,0.0062753484,0.000035264715],"about_ca_topic_score_codex":0.0011515706,"about_ca_topic_score_gemma":0.0011590674,"teacher_disagreement_score":0.0059618345,"about_ca_system_score_codex":0.0017528889,"about_ca_system_score_gemma":0.0009222035,"threshold_uncertainty_score":0.01994431},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8160239,0.0018512605,0.066917814,0.0014460352,0.00036772952,0.000067250825,0.00034924876,0.0003553588,0.11262147],"genre_scores_gemma":[0.9816128,0.00034706862,0.010666936,0.00017845366,0.00011255038,0.000047062458,0.00019910374,0.000049513597,0.0067864885],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99934167,0.0001357525,0.000042107622,0.0001326197,0.00020974492,0.0001380802],"domain_scores_gemma":[0.9983119,0.00089426275,0.0002342173,0.00018038135,0.00017100426,0.00020823236],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006222391,0.00033104027,0.0006516988,0.00091737375,0.0011703616,0.002075733,0.0007774642,0.00079210236,0.008575142],"category_scores_gemma":[0.0047766957,0.0002812253,0.00032069304,0.00068256207,0.001993108,0.0039817137,0.003335694,0.0011260465,0.0008821818],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016596893,0.000024810619,0.0006138618,0.00007377487,0.000008301803,0.00036337273,0.00032193778,0.0038226298,0.0011863641,0.98373413,0.0014856773,0.008199042],"study_design_scores_gemma":[0.000022679724,0.000041744242,0.00031262147,0.000044034063,0.000008363009,0.00031484032,0.00025894033,0.011093064,0.0018850926,0.9786992,0.007308827,0.000010444942],"about_ca_topic_score_codex":0.0004886851,"about_ca_topic_score_gemma":0.00040692982,"teacher_disagreement_score":0.008575142,"about_ca_system_score_codex":0.0009163879,"about_ca_system_score_gemma":0.0004609977,"threshold_uncertainty_score":0.028686702},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14710431,0.0024017266,0.7714889,0.0010780244,0.00049672206,0.000055048808,0.00011312919,0.00035589785,0.07690619],"genre_scores_gemma":[0.74805164,0.0034668993,0.18114789,0.0005376882,0.00075300486,0.00016145357,0.00028654476,0.0005311962,0.06506366],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988673,0.00038294797,0.000073947296,0.00026680232,0.0002631486,0.00014586556],"domain_scores_gemma":[0.9965629,0.0017613055,0.00029835347,0.00037801327,0.00060138776,0.0003981661],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017181458,0.0008407675,0.0010470873,0.0026552912,0.0018978121,0.002272041,0.0020331368,0.0012624573,0.00875433],"category_scores_gemma":[0.008624129,0.00049645954,0.0010254078,0.0027756998,0.003699234,0.005415913,0.0034312587,0.0030935484,0.0013784834],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000046896403,0.000037577025,0.0001289958,0.000041155523,0.000005041641,0.000051790415,0.00021382044,0.0035265004,0.00076317764,0.9738008,0.000718684,0.02066552],"study_design_scores_gemma":[0.000009039534,0.000029867857,0.00007248852,0.000026054087,0.000005513612,0.00009817016,0.00010412605,0.038950898,0.0010040465,0.95591193,0.003775035,0.000012938697],"about_ca_topic_score_codex":0.0011150197,"about_ca_topic_score_gemma":0.00090471824,"teacher_disagreement_score":0.00875433,"about_ca_system_score_codex":0.0015009192,"about_ca_system_score_gemma":0.0008070878,"threshold_uncertainty_score":0.029286206},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12536518,0.002713965,0.6952411,0.006799737,0.0010536575,0.00008517157,0.0012927769,0.00074063794,0.16670787],"genre_scores_gemma":[0.86218035,0.00265845,0.09238604,0.0021306416,0.0019489445,0.00023711708,0.00080555474,0.00047446604,0.03717844],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978198,0.00046012466,0.00012242235,0.0004963007,0.0008718094,0.00022957151],"domain_scores_gemma":[0.99530506,0.002163071,0.000372559,0.0012086342,0.0006608914,0.00028980288],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017831807,0.0008953481,0.0015824136,0.0033304002,0.0017746725,0.005001777,0.0028144552,0.0016250459,0.012375429],"category_scores_gemma":[0.010436706,0.00061842805,0.0014845732,0.0037846824,0.0031549507,0.0151530495,0.004754602,0.004525773,0.0019278472],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023012894,0.000013798304,0.00019348948,0.00004150431,0.000008593576,0.00003519276,0.000071254086,0.0010093279,0.0003684566,0.98983335,0.0019001806,0.0065018223],"study_design_scores_gemma":[0.0000048230745,0.0000051567968,0.00010874902,0.000008792174,0.000006828949,0.00008516001,0.000022561286,0.0075192526,0.0003367866,0.9891935,0.00269877,0.00000958881],"about_ca_topic_score_codex":0.0006988069,"about_ca_topic_score_gemma":0.0005046055,"teacher_disagreement_score":0.012375429,"about_ca_system_score_codex":0.0016995636,"about_ca_system_score_gemma":0.0007276672,"threshold_uncertainty_score":0.041399956},"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":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.037997082,0.45278,0.18866578,0.0068770745,0.0031256343,0.00013390985,0.0011608833,0.00066441897,0.30859527],"genre_scores_gemma":[0.3098509,0.5099524,0.09520455,0.0029355779,0.0075304755,0.00027418247,0.0032702284,0.000770989,0.070210755],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99862874,0.00030289157,0.00014777898,0.00034812774,0.00042419214,0.00014842163],"domain_scores_gemma":[0.9982796,0.0009009229,0.00015662571,0.0002295551,0.00030091166,0.000132382],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012037313,0.0010719085,0.0016967971,0.00504533,0.002519765,0.005082653,0.001777239,0.0020109324,0.010349933],"category_scores_gemma":[0.0034423545,0.0011268224,0.0010515668,0.009313544,0.0035364307,0.013012551,0.0032628342,0.0029851156,0.004283615],"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.000032980104,0.00004798971,0.0006297246,0.0010795179,0.000018422452,0.00014311117,0.000301155,0.002125942,0.0003822789,0.86895174,0.015101778,0.111185364],"study_design_scores_gemma":[0.000009627793,0.000045827885,0.0004912254,0.0007209736,0.000019587049,0.0012573295,0.00024602492,0.0032925778,0.0006106127,0.6978044,0.29546502,0.00003691527],"about_ca_topic_score_codex":0.0014181662,"about_ca_topic_score_gemma":0.0010128017,"teacher_disagreement_score":0.010349933,"about_ca_system_score_codex":0.0020814845,"about_ca_system_score_gemma":0.0010706332,"threshold_uncertainty_score":0.03462398},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14134821,0.008181925,0.55898684,0.018513303,0.0016294862,0.000108188826,0.001059002,0.00053320656,0.26963982],"genre_scores_gemma":[0.8980778,0.0049803522,0.053344376,0.0026687512,0.0016304253,0.00014299121,0.0002995491,0.0002977883,0.038557947],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99828964,0.00032579392,0.000106151885,0.00042724944,0.00060468906,0.00024642856],"domain_scores_gemma":[0.99598145,0.0023103359,0.0002944184,0.0005842622,0.00066042156,0.0001691738],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024127236,0.00041873858,0.0009468411,0.0022536435,0.0014020676,0.0022842286,0.0017314621,0.0017543214,0.005690732],"category_scores_gemma":[0.006830829,0.00046813526,0.0013101059,0.0020747858,0.0053408467,0.008201835,0.0031048318,0.003952883,0.0009742308],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000107990545,0.000004432189,0.0001225241,0.000019087742,0.00000516834,0.000045589415,0.00006280231,0.0004847889,0.00027664952,0.99446255,0.00097259687,0.003532937],"study_design_scores_gemma":[0.000009376221,0.000014164302,0.00028268129,0.00001632984,0.000008664577,0.00017835695,0.00004829838,0.004867919,0.00089083705,0.9810472,0.012618752,0.00001742927],"about_ca_topic_score_codex":0.0011869525,"about_ca_topic_score_gemma":0.0005577432,"teacher_disagreement_score":0.005690732,"about_ca_system_score_codex":0.0018154139,"about_ca_system_score_gemma":0.00071777694,"threshold_uncertainty_score":0.019037366},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19457546,0.004949935,0.6311513,0.0023436507,0.00091927906,0.00014263514,0.0009849269,0.0009947956,0.1639381],"genre_scores_gemma":[0.7687535,0.0019908072,0.19450992,0.00072429824,0.0008532886,0.00035216357,0.00092722324,0.00039845923,0.03149033],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9948448,0.0011646496,0.00036818327,0.0014036531,0.0017041906,0.00051444065],"domain_scores_gemma":[0.99210936,0.0037105838,0.0005887924,0.0017573987,0.0011211453,0.0007126807],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028326712,0.0007646796,0.0013416607,0.0032111516,0.0029503999,0.006200557,0.0014628111,0.0009547503,0.011650123],"category_scores_gemma":[0.01238673,0.00074715493,0.0016312466,0.0026481005,0.006692949,0.014187511,0.006918497,0.0022242672,0.0020087662],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000046898687,0.000009297588,0.00021194821,0.00005049699,0.000016699692,0.00008371853,0.00028159213,0.0004576034,0.00070148427,0.9875261,0.0010438702,0.0095701795],"study_design_scores_gemma":[0.0000066006182,0.000018964556,0.00014328344,0.000025457275,0.000019190338,0.0002470075,0.00012390525,0.003432787,0.0010759755,0.9827005,0.012189813,0.00001649765],"about_ca_topic_score_codex":0.0005232685,"about_ca_topic_score_gemma":0.00044692503,"teacher_disagreement_score":0.011650123,"about_ca_system_score_codex":0.0013469068,"about_ca_system_score_gemma":0.0007283724,"threshold_uncertainty_score":0.03897351},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.70506626,0.0036386505,0.17153284,0.010140039,0.00034536436,0.00005252404,0.0006494308,0.0008168013,0.10775803],"genre_scores_gemma":[0.9735937,0.0012064133,0.014731265,0.0008404631,0.00029328038,0.00009780866,0.00043019274,0.00007794447,0.0087290015],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992101,0.00018791697,0.000031968964,0.0002483619,0.00015273447,0.00016893094],"domain_scores_gemma":[0.9966808,0.0018987093,0.00035336168,0.00049924647,0.00029042413,0.0002774978],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00090781087,0.00041924664,0.000873329,0.0016235418,0.0019822915,0.0019370525,0.0014084888,0.0014962023,0.004210775],"category_scores_gemma":[0.007048277,0.0003899468,0.000634418,0.0016270215,0.0028776624,0.005755614,0.0017139945,0.0017429092,0.00077496143],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015291905,0.00004198273,0.0025061767,0.00011684993,0.000020235957,0.00022757205,0.0006468818,0.0104599325,0.002125288,0.96465456,0.007419342,0.011628366],"study_design_scores_gemma":[0.000020202642,0.00001563517,0.00048766765,0.000022397353,0.000007700288,0.00021323668,0.00017458612,0.01896225,0.0008038441,0.97498024,0.004300167,0.000012038081],"about_ca_topic_score_codex":0.0017469657,"about_ca_topic_score_gemma":0.0012770717,"teacher_disagreement_score":0.004210775,"about_ca_system_score_codex":0.0013238796,"about_ca_system_score_gemma":0.0004538837,"threshold_uncertainty_score":0.014086425},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7222463,0.0009518501,0.12714386,0.0036577124,0.00041593047,0.00008596636,0.0008141756,0.00049031,0.144194],"genre_scores_gemma":[0.97096115,0.0006106689,0.0138379885,0.00032277545,0.0002987475,0.0001142702,0.00036163945,0.00013055519,0.013362122],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991359,0.0002547993,0.000038410355,0.00019404932,0.0002005969,0.00017629597],"domain_scores_gemma":[0.995948,0.0019662671,0.00050186407,0.00031716062,0.00052584836,0.0007408632],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011892584,0.0006101595,0.00071393343,0.002777773,0.0018311823,0.003930282,0.0012100996,0.00094673375,0.0112796575],"category_scores_gemma":[0.0069902153,0.00066354685,0.0005534495,0.0016998652,0.0029773656,0.0066806166,0.0024369701,0.0020978604,0.0010168629],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003604114,0.000016748561,0.00028103168,0.00002220621,0.0000035640905,0.000024608436,0.00015679032,0.00085300434,0.00031831308,0.99409795,0.0013480661,0.0028417578],"study_design_scores_gemma":[0.000009676092,0.0000071110626,0.00019228263,0.000008468355,0.0000041499356,0.000057145946,0.0000972778,0.0047514113,0.00025528565,0.9934301,0.0011789382,0.00000803539],"about_ca_topic_score_codex":0.00082142657,"about_ca_topic_score_gemma":0.001450233,"teacher_disagreement_score":0.0112796575,"about_ca_system_score_codex":0.0011566861,"about_ca_system_score_gemma":0.00080938835,"threshold_uncertainty_score":0.03773427},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.709463,0.0016228643,0.1941763,0.003651086,0.00024980263,0.00009964998,0.00094654196,0.0008958616,0.08889491],"genre_scores_gemma":[0.96117556,0.0006644236,0.01642914,0.0005010872,0.00021793404,0.00013977793,0.00032614623,0.00016960083,0.020376328],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991386,0.00031853278,0.000034298086,0.00016737431,0.00016539989,0.00017575941],"domain_scores_gemma":[0.99418736,0.0029172045,0.00047180042,0.0006829779,0.0008402526,0.0009003915],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010374092,0.00045633115,0.0011921375,0.0025254905,0.002039545,0.00248765,0.001765287,0.0014097805,0.009629458],"category_scores_gemma":[0.008074119,0.00061695627,0.00074674847,0.0017064306,0.0018377142,0.0044233124,0.00220147,0.001797586,0.00088074344],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010046782,0.00004416065,0.0006564831,0.000055439967,0.000017871467,0.00011067577,0.00015581089,0.008392616,0.0014050484,0.9799396,0.0029462934,0.0061757164],"study_design_scores_gemma":[0.000027706836,0.000049256552,0.0010135169,0.000030709,0.000029181423,0.00032992786,0.00018013894,0.10226087,0.0010214716,0.89136666,0.0036609108,0.000029615987],"about_ca_topic_score_codex":0.002591371,"about_ca_topic_score_gemma":0.0018302039,"teacher_disagreement_score":0.009629458,"about_ca_system_score_codex":0.0017322198,"about_ca_system_score_gemma":0.0009983544,"threshold_uncertainty_score":0.032213748},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2775165,0.0064790864,0.360357,0.0060408977,0.00061335147,0.00013153306,0.0007014775,0.00060232024,0.34755796],"genre_scores_gemma":[0.92036086,0.0021810026,0.04237408,0.00056689396,0.00060305936,0.00018253928,0.00038840013,0.00010271087,0.033240285],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99925,0.00011183534,0.000045002747,0.00019258857,0.00028492184,0.00011564812],"domain_scores_gemma":[0.99895453,0.0004390692,0.000103279366,0.00018841165,0.00020144552,0.000113171314],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00096286775,0.00041166064,0.0006038564,0.0016223977,0.0018058962,0.0017969043,0.00085402164,0.00077409606,0.0042163967],"category_scores_gemma":[0.003149235,0.0002070815,0.00075181166,0.0009525352,0.0039023275,0.0058844592,0.0021421432,0.0015425443,0.0009255141],"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.0000072861776,0.0000033010688,0.000059973827,0.000015881575,0.0000023682926,0.000028461729,0.00014726451,0.00034876415,0.00036841645,0.99468815,0.000650445,0.0036796087],"study_design_scores_gemma":[0.00000533576,0.000007230197,0.000098449505,0.000006937382,0.0000024970786,0.000048076417,0.000043306325,0.0011851338,0.00035279398,0.9897398,0.00850493,0.0000055847886],"about_ca_topic_score_codex":0.0013806275,"about_ca_topic_score_gemma":0.000910301,"teacher_disagreement_score":0.0042163967,"about_ca_system_score_codex":0.0015643559,"about_ca_system_score_gemma":0.0005418182,"threshold_uncertainty_score":0.01410526},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7937429,0.0006551832,0.08121921,0.001767928,0.00022130947,0.00008393018,0.00038147642,0.0003642315,0.121563904],"genre_scores_gemma":[0.95756537,0.0004214609,0.016906569,0.00021224788,0.00014159334,0.00010945462,0.00024338563,0.00015656327,0.024243312],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990959,0.00021884152,0.000048529408,0.00019934967,0.00026590363,0.0001714473],"domain_scores_gemma":[0.99783045,0.00096363085,0.0003075891,0.00026635922,0.0002925314,0.0003394597],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006448808,0.0007383188,0.0009992969,0.0034606135,0.0022656044,0.0041595153,0.0016121238,0.0020293756,0.008507432],"category_scores_gemma":[0.004408541,0.0006707921,0.00060221634,0.0026142846,0.0040926402,0.005877518,0.002758513,0.0026275297,0.0012574573],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000035831752,0.000024048823,0.0002859282,0.000025445666,0.000004673932,0.000105802115,0.0003405437,0.0005614273,0.0009100351,0.9934471,0.0005374725,0.003721648],"study_design_scores_gemma":[0.000016536223,0.000009212735,0.0002750641,0.00001339369,0.000003581151,0.00013802435,0.0001586033,0.0028355052,0.0006106401,0.9941115,0.0018179095,0.000010002713],"about_ca_topic_score_codex":0.0010786519,"about_ca_topic_score_gemma":0.0008016561,"teacher_disagreement_score":0.008507432,"about_ca_system_score_codex":0.0014019249,"about_ca_system_score_gemma":0.0004425605,"threshold_uncertainty_score":0.028460205},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5999958,0.0005084782,0.3640373,0.0020039119,0.00020168965,0.00013006313,0.0020922495,0.0008312018,0.030199213],"genre_scores_gemma":[0.9235139,0.00037930088,0.04638434,0.00030750487,0.00025991068,0.00016540462,0.0017045637,0.00023206438,0.027052972],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99925154,0.00021344438,0.000038582293,0.0001812481,0.00017247822,0.00014263467],"domain_scores_gemma":[0.9974172,0.0012460408,0.00047567178,0.00025117182,0.0002820265,0.0003277789],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006449801,0.0006267638,0.0006631188,0.0012032429,0.000587171,0.0021943592,0.00078060507,0.00090009545,0.008551908],"category_scores_gemma":[0.004432772,0.0004529436,0.0008361337,0.000692743,0.0012291606,0.0020183856,0.0010198846,0.0011366149,0.0014653626],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000270835,0.000087625056,0.0015280603,0.00015327241,0.000042271284,0.00040663104,0.00040371044,0.033465113,0.0044728904,0.9363729,0.007723381,0.015073217],"study_design_scores_gemma":[0.00006171208,0.00010310386,0.0010805222,0.000031491538,0.000018026558,0.00034469643,0.00012553704,0.1613981,0.0017683279,0.8296822,0.005338437,0.000047891903],"about_ca_topic_score_codex":0.0015662309,"about_ca_topic_score_gemma":0.0019105413,"teacher_disagreement_score":0.008551908,"about_ca_system_score_codex":0.001139883,"about_ca_system_score_gemma":0.00049256766,"threshold_uncertainty_score":0.028608918},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7393483,0.00040691285,0.1436463,0.0008847282,0.0009344993,0.00007797583,0.00063587655,0.00032049028,0.113744944],"genre_scores_gemma":[0.91668206,0.0002668326,0.050546765,0.0002550536,0.0002161944,0.00013051284,0.00064513023,0.00010291759,0.031154592],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994729,0.00006461924,0.000050291404,0.00010617711,0.00016939698,0.00013657396],"domain_scores_gemma":[0.99897146,0.00025940518,0.00012619824,0.00018100334,0.00021913149,0.00024279459],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047330698,0.00054059946,0.00047185124,0.0011728907,0.0021825647,0.001310391,0.000754557,0.0004918688,0.00856107],"category_scores_gemma":[0.0016901016,0.00022315749,0.0005733518,0.0006707007,0.0016449733,0.0012825992,0.001724093,0.0009748441,0.0014824119],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004792666,0.00020732521,0.009266032,0.00023916709,0.00007847878,0.0007676599,0.001334992,0.0029080135,0.045740698,0.8679499,0.007094093,0.06393442],"study_design_scores_gemma":[0.000038590577,0.0004749876,0.010561226,0.0001664094,0.000068702764,0.002907394,0.0012870957,0.029062236,0.04984949,0.8233883,0.082106985,0.000088647124],"about_ca_topic_score_codex":0.00048094965,"about_ca_topic_score_gemma":0.0007976335,"teacher_disagreement_score":0.00856107,"about_ca_system_score_codex":0.0006046411,"about_ca_system_score_gemma":0.00058778917,"threshold_uncertainty_score":0.028639674},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.81358343,0.00046879958,0.16876884,0.00054110546,0.000059640926,0.000035327626,0.0002756355,0.00023415261,0.016033188],"genre_scores_gemma":[0.9747873,0.00013079931,0.022427578,0.00009181001,0.000027997372,0.000047812857,0.00019569889,0.00004244962,0.0022486656],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987949,0.00041260858,0.00007589652,0.00023042546,0.00033200794,0.00015418924],"domain_scores_gemma":[0.9941361,0.0033675088,0.00072883663,0.0006894399,0.00062958576,0.00044859224],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001257192,0.0003732017,0.00063017226,0.00084539846,0.0007371429,0.0013400703,0.00077521586,0.00089393056,0.004074965],"category_scores_gemma":[0.0071625444,0.0005500834,0.00047024668,0.0006850009,0.0015071771,0.002001558,0.0015265776,0.0013871229,0.0004129833],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003201149,0.000057099343,0.004629418,0.00020088008,0.00003420908,0.00027610952,0.00042772427,0.060035665,0.015505603,0.9040976,0.0016018971,0.012813661],"study_design_scores_gemma":[0.00005852636,0.00024158605,0.0018532287,0.00007445829,0.000020494002,0.0006369736,0.0002865142,0.17456385,0.009148134,0.8074491,0.0056243506,0.000042734602],"about_ca_topic_score_codex":0.0004905468,"about_ca_topic_score_gemma":0.00041899655,"teacher_disagreement_score":0.004074965,"about_ca_system_score_codex":0.0012568837,"about_ca_system_score_gemma":0.0003995468,"threshold_uncertainty_score":0.013632119},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11186351,0.0076231584,0.14812729,0.043996267,0.0027192354,0.00010699194,0.0008101111,0.0005187535,0.6842348],"genre_scores_gemma":[0.912355,0.0038410749,0.024415264,0.0056225923,0.0014914849,0.000159182,0.00033847732,0.00015540858,0.05162149],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997905,0.0004449768,0.00011486208,0.00055055483,0.00061541697,0.00036915916],"domain_scores_gemma":[0.99597496,0.0018265373,0.0002546371,0.00082086073,0.0007738815,0.00034912743],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027640972,0.0005373048,0.0008243619,0.0017816161,0.0030432267,0.0031440477,0.0010509293,0.002296784,0.009884185],"category_scores_gemma":[0.013055822,0.00039339875,0.0008559794,0.001333908,0.0073113833,0.010193686,0.0040010456,0.0027115957,0.0025949392],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008305549,0.0000026126547,0.000135588,0.000011047319,0.0000017230296,0.00001568339,0.00009055075,0.00030681049,0.000060789534,0.9948965,0.0023261122,0.0021443157],"study_design_scores_gemma":[0.0000040055993,0.000005067668,0.00007225343,0.000017992386,0.0000019088982,0.0000321981,0.000040424424,0.0010493151,0.00014010447,0.9860216,0.012610829,0.0000043184773],"about_ca_topic_score_codex":0.001989064,"about_ca_topic_score_gemma":0.0010765838,"teacher_disagreement_score":0.009884185,"about_ca_system_score_codex":0.0025640177,"about_ca_system_score_gemma":0.0014449353,"threshold_uncertainty_score":0.033065856},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9155179,0.0006050836,0.0641383,0.00041665073,0.000121530575,0.000021944008,0.00016616442,0.00022857371,0.018783811],"genre_scores_gemma":[0.983457,0.00021877681,0.012337278,0.00009155869,0.00009807735,0.00006989946,0.00015238208,0.00007830668,0.0034967437],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991725,0.0002069498,0.00006186909,0.00017563032,0.00021124215,0.00017190039],"domain_scores_gemma":[0.9962985,0.0020535118,0.0006017026,0.00048229808,0.00025713095,0.00030689026],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000957766,0.0004515951,0.0007517604,0.0014316147,0.002038845,0.0017562815,0.00075967965,0.0009043989,0.0033411137],"category_scores_gemma":[0.007158287,0.00049179385,0.0006623924,0.0012227893,0.002741153,0.0034640855,0.002404639,0.0012068086,0.00035517424],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034036965,0.00007704894,0.0029528753,0.00015508219,0.000043057746,0.001059173,0.001555679,0.004875733,0.010341284,0.96190125,0.0011900893,0.015508374],"study_design_scores_gemma":[0.000042212418,0.000108450535,0.002251281,0.00009025779,0.000055252305,0.0013917465,0.0006502299,0.022804411,0.008737196,0.95481735,0.009008422,0.000043231223],"about_ca_topic_score_codex":0.00020302334,"about_ca_topic_score_gemma":0.00019593234,"teacher_disagreement_score":0.0033411137,"about_ca_system_score_codex":0.00092243194,"about_ca_system_score_gemma":0.00027456667,"threshold_uncertainty_score":0.011177123},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07800317,0.0034769285,0.8157921,0.0043316553,0.00084536825,0.00007723615,0.00028424966,0.000578104,0.09661117],"genre_scores_gemma":[0.7233223,0.005410323,0.23945716,0.0010950457,0.0016800808,0.00020157844,0.00044822428,0.00042655153,0.027958801],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99897265,0.00047653672,0.000031612453,0.00017772267,0.00026903383,0.000072544186],"domain_scores_gemma":[0.99362177,0.0040461468,0.00040378378,0.0008133027,0.00068245456,0.00043255294],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010290311,0.000693979,0.0008730129,0.0018532535,0.0011481544,0.0017237879,0.001391156,0.0011052308,0.0069341613],"category_scores_gemma":[0.009389565,0.00060959853,0.00074608624,0.0026237273,0.0025373031,0.0034363414,0.003071104,0.002614108,0.0007052675],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020858379,0.000024380823,0.00023225427,0.00007034958,0.000009200782,0.00003634735,0.00012268763,0.012041359,0.0006891528,0.9642326,0.002120093,0.020400716],"study_design_scores_gemma":[0.000007360008,0.000007204187,0.000060397924,0.000017858121,0.000005054949,0.00004530689,0.000043199165,0.034019925,0.00033771692,0.9610277,0.0044223946,0.0000058425694],"about_ca_topic_score_codex":0.0018192597,"about_ca_topic_score_gemma":0.00215124,"teacher_disagreement_score":0.0069341613,"about_ca_system_score_codex":0.0015770542,"about_ca_system_score_gemma":0.0009051455,"threshold_uncertainty_score":0.023197114},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.86616784,0.0008920368,0.11174216,0.0010030526,0.00005015203,0.000041625655,0.00015325475,0.00013221595,0.019817613],"genre_scores_gemma":[0.99311674,0.00038181854,0.0040942235,0.00005807478,0.00008290855,0.00003603016,0.00007816828,0.000030775467,0.0021212788],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99936837,0.00023942614,0.000026322852,0.000101211604,0.00016262455,0.00010211346],"domain_scores_gemma":[0.99268407,0.0047625,0.0008892418,0.0003261566,0.0005340634,0.00080401683],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001480654,0.0005446281,0.00072885223,0.0028850015,0.0011462768,0.002151419,0.00088095834,0.00089211226,0.0025585892],"category_scores_gemma":[0.012807908,0.000494463,0.0004775351,0.0009235686,0.0047069383,0.0030892806,0.001267038,0.0012264339,0.00032230836],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004768098,0.000011744541,0.0022164097,0.00004042312,0.000014584933,0.00019704687,0.00020531748,0.015268681,0.0018333897,0.97651595,0.0006332425,0.0030154483],"study_design_scores_gemma":[0.00001895666,0.000027593827,0.0021769141,0.000023951812,0.000008953237,0.00026589938,0.00010468478,0.122981854,0.0011474771,0.8722469,0.00095936214,0.000037477388],"about_ca_topic_score_codex":0.00074995443,"about_ca_topic_score_gemma":0.0005903083,"teacher_disagreement_score":0.0028850015,"about_ca_system_score_codex":0.0011188346,"about_ca_system_score_gemma":0.0005467893,"threshold_uncertainty_score":0.008559346},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6250766,0.001517805,0.33660412,0.0013858079,0.00011912461,0.00013107821,0.0013961063,0.00081284175,0.032956537],"genre_scores_gemma":[0.9373185,0.000897702,0.049527183,0.00031005414,0.00026815067,0.00023167943,0.0029987278,0.00041571853,0.008032167],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984289,0.00036252904,0.00006517527,0.00033812696,0.00049609714,0.00030914322],"domain_scores_gemma":[0.9866507,0.008533111,0.0016292176,0.0011257855,0.001221778,0.00083934504],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015337454,0.0008540037,0.0011130914,0.0027671983,0.0012070208,0.0023759198,0.0033218546,0.0012885063,0.0069287852],"category_scores_gemma":[0.028266674,0.0008703235,0.0009332426,0.0028172173,0.0022926836,0.0043855063,0.002145354,0.0017855793,0.00082963146],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00046262637,0.0003463524,0.018899838,0.000684818,0.00016799138,0.0006526779,0.0008657514,0.25259733,0.010630781,0.63631743,0.016127437,0.062247027],"study_design_scores_gemma":[0.000031831565,0.00006191194,0.0024735357,0.00005721639,0.00003628826,0.00034521174,0.0001605497,0.78332144,0.0020074705,0.20897728,0.0024986053,0.000028670946],"about_ca_topic_score_codex":0.0032516534,"about_ca_topic_score_gemma":0.0034858617,"teacher_disagreement_score":0.0069287852,"about_ca_system_score_codex":0.0020851784,"about_ca_system_score_gemma":0.0010557546,"threshold_uncertainty_score":0.023179054},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.541138,0.0008150334,0.3915577,0.0021842604,0.000068773064,0.00016165148,0.0012500569,0.00043109202,0.06239346],"genre_scores_gemma":[0.93291444,0.00043506126,0.052489873,0.00033669017,0.0001006694,0.00016776593,0.0006702169,0.000082852865,0.012802488],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99917847,0.0001919241,0.000043509393,0.0003051284,0.00018651377,0.000094397255],"domain_scores_gemma":[0.99520504,0.00251472,0.0005248349,0.0007513924,0.0004742336,0.000529791],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00062633323,0.00026730896,0.00052278687,0.0015239125,0.0013442591,0.0017822041,0.0006095875,0.0006751785,0.0078054676],"category_scores_gemma":[0.005264979,0.0005827361,0.0003761133,0.0015467361,0.0024353121,0.0042225337,0.002114565,0.0014585847,0.00062730734],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000057486406,0.000024188039,0.0011255067,0.00006131885,0.000019552834,0.00015422764,0.00039845484,0.005166709,0.0029228244,0.97872967,0.0019730967,0.009366968],"study_design_scores_gemma":[0.000023405777,0.000027928514,0.0011218799,0.000024796276,0.000015462427,0.00046107176,0.00029245016,0.036453158,0.0024831137,0.9455677,0.013511634,0.000017292738],"about_ca_topic_score_codex":0.00074597565,"about_ca_topic_score_gemma":0.0009130243,"teacher_disagreement_score":0.0078054676,"about_ca_system_score_codex":0.0009850463,"about_ca_system_score_gemma":0.00026345576,"threshold_uncertainty_score":0.0261119},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.83263576,0.0004878062,0.061799873,0.0010965287,0.00019340774,0.000054690787,0.0002471768,0.00028152685,0.103203245],"genre_scores_gemma":[0.98263216,0.00010486531,0.012228563,0.000112524656,0.0000398385,0.000039841496,0.00007242544,0.000030228637,0.004739607],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99963415,0.00008485806,0.000024211084,0.000072137285,0.000095293,0.00008935964],"domain_scores_gemma":[0.9988992,0.00036563896,0.00027045663,0.00013133061,0.00016259208,0.0001708057],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005992494,0.0003186338,0.00020736919,0.0017058338,0.0010605433,0.002000044,0.0006012792,0.0005953239,0.008115714],"category_scores_gemma":[0.001751807,0.00018263233,0.000329089,0.00051444786,0.0023393666,0.00300909,0.000899329,0.0010248095,0.0006679116],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025264939,0.000017479995,0.00062115164,0.000038367616,0.0000026575874,0.00004918341,0.00019789164,0.0007756679,0.0042850897,0.989273,0.0007537983,0.003960529],"study_design_scores_gemma":[0.0000075577072,0.000033161283,0.0011656926,0.000022384806,0.000004309206,0.0002108691,0.000261037,0.011414373,0.0060539497,0.9770684,0.0037347653,0.000023538767],"about_ca_topic_score_codex":0.00051958737,"about_ca_topic_score_gemma":0.00083946117,"teacher_disagreement_score":0.008115714,"about_ca_system_score_codex":0.0007388921,"about_ca_system_score_gemma":0.00042790727,"threshold_uncertainty_score":0.027149737},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.78746337,0.0005665757,0.096249714,0.0011898626,0.00017618056,0.00008205285,0.00042399002,0.00025973562,0.11358844],"genre_scores_gemma":[0.9829895,0.00013199252,0.008782633,0.00015901201,0.000033850058,0.000038937626,0.00021397036,0.00003678698,0.007613232],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992447,0.00014693954,0.000046220306,0.00016188029,0.00018986523,0.0002103748],"domain_scores_gemma":[0.99774444,0.00088283495,0.00030745674,0.00036930008,0.00034809802,0.00034781347],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042327202,0.0002880391,0.00050188275,0.00078698434,0.0023826882,0.002500388,0.00071438774,0.0008763316,0.018374901],"category_scores_gemma":[0.0025721497,0.0006025215,0.00047826648,0.0007534598,0.0016976222,0.0031882657,0.0023297842,0.0015173156,0.0018467631],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00038158058,0.00007295425,0.0037439845,0.00021368753,0.000059908743,0.0009140879,0.0011613774,0.014528416,0.011495296,0.93826586,0.0057936255,0.023369374],"study_design_scores_gemma":[0.000046195648,0.00012862767,0.0014512815,0.000073946845,0.000040437033,0.0009274043,0.0013100668,0.041766517,0.010688641,0.92472106,0.01880808,0.000037778078],"about_ca_topic_score_codex":0.000861629,"about_ca_topic_score_gemma":0.000904227,"teacher_disagreement_score":0.018374901,"about_ca_system_score_codex":0.0006979696,"about_ca_system_score_gemma":0.00030452473,"threshold_uncertainty_score":0.06147015},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8593651,0.00047388565,0.12074234,0.0029056184,0.000054318996,0.00016614466,0.0031897628,0.0013454002,0.011757581],"genre_scores_gemma":[0.96395963,0.0003124465,0.028804587,0.00040670027,0.00006647442,0.00011068103,0.0026150846,0.00025839044,0.003466067],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99737835,0.000775424,0.0001782955,0.000718539,0.00048440692,0.0004650295],"domain_scores_gemma":[0.97773755,0.016236033,0.00165497,0.0026841457,0.0006885769,0.0009986744],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014140724,0.00092352636,0.0014986863,0.00071201194,0.0015344459,0.0052680215,0.0030872738,0.002041929,0.0078105214],"category_scores_gemma":[0.0141344825,0.0010167065,0.0020675373,0.0017526627,0.002568414,0.008417625,0.00255249,0.0030421459,0.0007206811],"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.0045181843,0.0006805896,0.022427373,0.0019021305,0.0003836141,0.0011868442,0.0034585297,0.5443118,0.0324248,0.30539644,0.017769892,0.065539904],"study_design_scores_gemma":[0.00030495826,0.00019554711,0.0042456985,0.00009976887,0.00014564015,0.0007593097,0.00084221916,0.59089136,0.013544701,0.38433844,0.004540099,0.000092270064],"about_ca_topic_score_codex":0.009136095,"about_ca_topic_score_gemma":0.0064222333,"teacher_disagreement_score":0.009136095,"about_ca_system_score_codex":0.003697939,"about_ca_system_score_gemma":0.0018504286,"threshold_uncertainty_score":0.026830494},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7819513,0.0013665389,0.12541379,0.0015234823,0.00019206639,0.00004309861,0.00036989545,0.0005959915,0.08854381],"genre_scores_gemma":[0.9792802,0.0002705075,0.014769817,0.00010506221,0.00011919581,0.00004753728,0.000098121694,0.000074910764,0.005234697],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985738,0.00030368738,0.00010209719,0.00025767938,0.0005383267,0.00022444413],"domain_scores_gemma":[0.9961338,0.0028391646,0.00025478142,0.00033113474,0.0002611069,0.00018000651],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015836888,0.00047223753,0.0006591867,0.0030135566,0.0015507761,0.0030957712,0.0014372851,0.00069495256,0.0058471104],"category_scores_gemma":[0.00768756,0.00046922197,0.0008734813,0.0012263814,0.004367262,0.0068338094,0.002355483,0.0021458666,0.0006151596],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000228351,0.000010599042,0.00042097262,0.000032277305,0.0000035425403,0.00007574935,0.00036359965,0.0021218797,0.0008826679,0.992595,0.00028981865,0.0031811006],"study_design_scores_gemma":[0.000004244227,0.000009262927,0.0003511378,0.000023553543,0.000006352592,0.000129737,0.000080890946,0.0060174833,0.0014037899,0.9900275,0.0019289753,0.000017216273],"about_ca_topic_score_codex":0.0007455976,"about_ca_topic_score_gemma":0.0008051605,"teacher_disagreement_score":0.0058471104,"about_ca_system_score_codex":0.001767352,"about_ca_system_score_gemma":0.0005012696,"threshold_uncertainty_score":0.019560516},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6487338,0.0028265524,0.3069113,0.007992233,0.00020256104,0.000084574036,0.00065524183,0.00048266354,0.032111157],"genre_scores_gemma":[0.9891985,0.0007652754,0.0061106975,0.00025638723,0.00045412776,0.00006939228,0.00015523261,0.00007289983,0.002917516],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99729675,0.0010863119,0.000106996136,0.0005088529,0.000587449,0.00041362265],"domain_scores_gemma":[0.9425232,0.0453948,0.0043840883,0.0037581488,0.0014116673,0.00252809],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0049706316,0.0005625493,0.00092885556,0.0020507034,0.0012777877,0.0027708614,0.0015528663,0.001339077,0.004721837],"category_scores_gemma":[0.035611242,0.00054903654,0.00068506,0.0011295899,0.006991864,0.00905802,0.0023486477,0.0026121915,0.0004461754],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011357513,0.000039273884,0.0018544904,0.0000863138,0.000013206339,0.00010259944,0.00024202041,0.01282854,0.0008179067,0.9780115,0.001037894,0.0048526684],"study_design_scores_gemma":[0.00003599167,0.00009823895,0.001292828,0.00004311009,0.000013216071,0.00025405514,0.00011010228,0.064787224,0.0010931424,0.9308381,0.0013973659,0.00003657199],"about_ca_topic_score_codex":0.0006272105,"about_ca_topic_score_gemma":0.00036693833,"teacher_disagreement_score":0.0049706316,"about_ca_system_score_codex":0.0017785465,"about_ca_system_score_gemma":0.0006750266,"threshold_uncertainty_score":0.026287496},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30897248,0.005311884,0.3066019,0.04126994,0.0012837081,0.00021522027,0.0019165778,0.00086093316,0.3335674],"genre_scores_gemma":[0.87882733,0.0034258089,0.057528853,0.007006835,0.0011462225,0.0003123046,0.001428599,0.00030510002,0.050018974],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988555,0.00033583204,0.000030038247,0.0003647302,0.0002116136,0.00020233872],"domain_scores_gemma":[0.99531746,0.002963167,0.00027599756,0.0005998056,0.00045192233,0.00039167312],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017983296,0.0007676321,0.000697545,0.0012714639,0.0021830737,0.0023436097,0.0013125002,0.002031686,0.01621999],"category_scores_gemma":[0.010522074,0.0006625437,0.00090758636,0.0016086602,0.004184602,0.00955958,0.002709835,0.0038495462,0.0022661467],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001272309,0.000026091588,0.0004767641,0.000064755644,0.000014517724,0.000069043475,0.00018428882,0.0068463082,0.00056484353,0.97191226,0.010121039,0.009592863],"study_design_scores_gemma":[0.000044997596,0.000026366937,0.00029592705,0.00004792684,0.000012741333,0.000077529854,0.00014041748,0.01896514,0.0006149108,0.96433306,0.015422655,0.000018401595],"about_ca_topic_score_codex":0.0034259683,"about_ca_topic_score_gemma":0.0032557487,"teacher_disagreement_score":0.01621999,"about_ca_system_score_codex":0.0020745292,"about_ca_system_score_gemma":0.0011449471,"threshold_uncertainty_score":0.054261327},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8846605,0.00022900365,0.04667485,0.00061146956,0.00013502354,0.00005180552,0.0003429847,0.0005594959,0.066734985],"genre_scores_gemma":[0.98645675,0.00011170025,0.003927438,0.00008161759,0.000101845755,0.00007040051,0.00029423428,0.00021618127,0.0087399],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986638,0.00020991791,0.00006353367,0.00018921723,0.00049867394,0.00037477736],"domain_scores_gemma":[0.9959001,0.0019403611,0.0006488035,0.00018953692,0.00045811918,0.00086305285],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010325768,0.00077745045,0.0008230457,0.004904135,0.0029311783,0.0049635093,0.0017869584,0.0015724704,0.018170027],"category_scores_gemma":[0.004074826,0.0009937756,0.0008382398,0.0016741985,0.003534119,0.0049925493,0.0028071855,0.00169713,0.0012873656],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010390776,0.0000479563,0.0007480317,0.000031794818,0.0000118681155,0.00018178455,0.00054417504,0.0013856409,0.0019083424,0.99084467,0.0011527247,0.0030390054],"study_design_scores_gemma":[0.000041016214,0.0000685037,0.0023141233,0.000045585286,0.00002853718,0.0004807037,0.0009055849,0.03303584,0.006182488,0.9542835,0.002544589,0.000069545466],"about_ca_topic_score_codex":0.0023445117,"about_ca_topic_score_gemma":0.002103683,"teacher_disagreement_score":0.018170027,"about_ca_system_score_codex":0.0017467629,"about_ca_system_score_gemma":0.0008479866,"threshold_uncertainty_score":0.060784817},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.57713306,0.0044765375,0.091908775,0.09933468,0.0015162948,0.00014102826,0.0013341855,0.0015528909,0.22260262],"genre_scores_gemma":[0.97288847,0.001116228,0.009721747,0.0050466764,0.0005746704,0.00010316222,0.0005375239,0.00011698242,0.009894656],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997326,0.0006015648,0.00010336779,0.0008341568,0.00067088613,0.00046407102],"domain_scores_gemma":[0.9914806,0.005709808,0.0005145381,0.00087063387,0.00087417144,0.0005503244],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017782738,0.00052343355,0.0009878433,0.0016009909,0.0046992847,0.0031283887,0.0015180714,0.004142648,0.008472888],"category_scores_gemma":[0.015675314,0.00062792253,0.0007629661,0.0023293532,0.007740836,0.009110537,0.003942606,0.0041335793,0.0012214164],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017407113,0.00004791537,0.001859445,0.00008559828,0.000019776404,0.00043359803,0.0012011165,0.0019225947,0.0009897318,0.9633111,0.021433158,0.008521997],"study_design_scores_gemma":[0.00007670175,0.00003191461,0.0006016932,0.00003613903,0.000012016379,0.0004854496,0.0005354709,0.0070370417,0.0014347804,0.9599139,0.029803654,0.00003121836],"about_ca_topic_score_codex":0.0047454564,"about_ca_topic_score_gemma":0.0024633352,"teacher_disagreement_score":0.008472888,"about_ca_system_score_codex":0.003132987,"about_ca_system_score_gemma":0.0009825259,"threshold_uncertainty_score":0.028344631},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.80730927,0.0014324205,0.14238422,0.0023491145,0.00017037845,0.00007710835,0.00033195928,0.0004169496,0.04552851],"genre_scores_gemma":[0.97642595,0.0006230436,0.0075726705,0.000340993,0.00020277579,0.00009750894,0.00017573049,0.0001088209,0.014452398],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99874413,0.0005322539,0.000054436612,0.00021267922,0.00022560637,0.00023089636],"domain_scores_gemma":[0.9871443,0.0077117146,0.0015843508,0.0009272835,0.0008819826,0.0017503406],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017312396,0.0004455001,0.001322868,0.0024729148,0.0020343524,0.0039812108,0.0015976218,0.0015188745,0.0073259296],"category_scores_gemma":[0.012042455,0.00073453644,0.0006322306,0.0015637728,0.0031698532,0.0063389246,0.0032367355,0.0021794683,0.0006117678],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006822486,0.000042122563,0.0006464893,0.00006979209,0.000012812017,0.00011159436,0.0003664465,0.003750566,0.0009796316,0.9893449,0.0012914032,0.0033159794],"study_design_scores_gemma":[0.000026022964,0.000024552011,0.00040258595,0.000022045253,0.000012688992,0.00019183767,0.00018500067,0.02571296,0.00046136,0.9720054,0.0009402799,0.0000151534605],"about_ca_topic_score_codex":0.0010611649,"about_ca_topic_score_gemma":0.0007550307,"teacher_disagreement_score":0.0073259296,"about_ca_system_score_codex":0.0018132878,"about_ca_system_score_gemma":0.0006510402,"threshold_uncertainty_score":0.024507642},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13804598,0.017964665,0.19051121,0.01359734,0.0014813115,0.00009203081,0.00076432223,0.00073015655,0.636813],"genre_scores_gemma":[0.89218456,0.008071641,0.029238151,0.0033069937,0.0017907034,0.00024854022,0.00064147287,0.00020990692,0.064308],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991486,0.0003824922,0.000029637136,0.00011695652,0.0001900647,0.00013219156],"domain_scores_gemma":[0.9984566,0.00081643596,0.00012220202,0.00019836803,0.00019453347,0.00021190163],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012791582,0.0006071401,0.00085780583,0.0020619761,0.002038656,0.0020330215,0.0009911677,0.0013354281,0.008322883],"category_scores_gemma":[0.0033539091,0.00037923377,0.0005262924,0.001802334,0.0045267814,0.008032945,0.0030629288,0.0026315413,0.0015512089],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005287202,0.0000049522137,0.00004464888,0.000019747233,0.0000022312606,0.000017811135,0.00006309047,0.00019064029,0.00006734404,0.9960401,0.0017906907,0.0017533663],"study_design_scores_gemma":[0.000002500689,0.0000025355966,0.000054647295,0.000010892862,0.0000017990226,0.00003188068,0.00003416849,0.00075885886,0.00002526469,0.9964289,0.0026459019,0.000002730497],"about_ca_topic_score_codex":0.002038432,"about_ca_topic_score_gemma":0.0024173812,"teacher_disagreement_score":0.008322883,"about_ca_system_score_codex":0.0016487513,"about_ca_system_score_gemma":0.0006534147,"threshold_uncertainty_score":0.02784288},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30078232,0.010842559,0.25304845,0.0072627296,0.00091382605,0.00008782624,0.0008708113,0.00043864988,0.42575282],"genre_scores_gemma":[0.9326964,0.003778041,0.032028943,0.00088037964,0.0009342002,0.00016590423,0.0004958189,0.00012593098,0.028894436],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99878854,0.0003825442,0.000065678025,0.00020314744,0.0003542397,0.00020582198],"domain_scores_gemma":[0.9953056,0.0032056593,0.00040707973,0.00034218992,0.0003113729,0.00042810393],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015613121,0.0006940571,0.0009708663,0.0038476414,0.0030502265,0.0036174087,0.0013302483,0.0016780811,0.0064307097],"category_scores_gemma":[0.007887614,0.0005692179,0.0008176971,0.0027514137,0.004989731,0.009024445,0.0031363443,0.0029923196,0.0009957255],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010346396,0.0000076410415,0.000105935775,0.00002528403,0.0000035281764,0.00003052592,0.00010871493,0.00051720685,0.0001576337,0.995507,0.0009008943,0.002625385],"study_design_scores_gemma":[0.0000030073497,0.0000029125615,0.00007919712,0.0000167813,0.0000031006573,0.000053969183,0.000049117618,0.0017596541,0.00010741419,0.99609816,0.00182299,0.0000036094702],"about_ca_topic_score_codex":0.0014122064,"about_ca_topic_score_gemma":0.0015890464,"teacher_disagreement_score":0.0064307097,"about_ca_system_score_codex":0.0024703473,"about_ca_system_score_gemma":0.00065711426,"threshold_uncertainty_score":0.021512866},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.71904355,0.018245839,0.16303335,0.011929596,0.001078182,0.00007916631,0.0005382699,0.000657918,0.08539412],"genre_scores_gemma":[0.9672335,0.0031536082,0.02282044,0.00052357593,0.0008670202,0.00008042341,0.00013347222,0.00014809011,0.005040045],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99916065,0.00025446466,0.000040995023,0.00024213432,0.00020366181,0.00009811066],"domain_scores_gemma":[0.98427653,0.012443303,0.0008166216,0.0012557335,0.00045015645,0.000757518],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018938017,0.0004922551,0.00087402377,0.0014386039,0.0010774605,0.0017872925,0.0012736,0.0010184573,0.0035888061],"category_scores_gemma":[0.014784837,0.0005596963,0.0006343969,0.0015218867,0.0036720778,0.0061696316,0.002160622,0.0031926516,0.00031427253],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005973003,0.00011126623,0.007483306,0.00031194167,0.00008151247,0.00041031654,0.00088532787,0.02905686,0.013807693,0.88924074,0.0105740465,0.047439523],"study_design_scores_gemma":[0.00005123976,0.00017148716,0.00355849,0.00004958061,0.00004995508,0.0004923746,0.00021596705,0.052475806,0.0027291542,0.932421,0.007736774,0.000048100745],"about_ca_topic_score_codex":0.001166943,"about_ca_topic_score_gemma":0.0012465869,"teacher_disagreement_score":0.0035888061,"about_ca_system_score_codex":0.0011966012,"about_ca_system_score_gemma":0.0004052362,"threshold_uncertainty_score":0.012005746},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0022246386,0.0006316529,0.0025364435,0.01209675,0.009545162,0.0018068084,0.012541126,0.0025148813,0.9561026],"genre_scores_gemma":[0.0055080657,0.00023170558,0.0010163215,0.00081291137,0.000728974,0.0005261024,0.003297144,0.00058810465,0.98729056],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9914381,0.0012213202,0.0004832825,0.0005136385,0.0053111697,0.0010325976],"domain_scores_gemma":[0.9640083,0.0036714443,0.0010288378,0.003680064,0.02351503,0.0040963385],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.006884,0.0010751392,0.0010101916,0.0043203784,0.006156906,0.0096323965,0.0020103985,0.003969162,0.6443256],"category_scores_gemma":[0.04062854,0.0012031794,0.00051018863,0.0043586805,0.0012601112,0.00579832,0.004636229,0.0057520983,0.51689273],"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.00005254353,0.000036300826,0.00009782649,0.000025095687,7.488566e-7,0.000020591477,0.00009273843,0.000018578046,0.000104303035,0.0021076866,0.979418,0.01802559],"study_design_scores_gemma":[0.000017845616,0.000024231274,0.0008697777,0.00003726748,8.5731597e-7,0.000021850625,0.0003481175,0.00006387543,0.00010757635,0.00067288685,0.99782264,0.000012959532],"about_ca_topic_score_codex":0.015757723,"about_ca_topic_score_gemma":0.02126056,"teacher_disagreement_score":0.6443256,"about_ca_system_score_codex":0.0034710586,"about_ca_system_score_gemma":0.006772939,"threshold_uncertainty_score":0.50732636},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36854392,0.00058303756,0.5961907,0.0016924929,0.00009260754,0.00027711308,0.0006433445,0.0012252857,0.030751511],"genre_scores_gemma":[0.89079475,0.00039967708,0.09468178,0.0005913989,0.00010809816,0.0003871362,0.0008610841,0.00039703978,0.011779046],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984596,0.00046011593,0.000043221768,0.00036847207,0.00032648366,0.00034214967],"domain_scores_gemma":[0.99386024,0.0031443958,0.0008159096,0.0010883438,0.000409095,0.0006819648],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014189037,0.000941128,0.0010053187,0.0017870798,0.0015135912,0.0021789407,0.0018589312,0.0014546397,0.007856209],"category_scores_gemma":[0.010495319,0.0011507695,0.0018893022,0.001299974,0.0024120514,0.004154797,0.0029462494,0.0032128796,0.0012406347],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00053325534,0.00028292552,0.0034314415,0.00020593223,0.00011894779,0.00044052466,0.0011024331,0.11664604,0.015102339,0.8307017,0.00885421,0.02258012],"study_design_scores_gemma":[0.00012946827,0.000097951626,0.0013317787,0.00004598481,0.000049406728,0.0003044387,0.00019029081,0.5775726,0.0034908266,0.41301623,0.0037265995,0.000044392473],"about_ca_topic_score_codex":0.0037236626,"about_ca_topic_score_gemma":0.0042930343,"teacher_disagreement_score":0.007856209,"about_ca_system_score_codex":0.0021877298,"about_ca_system_score_gemma":0.0010166793,"threshold_uncertainty_score":0.026281655},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007847125,0.012321929,0.0021341818,0.18357942,0.058656886,0.0002819185,0.0016697728,0.004494842,0.729014],"genre_scores_gemma":[0.0050063543,0.004854373,0.0014727339,0.02709333,0.00232521,0.00011206661,0.00041107985,0.00071647536,0.9580084],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.999271,0.00013417324,0.000034212262,0.0000778163,0.00028005015,0.00020280218],"domain_scores_gemma":[0.99695504,0.00011880686,0.000118243275,0.00007383867,0.0005419773,0.002192116],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0012131748,0.00049189274,0.00068562955,0.000529918,0.003046602,0.0046193074,0.00075606426,0.003235282,0.6573853],"category_scores_gemma":[0.0058396757,0.00038419937,0.0007816371,0.00041635102,0.00086718786,0.0046655745,0.0026742802,0.0031297212,0.52639353],"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.000042691492,0.000075570024,0.0001974317,0.00009913374,0.000002092366,0.00012585934,0.00009455889,0.00000824819,0.00015912826,0.0006350585,0.9439538,0.05460635],"study_design_scores_gemma":[0.000007488459,0.000031626907,0.00034899707,0.00009002331,0.000001961241,0.00023599128,0.00042258724,0.000010917194,0.00007910607,0.0002998546,0.9984623,0.000009237342],"about_ca_topic_score_codex":0.0024994153,"about_ca_topic_score_gemma":0.008245708,"teacher_disagreement_score":0.3426147,"about_ca_system_score_codex":0.0006854081,"about_ca_system_score_gemma":0.002308099,"threshold_uncertainty_score":0.4886983},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.075425744,0.006725115,0.003888653,0.0007929825,0.00057325064,0.00023411142,0.0013746659,0.0008376867,0.91014767],"genre_scores_gemma":[0.7352822,0.004707827,0.007825847,0.0010734106,0.00039650797,0.00031942088,0.0026005378,0.00020864654,0.24758565],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9997881,0.000027700033,0.000010255406,0.00006705374,0.000063814994,0.000043146287],"domain_scores_gemma":[0.999845,0.00002694379,0.000034197263,0.000024693483,0.000047138343,0.000021996671],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020649296,0.00090106844,0.00034527047,0.001452499,0.0025344242,0.0008822583,0.000717659,0.00053850916,0.051648714],"category_scores_gemma":[0.00050419796,0.0002120966,0.00016707713,0.00091000006,0.0009039914,0.001216549,0.0015551021,0.0010469002,0.011710535],"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.0002984234,0.00012223968,0.009116415,0.00058249425,0.00001405599,0.002077197,0.001757478,0.00031526003,0.0068215234,0.01746833,0.053960204,0.90746635],"study_design_scores_gemma":[0.000024772786,0.00007191119,0.04738104,0.00032730654,0.000016794938,0.0026479184,0.0010933658,0.00028107638,0.0015177683,0.0019522795,0.9446728,0.000012881463],"about_ca_topic_score_codex":0.0057275253,"about_ca_topic_score_gemma":0.012979051,"teacher_disagreement_score":0.051648714,"about_ca_system_score_codex":0.0009412146,"about_ca_system_score_gemma":0.0005510245,"threshold_uncertainty_score":0.17278212},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.76908743,0.00044793327,0.11035127,0.0018089927,0.0001941262,0.00022690652,0.0003007967,0.00018237876,0.11740016],"genre_scores_gemma":[0.958958,0.00023670985,0.023608113,0.00012533258,0.000016399905,0.00013672056,0.00012819479,0.000056567133,0.016734071],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990049,0.00042920563,0.000050090264,0.00018566172,0.00013509135,0.00019501375],"domain_scores_gemma":[0.9988324,0.00052285776,0.00011491884,0.00009517589,0.000091302914,0.00034327968],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006856452,0.0007343086,0.0005924722,0.00049621944,0.0019037994,0.0020792205,0.00094001816,0.001272587,0.010023418],"category_scores_gemma":[0.0030963935,0.0003494724,0.0006275324,0.0005640717,0.0032869752,0.004326068,0.0024113355,0.0010290316,0.0006755975],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00042864782,0.000046028967,0.0012041794,0.00008931488,0.000041968204,0.00058529596,0.0014652871,0.022852782,0.0032271568,0.96029013,0.0020142137,0.007754944],"study_design_scores_gemma":[0.00012635326,0.00022200447,0.0008333425,0.00005163932,0.000046499394,0.0004531323,0.0019976287,0.09724384,0.0023520102,0.8680036,0.028603783,0.000066198285],"about_ca_topic_score_codex":0.0070969732,"about_ca_topic_score_gemma":0.0075499164,"teacher_disagreement_score":0.010023418,"about_ca_system_score_codex":0.001866552,"about_ca_system_score_gemma":0.0011121442,"threshold_uncertainty_score":0.033531666},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16744033,0.00022024348,0.8081463,0.00055462116,0.00006620449,0.00017694783,0.000569035,0.00095228426,0.021873988],"genre_scores_gemma":[0.59707165,0.0002588416,0.38755956,0.00029607755,0.00009924736,0.00059976353,0.0011843583,0.00046692547,0.0124635855],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979703,0.00066717854,0.00011102052,0.00047139736,0.00048762784,0.00029246637],"domain_scores_gemma":[0.99247265,0.0032034852,0.0005695622,0.0024512482,0.00061971054,0.00068335905],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015681925,0.00061343855,0.00093636307,0.0009036413,0.001704191,0.0014521491,0.0014765096,0.0010321572,0.005270056],"category_scores_gemma":[0.007836138,0.0010098832,0.0012377318,0.0010187324,0.0017866351,0.0027383976,0.003304685,0.002467057,0.0014888728],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00036521797,0.0002721916,0.0037959989,0.0001906924,0.00006952428,0.0005811953,0.0008429453,0.04219275,0.03402115,0.81756216,0.009641093,0.09046506],"study_design_scores_gemma":[0.00010708498,0.00022073856,0.0016432762,0.00005454344,0.000060612634,0.000960661,0.00017611237,0.237528,0.02938854,0.7100048,0.019739976,0.00011564809],"about_ca_topic_score_codex":0.000394884,"about_ca_topic_score_gemma":0.00065955304,"teacher_disagreement_score":0.005270056,"about_ca_system_score_codex":0.0010593907,"about_ca_system_score_gemma":0.0012986759,"threshold_uncertainty_score":0.0176301},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.84805274,0.00096372777,0.12002517,0.0021636467,0.00006569192,0.000029283214,0.00027518728,0.00051972683,0.027904876],"genre_scores_gemma":[0.9563658,0.0006085535,0.039138243,0.0002570492,0.000021334741,0.000021188163,0.00018203944,0.000098568366,0.0033072287],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99985147,0.000026963397,0.00000751981,0.000048921258,0.00003857109,0.000026448006],"domain_scores_gemma":[0.9995493,0.00010933036,0.000071773524,0.000121827914,0.00006769908,0.00008005557],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003311009,0.00018751132,0.00013782734,0.00032325584,0.00051115995,0.0007915259,0.00033658906,0.00035358957,0.0014909017],"category_scores_gemma":[0.0006312558,0.00013198836,0.00026882044,0.00036302605,0.0016033716,0.0013349081,0.000882471,0.0009811653,0.0003598241],"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.00036465563,0.000069761,0.009339726,0.0002823904,0.00005707416,0.00050034345,0.0013420528,0.013439594,0.35564715,0.5146107,0.0025693923,0.10177718],"study_design_scores_gemma":[0.000052839452,0.0003927588,0.03862941,0.00012559409,0.000053315063,0.0016211023,0.0013318436,0.03104781,0.10697457,0.6753947,0.14424878,0.0001272249],"about_ca_topic_score_codex":0.002012171,"about_ca_topic_score_gemma":0.002342653,"teacher_disagreement_score":0.002012171,"about_ca_system_score_codex":0.0011576478,"about_ca_system_score_gemma":0.0006444305,"threshold_uncertainty_score":0.008399308},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9262811,0.00078836735,0.046312965,0.00071133283,0.000038750215,0.000025026464,0.00029976375,0.00014645475,0.025396235],"genre_scores_gemma":[0.99474853,0.00014107542,0.0032842746,0.000041184463,0.000028124365,0.000025005811,0.00008881035,0.000029765848,0.0016131831],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99939084,0.00016282764,0.000027820019,0.00015313829,0.00013257109,0.00013266937],"domain_scores_gemma":[0.9963439,0.0022615406,0.00033437737,0.00033229386,0.00025895366,0.0004689526],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00094922655,0.00041860447,0.00055843603,0.00196411,0.0012478514,0.0022506616,0.0011457894,0.00063178723,0.0041007022],"category_scores_gemma":[0.0053682304,0.0004963204,0.00053144054,0.0007895529,0.0037037707,0.0063919113,0.0021283317,0.0013640833,0.00023471426],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001448733,0.000022171447,0.0029972263,0.0001085556,0.00002194832,0.00011239829,0.0010089403,0.0036389984,0.0031213665,0.9811973,0.0008585207,0.0067676585],"study_design_scores_gemma":[0.000011982227,0.000015908941,0.0015649174,0.000027719372,0.00002159802,0.00020109839,0.00032349315,0.010928891,0.002544244,0.9825105,0.0018257644,0.000023744027],"about_ca_topic_score_codex":0.0008578803,"about_ca_topic_score_gemma":0.0010536882,"teacher_disagreement_score":0.0041007022,"about_ca_system_score_codex":0.0010213923,"about_ca_system_score_gemma":0.00034546608,"threshold_uncertainty_score":0.013718247},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9359505,0.0003000158,0.040877778,0.00056455284,0.000028216808,0.000025299438,0.00034624783,0.000109772984,0.02179766],"genre_scores_gemma":[0.9837075,0.0002579648,0.013380288,0.000043793098,0.000037628794,0.000025929385,0.00030815246,0.00004449301,0.0021941338],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996588,0.000059130907,0.0000129578975,0.00009107083,0.000088270725,0.00008964412],"domain_scores_gemma":[0.9976017,0.0012636574,0.00035746268,0.00024272842,0.00023734453,0.00029703116],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004512799,0.0002687725,0.0005103211,0.0012905587,0.0012219719,0.0016895295,0.00072533084,0.00051136833,0.003588963],"category_scores_gemma":[0.0036174087,0.00023555341,0.00040325156,0.0009144385,0.0018128572,0.0028603615,0.0007186523,0.0010213709,0.00032061938],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027084607,0.000088102,0.009430271,0.00023957332,0.000026910777,0.00043308662,0.00076784886,0.018901236,0.008514017,0.9345876,0.002797179,0.023943342],"study_design_scores_gemma":[0.000025668449,0.000059561076,0.0032370614,0.000033528326,0.00002094934,0.00041291252,0.00041545392,0.04276985,0.0046663345,0.944337,0.0039985282,0.000023131422],"about_ca_topic_score_codex":0.0010013955,"about_ca_topic_score_gemma":0.0011979875,"teacher_disagreement_score":0.003588963,"about_ca_system_score_codex":0.0009901776,"about_ca_system_score_gemma":0.00059299474,"threshold_uncertainty_score":0.012006342},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24847491,0.0014487212,0.6054872,0.0060925735,0.00032488193,0.00007427836,0.0004630057,0.00046474874,0.13716966],"genre_scores_gemma":[0.9256849,0.00088864757,0.059128862,0.0006064085,0.00030283944,0.00013537011,0.00017315027,0.00013206413,0.012947756],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987382,0.0002435309,0.00006746247,0.0002629024,0.0004903544,0.00019746482],"domain_scores_gemma":[0.9942139,0.0035153187,0.00043376876,0.00058451074,0.00059889606,0.000653621],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037606605,0.00050244806,0.0008013854,0.0025984256,0.0027131722,0.0024468235,0.0019441212,0.0010297779,0.0045186877],"category_scores_gemma":[0.011061102,0.00039802067,0.0013028906,0.002151328,0.0070658987,0.0073766205,0.0034753282,0.002860024,0.0005434251],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005836828,0.0000045092415,0.00019794032,0.000008168274,0.0000015557714,0.000023862238,0.0000760622,0.0007597756,0.00019894162,0.99725914,0.00024651582,0.0012176499],"study_design_scores_gemma":[0.0000042969427,0.0000061965734,0.00022400124,0.000009128121,0.000002820585,0.000044337634,0.000034508656,0.010467945,0.00028763645,0.9873569,0.0015535079,0.000008666638],"about_ca_topic_score_codex":0.0053974465,"about_ca_topic_score_gemma":0.0050460603,"teacher_disagreement_score":0.0053974465,"about_ca_system_score_codex":0.0039814473,"about_ca_system_score_gemma":0.0018867735,"threshold_uncertainty_score":0.02888751},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15801811,0.008665054,0.57982343,0.012336313,0.0005721429,0.00016105358,0.0010240924,0.000855122,0.23854464],"genre_scores_gemma":[0.9126665,0.004027971,0.067074716,0.0005392062,0.0008818049,0.00023855313,0.00025185134,0.00016973623,0.014149708],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99863666,0.00045291425,0.00005323847,0.00028642823,0.00037555,0.0001952282],"domain_scores_gemma":[0.9885244,0.008560379,0.0007208098,0.00089823036,0.00067509705,0.00062105723],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001259113,0.00055574154,0.00063591026,0.0028862443,0.0015461647,0.0033195224,0.0012076354,0.0012161928,0.008122338],"category_scores_gemma":[0.0106089935,0.00041809047,0.0006368066,0.003567355,0.005074032,0.007100152,0.0030416632,0.0030291248,0.000692313],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013985104,0.00001206797,0.00022375614,0.00004733564,0.000004143166,0.000044277167,0.00012593548,0.008506784,0.0004822524,0.9837299,0.0015729569,0.005236529],"study_design_scores_gemma":[0.0000041606036,0.000010048888,0.00016014406,0.00003372483,0.000004633603,0.00008443603,0.00006559675,0.044034462,0.00082090497,0.9476793,0.00708819,0.000014469886],"about_ca_topic_score_codex":0.0022776134,"about_ca_topic_score_gemma":0.0016791415,"teacher_disagreement_score":0.008122338,"about_ca_system_score_codex":0.003658638,"about_ca_system_score_gemma":0.0009998616,"threshold_uncertainty_score":0.02717191},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.048110735,0.028009418,0.54588866,0.033514038,0.0031689142,0.00019144872,0.0017117539,0.0011992941,0.33820587],"genre_scores_gemma":[0.4882789,0.048111007,0.27215418,0.010311499,0.008362027,0.0009321342,0.0041129612,0.0017740249,0.16596325],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9965173,0.00077226537,0.00018612313,0.0011178122,0.0010145362,0.0003919546],"domain_scores_gemma":[0.99022293,0.0071839695,0.0003136357,0.0011987817,0.0008176868,0.00026297625],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031699105,0.0014147264,0.0011382955,0.004001884,0.0034949968,0.005414552,0.0028440794,0.0023204365,0.021542279],"category_scores_gemma":[0.01223608,0.0011755952,0.0036708396,0.0045888755,0.0065527945,0.014998418,0.004239777,0.0076541165,0.00400802],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026900292,0.00004321904,0.0006324931,0.00029772884,0.000023997873,0.00007920593,0.00058503886,0.0018246558,0.0005666321,0.9686818,0.008056876,0.0191815],"study_design_scores_gemma":[0.000018586472,0.00002775394,0.00042404892,0.00018435036,0.00003154109,0.00019067102,0.00038011424,0.005112278,0.0014674716,0.90817106,0.083967395,0.000024814753],"about_ca_topic_score_codex":0.0038905276,"about_ca_topic_score_gemma":0.005193035,"teacher_disagreement_score":0.021542279,"about_ca_system_score_codex":0.004872621,"about_ca_system_score_gemma":0.0014066542,"threshold_uncertainty_score":0.07206613},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.036273573,0.0014900765,0.9304299,0.0016951496,0.00023031079,0.00022557483,0.00035202602,0.0006392823,0.028664056],"genre_scores_gemma":[0.5755532,0.0028096857,0.37141663,0.0010520162,0.0015071877,0.001678625,0.0014387084,0.0009576771,0.04358635],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983896,0.00068051816,0.00006326866,0.000356437,0.00035985454,0.0001502435],"domain_scores_gemma":[0.99370813,0.004439812,0.00034722866,0.00044903072,0.0007339357,0.00032185978],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020857786,0.0010175388,0.0011200983,0.0026319143,0.0014534461,0.0021006803,0.0021143619,0.0014593252,0.009069567],"category_scores_gemma":[0.011235828,0.0005547337,0.0017029918,0.0014586415,0.001989598,0.003498895,0.0028889917,0.0038405897,0.0019540454],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016855348,0.00010150917,0.0010980004,0.00038467243,0.00008499969,0.00018626165,0.00048573338,0.070478775,0.0040641176,0.84557766,0.012107112,0.06526256],"study_design_scores_gemma":[0.00002992314,0.000054462733,0.00022476423,0.000045940662,0.000028207562,0.00007574407,0.000087779656,0.40570328,0.0014402481,0.5848887,0.007394559,0.00002636445],"about_ca_topic_score_codex":0.001108831,"about_ca_topic_score_gemma":0.0010027441,"teacher_disagreement_score":0.009069567,"about_ca_system_score_codex":0.0020236387,"about_ca_system_score_gemma":0.0012405898,"threshold_uncertainty_score":0.030340731},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9964126,0.0009630644,0.00015734749,0.00002802534,0.0000029227788,0.0000044239678,0.0011065934,0.0000075412636,0.0013174154],"genre_scores_gemma":[0.9933988,0.0006612125,0.00042991666,0.00002780803,0.0000016386106,0.0000065893896,0.0012662438,0.000009070319,0.0041986434],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99991465,0.000009246008,0.000010767114,0.000025651581,0.000024971127,0.000014753634],"domain_scores_gemma":[0.9996424,0.00008401085,0.00005796862,0.0000182378,0.00010782517,0.00008958649],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000113878334,0.00013243919,0.00019889124,0.0008968389,0.00053142913,0.00040968676,0.0003092557,0.00020813994,0.00089749286],"category_scores_gemma":[0.0002294555,0.00018852708,0.00008554792,0.000712282,0.00032849406,0.00038192692,0.00031370556,0.00026400492,0.00027511356],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011325768,0.00013435126,0.07735053,0.00023943646,0.000047771475,0.00073536887,0.0010641868,0.0005345717,0.90326244,0.0006833886,0.00033876323,0.0144767165],"study_design_scores_gemma":[0.000018389199,0.00042718224,0.9232992,0.000028151671,0.000043755157,0.0010518264,0.0020240627,0.0006698109,0.068913005,0.00045633534,0.0030330163,0.00003524168],"about_ca_topic_score_codex":0.038703337,"about_ca_topic_score_gemma":0.062291484,"teacher_disagreement_score":0.038703337,"about_ca_system_score_codex":0.0006254048,"about_ca_system_score_gemma":0.0005828858,"threshold_uncertainty_score":0.07695609},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009724855,0.0008683041,0.0010483101,0.008040685,0.001219509,0.000040003437,0.0042088693,0.0018527122,0.9817492],"genre_scores_gemma":[0.0026041574,0.000294904,0.00047120874,0.00034810856,0.000046340145,0.0000067392984,0.0010600003,0.0003468452,0.99482155],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9980869,0.0000608526,0.00003504389,0.00018302297,0.0010857686,0.00054831535],"domain_scores_gemma":[0.99285454,0.00034273666,0.000115684765,0.0003787454,0.003800936,0.0025074615],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0013364563,0.0008990428,0.0007864509,0.0030013537,0.0042647743,0.008358837,0.0020332634,0.0029552574,0.67218554],"category_scores_gemma":[0.003931661,0.0005308995,0.0005852294,0.0033478262,0.0016308025,0.0044407924,0.0020209325,0.002071152,0.35725966],"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.000030706404,0.000029080835,0.00021477441,0.000057882753,0.000001976467,0.000033794764,0.00006738772,0.00010084684,0.00016030713,0.03000645,0.89726627,0.07203056],"study_design_scores_gemma":[0.0000046796454,0.000006931935,0.0003300908,0.000048434697,0.000001995571,0.000025581337,0.00010557301,0.00017229118,0.00018819794,0.0030878016,0.99602073,0.000007805082],"about_ca_topic_score_codex":0.5835098,"about_ca_topic_score_gemma":0.7578882,"teacher_disagreement_score":0.67218554,"about_ca_system_score_codex":0.017345551,"about_ca_system_score_gemma":0.035522196,"threshold_uncertainty_score":0.837886},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.041365426,0.02598124,0.001186575,0.06135224,0.033470467,0.0012127241,0.042345837,0.0006410054,0.7924444],"genre_scores_gemma":[0.024932638,0.0063785804,0.0004685285,0.0050231386,0.0030007835,0.00036603946,0.005818771,0.00008800568,0.95392364],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.997689,0.0004206478,0.00013999346,0.00018310762,0.001109497,0.00045774656],"domain_scores_gemma":[0.9929803,0.0006457509,0.00063584524,0.00035987768,0.0037419342,0.0016361633],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002334022,0.0005813091,0.00020529659,0.0035799146,0.0028792184,0.0030433366,0.00094747957,0.0014793172,0.11235381],"category_scores_gemma":[0.010416962,0.00036309476,0.00025397667,0.002724958,0.00063135027,0.001453527,0.0015001913,0.002069108,0.053516],"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.000072484436,0.00008621879,0.0052830605,0.00017182848,0.0000037703376,0.00019472445,0.00096737494,0.000019828714,0.00017525458,0.0026417417,0.9521698,0.038213804],"study_design_scores_gemma":[0.000005817869,0.000023533108,0.007069416,0.00007216063,0.0000023931516,0.00012037184,0.0014725036,0.000021534504,0.00010136664,0.00012519449,0.99097764,0.000008009974],"about_ca_topic_score_codex":0.011488313,"about_ca_topic_score_gemma":0.018395334,"teacher_disagreement_score":0.11235381,"about_ca_system_score_codex":0.0016150437,"about_ca_system_score_gemma":0.004627449,"threshold_uncertainty_score":0.37586093},"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":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02583914,0.8901103,0.0023773978,0.0109515395,0.003192884,0.0005506929,0.032597132,0.000082513514,0.03429826],"genre_scores_gemma":[0.21051049,0.7382444,0.004736529,0.006232808,0.0025728485,0.0014142789,0.020110779,0.000107196545,0.016070668],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9964785,0.00103838,0.0010004848,0.00053649984,0.0007532821,0.0001929479],"domain_scores_gemma":[0.98902714,0.006399489,0.002301157,0.0004260977,0.0016778226,0.00016822631],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035423555,0.0005950386,0.0012174607,0.0031204817,0.00077472255,0.002647373,0.00094528886,0.0011407818,0.03239368],"category_scores_gemma":[0.02290449,0.00041398153,0.0018269131,0.0056300354,0.0004941864,0.0017362349,0.0011968423,0.0013749236,0.0032404233],"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.0021504804,0.0002674174,0.10792064,0.1587187,0.007993646,0.0009655788,0.002831272,0.0007189895,0.0007067411,0.011830697,0.19591816,0.50997764],"study_design_scores_gemma":[0.00048320543,0.00053367147,0.18995126,0.14261706,0.013166396,0.0032324144,0.0042700986,0.00057253474,0.0012464476,0.008072567,0.63568527,0.00016913848],"about_ca_topic_score_codex":0.01932877,"about_ca_topic_score_gemma":0.030320274,"teacher_disagreement_score":0.03239368,"about_ca_system_score_codex":0.002018064,"about_ca_system_score_gemma":0.0045181043,"threshold_uncertainty_score":0.10836762},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.90738726,0.0024564585,0.00023580584,0.004549071,0.0002204937,0.000014450658,0.000050381506,0.000013656631,0.08507241],"genre_scores_gemma":[0.9910992,0.0007746085,0.000061471575,0.00022132584,0.00006326528,0.0000077448285,0.000017235123,0.000027388971,0.0077278013],"study_design_codex":"qualitative","study_design_gemma":"qualitative","domain_scores_codex":[0.9974492,0.0015562715,0.000057336394,0.00021208065,0.00029522847,0.00042987656],"domain_scores_gemma":[0.99740064,0.001630995,0.0003358268,0.00015250515,0.00023086366,0.00024921593],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025224881,0.00045149762,0.00039406365,0.0017574531,0.009691612,0.008830561,0.0006540237,0.0011249348,0.008284771],"category_scores_gemma":[0.004430426,0.0004316377,0.00015439665,0.0026322107,0.01772919,0.004247454,0.004388095,0.0025060507,0.00054413546],"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.000027177362,0.000007826163,0.0013373513,0.00003654084,0.000001991858,0.00048354213,0.98967326,0.0000068166673,0.00026842466,0.0043099495,0.00096232793,0.0028848974],"study_design_scores_gemma":[0.000004129429,0.000021967917,0.008149748,0.0001419972,0.0000032861792,0.00038521396,0.9638409,0.0000184366,0.00026946102,0.00034052203,0.026813958,0.00001038168],"about_ca_topic_score_codex":0.033165216,"about_ca_topic_score_gemma":0.059473157,"teacher_disagreement_score":0.033165216,"about_ca_system_score_codex":0.0048826938,"about_ca_system_score_gemma":0.0018647425,"threshold_uncertainty_score":0.06594437},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14437678,0.022868013,0.46447808,0.034381457,0.0023646215,0.00012863845,0.00076350203,0.00057383964,0.33006513],"genre_scores_gemma":[0.8688873,0.010199741,0.048738528,0.0048671034,0.004333741,0.00027128484,0.00035631677,0.000251283,0.06209458],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99886984,0.00040289012,0.00003166514,0.00016219719,0.00038570334,0.00014770152],"domain_scores_gemma":[0.995906,0.0028884818,0.00022045884,0.00030408378,0.00045926144,0.00022170531],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020466188,0.0006716727,0.0007333632,0.0020937119,0.0018118125,0.0024133848,0.0014583264,0.0012456196,0.008085917],"category_scores_gemma":[0.008458167,0.00036676382,0.00085186877,0.0015950478,0.005431292,0.006537348,0.0025036894,0.0027200228,0.0011215381],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000052337596,0.000003831555,0.00007845868,0.00001830876,0.0000020898744,0.000016681592,0.00008101619,0.00030150695,0.00006840058,0.9961648,0.0010749332,0.0021848823],"study_design_scores_gemma":[0.0000055184587,0.000012135777,0.00022580102,0.000022026838,0.0000030006518,0.00003900463,0.000062926476,0.0025965283,0.0001420203,0.98885554,0.008028944,0.0000065444638],"about_ca_topic_score_codex":0.0022736953,"about_ca_topic_score_gemma":0.0017471794,"teacher_disagreement_score":0.008085917,"about_ca_system_score_codex":0.0024308017,"about_ca_system_score_gemma":0.000854528,"threshold_uncertainty_score":0.027050078},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009799759,0.007872544,0.23847404,0.0063537057,0.0036580067,0.0005920881,0.012262282,0.008673299,0.7123143],"genre_scores_gemma":[0.2058651,0.010422165,0.114913836,0.0037448942,0.0028776012,0.001019391,0.03734643,0.0038322285,0.6199783],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9972126,0.0004591742,0.0002678495,0.0009111639,0.00075120106,0.00039804136],"domain_scores_gemma":[0.99698573,0.00060514914,0.00018428321,0.0012027129,0.00081302365,0.0002090442],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001371865,0.0016845898,0.001527653,0.0028018858,0.0032656002,0.006647108,0.0023944199,0.0024845554,0.21000928],"category_scores_gemma":[0.006816433,0.00088896806,0.0019355705,0.0037585068,0.0017482558,0.011007033,0.0066521605,0.0025498546,0.10998244],"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.00012438587,0.0000533985,0.0008678235,0.0006525377,0.0000665101,0.00025059117,0.0004644808,0.0029912586,0.0012779809,0.6193019,0.19789188,0.17605732],"study_design_scores_gemma":[0.000025635489,0.000030664345,0.00037184925,0.00015076686,0.000025146319,0.00031951396,0.00019551287,0.0041628927,0.0009250823,0.27230918,0.7214516,0.000032116288],"about_ca_topic_score_codex":0.0028363112,"about_ca_topic_score_gemma":0.002674518,"teacher_disagreement_score":0.21000928,"about_ca_system_score_codex":0.0030058972,"about_ca_system_score_gemma":0.0022487189,"threshold_uncertainty_score":0},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98602,0.0003580548,0.0056051966,0.00035134944,0.000034447014,0.000014656267,0.00029004097,0.00004638956,0.0072798207],"genre_scores_gemma":[0.99608827,0.00018656428,0.0025333788,0.000021193502,0.00004843299,0.000028288889,0.00021827681,0.000018344299,0.0008573675],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999127,0.00020844492,0.000095593445,0.00022124547,0.00018809603,0.00015963685],"domain_scores_gemma":[0.9854617,0.010200815,0.0019946303,0.0007825702,0.0005078498,0.0010524228],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014076218,0.0004103927,0.0005669303,0.002614889,0.0012080658,0.002379682,0.00094525516,0.00075212657,0.0039964784],"category_scores_gemma":[0.008829769,0.0003989599,0.00034117547,0.0012160619,0.0030673426,0.004179558,0.0011908618,0.00067755516,0.00025964002],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0034968078,0.00028094221,0.08227803,0.0004966081,0.00021055006,0.0018579802,0.003461802,0.02082633,0.08132374,0.7355544,0.0043963543,0.065816455],"study_design_scores_gemma":[0.00024178489,0.0005008205,0.037198704,0.00019250829,0.00017409763,0.004834139,0.004024454,0.054108314,0.06468988,0.8237827,0.01003474,0.00021786251],"about_ca_topic_score_codex":0.00036474827,"about_ca_topic_score_gemma":0.00039996675,"teacher_disagreement_score":0.0039964784,"about_ca_system_score_codex":0.00061296107,"about_ca_system_score_gemma":0.00039995494,"threshold_uncertainty_score":0.01336962},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016292164,0.003889183,0.21401751,0.018059628,0.0014561076,0.00016533252,0.0014218418,0.00069179444,0.74400645],"genre_scores_gemma":[0.548911,0.0049748793,0.14096121,0.012494595,0.0019692332,0.00085791625,0.0017216472,0.0010936732,0.28701594],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99825376,0.00030853855,0.00009815996,0.0005552667,0.00049625547,0.00028804824],"domain_scores_gemma":[0.9982072,0.00073188066,0.000087744345,0.00029329536,0.0005095064,0.0001703254],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019305943,0.0009838879,0.0012133012,0.0019544563,0.0042713624,0.0027560361,0.0017216614,0.0019252873,0.04457109],"category_scores_gemma":[0.005089358,0.0008505296,0.0017656896,0.0019764174,0.005092483,0.010941573,0.005824434,0.005890706,0.009027282],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009095669,0.000006876879,0.00007033621,0.000015896856,0.00000425692,0.000019862164,0.0001084288,0.000079625235,0.00008086018,0.98938483,0.0066185566,0.0036014097],"study_design_scores_gemma":[0.000013026976,0.00000911696,0.00013713216,0.00001662016,0.0000065307763,0.00007605677,0.000044459026,0.00063748396,0.00016319097,0.94041276,0.058474414,0.000009224806],"about_ca_topic_score_codex":0.0048945057,"about_ca_topic_score_gemma":0.0032749244,"teacher_disagreement_score":0.04457109,"about_ca_system_score_codex":0.004108534,"about_ca_system_score_gemma":0.0015181003,"threshold_uncertainty_score":0.14910519},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6722358,0.0024744926,0.00082056463,0.07456231,0.00037064578,0.00009429737,0.0033313641,0.00013349217,0.24597704],"genre_scores_gemma":[0.90615475,0.0008540828,0.00033900558,0.0053741285,0.00004173854,0.000039464,0.0008063492,0.00003570505,0.0863548],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.99895215,0.00020293576,0.000024552313,0.00013215348,0.00024212629,0.00044607758],"domain_scores_gemma":[0.99490947,0.00088379,0.0004615258,0.0003303879,0.0013786593,0.0020361957],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016361364,0.00018332462,0.00027604497,0.0016975907,0.0021746175,0.005129359,0.0012034458,0.001496731,0.013107078],"category_scores_gemma":[0.0053299726,0.00022295311,0.00025270204,0.0026384625,0.0018585738,0.0011722993,0.002277138,0.0021380028,0.0012604623],"study_design_candidate":"observational","study_design_consensus":null,"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.0005911402,0.0004136097,0.20481303,0.00021281473,0.00014282651,0.0018948418,0.009922723,0.004398966,0.0045255492,0.41225272,0.18502097,0.17581087],"study_design_scores_gemma":[0.00011201833,0.00011653341,0.48373654,0.00021793555,0.000055505367,0.00029879247,0.020160215,0.0031315018,0.0021485204,0.042582504,0.44732484,0.00011506356],"about_ca_topic_score_codex":0.6794007,"about_ca_topic_score_gemma":0.85448974,"teacher_disagreement_score":0.32059932,"about_ca_system_score_codex":0.038309067,"about_ca_system_score_gemma":0.033467285,"threshold_uncertainty_score":0.64497477},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011645671,0.00091799855,0.0017506888,0.005359808,0.005585778,0.00056393165,0.013230284,0.0009284467,0.97049856],"genre_scores_gemma":[0.0041218745,0.0005656764,0.0006226949,0.00165333,0.0013319462,0.00030479537,0.0041533015,0.00027071708,0.98697567],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.998626,0.00014744354,0.000053115476,0.00009793573,0.0009035148,0.0001720454],"domain_scores_gemma":[0.9953548,0.0009804181,0.0002566347,0.0005352911,0.0021761027,0.0006967989],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0015667635,0.0010103836,0.0008212697,0.0020621615,0.0019358819,0.0053494023,0.0012744465,0.0043748305,0.52378434],"category_scores_gemma":[0.008418926,0.00087007723,0.0006269048,0.0017252424,0.0011209869,0.0032063685,0.0017060214,0.0032588944,0.42687884],"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.000099059565,0.000043754982,0.00006685481,0.00008581676,0.0000017963475,0.000044388624,0.000023041077,0.00010832644,0.0002660162,0.011173184,0.9749145,0.013173255],"study_design_scores_gemma":[0.000024789762,0.00006358543,0.000860935,0.00011229797,0.0000022235165,0.000043659762,0.000033295146,0.00015891256,0.00028633795,0.004881757,0.993515,0.000017197357],"about_ca_topic_score_codex":0.009188822,"about_ca_topic_score_gemma":0.023775054,"teacher_disagreement_score":0.47621566,"about_ca_system_score_codex":0.00348726,"about_ca_system_score_gemma":0.0043984484,"threshold_uncertainty_score":0.67926383},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00037978298,0.0006268362,0.9952865,0.00015383103,0.000096574986,0.000052048385,0.00012792533,0.0008643199,0.0024122193],"genre_scores_gemma":[0.040038127,0.0026556768,0.947865,0.0003035332,0.00055884384,0.00051612203,0.0012426851,0.0007780051,0.006042022],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9964862,0.0018472259,0.00021168462,0.0005082076,0.00084733346,0.000099423625],"domain_scores_gemma":[0.99670804,0.0015266385,0.0002311632,0.0009061451,0.00055703084,0.000070959475],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002643254,0.0013833229,0.0015754671,0.0025813119,0.00082738977,0.0024316101,0.0024162647,0.0018515456,0.0071386783],"category_scores_gemma":[0.007897217,0.0009043955,0.0015457091,0.00431528,0.0014362336,0.0032884767,0.0019648008,0.0027812556,0.008611032],"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.00008081512,0.000085926236,0.00042610386,0.0005479378,0.00022376521,0.00024594192,0.00019255074,0.0611198,0.008961004,0.48268986,0.018797137,0.42662916],"study_design_scores_gemma":[0.000028328552,0.000106954576,0.00033585867,0.00006698622,0.00005827661,0.00040864057,0.000034908844,0.3868666,0.005958662,0.5467069,0.059339583,0.00008831428],"about_ca_topic_score_codex":0.0017297724,"about_ca_topic_score_gemma":0.00172364,"teacher_disagreement_score":0.0071386783,"about_ca_system_score_codex":0.0009789775,"about_ca_system_score_gemma":0.0016959751,"threshold_uncertainty_score":0.023881257},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.55622,0.0048094695,0.057932988,0.02121885,0.0013642967,0.00005696096,0.000926988,0.0008218802,0.35664856],"genre_scores_gemma":[0.9654988,0.0012421989,0.010041392,0.0027610657,0.0012235959,0.00011433096,0.0007179792,0.00013569086,0.018265009],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984205,0.0002738902,0.00005538961,0.000423494,0.00036160197,0.00046522493],"domain_scores_gemma":[0.99743277,0.0013643659,0.00017823007,0.00034665162,0.00035016934,0.00032783902],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019025328,0.0005038696,0.0011041095,0.0018843154,0.003931463,0.0025461887,0.0014728941,0.0020187602,0.00920175],"category_scores_gemma":[0.007995147,0.00038896335,0.0007832536,0.001467629,0.0045267213,0.0064636855,0.0028499232,0.0028673632,0.001887456],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007970658,0.000040741055,0.0012319987,0.00007100116,0.0000081957105,0.00016727233,0.0004789611,0.00148553,0.0006205457,0.9723665,0.013911287,0.009538265],"study_design_scores_gemma":[0.000011414701,0.000017409655,0.00052750215,0.000030064295,0.0000054469706,0.00013285752,0.00017433157,0.004666363,0.00033349992,0.98649746,0.007584728,0.000018946654],"about_ca_topic_score_codex":0.0029378696,"about_ca_topic_score_gemma":0.00230811,"teacher_disagreement_score":0.00920175,"about_ca_system_score_codex":0.0019887602,"about_ca_system_score_gemma":0.0010031769,"threshold_uncertainty_score":0.030782878},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.88406795,0.0009854013,0.09239284,0.0008471311,0.00007169005,0.00003623435,0.00040465634,0.00023976146,0.020954292],"genre_scores_gemma":[0.97419125,0.00037243337,0.020462086,0.00009084097,0.000073189054,0.00004627259,0.0003856958,0.00010822317,0.0042699617],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99929523,0.00012714059,0.000037348407,0.00024739065,0.00013857176,0.00015432342],"domain_scores_gemma":[0.99684614,0.0015434072,0.00054368796,0.000302914,0.00023766584,0.00052620866],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00076204224,0.00050839485,0.0007660325,0.0010858574,0.0010881543,0.0015281404,0.0011787175,0.0007650797,0.0047388086],"category_scores_gemma":[0.0048299553,0.0004926299,0.00059240893,0.0007333401,0.0010626789,0.0022346505,0.0010831311,0.00089819904,0.0002560533],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007175361,0.00028216682,0.024616485,0.0006951289,0.00031662543,0.0013969997,0.000598188,0.19891864,0.039618496,0.64992523,0.008884169,0.074030384],"study_design_scores_gemma":[0.00008543366,0.00023536496,0.00969753,0.0000826401,0.00014610533,0.0020099976,0.00045216217,0.37162223,0.01586191,0.5887392,0.010994795,0.00007257613],"about_ca_topic_score_codex":0.00045153074,"about_ca_topic_score_gemma":0.00082292175,"teacher_disagreement_score":0.0047388086,"about_ca_system_score_codex":0.0010732971,"about_ca_system_score_gemma":0.00034565746,"threshold_uncertainty_score":0.015852869},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48780382,0.008574221,0.46127924,0.0041545783,0.00021757434,0.0001278406,0.0009544902,0.00123581,0.03565235],"genre_scores_gemma":[0.97828454,0.0022733398,0.01616333,0.00031576844,0.0002687314,0.0001750332,0.00028937822,0.00020583768,0.0020240736],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9962675,0.0012722204,0.00015907103,0.0009756756,0.00069257617,0.0006329415],"domain_scores_gemma":[0.93237513,0.052807394,0.0045851567,0.0054829954,0.0019649372,0.0027842997],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004976937,0.00093108177,0.0018326271,0.0026556724,0.0016830603,0.0029001778,0.0023667521,0.001565601,0.0033575452],"category_scores_gemma":[0.049405042,0.0010168024,0.0010875552,0.0017555025,0.004584845,0.00753458,0.0044117384,0.0023748565,0.00045401094],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00049972447,0.00011781069,0.009043604,0.00039843866,0.00014466234,0.00045840503,0.0009571875,0.14853008,0.009678648,0.8035894,0.005530106,0.021051953],"study_design_scores_gemma":[0.000075661264,0.00020833792,0.004779279,0.0001901491,0.000123431,0.00079861534,0.0003125133,0.4285669,0.0078993365,0.550553,0.0063986573,0.00009408117],"about_ca_topic_score_codex":0.0011850812,"about_ca_topic_score_gemma":0.0011975968,"teacher_disagreement_score":0.004976937,"about_ca_system_score_codex":0.004001808,"about_ca_system_score_gemma":0.0006853075,"threshold_uncertainty_score":0.02903533},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04478216,0.001814527,0.90727144,0.001917828,0.00032869203,0.00006054633,0.00035141408,0.00018941608,0.04328405],"genre_scores_gemma":[0.8276426,0.0015843674,0.15760085,0.00095188647,0.00080516114,0.00030315245,0.00028239997,0.0001990938,0.010630409],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9941116,0.002070953,0.00027058157,0.00083371456,0.0022121817,0.00050104834],"domain_scores_gemma":[0.96960384,0.024751818,0.0012197987,0.0022298715,0.0015765403,0.0006181615],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007902228,0.0008909502,0.0010944626,0.002454933,0.0010109219,0.0035977198,0.0026841098,0.0015116271,0.009252736],"category_scores_gemma":[0.021792676,0.000688138,0.0019776507,0.0014148322,0.006141287,0.010034386,0.004084895,0.006296092,0.0007962123],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000035174555,0.000014263727,0.00010399497,0.000080399026,0.000021712904,0.000053769276,0.000058469508,0.016846118,0.0015353587,0.97721,0.00065905164,0.003381696],"study_design_scores_gemma":[0.000011916804,0.00004400235,0.00017072973,0.000039647217,0.000013568091,0.000118261596,0.000022620376,0.1411878,0.0019513732,0.8541566,0.0022521587,0.000031378073],"about_ca_topic_score_codex":0.0006200345,"about_ca_topic_score_gemma":0.00041291304,"teacher_disagreement_score":0.009252736,"about_ca_system_score_codex":0.002798938,"about_ca_system_score_gemma":0.00078553264,"threshold_uncertainty_score":0.0417915},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.78209865,0.0020508373,0.19533253,0.0029261867,0.00012510324,0.000036382335,0.0006213852,0.00021189141,0.016596999],"genre_scores_gemma":[0.97711617,0.00088417076,0.016746689,0.0002612144,0.0003186462,0.00009658261,0.00042008987,0.00007354699,0.004082797],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979126,0.000639861,0.000119163014,0.00035253505,0.0007707928,0.00020508078],"domain_scores_gemma":[0.9643511,0.026923498,0.0031322227,0.0015771148,0.0017293884,0.002286721],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021794776,0.0006897854,0.0022804055,0.005060337,0.0019898498,0.004682567,0.0023667072,0.0016150307,0.00401431],"category_scores_gemma":[0.025178865,0.001089198,0.00076262193,0.003848526,0.006029417,0.010770826,0.0046849763,0.0034415447,0.00030601688],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004325004,0.00001960802,0.0008879525,0.00006031596,0.000016587539,0.000056697983,0.00030002499,0.005318831,0.00042810882,0.98950315,0.0004961023,0.0028692614],"study_design_scores_gemma":[0.000010234641,0.0000121231205,0.00066112523,0.00001111691,0.0000077043815,0.00008663785,0.00011988334,0.01816511,0.00014519476,0.9802659,0.00050413696,0.0000108011345],"about_ca_topic_score_codex":0.0015457305,"about_ca_topic_score_gemma":0.0012832804,"teacher_disagreement_score":0.005060337,"about_ca_system_score_codex":0.0021634242,"about_ca_system_score_gemma":0.0005010064,"threshold_uncertainty_score":0.015696824},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5124623,0.0023122285,0.25179255,0.0038049761,0.00035667466,0.00004122339,0.0003940558,0.00041913812,0.22841685],"genre_scores_gemma":[0.9723546,0.00047231733,0.015875181,0.0003404636,0.00015689975,0.00005279344,0.0001536782,0.00007514288,0.010518788],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997874,0.00040752793,0.00009752407,0.00037165216,0.0007918113,0.00045754405],"domain_scores_gemma":[0.994561,0.0030247336,0.00038991284,0.00081103045,0.00056925736,0.0006440137],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002131929,0.0006483646,0.00085502316,0.0027656844,0.0027464933,0.003678626,0.001850425,0.0013097915,0.006814163],"category_scores_gemma":[0.006064847,0.00044176052,0.0008612137,0.0016844303,0.0048209587,0.009404261,0.0054283356,0.0042711296,0.00082400226],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010214531,0.000007025221,0.00007764624,0.000020886207,0.0000022739052,0.000020400588,0.00012085065,0.00029411932,0.00029003422,0.99771297,0.00021928309,0.0012242438],"study_design_scores_gemma":[0.0000067891688,0.00001083442,0.0001616315,0.00001703733,0.000004423792,0.00005722025,0.00007403248,0.0030014655,0.0005150491,0.9938817,0.0022596975,0.000010164299],"about_ca_topic_score_codex":0.0014289614,"about_ca_topic_score_gemma":0.001128503,"teacher_disagreement_score":0.006814163,"about_ca_system_score_codex":0.0020849658,"about_ca_system_score_gemma":0.00041175802,"threshold_uncertainty_score":0.022795618},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23115143,0.0012761849,0.6230903,0.006160419,0.0003405682,0.000074707525,0.00045819458,0.000520694,0.1369275],"genre_scores_gemma":[0.91159695,0.0008052378,0.0706314,0.0006831671,0.00031073444,0.00014446345,0.00019139485,0.00017213426,0.015464502],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987037,0.00023531694,0.00005885325,0.00028106678,0.0005280532,0.00019306167],"domain_scores_gemma":[0.995971,0.0023411212,0.00033629086,0.00042635106,0.00038942107,0.0005357972],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034042946,0.00054162147,0.0008042802,0.0026293546,0.0023744544,0.0024531318,0.0019582915,0.0010119443,0.005191683],"category_scores_gemma":[0.0091024,0.00042489433,0.0012694105,0.0017633507,0.00666191,0.006713838,0.003388232,0.0028986726,0.0005536814],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000052470637,0.000004313549,0.00015033003,0.0000077361465,0.0000014407947,0.000024259676,0.00006136958,0.0007413277,0.00020070565,0.9973036,0.00026333594,0.0012363901],"study_design_scores_gemma":[0.000004766299,0.000005994229,0.0001704934,0.000007515609,0.0000026788782,0.000044576114,0.000030838833,0.0141237285,0.00034044628,0.9836182,0.0016429554,0.000007781589],"about_ca_topic_score_codex":0.0042799353,"about_ca_topic_score_gemma":0.0037950343,"teacher_disagreement_score":0.005191683,"about_ca_system_score_codex":0.0036068526,"about_ca_system_score_gemma":0.001606417,"threshold_uncertainty_score":0.026169717},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37870702,0.013255453,0.33532867,0.039296612,0.0010474295,0.00016632226,0.0015373523,0.000943097,0.2297181],"genre_scores_gemma":[0.89829373,0.0050365245,0.077063166,0.0033536127,0.0014939205,0.00021924515,0.0014016154,0.00024537343,0.012892822],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.995331,0.0012761496,0.00027645944,0.0012269615,0.0013205844,0.0005688145],"domain_scores_gemma":[0.9701928,0.021416632,0.0020825376,0.0031765418,0.00211682,0.0010147243],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005885553,0.0006416108,0.0012389927,0.0027283553,0.004363474,0.00378449,0.0021315152,0.0027653885,0.0068948083],"category_scores_gemma":[0.02943915,0.0008095919,0.0013341149,0.0031875356,0.009056749,0.019499477,0.0029234388,0.003599845,0.001213729],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021607392,0.00018161339,0.0034453894,0.00028194443,0.000026632742,0.00040975361,0.0014206731,0.005482336,0.0016273316,0.948594,0.01211222,0.02620209],"study_design_scores_gemma":[0.00003461223,0.000047450747,0.0008455203,0.00006094935,0.000015446207,0.00033126166,0.0004365377,0.010707885,0.0019077213,0.97502375,0.010554399,0.000034429322],"about_ca_topic_score_codex":0.0021450978,"about_ca_topic_score_gemma":0.0011565584,"teacher_disagreement_score":0.0068948083,"about_ca_system_score_codex":0.002581803,"about_ca_system_score_gemma":0.0011554247,"threshold_uncertainty_score":0.031126142},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028279986,0.00092645956,0.6867758,0.0017025319,0.0005873948,0.00009547784,0.00041841163,0.0006624474,0.2805515],"genre_scores_gemma":[0.6550819,0.0017742732,0.1050664,0.0011475536,0.00069337134,0.0003381,0.0013575753,0.00087184197,0.23366897],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990434,0.00025316118,0.000059582133,0.00027354824,0.0002728703,0.000097467906],"domain_scores_gemma":[0.9980617,0.0007123902,0.00011466536,0.00068469235,0.00026025478,0.00016631384],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012508073,0.0009399237,0.00083559216,0.0009856006,0.0012658691,0.0025920726,0.0014315704,0.0011938512,0.015594712],"category_scores_gemma":[0.0044136425,0.00075736654,0.001019481,0.0008239029,0.00295899,0.007898528,0.0044425023,0.004591276,0.003930989],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000149287725,0.000005857582,0.000042908825,0.0000257011,0.000004458368,0.00002547144,0.00010584677,0.0003390645,0.0004850182,0.99379444,0.0008555795,0.004300799],"study_design_scores_gemma":[0.0000039250376,0.0000058276064,0.00004031715,0.000009057628,0.0000059401314,0.00004432244,0.00003375741,0.0017297323,0.0005303607,0.98897374,0.008618597,0.0000043908935],"about_ca_topic_score_codex":0.00033182578,"about_ca_topic_score_gemma":0.00032942486,"teacher_disagreement_score":0.015594712,"about_ca_system_score_codex":0.00093150727,"about_ca_system_score_gemma":0.0005787988,"threshold_uncertainty_score":0.05216956},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029567825,0.012225337,0.07007578,0.0026038878,0.0010104446,0.000035263674,0.000367799,0.00020100332,0.8839127],"genre_scores_gemma":[0.28724214,0.021657309,0.03193032,0.0006235567,0.0013979136,0.00015974238,0.00069812866,0.0003378806,0.655953],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9998729,0.000024634848,0.0000065336203,0.000021722106,0.00005968395,0.000014472472],"domain_scores_gemma":[0.9998709,0.000052287174,0.000008550532,0.000018535478,0.00003479249,0.000014890139],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001897167,0.00058386725,0.000424044,0.0014781436,0.00094319595,0.0019833709,0.0005424535,0.0004780388,0.008855764],"category_scores_gemma":[0.0005220046,0.00029021563,0.0002478075,0.001837053,0.0015144589,0.0031304087,0.0009995787,0.0014554656,0.0021330968],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000038721173,0.0000052730597,0.000028654547,0.000042255888,0.0000018296065,0.000019418057,0.000150773,0.00028660928,0.0003383832,0.9730871,0.0077078887,0.018328065],"study_design_scores_gemma":[0.0000021899048,0.000005453436,0.00017985464,0.000034269535,0.0000037019563,0.000117519936,0.00012388147,0.0007927204,0.00035005898,0.885951,0.11243307,0.0000063519833],"about_ca_topic_score_codex":0.0008685055,"about_ca_topic_score_gemma":0.001319423,"teacher_disagreement_score":0.008855764,"about_ca_system_score_codex":0.0011568067,"about_ca_system_score_gemma":0.0003889457,"threshold_uncertainty_score":0.029625475},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45300308,0.0014091011,0.43601695,0.0025459668,0.0002437731,0.00012829376,0.0009864871,0.00063190324,0.10503452],"genre_scores_gemma":[0.865015,0.0009283764,0.09582042,0.0010111702,0.00024640546,0.00029024162,0.00081032835,0.00027814155,0.035599854],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99919516,0.00022721985,0.000044201708,0.00024037223,0.00015742391,0.00013554569],"domain_scores_gemma":[0.9934204,0.003818228,0.00050475064,0.0010980875,0.00049968297,0.00065886445],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008219829,0.0007061428,0.0009617913,0.0017446514,0.0021784615,0.002656103,0.001623086,0.0010761649,0.007927629],"category_scores_gemma":[0.004357735,0.001091015,0.0006705192,0.0018646518,0.0020320127,0.006257303,0.0026653772,0.0031727355,0.0007889122],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005934067,0.000043481195,0.00048197253,0.000069061534,0.000013432951,0.00011400882,0.00027186246,0.0011763155,0.0019807473,0.9860547,0.0018993561,0.0078357635],"study_design_scores_gemma":[0.000015194515,0.000012286706,0.00029963578,0.000017246992,0.000012043098,0.00019418287,0.000110995694,0.005715634,0.00086895155,0.9898683,0.0028796669,0.0000058981673],"about_ca_topic_score_codex":0.0007003323,"about_ca_topic_score_gemma":0.0014085177,"teacher_disagreement_score":0.007927629,"about_ca_system_score_codex":0.0009282915,"about_ca_system_score_gemma":0.0004600225,"threshold_uncertainty_score":0.02652055},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8687887,0.00071460474,0.098523006,0.0009161708,0.00006019713,0.00004024164,0.00014977943,0.00025324753,0.030554015],"genre_scores_gemma":[0.9830041,0.00019496359,0.011174686,0.000117698866,0.000056267607,0.000045622728,0.0001927501,0.000054823762,0.0051590675],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99924076,0.00020834424,0.00003037617,0.00020461752,0.0001863659,0.00012946854],"domain_scores_gemma":[0.9964142,0.0018614985,0.00044017838,0.00050435093,0.00028383135,0.00049588806],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00073521683,0.0004224517,0.00049529155,0.0012891871,0.0011145513,0.0019447125,0.0011076697,0.0007886487,0.0024287861],"category_scores_gemma":[0.0053863227,0.00033948736,0.0006387432,0.00052710547,0.004104753,0.0040264344,0.0020287363,0.0017430484,0.00030198973],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007604911,0.00002266823,0.0011370725,0.000046921,0.0000088493325,0.000109427296,0.000291272,0.0046813884,0.0033385523,0.9854843,0.00052018225,0.0042834305],"study_design_scores_gemma":[0.000012331528,0.000029210347,0.0005596229,0.000015383172,0.0000069578778,0.00015363653,0.00013527018,0.017501023,0.0023971817,0.9771678,0.0020099753,0.000011552647],"about_ca_topic_score_codex":0.00048664582,"about_ca_topic_score_gemma":0.00055860076,"teacher_disagreement_score":0.0024287861,"about_ca_system_score_codex":0.0011658465,"about_ca_system_score_gemma":0.00027559558,"threshold_uncertainty_score":0.008458912},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25716352,0.010201072,0.31921074,0.069388725,0.0013069145,0.00012509203,0.0016865392,0.00052837713,0.3403891],"genre_scores_gemma":[0.87325555,0.004365717,0.05610629,0.002576773,0.001436657,0.00019590376,0.0009610213,0.00022318291,0.06087888],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99884135,0.00052829226,0.00006693801,0.00022164699,0.00018184341,0.00016003595],"domain_scores_gemma":[0.99506575,0.0037102585,0.00019263395,0.00036978154,0.00026661655,0.00039496075],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019578135,0.00047629653,0.0009588982,0.0016387742,0.0038305926,0.0037246959,0.0016474082,0.002889992,0.010822655],"category_scores_gemma":[0.0070558297,0.0005217104,0.0010088562,0.0024875351,0.005676132,0.019413715,0.0036218697,0.0040197666,0.0014126363],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018771281,0.000016657896,0.00011801345,0.000036374542,0.0000036021859,0.000039440198,0.0001712737,0.00032979538,0.00007737681,0.9911419,0.0032838811,0.0047628987],"study_design_scores_gemma":[0.0000052197743,0.000004450086,0.00005476945,0.000016365015,0.0000028991806,0.00006368752,0.00016550034,0.0009109963,0.00008690652,0.99476385,0.003921907,0.000003387747],"about_ca_topic_score_codex":0.0018156568,"about_ca_topic_score_gemma":0.0016430747,"teacher_disagreement_score":0.010822655,"about_ca_system_score_codex":0.002398946,"about_ca_system_score_gemma":0.0010665562,"threshold_uncertainty_score":0.03620541},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16556986,0.013565016,0.6291927,0.0140197985,0.0012108722,0.00034238584,0.0023756544,0.0042067757,0.16951694],"genre_scores_gemma":[0.87846214,0.0028063771,0.09269617,0.0026742795,0.0014779968,0.00048250897,0.0011109975,0.0010286302,0.019260881],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.993167,0.0019419048,0.00015317809,0.001329399,0.0021990861,0.0012095227],"domain_scores_gemma":[0.97086596,0.021562278,0.0016325933,0.002946534,0.001759773,0.0012328603],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0068584103,0.0014601182,0.0015716808,0.0036071076,0.0018146088,0.0030040315,0.0031289153,0.002008333,0.01811789],"category_scores_gemma":[0.03494615,0.0013677562,0.0014184599,0.003778993,0.0033077518,0.010052587,0.0052444255,0.005834916,0.004824332],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015241468,0.0004209761,0.0113279885,0.0007974508,0.00020208993,0.0012017302,0.0007306265,0.033414874,0.012326942,0.7367465,0.058682747,0.14262395],"study_design_scores_gemma":[0.00017056301,0.00033754538,0.008772107,0.00034402547,0.000227839,0.0019688876,0.00015541108,0.3172673,0.017449044,0.6158643,0.037174445,0.00026843374],"about_ca_topic_score_codex":0.002453216,"about_ca_topic_score_gemma":0.002938336,"teacher_disagreement_score":0.01811789,"about_ca_system_score_codex":0.0044511785,"about_ca_system_score_gemma":0.0024630222,"threshold_uncertainty_score":0.060610354},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3502273,0.017360859,0.19632295,0.011481714,0.001358717,0.00009730943,0.00095070305,0.00050341134,0.42169705],"genre_scores_gemma":[0.9490226,0.004173937,0.018088298,0.0010331239,0.0007795483,0.00014824064,0.00025913288,0.00016321485,0.02633185],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99897003,0.00035676107,0.00005261832,0.00017454156,0.0002463831,0.00019959924],"domain_scores_gemma":[0.9910746,0.0063835043,0.00064818317,0.0004999982,0.00055331044,0.00084046804],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002048158,0.00055952504,0.0008786513,0.0029015958,0.0022683882,0.003259421,0.0014631143,0.0014505528,0.012078061],"category_scores_gemma":[0.013203207,0.00054282695,0.0005103192,0.0019729421,0.0043050074,0.015011786,0.0034208943,0.0030165683,0.001357104],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025545109,0.00001239302,0.00017839986,0.00004081338,0.0000036293643,0.000023743947,0.00013015915,0.00066539017,0.00014457916,0.99272245,0.002333009,0.0037198127],"study_design_scores_gemma":[0.000005168797,0.0000064393803,0.00014451465,0.000025948526,0.0000049970963,0.00005858699,0.000096808304,0.0022477997,0.00009312423,0.9945543,0.0027550585,0.000007386977],"about_ca_topic_score_codex":0.0015685398,"about_ca_topic_score_gemma":0.0018320063,"teacher_disagreement_score":0.012078061,"about_ca_system_score_codex":0.0015938597,"about_ca_system_score_gemma":0.00066723017,"threshold_uncertainty_score":0.040405095},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.057720616,0.114434436,0.081786975,0.028854797,0.003515531,0.00005482723,0.00046322963,0.0003718884,0.7127977],"genre_scores_gemma":[0.76551574,0.041413527,0.036425956,0.0031044967,0.00667672,0.00025331293,0.00037799485,0.00030444155,0.14592786],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99959785,0.00016342504,0.000016287542,0.000063883774,0.00013051342,0.000027994987],"domain_scores_gemma":[0.9987118,0.00088701665,0.000067016066,0.00010363043,0.00016119424,0.00006929844],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008538939,0.00059999974,0.00081902195,0.0018079068,0.0012086919,0.0029804036,0.0009276553,0.0014043909,0.004820192],"category_scores_gemma":[0.004164747,0.00042629504,0.0003291772,0.0023829648,0.0044305963,0.0060069943,0.0010500961,0.0033878412,0.0007614383],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002996215,0.0000037878233,0.000037734502,0.000025280602,9.772606e-7,0.00000753857,0.00010189773,0.0001995114,0.000048697766,0.99349046,0.0031975375,0.002883616],"study_design_scores_gemma":[0.000001995102,0.0000018895624,0.00006170043,0.000014224838,0.0000012982921,0.000028102773,0.0000354498,0.0005768229,0.00002861977,0.9852663,0.013981265,0.0000022729785],"about_ca_topic_score_codex":0.001102379,"about_ca_topic_score_gemma":0.0008335762,"teacher_disagreement_score":0.004820192,"about_ca_system_score_codex":0.0023258452,"about_ca_system_score_gemma":0.00075988274,"threshold_uncertainty_score":0.016875267},"labels":[],"label_agreement":null}]}