{"meta":{"query_hash":"52a92b309710","filters":{"venue":"Journal of Combinatorial Theory Series B"},"cohort_total":230,"direct_labels_cover":0,"predictions_cover":230,"exported":230,"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/52a92b309710","api":"https://metacan.xera.ac/api/v1/cohort?venue=Journal+of+Combinatorial+Theory+Series+B"},"results":[{"id":"W1500536468","doi":"10.1016/j.jctb.2015.05.002","title":"Edge-colouring eight-regular planar graphs","year":2015,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":12,"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":"Office of Naval Research; Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Mathematics; Combinatorics; Planar graph; Conjecture; Complement (music); Graph; Enhanced Data Rates for GSM Evolution; Discrete mathematics; Computer science","score_opus":0.01002942422884646,"score_gpt":0.1973660829021129,"score_spread":0.18733665867326646,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1500536468","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94837505,0.0026905104,0.00060308946,0.00006245455,0.032385893,0.00015456224,0.0000067364335,0.00015330674,0.015568394],"genre_scores_gemma":[0.9985194,0.000047228456,0.000120586505,0.000015874994,0.0010292294,0.000003516107,0.0000014216729,0.000043054788,0.0002196546],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983841,0.00026247842,0.00058394077,0.000094907125,0.00038670114,0.00028786945],"domain_scores_gemma":[0.9989266,0.000118044714,0.00020240371,0.00024478434,0.00021992416,0.0002882393],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018657515,0.00022443153,0.00045550606,0.00022375499,0.00008407844,0.00007234544,0.0004093146,0.0001479746,0.00004733879],"category_scores_gemma":[0.00012846418,0.00019308318,0.00020879862,0.00026190872,0.00010441976,0.0005915233,0.000022953413,0.0003618388,0.000020553696],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007716956,0.000054428096,0.00018618046,0.00005254214,0.0002647368,0.00013436358,0.0012739792,0.0008825707,0.0021469484,0.9877941,0.006079365,0.00035907835],"study_design_scores_gemma":[0.0015946847,0.00046206202,0.000058225054,0.00009309581,0.000057048437,0.00037064578,0.0012011904,0.00001763712,0.010852273,0.93176144,0.05328013,0.00025157086],"about_ca_topic_score_codex":8.797647e-7,"about_ca_topic_score_gemma":4.3513467e-7,"teacher_disagreement_score":0.056032676,"about_ca_system_score_codex":0.00007890874,"about_ca_system_score_gemma":0.00005850579,"threshold_uncertainty_score":0.7873703},"labels":[],"label_agreement":null},{"id":"W1508755082","doi":"10.1006/jctb.2000.2009","title":"High-Girth Graphs Avoiding a Minor are Nearly Bipartite","year":2001,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Combinatorics; Mathematics; Triangle-free graph; Odd graph; Discrete mathematics; Bipartite graph; Homomorphism; 1-planar graph; Planar graph; Girth (graph theory); Foster graph; Graph homomorphism; Graph power; Graph minor; Graph; Line graph","score_opus":0.015223306658726087,"score_gpt":0.2601376903989754,"score_spread":0.2449143837402493,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1508755082","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9015137,0.0011262457,0.08158923,0.0014675941,0.012510814,0.00027100937,0.00000478037,0.0001555203,0.0013611126],"genre_scores_gemma":[0.9937727,0.00022558653,0.0046140086,0.00012080235,0.00064092997,0.0000056275967,4.514641e-7,0.000028778284,0.0005911194],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9965487,0.0009847104,0.0007013171,0.0002962436,0.00088096806,0.00058804784],"domain_scores_gemma":[0.9968415,0.0007414015,0.000754803,0.00066519395,0.0006608387,0.00033629485],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003241265,0.00026861668,0.00053860684,0.0005087175,0.00042844884,0.00036576888,0.0018790337,0.00011827641,0.00008122691],"category_scores_gemma":[0.00086347235,0.00022750116,0.00028852018,0.001278366,0.00029087573,0.0028196455,0.00032871918,0.00081384764,0.000028936303],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010786224,0.00014077035,0.0009908213,0.000011545197,0.000084316765,0.0004154128,0.00050475256,0.0000713761,0.0023402781,0.99133974,0.00037536884,0.0026469775],"study_design_scores_gemma":[0.0015067587,0.0009006848,0.00070745416,0.00007161105,0.0000140414795,0.00038762589,0.00032229023,0.000026592796,0.005083642,0.9774129,0.013311934,0.0002544577],"about_ca_topic_score_codex":0.0000030949268,"about_ca_topic_score_gemma":0.0000017002183,"teacher_disagreement_score":0.092259,"about_ca_system_score_codex":0.000088139175,"about_ca_system_score_gemma":0.00014826718,"threshold_uncertainty_score":0.9277228},"labels":[],"label_agreement":null},{"id":"W1512371449","doi":"10.1016/j.jctb.2015.11.002","title":"On Rota's Conjecture and nested separations in matroids","year":2015,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","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","keywords":"Matroid; Conjecture; Combinatorics; Mathematics; Nested set model; Computer science; Programming language","score_opus":0.01714138966048585,"score_gpt":0.2926170667063513,"score_spread":0.27547567704586545,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1512371449","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95377004,0.0006961453,0.032879047,0.0022983665,0.0055753505,0.00033810947,0.0000033859187,0.000058872218,0.0043806536],"genre_scores_gemma":[0.99758714,0.000018684737,0.0019599693,0.00007997731,0.00016369698,0.0000034060956,3.5547856e-7,0.000009635415,0.00017713467],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983589,0.00053298334,0.00034090312,0.00014150243,0.00041513875,0.00021058954],"domain_scores_gemma":[0.9985974,0.00047349895,0.00019507723,0.0002738315,0.0002619997,0.00019822436],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018238737,0.00012718725,0.00026519594,0.00028588308,0.00007129722,0.00013289497,0.0005650227,0.00007594596,0.000008260281],"category_scores_gemma":[0.00067051285,0.00010255538,0.00005191424,0.00047378376,0.00014749913,0.0010232141,0.00012907796,0.00041522784,0.0000048451393],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000711739,0.000067054454,0.00016468624,0.0000035787677,0.000013596829,0.00007950297,0.00083024916,0.00024156338,0.00018153325,0.99662757,0.0003147984,0.0007641076],"study_design_scores_gemma":[0.0017648953,0.0013692558,0.00022645539,0.000030243767,0.00000339769,0.00021623199,0.00020845108,0.0000801242,0.0009905241,0.99230963,0.0026965113,0.00010429271],"about_ca_topic_score_codex":0.0000012450439,"about_ca_topic_score_gemma":0.0000018079328,"teacher_disagreement_score":0.04381707,"about_ca_system_score_codex":0.000075513904,"about_ca_system_score_gemma":0.0002008374,"threshold_uncertainty_score":0.4182087},"labels":[],"label_agreement":null},{"id":"W1529872609","doi":"10.1016/j.jctb.2015.05.011","title":"The structure of 2-separations of infinite matroids","year":2015,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","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":"Matroid; Combinatorics; Mathematics; Invariant (physics); Graphic matroid; Duality (order theory); Tree (set theory); Discrete mathematics; Mathematical physics","score_opus":0.01746079313427293,"score_gpt":0.29334364779114674,"score_spread":0.2758828546568738,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1529872609","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8699374,0.002526857,0.10462889,0.0014077867,0.015826851,0.0004640503,0.000029587665,0.000048192946,0.0051303715],"genre_scores_gemma":[0.995889,0.000045926725,0.0037276421,0.000011162212,0.00018309685,5.332905e-7,3.0072871e-7,0.000008113499,0.00013420443],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978642,0.00053683965,0.0006311292,0.000088082365,0.0006899881,0.00018980246],"domain_scores_gemma":[0.9966352,0.0007147698,0.0007406028,0.00049928547,0.001281273,0.00012885155],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019192691,0.00011094235,0.0003050642,0.00015449116,0.0001168014,0.000062037696,0.0014591787,0.00006273274,0.000009522258],"category_scores_gemma":[0.0010315313,0.00007131014,0.00013120807,0.00055437884,0.00044577417,0.00089668424,0.00022821347,0.0003028176,0.0000011240874],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00068648043,0.00003590942,0.00012280351,0.000007497854,0.00005490939,0.0000033233662,0.0008732616,0.0002486285,0.0060752295,0.99065506,0.00027062866,0.00096623617],"study_design_scores_gemma":[0.0007467677,0.000887643,0.000078413,0.00001916094,0.000009342479,0.000058750964,0.0003935876,0.000030017905,0.04011447,0.95160645,0.0059910105,0.00006437983],"about_ca_topic_score_codex":9.804916e-7,"about_ca_topic_score_gemma":0.0000010563263,"teacher_disagreement_score":0.12595162,"about_ca_system_score_codex":0.0000346875,"about_ca_system_score_gemma":0.0003744791,"threshold_uncertainty_score":0.2907943},"labels":[],"label_agreement":null},{"id":"W1547065387","doi":"10.1016/j.jctb.2016.06.006","title":"5-list-coloring planar graphs with distant precolored vertices","year":2016,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","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":"Javna Agencija za Raziskovalno Dejavnost RS; Grantová Agentura České Republiky; Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Planar graph; Order (exchange); Graph; Planar; Induced subgraph; Graph homomorphism","score_opus":0.011021558989236077,"score_gpt":0.24589534272845842,"score_spread":0.23487378373922235,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1547065387","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.82947284,0.0005966934,0.15306954,0.0021187386,0.0103687225,0.00048514453,0.00000902718,0.00018914194,0.0036901233],"genre_scores_gemma":[0.99566984,0.00009764689,0.0037094303,0.000031181935,0.00020663037,0.000009358969,1.7857671e-7,0.000021673208,0.00025403846],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975919,0.000456819,0.0004957546,0.00025908748,0.0007406847,0.00045572693],"domain_scores_gemma":[0.9973007,0.0009856967,0.00048158306,0.0005249702,0.0004583866,0.000248705],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017969323,0.00021661472,0.0003915635,0.0002632189,0.00021681919,0.00016228324,0.0015800673,0.00007351608,0.000040742594],"category_scores_gemma":[0.00044987275,0.00012111688,0.0001354756,0.0005330286,0.00039151197,0.0026630214,0.00015913353,0.00026954612,0.0000066922444],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0037149552,0.000097233096,0.00071554456,0.000012640369,0.00011697146,0.00016033546,0.00037962946,0.000005264895,0.0074176327,0.98357767,0.00009245207,0.0037096655],"study_design_scores_gemma":[0.0021196946,0.0024070619,0.000500034,0.00013922533,0.000018376897,0.00017835852,0.00014662376,0.0000036220415,0.021732764,0.9653623,0.0071776197,0.00021432688],"about_ca_topic_score_codex":0.0000010455773,"about_ca_topic_score_gemma":0.0000028168458,"teacher_disagreement_score":0.16619699,"about_ca_system_score_codex":0.0001175655,"about_ca_system_score_gemma":0.00019794176,"threshold_uncertainty_score":0.4939003},"labels":[],"label_agreement":null},{"id":"W1548559198","doi":"10.1016/j.jctb.2014.12.003","title":"Matroid 3-connectivity and branch width","year":2015,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","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; Nederlandse Organisatie voor Wetenschappelijk Onderzoek; National Science Foundation","keywords":"Matroid; Combinatorics; Minor (academic); Mathematics; Integer (computer science); Oriented matroid; Matroid partitioning; Set (abstract data type); Discrete mathematics; Graphic matroid; Computer science; Humanities","score_opus":0.018418209423534875,"score_gpt":0.27575564629247123,"score_spread":0.25733743686893634,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1548559198","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.72262686,0.0019451964,0.25699413,0.001693156,0.010519458,0.00025643935,0.0000027902875,0.000110042165,0.00585192],"genre_scores_gemma":[0.9937912,0.000046877707,0.00546792,0.00006024437,0.00040940443,0.0000019320005,1.233612e-7,0.00001351756,0.0002087604],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979802,0.0006218787,0.00035445247,0.00018355461,0.0005713584,0.00028860662],"domain_scores_gemma":[0.9979501,0.0004904712,0.00029987647,0.00038053657,0.00053627044,0.00034276408],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037279807,0.00015420569,0.00034789444,0.00019133346,0.00011824472,0.00018102198,0.00086717936,0.000071834234,0.000011044473],"category_scores_gemma":[0.0010133376,0.00012725906,0.000089692825,0.00038109973,0.00025431946,0.002214072,0.00032921933,0.0003830105,0.0000064293267],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00079386024,0.000068064786,0.00031347558,0.000008170868,0.00003590566,0.00004537361,0.000637271,0.000015796588,0.0010562224,0.98801947,0.0002877089,0.008718667],"study_design_scores_gemma":[0.0015486431,0.0010435703,0.00036093342,0.000019592728,0.000007035886,0.0005002148,0.00012929372,0.000025909423,0.0048916936,0.98563856,0.005695926,0.00013865507],"about_ca_topic_score_codex":0.0000011485657,"about_ca_topic_score_gemma":4.1329614e-7,"teacher_disagreement_score":0.27116433,"about_ca_system_score_codex":0.00006916258,"about_ca_system_score_gemma":0.0002189657,"threshold_uncertainty_score":0.5189474},"labels":[],"label_agreement":null},{"id":"W1550666632","doi":"10.1016/j.jctb.2016.11.004","title":"5-choosability of graphs with crossings far apart","year":2016,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Javna Agencija za Raziskovalno Dejavnost RS; Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Planar graph; Graph; Plane (geometry); Outerplanar graph; Line graph; Crossing number (knot theory)","score_opus":0.006835304738614545,"score_gpt":0.22240173226694906,"score_spread":0.21556642752833452,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1550666632","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.68602616,0.00016334336,0.3080669,0.00085059606,0.003722885,0.000092618946,0.0000026268208,0.00002464843,0.001050232],"genre_scores_gemma":[0.9934646,0.000017567225,0.0060897535,0.000049071165,0.00018924476,0.000001112328,2.0631751e-7,0.000004947716,0.0001835344],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99871385,0.00018589261,0.00043035226,0.00012683442,0.00041406887,0.00012902281],"domain_scores_gemma":[0.9981871,0.00033854053,0.00048615126,0.00023629524,0.0006672203,0.000084668936],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012493328,0.00010392596,0.00023982638,0.00012573396,0.00009429674,0.00006984435,0.00045208822,0.00004483235,0.00002693616],"category_scores_gemma":[0.0002505877,0.000060883867,0.00010227793,0.00036224237,0.000213056,0.0012023633,0.00006437172,0.000086584594,0.0000018454645],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00061766844,0.000111106565,0.0005492386,0.000009708242,0.00004247859,0.000005809384,0.00028209592,0.000055565182,0.006809877,0.98087645,0.00020025755,0.010439721],"study_design_scores_gemma":[0.0013753299,0.0011533436,0.0021436713,0.000058334932,0.000013503333,0.000106276144,0.000027691001,0.000012573126,0.04644279,0.9362616,0.012292185,0.00011273213],"about_ca_topic_score_codex":8.710212e-7,"about_ca_topic_score_gemma":3.9868186e-7,"teacher_disagreement_score":0.30743843,"about_ca_system_score_codex":0.00003466251,"about_ca_system_score_gemma":0.00022174542,"threshold_uncertainty_score":0.2482772},"labels":[],"label_agreement":null},{"id":"W1567232491","doi":"10.1006/jctb.2001.2092","title":"On a Conjecture of Lovász Concerning Bricks","year":2002,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Mathematics and Applications","field":"Mathematics","cited_by":30,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Conjecture; Mathematics; Combinatorics; Pure mathematics; Discrete mathematics; Mathematical economics","score_opus":0.03782515546227876,"score_gpt":0.2854606832712119,"score_spread":0.2476355278089331,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1567232491","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8722479,0.0006038722,0.009337952,0.0011647533,0.0039744815,0.00056642736,0.000026150172,0.00006373573,0.11201473],"genre_scores_gemma":[0.99667,0.00003352121,0.0019591958,0.00003541873,0.00029937818,0.0000025959682,2.5298849e-7,0.000020428843,0.0009792066],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99879,0.00010486459,0.0005899581,0.00007128203,0.00032025494,0.00012359177],"domain_scores_gemma":[0.99750304,0.0011124528,0.000860048,0.00023634007,0.00021958131,0.000068510526],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00068546744,0.00012469087,0.00040953612,0.000075513846,0.00006705582,0.000024477238,0.00025701817,0.00008140715,0.0009462995],"category_scores_gemma":[0.0008957425,0.00009549545,0.00015863102,0.00013101991,0.000103893784,0.000097436,0.000029482353,0.0002513955,0.000008656397],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009900115,0.00024762258,0.000005572501,0.000057577774,0.000069989386,0.000006624541,0.0011755042,0.0000057759403,0.00043438113,0.9830593,0.014502417,0.00033623652],"study_design_scores_gemma":[0.00086890743,0.0005172818,0.0000025369382,0.00013561572,0.000055637982,0.00006831729,0.00028813776,0.000023950528,0.0038224375,0.97977525,0.014348401,0.00009353836],"about_ca_topic_score_codex":3.5355595e-7,"about_ca_topic_score_gemma":1.1216208e-7,"teacher_disagreement_score":0.12442211,"about_ca_system_score_codex":0.00002763135,"about_ca_system_score_gemma":0.00002461493,"threshold_uncertainty_score":0.999967},"labels":[],"label_agreement":null},{"id":"W1613467653","doi":"10.1016/j.jctb.2015.12.005","title":"Five-list-coloring graphs on surfaces II. A linear bound for critical graphs in a disk","year":2015,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Combinatorics; Mathematics; Lemma (botany); Conjecture; Isoperimetric inequality; Graph; Vertex (graph theory); Induced subgraph; Discrete mathematics; Botany","score_opus":0.033757637382348084,"score_gpt":0.3304632292392484,"score_spread":0.2967055918569003,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1613467653","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9659052,0.0006801139,0.01821566,0.0017952507,0.011507934,0.0005449712,0.000013398906,0.000081484715,0.0012559721],"genre_scores_gemma":[0.9917941,0.00004484393,0.0075726444,0.00008512567,0.0002817899,0.00002375942,7.4625245e-7,0.000027634596,0.00016933824],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.996945,0.0006294807,0.00069223146,0.0003245935,0.0008207961,0.00058787066],"domain_scores_gemma":[0.99603987,0.0020395247,0.00027615792,0.00046498986,0.0007977947,0.0003816361],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004736831,0.00025714544,0.00054629566,0.0005580536,0.00029070774,0.0002009203,0.0014403883,0.00013369542,0.000007792735],"category_scores_gemma":[0.0040072175,0.0002183952,0.0002589724,0.0008781544,0.00046275376,0.0017741245,0.00031940438,0.0006335,0.0000030992694],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0035861868,0.0003299658,0.00020830386,0.000023585988,0.000039294402,0.00008900195,0.0014164271,0.00030150096,0.00029894846,0.9928947,0.0002345324,0.0005775522],"study_design_scores_gemma":[0.0027145573,0.004287254,0.00008267038,0.000105257546,0.000011513785,0.00006001597,0.00052668824,0.00035091516,0.0027188575,0.98468924,0.004218965,0.00023408703],"about_ca_topic_score_codex":0.0000050032127,"about_ca_topic_score_gemma":0.000004993215,"teacher_disagreement_score":0.025888903,"about_ca_system_score_codex":0.00014639132,"about_ca_system_score_gemma":0.00031948395,"threshold_uncertainty_score":0.8905898},"labels":[],"label_agreement":null},{"id":"W161675474","doi":"10.1016/j.jctb.2007.10.005","title":"Corrigendum to “Counting connected graphs inside-out” [J. Combin. Theory Ser. B 93 (2005) 127–172]","year":2008,"lang":"en","type":"erratum","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Combinatorics; Mathematics; Computer science","score_opus":0.021592723447045832,"score_gpt":0.27204120898922163,"score_spread":0.2504484855421758,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W161675474","genre_codex":"editorial","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"editorial","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0036420606,0.010729043,0.0979906,0.0020872508,0.8208679,0.0027247795,0.00016557102,0.0009788277,0.060813967],"genre_scores_gemma":[0.1462052,0.016677966,0.023493327,0.0069314777,0.03989892,0.00036148657,0.00035602672,0.0023790223,0.76369655],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9863384,0.0038611179,0.0028000795,0.0013227995,0.003379645,0.0022980035],"domain_scores_gemma":[0.9874679,0.0019778546,0.0031604778,0.0026506106,0.0033640552,0.0013791216],"candidate_categories":["metaepi_narrow","open_science","research_integrity"],"consensus_categories":["metaepi_narrow","research_integrity"],"category_scores_codex":[0.008959734,0.0015102152,0.0028036532,0.0024062027,0.0012012623,0.0008553418,0.007906386,0.001328785,0.00034187993],"category_scores_gemma":[0.0049790284,0.0013977202,0.0012082227,0.0023969426,0.0010996764,0.0031665214,0.002013899,0.005833754,0.00017324151],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0018977172,0.0003551474,0.000016560198,0.000092527356,0.00048654404,0.0009111103,0.0016214063,0.000022166498,0.00023211734,0.65205973,0.340758,0.0015469393],"study_design_scores_gemma":[0.0016544565,0.00172498,0.000033384167,0.00047426383,0.00007045865,0.00078973005,0.00035938848,0.000017844559,0.0010156344,0.6089799,0.38391817,0.0009618218],"about_ca_topic_score_codex":0.000009363563,"about_ca_topic_score_gemma":0.000014678612,"teacher_disagreement_score":0.78096896,"about_ca_system_score_codex":0.0006801931,"about_ca_system_score_gemma":0.0029098217,"threshold_uncertainty_score":0.9999677},"labels":[],"label_agreement":null},{"id":"W1650378662","doi":"10.1016/j.jctb.2015.08.003","title":"The critical number of dense triangle-free binary matroids","year":2015,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Office of Naval Research","keywords":"Matroid; Combinatorics; Conjecture; Mathematics; Binary number; Simple (philosophy); Statement (logic); Integer (computer science); Discrete mathematics; Computer science; Arithmetic; Law","score_opus":0.03175829879797034,"score_gpt":0.32562907512655026,"score_spread":0.29387077632857994,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1650378662","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9588563,0.0016215727,0.00034053222,0.0012133605,0.02259583,0.00020586101,0.000015734578,0.00003784957,0.015112994],"genre_scores_gemma":[0.9954987,0.0000777992,0.0025085916,0.000041899544,0.001292177,0.000002583792,2.2132197e-7,0.000037908954,0.000540107],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99689883,0.00092717196,0.0010558097,0.00010532379,0.0007257451,0.00028714573],"domain_scores_gemma":[0.993554,0.004035033,0.0006572863,0.00063893624,0.00090156787,0.00021315468],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.005320727,0.0002055843,0.0006402774,0.00008241939,0.000276231,0.000063443615,0.0009566597,0.00015960581,0.00010335318],"category_scores_gemma":[0.012704622,0.00012240419,0.00038666217,0.00018975875,0.00080571417,0.0003443555,0.00029068618,0.0004451122,0.000002996875],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.004820732,0.00012891166,0.00014138623,0.000040923558,0.00015169613,0.000057507183,0.0012432269,8.3841405e-7,0.00008690377,0.98150486,0.011505163,0.00031784642],"study_design_scores_gemma":[0.0024114773,0.00074502325,0.000033847504,0.000077442826,0.00013883074,0.00055527163,0.0018495369,0.0000013998725,0.0012700346,0.9832902,0.009487975,0.00013893902],"about_ca_topic_score_codex":9.477658e-7,"about_ca_topic_score_gemma":4.0252257e-7,"teacher_disagreement_score":0.036642447,"about_ca_system_score_codex":0.000056328572,"about_ca_system_score_gemma":0.00019117791,"threshold_uncertainty_score":0.9956118},"labels":[],"label_agreement":null},{"id":"W1658178599","doi":"10.1016/j.jctb.2015.07.001","title":"A transition of limiting distributions of large matchings in random graphs","year":2015,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; Fundação de Amparo à Pesquisa do Estado de São Paulo","keywords":"Limiting; Mathematics; Asymptotic distribution; Combinatorics; Range (aeronautics); Distribution (mathematics); Statistical physics; Discrete mathematics; Statistics; Physics; Mathematical analysis; Materials science","score_opus":0.01959443799609526,"score_gpt":0.28452176409885827,"score_spread":0.264927326102763,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1658178599","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99352074,0.00021608063,0.0032424866,0.00007550887,0.0018172665,0.00012602325,0.000039745322,0.000008820824,0.00095330714],"genre_scores_gemma":[0.99895644,0.000024410594,0.0008506595,0.000010668819,0.00013097888,0.0000014318142,0.0000031602594,0.000013879276,0.000008397944],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979468,0.00047372797,0.00096213527,0.000073746356,0.00036967144,0.00017389827],"domain_scores_gemma":[0.9978218,0.00064883934,0.0008387662,0.00016817977,0.00044005903,0.000082365674],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036801544,0.00013298099,0.00060451217,0.00020473702,0.00006758317,0.000010823057,0.00023790414,0.00011128023,0.000023907209],"category_scores_gemma":[0.0011884236,0.00010497589,0.00026067547,0.00027218545,0.00017470197,0.0003207761,0.000044958757,0.00029055512,1.0048403e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.003381449,0.00024111762,0.00021126072,0.000085560794,0.000083434454,0.000011107344,0.007367726,0.000009640429,0.0006439578,0.98778594,0.00009083491,0.00008796145],"study_design_scores_gemma":[0.00565553,0.00042935842,0.000104238425,0.000292028,0.00008267653,0.000058005142,0.0030163773,0.0000043157374,0.0073610833,0.9827344,0.00016778926,0.00009422002],"about_ca_topic_score_codex":0.0000026520202,"about_ca_topic_score_gemma":0.0000015743051,"teacher_disagreement_score":0.0067171254,"about_ca_system_score_codex":0.000036468202,"about_ca_system_score_gemma":0.0001034299,"threshold_uncertainty_score":0.42807925},"labels":[],"label_agreement":null},{"id":"W1683401792","doi":"10.1016/j.jctb.2015.11.005","title":"Certifying non-representability of matroids over prime fields","year":2015,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","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","keywords":"Matroid; Prime (order theory); Mathematics; Computer science; Combinatorics","score_opus":0.030494904017273235,"score_gpt":0.3143289892299906,"score_spread":0.28383408521271736,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1683401792","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.77781,0.0003753461,0.20714734,0.00057221984,0.008683235,0.00027936528,0.000002811337,0.000048858805,0.005080841],"genre_scores_gemma":[0.9947761,0.000013100626,0.0046971184,0.000026459142,0.0003150915,0.0000022303427,2.2568581e-7,0.00001244168,0.00015722068],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99737865,0.0005566372,0.00069371174,0.00019796794,0.0008671098,0.00030590393],"domain_scores_gemma":[0.9971364,0.0005291557,0.00053540285,0.00073156535,0.00080192904,0.00026554754],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037391544,0.00016086015,0.00045500323,0.00019862315,0.00007393638,0.000080384474,0.0015144504,0.00011062005,0.000043803484],"category_scores_gemma":[0.001085131,0.00013317283,0.00021398139,0.0004878332,0.00028009646,0.001659231,0.0005134138,0.00043625198,0.0000045631728],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0020583002,0.00026377226,0.0021255212,0.000035030822,0.00009465437,0.00004652507,0.0019119438,0.0001331526,0.0053767897,0.9838532,0.0005382514,0.0035628257],"study_design_scores_gemma":[0.0014518556,0.000978715,0.00065213215,0.000035657522,0.000010570945,0.00006896503,0.00026669315,0.00011259174,0.061342828,0.9335403,0.0014058657,0.00013386682],"about_ca_topic_score_codex":0.000006669959,"about_ca_topic_score_gemma":5.352037e-7,"teacher_disagreement_score":0.21696614,"about_ca_system_score_codex":0.00010515869,"about_ca_system_score_gemma":0.00035396937,"threshold_uncertainty_score":0.54306304},"labels":[],"label_agreement":null},{"id":"W1850205219","doi":"10.1016/j.jctb.2017.04.005","title":"The extremal function for disconnected minors","year":2017,"lang":"en","type":"preprint","venue":"Journal of Combinatorial Theory Series B","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"European Research Council; Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Infimum and supremum; Mathematics; Robertson–Seymour theorem; Graph; Disjoint sets; Minor (academic); Null (SQL); Vertex (graph theory); Discrete mathematics; 1-planar graph; Computer science; Humanities; Line graph; Art","score_opus":0.037965161545544364,"score_gpt":0.31332659824379777,"score_spread":0.2753614366982534,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1850205219","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6818331,0.004630898,0.013200462,0.0018117874,0.2854892,0.0024665364,0.00015720457,0.00014363056,0.010267185],"genre_scores_gemma":[0.9887884,0.000279493,0.0012129509,0.000027216813,0.006917646,0.00004001281,0.000006719733,0.00009202905,0.0026355197],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973363,0.00053355563,0.001031889,0.00023714174,0.0005082135,0.0003528531],"domain_scores_gemma":[0.99193954,0.0031812524,0.0028729155,0.0010546164,0.0008328229,0.000118841366],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.004004807,0.0004119219,0.00082792144,0.00011871757,0.0015938889,0.00042358536,0.001493862,0.00046945552,0.000044000393],"category_scores_gemma":[0.00471907,0.00024392141,0.0008504581,0.000042197255,0.0005363476,0.0002868295,0.0006243548,0.0010749408,5.2681935e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.006194027,0.0000616437,0.000017862989,0.00016247775,0.00069666945,0.000008496427,0.00066308136,0.000004235014,0.000044624237,0.9836177,0.0047824993,0.003746638],"study_design_scores_gemma":[0.0012525673,0.0005858207,0.0000992757,0.00021891492,0.0005192385,0.000055030276,0.00046227546,0.0000047160847,0.00048494237,0.9647946,0.031249115,0.00027353805],"about_ca_topic_score_codex":9.88477e-7,"about_ca_topic_score_gemma":0.00000307135,"teacher_disagreement_score":0.3069553,"about_ca_system_score_codex":0.000085651554,"about_ca_system_score_gemma":0.0002654221,"threshold_uncertainty_score":0.9997059},"labels":[],"label_agreement":null},{"id":"W1891427623","doi":"10.1016/j.jctb.2014.11.005","title":"Edge-colouring seven-regular planar graphs","year":2015,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"graph theory and CDMA systems","field":"Engineering","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":"Office of Naval Research; Natural Sciences and Engineering Research Council of Canada; Mitsubishi Foundation; Ministry of Education, Culture, Sports, Science and Technology; National Science Foundation","keywords":"Multigraph; Combinatorics; Mathematics; Conjecture; Complement (music); Planar graph; Enhanced Data Rates for GSM Evolution; Planar; Set (abstract data type); Discrete mathematics; Graph; Computer science; Artificial intelligence","score_opus":0.010203735005251237,"score_gpt":0.20080065200930536,"score_spread":0.19059691700405412,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1891427623","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95406944,0.0023207902,0.00064885564,0.00006445305,0.029362641,0.00015006156,0.000005919214,0.0001723375,0.013205534],"genre_scores_gemma":[0.9985861,0.000040889467,0.0001241088,0.000016717182,0.0009458937,0.0000034741588,0.0000011629468,0.000042812775,0.00023884041],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99840593,0.00027028285,0.0005705167,0.000092827606,0.0003762734,0.00028417664],"domain_scores_gemma":[0.99895084,0.00011516989,0.0002004103,0.00024009096,0.00021390735,0.00027956723],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019931404,0.00021917424,0.0004466857,0.00020950756,0.000079781574,0.0000682269,0.00040014926,0.0001457073,0.000038868107],"category_scores_gemma":[0.0001381409,0.0001935824,0.00020367507,0.000259217,0.000099194825,0.00057467766,0.00002363384,0.0003628079,0.000018529834],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00079598255,0.00005628127,0.0001643046,0.000057559453,0.0002793271,0.00013814065,0.0018497685,0.0015470391,0.0018887976,0.9871097,0.00564368,0.00046938067],"study_design_scores_gemma":[0.0015724119,0.0004576704,0.00005932134,0.00009678163,0.000054580665,0.00043309544,0.001749809,0.000020750607,0.0076664845,0.93932813,0.04830691,0.0002540463],"about_ca_topic_score_codex":8.9259873e-7,"about_ca_topic_score_gemma":4.4898246e-7,"teacher_disagreement_score":0.047781598,"about_ca_system_score_codex":0.0000799063,"about_ca_system_score_gemma":0.000062384555,"threshold_uncertainty_score":0.78940606},"labels":[],"label_agreement":null},{"id":"W1899569194","doi":"10.1016/j.jctb.2016.02.002","title":"Packing Steiner trees","year":2016,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Australian Research Council; Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Steiner tree problem; Conjecture; Mathematics; Disjoint sets; Graph; Spanning tree; Tree (set theory); Discrete mathematics","score_opus":0.014121268360480495,"score_gpt":0.269411629229777,"score_spread":0.2552903608692965,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1899569194","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17669007,0.001057926,0.7880268,0.0053619943,0.018923473,0.00027834787,0.0000050280923,0.00019639317,0.009459974],"genre_scores_gemma":[0.9942822,0.00008952406,0.0036822439,0.000053234482,0.0006613324,0.0000021462806,5.860648e-8,0.000017271814,0.0012120205],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978988,0.00050687237,0.00046037746,0.00017347779,0.00061560265,0.00034485038],"domain_scores_gemma":[0.9976058,0.0008677697,0.0003826274,0.0004953461,0.00046935005,0.0001791355],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022343248,0.00015642638,0.00030862435,0.00023996411,0.00012927632,0.00011618832,0.0014763322,0.000068682566,0.00008427077],"category_scores_gemma":[0.00080374663,0.0000914291,0.00017538163,0.0003768997,0.00023282431,0.0023677482,0.00027495553,0.00021864893,0.000021327469],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00043864152,0.00004951381,0.00015409516,0.0000032736386,0.000044165816,0.00006994397,0.00018960387,0.000003537217,0.012595172,0.9552502,0.00027272495,0.030929137],"study_design_scores_gemma":[0.001274006,0.00069781044,0.00017493987,0.00007339804,0.00000584784,0.00014974526,0.000060536247,0.000002744722,0.02449643,0.95168716,0.021239093,0.00013826943],"about_ca_topic_score_codex":2.4105879e-7,"about_ca_topic_score_gemma":3.1998172e-7,"teacher_disagreement_score":0.8175921,"about_ca_system_score_codex":0.00007695312,"about_ca_system_score_gemma":0.00013258558,"threshold_uncertainty_score":0.37283707},"labels":[],"label_agreement":null},{"id":"W1928499748","doi":"10.1016/j.jctb.2016.07.008","title":"Non-planar extensions of subdivisions of planar graphs","year":2016,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","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":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada; National Security Agency; National Science Foundation","keywords":"Combinatorics; Mathematics; Planar graph; Subdivision; Graph; Backslash; Planar; Lemma (botany); Discrete mathematics; Computer science","score_opus":0.013822217486434706,"score_gpt":0.27120107243894753,"score_spread":0.25737885495251284,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1928499748","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6923187,0.00083134515,0.2909951,0.0017998824,0.010320238,0.00048200955,0.00006717358,0.00006848725,0.0031170957],"genre_scores_gemma":[0.9934606,0.00022464283,0.0060002916,0.000021282836,0.0001082231,0.0000019371087,3.5086387e-7,0.000016640333,0.00016600733],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973908,0.0003987547,0.0008735897,0.00019825486,0.00080318365,0.00033540162],"domain_scores_gemma":[0.995803,0.0013824928,0.00087830843,0.0007345764,0.0009804948,0.00022115425],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022415102,0.00018556259,0.000597007,0.0005223614,0.00012164854,0.000022344493,0.0016750024,0.00010218342,0.000050209186],"category_scores_gemma":[0.0007913983,0.00011852587,0.00030091044,0.00069669477,0.0005589234,0.0011163572,0.00017612692,0.00026140545,0.00000540603],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007897959,0.00016659127,0.0004073773,0.000016896973,0.000087722794,0.000045800232,0.00028620224,0.0000033432452,0.05710806,0.9382576,0.00049318146,0.0023374658],"study_design_scores_gemma":[0.0013887918,0.0013771504,0.0010167487,0.0002085693,0.000018100644,0.000104368075,0.00013095517,0.0000034774234,0.05615158,0.9381563,0.0013109349,0.0001330381],"about_ca_topic_score_codex":0.0000021660903,"about_ca_topic_score_gemma":6.659472e-7,"teacher_disagreement_score":0.30114195,"about_ca_system_score_codex":0.000033541775,"about_ca_system_score_gemma":0.00022653963,"threshold_uncertainty_score":0.48333448},"labels":[],"label_agreement":null},{"id":"W1964757115","doi":"10.1016/j.jctb.2007.09.002","title":"Generating weakly 4-connected matroids","year":2007,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","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":"Matroid; Mathematics; Combinatorics; Graphic matroid; Oriented matroid; Matroid partitioning; Element (criminal law); Minor (academic); Discrete mathematics","score_opus":0.011170585007555882,"score_gpt":0.27695689597859524,"score_spread":0.2657863109710394,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1964757115","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3478831,0.0005864916,0.6367589,0.00041429975,0.009993768,0.000164664,0.0000012087501,0.00011893866,0.004078605],"genre_scores_gemma":[0.9540494,0.000027891307,0.044098943,0.00012358843,0.0012717163,0.000001440703,4.2228535e-7,0.000025291172,0.00040131545],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973528,0.00043825473,0.0007556303,0.00020626125,0.00073167885,0.0005153756],"domain_scores_gemma":[0.9971427,0.0008812631,0.00052101904,0.00048485657,0.0007129687,0.00025721316],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0061740763,0.00019553807,0.0003659754,0.00036364907,0.0002613013,0.00020100568,0.0015220244,0.00010526503,0.000052011394],"category_scores_gemma":[0.0009907136,0.00016647605,0.00019045915,0.0007675031,0.0001831581,0.0017181789,0.00027307062,0.0005643343,0.000012745954],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00060351175,0.00006829721,0.00007511776,0.000007329022,0.000050465715,0.00017359114,0.00042095807,0.00007694802,0.031923257,0.9584398,0.00015851672,0.008002172],"study_design_scores_gemma":[0.0009910902,0.0008430992,0.00012924918,0.000031128173,0.00000867545,0.00044937618,0.00027934395,0.0001008206,0.05082517,0.93971646,0.0064249896,0.00020062008],"about_ca_topic_score_codex":7.652373e-7,"about_ca_topic_score_gemma":7.931494e-7,"teacher_disagreement_score":0.6061663,"about_ca_system_score_codex":0.00010483911,"about_ca_system_score_gemma":0.00017407424,"threshold_uncertainty_score":0.6788696},"labels":[],"label_agreement":null},{"id":"W1964864950","doi":"10.1006/jctb.2001.2090","title":"Optimal Ear Decompositions of Matching Covered Graphs and Bases for the Matching Lattice","year":2002,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":28,"is_retracted":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; Matching (statistics); Cubic graph; Lattice (music); Graph; Discrete mathematics; Line graph; Voltage graph; Physics","score_opus":0.01904510044783211,"score_gpt":0.2777941096068416,"score_spread":0.2587490091590095,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1964864950","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49299264,0.001637874,0.5004136,0.0014347633,0.002637873,0.0003861655,0.000022202805,0.00004094771,0.00043393014],"genre_scores_gemma":[0.9576998,0.00024710238,0.04173618,0.00007817602,0.00012992833,0.0000071403497,3.346666e-7,0.00001673564,0.00008464024],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99841136,0.00033347646,0.0004667367,0.0001473495,0.00038736517,0.00025374346],"domain_scores_gemma":[0.9955452,0.0032686857,0.00041958055,0.000326743,0.00033539103,0.00010438815],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018020548,0.00014423778,0.0003080318,0.00016960203,0.00042774054,0.00016356041,0.00089388114,0.000051576422,0.000028583856],"category_scores_gemma":[0.00027331055,0.00010433243,0.00017837076,0.00030573722,0.00027658837,0.0012881691,0.00020748161,0.00030177092,9.631632e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00038758706,0.00008845371,0.000019845982,0.000027631755,0.00010045061,0.000009494668,0.0018548238,0.0008747147,0.002153929,0.99288994,0.00010770263,0.0014854018],"study_design_scores_gemma":[0.0010772874,0.0005578676,0.000080148144,0.00006899659,0.000036090372,0.00019254815,0.0008433894,0.0007266192,0.0038016504,0.9914727,0.0010261303,0.00011652427],"about_ca_topic_score_codex":0.0000022486502,"about_ca_topic_score_gemma":3.0302343e-7,"teacher_disagreement_score":0.4647071,"about_ca_system_score_codex":0.000023544795,"about_ca_system_score_gemma":0.00003628093,"threshold_uncertainty_score":0.4254553},"labels":[],"label_agreement":null},{"id":"W1966311297","doi":"10.1006/jctb.2001.2094","title":"Disjoint Cycles in Eulerian Digraphs and the Diameter of Interchange Graphs","year":2002,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":11,"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":"Digraph; Combinatorics; Eulerian path; Disjoint sets; Vertex (graph theory); Mathematics; Partition (number theory); Bipartite graph; Upper and lower bounds; Graph; Discrete mathematics; Lagrangian","score_opus":0.012725503802215814,"score_gpt":0.2055984673701304,"score_spread":0.19287296356791458,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1966311297","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98062885,0.00543394,0.0028115595,0.0035184543,0.0059431326,0.00024593962,0.000002418142,0.000031149088,0.0013845556],"genre_scores_gemma":[0.99804974,0.00053832715,0.0012523034,0.00010071998,0.000023480125,0.0000027355404,7.747126e-8,0.00000686508,0.00002577187],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99838495,0.00046777973,0.0005790758,0.00012652767,0.0002713078,0.00017036458],"domain_scores_gemma":[0.9986507,0.0004403875,0.00040744455,0.00028896503,0.00013787462,0.00007458625],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019259518,0.00012900861,0.00037750846,0.0002766453,0.000067599685,0.00008557836,0.00055603683,0.00005603366,0.000018408015],"category_scores_gemma":[0.00023702695,0.00007733673,0.00015888525,0.0004037928,0.0005124922,0.0005292039,0.0001304294,0.00023858252,8.6464206e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026143863,0.00009536921,0.00040661203,0.000012328655,0.000036944028,0.0000114230725,0.0041635954,0.0000039926963,0.0004929299,0.99105287,0.000114505565,0.0033480078],"study_design_scores_gemma":[0.0023867341,0.0003782332,0.0005468276,0.00010600241,0.000013840758,0.000062786225,0.00026829718,0.00011019795,0.001647472,0.9940973,0.00029000358,0.00009228283],"about_ca_topic_score_codex":0.000009933551,"about_ca_topic_score_gemma":0.0000032829266,"teacher_disagreement_score":0.017420867,"about_ca_system_score_codex":0.0000091628945,"about_ca_system_score_gemma":0.000011909875,"threshold_uncertainty_score":0.31537002},"labels":[],"label_agreement":null},{"id":"W1968677127","doi":"10.1016/j.jctb.2004.09.006","title":"<mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.gif\" overflow=\"scroll\"><mml:mo stretchy=\"false\">(</mml:mo><mml:mi>Δ</mml:mi><mml:mo>-</mml:mo><mml:mi>k</mml:mi><mml:mo stretchy=\"false\">)</mml:mo></mml:math>-critical graphs","year":2004,"lang":"lv","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","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":"McGill University; Microsoft (Canada); University of Toronto","funders":"","keywords":"Clique; Algorithm; Graph; Combinatorics; Mathematics; Discrete mathematics; Computer science","score_opus":0.016637711207507806,"score_gpt":0.2627129415723882,"score_spread":0.2460752303648804,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1968677127","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96907717,0.003486972,0.003868426,0.0017721948,0.014604958,0.00024045986,0.00041106466,0.00049056724,0.006048162],"genre_scores_gemma":[0.9859153,0.002274095,0.0041890494,0.00126377,0.0047488394,0.0004248689,0.00015298641,0.00089982845,0.00013128022],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.97999233,0.0020579095,0.0042480323,0.0029057397,0.006191022,0.004604972],"domain_scores_gemma":[0.9844038,0.0046126293,0.0036678077,0.003243271,0.001273806,0.0027987217],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science","research_integrity","insufficient_payload"],"consensus_categories":["metaepi_narrow","sts","research_integrity","insufficient_payload"],"category_scores_codex":[0.007919261,0.0020142545,0.0013973378,0.0014052187,0.0035096253,0.0036590362,0.006740095,0.0032410456,0.0020043142],"category_scores_gemma":[0.0057169804,0.0029426774,0.0036526585,0.002978838,0.0052644457,0.005479877,0.0041137226,0.0055260854,0.001621927],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.007533863,0.0013958182,0.000025464853,0.0009816223,0.0023362613,0.0035220548,0.0035016024,0.002253673,0.0028378586,0.9646927,0.0064882226,0.004430854],"study_design_scores_gemma":[0.0057561123,0.007197375,0.000035149333,0.0021274807,0.001271113,0.0040926314,0.0034872207,0.010538571,0.20112057,0.7569518,0.004872728,0.0025492047],"about_ca_topic_score_codex":0.00047096534,"about_ca_topic_score_gemma":0.00019004653,"teacher_disagreement_score":0.20774087,"about_ca_system_score_codex":0.00016920635,"about_ca_system_score_gemma":0.003470607,"threshold_uncertainty_score":0.99926},"labels":[],"label_agreement":null},{"id":"W1969055353","doi":"10.1016/j.jctb.2010.12.002","title":"Unexpected behaviour of crossing sequences","year":2011,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"graph theory and CDMA systems","field":"Engineering","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":"Simon Fraser University","funders":"","keywords":"Computer science","score_opus":0.013971670668904795,"score_gpt":0.21000680651573364,"score_spread":0.19603513584682886,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1969055353","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9850517,0.00059978093,0.00032087672,0.0000029588184,0.007666874,0.000055461063,0.0000038483317,0.000048872556,0.0062496406],"genre_scores_gemma":[0.99942,0.000020493546,0.00024358378,0.00000212268,0.0002458077,0.0000013339852,3.7654962e-7,0.000021433756,0.000044846365],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987833,0.00016918358,0.0006094761,0.000060362792,0.00021094007,0.00016672061],"domain_scores_gemma":[0.9991885,0.00007423289,0.00029759822,0.0001572926,0.0002018295,0.00008054273],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00084452034,0.00014139559,0.0003644706,0.00013603097,0.00008240545,0.00003808132,0.0002917,0.00009923192,0.00016003073],"category_scores_gemma":[0.000066989705,0.00011952364,0.00016333553,0.00020796887,0.00025358374,0.00046473977,0.000017349414,0.00021288458,0.0000023394527],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00093876536,0.00012480056,0.0030819378,0.000099130884,0.0002572746,0.00008490159,0.009576645,0.000083186016,0.048701458,0.93626,0.00011309505,0.0006788084],"study_design_scores_gemma":[0.00095301005,0.00052095763,0.0022090934,0.00019695432,0.00008626146,0.00024473114,0.0033070913,0.0000064217143,0.27364254,0.717799,0.0007984545,0.00023550156],"about_ca_topic_score_codex":0.0000049839164,"about_ca_topic_score_gemma":6.587745e-7,"teacher_disagreement_score":0.22494107,"about_ca_system_score_codex":0.000027291042,"about_ca_system_score_gemma":0.00004929243,"threshold_uncertainty_score":0.48740324},"labels":[],"label_agreement":null},{"id":"W1970138544","doi":"10.1016/j.jctb.2011.03.005","title":"Finitely forcible graphons","year":2011,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":54,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Iterated function; Mathematics; Algebraic structure; Combinatorics; Graph; Discrete mathematics; Pure mathematics; Mathematical analysis","score_opus":0.05386988719056061,"score_gpt":0.27678391431481614,"score_spread":0.22291402712425554,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1970138544","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.89705276,0.00040732994,0.00140025,0.00005649007,0.018665941,0.00019923349,0.000009353998,0.00007379373,0.08213485],"genre_scores_gemma":[0.9935685,0.000068205605,0.0051004216,0.000060731916,0.00061276555,0.0000022246788,3.036095e-7,0.00003488466,0.0005519795],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983539,0.00028552327,0.00065293285,0.0001099746,0.00033850913,0.0002591393],"domain_scores_gemma":[0.9980184,0.0005830407,0.00059850194,0.00034291114,0.00031747136,0.00013967798],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016545772,0.00019829234,0.00044353103,0.00021761078,0.0002469279,0.000029000505,0.0005392684,0.00014092827,0.0007397281],"category_scores_gemma":[0.0007391019,0.00014447542,0.00034087242,0.00022797714,0.00025957436,0.00044492166,0.000110428,0.00037795157,0.000003432975],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013902793,0.00012836175,0.00022927977,0.000024719056,0.00016656973,0.00004811978,0.0034051624,1.7586586e-7,0.00010949212,0.992183,0.0017931381,0.0005216846],"study_design_scores_gemma":[0.00073557644,0.0007367241,0.00017415782,0.00004304889,0.00010047085,0.00021131245,0.0007227628,2.2187108e-7,0.008762904,0.98234993,0.005992872,0.00017004205],"about_ca_topic_score_codex":0.0000011903692,"about_ca_topic_score_gemma":5.049225e-7,"teacher_disagreement_score":0.09651573,"about_ca_system_score_codex":0.00002327855,"about_ca_system_score_gemma":0.00006491604,"threshold_uncertainty_score":0.80995035},"labels":[],"label_agreement":null},{"id":"W1971585316","doi":"10.1016/s0095-8956(02)00014-x","title":"The independence fractal of a graph","year":2003,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Mathematical Dynamics and Fractals","field":"Mathematics","cited_by":22,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Cape Breton University; Dalhousie University","funders":"","keywords":"Lexicographical order; Mathematics; Discrete mathematics; Independence (probability theory); Combinatorics; Fractal; Hausdorff space; Graph; Mathematical analysis","score_opus":0.014834270858992858,"score_gpt":0.2755049509229615,"score_spread":0.26067068006396865,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1971585316","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.91137433,0.0008379224,0.018685166,0.000384665,0.0087317405,0.00043425173,0.000009977385,0.000029171704,0.059512764],"genre_scores_gemma":[0.99758244,0.0000927156,0.0018241352,0.000012951655,0.00011469205,0.000001944508,9.207884e-8,0.000017558768,0.00035345732],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979961,0.00034880493,0.000811082,0.00007034886,0.0005834342,0.00019026332],"domain_scores_gemma":[0.9957929,0.0024703636,0.00093470304,0.0002768535,0.00043552814,0.00008963154],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038873644,0.00013447627,0.00040457342,0.00006193074,0.0001363128,0.000050047245,0.0003870388,0.00010954276,0.00013678992],"category_scores_gemma":[0.005312685,0.00008025021,0.00023730236,0.00017181704,0.00024079837,0.00023834477,0.000037951126,0.00037346644,0.0000020585205],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026268073,0.0001682153,0.00004095676,0.00003727168,0.00009267628,0.000011275385,0.00027575088,8.317498e-7,0.00036185264,0.9981972,0.00025249788,0.0002988048],"study_design_scores_gemma":[0.0005440139,0.00033974194,0.00002060006,0.0000613764,0.00004720789,0.00012673199,0.00058504305,0.0000047787144,0.0027516373,0.99146944,0.003961692,0.00008773796],"about_ca_topic_score_codex":4.832982e-7,"about_ca_topic_score_gemma":6.420064e-7,"teacher_disagreement_score":0.08620811,"about_ca_system_score_codex":0.000021448346,"about_ca_system_score_gemma":0.00011290718,"threshold_uncertainty_score":0.6360164},"labels":[],"label_agreement":null},{"id":"W1971752656","doi":"10.1016/j.jctb.2009.05.002","title":"The projective plane is a stabilizer","year":2009,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","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":"Projective plane; Matroid; Real projective plane; Stabilizer (aeronautics); Projective test; Blocking set; Minor (academic); Plane (geometry); Mathematics; Projective space; Combinatorics; Fano plane; Pure mathematics; Complex projective space; Geometry; Art; Engineering; Structural engineering","score_opus":0.011682825517400432,"score_gpt":0.2817224498482041,"score_spread":0.2700396243308037,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1971752656","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44725135,0.01160684,0.32829037,0.06423075,0.060149163,0.004017102,0.000032385306,0.0007330934,0.08368896],"genre_scores_gemma":[0.9957152,0.00019046594,0.0024135015,0.00031165805,0.00053740334,0.000004141213,1.6425194e-7,0.000012515659,0.00081495725],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977069,0.0005915658,0.00044771942,0.00017443977,0.0007069767,0.00037242597],"domain_scores_gemma":[0.9974323,0.0009166713,0.00037713538,0.0005475203,0.0005910018,0.00013535426],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029537946,0.00015985938,0.00026869294,0.00012904833,0.00039507807,0.00026365466,0.0017439038,0.000065800916,0.000022132625],"category_scores_gemma":[0.00065825274,0.0000975639,0.00016062014,0.0005246855,0.00025462126,0.0012831019,0.00014145953,0.0005120145,0.000008664247],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012782005,0.00008109597,0.000016747572,0.000002066834,0.00004107477,0.000037711678,0.0013579375,0.0000044428066,0.000647722,0.98147565,0.0008886383,0.0141687235],"study_design_scores_gemma":[0.00077296264,0.0017541978,0.00015268676,0.00001748075,0.000006147161,0.00017043766,0.0003586463,0.000013210894,0.009106488,0.9553033,0.03222951,0.00011490446],"about_ca_topic_score_codex":3.7621058e-7,"about_ca_topic_score_gemma":2.3797003e-7,"teacher_disagreement_score":0.5484638,"about_ca_system_score_codex":0.00008437473,"about_ca_system_score_gemma":0.00024429118,"threshold_uncertainty_score":0.39785403},"labels":[],"label_agreement":null},{"id":"W1972423218","doi":"10.1016/j.jctb.2012.09.003","title":"Limits of permutation sequences","year":2012,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":115,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Mathematics; Combinatorics; Sequence (biology); Permutation (music); Limit (mathematics); Random permutation; Limit of a sequence; Discrete mathematics; Function (biology); Limit of a function; Class (philosophy); Mathematical analysis","score_opus":0.031892451417784934,"score_gpt":0.30929187706200817,"score_spread":0.27739942564422326,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1972423218","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9844156,0.00060453144,0.0003542426,0.000054611835,0.008366535,0.00007965715,0.000003616391,0.00001296004,0.0061082793],"genre_scores_gemma":[0.99662876,0.00005571738,0.002135562,0.000020075327,0.0010182349,9.2566626e-7,3.7520007e-7,0.000016017802,0.00012432104],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984193,0.0003475032,0.0006071023,0.00005402599,0.0003794536,0.00019261919],"domain_scores_gemma":[0.9978002,0.0007949279,0.0008026606,0.00016924605,0.0003353508,0.00009762172],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002144958,0.00012960251,0.00037285092,0.000120248136,0.00011486402,0.0000149964,0.00026810096,0.00010162966,0.00015026642],"category_scores_gemma":[0.0010434106,0.00009214531,0.0001854082,0.00013855117,0.00021569997,0.00066807435,0.00003964363,0.00020750203,8.928379e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00052598247,0.00009855787,0.00075917545,0.00005326621,0.0001040354,0.0000030151282,0.004124068,0.000001307537,0.001642896,0.99155164,0.00026386214,0.0008722176],"study_design_scores_gemma":[0.00050542125,0.000356251,0.00044908392,0.00005332158,0.00008681784,0.00012901642,0.0012429458,3.4344282e-7,0.026766712,0.96856034,0.0017513714,0.000098405064],"about_ca_topic_score_codex":4.357876e-7,"about_ca_topic_score_gemma":9.7805184e-8,"teacher_disagreement_score":0.025123816,"about_ca_system_score_codex":0.000029366485,"about_ca_system_score_gemma":0.000051860217,"threshold_uncertainty_score":0.37575766},"labels":[],"label_agreement":null},{"id":"W1975172784","doi":"10.1016/j.jctb.2006.01.001","title":"Representation characterizations of chordal bipartite graphs","year":2006,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":39,"is_retracted":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":"Combinatorics; Chordal graph; Interval graph; Bipartite graph; Mathematics; Complete bipartite graph; Split graph; Discrete mathematics; Cograph; Distance-hereditary graph; Indifference graph; Graph; Line graph; 1-planar graph; Graph power","score_opus":0.012271149793242522,"score_gpt":0.2757147604491695,"score_spread":0.263443610655927,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1975172784","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8260499,0.00027286235,0.1644391,0.00057353213,0.004944343,0.00025971932,0.0000072469657,0.000066592525,0.0033866866],"genre_scores_gemma":[0.9964467,0.00004921814,0.002916095,0.000015297419,0.000287512,0.0000035206172,0.00000257427,0.000011779053,0.0002672563],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99799514,0.00043310598,0.00066794915,0.00014776741,0.00054092944,0.00021512876],"domain_scores_gemma":[0.9978443,0.0003228428,0.0006929959,0.0004012779,0.00065883336,0.000079773046],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011834507,0.00012038622,0.00031150252,0.00037060597,0.00011708819,0.00008406423,0.0008168663,0.000058887854,0.00003397287],"category_scores_gemma":[0.00029897803,0.00010675494,0.00017694129,0.0010559837,0.00022309182,0.0018314702,0.00012918685,0.0002116489,0.0000031990064],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033983708,0.00013307326,0.0013060682,0.000008570627,0.000030857114,0.0000150071155,0.00016088488,0.00011779156,0.021096572,0.975436,0.00013594227,0.0012194379],"study_design_scores_gemma":[0.00087716966,0.00045124465,0.0043646377,0.000024541037,0.000010285268,0.0000552514,0.0000360574,0.000037320788,0.05605224,0.9366279,0.0013674255,0.0000958818],"about_ca_topic_score_codex":0.000003303721,"about_ca_topic_score_gemma":5.518506e-7,"teacher_disagreement_score":0.17039683,"about_ca_system_score_codex":0.000028935256,"about_ca_system_score_gemma":0.00010186258,"threshold_uncertainty_score":0.43533403},"labels":[],"label_agreement":null},{"id":"W1976828798","doi":"10.1016/j.jctb.2008.03.003","title":"Projective geometries in dense matroids","year":2008,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Matroid; Combinatorics; Prime power; Minor (academic); Mathematics; Integer (computer science); Projective plane; Prime (order theory); Simple (philosophy); Discrete mathematics; Computer science; Geometry","score_opus":0.017698982939964993,"score_gpt":0.2748469373574108,"score_spread":0.2571479544174458,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1976828798","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9434649,0.0009300043,0.046995528,0.00043697827,0.004902079,0.00029789392,0.000002034523,0.000064889224,0.0029057243],"genre_scores_gemma":[0.99431336,0.00019088761,0.004799469,0.000039098075,0.00026517097,0.00000575069,1.7509151e-7,0.000015633148,0.00037044083],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99764013,0.00052712095,0.00056059205,0.00020009044,0.0006843693,0.0003877146],"domain_scores_gemma":[0.9978878,0.00070253736,0.0003446235,0.0003953062,0.0005320495,0.00013766924],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023480458,0.0001745462,0.00041686892,0.00083712494,0.00017856491,0.0000737155,0.0012519968,0.000087314635,0.000023029277],"category_scores_gemma":[0.0012187174,0.00014712127,0.00014924331,0.001614198,0.00040085163,0.0021397423,0.00027354294,0.0005727969,0.000010096493],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013393189,0.00016169607,0.0016956234,0.00000887116,0.00003832327,0.00062479713,0.002030174,0.00004517385,0.0007542054,0.9918417,0.00016099753,0.0012991462],"study_design_scores_gemma":[0.0015138717,0.0011268448,0.0018042695,0.000032588898,0.000003688912,0.0011634221,0.00035849708,0.00001204737,0.01053858,0.98038656,0.0028897082,0.00016990518],"about_ca_topic_score_codex":0.0000024230662,"about_ca_topic_score_gemma":8.839169e-7,"teacher_disagreement_score":0.050848506,"about_ca_system_score_codex":0.00015427772,"about_ca_system_score_gemma":0.00037063667,"threshold_uncertainty_score":0.5999431},"labels":[],"label_agreement":null},{"id":"W1976984302","doi":"10.1016/j.jctb.2004.09.002","title":"W.T. Tutte","year":2004,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Educational and Social Studies","field":"Social Sciences","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":"Humanities; Art","score_opus":0.01453352068465055,"score_gpt":0.3038081908217325,"score_spread":0.28927467013708197,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1976984302","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7560066,0.0014151012,0.0001401402,0.02473668,0.029758653,0.00015546965,0.0000025844015,0.00004313872,0.1877416],"genre_scores_gemma":[0.99404323,0.00039638905,0.00018035273,0.00016152741,0.003771096,0.0000014261111,1.9831903e-7,0.000005825224,0.0014399351],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988998,0.00020415011,0.0002501014,0.00005155948,0.00042581293,0.0001685766],"domain_scores_gemma":[0.9990345,0.00018469238,0.00022178674,0.00005041872,0.0004044568,0.00010413097],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001540263,0.00006725434,0.00017958293,0.000044152108,0.0006339226,0.00005399723,0.00023140258,0.00006142752,0.00015307972],"category_scores_gemma":[0.0008903888,0.000057181653,0.00011843812,0.00018144913,0.00040704515,0.000416467,0.000022518074,0.00015223275,0.000014097199],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009566326,0.00007669216,0.00021742294,0.0000016200618,0.000039531944,0.0000062829054,0.024088955,0.000003818213,0.000023358623,0.97428375,0.00072449696,0.00043842793],"study_design_scores_gemma":[0.00036675308,0.00010498232,0.000637099,0.00001442926,0.000013304343,0.0000036402444,0.014772986,1.1015443e-9,0.00012247387,0.7851657,0.19874284,0.000055763474],"about_ca_topic_score_codex":0.00008520415,"about_ca_topic_score_gemma":0.00003405553,"teacher_disagreement_score":0.23803663,"about_ca_system_score_codex":0.00017821633,"about_ca_system_score_gemma":0.0005860015,"threshold_uncertainty_score":0.4875684},"labels":[],"label_agreement":null},{"id":"W1977168065","doi":"10.1016/j.jctb.2004.07.001","title":"Dimers, tilings and trees","year":2004,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Stochastic processes and statistical mechanics","field":"Mathematics","cited_by":47,"is_retracted":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; Mathematics; Bipartite graph; Bijection; Markov chain; Planar graph; Regular polygon; Planar; Discrete mathematics; Graph; Computer science; Geometry","score_opus":0.017806304064959234,"score_gpt":0.2841692701646123,"score_spread":0.26636296609965304,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1977168065","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44698954,0.0016792252,0.534443,0.0014795252,0.010924605,0.00031715425,0.000019620655,0.000083286825,0.0040639946],"genre_scores_gemma":[0.98535997,0.00007332941,0.014020147,0.000046053225,0.0003834198,0.0000011297709,2.1362861e-7,0.00001799166,0.000097756485],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991254,0.00004005357,0.00036899716,0.00007714266,0.00024487454,0.00014349604],"domain_scores_gemma":[0.9987355,0.0006028708,0.00026320617,0.00009325177,0.00018963398,0.000115554365],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00062954647,0.00011452515,0.00030444222,0.000050220904,0.000077575845,0.00004096401,0.00014026198,0.000068577436,0.000042938078],"category_scores_gemma":[0.0023675656,0.00008697789,0.00006071757,0.000082415136,0.0000937744,0.00019409838,0.000040569605,0.00019379743,0.0000017807472],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004778181,0.00007444624,0.0000021055787,0.000033840653,0.00004381824,0.000031533527,0.0004628684,0.0000015839472,0.0002766603,0.9972873,0.000097286924,0.001210765],"study_design_scores_gemma":[0.0013345476,0.0008135042,0.000009321004,0.00008538722,0.00007466618,0.00019666884,0.0004268577,0.0000032085204,0.0018788663,0.99412954,0.0009510117,0.00009643063],"about_ca_topic_score_codex":7.854127e-7,"about_ca_topic_score_gemma":5.4756714e-7,"teacher_disagreement_score":0.53837043,"about_ca_system_score_codex":0.000031097,"about_ca_system_score_gemma":0.000084558116,"threshold_uncertainty_score":0.35468554},"labels":[],"label_agreement":null},{"id":"W1979091665","doi":"10.1016/j.jctb.2010.06.001","title":"The number of points in a matroid with no n-point line as a minor","year":2010,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","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 Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Matroid; Minor (academic); Combinatorics; Rank (graph theory); Mathematics; Prime power; Line (geometry); Integer (computer science); Point (geometry); Prime (order theory); Projective plane; Oriented matroid; Discrete mathematics; Graphic matroid; Geometry; Computer science; Humanities","score_opus":0.005835806336886248,"score_gpt":0.27290845197337554,"score_spread":0.2670726456364893,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1979091665","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9817357,0.0000974929,0.005162324,0.001413142,0.0050979964,0.0002647615,0.0000018622079,0.000023163328,0.0062035313],"genre_scores_gemma":[0.98752445,0.000043032655,0.0114384005,0.000050474184,0.00032413332,0.0000065211484,1.5321366e-7,0.000019756351,0.0005930774],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978074,0.00042288675,0.0005989714,0.00016293746,0.0006663649,0.0003414401],"domain_scores_gemma":[0.99694115,0.0009864406,0.00054225296,0.00060919713,0.0007798194,0.00014116385],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035598837,0.0001662334,0.00035578996,0.00014209945,0.00012641486,0.00011261897,0.001599329,0.000078885496,0.000078141835],"category_scores_gemma":[0.0011104454,0.00009922233,0.00012252241,0.00053012377,0.0004808045,0.0009691399,0.00025887656,0.00084798265,0.000026482317],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.003329225,0.00014843061,0.0005264016,0.000011227809,0.000040548457,0.00008588229,0.0004621675,0.0000050145186,0.0038093904,0.99017483,0.000055407938,0.0013514725],"study_design_scores_gemma":[0.0017305702,0.001074098,0.00027216176,0.000055972712,0.0000062253134,0.0006453151,0.00017540631,0.000025480711,0.014033315,0.9778657,0.0039944714,0.0001212859],"about_ca_topic_score_codex":0.0000043623304,"about_ca_topic_score_gemma":0.0000083365085,"teacher_disagreement_score":0.012309134,"about_ca_system_score_codex":0.000033380657,"about_ca_system_score_gemma":0.00028759608,"threshold_uncertainty_score":0.40461692},"labels":[],"label_agreement":null},{"id":"W1980134397","doi":"10.1016/j.jctb.2010.07.006","title":"Spectral radius of finite and infinite planar graphs and of graphs of bounded genus","year":2010,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Graph theory and applications","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":"Simon Fraser University","funders":"","keywords":"Spectral radius; Combinatorics; Mathematics; Planar graph; Bounded function; Upper and lower bounds; Degree (music); Order (exchange); Discrete mathematics; Graph; Mathematical analysis; Physics; Eigenvalues and eigenvectors","score_opus":0.013347340318574308,"score_gpt":0.2566479518093279,"score_spread":0.2433006114907536,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1980134397","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99791837,0.00020168057,0.00005528287,0.000052318217,0.00075050973,0.00014036035,0.000041494266,0.000007394587,0.000832596],"genre_scores_gemma":[0.9974574,0.00017536772,0.0022526602,0.000007053203,0.00006136311,0.0000019529198,0.0000010286611,0.000015441563,0.00002776666],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99858284,0.00015686682,0.0007926335,0.000096678035,0.00023187176,0.00013910104],"domain_scores_gemma":[0.997059,0.0012449251,0.0010865189,0.00025759728,0.0002519352,0.000100018005],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013299437,0.0001536502,0.0005724731,0.00026273497,0.0000764902,0.000015591473,0.0002226613,0.00012529679,0.000039972074],"category_scores_gemma":[0.0005248296,0.00012995054,0.0001674114,0.00025164604,0.0008265651,0.00020374704,0.00003539223,0.0003358924,1.3160866e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009775138,0.00019580768,0.0014775945,0.0001389818,0.00016453906,0.0000034720204,0.0011094204,3.5976396e-7,0.026477953,0.9691954,0.000048429956,0.00021050873],"study_design_scores_gemma":[0.0013619505,0.00061726355,0.0015027634,0.0000672948,0.00014457747,0.00009183533,0.00040821655,0.0000011281752,0.040935688,0.9542362,0.00052835536,0.00010473954],"about_ca_topic_score_codex":0.0000037257387,"about_ca_topic_score_gemma":0.0000037385753,"teacher_disagreement_score":0.01495923,"about_ca_system_score_codex":0.0000035603123,"about_ca_system_score_gemma":0.00005732297,"threshold_uncertainty_score":0.5299229},"labels":[],"label_agreement":null},{"id":"W1981926792","doi":"10.1016/j.jctb.2009.07.002","title":"Asymptotically optimal frugal colouring","year":2009,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":18,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Neighbourhood (mathematics); Mathematics; Vertex (graph theory); Graph; Combinatorics; Constant (computer programming); Asymptotically optimal algorithm; Term (time); Discrete mathematics; Computer science; Mathematical optimization; Physics; Mathematical analysis","score_opus":0.013233764270504525,"score_gpt":0.2763653776591601,"score_spread":0.26313161338865554,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1981926792","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9770487,0.00018058272,0.001634364,0.0004430688,0.0070127216,0.00013112219,0.0000025601585,0.00005394328,0.013492946],"genre_scores_gemma":[0.99077195,0.00002683148,0.0072694975,0.00014342545,0.0014629522,6.0887623e-7,2.5759877e-7,0.000021938933,0.00030252102],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998026,0.0003115792,0.0007303341,0.00012626318,0.00049711514,0.00030868896],"domain_scores_gemma":[0.9980108,0.00069786573,0.00050607824,0.00027412534,0.00033893707,0.00017217058],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019167972,0.00021858129,0.0005219665,0.00013690209,0.0002675335,0.00007679055,0.00051683973,0.00016856387,0.000213119],"category_scores_gemma":[0.0011718159,0.00016534125,0.00029028626,0.00014980654,0.00017623189,0.00042176183,0.00007793625,0.0005302897,0.0000021522503],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0017009166,0.00014414219,0.000038266084,0.000013161029,0.0001019494,0.00008489813,0.00083865866,0.000013754568,0.00052640494,0.99452966,0.00089054374,0.0011176524],"study_design_scores_gemma":[0.001265424,0.0014620761,0.00031396822,0.00006108311,0.00008739661,0.00036079934,0.00027080558,0.0000029309815,0.0035319098,0.98928326,0.0031701867,0.0001901577],"about_ca_topic_score_codex":1.10353035e-7,"about_ca_topic_score_gemma":5.985493e-8,"teacher_disagreement_score":0.013723276,"about_ca_system_score_codex":0.000057720034,"about_ca_system_score_gemma":0.000087193745,"threshold_uncertainty_score":0.6742421},"labels":[],"label_agreement":null},{"id":"W1984128946","doi":"10.1016/j.jctb.2015.02.002","title":"Linear embeddings of graphs and graph limits","year":2015,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Complement graph; Line graph; Discrete mathematics; Voltage graph; Null graph; Regular graph; Graph power; Random graph; Distance-regular graph; Butterfly graph; Symmetric graph; Graph","score_opus":0.033213788291548946,"score_gpt":0.2978219061608675,"score_spread":0.2646081178693186,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1984128946","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9909034,0.0006976923,0.00017768594,0.00007841231,0.004842486,0.00010186242,0.000005423933,0.000022007038,0.003171041],"genre_scores_gemma":[0.99599904,0.000139561,0.0033444883,0.000033307235,0.00031324607,9.167762e-7,3.3660058e-7,0.000027233473,0.00014187841],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982418,0.00028725705,0.00071320724,0.00011033939,0.00045786335,0.00018955964],"domain_scores_gemma":[0.99750686,0.00063091295,0.00078101066,0.0002429282,0.00062968186,0.00020861349],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024061964,0.00019193672,0.0005803375,0.00023596667,0.00010425266,0.000024438768,0.00032683718,0.00014557462,0.000026303083],"category_scores_gemma":[0.0014774784,0.00014079834,0.00020605144,0.0002337854,0.00041351104,0.00037325994,0.00010048242,0.0003149532,3.2368905e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014626127,0.000079680045,0.00044198817,0.000058177488,0.00016043484,0.000017286138,0.0028869614,0.0000020172972,0.00033265055,0.993029,0.0011632742,0.00036592133],"study_design_scores_gemma":[0.0016515873,0.0010152576,0.00008035253,0.00008163245,0.0001137385,0.0002054172,0.0012363648,0.0000014070758,0.0058822786,0.9877519,0.001834127,0.00014594241],"about_ca_topic_score_codex":8.9675444e-7,"about_ca_topic_score_gemma":2.6005452e-7,"teacher_disagreement_score":0.0055496283,"about_ca_system_score_codex":0.0000172591,"about_ca_system_score_gemma":0.0000743817,"threshold_uncertainty_score":0.57415897},"labels":[],"label_agreement":null},{"id":"W1984987350","doi":"10.1016/j.jctb.2006.04.002","title":"Symmetric squares of graphs","year":2006,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Operator Algebra Research","field":"Mathematics","cited_by":69,"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; Leverhulme Trust","keywords":"Quantum graph; Mathematics; Combinatorics; Spectral line; Graph; Connection (principal bundle); Square (algebra); Discrete mathematics; Physics; Quantum mechanics; Geometry","score_opus":0.017469052390127648,"score_gpt":0.30374540738009237,"score_spread":0.28627635498996473,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1984987350","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9873425,0.0011105727,0.0011579602,0.00011001399,0.0028529011,0.00019954245,0.000007912616,0.000027957007,0.0071906466],"genre_scores_gemma":[0.99597085,0.00005998901,0.0031555186,0.0000066947755,0.000441161,0.000002291832,5.752517e-7,0.000033042546,0.0003299096],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976743,0.00034588383,0.0008571398,0.000102179874,0.00076439604,0.00025614345],"domain_scores_gemma":[0.9968917,0.0012695956,0.0006576914,0.000279978,0.00081334973,0.00008772435],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001754097,0.00016180052,0.0005337223,0.00045878155,0.000082953906,0.000034884928,0.00044443284,0.00010068703,0.00015460701],"category_scores_gemma":[0.0018965035,0.00012812755,0.00023451955,0.0007674838,0.00022723488,0.00048023288,0.00007578985,0.00035002767,0.0000031686557],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00079138234,0.00028754876,0.00037232044,0.00007107584,0.00006674566,0.00003476862,0.00009419146,0.00001109999,0.002502385,0.99402964,0.001145628,0.0005932005],"study_design_scores_gemma":[0.001266607,0.0007939558,0.00020942937,0.000056842015,0.000039186005,0.000065761764,0.0002749327,0.0000012803446,0.038166136,0.95709926,0.001905668,0.00012091578],"about_ca_topic_score_codex":0.0000040458353,"about_ca_topic_score_gemma":0.000001162615,"teacher_disagreement_score":0.036930367,"about_ca_system_score_codex":0.00006806146,"about_ca_system_score_gemma":0.00013345128,"threshold_uncertainty_score":0.52248895},"labels":[],"label_agreement":null},{"id":"W1985878353","doi":"10.1016/j.jctb.2013.09.002","title":"Generic global rigidity of body–bar frameworks","year":2013,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Structural Analysis and Optimization","field":"Engineering","cited_by":44,"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","funders":"Natural Sciences and Engineering Research Council of Canada; Banff International Research Station for Mathematical Innovation and Discovery; Hungarian Scientific Research Fund","keywords":"Rigidity (electromagnetism); Structural rigidity; Rigid body; Euclidean geometry; Mathematics; Combinatorics; Configuration space; Euclidean space; Pure mathematics; Geometry; Topology (electrical circuits); Physics; Classical mechanics","score_opus":0.0038179754242855333,"score_gpt":0.19472444323751162,"score_spread":0.1909064678132261,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1985878353","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9807467,0.0005173394,0.009481283,0.00007987886,0.0069993017,0.00007630117,0.000004809378,0.00003459537,0.002059822],"genre_scores_gemma":[0.99768883,0.00012390588,0.0015522067,0.00002182066,0.00057433866,0.0000010443756,0.00000129606,0.000010324337,0.000026223624],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990673,0.000064945656,0.00045850163,0.000054441756,0.00022442467,0.00013039749],"domain_scores_gemma":[0.99921894,0.000050022514,0.00022079927,0.00012910526,0.0003023591,0.00007880233],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020548904,0.000121136654,0.0003261659,0.000046465742,0.000037356072,0.000042124506,0.00019966635,0.00016196986,0.00064078934],"category_scores_gemma":[0.00009676422,0.00008317384,0.0001626336,0.00022597906,0.000058380443,0.00044483767,0.00002258725,0.00024112528,0.000006396912],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00052060676,0.00013173495,0.004272731,0.00014176674,0.0012027292,0.000019403793,0.0004315326,0.16868588,0.0076954225,0.7907296,0.011150144,0.015018463],"study_design_scores_gemma":[0.0008127346,0.00029048792,0.006253498,0.000050894632,0.00013756346,0.000052613035,0.00018037326,0.004001304,0.00820702,0.97652584,0.0032435996,0.00024404639],"about_ca_topic_score_codex":0.000004957073,"about_ca_topic_score_gemma":2.4763727e-7,"teacher_disagreement_score":0.18579628,"about_ca_system_score_codex":0.00006484203,"about_ca_system_score_gemma":0.000019887211,"threshold_uncertainty_score":0.7016194},"labels":[],"label_agreement":null},{"id":"W1986224428","doi":"10.1016/j.jctb.2008.06.008","title":"Matchings in regular graphs from eigenvalues","year":2008,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Graph theory and applications","field":"Mathematics","cited_by":112,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University; University of Toronto","funders":"American Institute of Mathematics","keywords":"Eigenvalues and eigenvectors; Combinatorics; Matching (statistics); Mathematics; Upper and lower bounds; Order (exchange); Graph; Discrete mathematics; Statistics; Mathematical analysis; Physics; Business","score_opus":0.025894199122439208,"score_gpt":0.27082854822885416,"score_spread":0.24493434910641496,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1986224428","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99616724,0.00024166077,0.00025177348,0.00019949742,0.0012917338,0.000115464325,0.0000068749696,0.000028019693,0.0016977184],"genre_scores_gemma":[0.9965851,0.00014285151,0.0026859567,0.00004387433,0.0002936903,0.0000057794987,0.000001563982,0.000024565188,0.00021661828],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983812,0.0003525503,0.0006576127,0.000119698365,0.0003066302,0.00018232242],"domain_scores_gemma":[0.9982625,0.00073795934,0.00047062192,0.00029448728,0.00014389657,0.00009051929],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012901532,0.0001591595,0.0004193983,0.0001747275,0.00016666083,0.00002239416,0.00039240622,0.000108094966,0.00015249099],"category_scores_gemma":[0.00041047527,0.00013590248,0.00020494203,0.00028263597,0.0002241877,0.00039730303,0.00004480543,0.00034810044,0.0000072301696],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005204166,0.00022660905,0.0005892123,0.0000085129595,0.000060369788,0.000058343205,0.0020744817,0.0000019934448,0.002195105,0.9933266,0.0008322029,0.00010617441],"study_design_scores_gemma":[0.0009852629,0.00014455247,0.0006666452,0.000061337916,0.00003591572,0.000114430106,0.0007064827,4.8800007e-7,0.009965921,0.9838684,0.0033121712,0.00013839788],"about_ca_topic_score_codex":0.0000064026276,"about_ca_topic_score_gemma":0.0000014361759,"teacher_disagreement_score":0.009458183,"about_ca_system_score_codex":0.00003394068,"about_ca_system_score_gemma":0.00006586299,"threshold_uncertainty_score":0.5541942},"labels":[],"label_agreement":null},{"id":"W1986323939","doi":"10.1016/j.jctb.2007.10.007","title":"Eigenvalue bounds for independent sets","year":2008,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":78,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Eigenvalues and eigenvectors; Mathematics; Independence (probability theory); Combinatorics; Maximal independent set; Independence number; Independent set; Set (abstract data type); Polarity (international relations); Discrete mathematics; Graph; Chordal graph; 1-planar graph; Computer science; Statistics; Physics","score_opus":0.03658537179050098,"score_gpt":0.30046302215396115,"score_spread":0.26387765036346017,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1986323939","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9785196,0.00037229722,0.0021882372,0.00011556276,0.0145146875,0.00029339135,0.000015317522,0.000037046535,0.00394384],"genre_scores_gemma":[0.99387014,0.00009159118,0.0038416742,0.00007749662,0.0013026001,0.0000064458345,0.0000010579689,0.000042453263,0.0007665527],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981282,0.00025419495,0.0007134214,0.00013043913,0.0004913034,0.00028244348],"domain_scores_gemma":[0.9975242,0.00095507904,0.00062977,0.00030020537,0.00045179718,0.00013895934],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019252094,0.00021257864,0.00051972194,0.00014515994,0.0005438301,0.000036003377,0.00047094587,0.00017547874,0.00013453768],"category_scores_gemma":[0.0010418936,0.00016057618,0.0003853558,0.00011838014,0.00027356873,0.0003617544,0.00009341096,0.00033496282,0.000001273557],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0018677795,0.00011685771,0.0001368147,0.000042271327,0.00019855073,0.000051058407,0.0021743607,0.0000028812706,0.00017480257,0.9907024,0.0040998883,0.00043233178],"study_design_scores_gemma":[0.0019676413,0.0008189958,0.00017617027,0.00003224389,0.00008338932,0.0008433358,0.00035893565,0.0000015484603,0.0033758401,0.9745775,0.01757862,0.00018578753],"about_ca_topic_score_codex":4.6296134e-7,"about_ca_topic_score_gemma":3.6546805e-7,"teacher_disagreement_score":0.016124912,"about_ca_system_score_codex":0.00006996373,"about_ca_system_score_gemma":0.00015833093,"threshold_uncertainty_score":0.65481067},"labels":[],"label_agreement":null},{"id":"W1986537785","doi":"10.1006/jctb.2000.1970","title":"Duality Theorems for Finite Structures (Characterising Gaps and Good Characterisations)","year":2000,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":121,"is_retracted":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":"Duality (order theory); Homomorphism; Mathematics; Pure mathematics; Order (exchange); Property (philosophy); Algebra over a field","score_opus":0.009783662731557273,"score_gpt":0.24553688113065542,"score_spread":0.23575321839909813,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1986537785","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8976755,0.000529296,0.09284859,0.0008661821,0.0066704894,0.00028252343,0.000018305514,0.000070540664,0.0010385506],"genre_scores_gemma":[0.9931034,0.0001631208,0.005454609,0.00021378492,0.0009012442,0.000003940236,0.000002395259,0.0000119283595,0.00014557056],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99868524,0.00023045245,0.00047784898,0.00017524806,0.00021317598,0.00021804211],"domain_scores_gemma":[0.9985201,0.00054077123,0.0004000482,0.00024936846,0.00018002932,0.00010972568],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009771413,0.00015979826,0.00032834258,0.00007795526,0.00025163367,0.00023250433,0.0004539204,0.00008050492,0.00007394526],"category_scores_gemma":[0.00021907884,0.0001296422,0.00011365069,0.0001387772,0.00012777859,0.001521496,0.0000586959,0.00020024624,0.0000018101165],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00047303594,0.000038461836,0.00006478113,0.000014676222,0.00003252685,0.000007776893,0.0008451231,0.000014170401,0.0008898285,0.94991595,0.000015121581,0.047688562],"study_design_scores_gemma":[0.000909583,0.00047399435,0.0035345973,0.000025866106,0.00001641209,0.00013810385,0.00007480578,0.000044852753,0.0017499574,0.97539854,0.017474882,0.00015841264],"about_ca_topic_score_codex":4.2253785e-7,"about_ca_topic_score_gemma":1.197485e-7,"teacher_disagreement_score":0.095427886,"about_ca_system_score_codex":0.000025591393,"about_ca_system_score_gemma":0.00006097835,"threshold_uncertainty_score":0.52866554},"labels":[],"label_agreement":null},{"id":"W1986861105","doi":"10.1016/s0095-8956(03)00031-5","title":"Bounded size components—partitions and transversals","year":2003,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":57,"is_retracted":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; Partition (number theory); Bounded function; Degree (music); Vertex (graph theory); Graph; Constant (computer programming); Component (thermodynamics); Frequency partition of a graph; Induced subgraph; Vertex connectivity; Discrete mathematics; Graph power; Line graph; Computer science; Physics","score_opus":0.016114984336661697,"score_gpt":0.265491512526323,"score_spread":0.24937652818966133,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1986861105","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7611409,0.0014693112,0.20577146,0.002213395,0.011433358,0.0004930801,0.000009232869,0.0001432733,0.017326035],"genre_scores_gemma":[0.99085605,0.00011271728,0.008609691,0.00007245644,0.00009655865,0.000002923742,1.8211759e-7,0.000012129269,0.00023731275],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99790597,0.0007762549,0.0004188777,0.0001632022,0.00044334965,0.00029232464],"domain_scores_gemma":[0.99800235,0.0009478798,0.0002300589,0.00031149242,0.00028841637,0.00021981534],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019981058,0.00014716979,0.00031230255,0.00013445604,0.00025974284,0.00018441225,0.00059475674,0.0000659263,0.00008336279],"category_scores_gemma":[0.0007947145,0.00012890121,0.00012119515,0.00036051974,0.00032904657,0.0014702906,0.00006524113,0.0003288245,0.0000052416563],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023303909,0.000099968966,0.0000509271,0.000007950046,0.000052266507,0.000041795924,0.0005309859,0.000009332456,0.004792153,0.99377745,0.00009834307,0.00030575547],"study_design_scores_gemma":[0.0014704556,0.00048362292,0.00014682364,0.000022697437,0.000012757749,0.00031048903,0.00019551573,0.0000061357036,0.009668742,0.968447,0.019103043,0.00013267604],"about_ca_topic_score_codex":4.9998704e-7,"about_ca_topic_score_gemma":2.996635e-7,"teacher_disagreement_score":0.22971517,"about_ca_system_score_codex":0.00004598536,"about_ca_system_score_gemma":0.00012174375,"threshold_uncertainty_score":0.5256439},"labels":[],"label_agreement":null},{"id":"W1988333015","doi":"10.1016/j.jctb.2010.07.003","title":"The lattice of integer flows of a regular matroid","year":2010,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Combinatorics; Mathematics; Matroid; Abelian group; Integer (computer science); Integer lattice; Lattice (music); Discrete mathematics; Half-integer; Physics; Computer science; Condensed matter physics","score_opus":0.009229537207443047,"score_gpt":0.26315463478057205,"score_spread":0.253925097573129,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1988333015","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9851402,0.00026135534,0.00025836565,0.0001601047,0.010478572,0.00012363499,0.0000058154133,0.000009823367,0.0035621277],"genre_scores_gemma":[0.99555326,0.000057223315,0.0034525255,0.000012902503,0.000624677,0.000001277223,1.6962464e-7,0.000025020654,0.0002729662],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99800503,0.00034266678,0.00092998793,0.000079521546,0.0004616832,0.00018113265],"domain_scores_gemma":[0.9956578,0.0019368106,0.0011745984,0.0005142032,0.0006450489,0.00007154894],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035363708,0.00015907575,0.00050556543,0.000093048766,0.00018151097,0.000025084672,0.0007166399,0.00014772305,0.0001209306],"category_scores_gemma":[0.0022128224,0.00009168349,0.0003265347,0.00015293661,0.0005522911,0.00021332805,0.00013587347,0.00060218596,4.796315e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015350055,0.00007898714,0.000046076035,0.0000632568,0.00019092808,0.000005487154,0.0012064584,9.798899e-7,0.012513068,0.9832009,0.00051287125,0.0006460009],"study_design_scores_gemma":[0.00074539904,0.00039737817,0.00006273038,0.000058191254,0.00011022357,0.00011455484,0.00076179113,0.000003090948,0.03256018,0.95617396,0.008922516,0.00009000029],"about_ca_topic_score_codex":9.160241e-7,"about_ca_topic_score_gemma":0.0000020274235,"teacher_disagreement_score":0.027026936,"about_ca_system_score_codex":0.000012118016,"about_ca_system_score_gemma":0.000076145094,"threshold_uncertainty_score":0.37387443},"labels":[],"label_agreement":null},{"id":"W1989224319","doi":"10.1016/j.jctb.2008.07.003","title":"Excluding a group-labelled graph","year":2008,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":16,"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":"Pacific Institute for the Mathematical Sciences","keywords":"Combinatorics; Mathematics; Graph; Abelian group; Robertson–Seymour theorem; Discrete mathematics; Line graph; 1-planar graph","score_opus":0.025041027880452885,"score_gpt":0.2730869488318363,"score_spread":0.24804592095138345,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1989224319","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4796389,0.0024384134,0.4878167,0.0010195599,0.018810835,0.00044587674,0.0000027159274,0.00026152696,0.009565475],"genre_scores_gemma":[0.98595214,0.00036651723,0.012586645,0.000083696956,0.0005641765,0.0000047174076,3.2136944e-7,0.000024335503,0.00041747146],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971985,0.0006584905,0.0006264832,0.00023231319,0.00083641725,0.00044777288],"domain_scores_gemma":[0.99754936,0.0006641623,0.00048549898,0.00054652814,0.0004997863,0.00025464865],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002482114,0.00021470591,0.0004624933,0.00043732798,0.0004576523,0.000093603,0.0018065668,0.00009577464,0.0000505603],"category_scores_gemma":[0.00059923076,0.00018017058,0.00027210696,0.0009777136,0.00039506634,0.0022297911,0.0003575532,0.00056886865,0.000014907676],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00070049043,0.00014362887,0.00015239046,0.000008232465,0.000073316725,0.0003757601,0.0008432489,0.000020744048,0.0029701425,0.9927277,0.00042203185,0.0015622941],"study_design_scores_gemma":[0.0018073603,0.001000739,0.00015576242,0.000035332858,0.000008588916,0.0012548389,0.00012149205,0.000021118678,0.005151478,0.9826306,0.007610557,0.00020211171],"about_ca_topic_score_codex":7.675692e-7,"about_ca_topic_score_gemma":1.9409958e-7,"teacher_disagreement_score":0.5063132,"about_ca_system_score_codex":0.00007472951,"about_ca_system_score_gemma":0.00015720884,"threshold_uncertainty_score":0.7347143},"labels":[],"label_agreement":null},{"id":"W1990357453","doi":"10.1006/jctb.2001.2068","title":"Totally Free Expansions of Matroids","year":2002,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":30,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Marsden Fund; National Security Agency","keywords":"Matroid; Combinatorics; Mathematics; Duality (order theory); Extension (predicate logic); Graphic matroid; Element (criminal law); Discrete mathematics; Rank (graph theory); Computer science","score_opus":0.015787991316954807,"score_gpt":0.2546160460856362,"score_spread":0.2388280547686814,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1990357453","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.51181436,0.0063011544,0.37233365,0.0056656515,0.031357754,0.00084302854,0.000032556156,0.00029757436,0.07135428],"genre_scores_gemma":[0.9855386,0.00015980675,0.0131230615,0.00004254677,0.00032391294,0.000002399221,1.4737871e-7,0.000018193765,0.0007913464],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99769956,0.00042870172,0.0006479934,0.00015697458,0.00076142943,0.00030531618],"domain_scores_gemma":[0.9973552,0.00055103103,0.0004973473,0.00083375664,0.00057946926,0.00018320118],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014805049,0.00015763537,0.00040576642,0.00028716752,0.00012541798,0.00006903655,0.002292825,0.00008244048,0.00023787322],"category_scores_gemma":[0.00088838924,0.00013116845,0.00023577856,0.00059032737,0.00028980407,0.0014608024,0.0004549225,0.00039047378,0.000011625997],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023597915,0.00017140417,0.000030391051,0.000011950801,0.00005073277,0.000055113363,0.0006738945,0.000038353184,0.0050987653,0.9895655,0.0011387999,0.0029291096],"study_design_scores_gemma":[0.0012630037,0.001166612,0.00006763657,0.00004545542,0.000010354566,0.00020349518,0.00017475165,0.00006520248,0.012625701,0.9798149,0.004432499,0.00013042717],"about_ca_topic_score_codex":6.429075e-7,"about_ca_topic_score_gemma":2.2516419e-7,"teacher_disagreement_score":0.47372422,"about_ca_system_score_codex":0.00004425641,"about_ca_system_score_gemma":0.00007249252,"threshold_uncertainty_score":0.5348894},"labels":[],"label_agreement":null},{"id":"W1991381366","doi":"10.1016/j.jctb.2003.11.004","title":"Colorings of the d-regular infinite tree","year":2004,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Tree (set theory); Mathematics; Combinatorics; Computer science","score_opus":0.014375893882085673,"score_gpt":0.2519831543722079,"score_spread":0.23760726049012224,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1991381366","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9838166,0.00015862472,0.00013311156,0.00028729907,0.0056419545,0.00013660421,0.000003934698,0.0000140114125,0.009807832],"genre_scores_gemma":[0.99838334,0.000028784423,0.000879991,0.000053982207,0.00037213942,0.0000013043865,1.0482161e-7,0.000022530867,0.000257843],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983116,0.0002444511,0.0006966615,0.000082781014,0.000483141,0.00018136174],"domain_scores_gemma":[0.997842,0.0004896639,0.0008998457,0.00039068342,0.00030870756,0.000069110414],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014338193,0.00016684805,0.00044443808,0.000095547104,0.00020020297,0.000023034687,0.0006754707,0.00012340603,0.00006294952],"category_scores_gemma":[0.0009903978,0.00009887428,0.0003645449,0.0002442244,0.00043999325,0.00025698164,0.00016955164,0.00036132446,5.41146e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00074449275,0.00009122641,0.00013328173,0.00003957959,0.0001386569,0.000008784181,0.001435221,0.000018534061,0.0011621374,0.99589664,0.000128409,0.00020305917],"study_design_scores_gemma":[0.0017063089,0.00044453822,0.00041590337,0.00012141643,0.00009940607,0.00011354005,0.00044594036,7.833178e-8,0.033208974,0.95804054,0.005297788,0.000105599116],"about_ca_topic_score_codex":0.0000011067033,"about_ca_topic_score_gemma":9.797818e-7,"teacher_disagreement_score":0.03785611,"about_ca_system_score_codex":0.000057099795,"about_ca_system_score_gemma":0.00012944847,"threshold_uncertainty_score":0.40319762},"labels":[],"label_agreement":null},{"id":"W1991963660","doi":"10.1016/s0095-8956(03)00039-x","title":"The linear delta-matroid parity problem","year":2003,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":34,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Agence Nationale pour la Gestion des Déchets Radioactifs","keywords":"Matroid; Matroid partitioning; Oriented matroid; Weighted matroid; Minimax; Combinatorics; Mathematics; Parity (physics); Discrete mathematics; Generalization; Graphic matroid; Mathematical optimization; Mathematical analysis; Physics","score_opus":0.01284547565339551,"score_gpt":0.27372730726499367,"score_spread":0.26088183161159817,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1991963660","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09546268,0.00851757,0.8094148,0.006150691,0.03852988,0.0015610904,0.000009449534,0.0003731625,0.0399807],"genre_scores_gemma":[0.9632435,0.00048617888,0.034438506,0.00010398423,0.00057319726,0.000013379311,3.6506387e-7,0.000037783284,0.0011031361],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9966437,0.0013294293,0.000619728,0.000188512,0.0007413039,0.0004773249],"domain_scores_gemma":[0.99676234,0.0011910744,0.00048276305,0.0006509203,0.00070621516,0.00020671893],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0064743785,0.00018623492,0.00030901885,0.00011045227,0.0006150652,0.0002635008,0.0018610796,0.000084762025,0.000022602067],"category_scores_gemma":[0.0014682951,0.00011940165,0.00021217763,0.000567268,0.0003611526,0.0013088887,0.00020971538,0.00067820743,0.000014465234],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034667258,0.000075072305,0.00005743113,0.000007925916,0.000054982724,0.000033563458,0.00021758737,0.000055549808,0.0003332031,0.9960042,0.00040027397,0.0024135304],"study_design_scores_gemma":[0.0007163182,0.00055629027,0.00002179686,0.00001806398,0.000007830531,0.00023529542,0.00013665267,0.000024206278,0.0075820372,0.8916751,0.09890081,0.00012557974],"about_ca_topic_score_codex":6.808057e-7,"about_ca_topic_score_gemma":7.345874e-7,"teacher_disagreement_score":0.8677808,"about_ca_system_score_codex":0.0000760988,"about_ca_system_score_gemma":0.00032095556,"threshold_uncertainty_score":0.48690578},"labels":[],"label_agreement":null},{"id":"W1992428436","doi":"10.1016/j.jctb.2013.07.001","title":"Characterizing graphic matroids by a system of linear equations","year":2013,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Matroid; Graphic matroid; Rank (graph theory); Construct (python library); System of linear equations; Binary number; Linear equation; Mathematics; Oriented matroid; Combinatorics; Matroid partitioning; Discrete mathematics; Computer science; Mathematical analysis; Arithmetic; Programming language","score_opus":0.011407239103333898,"score_gpt":0.25369649348407347,"score_spread":0.24228925438073956,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1992428436","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4194393,0.0009374006,0.56663173,0.0012013284,0.008539173,0.0006657499,0.000016487149,0.00015448563,0.0024143287],"genre_scores_gemma":[0.99533105,0.000034776192,0.0042084465,0.000026732803,0.00023552994,0.000011082843,0.0000010370374,0.000017737786,0.00013363374],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99755687,0.0005617512,0.00077479455,0.00016169604,0.0006346642,0.0003102572],"domain_scores_gemma":[0.99711025,0.00060232164,0.00077606644,0.00047806493,0.00085431803,0.00017898642],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018662357,0.00016681726,0.00043866187,0.00033779538,0.0001745343,0.00011794779,0.0013357152,0.0000863282,0.000038400925],"category_scores_gemma":[0.0003788644,0.00013944897,0.00020531828,0.0006843767,0.00020978149,0.0022305944,0.00020707822,0.0003654188,0.000017554277],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012937581,0.000079086596,0.00004605323,0.00004627444,0.000063522086,0.000007644744,0.00042772485,0.000009491584,0.049002487,0.94909024,0.00013347763,0.0009645932],"study_design_scores_gemma":[0.0012927254,0.0011760906,0.0001079928,0.00019626973,0.000021569136,0.0001400891,0.0010265561,0.00058800046,0.044726525,0.94871426,0.001768417,0.00024150539],"about_ca_topic_score_codex":0.0000033363765,"about_ca_topic_score_gemma":7.34372e-8,"teacher_disagreement_score":0.57589173,"about_ca_system_score_codex":0.000063076695,"about_ca_system_score_gemma":0.000120420074,"threshold_uncertainty_score":0.5686564},"labels":[],"label_agreement":null},{"id":"W1992684615","doi":"10.1016/j.jctb.2007.09.004","title":"Oriented star packings","year":2007,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University; Thompson Rivers University","funders":"","keywords":"Digraph; Combinatorics; Disjoint sets; Mathematics; Star (game theory); Vertex (graph theory); Packing problems; Hypergraph; Stars; Discrete mathematics; Graph; Physics; Astrophysics","score_opus":0.010867677503855932,"score_gpt":0.27922039294997053,"score_spread":0.2683527154461146,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1992684615","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26693043,0.0005110886,0.71025985,0.0005998861,0.014352148,0.00021718805,0.0000019545143,0.00012601052,0.0070014414],"genre_scores_gemma":[0.9811851,0.00004430426,0.01742962,0.00012039708,0.0007176166,9.999736e-7,3.8016137e-7,0.000022405375,0.00047917306],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997532,0.0003077433,0.0006364376,0.00018876759,0.0008464031,0.0004886496],"domain_scores_gemma":[0.99720913,0.0007264396,0.0004886916,0.000489022,0.0008107376,0.000276001],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0062031355,0.00017462822,0.0003307778,0.00036458895,0.00018478087,0.00011126724,0.0013940693,0.00009103048,0.000052915973],"category_scores_gemma":[0.0008657706,0.00014469252,0.0001768026,0.00085246406,0.0002433241,0.0018533405,0.000275687,0.0005295919,0.000013673916],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011271293,0.00009518311,0.00013003577,0.00000667315,0.0000470392,0.00021468247,0.00062212883,0.0000043918726,0.002669885,0.9894654,0.00020601554,0.0054114177],"study_design_scores_gemma":[0.0010962723,0.0009161559,0.0002654035,0.00002942568,0.000006981813,0.00022522162,0.0003092136,0.000007368675,0.02404247,0.9254724,0.04747333,0.00015577878],"about_ca_topic_score_codex":7.12196e-7,"about_ca_topic_score_gemma":4.5892787e-7,"teacher_disagreement_score":0.7142547,"about_ca_system_score_codex":0.00011147879,"about_ca_system_score_gemma":0.0001574733,"threshold_uncertainty_score":0.59003896},"labels":[],"label_agreement":null},{"id":"W1992739211","doi":"10.1016/j.jctb.2003.05.001","title":"Arrangements, circular arrangements and the crossing number of C7×C","year":2003,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":33,"is_retracted":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 Prince Edward Island","funders":"","keywords":"Conjecture; Crossing number (knot theory); Cartesian product; Combinatorics; Mathematics; Generalization; Level crossing; Planar; Product (mathematics); Geometry; Mathematical analysis; Computer science; Intersection (aeronautics); Engineering","score_opus":0.008694649643631898,"score_gpt":0.24731996633464864,"score_spread":0.23862531669101675,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1992739211","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6284646,0.0015868318,0.35271022,0.0005526204,0.009895429,0.00024877666,0.0000015332905,0.000016985749,0.0065230466],"genre_scores_gemma":[0.99482584,0.00003686445,0.0047021224,0.000119798606,0.00019046389,0.0000016649045,2.9258996e-7,0.000004952925,0.000117988035],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985684,0.00043367376,0.0004051967,0.00009755573,0.00038074647,0.00011442167],"domain_scores_gemma":[0.9988244,0.00023359068,0.00041602552,0.00017215635,0.00030366622,0.000050150724],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022725272,0.00009446279,0.00022109,0.00006292478,0.00021856422,0.0002016662,0.00030627192,0.000034046592,0.000035817484],"category_scores_gemma":[0.00029182376,0.000066152556,0.000092700204,0.00026246448,0.00021428437,0.0006476469,0.000056044126,0.000116153824,0.0000017307547],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019290054,0.000055381584,0.00030159138,0.000013211169,0.00007974564,0.0000044502103,0.0008911433,0.0001150176,0.00058833807,0.995483,0.00012841,0.002146808],"study_design_scores_gemma":[0.003280492,0.00010943646,0.00040845352,0.000031167452,0.000032278673,0.00014004823,0.00014947046,0.00009053555,0.005628148,0.96501184,0.025025588,0.00009256293],"about_ca_topic_score_codex":8.825205e-7,"about_ca_topic_score_gemma":7.834128e-8,"teacher_disagreement_score":0.3663613,"about_ca_system_score_codex":0.000020105643,"about_ca_system_score_gemma":0.00010586756,"threshold_uncertainty_score":0.2697623},"labels":[],"label_agreement":null},{"id":"W1993582455","doi":"10.1016/j.jctb.2005.06.008","title":"A counterexample to a conjecture of Björner and Lovász on the <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.gif\" overflow=\"scroll\"><mml:mi>χ</mml:mi></mml:math>-coloring complex","year":2005,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Counterexample; Conjecture; Combinatorics; Vertex (graph theory); Graph; Mathematics; Discrete mathematics; Computer science","score_opus":0.019918449676751014,"score_gpt":0.24133005701670038,"score_spread":0.22141160733994936,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1993582455","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9931925,0.00017649653,0.0023983957,0.0017371076,0.0011756986,0.00004214532,0.000025063639,0.00002780947,0.0012247915],"genre_scores_gemma":[0.9968902,0.000081095706,0.001378552,0.0009788655,0.0005810346,0.000010070804,0.0000040306836,0.00001845337,0.000057681948],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979381,0.00018162384,0.0005848054,0.0002827985,0.000667626,0.00034504017],"domain_scores_gemma":[0.99759847,0.0009332513,0.00060154864,0.00054549595,0.00013270443,0.00018851164],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015022078,0.0002079024,0.0003145683,0.00017835104,0.00029706277,0.00030351875,0.0010566696,0.00017294743,0.00015332234],"category_scores_gemma":[0.0006985157,0.00016157862,0.0002783859,0.0005898714,0.00026754627,0.0005898543,0.00054732716,0.00039848508,0.00006203319],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000541032,0.000121717574,0.000010337247,0.000021887021,0.00020813,0.000052895935,0.00075575954,0.0003263863,0.00049425464,0.99447256,0.0012507535,0.0017442855],"study_design_scores_gemma":[0.007047386,0.014871071,0.0018875836,0.00078686746,0.00090679957,0.0018059084,0.0036528509,0.16716531,0.043334194,0.45888168,0.29788026,0.0017800726],"about_ca_topic_score_codex":0.00004376816,"about_ca_topic_score_gemma":0.000014779867,"teacher_disagreement_score":0.5355909,"about_ca_system_score_codex":0.00001934493,"about_ca_system_score_gemma":0.00011886272,"threshold_uncertainty_score":0.6588985},"labels":[],"label_agreement":null},{"id":"W1995705554","doi":"10.1006/jctb.2001.2065","title":"On Essential and Inessential Polygons in Embedded Graphs","year":2002,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Rollins College","keywords":"Contractible space; Combinatorics; Embedding; Pairwise comparison; Mathematics; Disjoint sets; Polygon (computer graphics); Bounded function; Simple (philosophy); Graph; Discrete mathematics; Computer science; Artificial intelligence","score_opus":0.0069220900155023725,"score_gpt":0.22165195834114562,"score_spread":0.21472986832564325,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1995705554","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9541173,0.0004723979,0.033279195,0.0009916608,0.009490652,0.00010358666,0.000001163447,0.000024595338,0.001519425],"genre_scores_gemma":[0.9983625,0.000056988585,0.0010208924,0.00008560828,0.000345814,0.000001187897,4.7774677e-7,0.0000049309365,0.00012163088],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99887854,0.00019961548,0.00035185766,0.0001296536,0.00030432735,0.00013602928],"domain_scores_gemma":[0.999223,0.0002305173,0.00020406893,0.00013199962,0.00013246301,0.00007793523],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00055395195,0.00010656885,0.00019192605,0.00034232638,0.00008761221,0.0001275637,0.0002823681,0.00005504555,0.00005926113],"category_scores_gemma":[0.00017646248,0.00009534636,0.00006569939,0.0004589628,0.000057977206,0.0007627479,0.00006796704,0.00018696391,0.0000037560687],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001789725,0.00016065768,0.000028688872,0.000004614543,0.0000176368,0.000039926406,0.0005392078,0.00040157238,0.000979755,0.99335253,0.00051236677,0.0037840821],"study_design_scores_gemma":[0.0016487278,0.0005687267,0.00051126996,0.000029501973,0.000008657291,0.00016105785,0.00004664101,0.0014815726,0.004029496,0.99038976,0.0009913427,0.00013327082],"about_ca_topic_score_codex":8.54593e-7,"about_ca_topic_score_gemma":7.439204e-7,"teacher_disagreement_score":0.044245146,"about_ca_system_score_codex":0.000020595577,"about_ca_system_score_gemma":0.00003506724,"threshold_uncertainty_score":0.38881117},"labels":[],"label_agreement":null},{"id":"W1996619442","doi":"10.1016/j.jctb.2006.02.003","title":"Tree amalgamation of graphs and tessellations of the Cantor sphere","year":2006,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Geometric and Algebraic Topology","field":"Mathematics","cited_by":17,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Mathematics; Combinatorics; Planar graph; Vertex (graph theory); Discrete mathematics; Graph","score_opus":0.009300546492239237,"score_gpt":0.2349204830309812,"score_spread":0.22561993653874196,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1996619442","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9935018,0.00026681914,0.00022605697,0.00018789533,0.0012713169,0.00008304492,0.0000053054,0.0000048432885,0.0044529266],"genre_scores_gemma":[0.9987777,0.000017196853,0.0005647816,0.0000044693675,0.00011645316,5.218511e-7,2.52136e-7,0.0000074486925,0.00051119004],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989593,0.00015763688,0.0005399273,0.00004622153,0.0002119632,0.000084937674],"domain_scores_gemma":[0.9980774,0.0006381969,0.00086358894,0.00013518019,0.00026104314,0.000024572673],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00058200787,0.000079006946,0.00029383498,0.00010244557,0.000058017416,0.000007852469,0.00015447775,0.00007059861,0.00010868897],"category_scores_gemma":[0.000569887,0.000051365943,0.000108332206,0.00032253395,0.00023154423,0.00011896194,0.0000326569,0.00011292565,1.6700133e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000110465066,0.00009128748,0.00314914,0.000049121714,0.000041282532,7.9187197e-7,0.00021681143,0.0000032458054,0.0013577206,0.9939074,0.0007355689,0.00033718333],"study_design_scores_gemma":[0.00070566474,0.0002048971,0.007328812,0.000037660433,0.00006977993,0.00003309588,0.0005353682,0.0000016555327,0.0096122725,0.9808705,0.00055394927,0.000046366946],"about_ca_topic_score_codex":0.000013890487,"about_ca_topic_score_gemma":0.000012423361,"teacher_disagreement_score":0.013036904,"about_ca_system_score_codex":0.0000108191625,"about_ca_system_score_gemma":0.000068519475,"threshold_uncertainty_score":0.20946424},"labels":[],"label_agreement":null},{"id":"W1998475227","doi":"10.1016/j.jctb.2005.06.002","title":"Multiplicative graphs and semi-lattice endomorphisms in the category of graphs","year":2005,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":37,"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":"Multiplicative function; Endomorphism; Mathematics; Combinatorics; Lattice (music); Pathwidth; Discrete mathematics; Graph; Physics; Line graph","score_opus":0.011375846142226588,"score_gpt":0.23998390167450545,"score_spread":0.22860805553227886,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1998475227","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9757854,0.0037013968,0.011195622,0.0048345057,0.0015172686,0.00026477766,0.0000143977995,0.00002931625,0.0026573497],"genre_scores_gemma":[0.997688,0.00034794025,0.0016821884,0.00017162443,0.00006658694,0.0000027392073,6.538096e-7,0.000003146823,0.000037124548],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982725,0.00048103768,0.0005431038,0.00015354184,0.00037379307,0.00017602932],"domain_scores_gemma":[0.997702,0.001189095,0.00050802145,0.00033567185,0.00019167658,0.00007353294],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022491352,0.00012760602,0.00037246064,0.0003619105,0.000082916646,0.0000634643,0.001144955,0.00006772086,0.000022726017],"category_scores_gemma":[0.0004899664,0.00007515763,0.00014195948,0.0013086278,0.00031588186,0.0007992075,0.00016220997,0.0002952866,0.0000017035403],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014050218,0.00018462562,0.0005772419,0.000004591866,0.0000555356,0.000017583765,0.0012060495,0.000013949486,0.00022535234,0.9908577,0.00016154627,0.0065552806],"study_design_scores_gemma":[0.0010625145,0.00048372275,0.0044254307,0.000012100459,0.00004086734,0.00011171681,0.00066910055,0.00005519566,0.0014948339,0.9866896,0.004850145,0.00010473912],"about_ca_topic_score_codex":0.000015357384,"about_ca_topic_score_gemma":0.0000036733431,"teacher_disagreement_score":0.02190263,"about_ca_system_score_codex":0.000016752962,"about_ca_system_score_gemma":0.000036498343,"threshold_uncertainty_score":0.30648392},"labels":[],"label_agreement":null},{"id":"W2002026379","doi":"10.1006/jctb.2002.2112","title":"The Quadrangulation Conjecture for Orientable Surfaces","year":2002,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Bijection, injection and surjection; Bijection; Combinatorics; Mathematics; Conjecture; Bipartite graph; Planar; Integer (computer science); Genus; Graph","score_opus":0.016320060838556773,"score_gpt":0.26806094596182506,"score_spread":0.2517408851232683,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2002026379","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17375782,0.011761268,0.7501391,0.010699966,0.04496342,0.0017235941,0.00001601597,0.00022348897,0.006715314],"genre_scores_gemma":[0.9931084,0.00018015859,0.0044511594,0.000047549067,0.00055041193,0.0000093989465,3.9986085e-7,0.000016583808,0.0016359537],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983482,0.00035739705,0.0003991732,0.00013496954,0.00045235563,0.00030791096],"domain_scores_gemma":[0.997012,0.0016579422,0.00037520996,0.0003710126,0.00048791114,0.000095916876],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023439399,0.00012699861,0.00021983747,0.00008432369,0.0005544265,0.0002707956,0.001126013,0.00006581424,0.000029477316],"category_scores_gemma":[0.0007250164,0.000080939426,0.00015203412,0.00036254327,0.00019755673,0.0012419522,0.00009686128,0.00024277915,0.0000049317086],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00037738367,0.000039631468,0.000026116062,0.000006112676,0.00004088167,0.000004967357,0.0005193719,0.00016647167,0.00059682695,0.99131036,0.0011311695,0.0057807188],"study_design_scores_gemma":[0.0009604991,0.00064530264,0.000035864403,0.0000120475415,0.000007715546,0.00005557567,0.00017611889,0.0006054607,0.0034847904,0.9097025,0.08421938,0.00009477056],"about_ca_topic_score_codex":4.5272304e-7,"about_ca_topic_score_gemma":7.00274e-7,"teacher_disagreement_score":0.81935054,"about_ca_system_score_codex":0.000054102326,"about_ca_system_score_gemma":0.000048312904,"threshold_uncertainty_score":0.42642567},"labels":[],"label_agreement":null},{"id":"W2002473456","doi":"10.1016/j.jctb.2015.04.006","title":"Sparse halves in dense triangle-free graphs","year":2015,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Combinatorics; Mathematics; Conjecture; Degree (music); Trapezoid graph; Graph; Chordal graph; Split graph; Discrete mathematics; Indifference graph; 1-planar graph","score_opus":0.043663304583729926,"score_gpt":0.28988127677971504,"score_spread":0.24621797219598512,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2002473456","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9778131,0.0007947187,0.00010852298,0.0002514831,0.012037359,0.00018222298,0.000006259415,0.000032968208,0.0087733455],"genre_scores_gemma":[0.99654454,0.000060849976,0.0021576737,0.00006695383,0.00076106953,0.0000030033618,4.7383426e-7,0.00003816487,0.00036727203],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972849,0.00077414024,0.000927759,0.00013926449,0.00057218235,0.00030176606],"domain_scores_gemma":[0.99723214,0.00096854474,0.00065440714,0.0005312448,0.000378657,0.00023500601],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0045125033,0.00023924881,0.0007063133,0.00036574743,0.000102379665,0.00005995923,0.0007796726,0.0001807326,0.00007937612],"category_scores_gemma":[0.0050653443,0.00017954515,0.0003024188,0.00033887054,0.0002651464,0.0005155388,0.00019851103,0.0004954709,0.0000020709288],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0034571216,0.00016584588,0.00046486943,0.000023462337,0.000101248756,0.00018348,0.0031000313,0.0000047151098,0.000054163207,0.9867836,0.0052334294,0.00042802168],"study_design_scores_gemma":[0.005326309,0.00068163505,0.00013249474,0.00008208188,0.00006864205,0.0002849766,0.0017294409,0.000001036391,0.001012729,0.98530585,0.0051726326,0.0002021551],"about_ca_topic_score_codex":0.0000025377956,"about_ca_topic_score_gemma":0.0000049226583,"teacher_disagreement_score":0.018731419,"about_ca_system_score_codex":0.000084462394,"about_ca_system_score_gemma":0.00016564887,"threshold_uncertainty_score":0.7321639},"labels":[],"label_agreement":null},{"id":"W2002893084","doi":"10.1016/j.jctb.2003.08.004","title":"Bounded degree acyclic decompositions of digraphs","year":2003,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"graph theory and CDMA systems","field":"Engineering","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","funders":"","keywords":"Digraph; Partition (number theory); Combinatorics; Directed acyclic graph; Mathematics; Degree (music); Bounded function; Integer (computer science); Vertex (graph theory); Decomposition; Directed graph; Discrete mathematics; Graph; Chemistry; Computer science; Physics","score_opus":0.009481242828341514,"score_gpt":0.20708025769932967,"score_spread":0.19759901487098816,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2002893084","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9567669,0.0010931458,0.0015238399,0.000014605635,0.009941388,0.00011145362,0.000007001949,0.00005434499,0.03048733],"genre_scores_gemma":[0.9993917,0.000081227096,0.0002667129,0.000007000127,0.00016181185,0.000002774733,7.698187e-7,0.000025367928,0.00006266037],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99857855,0.0003020168,0.0006323055,0.00006577166,0.0002270693,0.00019426549],"domain_scores_gemma":[0.9990549,0.0002194033,0.00023915872,0.00021512645,0.0001608353,0.00011058097],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009627664,0.00016196206,0.0004045725,0.00019600935,0.00009109095,0.000035709625,0.00024819028,0.00010087053,0.00011487321],"category_scores_gemma":[0.00012249965,0.00014496814,0.00026238483,0.0002933051,0.0001352999,0.00038406477,0.0000103818,0.0002409659,0.0000042926263],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018744188,0.00007753454,0.00016755649,0.000047207555,0.00021079456,0.000013417875,0.00047173267,0.00017282438,0.010580648,0.9876216,0.00025304034,0.0001962227],"study_design_scores_gemma":[0.0010655066,0.00032438917,0.00022781367,0.00009056829,0.0000684183,0.0002455413,0.000658778,0.0000032645426,0.05521779,0.92996794,0.011964232,0.00016577718],"about_ca_topic_score_codex":5.594454e-7,"about_ca_topic_score_gemma":7.559202e-7,"teacher_disagreement_score":0.05765366,"about_ca_system_score_codex":0.000032803233,"about_ca_system_score_gemma":0.000039588787,"threshold_uncertainty_score":0.5911629},"labels":[],"label_agreement":null},{"id":"W2003376141","doi":"10.1016/j.jctb.2008.01.007","title":"A new characterization of graphic matroids","year":2008,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Digital Image Processing Techniques","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Fields Institute for Research in Mathematical Sciences","funders":"","keywords":"Matroid; Characterization (materials science); Graphic matroid; Computer science; Binary number; Combinatorics; Mathematics; Arithmetic; Physics","score_opus":0.009260047484923319,"score_gpt":0.22148776045745042,"score_spread":0.2122277129725271,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2003376141","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2047607,0.00018035075,0.7868379,0.00042160417,0.0037681013,0.00010307487,0.0000016909933,0.0001506971,0.0037759151],"genre_scores_gemma":[0.97209775,0.00008458432,0.02722057,0.000042772757,0.00023799772,7.3686004e-7,4.898422e-7,0.000010978223,0.00030412563],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988432,0.000087864,0.0004820723,0.00009628303,0.00036289336,0.00012767375],"domain_scores_gemma":[0.9985344,0.00006446752,0.00065563427,0.00024801458,0.00040687702,0.000090630354],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048539747,0.000110745255,0.00027596898,0.00021217689,0.00006080108,0.00009434373,0.0008625199,0.000055861376,0.000010621731],"category_scores_gemma":[0.0001938655,0.00009615827,0.00011712949,0.0004350566,0.00011434222,0.0029454816,0.00009824306,0.00013991541,0.0000015242404],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021349717,0.00010018114,0.00018910007,0.000019270556,0.000030588904,0.00004574695,0.00064115337,4.014562e-7,0.07129585,0.9182438,0.00044599033,0.008774377],"study_design_scores_gemma":[0.00038049687,0.00082412804,0.0005636515,0.00009009508,0.000008563912,0.00051087566,0.000010700573,0.000007975325,0.17723954,0.8175728,0.0026764418,0.00011477358],"about_ca_topic_score_codex":7.2905635e-7,"about_ca_topic_score_gemma":2.4038767e-8,"teacher_disagreement_score":0.767337,"about_ca_system_score_codex":0.000020907064,"about_ca_system_score_gemma":0.00026523563,"threshold_uncertainty_score":0.39212206},"labels":[],"label_agreement":null},{"id":"W2005661925","doi":"10.1016/j.jctb.2015.02.004","title":"Projective geometries in exponentially dense matroids. II","year":2015,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","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":"Matroid; Rank (graph theory); Combinatorics; Graphic matroid; Mathematics; Integer (computer science); Constant (computer programming); Prime (order theory); Prime power; Projective plane; Matroid partitioning; Discrete mathematics; Computer science; Geometry","score_opus":0.023206630527263093,"score_gpt":0.28658820357473674,"score_spread":0.26338157304747367,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2005661925","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9005606,0.0015013148,0.079974495,0.0010393109,0.011918102,0.00050796225,0.0000035240796,0.000101067875,0.0043936265],"genre_scores_gemma":[0.992786,0.000049467246,0.00627153,0.000041589785,0.0003825853,0.000008039197,3.6670002e-7,0.000020042922,0.00044039602],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970539,0.00069164747,0.0006496622,0.0002333736,0.00093799963,0.00043342193],"domain_scores_gemma":[0.9974757,0.00041997113,0.0004444829,0.0004471115,0.00094911753,0.00026362768],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0049606794,0.00020233872,0.00045763704,0.00087824697,0.00014503166,0.0001685704,0.0015059971,0.000101703765,0.000015360609],"category_scores_gemma":[0.0020577384,0.00017234343,0.00014304643,0.0014772092,0.00027552972,0.0027007735,0.00062545977,0.0005604194,0.000009398853],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0024861917,0.00023083077,0.00031195633,0.00000829287,0.000048945978,0.0002512101,0.0035739923,0.00008811571,0.0009546063,0.9895503,0.0003426304,0.0021529242],"study_design_scores_gemma":[0.0023910198,0.002167312,0.00019712413,0.0000413419,0.000006810186,0.00028149073,0.0010472353,0.00001915636,0.009776328,0.9786096,0.0052738893,0.00018868879],"about_ca_topic_score_codex":0.000004147175,"about_ca_topic_score_gemma":0.0000024001695,"teacher_disagreement_score":0.09222538,"about_ca_system_score_codex":0.00023301829,"about_ca_system_score_gemma":0.0006354765,"threshold_uncertainty_score":0.7027961},"labels":[],"label_agreement":null},{"id":"W2006587062","doi":"10.1006/jctb.2001.2082","title":"Branch-Width and Well-Quasi-Ordering in Matroids and Graphs","year":2002,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":103,"is_retracted":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; Bounded function; Combinatorics; Mathematics; Class (philosophy); Graphic matroid; Discrete mathematics; Tree (set theory); Computer science; Mathematical analysis","score_opus":0.010457935432773438,"score_gpt":0.24424879096954472,"score_spread":0.23379085553677129,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2006587062","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97141457,0.0042404546,0.017985892,0.00092086266,0.0024795916,0.00018683671,8.315542e-7,0.000045210665,0.00272576],"genre_scores_gemma":[0.99589956,0.0010352276,0.0027643207,0.00005088571,0.00010975813,0.0000022647257,6.137327e-8,0.000014075865,0.0001238281],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99835163,0.00035243906,0.00042253901,0.00020346703,0.00035307702,0.00031684295],"domain_scores_gemma":[0.9988352,0.00040713802,0.0002055991,0.00026549448,0.00011784299,0.0001687206],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015247323,0.0001649019,0.00034397191,0.0003787833,0.00012811454,0.0001728576,0.0005553133,0.00007348746,0.000040242536],"category_scores_gemma":[0.00021528994,0.00014581694,0.00006415741,0.0004951573,0.00027852965,0.0015396145,0.00025566356,0.0004297831,0.0000029111561],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022636796,0.00008805263,0.0010020342,0.000023712122,0.00002232026,0.000079753074,0.000993591,0.0000120066325,0.0011804147,0.981176,0.00004578575,0.015149967],"study_design_scores_gemma":[0.0015276904,0.00072440546,0.0008081101,0.000057767855,0.00000474967,0.0003637275,0.00013105561,0.00017718402,0.0014499421,0.9927877,0.0018106815,0.00015694277],"about_ca_topic_score_codex":0.0000012839866,"about_ca_topic_score_gemma":0.0000011019581,"teacher_disagreement_score":0.024485018,"about_ca_system_score_codex":0.000029586958,"about_ca_system_score_gemma":0.000020904321,"threshold_uncertainty_score":0.5946242},"labels":[],"label_agreement":null},{"id":"W2006973630","doi":"10.1016/j.jctb.2009.11.002","title":"Corrigendum to “Asymptotically optimal frugal colouring” [J. Combin. Theory Ser. B 100 (2) (2010) 226–246]","year":2009,"lang":"en","type":"erratum","venue":"Journal of Combinatorial Theory Series B","topic":"African history and culture studies","field":"Social Sciences","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; University of Toronto","funders":"","keywords":"Asymptotically optimal algorithm; Mathematics; Combinatorics; Computer science; Algorithm","score_opus":0.016226271762665674,"score_gpt":0.2670991222806906,"score_spread":0.25087285051802494,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2006973630","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011316873,0.0044835596,0.00035664765,0.003779559,0.46118358,0.0009171184,0.00007474819,0.0002045057,0.5278686],"genre_scores_gemma":[0.053959038,0.0017394745,0.00063014164,0.001324573,0.035720382,0.0000325725,0.000028418652,0.00018897053,0.9063764],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99166834,0.0028222024,0.0015393281,0.0006010968,0.0021468056,0.0012222342],"domain_scores_gemma":[0.994552,0.0005254002,0.0017723356,0.0005959085,0.0015856605,0.0009686696],"candidate_categories":["metaepi_narrow","sts","research_integrity","insufficient_payload"],"consensus_categories":["research_integrity"],"category_scores_codex":[0.0065215854,0.0008877486,0.0020245202,0.00041198713,0.0022754471,0.0003554048,0.0022199631,0.0013385018,0.0016620154],"category_scores_gemma":[0.003174921,0.0007825056,0.0008916517,0.00073283806,0.00170702,0.00078349264,0.0003046592,0.003081494,0.00012610604],"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.0020317787,0.00025371736,0.000007051581,0.00002485404,0.0003167527,0.00016999626,0.013098901,0.0000056913236,0.000010737842,0.48613623,0.49758762,0.00035667024],"study_design_scores_gemma":[0.0007915857,0.0025135067,0.00006863505,0.0002647157,0.0003150917,0.000043793578,0.010014589,1.2565644e-7,0.000021412061,0.26172194,0.7235774,0.0006672097],"about_ca_topic_score_codex":0.000032364307,"about_ca_topic_score_gemma":0.000078076184,"teacher_disagreement_score":0.4254632,"about_ca_system_score_codex":0.0011039965,"about_ca_system_score_gemma":0.0028205267,"threshold_uncertainty_score":0.999958},"labels":[],"label_agreement":null},{"id":"W2008376525","doi":"10.1016/j.jctb.2005.06.012","title":"Spectral estimates for Abelian Cayley graphs","year":2005,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Random Matrices and Applications","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":"Queen's University; University of British Columbia","funders":"","keywords":"Cayley graph; Abelian group; Mathematics; Combinatorics; Graph","score_opus":0.0184068595003851,"score_gpt":0.3013967546848512,"score_spread":0.2829898951844661,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2008376525","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9556229,0.0016103406,0.017799918,0.0052741584,0.006732769,0.0012784153,0.000048772505,0.00016142336,0.0114712985],"genre_scores_gemma":[0.9536365,0.000084907835,0.04368866,0.00005320216,0.0018604703,0.000021822032,0.0000017110121,0.00003806006,0.00061466306],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989318,0.00004548161,0.00053617096,0.000088272274,0.00019768318,0.00020058872],"domain_scores_gemma":[0.99817014,0.0008446457,0.00046940285,0.00018035303,0.0002363131,0.00009912593],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009461805,0.00013747787,0.0003562878,0.00009767907,0.00015388397,0.00006861401,0.0002792245,0.00006889634,0.000104079714],"category_scores_gemma":[0.0004448882,0.000106827945,0.0002508208,0.00014390892,0.00007231387,0.0003302003,0.000019147552,0.00014991456,0.0000054683237],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00069674925,0.0001636984,0.00003569672,0.00003086215,0.00008638234,0.0000017934475,0.00026648154,0.000012891882,0.0006250691,0.9917358,0.0054111364,0.0009334153],"study_design_scores_gemma":[0.0022407596,0.00030291843,0.000030455925,0.000026062344,0.00012754626,0.000063388696,0.00017112776,0.000018393894,0.0074828602,0.9490811,0.04033789,0.0001174561],"about_ca_topic_score_codex":9.055376e-7,"about_ca_topic_score_gemma":0.0000015050307,"teacher_disagreement_score":0.042654682,"about_ca_system_score_codex":0.00003911559,"about_ca_system_score_gemma":0.000057851885,"threshold_uncertainty_score":0.43563172},"labels":[],"label_agreement":null},{"id":"W2008773627","doi":"10.1016/j.jctb.2005.11.001","title":"Obstructions to branch-decomposition of matroids","year":2005,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":49,"is_retracted":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; Combinatorics; Mathematics; Net (polyhedron); Characterization (materials science); Class (philosophy); Minor (academic); Set (abstract data type); Pairwise comparison; Discrete mathematics; Computer science; Physics; Geometry","score_opus":0.009228262069560421,"score_gpt":0.29100298755742676,"score_spread":0.28177472548786636,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2008773627","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49803165,0.00034194157,0.48825663,0.0027542661,0.0071308715,0.00025847403,0.000006576146,0.000068110916,0.0031514994],"genre_scores_gemma":[0.9624008,0.000022743397,0.03674028,0.000063822874,0.00058475364,0.000002640881,3.013395e-7,0.000011966189,0.00017269123],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99827325,0.00028657686,0.00056105066,0.000138096,0.0005056676,0.0002353815],"domain_scores_gemma":[0.9982752,0.00026467638,0.0003428778,0.00039312473,0.00054355385,0.00018055511],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011825889,0.00012423965,0.00031365268,0.00034688073,0.00012241777,0.000066713714,0.0010143105,0.000057850895,0.000056877987],"category_scores_gemma":[0.00021605272,0.0001122054,0.00016452833,0.0006021439,0.0001294615,0.0015410559,0.00017838892,0.00026353332,0.000015392914],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005066501,0.000097692006,0.000036207417,0.000008024336,0.000036171576,0.0000055019386,0.00049268745,0.00056172005,0.021170035,0.96339816,0.00023214844,0.01345502],"study_design_scores_gemma":[0.00071909593,0.00082259224,0.00026993442,0.000036853275,0.00000881602,0.00019974101,0.000082918385,0.000024532306,0.06904114,0.91857046,0.010110961,0.00011296518],"about_ca_topic_score_codex":5.66136e-7,"about_ca_topic_score_gemma":4.808794e-7,"teacher_disagreement_score":0.46436915,"about_ca_system_score_codex":0.00008789916,"about_ca_system_score_gemma":0.00009958025,"threshold_uncertainty_score":0.45756036},"labels":[],"label_agreement":null},{"id":"W2008912653","doi":"10.1016/j.jctb.2014.11.008","title":"A density Hales–Jewett theorem for matroids","year":2014,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Office of Naval Research","keywords":"Matroid; Mathematics; Mathematical economics; Combinatorics","score_opus":0.01541190292802947,"score_gpt":0.2713370931026248,"score_spread":0.25592519017459536,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2008912653","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.928704,0.00016771958,0.044223666,0.00039256678,0.017359277,0.00043242302,0.000012803633,0.000081127015,0.008626387],"genre_scores_gemma":[0.9892562,0.00001674948,0.007808104,0.00013833,0.0022647285,0.000005011527,8.836381e-7,0.000048405127,0.00046157255],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979182,0.0005199306,0.00070736284,0.0001532105,0.00039010638,0.0003111784],"domain_scores_gemma":[0.9960474,0.002164698,0.0007072477,0.00040789106,0.00052793376,0.00014483574],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0043046135,0.00024734394,0.00064422004,0.0001317636,0.00036558637,0.000069230126,0.0005454177,0.0001826732,0.00008235625],"category_scores_gemma":[0.0025898688,0.00017903117,0.00045326067,0.000113262875,0.00029057893,0.0003028175,0.00011297312,0.0003406333,0.0000016700972],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00228648,0.00008293964,0.0000922179,0.00008078485,0.00015271732,0.0000060318207,0.0007695482,0.0000014564811,0.00039097332,0.9921594,0.0022775333,0.001699902],"study_design_scores_gemma":[0.0018266775,0.0008515768,0.00006876508,0.000056858556,0.00014508003,0.00018624762,0.0002917618,0.000006591144,0.007227098,0.97080255,0.018328972,0.00020779918],"about_ca_topic_score_codex":3.389908e-7,"about_ca_topic_score_gemma":5.2651177e-7,"teacher_disagreement_score":0.060552187,"about_ca_system_score_codex":0.000048599613,"about_ca_system_score_gemma":0.00005809004,"threshold_uncertainty_score":0.7300679},"labels":[],"label_agreement":null},{"id":"W2010114044","doi":"10.1016/j.jctb.2010.04.002","title":"Confinement of matroid representations to subsets of partial fields","year":2010,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Topics in Algebra","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 Waterloo","funders":"","keywords":"Matroid; Mathematics; Lift (data mining); Combinatorics; Finite field; Representation theorem; Algebraic number; Corollary; Field (mathematics); Characterization (materials science); Discrete mathematics; Matrix (chemical analysis); Homomorphism; Pure mathematics; Mathematical analysis","score_opus":0.02097539794582488,"score_gpt":0.3308868804174328,"score_spread":0.30991148247160794,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2010114044","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.981407,0.000019236679,0.008246806,0.00045803224,0.0065264604,0.00018655455,0.000009359318,0.000009954344,0.0031366302],"genre_scores_gemma":[0.981647,0.00000764452,0.017535066,0.000022227412,0.00051069295,0.0000035006342,5.56262e-7,0.000014311266,0.0002589791],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984719,0.00010394228,0.0008495286,0.00008030788,0.00036400717,0.00013029117],"domain_scores_gemma":[0.9976607,0.00066357106,0.000759989,0.00034503354,0.0004811958,0.00008948924],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008703449,0.00010466768,0.00038863654,0.00009985017,0.000040108134,0.000010632814,0.00031232738,0.00008884893,0.00052676734],"category_scores_gemma":[0.002131286,0.000091527836,0.00013732092,0.00012782426,0.0001333874,0.00015645853,0.00007758967,0.0003033535,0.0000018104867],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005492562,0.00017403263,0.00014546514,0.000042345826,0.00007094303,0.000006391818,0.0008802929,0.000008636584,0.019772924,0.9771829,0.00084631395,0.00032048105],"study_design_scores_gemma":[0.0007115783,0.00039019925,0.000091962895,0.000031368243,0.000042683092,0.000022447628,0.00035178036,8.419345e-7,0.18720587,0.80818045,0.0029052843,0.00006554357],"about_ca_topic_score_codex":0.0000020489424,"about_ca_topic_score_gemma":0.0000042217375,"teacher_disagreement_score":0.16900247,"about_ca_system_score_codex":0.000013515421,"about_ca_system_score_gemma":0.00008802397,"threshold_uncertainty_score":0.5767733},"labels":[],"label_agreement":null},{"id":"W2013664277","doi":"10.1006/jctb.2002.2128","title":"Packing Odd Circuits in Eulerian Graphs","year":2002,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":31,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Minor (academic); Eulerian path; Combinatorics; Mathematics; Enhanced Data Rates for GSM Evolution; Graph; Integer (computer science); Discrete mathematics; Computer science; Mathematical analysis; Telecommunications","score_opus":0.02289851368456595,"score_gpt":0.26171793746704963,"score_spread":0.2388194237824837,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2013664277","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7974227,0.006670744,0.09816537,0.003878197,0.039479535,0.0010127057,0.0000073660285,0.00034940618,0.053014],"genre_scores_gemma":[0.99807745,0.00019980082,0.0011341622,0.00007690596,0.0002664438,0.0000033726808,1.456515e-7,0.000019635652,0.00022205283],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972318,0.0007155958,0.0006601654,0.00023198636,0.0006764435,0.00048402548],"domain_scores_gemma":[0.99808913,0.0004892643,0.00040349402,0.00051003427,0.00030597806,0.00020209035],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025359632,0.0001986301,0.00041845776,0.00060434133,0.00014535179,0.00019421591,0.0016542075,0.000103838145,0.00015225179],"category_scores_gemma":[0.0006300155,0.00017848393,0.00018408787,0.0012059674,0.00020659069,0.002270086,0.00022105535,0.0006380079,0.000019788054],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010046649,0.00013993967,0.00038025543,0.000009775771,0.000028589528,0.00024799386,0.001148948,0.00003562798,0.0011722539,0.98121756,0.00016140884,0.015357168],"study_design_scores_gemma":[0.0013855529,0.000533755,0.00040704876,0.000072741,0.0000043787145,0.0002342017,0.00017117128,0.00008009055,0.002528288,0.98954827,0.004839308,0.00019522333],"about_ca_topic_score_codex":9.4501786e-7,"about_ca_topic_score_gemma":0.0000010823219,"teacher_disagreement_score":0.2006548,"about_ca_system_score_codex":0.00009852037,"about_ca_system_score_gemma":0.00005991348,"threshold_uncertainty_score":0.7278363},"labels":[],"label_agreement":null},{"id":"W2014824669","doi":"10.1016/j.jctb.2012.10.002","title":"Cops and robbers in a random graph","year":2012,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":67,"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":"Hungarian Scientific Research Fund; Nemzeti Kutatási és Technológiai Hivatal; Pacific Institute for the Mathematical Sciences","keywords":"Combinatorics; Vertex (graph theory); Mathematics; Graph; Random graph; Random regular graph; Discrete mathematics; Pathwidth; Line graph","score_opus":0.010801777342243853,"score_gpt":0.2653487859544998,"score_spread":0.25454700861225593,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2014824669","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8713535,0.0069855466,0.10033463,0.0010600947,0.014015038,0.00047284111,0.0000016747204,0.0000722429,0.005704438],"genre_scores_gemma":[0.99629974,0.00019237061,0.0031085622,0.000050862272,0.00025905363,0.0000032881449,1.1137855e-7,0.000010351685,0.00007562724],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99805397,0.0006443473,0.00041087746,0.000115766234,0.0003853995,0.00038963687],"domain_scores_gemma":[0.99843824,0.0006900598,0.00023968922,0.00025306188,0.00015007328,0.00022889205],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0041059237,0.00013541126,0.00034248523,0.00035186578,0.000088739514,0.00008570558,0.00064229546,0.00006828496,0.000018176339],"category_scores_gemma":[0.00048696468,0.00011031311,0.00009400569,0.00054429827,0.00022381172,0.0023986802,0.000196354,0.00039629568,0.0000027526937],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012484174,0.000094985684,0.0019627286,0.0000075263583,0.000027528384,0.000026988411,0.0012880937,0.000013681446,0.0004891995,0.99229884,0.00007291816,0.002469115],"study_design_scores_gemma":[0.0035976204,0.00033991702,0.0009861059,0.00003572448,0.000006391486,0.00024235484,0.0002723699,0.000009488355,0.0018835904,0.98865974,0.003833854,0.00013285327],"about_ca_topic_score_codex":0.0000012227913,"about_ca_topic_score_gemma":6.0453254e-7,"teacher_disagreement_score":0.124946274,"about_ca_system_score_codex":0.00004586287,"about_ca_system_score_gemma":0.00008381788,"threshold_uncertainty_score":0.4498438},"labels":[],"label_agreement":null},{"id":"W2014924232","doi":"10.1016/j.jctb.2014.06.004","title":"Colouring graphs when the number of colours is almost the maximum degree","year":2014,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":45,"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":"Mathematics; Combinatorics; Degree (music); Chromatic scale; Constant (computer programming); Discrete mathematics","score_opus":0.018647920120497957,"score_gpt":0.27657573051166157,"score_spread":0.25792781039116364,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2014924232","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8387158,0.00092033244,0.09333359,0.01825756,0.01897313,0.0010318762,0.000012648655,0.00011801009,0.028637063],"genre_scores_gemma":[0.9964766,0.0000696171,0.0023907714,0.00035436626,0.00032638313,0.0000074266313,1.6898679e-7,0.000023553474,0.00035110154],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9962865,0.0014291137,0.00067741453,0.00020369522,0.0009737093,0.0004295524],"domain_scores_gemma":[0.99512357,0.0022236898,0.0008275607,0.000963311,0.0007225845,0.00013931708],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0061865444,0.00022106164,0.00043609255,0.00011991885,0.0004659511,0.00017906551,0.003559301,0.00010007022,0.00011168463],"category_scores_gemma":[0.0008278637,0.00012276895,0.00030992535,0.0006054139,0.0008595876,0.0008867002,0.0005586373,0.0007018466,0.000013761851],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00057434733,0.000073184085,0.0008369131,0.000011933623,0.00011283695,0.000010508828,0.002106849,0.000020966245,0.00032908184,0.9895631,0.001244803,0.0051154643],"study_design_scores_gemma":[0.0008949708,0.00047809363,0.0005890559,0.000044578035,0.000026625017,0.00024027897,0.0005933679,0.00004663517,0.0064378236,0.9721114,0.018398419,0.00013873512],"about_ca_topic_score_codex":0.0000050775934,"about_ca_topic_score_gemma":0.0000018177678,"teacher_disagreement_score":0.15776081,"about_ca_system_score_codex":0.000048501683,"about_ca_system_score_gemma":0.0001622457,"threshold_uncertainty_score":0.6614126},"labels":[],"label_agreement":null},{"id":"W2016808872","doi":"10.1016/j.jctb.2006.07.006","title":"Extreme eigenvalues of nonregular graphs","year":2006,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Graph theory and applications","field":"Mathematics","cited_by":49,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Combinatorics; Eigenvalues and eigenvectors; Mathematics; Adjacency matrix; Upper and lower bounds; Graph; Discrete mathematics; Physics; Mathematical analysis","score_opus":0.02581874398230166,"score_gpt":0.2677072303653798,"score_spread":0.24188848638307814,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2016808872","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98817736,0.0004224435,0.0013787905,0.00012912083,0.0015334975,0.00015750309,0.000009626728,0.000029024863,0.00816262],"genre_scores_gemma":[0.9964369,0.000028947525,0.0026445438,0.000009429322,0.0003775514,0.000003863167,0.0000013231952,0.000022699163,0.00047476328],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99833906,0.0002859559,0.00077779056,0.00009258593,0.00033779416,0.00016684277],"domain_scores_gemma":[0.9978877,0.00054788135,0.00082163356,0.00030740188,0.00037493257,0.000060464998],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001714573,0.00015235816,0.00042545737,0.00015930629,0.000110309156,0.00002246607,0.00035845497,0.00009426469,0.00016404538],"category_scores_gemma":[0.00026170563,0.00012559806,0.0003066245,0.00027610958,0.0002720589,0.00026639822,0.000036477326,0.0001810612,0.0000025867141],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00040634835,0.00034935688,0.00012617015,0.00003568661,0.0000771264,0.000006880567,0.00017402893,0.000004572728,0.011799576,0.9854619,0.0013571593,0.0002012074],"study_design_scores_gemma":[0.00072371785,0.00025236726,0.00020998403,0.00005095701,0.00010265635,0.000055489876,0.00027433314,6.022778e-7,0.045093417,0.94795716,0.005164393,0.000114914714],"about_ca_topic_score_codex":0.0000021460748,"about_ca_topic_score_gemma":7.293088e-7,"teacher_disagreement_score":0.037504718,"about_ca_system_score_codex":0.000018208315,"about_ca_system_score_gemma":0.00005545769,"threshold_uncertainty_score":0.512174},"labels":[],"label_agreement":null},{"id":"W2016843307","doi":"10.1016/j.jctb.2008.07.007","title":"Weighted enumeration of spanning subgraphs with degree constraints","year":2008,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":21,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Enumeration; Degree (music); Combinatorics; Computer science; Mathematics; Physics","score_opus":0.0532364939173922,"score_gpt":0.2951162094085187,"score_spread":0.24187971549112647,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2016843307","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96834993,0.00018546375,0.020042935,0.00006307112,0.0019665034,0.00015316813,0.000004389315,0.000019087536,0.00921542],"genre_scores_gemma":[0.96929765,0.00006795855,0.030052034,0.000014868076,0.00031681024,0.0000017146288,8.131565e-7,0.000022602439,0.00022557647],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99827147,0.00042639952,0.00063685805,0.000093353134,0.0004074179,0.00016448554],"domain_scores_gemma":[0.9975197,0.00066406705,0.0008690959,0.00019874326,0.0006514432,0.00009698429],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017265205,0.00016161153,0.0005235708,0.0001528021,0.00011462343,0.000014764056,0.0001837395,0.000097686,0.000062449064],"category_scores_gemma":[0.00063416583,0.00011674405,0.000157812,0.00019878088,0.00040754626,0.0002903768,0.00002479512,0.00025364142,3.4139735e-8],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002275429,0.00018030543,0.0009330715,0.00006606991,0.0002253362,0.00013727217,0.0022359171,0.0000019896142,0.0037223934,0.98723406,0.00045555938,0.0025325834],"study_design_scores_gemma":[0.004965361,0.0026144825,0.00030337414,0.0003808678,0.0002174122,0.0017886602,0.001973761,0.000011140872,0.074789226,0.90958464,0.0030172847,0.00035377327],"about_ca_topic_score_codex":0.000001503045,"about_ca_topic_score_gemma":0.0000011312151,"teacher_disagreement_score":0.077649415,"about_ca_system_score_codex":0.000030589097,"about_ca_system_score_gemma":0.0001782213,"threshold_uncertainty_score":0.47606844},"labels":[],"label_agreement":null},{"id":"W2022616211","doi":"10.1016/j.jctb.2005.03.002","title":"Deeply asymmetric planar graphs","year":2005,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Planar graph; Outerplanar graph; Combinatorics; Mathematics; Graph; Book embedding; Planar; Planar straight-line graph; Automorphism; Simple (philosophy); Graph automorphism; Discrete mathematics; 1-planar graph; Line graph; Computer science; Pathwidth; Voltage graph; Computer graphics (images)","score_opus":0.011642004230155597,"score_gpt":0.26561462763841154,"score_spread":0.25397262340825594,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2022616211","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1959842,0.009713136,0.6834527,0.009794286,0.037062626,0.001011322,0.000014528224,0.0005993067,0.062367857],"genre_scores_gemma":[0.9735113,0.00019967067,0.024675732,0.00024166577,0.000876704,0.0000034405716,4.4276834e-7,0.000025196592,0.00046584065],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973161,0.0005375687,0.00062591577,0.0002182706,0.00085535174,0.00044677293],"domain_scores_gemma":[0.99746644,0.0007143269,0.0004699192,0.00055932725,0.00051090174,0.00027905343],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002855431,0.00020604093,0.00039638704,0.0008005359,0.00020598623,0.00018402639,0.0020616536,0.00010014596,0.000044459182],"category_scores_gemma":[0.00069531886,0.00017193596,0.00024908362,0.0015071451,0.00020421002,0.0025274365,0.00018266788,0.0005733563,0.000039546452],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00046555392,0.00012676667,0.00009660517,0.0000058288533,0.00006406777,0.00006745831,0.00026595758,0.0000458383,0.00039216742,0.9682299,0.00083690754,0.02940297],"study_design_scores_gemma":[0.0011718558,0.000831084,0.00016257298,0.000020064434,0.000010851971,0.00032492614,0.00008256127,0.00003293393,0.006730068,0.94011617,0.050332487,0.00018440766],"about_ca_topic_score_codex":6.031047e-7,"about_ca_topic_score_gemma":5.048406e-7,"teacher_disagreement_score":0.7775271,"about_ca_system_score_codex":0.000104513805,"about_ca_system_score_gemma":0.00017186506,"threshold_uncertainty_score":0.70113444},"labels":[],"label_agreement":null},{"id":"W2022783208","doi":"10.1016/j.jctb.2007.12.006","title":"Bisimplicial vertices in even-hole-free graphs","year":2008,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":65,"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; Wheel graph; Induced subgraph; Vertex (graph theory); Graph; Neighbourhood (mathematics); Discrete mathematics; Graph power; Line graph","score_opus":0.0179379954215226,"score_gpt":0.2737250461514349,"score_spread":0.2557870507299123,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2022783208","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9750513,0.00073283963,0.0132975,0.00086106505,0.0061223754,0.00022537686,0.0000035676867,0.000072271,0.003633708],"genre_scores_gemma":[0.996571,0.000181308,0.0026910694,0.00008202601,0.0003366406,0.000004626619,2.7062302e-7,0.00001852515,0.00011453955],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971169,0.0006457716,0.00070440554,0.00023539305,0.0008296281,0.00046789186],"domain_scores_gemma":[0.9976741,0.0006268017,0.00038616135,0.0007376909,0.0003725052,0.00020273731],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020551216,0.00020617984,0.00045381577,0.0005924156,0.00021933918,0.00008184419,0.0027828664,0.00010995323,0.000028356211],"category_scores_gemma":[0.0010216956,0.00017866831,0.00020486416,0.0011725307,0.0003770657,0.00225314,0.00048103943,0.000617568,0.000009222567],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011152914,0.00018112262,0.001204409,0.0000078616495,0.000033930755,0.00040488676,0.0008707316,0.000066977416,0.001142116,0.9928593,0.0002957203,0.0018176625],"study_design_scores_gemma":[0.0022339148,0.0008545583,0.0016714402,0.00003804818,0.0000051649167,0.000352829,0.00018760301,0.00002366443,0.004511273,0.9866561,0.0032732214,0.00019213988],"about_ca_topic_score_codex":0.000003135151,"about_ca_topic_score_gemma":0.0000037890188,"teacher_disagreement_score":0.021519698,"about_ca_system_score_codex":0.000087648565,"about_ca_system_score_gemma":0.00027345176,"threshold_uncertainty_score":0.7285882},"labels":[],"label_agreement":null},{"id":"W2024021998","doi":"10.1016/j.jctb.2005.03.005","title":"Covering arrays on graphs","year":2005,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":50,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; University of Ottawa","funders":"University of Alberta","keywords":"Combinatorics; Clique number; Mathematics; Clique; Homomorphism; Graph; Discrete mathematics; Row; Extension (predicate logic); Computer science","score_opus":0.005227173648065162,"score_gpt":0.1918191603417305,"score_spread":0.18659198669366533,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2024021998","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.93836707,0.00073379505,0.00092446466,0.00009440756,0.017689038,0.000113166054,0.000004618231,0.00015228301,0.04192116],"genre_scores_gemma":[0.9983809,0.00008337586,0.000097737575,0.000039657727,0.0012044159,0.0000021502556,4.347652e-7,0.000032822583,0.00015850997],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99886066,0.00012656981,0.00045935134,0.00007300874,0.00026561692,0.00021479507],"domain_scores_gemma":[0.9993256,0.0001467144,0.00014460976,0.00018782995,0.00007995499,0.000115292176],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000893791,0.00017796707,0.0003184603,0.00016781353,0.00008118482,0.00005233987,0.00026674473,0.00009312072,0.00012549292],"category_scores_gemma":[0.00006442182,0.00015449815,0.00019777342,0.00017125082,0.000059842765,0.00047100039,0.0000131876,0.000337965,0.00003073497],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005456658,0.000051419836,0.00003361748,0.000026964322,0.00012813653,0.00002113569,0.000491994,0.008096062,0.004504906,0.98283863,0.0012753371,0.0019861073],"study_design_scores_gemma":[0.0014740198,0.00065444846,0.000077094686,0.00015353633,0.0000388557,0.00019622431,0.00045833847,0.000056073062,0.042983044,0.81171775,0.14188588,0.00030472144],"about_ca_topic_score_codex":1.8637472e-7,"about_ca_topic_score_gemma":2.7774703e-7,"teacher_disagreement_score":0.1711209,"about_ca_system_score_codex":0.00006166517,"about_ca_system_score_gemma":0.000016977447,"threshold_uncertainty_score":0.63002515},"labels":[],"label_agreement":null},{"id":"W2024330321","doi":"10.1016/j.jctb.2004.06.001","title":"A lower bound on the spectral radius of the universal cover of a graph","year":2005,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Graph theory and applications","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":"Canada Research Chairs; University of Toronto","funders":"","keywords":"Mathematics; Combinatorics; Bipartite graph; Upper and lower bounds; Spectral radius; Graph; Degree (music); Discrete mathematics; Eigenvalues and eigenvectors; Mathematical analysis; Physics; Quantum mechanics","score_opus":0.01405184898505722,"score_gpt":0.24715537593247017,"score_spread":0.23310352694741296,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2024330321","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98897743,0.000054311113,0.00009953355,0.0012689105,0.0012897903,0.00018979111,0.000011712228,0.0000068821187,0.008101637],"genre_scores_gemma":[0.99898887,0.000020163381,0.00013895736,0.000062260115,0.0002908515,0.000001679857,1.2712229e-7,0.000013785165,0.00048328898],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99860626,0.00035549028,0.0004843819,0.00007000889,0.00034739767,0.00013646815],"domain_scores_gemma":[0.9975052,0.0010915239,0.00077048456,0.00039777523,0.00019155913,0.00004346361],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001307671,0.00012756756,0.00029645025,0.0000721392,0.00014525611,0.000017378676,0.0005722527,0.0000672266,0.0002842048],"category_scores_gemma":[0.00036943937,0.000069636226,0.00036516596,0.0002913086,0.0005252659,0.00016461665,0.000046406352,0.0003150927,0.000002719194],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012290088,0.00037816504,0.000026967291,0.000012295519,0.0001376134,0.0000016464969,0.0008234981,0.000022932176,0.0022574351,0.9931049,0.0019498196,0.000055741857],"study_design_scores_gemma":[0.0008131483,0.00039378006,0.00010696175,0.000068120455,0.00010078099,0.000029111037,0.00052792364,0.0000014001575,0.03166702,0.9570611,0.009161448,0.00006922066],"about_ca_topic_score_codex":8.784949e-7,"about_ca_topic_score_gemma":9.790239e-7,"teacher_disagreement_score":0.036043793,"about_ca_system_score_codex":0.000035615947,"about_ca_system_score_gemma":0.0000982275,"threshold_uncertainty_score":0.31118435},"labels":[],"label_agreement":null},{"id":"W2024728183","doi":"10.1016/j.jctb.2006.07.001","title":"Homomorphisms and edge-colourings of planar graphs","year":2006,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":28,"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":"Combinatorics; Conjecture; Homomorphism; Mathematics; Planar graph; Graph; Discrete mathematics; Odd graph; 1-planar graph; Chordal graph","score_opus":0.007651886994791469,"score_gpt":0.23357519337335866,"score_spread":0.2259233063785672,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2024728183","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9456118,0.001967827,0.039969765,0.00062821014,0.005164285,0.000276253,0.000007782833,0.00006498007,0.0063091135],"genre_scores_gemma":[0.9929002,0.00007864297,0.0065519945,0.000024050567,0.00020440965,0.000001988431,3.8337578e-7,0.000013730874,0.00022459622],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99820644,0.00029699272,0.00055250025,0.00016426393,0.0005090677,0.000270723],"domain_scores_gemma":[0.9981771,0.00045754836,0.0005278912,0.00032798768,0.0003909354,0.0001185097],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016939807,0.00015613662,0.00040164578,0.00033701674,0.00012573593,0.00007652568,0.0009086102,0.00008126896,0.000013872507],"category_scores_gemma":[0.000171807,0.00013201156,0.00013249433,0.00045978313,0.00046201184,0.0010388534,0.00016058034,0.0003085286,0.0000014848811],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00050517725,0.00010349476,0.0003893164,0.0000193095,0.000035782603,0.00006883244,0.0001701304,0.0000136397475,0.0035131918,0.99389005,0.00027531083,0.0010157423],"study_design_scores_gemma":[0.001130461,0.0008670669,0.001005502,0.00003901058,0.000011676656,0.00026283096,0.00007069398,0.0000069469856,0.017489929,0.97632074,0.0026681153,0.00012702927],"about_ca_topic_score_codex":0.0000036483766,"about_ca_topic_score_gemma":5.366128e-7,"teacher_disagreement_score":0.04728842,"about_ca_system_score_codex":0.000029017314,"about_ca_system_score_gemma":0.00009354154,"threshold_uncertainty_score":0.53832746},"labels":[],"label_agreement":null},{"id":"W2029141310","doi":"10.1006/jctb.2001.2074","title":"Colouring Eulerian Triangulations","year":2002,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":34,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Eulerian path; Triangulation; Representativeness heuristic; Mathematics; Combinatorics; Computer science; Geometry; Mathematical analysis; Lagrangian; Statistics","score_opus":0.015674503192297753,"score_gpt":0.22511098912072197,"score_spread":0.20943648592842423,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2029141310","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17233531,0.0015596407,0.7671582,0.005146538,0.033489555,0.00029570228,0.000003152717,0.00014532066,0.019866547],"genre_scores_gemma":[0.98489755,0.000032620635,0.012846761,0.00009163698,0.0010812829,0.0000015700584,5.629998e-7,0.0000061228557,0.0010418805],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988825,0.00019395705,0.000391709,0.000096150834,0.0003066207,0.00012908354],"domain_scores_gemma":[0.99892205,0.00021705168,0.00030606575,0.00016964466,0.00029251515,0.0000926947],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007835409,0.00008918828,0.00017350182,0.00018529067,0.00017201922,0.0001575227,0.00042997012,0.000047140475,0.0001834273],"category_scores_gemma":[0.00026529338,0.00008124035,0.000106673484,0.00042460306,0.000033135893,0.0011483853,0.00006225433,0.00013591407,0.000016670892],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005285937,0.000083820916,0.000015159129,0.0000028916336,0.000029917623,0.000017463937,0.000465169,0.0008657879,0.00058345974,0.98497456,0.0015336868,0.011375211],"study_design_scores_gemma":[0.0016765159,0.000623178,0.0005134613,0.000023784136,0.000019431942,0.00028461165,0.00006638154,0.0034769827,0.0041643893,0.9104718,0.078494534,0.00018495234],"about_ca_topic_score_codex":2.5493352e-7,"about_ca_topic_score_gemma":1.5319286e-7,"teacher_disagreement_score":0.8125622,"about_ca_system_score_codex":0.000043189393,"about_ca_system_score_gemma":0.00004779998,"threshold_uncertainty_score":0.33128855},"labels":[],"label_agreement":null},{"id":"W2029943728","doi":"10.1016/j.jctb.2012.07.004","title":"A generalization of Littleʼs Theorem on Pfaffian orientations","year":2012,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","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":"Combinatorics; Mathematics; Bipartite graph; Pfaffian; Disjoint sets; Matching (statistics); Discrete mathematics; Cograph; Graph; Chordal graph; 1-planar graph","score_opus":0.01697318881866508,"score_gpt":0.2949306128611698,"score_spread":0.2779574240425047,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2029943728","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44751278,0.0008582273,0.51978534,0.00075356977,0.018483743,0.00042956948,0.000011032635,0.00009066896,0.012075094],"genre_scores_gemma":[0.99313325,0.000049727365,0.0059701786,0.000058602407,0.0005802835,0.0000033920887,0.0000011677682,0.00001532691,0.0001880494],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99777585,0.0006770303,0.0005192025,0.00011420494,0.000610743,0.00030295944],"domain_scores_gemma":[0.9978287,0.0004955771,0.0005371066,0.0004178445,0.0005352763,0.00018548779],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023180656,0.00014009538,0.00027930748,0.00031321635,0.00013564882,0.00005386145,0.000835636,0.00006945502,0.000060119986],"category_scores_gemma":[0.0006227396,0.0001130216,0.00014892376,0.0006890876,0.00020399617,0.0017226886,0.00012337671,0.0002412868,0.000008466305],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00044719066,0.00023296189,0.00032521176,0.000009586824,0.000043857235,0.000003897801,0.0017087001,0.00014490118,0.0020794082,0.9925693,0.00014280617,0.0022921553],"study_design_scores_gemma":[0.0007779843,0.00083379756,0.00035816416,0.000038213504,0.000012778479,0.000051557767,0.00027450852,0.000027411612,0.035838857,0.9577775,0.0038895272,0.00011967271],"about_ca_topic_score_codex":6.161531e-7,"about_ca_topic_score_gemma":1.4632101e-7,"teacher_disagreement_score":0.5456205,"about_ca_system_score_codex":0.000065853936,"about_ca_system_score_gemma":0.00011078161,"threshold_uncertainty_score":0.46088868},"labels":[],"label_agreement":null},{"id":"W2031490867","doi":"10.1006/jctb.2000.1967","title":"On the Excluded Minors for Quaternary Matroids","year":2000,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Marsden Fund; National Security Agency","keywords":"Matroid; Disjoint sets; Combinatorics; Minor (academic); Rank (graph theory); Hyperplane; Mathematics; Characterization (materials science); Graphic matroid; Discrete mathematics; Physics; Law; Political science","score_opus":0.01675583223072613,"score_gpt":0.27798542796126846,"score_spread":0.26122959573054233,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2031490867","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.893822,0.00044513418,0.07684356,0.007007274,0.009879013,0.00088616385,0.000010169479,0.00011743727,0.010989265],"genre_scores_gemma":[0.99213016,0.000070575545,0.0032877557,0.00039494273,0.000708461,0.000021492539,4.6249428e-7,0.000028108276,0.003358017],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979088,0.00054474437,0.0004499204,0.00018018132,0.0005619306,0.00035447587],"domain_scores_gemma":[0.9969809,0.001816025,0.0002500941,0.00056953414,0.0002555638,0.0001278487],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002629562,0.0001778769,0.00028663562,0.00013248734,0.00029077494,0.00017220691,0.0019996567,0.00006831734,0.0003021988],"category_scores_gemma":[0.00040338183,0.00011168582,0.0002565666,0.00031064285,0.000219493,0.0008257967,0.000095265495,0.00036096742,0.00003113082],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0025049532,0.00009603048,0.000008966127,0.0000065823338,0.000052423486,0.00002534559,0.00035790593,0.00007372174,0.00043605067,0.98562723,0.0018460788,0.008964721],"study_design_scores_gemma":[0.0010514926,0.0016760359,0.000027719547,0.000032315056,0.000008137664,0.00009926717,0.00008729479,0.00010224395,0.006742592,0.96968466,0.020360028,0.00012822481],"about_ca_topic_score_codex":5.983505e-7,"about_ca_topic_score_gemma":1.3918084e-7,"teacher_disagreement_score":0.0983082,"about_ca_system_score_codex":0.00005750793,"about_ca_system_score_gemma":0.00009911985,"threshold_uncertainty_score":0.45544153},"labels":[],"label_agreement":null},{"id":"W2033177498","doi":"10.1016/j.jctb.2004.11.001","title":"Planar graphs without cycles of length from 4 to 7 are 3-colorable","year":2004,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":144,"is_retracted":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":"Planar graph; Combinatorics; Mathematics; Conjecture; Graph coloring; Graph; Plane (geometry); Discrete mathematics; Geometry","score_opus":0.014152304707623579,"score_gpt":0.2708427278237021,"score_spread":0.25669042311607854,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2033177498","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9013063,0.0005247546,0.09067319,0.0011076159,0.004841419,0.00028825653,0.0000216237,0.000065401175,0.0011714417],"genre_scores_gemma":[0.9813344,0.000052788873,0.018211087,0.00009468329,0.00021692594,0.0000041279,6.1528584e-7,0.000020806545,0.00006459902],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99761975,0.00035668467,0.00064121524,0.0002444159,0.0007761444,0.00036180133],"domain_scores_gemma":[0.9975355,0.00041404055,0.00064678886,0.00058830396,0.00053659885,0.0002787453],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001432451,0.00020919717,0.0006003382,0.00038223137,0.0001492356,0.00009607755,0.0018033405,0.000099666446,0.000026596266],"category_scores_gemma":[0.00052014407,0.00017671309,0.00019712189,0.00071767473,0.00023143073,0.0013073765,0.00021333311,0.000405081,0.000011267248],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001209463,0.00018504848,0.0008772646,0.000011518268,0.00010917873,0.00007540925,0.0010403353,0.0006473445,0.005218719,0.98977804,0.00013132075,0.00071638025],"study_design_scores_gemma":[0.001671496,0.0011072129,0.0012561984,0.00014354159,0.000014515801,0.00004080278,0.00048212966,0.000003253508,0.043409508,0.9504202,0.0012749524,0.00017621541],"about_ca_topic_score_codex":0.000014413419,"about_ca_topic_score_gemma":0.0000047069766,"teacher_disagreement_score":0.08002807,"about_ca_system_score_codex":0.00009439845,"about_ca_system_score_gemma":0.00022631856,"threshold_uncertainty_score":0.7206151},"labels":[],"label_agreement":null},{"id":"W2034442645","doi":"10.1016/j.jctb.2007.02.009","title":"Triangular embeddings of complete graphs from graceful labellings of paths","year":2007,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":32,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; Simon Fraser University","funders":"","keywords":"Mathematics; Combinatorics; Embedding; Graph; Path (computing); Discrete mathematics; Order (exchange); Computer science","score_opus":0.010585111727271383,"score_gpt":0.23038380038414827,"score_spread":0.21979868865687688,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2034442645","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9583733,0.0015197572,0.032603692,0.00019980533,0.0066993777,0.0001246059,0.000012371736,0.00003675541,0.00043034446],"genre_scores_gemma":[0.98435014,0.00009809409,0.0153729655,0.00006362414,0.000065752174,4.393817e-7,0.0000014022098,0.0000148515555,0.00003272833],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99720806,0.00023661432,0.001350171,0.0001984185,0.000724283,0.00028242945],"domain_scores_gemma":[0.9960237,0.00074212684,0.0016682632,0.0004644458,0.00093101163,0.00017042183],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0041528554,0.00020057589,0.0007046291,0.0003703289,0.00009225676,0.0000458785,0.0010298515,0.00013485928,0.000029753466],"category_scores_gemma":[0.00031877254,0.00016765553,0.00034389537,0.0006830616,0.00029332447,0.0005880187,0.000149901,0.00030723822,0.0000020831365],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007895025,0.00020089175,0.00027812508,0.000022800812,0.00013092965,0.00003607719,0.001633453,0.000027524913,0.04539838,0.9497404,0.0002143517,0.0015275817],"study_design_scores_gemma":[0.0019974173,0.0008795833,0.0001661175,0.00014179494,0.00004590805,0.000028057795,0.00024646785,0.000033233682,0.109088175,0.88547707,0.0017483423,0.00014785657],"about_ca_topic_score_codex":0.000025862288,"about_ca_topic_score_gemma":8.815987e-7,"teacher_disagreement_score":0.06426334,"about_ca_system_score_codex":0.000019877207,"about_ca_system_score_gemma":0.00009930255,"threshold_uncertainty_score":0.6836794},"labels":[],"label_agreement":null},{"id":"W2035278325","doi":"10.1016/j.jctb.2004.12.005","title":"A bound on the chromatic number of the square of a planar graph","year":2005,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":195,"is_retracted":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 Alberta; University of New Brunswick","funders":"","keywords":"Combinatorics; Mathematics; Planar graph; Bounded function; Square (algebra); Chromatic scale; Planar; Graph; Upper and lower bounds; Quadratic equation; Discrete mathematics; Computer science; Mathematical analysis; Geometry","score_opus":0.012947762145866733,"score_gpt":0.27311524414740057,"score_spread":0.26016748200153383,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2035278325","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9835163,0.000270423,0.0050508734,0.0034149555,0.0026227932,0.00036347343,0.00000735781,0.000019830464,0.0047340365],"genre_scores_gemma":[0.9985304,0.000027142689,0.0009686737,0.00010574151,0.00021167182,0.0000036479926,1.013095e-7,0.000012341513,0.00014027399],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972039,0.0008778453,0.0006351176,0.00012382286,0.00091703865,0.00024227555],"domain_scores_gemma":[0.9967207,0.0012195854,0.0008237868,0.00078070886,0.0003821447,0.000073106305],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002431265,0.0001564724,0.00036615258,0.00011805626,0.0001906019,0.000055944744,0.0022124627,0.00006508037,0.00008445817],"category_scores_gemma":[0.0006131261,0.00008232146,0.0003085094,0.0007105243,0.0005902157,0.00058543537,0.00018528014,0.00044089285,0.0000062423424],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004774019,0.00016316684,0.00018934606,0.000024645286,0.00008254019,0.0000050152585,0.0012309746,0.00005512483,0.0011296137,0.99543834,0.0004368833,0.00076694967],"study_design_scores_gemma":[0.00070611236,0.0005023073,0.00043860867,0.00014363517,0.000015139903,0.000109761946,0.00032039423,0.00002157752,0.020789796,0.974409,0.0024573696,0.00008629413],"about_ca_topic_score_codex":0.0000014510357,"about_ca_topic_score_gemma":0.0000011754375,"teacher_disagreement_score":0.021029335,"about_ca_system_score_codex":0.00005029492,"about_ca_system_score_gemma":0.00017405584,"threshold_uncertainty_score":0.41113433},"labels":[],"label_agreement":null},{"id":"W2035697452","doi":"10.1016/j.jctb.2015.03.005","title":"Matroids denser than a clique","year":2015,"lang":"en","type":"preprint","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","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":"Office of Naval Research","keywords":"Matroid; Combinatorics; Mathematics; Function (biology); Clique; Rank (graph theory); Exponential function; Integer (computer science); Simple (philosophy); Quadratic equation; Discrete mathematics; Mathematical analysis; Geometry; Computer science","score_opus":0.023236955092811526,"score_gpt":0.3042449549892352,"score_spread":0.28100799989642367,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2035697452","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31846562,0.008646362,0.52084476,0.0050559314,0.12240071,0.001892018,0.000058006703,0.0006358233,0.022000799],"genre_scores_gemma":[0.9656645,0.00047235112,0.02787158,0.00016833146,0.0036746557,0.000030064055,0.000004956243,0.00011841617,0.0019951407],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9945029,0.0018030297,0.0011348155,0.00048693345,0.0014560261,0.00061631505],"domain_scores_gemma":[0.99372315,0.0005848563,0.0014213662,0.0015415634,0.0022005595,0.00052849355],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.007386555,0.0005062729,0.0010688966,0.00058708806,0.00015534078,0.00053297245,0.004871877,0.00050919474,0.00004165247],"category_scores_gemma":[0.0012772718,0.00043185963,0.00057915,0.0004805233,0.00038992474,0.0013975576,0.0032786424,0.0026038114,0.000029210247],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014837827,0.00014502995,0.00006699396,0.00006730857,0.00021195442,0.00034606695,0.0011266085,0.0002702528,0.00020136824,0.99258196,0.0021946265,0.0013040645],"study_design_scores_gemma":[0.001120223,0.0009655015,0.000037168236,0.00020683366,0.00003523501,0.00048648668,0.00018797517,0.000055663102,0.0022017746,0.98190475,0.012386177,0.00041219825],"about_ca_topic_score_codex":0.0000035405565,"about_ca_topic_score_gemma":0.0000013365395,"teacher_disagreement_score":0.6471989,"about_ca_system_score_codex":0.00035141737,"about_ca_system_score_gemma":0.0016778021,"threshold_uncertainty_score":0.9998133},"labels":[],"label_agreement":null},{"id":"W2036312115","doi":"10.1016/j.jctb.2004.09.005","title":"Counting connected graphs inside-out","year":2004,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Bayesian Methods and Mixture Models","field":"Computer Science","cited_by":108,"is_retracted":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; Enumeration; Vertex (graph theory); Connected component; Partition (number theory); Path graph; Degree (music); Discrete mathematics; Graph; Graph power; Line graph; Physics","score_opus":0.011520357196130747,"score_gpt":0.24963690029188826,"score_spread":0.2381165430957575,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2036312115","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.038352277,0.00037626614,0.9451465,0.00079645414,0.011047197,0.000086206244,8.1849714e-7,0.00006256452,0.004131724],"genre_scores_gemma":[0.8649027,0.000058550904,0.13405177,0.00033573352,0.0005568862,0.0000014195613,2.6773645e-7,0.00001657401,0.00007612728],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982072,0.00034016074,0.0005778778,0.00017490707,0.00042276524,0.00027704999],"domain_scores_gemma":[0.99818367,0.0002742025,0.00055068504,0.0003500137,0.0004856842,0.00015576856],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022151063,0.00018243828,0.00040296235,0.00017897792,0.0001674329,0.0002136652,0.00090063695,0.00011621094,0.000015745409],"category_scores_gemma":[0.00048539002,0.00014828805,0.0001971452,0.00034898217,0.00011146858,0.0013691538,0.0001352193,0.00039821427,0.0000056652225],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013212473,0.000066868175,0.00001236331,0.000007734729,0.00004977201,0.000085430125,0.0010892601,0.000013311026,0.002477782,0.99092793,0.00012972542,0.0050077173],"study_design_scores_gemma":[0.0015805425,0.00044790897,0.000048569542,0.0000668979,0.000019169305,0.00027998784,0.000051845105,0.000009492752,0.016484959,0.9769621,0.0038762314,0.00017233037],"about_ca_topic_score_codex":0.0000025944948,"about_ca_topic_score_gemma":9.532142e-7,"teacher_disagreement_score":0.8265504,"about_ca_system_score_codex":0.000068434245,"about_ca_system_score_gemma":0.00029172597,"threshold_uncertainty_score":0.6047011},"labels":[],"label_agreement":null},{"id":"W2036368491","doi":"10.1016/j.jctb.2004.10.001","title":"Average independence polynomials","year":2004,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":35,"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":"Independence (probability theory); Mathematics; Combinatorics; Polynomial; Discrete mathematics; Graph; Statistics; Mathematical analysis","score_opus":0.021014775629316314,"score_gpt":0.29464488348779133,"score_spread":0.273630107858475,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2036368491","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.85129887,0.000541839,0.09003861,0.0008772453,0.04166082,0.0008487711,0.000013044212,0.00026205598,0.014458758],"genre_scores_gemma":[0.9825041,0.000050213137,0.015528815,0.00005397529,0.0014558232,0.000005067215,3.6740113e-7,0.00006668104,0.0003349071],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99702096,0.00025743333,0.0012152,0.00017944843,0.0009423057,0.00038466824],"domain_scores_gemma":[0.9962951,0.0010081212,0.0013472574,0.0005005257,0.00062755885,0.0002214405],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0024687406,0.00031998582,0.00081599597,0.0001906399,0.00016833298,0.00009015806,0.0007852175,0.00023979542,0.00014469461],"category_scores_gemma":[0.0044267885,0.00027332266,0.0002935106,0.00030286596,0.0001915664,0.0010182442,0.00015163865,0.0006864499,0.000022804476],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00071441464,0.0003422901,0.00001103569,0.000056492172,0.00010536068,0.00013076895,0.0010726986,0.000093266426,0.0017701248,0.9952412,0.00022366275,0.00023864857],"study_design_scores_gemma":[0.0032675827,0.00077153824,0.0000061591704,0.00018415162,0.000065013606,0.0004622147,0.00036203102,5.201848e-7,0.030689146,0.9615724,0.0023472556,0.00027199314],"about_ca_topic_score_codex":0.0000017801576,"about_ca_topic_score_gemma":7.340287e-7,"teacher_disagreement_score":0.1312053,"about_ca_system_score_codex":0.00030999287,"about_ca_system_score_gemma":0.00038759943,"threshold_uncertainty_score":0.99997187},"labels":[],"label_agreement":null},{"id":"W2037789845","doi":"10.1016/j.jctb.2003.09.001","title":"Excluding any graph as a minor allows a low tree-width 2-coloring","year":2004,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":111,"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; Graph minor; Graph; Edge coloring; Graph coloring; Conjecture; Fractional coloring; Discrete mathematics; List coloring; Graph power; Graph factorization; Line graph","score_opus":0.015315810349520103,"score_gpt":0.2745306702123444,"score_spread":0.2592148598628243,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2037789845","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.84218466,0.000993073,0.13519049,0.0013790072,0.012676199,0.00047158304,0.0000023193859,0.0001973125,0.0069053518],"genre_scores_gemma":[0.986439,0.00012424272,0.012310491,0.00013062346,0.00067055225,0.000011175635,3.392964e-7,0.000035314857,0.0002782607],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99675286,0.00044261804,0.0007617947,0.0003503808,0.0010048342,0.00068750326],"domain_scores_gemma":[0.9973529,0.000507345,0.0005957599,0.00063727266,0.00051410514,0.00039259065],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0028466212,0.00031643067,0.00056990265,0.00057516777,0.00035715362,0.00030584654,0.0021361557,0.000135457,0.000040022147],"category_scores_gemma":[0.000857571,0.00027626668,0.00038614147,0.001107099,0.00031977097,0.002828043,0.0004287985,0.00071324524,0.000027534],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010820092,0.00021599374,0.00009910688,0.000023724975,0.000113998234,0.0004581526,0.0012678034,0.00035001402,0.0067230226,0.9852896,0.000039791652,0.004336827],"study_design_scores_gemma":[0.0028332998,0.0015846394,0.00016844252,0.00016379381,0.000018201828,0.0005314779,0.00029777337,0.000011278706,0.0277322,0.964175,0.0021939166,0.00028997654],"about_ca_topic_score_codex":0.0000045995425,"about_ca_topic_score_gemma":0.000002415088,"teacher_disagreement_score":0.14425433,"about_ca_system_score_codex":0.00024086397,"about_ca_system_score_gemma":0.00043872805,"threshold_uncertainty_score":0.99996895},"labels":[],"label_agreement":null},{"id":"W2038617524","doi":"10.1016/j.jctb.2014.12.001","title":"Median eigenvalues and the HOMO–LUMO index of graphs","year":2014,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Graph theory and applications","field":"Mathematics","cited_by":30,"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":"Eigenvalues and eigenvectors; Mathematics; Combinatorics; Degree (music); Value (mathematics); Graph; Upper and lower bounds; Index (typography); HOMO/LUMO; Discrete mathematics; Statistics; Computer science; Physics; Quantum mechanics; Mathematical analysis","score_opus":0.010615521027517765,"score_gpt":0.2549073723640302,"score_spread":0.24429185133651246,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2038617524","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9914821,0.00026946035,0.0013062798,0.0008574757,0.0015265938,0.00021420438,0.0000042684137,0.000017387054,0.0043222276],"genre_scores_gemma":[0.9990761,0.00010495656,0.0004163018,0.000041014257,0.0002646162,0.00000581503,2.9706013e-7,0.000014951727,0.00007592195],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983262,0.00064263894,0.00055206654,0.00007731456,0.0002726316,0.00012915453],"domain_scores_gemma":[0.9966423,0.0021025478,0.00065961684,0.0002859043,0.00022958225,0.00008003805],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003976072,0.00012631205,0.0004252801,0.00010189086,0.00016345698,0.00003110006,0.00035373276,0.00007866747,0.000044446308],"category_scores_gemma":[0.0012262099,0.000077163604,0.00018051053,0.00018584698,0.0008525321,0.00017825364,0.000055227483,0.00024673977,9.3517815e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008204805,0.000077717414,0.00020028115,0.00002944753,0.00009693144,7.7659485e-7,0.0011963017,6.6675557e-7,0.0002719083,0.99627006,0.00023906045,0.0007963784],"study_design_scores_gemma":[0.0019623903,0.00021188972,0.00018447121,0.00004176723,0.00010799347,0.000048648784,0.00081305014,0.000004293912,0.0036387476,0.9906126,0.0022925262,0.00008161134],"about_ca_topic_score_codex":0.0000019822014,"about_ca_topic_score_gemma":0.0000015785229,"teacher_disagreement_score":0.0075940224,"about_ca_system_score_codex":0.0000070126157,"about_ca_system_score_gemma":0.000030023473,"threshold_uncertainty_score":0.31466404},"labels":[],"label_agreement":null},{"id":"W2040255444","doi":"10.1016/j.jctb.2011.09.001","title":"Decomposing locally semicomplete digraphs into strong spanning subdigraphs","year":2011,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Mathematics; Digraph; Combinatorics; Partition (number theory); Disjoint sets; Arc (geometry); Discrete mathematics","score_opus":0.02491616962830137,"score_gpt":0.27327887964117825,"score_spread":0.24836271001287688,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2040255444","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21304055,0.0014434598,0.7685273,0.00016554353,0.008464023,0.00031227944,0.0000022084782,0.00019793838,0.007846649],"genre_scores_gemma":[0.95489746,0.00007421678,0.04458106,0.000061490864,0.00029410375,0.000004066718,5.9915357e-7,0.000036192698,0.000050808674],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99650544,0.00073578145,0.0009246202,0.000352489,0.0008294408,0.00065225706],"domain_scores_gemma":[0.9969352,0.00050202804,0.000754891,0.00072865677,0.00070375437,0.000375498],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0028962633,0.00033759838,0.0005894188,0.0006751426,0.000406377,0.00023638378,0.0026057623,0.00013013606,0.000057985915],"category_scores_gemma":[0.0002418729,0.00029826857,0.00037551852,0.0009797928,0.00048467054,0.0030364841,0.0005118695,0.000802137,0.000009850378],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001027467,0.0001343566,0.0009338424,0.000019217265,0.00013256604,0.00016425464,0.0029154883,0.000029962875,0.0046594683,0.9840257,0.0000558195,0.005901817],"study_design_scores_gemma":[0.0011571866,0.001146099,0.00037344536,0.0001235149,0.000022228858,0.0002978257,0.00052252575,0.00007344332,0.021484967,0.97266686,0.0018082885,0.000323607],"about_ca_topic_score_codex":0.000008781557,"about_ca_topic_score_gemma":0.0000022607599,"teacher_disagreement_score":0.74185693,"about_ca_system_score_codex":0.00010427347,"about_ca_system_score_gemma":0.00021636543,"threshold_uncertainty_score":0.99994695},"labels":[],"label_agreement":null},{"id":"W2040720394","doi":"10.1016/j.jctb.2012.05.002","title":"Spectrally degenerate graphs: Hereditary case","year":2012,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","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":"Simon Fraser University","funders":"Javna Agencija za Raziskovalno Dejavnost RS; Grantová Agentura České Republiky; Ministerstvo Školství, Mládeže a Tělovýchovy; Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Degenerate energy levels; Combinatorics; Upper and lower bounds; Converse; Mathematics; Spectral radius; Vertex (graph theory); Graph; Degree (music); Discrete mathematics; Physics; Quantum mechanics; Mathematical analysis; Geometry","score_opus":0.016353382331158694,"score_gpt":0.27266766040740703,"score_spread":0.25631427807624835,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2040720394","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.84588,0.005473278,0.10296995,0.00084122,0.038338784,0.0003445843,0.000007829134,0.00017123514,0.005973143],"genre_scores_gemma":[0.9857959,0.00008351096,0.0121305855,0.000107989195,0.0016394076,0.000003365789,4.1743797e-7,0.00002400007,0.00021480335],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972755,0.00076245295,0.00056854764,0.00016899355,0.00059708976,0.0006274207],"domain_scores_gemma":[0.997853,0.00042851586,0.00038945238,0.0005365948,0.00041894123,0.00037348617],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035331803,0.00022377931,0.00037135018,0.00031522143,0.0002555303,0.00013855915,0.0011661183,0.00009820134,0.00007688211],"category_scores_gemma":[0.00032345788,0.0001841774,0.00024033221,0.00065837184,0.00022814827,0.003780683,0.0002562457,0.0005580991,0.00001890083],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00040309722,0.00016877943,0.00017641878,0.000009570198,0.0000857439,0.002575121,0.0006679342,0.000020479369,0.0011884719,0.99160635,0.0008165772,0.002281458],"study_design_scores_gemma":[0.0008729566,0.0006728919,0.00007474953,0.000019759309,0.000017717959,0.020612938,0.000266357,0.000011378455,0.015684623,0.95544773,0.0060972916,0.00022160175],"about_ca_topic_score_codex":0.0000016173558,"about_ca_topic_score_gemma":7.4733475e-7,"teacher_disagreement_score":0.13991594,"about_ca_system_score_codex":0.00007948399,"about_ca_system_score_gemma":0.00014579801,"threshold_uncertainty_score":0.7510537},"labels":[],"label_agreement":null},{"id":"W2043779144","doi":"10.1006/jctb.2001.2077","title":"The Numbers of Dependent k-Sets in a Graph Are Log Concave","year":2002,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","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 Prince Edward Island","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Graph; Mathematics; Complement graph; Discrete mathematics; Graph power; Line graph","score_opus":0.01685087307057495,"score_gpt":0.2667885007855626,"score_spread":0.24993762771498765,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2043779144","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.91035974,0.009537462,0.032367546,0.004773947,0.024139734,0.0011171432,0.000014903436,0.00010862947,0.01758089],"genre_scores_gemma":[0.9986206,0.0004436621,0.0005735329,0.00003858596,0.00009991191,0.0000042255047,7.8759065e-8,0.000012280443,0.00020711702],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971207,0.00084491755,0.00071378326,0.00016930456,0.0007744744,0.00037684286],"domain_scores_gemma":[0.9969001,0.0012623939,0.0007540615,0.000525453,0.00042495868,0.00013307619],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002932208,0.00016284698,0.00039278917,0.00024386693,0.00016814054,0.00010165648,0.0017961188,0.00008589155,0.00003993881],"category_scores_gemma":[0.0007663954,0.00011396363,0.00018804523,0.0006965063,0.00046590556,0.0008845644,0.00025706828,0.000553902,0.000005962104],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005149662,0.00014338065,0.000859864,0.0000109574385,0.00005777025,0.00014306637,0.0009792143,0.00008251112,0.0002963784,0.9926636,0.00027312193,0.0039751767],"study_design_scores_gemma":[0.0015153674,0.0005099696,0.0004952588,0.000062074556,0.0000064729315,0.00015313081,0.0007948194,0.00005997436,0.003618479,0.9909198,0.0017398462,0.00012475412],"about_ca_topic_score_codex":0.00000248247,"about_ca_topic_score_gemma":0.000007888699,"teacher_disagreement_score":0.08826086,"about_ca_system_score_codex":0.00008491391,"about_ca_system_score_gemma":0.00006544721,"threshold_uncertainty_score":0.46473017},"labels":[],"label_agreement":null},{"id":"W2045237424","doi":"10.1016/j.jctb.2008.01.003","title":"Locally planar graphs are 5-choosable","year":2008,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":41,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Planar graph; Planar; Enhanced Data Rates for GSM Evolution; Graph; Computer science; Mathematics; Combinatorics; Telecommunications; Computer graphics (images)","score_opus":0.01650812458121698,"score_gpt":0.25320838278942615,"score_spread":0.23670025820820917,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2045237424","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4654458,0.004596354,0.46933648,0.0036452923,0.03279272,0.00086708035,0.00001722927,0.00050613267,0.02279293],"genre_scores_gemma":[0.98918587,0.00039481072,0.00880734,0.00019424745,0.00048425017,0.00000451587,5.374269e-7,0.000029328987,0.0008991092],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99729,0.00051399297,0.00061154936,0.00023437163,0.0008916132,0.00045847535],"domain_scores_gemma":[0.9973579,0.0004690096,0.0005934552,0.0006081078,0.0006738926,0.00029760253],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017665039,0.00021926627,0.00047193456,0.00035699786,0.00037576686,0.000098611956,0.0019493342,0.0001106818,0.00005066655],"category_scores_gemma":[0.0005382401,0.00018359054,0.00024520946,0.00079051126,0.000424313,0.002042561,0.00018983353,0.00061123027,0.000028240594],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00081880385,0.0001358272,0.00058769877,0.000010298339,0.000070013884,0.0006964763,0.00039820175,0.000054595166,0.0005469877,0.99369216,0.0022420564,0.0007468556],"study_design_scores_gemma":[0.0012892414,0.00083197886,0.0004851484,0.00004796703,0.000007259189,0.0013104215,0.00016160306,0.00001579213,0.004519972,0.97586447,0.01526109,0.00020503884],"about_ca_topic_score_codex":0.0000011164916,"about_ca_topic_score_gemma":4.5504456e-7,"teacher_disagreement_score":0.52374005,"about_ca_system_score_codex":0.0000742771,"about_ca_system_score_gemma":0.00027594678,"threshold_uncertainty_score":0.7486605},"labels":[],"label_agreement":null},{"id":"W2047779705","doi":"10.1016/j.jctb.2003.11.001","title":"A short proof of non-GF(5)-representability of matroids","year":2004,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","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","funders":"Marsden Fund; Natural Sciences and Engineering Research Council of Canada; National Security Agency","keywords":"Matroid; Proof of concept; GF(2); Mathematics; Combinatorics; Computer science; Finite field","score_opus":0.012493688221346536,"score_gpt":0.29328536457964816,"score_spread":0.2807916763583016,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2047779705","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.78718764,0.00022649899,0.20764025,0.00025276223,0.0027865793,0.00036408452,0.0000052276446,0.000021004826,0.0015159638],"genre_scores_gemma":[0.9910158,0.000020627598,0.00873463,0.000008239121,0.0001622667,0.000004136155,2.8795094e-7,0.000014407339,0.00003961534],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971048,0.00039747314,0.0010185927,0.00022188664,0.0009425504,0.00031469905],"domain_scores_gemma":[0.9970224,0.00039787727,0.00060212094,0.0008283874,0.0009823598,0.0001668502],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033777463,0.00018515669,0.0006544299,0.0002768355,0.00007576843,0.000035635698,0.001784469,0.00009838671,0.000021225143],"category_scores_gemma":[0.0006410239,0.00015331192,0.00032911444,0.0007271391,0.0006393865,0.0013386561,0.00044273722,0.00038794754,0.0000010304603],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0017857851,0.00056475913,0.0008574442,0.000089160996,0.000112058595,0.000032381515,0.0010131194,0.0005793467,0.019792618,0.9702274,0.00002153825,0.004924388],"study_design_scores_gemma":[0.0010932048,0.0011578398,0.0006742019,0.00006431865,0.0000120186605,0.0000731597,0.00016093306,0.0000122556785,0.29861015,0.69793123,0.00011584213,0.000094848685],"about_ca_topic_score_codex":0.000003851173,"about_ca_topic_score_gemma":5.8879544e-7,"teacher_disagreement_score":0.27881753,"about_ca_system_score_codex":0.000101980084,"about_ca_system_score_gemma":0.00037798818,"threshold_uncertainty_score":0.6251879},"labels":[],"label_agreement":null},{"id":"W2052233329","doi":"10.1006/jctb.2002.2076","title":"Sewing Ribbons on Graphs in Space","year":2002,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Topological and Geometric Data Analysis","field":"Computer Science","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":"Univerzita Komenského v Bratislave","keywords":"Ribbon; Graph; Combinatorics; Mathematics; Euclidean geometry; Discrete mathematics; Geometry","score_opus":0.015435517117606481,"score_gpt":0.22451968122943006,"score_spread":0.20908416411182357,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2052233329","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.70452917,0.004528423,0.06417463,0.023203671,0.03607921,0.00046265186,0.000020985923,0.00028958116,0.16671166],"genre_scores_gemma":[0.99806195,0.00014443319,0.0010729223,0.00015343887,0.00016781777,7.575879e-7,2.2214071e-7,0.000004012114,0.00039446974],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985589,0.0002667214,0.00040094377,0.00015415392,0.00039049354,0.00022883173],"domain_scores_gemma":[0.99877805,0.00043755685,0.0002677022,0.00030762155,0.00009504064,0.00011404304],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010988059,0.000122558,0.00032734338,0.0005562394,0.00008405909,0.00011876892,0.0009191449,0.0000703357,0.00019504614],"category_scores_gemma":[0.0006251538,0.00008882304,0.00017205458,0.0016418447,0.00007611595,0.00081484456,0.00013432058,0.00033372905,0.00002653329],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000057252368,0.00018958248,0.00025185363,0.000001775642,0.000030211746,0.00012591739,0.00030261333,0.000059940423,0.000034601147,0.99284226,0.0009786645,0.0051253135],"study_design_scores_gemma":[0.0007729927,0.00078596314,0.00080123433,0.000025099785,0.000013373483,0.000058253394,0.00014188672,0.00011102002,0.00048525876,0.98117745,0.015491741,0.00013574977],"about_ca_topic_score_codex":0.0000038140406,"about_ca_topic_score_gemma":5.122103e-7,"teacher_disagreement_score":0.29353273,"about_ca_system_score_codex":0.000042801756,"about_ca_system_score_gemma":0.000014992074,"threshold_uncertainty_score":0.36220986},"labels":[],"label_agreement":null},{"id":"W2052262845","doi":"10.1016/j.jctb.2008.03.007","title":"Removable cycles in non-bipartite graphs","year":2008,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"graph theory and CDMA systems","field":"Engineering","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":"Bipartite graph; Combinatorics; Connected component; Mathematics; Disjoint sets; Connectivity; Graph; Complete bipartite graph; Path (computing); Discrete mathematics; Computer science","score_opus":0.006866264398241998,"score_gpt":0.19441159737768268,"score_spread":0.18754533297944068,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2052262845","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9824498,0.0007877255,0.000102371814,0.000018462011,0.007320583,0.00008444257,0.0000017042659,0.000047480404,0.009187384],"genre_scores_gemma":[0.99906665,0.00029936206,0.00008146501,0.000012249345,0.00033555154,0.0000033036324,5.3086455e-7,0.000028875449,0.00017200282],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986684,0.00015745536,0.0006007055,0.00008070924,0.00023476157,0.00025801465],"domain_scores_gemma":[0.9993506,0.00012263922,0.00014557838,0.00019005965,0.000087609675,0.00010352126],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010374453,0.00016980109,0.0004099932,0.00026127626,0.00008575314,0.000023847322,0.00027212955,0.00011064208,0.000061753504],"category_scores_gemma":[0.000069177535,0.00015300061,0.0001649485,0.00036732762,0.00011983845,0.00055294414,0.000018739576,0.00033844,0.000012776448],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014630591,0.0001894873,0.0054593016,0.00013047631,0.00022906897,0.00080379576,0.0036879599,0.004502083,0.01501947,0.9648156,0.003026367,0.0006733355],"study_design_scores_gemma":[0.0020695163,0.00034295354,0.0036152455,0.0001915082,0.00002286372,0.00091629516,0.0007180971,0.00006605316,0.017325256,0.961703,0.012699437,0.00032974748],"about_ca_topic_score_codex":0.0000026112386,"about_ca_topic_score_gemma":0.0000015609289,"teacher_disagreement_score":0.016616812,"about_ca_system_score_codex":0.00004561574,"about_ca_system_score_gemma":0.000029657793,"threshold_uncertainty_score":0.62391835},"labels":[],"label_agreement":null},{"id":"W2053364672","doi":"10.1016/s0095-8956(02)00041-2","title":"Inertia and biclique decompositions of joins of graphs","year":2003,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Graph theory and applications","field":"Mathematics","cited_by":28,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Redeemer University; Queen's University","funders":"","keywords":"Joins; Bipartite graph; Combinatorics; Inertia; Mathematics; Eigenvalues and eigenvectors; Partition (number theory); Hermitian matrix; Join (topology); Complete bipartite graph; Discrete mathematics; Graph; Computer science; Pure mathematics; Physics","score_opus":0.01612957538382822,"score_gpt":0.279951896022733,"score_spread":0.2638223206389048,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2053364672","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9952533,0.000197069,0.0007929094,0.00010079304,0.00052505813,0.00011299843,0.000010431756,0.000007858578,0.0029995623],"genre_scores_gemma":[0.99633044,0.00007914827,0.0034886643,0.000011235045,0.000033864966,0.0000030419378,4.4482502e-7,0.000012044336,0.000041136936],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987334,0.000317015,0.00063568476,0.00006465477,0.00015091452,0.00009833841],"domain_scores_gemma":[0.9980844,0.0006867135,0.0006598498,0.00019179485,0.00030569045,0.0000715142],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001168097,0.00010394912,0.00036860965,0.00015777476,0.000076553784,0.000009494819,0.00014439282,0.000071504655,0.00006432772],"category_scores_gemma":[0.00051755906,0.000086429005,0.0001508378,0.00024409484,0.000268869,0.00017917607,0.000020584304,0.00015636205,3.065783e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022188043,0.0002907278,0.00021591477,0.000052541774,0.00009381275,0.0000015991715,0.0004282584,0.0000015059134,0.021514373,0.97699946,0.00013204424,0.000047867314],"study_design_scores_gemma":[0.0006830707,0.00034504166,0.00015529752,0.00006555557,0.00009008112,0.00008155728,0.00039246905,2.804681e-7,0.09697126,0.90009695,0.0010495263,0.0000689222],"about_ca_topic_score_codex":7.101811e-7,"about_ca_topic_score_gemma":6.2719545e-7,"teacher_disagreement_score":0.07690253,"about_ca_system_score_codex":0.000008085489,"about_ca_system_score_gemma":0.00006038129,"threshold_uncertainty_score":0.35244724},"labels":[],"label_agreement":null},{"id":"W2053790252","doi":"10.1016/j.jctb.2007.06.003","title":"Fourier analysis and large independent sets in powers of complete graphs","year":2007,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; University of Waterloo","funders":"","keywords":"Statement (logic); Mathematics; Graph; Combinatorics; Independent set; Fourier transform; Set (abstract data type); Constant (computer programming); Fourier analysis; Maximal independent set; Discrete mathematics; Computer science; 1-planar graph; Mathematical analysis; Chordal graph","score_opus":0.014069872128002835,"score_gpt":0.28627842000547965,"score_spread":0.27220854787747684,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2053790252","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9948713,0.00024700465,0.0014830757,0.000030085836,0.0017640163,0.00010083929,0.000015171888,0.000007143654,0.0014813528],"genre_scores_gemma":[0.99820626,0.000054263626,0.0015722566,0.00003117699,0.00008452176,4.3028075e-7,9.5278176e-7,0.000016080008,0.00003404608],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978397,0.00030517252,0.00094828417,0.00012515047,0.00050342013,0.0002783052],"domain_scores_gemma":[0.9976688,0.00093297154,0.0007784787,0.0002593613,0.00023938138,0.000121009536],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0054714377,0.00017848774,0.0007265977,0.0007845373,0.00010225353,0.000021707194,0.00028415717,0.00014719047,0.000112775415],"category_scores_gemma":[0.00049057766,0.00013947973,0.00030579348,0.00065816625,0.00022123949,0.00023533813,0.00012026868,0.00037852573,1.3216572e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015565066,0.00013460247,0.015941063,0.000038895283,0.0007164662,0.000065693705,0.0025647564,0.0000018818973,0.00018960063,0.9783332,0.000043363263,0.0004139865],"study_design_scores_gemma":[0.0018141633,0.00030775918,0.014517616,0.00003769542,0.00034599303,0.000052903797,0.0015029425,0.0000031005743,0.0008957523,0.9797149,0.00066803984,0.00013914965],"about_ca_topic_score_codex":0.0000034116538,"about_ca_topic_score_gemma":0.000022951606,"teacher_disagreement_score":0.0049808603,"about_ca_system_score_codex":0.000036097517,"about_ca_system_score_gemma":0.00003354994,"threshold_uncertainty_score":0.5687818},"labels":[],"label_agreement":null},{"id":"W2055120783","doi":"10.1016/j.jctb.2005.04.002","title":"<mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.gif\" overflow=\"scroll\"><mml:mi mathvariant=\"normal\">Δ</mml:mi><mml:mo>+</mml:mo><mml:mn>300</mml:mn></mml:math> is a bound on the adjacent vertex distinguishing edge chromatic number","year":2005,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":126,"is_retracted":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":"Vertex (graph theory); Graph; Edge coloring; Mathematics; Scroll; Combinatorics; Algorithm; Line graph","score_opus":0.013034258144863281,"score_gpt":0.22761261120423784,"score_spread":0.21457835305937456,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2055120783","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97855157,0.0004947809,0.00069782935,0.001414942,0.007053411,0.000060541446,0.000025949874,0.00014866938,0.011552301],"genre_scores_gemma":[0.9948043,0.00019024372,0.0021032575,0.0016442079,0.00093253946,0.000056689652,0.000014246609,0.00012743806,0.00012703208],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99521095,0.0004202127,0.0012528601,0.00060436793,0.0015785699,0.0009330475],"domain_scores_gemma":[0.99569166,0.0010420647,0.0014818483,0.0010980964,0.0002521696,0.00043419123],"candidate_categories":["metaepi_narrow","sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0032674992,0.00047297502,0.00036331327,0.00017175908,0.0013192113,0.001412263,0.0017759993,0.000507179,0.0007461085],"category_scores_gemma":[0.0012362195,0.0005097427,0.0007277389,0.00055659265,0.00052519393,0.0014475072,0.00083837815,0.0010896935,0.0006035693],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006166212,0.0003010777,0.000005315101,0.0001379755,0.00039988515,0.000263666,0.002897115,0.00031333615,0.00072650594,0.9780723,0.015141732,0.0011244691],"study_design_scores_gemma":[0.005548268,0.003643219,0.00008586237,0.0029215983,0.0008767057,0.004029308,0.0019624967,0.25026295,0.15963224,0.5325967,0.03650763,0.001933055],"about_ca_topic_score_codex":0.00008883815,"about_ca_topic_score_gemma":0.000017154418,"teacher_disagreement_score":0.4454756,"about_ca_system_score_codex":0.000043680855,"about_ca_system_score_gemma":0.000592258,"threshold_uncertainty_score":0.9999809},"labels":[],"label_agreement":null},{"id":"W2055499237","doi":"10.1006/jctb.2001.2091","title":"On a Conjecture of Lovász Concerning Bricks","year":2002,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":46,"is_retracted":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":"Conjecture; Combinatorics; Mathematics; Brick; Petersen graph; Cubic graph; Matching (statistics); Graph; Discrete mathematics; Line graph; Voltage graph; Engineering","score_opus":0.01866125685222832,"score_gpt":0.2619885753374605,"score_spread":0.24332731848523217,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2055499237","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.57583255,0.0052875923,0.32218683,0.0028825712,0.02677849,0.00084061426,0.000017027829,0.00023262558,0.06594172],"genre_scores_gemma":[0.99749136,0.000070685644,0.0016036532,0.000086227905,0.0002668072,0.0000012849392,1.3310627e-7,0.000015155191,0.00046471704],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977665,0.0005155832,0.0005416705,0.00017399734,0.0007105367,0.00029169445],"domain_scores_gemma":[0.9972763,0.0010678434,0.000634021,0.00045456624,0.00041816165,0.000149092],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013757247,0.00017204943,0.0004393168,0.0002584179,0.00011087633,0.000073512434,0.0013024054,0.00009689821,0.000251935],"category_scores_gemma":[0.0008518323,0.00013882761,0.00020052982,0.0005165081,0.0002972578,0.0008194342,0.00016860648,0.00056590396,0.000014266938],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00046628105,0.00012031555,0.000035521898,0.000013209126,0.000061565566,0.00008693852,0.0010269094,0.0001673934,0.0010784285,0.99091744,0.00061512756,0.005410894],"study_design_scores_gemma":[0.0015131601,0.0022011502,0.00002730472,0.0000880994,0.000009416689,0.00019628482,0.00011842898,0.00012269111,0.0117662335,0.9769919,0.0068197236,0.00014561642],"about_ca_topic_score_codex":5.401008e-7,"about_ca_topic_score_gemma":9.1081986e-8,"teacher_disagreement_score":0.4216588,"about_ca_system_score_codex":0.00006066703,"about_ca_system_score_gemma":0.00006550248,"threshold_uncertainty_score":0.5661226},"labels":[],"label_agreement":null},{"id":"W2056219688","doi":"10.1016/j.jctb.2008.07.001","title":"On the sum of k largest eigenvalues of graphs and symmetric matrices","year":2008,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Graph theory and applications","field":"Mathematics","cited_by":22,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Combinatorics; Mathematics; Eigenvalues and eigenvectors; Generalization; Integer (computer science); Order (exchange); Graph; Discrete mathematics; Physics; Computer science; Mathematical analysis; Quantum mechanics","score_opus":0.025861457558032416,"score_gpt":0.26741940264988384,"score_spread":0.2415579450918514,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2056219688","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99648196,0.00059675175,0.000041184056,0.0001446811,0.00049753767,0.00012887822,0.000010354702,0.0000085398715,0.0020901212],"genre_scores_gemma":[0.998984,0.00056981674,0.0002763658,0.000015285863,0.000060375452,0.0000028507532,2.6723035e-7,0.0000124703065,0.00007856421],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99864346,0.00030523428,0.0005592103,0.00007118204,0.00030911263,0.00011182428],"domain_scores_gemma":[0.9958255,0.002772642,0.00084238517,0.00024068743,0.00026832247,0.000050407514],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017066826,0.00011826565,0.00037221872,0.00023511049,0.00015950049,0.000009467258,0.0002999168,0.00006618621,0.00005065165],"category_scores_gemma":[0.0010144387,0.00007391548,0.00016589822,0.0005170728,0.00041507327,0.00014205146,0.000039285216,0.0001942671,7.798046e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00041714608,0.00026731883,0.00042667222,0.000047970087,0.00010011911,0.0000032828382,0.0005300738,9.269247e-7,0.0007649731,0.99684846,0.00052463927,0.000068397196],"study_design_scores_gemma":[0.0004909744,0.0005330201,0.0005791791,0.000059293805,0.00007834933,0.00006836096,0.00046364425,5.5558877e-7,0.018685486,0.9785654,0.00040792604,0.00006783364],"about_ca_topic_score_codex":0.0000014607288,"about_ca_topic_score_gemma":1.7370367e-7,"teacher_disagreement_score":0.018283105,"about_ca_system_score_codex":0.000007717594,"about_ca_system_score_gemma":0.00004168467,"threshold_uncertainty_score":0.30141857},"labels":[],"label_agreement":null},{"id":"W2056775628","doi":"10.1016/j.jctb.2012.11.001","title":"Zarankiewiczʼs Conjecture is finite for each fixed m","year":2012,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Conjecture; Counterexample; Combinatorics; Bipartite graph; Mathematics; Integer (computer science); Graph; Discrete mathematics","score_opus":0.014450968568792546,"score_gpt":0.2576611888266693,"score_spread":0.24321022025787672,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2056775628","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032248948,0.0015445183,0.94049495,0.0017080144,0.022834832,0.00022516359,0.000008720655,0.000037214526,0.00089762546],"genre_scores_gemma":[0.9786126,0.0000271028,0.017469268,0.0005158259,0.0027290473,0.0000056265376,0.000003684406,0.000010294806,0.0006265287],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99880034,0.00016304699,0.0003859032,0.00010387389,0.00031314138,0.00023371892],"domain_scores_gemma":[0.998307,0.00062171207,0.00036138663,0.0001875823,0.00038798232,0.00013437336],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015106774,0.00013032829,0.00024069814,0.00013936387,0.00016129363,0.00011541208,0.0004523832,0.00008423744,0.000050574374],"category_scores_gemma":[0.00034809342,0.00010849233,0.00017737974,0.00028442818,0.000037037833,0.0013781267,0.000065276436,0.00016101477,0.000008555848],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028566679,0.00010802448,0.000079939855,0.000015360063,0.00006479948,0.0000018606564,0.0013232213,0.00025969886,0.00048067994,0.9863729,0.005592673,0.0054151686],"study_design_scores_gemma":[0.001589165,0.0006704787,0.00024194762,0.000021076126,0.000031486572,0.000113301794,0.000052446572,0.00048217035,0.013400325,0.7032043,0.28001782,0.00017552655],"about_ca_topic_score_codex":2.1975907e-7,"about_ca_topic_score_gemma":5.3497796e-8,"teacher_disagreement_score":0.9463637,"about_ca_system_score_codex":0.000037428355,"about_ca_system_score_gemma":0.00013533141,"threshold_uncertainty_score":0.44241887},"labels":[],"label_agreement":null},{"id":"W2057654888","doi":"10.1016/j.jctb.2008.08.006","title":"Growth rates of minor-closed classes of matroids","year":2008,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":46,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Matroid; Mathematics; Combinatorics; Rank (graph theory); Minor (academic); Graphic matroid; Simple (philosophy); Class (philosophy); Matroid partitioning; Discrete mathematics","score_opus":0.020051602701198497,"score_gpt":0.281127115789744,"score_spread":0.2610755130885455,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2057654888","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9701073,0.0008846123,0.022829555,0.0002993514,0.003397712,0.00017298179,0.000005717189,0.000029792644,0.0022729805],"genre_scores_gemma":[0.9919604,0.000259502,0.007306596,0.000016288093,0.00019750092,0.0000016222235,3.3505202e-7,0.00001566167,0.00024205906],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973224,0.0005826691,0.0008588352,0.0001620698,0.00078451383,0.00028954932],"domain_scores_gemma":[0.9963178,0.00092312094,0.0009234397,0.00045432287,0.0012414327,0.00013987868],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015984115,0.00018138366,0.00061799906,0.00036653603,0.0001126096,0.000025351253,0.0015724486,0.000091645066,0.000039897506],"category_scores_gemma":[0.0008161764,0.00014911659,0.0002672122,0.00071801175,0.0007047723,0.0013005687,0.00024648875,0.00032688293,0.0000027372969],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012300631,0.00021834184,0.0015740267,0.000053171112,0.000095645104,0.000068877576,0.00067600637,0.00001551815,0.019132363,0.9763001,0.00028485325,0.00035101778],"study_design_scores_gemma":[0.0011971551,0.0011836214,0.0011192479,0.000050445287,0.000011036186,0.00023441714,0.00016087586,0.000009493932,0.22622643,0.7691046,0.0005862936,0.00011638794],"about_ca_topic_score_codex":0.000002334683,"about_ca_topic_score_gemma":2.454183e-7,"teacher_disagreement_score":0.20719554,"about_ca_system_score_codex":0.00003933061,"about_ca_system_score_gemma":0.00031949786,"threshold_uncertainty_score":0.6080798},"labels":[],"label_agreement":null},{"id":"W2058418398","doi":"10.1016/j.jctb.2008.06.002","title":"Brick assignments and homogeneously almost self-complementary graphs","year":2008,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Finite Group Theory Research","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 Ottawa","funders":"","keywords":"Combinatorics; Mathematics; Cograph; Vertex (graph theory); Transitive relation; Graph; Discrete mathematics; Indifference graph; Chordal graph; 1-planar graph","score_opus":0.04029675948081831,"score_gpt":0.29593739312915834,"score_spread":0.25564063364834005,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2058418398","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99394727,0.00036574792,0.00018664815,0.00019238153,0.002145297,0.0002720336,0.000014811348,0.00005127358,0.0028245572],"genre_scores_gemma":[0.9946934,0.0003099393,0.0038550347,0.00009631543,0.0004966473,0.000005512381,0.0000024700814,0.000058765032,0.0004818991],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970283,0.00075015414,0.0007788769,0.00018733765,0.0008476103,0.00040770258],"domain_scores_gemma":[0.99731195,0.0012544263,0.00051056553,0.00033335277,0.00033577366,0.00025395636],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024517088,0.00025948783,0.00056188845,0.00025333205,0.00037123295,0.000058443955,0.00049824256,0.00010969569,0.00039296673],"category_scores_gemma":[0.0005569201,0.00022219143,0.00018287788,0.00027944832,0.000343408,0.0006760519,0.00020866001,0.00046934484,0.000010232457],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0018966492,0.0006380995,0.0025035136,0.000078765086,0.0005184989,0.0007012505,0.0023618082,9.984171e-7,0.0009384479,0.98398036,0.0059290007,0.00045258517],"study_design_scores_gemma":[0.0025469854,0.0014177904,0.0004654454,0.000047453737,0.0000865884,0.0019875816,0.00073868455,0.0000028535444,0.0025742725,0.98062354,0.009277281,0.00023150581],"about_ca_topic_score_codex":0.0000031483546,"about_ca_topic_score_gemma":6.1053964e-7,"teacher_disagreement_score":0.0036683867,"about_ca_system_score_codex":0.00011293376,"about_ca_system_score_gemma":0.00014614912,"threshold_uncertainty_score":0.9060704},"labels":[],"label_agreement":null},{"id":"W2060031821","doi":"10.1016/j.jctb.2014.01.005","title":"Removable paths and cycles with parity constraints","year":2014,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Conjecture; Combinatorics; Mathematics; Parity (physics); Bipartite graph; Vertex (graph theory); Graph; Integer (computer science); Connectivity; Discrete mathematics; Physics; Computer science","score_opus":0.011393454643920681,"score_gpt":0.24868694295070454,"score_spread":0.23729348830678385,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2060031821","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98375356,0.00013586335,0.00142952,0.00012972942,0.0023243502,0.000103221195,0.0000035350306,0.000026902006,0.012093289],"genre_scores_gemma":[0.99455595,0.000044267625,0.0047497866,0.000058354308,0.00046783598,8.428508e-7,2.4253478e-7,0.000020930855,0.000101765996],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986057,0.00037921252,0.00041078823,0.00011367958,0.00029634603,0.00019425777],"domain_scores_gemma":[0.99807554,0.0008966886,0.00044993614,0.00022890617,0.00022369537,0.00012524558],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021046058,0.00017155883,0.00044020536,0.00007435292,0.00023727055,0.000061652245,0.00021689241,0.00010499981,0.0000901618],"category_scores_gemma":[0.00080541515,0.000111189205,0.00008123134,0.00008062097,0.00065247895,0.00028752122,0.00007292368,0.00031220115,4.4649994e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00096678187,0.000050170696,0.00059235917,0.000045413784,0.00009979353,0.000021124555,0.00068176305,7.0276366e-7,0.00011431539,0.9941637,0.00023446529,0.0030294182],"study_design_scores_gemma":[0.0014281479,0.0006927435,0.00040328095,0.0000903067,0.00007810875,0.0005600122,0.0004954839,0.0000018705606,0.0012875965,0.99088806,0.0039233575,0.00015104073],"about_ca_topic_score_codex":5.68528e-7,"about_ca_topic_score_gemma":6.7490936e-7,"teacher_disagreement_score":0.011991523,"about_ca_system_score_codex":0.000017001747,"about_ca_system_score_gemma":0.00004551447,"threshold_uncertainty_score":0.4534164},"labels":[],"label_agreement":null},{"id":"W2060877605","doi":"10.1006/jctb.2001.2032","title":"Matroid 4-Connectivity: A Deletion–Contraction Theorem","year":2001,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":30,"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":"Marsden Fund; Natural Sciences and Engineering Research Council of Canada","keywords":"Matroid; Combinatorics; Mathematics; Element (criminal law); Contraction (grammar); Discrete mathematics","score_opus":0.01198728508842466,"score_gpt":0.269787487247202,"score_spread":0.2578002021587773,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2060877605","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2908029,0.00063441467,0.6867905,0.002066777,0.0098928455,0.0002854587,0.0000017747735,0.00015897729,0.009366293],"genre_scores_gemma":[0.9949049,0.00020330738,0.0035254126,0.000102304664,0.0008356236,0.00000588143,3.9363735e-7,0.00002176829,0.00040040593],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972583,0.00085916044,0.00054729555,0.00023335108,0.0006899855,0.0004119051],"domain_scores_gemma":[0.9972033,0.00086728495,0.00054360833,0.00052496884,0.00065693824,0.00020393363],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036107444,0.00020549262,0.00039602726,0.00034775786,0.0002669392,0.00023056265,0.0011650687,0.00011121652,0.00010587843],"category_scores_gemma":[0.0008820011,0.00017350323,0.0002422976,0.0007019403,0.0002038766,0.0031343282,0.00017650268,0.0005831366,0.000026085874],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015326004,0.00015578668,0.0001393359,0.000005504676,0.00006837049,0.0001665136,0.0002590793,0.000059091137,0.0034527273,0.97876036,0.00014065189,0.015259975],"study_design_scores_gemma":[0.0012673642,0.0008381757,0.00025653283,0.000029670115,0.000014155287,0.0015255458,0.00018835114,0.00007508971,0.005921655,0.9677757,0.021926444,0.0001813108],"about_ca_topic_score_codex":0.0000014112283,"about_ca_topic_score_gemma":8.883535e-7,"teacher_disagreement_score":0.704102,"about_ca_system_score_codex":0.00014384602,"about_ca_system_score_gemma":0.0001683321,"threshold_uncertainty_score":0.7075256},"labels":[],"label_agreement":null},{"id":"W2061275745","doi":"10.1016/j.jctb.2011.06.004","title":"On the maximum size of a minimal k-edge connected augmentation","year":2011,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Combinatorics; Simple (philosophy); Mathematics; Undirected graph; Graph; Generalization; Enhanced Data Rates for GSM Evolution; Connectivity; Vertex connectivity; Simple graph; Degree (music); Discrete mathematics; Computer science; Physics; Artificial intelligence","score_opus":0.025940067529460615,"score_gpt":0.2665166091183068,"score_spread":0.2405765415888462,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2061275745","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95074344,0.00013622217,0.03097588,0.00062822696,0.0058945953,0.0003771546,0.0000050828735,0.000046784164,0.011192639],"genre_scores_gemma":[0.9967762,0.00001630054,0.0028787307,0.0000847071,0.00011764267,0.000004713247,1.6353468e-7,0.000012265363,0.000109253444],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99770844,0.00080566684,0.0005320168,0.0001442043,0.00057283,0.00023682178],"domain_scores_gemma":[0.9960644,0.0022357223,0.00062357885,0.00045250572,0.0005262693,0.00009751241],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023257586,0.00014725233,0.0002898365,0.00014540533,0.00013307821,0.00004683816,0.001374095,0.00006409504,0.00025075488],"category_scores_gemma":[0.0016551107,0.000096795506,0.00016102119,0.00048152427,0.0003349953,0.0007768371,0.0001678258,0.0003375971,0.000008606065],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002797935,0.0001808206,0.000035284902,0.0000083049445,0.0000708086,0.00002635024,0.0021090352,0.000003476746,0.0043603526,0.9890061,0.0001769526,0.0012245479],"study_design_scores_gemma":[0.0011129061,0.0020545798,0.00045935035,0.000038853515,0.000011599155,0.000047571833,0.00054733286,0.000012185707,0.066576354,0.9287548,0.00029009784,0.00009439124],"about_ca_topic_score_codex":0.0000014390293,"about_ca_topic_score_gemma":2.819202e-7,"teacher_disagreement_score":0.062216,"about_ca_system_score_codex":0.0000452357,"about_ca_system_score_gemma":0.00013608365,"threshold_uncertainty_score":0.3947206},"labels":[],"label_agreement":null},{"id":"W2063442271","doi":"10.1016/j.jctb.2006.07.007","title":"A rooted map invariant, non-orientability and Jack symmetric functions","year":2006,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Combinatorial Mathematics","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; Invariant (physics); Symmetric function; Series (stratigraphy); Discrete mathematics; Pure mathematics; Mathematical physics","score_opus":0.012786354277761267,"score_gpt":0.2603290523515335,"score_spread":0.24754269807377222,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2063442271","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.91707814,0.00062081154,0.040602617,0.0008247233,0.026906518,0.0010064716,0.000029640882,0.00018585443,0.012745239],"genre_scores_gemma":[0.99002886,0.000014136057,0.007527216,0.000012971578,0.0013718823,0.000010719279,0.0000022127801,0.000059374393,0.0009726527],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99722195,0.00033932173,0.0012378184,0.0002338822,0.00060665846,0.00036034684],"domain_scores_gemma":[0.9959261,0.0016560737,0.0010781129,0.0004859548,0.0006756701,0.00017807719],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001797432,0.00033200326,0.000796215,0.0003099531,0.00025071276,0.00011200874,0.00035750162,0.00020544253,0.00007953873],"category_scores_gemma":[0.0027026057,0.0002863255,0.00021393738,0.0006820058,0.00021943155,0.00077679707,0.0001628487,0.0005360691,0.000010557308],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005213862,0.0005923204,0.00034463324,0.00014539353,0.00008987663,0.000031174575,0.00022566658,0.000005841845,0.00046702108,0.99466157,0.0027382518,0.00017689016],"study_design_scores_gemma":[0.0026262396,0.00070229004,0.00026544803,0.00009828697,0.00018062051,0.00019765779,0.0005619193,0.000016911583,0.0013586481,0.9886542,0.005061425,0.00027634038],"about_ca_topic_score_codex":0.0000076052147,"about_ca_topic_score_gemma":0.0000036129916,"teacher_disagreement_score":0.07295071,"about_ca_system_score_codex":0.00019748237,"about_ca_system_score_gemma":0.00015486509,"threshold_uncertainty_score":0.9999589},"labels":[],"label_agreement":null},{"id":"W2063812540","doi":"10.1016/j.jctb.2005.01.001","title":"Vertex colouring edge partitions","year":2005,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":109,"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; Multiset; Vertex (graph theory); Mathematics; Partition (number theory); Graph; Frequency partition of a graph; Neighbourhood (mathematics); Multiplicity (mathematics); Discrete mathematics; Graph power; Line graph; Geometry","score_opus":0.009189915335832617,"score_gpt":0.22500586900062178,"score_spread":0.21581595366478917,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2063812540","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8836869,0.0030471173,0.034359008,0.014369429,0.04368235,0.00031079992,0.0000040806503,0.0003855992,0.020154718],"genre_scores_gemma":[0.9926975,0.000047561676,0.0065505565,0.00023394222,0.00018043192,0.0000016843329,2.1372911e-7,0.000007761967,0.00028034972],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987762,0.00016197548,0.000438325,0.000114145456,0.00030156074,0.00020782386],"domain_scores_gemma":[0.9988322,0.00016918316,0.00028269374,0.00026843426,0.00030053107,0.0001469516],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011392519,0.00010847367,0.00021418872,0.00013296929,0.00019317571,0.00013466761,0.00058833655,0.000060011847,0.00005006082],"category_scores_gemma":[0.00017908057,0.00009083906,0.00012936752,0.00025925206,0.00009078553,0.0010706729,0.00010927328,0.00022819822,0.000032179225],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006653398,0.000113107744,0.000027567814,0.0000033527779,0.000028943723,0.000014745271,0.00038153987,0.00020193153,0.0010589707,0.99209094,0.0034808205,0.0025315252],"study_design_scores_gemma":[0.00085183315,0.00035215946,0.00005429943,0.000040596762,0.000014156492,0.00014029835,0.00004831447,0.000107835614,0.008116319,0.94836223,0.041799337,0.00011262062],"about_ca_topic_score_codex":6.28161e-7,"about_ca_topic_score_gemma":4.268971e-7,"teacher_disagreement_score":0.1090106,"about_ca_system_score_codex":0.00003892286,"about_ca_system_score_gemma":0.00011428802,"threshold_uncertainty_score":0.37043092},"labels":[],"label_agreement":null},{"id":"W2064861714","doi":"10.1006/jctb.2002.2127","title":"A Short Proof of Seymour's Characterization of the Matroids with the Max-Flow Min-Cut Property","year":2002,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","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":"Matroid; Property (philosophy); Mathematics; Characterization (materials science); Minor (academic); Combinatorics; Flow (mathematics); Binary number; Graphic matroid; Set (abstract data type); Discrete mathematics; Computer science; Arithmetic; Law; Physics; Philosophy; Geometry","score_opus":0.01270040050646915,"score_gpt":0.22484422133202656,"score_spread":0.2121438208255574,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2064861714","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.91869324,0.00028190122,0.06841832,0.0055359052,0.003562889,0.0012483915,0.000016145212,0.00003726906,0.002205933],"genre_scores_gemma":[0.9977434,0.000028610953,0.0009053301,0.00004135925,0.00018497152,0.000008845189,3.4546153e-7,0.000018961135,0.0010681724],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9973882,0.00070997805,0.00055601314,0.0001610402,0.0009266962,0.0002581043],"domain_scores_gemma":[0.99755937,0.00020179396,0.00066659006,0.0007152495,0.0007824046,0.000074573116],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016760139,0.00017968677,0.00038501754,0.000118546595,0.00018036267,0.0000706529,0.0019129801,0.000068277506,0.00003771798],"category_scores_gemma":[0.00017269365,0.00007589178,0.0001751305,0.0007641565,0.0005982553,0.0010134411,0.00027909703,0.0003932453,9.2769875e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0029738566,0.00074973796,0.0010016803,0.0001480221,0.0003500224,0.000036345402,0.00557303,0.00032412732,0.08084166,0.87708837,0.00040833934,0.030504785],"study_design_scores_gemma":[0.0030696373,0.005022225,0.0033462488,0.0005161821,0.00013076012,0.00084822666,0.00071126333,0.0019948618,0.49303696,0.47762924,0.013150718,0.00054367364],"about_ca_topic_score_codex":6.1760613e-7,"about_ca_topic_score_gemma":7.148323e-7,"teacher_disagreement_score":0.4121953,"about_ca_system_score_codex":0.000044462657,"about_ca_system_score_gemma":0.000111228335,"threshold_uncertainty_score":0.3554825},"labels":[],"label_agreement":null},{"id":"W2065002346","doi":"10.1016/s0095-8956(02)00009-6","title":"Cliques in dense GF(q)-representable matroids","year":2003,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":34,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Matroid; Integer (computer science); Combinatorics; Finite field; Mathematics; Simple (philosophy); Minor (academic); GF(2); Discrete mathematics; Graphic matroid; Computer science; Humanities","score_opus":0.012786337624303767,"score_gpt":0.28651307951657945,"score_spread":0.2737267418922757,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2065002346","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7632203,0.0035439625,0.16941388,0.0012753501,0.018246543,0.0006806271,0.000003412736,0.000184234,0.04343165],"genre_scores_gemma":[0.9887488,0.00015737834,0.010128886,0.000076491415,0.00018932272,0.0000053424596,1.727039e-7,0.000020481602,0.00067314657],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9967244,0.0013527194,0.00064703915,0.00022369098,0.0005950234,0.0004571248],"domain_scores_gemma":[0.9979411,0.0006235413,0.00032874124,0.0005574742,0.00036396677,0.00018517787],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0042711766,0.00018223867,0.00041282343,0.00039667008,0.00011304859,0.00017066173,0.0012208867,0.000096020805,0.00007894547],"category_scores_gemma":[0.0012239076,0.00015872852,0.00016054424,0.0007773798,0.00019067833,0.0020739855,0.0001887514,0.0005647316,0.000013453956],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004865984,0.00014183646,0.0011720904,0.000008910676,0.00002643485,0.00020016645,0.00037553557,0.00007692863,0.0013503778,0.99519676,0.00024992303,0.0007144277],"study_design_scores_gemma":[0.001276347,0.0005419147,0.00015188847,0.000037142116,0.0000044828985,0.00032741483,0.000262884,0.00001399041,0.025213506,0.9597164,0.012295954,0.00015807684],"about_ca_topic_score_codex":0.000002485596,"about_ca_topic_score_gemma":0.0000014215505,"teacher_disagreement_score":0.22552843,"about_ca_system_score_codex":0.00012490516,"about_ca_system_score_gemma":0.00025308065,"threshold_uncertainty_score":0.64727616},"labels":[],"label_agreement":null},{"id":"W2065456078","doi":"10.1016/s0095-8956(03)00071-6","title":"The matrix of chromatic joins and the Temperley–Lieb algebra","year":2003,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Molecular spectroscopy and chirality","field":"Chemistry","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":"Joins; Recursion (computer science); Algebra over a field; Generalization; Mathematics; Context (archaeology); Matrix (chemical analysis); Inverse; Pure mathematics; Chromatic scale; Combinatorics; Computer science; Algorithm; Mathematical analysis; Geometry","score_opus":0.0034403974751530406,"score_gpt":0.22733583966180956,"score_spread":0.22389544218665652,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2065456078","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97602946,0.0032886348,0.00006676572,0.0005357813,0.0014680498,0.00008194934,0.0000029298885,0.000009575221,0.018516848],"genre_scores_gemma":[0.9985537,0.00042819834,0.00007866658,0.0000329458,0.00022003803,0.0000025789418,2.6789655e-7,0.00001426209,0.0006693721],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984166,0.00038988408,0.00059099344,0.00008157315,0.00034365532,0.0001772869],"domain_scores_gemma":[0.99828863,0.0005625083,0.0006223645,0.00033476413,0.00012524317,0.00006648354],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020044446,0.00014391448,0.00036124405,0.000020099393,0.00027600865,0.00008230327,0.00034600828,0.00008245629,0.00021653353],"category_scores_gemma":[0.0007883514,0.00007432625,0.00019803958,0.000088574736,0.0006171132,0.00013002072,0.00004493561,0.0003423859,0.0000012291387],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010822531,0.00005377952,0.0001001697,0.00005796347,0.00015577197,0.000008276878,0.0004751352,0.0000011408634,0.018124903,0.9796961,0.000154601,0.00008990228],"study_design_scores_gemma":[0.002429901,0.00013402579,0.000045288652,0.000055099976,0.00009916261,0.00017769884,0.0008664312,0.000001663379,0.19172542,0.7912851,0.0130917225,0.00008846477],"about_ca_topic_score_codex":0.0000022682561,"about_ca_topic_score_gemma":8.004334e-7,"teacher_disagreement_score":0.18841098,"about_ca_system_score_codex":0.000029078286,"about_ca_system_score_gemma":0.00011471016,"threshold_uncertainty_score":0.30309367},"labels":[],"label_agreement":null},{"id":"W2065484772","doi":"10.1016/j.jctb.2004.11.004","title":"Random cubic graphs are not homomorphic to the cycle of size 7","year":2005,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Topology and Set Theory","field":"Mathematics","cited_by":21,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Homomorphism; Homomorphic encryption; Cubic graph; Mathematics; Combinatorics; Discrete mathematics; Foster graph; Random graph; Odd graph; Pancyclic graph; Graph; Computer science; Pathwidth; Line graph; Graph power; Voltage graph","score_opus":0.01449569199127126,"score_gpt":0.2782821518972708,"score_spread":0.2637864599059995,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2065484772","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98413986,0.00052474136,0.0026405458,0.0050565004,0.005316154,0.0003633126,0.000014880637,0.00004924775,0.001894734],"genre_scores_gemma":[0.9963839,0.000070661365,0.0018042071,0.00034174728,0.0008059358,0.000005525826,1.6228579e-7,0.00003423022,0.00055360363],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99785745,0.000647624,0.000777628,0.00011444416,0.00035467747,0.00024819953],"domain_scores_gemma":[0.9949645,0.0033175042,0.0008798232,0.0003880173,0.00033588352,0.000114290335],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027038718,0.00019373657,0.0006584712,0.00009992575,0.00019435739,0.000017889193,0.0005721328,0.00013092278,0.0002937443],"category_scores_gemma":[0.0034362923,0.00012647905,0.0002985805,0.00022551506,0.0003836111,0.00029886095,0.00008388856,0.00044677302,0.000016781383],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0068201823,0.0002278721,0.00003346932,0.000025168647,0.00015469689,0.000019664929,0.0014724405,0.00015738259,0.0010359292,0.9880948,0.0013103251,0.00064804824],"study_design_scores_gemma":[0.0030755855,0.000433351,0.000083943145,0.00007439842,0.0001079598,0.00014500823,0.0011161495,0.0000018436187,0.015049372,0.967834,0.011941991,0.00013638564],"about_ca_topic_score_codex":5.675222e-7,"about_ca_topic_score_gemma":0.0000040750915,"teacher_disagreement_score":0.020260807,"about_ca_system_score_codex":0.000038422524,"about_ca_system_score_gemma":0.000067754314,"threshold_uncertainty_score":0.51576656},"labels":[],"label_agreement":null},{"id":"W2065615449","doi":"10.1016/j.jctb.2010.10.004","title":"Twins of rayless graphs","year":2010,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Mathematics; Combinatorics; Cograph; Induced subgraph isomorphism problem; Graph; Discrete mathematics; Chordal graph; 1-planar graph; Line graph; Voltage graph","score_opus":0.010228694232689501,"score_gpt":0.2727172146198766,"score_spread":0.26248852038718706,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2065615449","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9174164,0.00025430537,0.054803006,0.0005171201,0.020977585,0.00021288196,0.0000047065864,0.00006187882,0.0057521113],"genre_scores_gemma":[0.99154794,0.000036004003,0.007948631,0.000028804468,0.00028926722,0.0000017628311,1.9098832e-7,0.000014688464,0.00013269349],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99790627,0.0003532797,0.00060607446,0.00016032136,0.00067865546,0.000295381],"domain_scores_gemma":[0.99720263,0.0005902056,0.0005982819,0.00064095116,0.00077682314,0.0001911067],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028595969,0.00015750492,0.00041344904,0.0003585812,0.00011296914,0.00007632827,0.0020417126,0.00011010078,0.00006776407],"category_scores_gemma":[0.00070571125,0.0001281978,0.00024590886,0.0006686739,0.00046216187,0.0013983669,0.0002757341,0.00076435466,0.0000045624083],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00044494445,0.00012863363,0.00021993737,0.000012589505,0.0000480075,0.000032933684,0.0004088415,0.0000075464764,0.037046183,0.95805985,0.00009769056,0.003492818],"study_design_scores_gemma":[0.0009151306,0.0005956357,0.00026403528,0.000020838523,0.000008478386,0.00015460454,0.000100360354,0.000009432612,0.07435685,0.9182505,0.0052049654,0.0001191907],"about_ca_topic_score_codex":9.460789e-7,"about_ca_topic_score_gemma":9.217094e-7,"teacher_disagreement_score":0.07413155,"about_ca_system_score_codex":0.00001706327,"about_ca_system_score_gemma":0.00020496779,"threshold_uncertainty_score":0.5227755},"labels":[],"label_agreement":null},{"id":"W2066522339","doi":"10.1006/jctb.2000.2003","title":"Chromatic Number and the 2-Rank of a Graph","year":2001,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":35,"is_retracted":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":"Chromatic scale; Combinatorics; Graph; Rank (graph theory); Friendship graph; Adjacency matrix; Mathematics; Windmill graph; Discrete mathematics; Line graph; Graph power","score_opus":0.006015949863867088,"score_gpt":0.2158930395992454,"score_spread":0.20987708973537833,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2066522339","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9806479,0.001434926,0.006948226,0.0023015032,0.0050519514,0.00014495147,5.060138e-7,0.00003079852,0.0034391899],"genre_scores_gemma":[0.99786186,0.0002651983,0.0016444082,0.000101782236,0.00004183247,0.0000011406815,5.6210595e-8,0.000005215292,0.000078485355],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986598,0.00033154406,0.00047384237,0.00008521704,0.00031991536,0.00012971614],"domain_scores_gemma":[0.9985287,0.00042619856,0.00045416737,0.00027558152,0.0002469716,0.0000683605],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022459386,0.00009841083,0.00031279845,0.000075553486,0.00010912081,0.00007326641,0.0005131003,0.000044120363,0.000022951395],"category_scores_gemma":[0.0002207252,0.000056760233,0.00012432101,0.00034105818,0.00040109456,0.00044637558,0.000104038874,0.00015990983,0.0000022451968],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00039100638,0.000050261548,0.00017448515,0.000011072231,0.000054462387,0.000012761528,0.0010032008,0.000008491044,0.00033548273,0.9969829,0.00023048017,0.00074544037],"study_design_scores_gemma":[0.0025956766,0.00020466448,0.0001238794,0.000059539478,0.000026984393,0.00050776405,0.00011953211,0.000053482014,0.00086689857,0.9942819,0.001093673,0.000066028915],"about_ca_topic_score_codex":0.000004293792,"about_ca_topic_score_gemma":2.1305159e-7,"teacher_disagreement_score":0.017213933,"about_ca_system_score_codex":0.0000059157414,"about_ca_system_score_gemma":0.00005057125,"threshold_uncertainty_score":0.23146151},"labels":[],"label_agreement":null},{"id":"W2067309928","doi":"10.1016/j.jctb.2003.12.005","title":"Inequivalent representations of matroids having no U3,6-minor","year":2004,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Matroid; Mathematics; Minor (academic); Combinatorics; Prime (order theory); Prime power; Graphic matroid; Discrete mathematics; Humanities","score_opus":0.015323233040096635,"score_gpt":0.29648798703544577,"score_spread":0.2811647539953491,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2067309928","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.62027013,0.00094664353,0.34885576,0.0018187604,0.016481737,0.0005486186,0.000011118852,0.0001270374,0.010940219],"genre_scores_gemma":[0.97707504,0.0000746212,0.021992521,0.00003149528,0.00043074606,0.000004306334,5.4514555e-7,0.000018240022,0.0003725124],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976422,0.00033610562,0.0007595322,0.00019235314,0.00076138607,0.00030840744],"domain_scores_gemma":[0.9972458,0.00039497187,0.00064297597,0.00060559285,0.00094260427,0.00016806247],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018211415,0.00016104098,0.00038923803,0.0003223174,0.00014923775,0.00009257689,0.0014216161,0.00007005034,0.000053087235],"category_scores_gemma":[0.00095377915,0.00014035292,0.0002332206,0.00058125344,0.00028662183,0.001707458,0.00035125166,0.00037748626,0.000014245215],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00048820366,0.00017957536,0.00017092655,0.000024800021,0.00006059735,0.000055787485,0.00072392443,0.00055339,0.012322554,0.9845208,0.000080892554,0.00081853627],"study_design_scores_gemma":[0.0016160803,0.0010182941,0.00031261324,0.00008711828,0.0000148389945,0.0001476872,0.00024988994,0.000011199055,0.03949162,0.9557051,0.0012127177,0.00013286505],"about_ca_topic_score_codex":0.0000039889806,"about_ca_topic_score_gemma":4.9087134e-7,"teacher_disagreement_score":0.3568049,"about_ca_system_score_codex":0.00011529512,"about_ca_system_score_gemma":0.00029538636,"threshold_uncertainty_score":0.5723426},"labels":[],"label_agreement":null},{"id":"W2068457180","doi":"10.1006/jctb.2000.1996","title":"Cycle Decompositions of K and K−I","year":2001,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":261,"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":"Graph; Mathematics; Combinatorics; Order (exchange); Complete graph; Economics","score_opus":0.004295824774612166,"score_gpt":0.20109742396501387,"score_spread":0.19680159919040172,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2068457180","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9880575,0.0008902439,0.000630157,0.000031792926,0.0027221476,0.000041202085,0.0000026435207,0.000023403067,0.007600932],"genre_scores_gemma":[0.9994337,0.0001932185,0.00008987056,0.0000064267706,0.00022500794,8.276225e-7,3.0609266e-7,0.000011647517,0.00003899152],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999345,0.000087282715,0.00032931054,0.00003573526,0.00010742064,0.00009524781],"domain_scores_gemma":[0.9995456,0.000109905945,0.00010738426,0.00009070192,0.000081008475,0.00006541278],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004742698,0.000080928956,0.00022581889,0.000090301124,0.00004419679,0.000016409353,0.00010664944,0.000050496754,0.000053222022],"category_scores_gemma":[0.000028890374,0.00007171052,0.0000746821,0.00011693091,0.00007924925,0.00025875305,0.000012176978,0.000117249925,0.0000013625036],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00039369473,0.000050340717,0.00036476197,0.00004434268,0.00012837346,0.000026303398,0.000551719,0.00071449066,0.010307518,0.9861447,0.00027036382,0.001003399],"study_design_scores_gemma":[0.00090794853,0.00034547193,0.00048042604,0.000074738586,0.000044590834,0.00059210404,0.00049870345,0.000044510332,0.009965682,0.9741711,0.012755937,0.000118781056],"about_ca_topic_score_codex":5.017948e-7,"about_ca_topic_score_gemma":2.672277e-7,"teacher_disagreement_score":0.012485573,"about_ca_system_score_codex":0.00001187963,"about_ca_system_score_gemma":0.000009388163,"threshold_uncertainty_score":0.29242703},"labels":[],"label_agreement":null},{"id":"W2074859673","doi":"10.1006/jctb.2002.2130","title":"Branch-Width and Rota's Conjecture","year":2002,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":30,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Matroid; Conjecture; Finite field; Integer (computer science); Combinatorics; Mathematics; Field (mathematics); Finite set; Discrete mathematics; Pure mathematics; Computer science; Mathematical analysis","score_opus":0.011884428037992422,"score_gpt":0.24380569174866168,"score_spread":0.23192126371066926,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2074859673","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5280987,0.02049893,0.37242305,0.012759652,0.03181093,0.0011208702,0.000013443088,0.00042157603,0.032852825],"genre_scores_gemma":[0.99513865,0.00029312776,0.0033559178,0.00013224636,0.00045168557,0.000002010913,1.0972339e-7,0.000015365606,0.00061089086],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99826264,0.00040842872,0.00037558546,0.00018163738,0.0004729013,0.00029880978],"domain_scores_gemma":[0.99842346,0.0004678391,0.00028697753,0.00037187073,0.00024353163,0.00020631016],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012269632,0.00016683608,0.0003337053,0.0001905132,0.00017526932,0.00018637207,0.00090687425,0.00008936897,0.00015115947],"category_scores_gemma":[0.00039629222,0.00013274036,0.00010971737,0.00038110843,0.00027532314,0.0014287349,0.00021739789,0.00046562677,0.000010509723],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017651681,0.000059804875,0.000076601566,0.000010534311,0.000042431457,0.000075059535,0.00062446523,0.000014647885,0.000716248,0.97593635,0.00060649746,0.021660848],"study_design_scores_gemma":[0.0012165741,0.00079390727,0.000104955485,0.000028152175,0.000007833305,0.00057647884,0.000044384433,0.00006611648,0.0031879987,0.97289866,0.020927122,0.00014782134],"about_ca_topic_score_codex":3.2560047e-7,"about_ca_topic_score_gemma":1.9096338e-7,"teacher_disagreement_score":0.46703994,"about_ca_system_score_codex":0.000034838347,"about_ca_system_score_gemma":0.00003669752,"threshold_uncertainty_score":0.54129946},"labels":[],"label_agreement":null},{"id":"W2076011470","doi":"10.1006/jctb.1999.1938","title":"The Maximum Size of 3-Uniform Hypergraphs Not Containing a Fano Plane","year":2000,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":80,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada; Hungarian Science Foundation; Hungarian Scientific Research Fund; National Security Agency; National Science Foundation","keywords":"Fano plane; Projective plane; Conjecture; Plane (geometry); Mathematics; Combinatorics; Constant (computer programming); Set (abstract data type); Order (exchange); Discrete mathematics; Geometry; Computer science","score_opus":0.012225524026858696,"score_gpt":0.25182557406397077,"score_spread":0.23960005003711207,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2076011470","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.973737,0.00034063729,0.000033226755,0.00021674832,0.0044505983,0.00016671729,0.000013543891,0.000025150921,0.021016393],"genre_scores_gemma":[0.99758554,0.00032660476,0.000696117,0.000077149554,0.0005452199,0.0000022921272,4.0336008e-7,0.000031347536,0.0007353119],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976677,0.00037734,0.0009820182,0.0001111762,0.0005518879,0.0003099172],"domain_scores_gemma":[0.9947706,0.003669848,0.00076412683,0.00040700662,0.00027987402,0.00010856914],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026245671,0.00022979354,0.00059397484,0.0000762627,0.0004673243,0.000058269332,0.000701185,0.0001465803,0.0005480182],"category_scores_gemma":[0.0010968935,0.00013787535,0.00034644033,0.00018425514,0.0004888367,0.00027888647,0.000071974726,0.00045947215,0.0000016442847],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0072864136,0.00006887874,0.000059844795,0.000029204823,0.00026293585,0.00002738498,0.0016661197,0.0000038725175,0.00041340076,0.9837077,0.00034103176,0.0061331787],"study_design_scores_gemma":[0.0016402865,0.0010654042,0.0001210309,0.00007799426,0.00010082396,0.00024973688,0.0014521921,0.000001103935,0.0042350795,0.9735577,0.017340414,0.00015825062],"about_ca_topic_score_codex":0.000002060079,"about_ca_topic_score_gemma":0.0000013623815,"teacher_disagreement_score":0.023848569,"about_ca_system_score_codex":0.000031704214,"about_ca_system_score_gemma":0.00008689216,"threshold_uncertainty_score":0.6000415},"labels":[],"label_agreement":null},{"id":"W2079618965","doi":"10.1016/s0095-8956(02)00046-1","title":"On the excluded minors for the matroids of branch-width k","year":2003,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","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 Waterloo","funders":"","keywords":"Matroid; Combinatorics; Class (philosophy); Mathematics; Computer science; Artificial intelligence","score_opus":0.018968047861716613,"score_gpt":0.27656494701472645,"score_spread":0.2575968991530098,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2079618965","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23103474,0.0021738748,0.7260415,0.006776196,0.021854602,0.0017756781,0.000015050242,0.00006901582,0.010259322],"genre_scores_gemma":[0.9969416,0.000053883843,0.0021454452,0.00017001279,0.00020846703,0.000015142106,1.1034703e-7,0.00001784365,0.00044747395],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975923,0.00081738783,0.0005097806,0.00014589907,0.00062472146,0.00030993487],"domain_scores_gemma":[0.99258566,0.005627857,0.0005169097,0.00070444256,0.0004833715,0.00008174829],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0050617666,0.00016520896,0.00031411523,0.0001201945,0.00031428007,0.000097536315,0.0019311083,0.00006200362,0.000060535112],"category_scores_gemma":[0.002346793,0.00008524781,0.00029652705,0.0004599555,0.00040940507,0.0004831013,0.00010425886,0.00037285732,0.0000032637197],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008891834,0.00008365755,0.000013864417,0.0000109284865,0.00008441251,0.0000031705035,0.00041415563,0.000091585156,0.0011923066,0.99425983,0.0009818277,0.0019750562],"study_design_scores_gemma":[0.0010039925,0.0010745617,0.000045890043,0.000028609162,0.000015830765,0.000047671052,0.00021988993,0.000024083698,0.034928016,0.9508985,0.011621098,0.00009182242],"about_ca_topic_score_codex":4.3092703e-7,"about_ca_topic_score_gemma":3.136364e-7,"teacher_disagreement_score":0.7659069,"about_ca_system_score_codex":0.000040547795,"about_ca_system_score_gemma":0.00016783508,"threshold_uncertainty_score":0.3588512},"labels":[],"label_agreement":null},{"id":"W2081749768","doi":"10.1016/j.jctb.2014.07.005","title":"Graph layouts via layered separators","year":2014,"lang":"en","type":"preprint","venue":"Journal of Combinatorial Theory Series B","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Planar graph; Vertex (graph theory); Queue; Book embedding; Discrete mathematics; Graph; Outerplanar graph; Partition (number theory); Line graph; Computer science; Voltage graph; Pathwidth","score_opus":0.00949178050449383,"score_gpt":0.24723880492290773,"score_spread":0.2377470244184139,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2081749768","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0549991,0.0007525885,0.8944333,0.00061085925,0.047299266,0.00021647294,0.0000058724027,0.0000875282,0.0015950244],"genre_scores_gemma":[0.9865125,0.00007199481,0.010047121,0.0001980027,0.0028682998,0.0000063075086,0.000009917333,0.000022375127,0.00026352718],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9969323,0.0007329142,0.0009360702,0.00033826253,0.0007949748,0.0002654744],"domain_scores_gemma":[0.99654263,0.000349525,0.0013609835,0.00060152885,0.00093233056,0.00021301808],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0024052034,0.00034466115,0.00067078636,0.00046327547,0.00016952498,0.00039414005,0.0016128336,0.0003157386,0.000035031284],"category_scores_gemma":[0.00026332145,0.0003124347,0.0004281839,0.00041071678,0.00008535433,0.0007132642,0.00072539557,0.0008304388,0.000015679418],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003374002,0.00015383928,0.000028789507,0.00006275427,0.00024202932,0.00004416795,0.00057147694,0.023489831,0.00041216714,0.9650147,0.003336574,0.006306295],"study_design_scores_gemma":[0.0007610583,0.00048135943,0.000110841116,0.000087377455,0.000042758275,0.00014438172,0.000015428686,0.0014327733,0.0033695726,0.97357726,0.019646073,0.00033109295],"about_ca_topic_score_codex":0.0000018776046,"about_ca_topic_score_gemma":4.6534385e-7,"teacher_disagreement_score":0.93151337,"about_ca_system_score_codex":0.000092933384,"about_ca_system_score_gemma":0.00047717837,"threshold_uncertainty_score":0.99993277},"labels":[],"label_agreement":null},{"id":"W2082255109","doi":"10.1016/j.jctb.2005.02.001","title":"Aztec diamonds and digraphs, and Hankel determinants of Schröder numbers","year":2005,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":49,"is_retracted":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":"Invertible matrix; Mathematics; Combinatorics; Order (exchange); Matrix (chemical analysis); Generating function; Hankel matrix; Fraction (chemistry); Function (biology); Unit (ring theory); Sign (mathematics); Pure mathematics; Mathematical analysis","score_opus":0.015493770675863766,"score_gpt":0.29329581254535725,"score_spread":0.2778020418694935,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2082255109","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9954438,0.0008248008,0.00043271977,0.00010397979,0.0020644462,0.00018761269,0.000005172182,0.000025699312,0.0009117366],"genre_scores_gemma":[0.98817134,0.00037223386,0.010748581,0.000017482716,0.00045038245,0.0000034689822,1.81227e-7,0.000046388708,0.0001899319],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979294,0.00018192927,0.0010173032,0.00015757285,0.00044807326,0.0002657248],"domain_scores_gemma":[0.9969316,0.0011117081,0.0011298525,0.00030360583,0.00033978865,0.00018340358],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012557731,0.0002716084,0.00082957867,0.00014537094,0.000112361246,0.000051181298,0.0002809035,0.00016453714,0.000031286327],"category_scores_gemma":[0.0016265269,0.00022811089,0.00013565505,0.00018624958,0.00040912232,0.00080576807,0.00014666772,0.00031738164,9.4903254e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006581455,0.0002640221,0.0012990892,0.00022807051,0.00011159958,0.00002012268,0.0016026744,0.0000011482622,0.0010559764,0.9907863,0.0002510905,0.0037217443],"study_design_scores_gemma":[0.0022657102,0.00060272275,0.0001456361,0.00024044565,0.00013683733,0.00026737357,0.0006370847,0.000011546226,0.015789306,0.97764474,0.0020344686,0.00022414754],"about_ca_topic_score_codex":0.0000013029407,"about_ca_topic_score_gemma":0.000003280251,"teacher_disagreement_score":0.014733329,"about_ca_system_score_codex":0.00004333704,"about_ca_system_score_gemma":0.00007146473,"threshold_uncertainty_score":0.9302092},"labels":[],"label_agreement":null},{"id":"W2082989065","doi":"10.1016/j.jctb.2004.08.002","title":"Professor W.T. Tutte","year":2004,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"History and advancements in chemistry","field":"Chemistry","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":"Humanities; Art","score_opus":0.008149775772663405,"score_gpt":0.24784670914398135,"score_spread":0.23969693337131795,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2082989065","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8935756,0.00071017316,0.00030570524,0.00046642925,0.009759222,0.000051605857,0.0000110827,0.00006116639,0.09505899],"genre_scores_gemma":[0.98982406,0.00005218471,0.00062019925,0.00007095761,0.0018437211,0.0000031018344,0.000002390704,0.000026380749,0.007556994],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988286,0.00002829159,0.0004866428,0.00011306181,0.00033365015,0.000209743],"domain_scores_gemma":[0.9989177,0.000076341705,0.000468577,0.00023579379,0.00018048265,0.00012108743],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0004387905,0.00016055536,0.00028331965,0.0000335515,0.00014869761,0.000025360303,0.00038378738,0.00012150149,0.0012919889],"category_scores_gemma":[0.00028593876,0.00014236663,0.00014919699,0.00007820358,0.00017462776,0.00043647265,0.000049079277,0.00045178708,0.000013893604],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0025421008,0.0005814682,0.000080156264,0.0002214942,0.00021140712,0.00029365203,0.0011093927,0.0000898822,0.3449033,0.6473527,0.0010667621,0.0015476971],"study_design_scores_gemma":[0.0018018811,0.00008455399,0.0000016326514,0.0001197311,0.000028339571,0.00012857125,0.00041410438,3.0001264e-8,0.3971128,0.43418425,0.16599758,0.00012651704],"about_ca_topic_score_codex":2.6858362e-7,"about_ca_topic_score_gemma":9.391593e-8,"teacher_disagreement_score":0.21316846,"about_ca_system_score_codex":0.00022083054,"about_ca_system_score_gemma":0.0002053457,"threshold_uncertainty_score":0.999621},"labels":[],"label_agreement":null},{"id":"W2083735231","doi":"10.1016/j.jctb.2009.11.003","title":"Crossing-critical graphs with large maximum degree","year":2009,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Conjecture; Bounded function; Degree (music); Mathematics; Combinatorics; Discrete mathematics; Mathematical analysis; Physics","score_opus":0.01717054544245858,"score_gpt":0.29570413759398356,"score_spread":0.27853359215152496,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2083735231","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11107399,0.0014251119,0.86373657,0.005361647,0.007945212,0.00034536328,0.00000777709,0.00023466517,0.009869664],"genre_scores_gemma":[0.97914773,0.00002227244,0.020110836,0.00024873804,0.00031462157,0.0000016449684,3.2264487e-7,0.000017321961,0.00013651638],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972034,0.00047591998,0.00051444327,0.00025998062,0.00091191,0.0006343571],"domain_scores_gemma":[0.9974525,0.0005722164,0.000277209,0.00059111376,0.0007799866,0.00032696564],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023970439,0.00024080844,0.00043833218,0.00030640844,0.000505934,0.0005945812,0.0015902127,0.00010676838,0.000043766016],"category_scores_gemma":[0.0006989684,0.00017793555,0.00018773151,0.0007953747,0.00059044047,0.0024812194,0.00015109094,0.0006820685,0.000008557967],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015643879,0.00026552138,0.000084300744,0.000007783582,0.000034596105,0.00037034994,0.00041209738,0.00000731464,0.0005666815,0.98860186,0.00018219082,0.007902893],"study_design_scores_gemma":[0.0017473167,0.003126809,0.00048337472,0.000066961635,0.000014248312,0.00071712804,0.00012669525,0.000017468574,0.0032323669,0.9832772,0.0069668065,0.00022359533],"about_ca_topic_score_codex":2.7658183e-7,"about_ca_topic_score_gemma":4.5466624e-7,"teacher_disagreement_score":0.8680737,"about_ca_system_score_codex":0.00006210839,"about_ca_system_score_gemma":0.00031003467,"threshold_uncertainty_score":0.7256001},"labels":[],"label_agreement":null},{"id":"W2088312182","doi":"10.1016/j.jctb.2008.08.004","title":"The Erdös–Pósa property for matroid circuits","year":2008,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Matroid; Disjoint sets; Combinatorics; Rank (graph theory); Graphic matroid; Mathematics; Matroid partitioning; Constant (computer programming); Bounded function; Discrete mathematics; Computer science; Mathematical analysis","score_opus":0.03265438713067384,"score_gpt":0.2751685194414888,"score_spread":0.24251413231081495,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2088312182","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9115217,0.0026135463,0.004608215,0.0019230534,0.051325236,0.0017412893,0.00004246652,0.00015683654,0.026067683],"genre_scores_gemma":[0.99292606,0.00027225123,0.0009994076,0.000085648695,0.0020823462,0.000014599623,5.962347e-7,0.000049823502,0.0035692952],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99807525,0.00032437666,0.000721024,0.00012067682,0.00043397426,0.00032470934],"domain_scores_gemma":[0.996464,0.0018474658,0.0006436129,0.0003805755,0.00055300567,0.000111326626],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023266526,0.00021022589,0.00043710534,0.00006841396,0.0012550482,0.000060565515,0.0006828363,0.00012458503,0.000041338284],"category_scores_gemma":[0.0018433781,0.00009888888,0.00037592047,0.00012555024,0.0004622248,0.00031639313,0.00009298916,0.00034827844,0.0000014434949],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012595055,0.00006753155,0.000030568706,0.00003612585,0.0001685359,0.000020860054,0.0015422946,9.62801e-7,0.0002607785,0.9851287,0.009903983,0.0015801813],"study_design_scores_gemma":[0.0012462537,0.00062664197,0.00003536714,0.000031168383,0.00006162518,0.00062194513,0.00046462717,0.0000013485975,0.0024160799,0.8893031,0.105048224,0.00014363368],"about_ca_topic_score_codex":3.6733582e-7,"about_ca_topic_score_gemma":4.0329465e-7,"teacher_disagreement_score":0.09582559,"about_ca_system_score_codex":0.000052193664,"about_ca_system_score_gemma":0.00014539632,"threshold_uncertainty_score":0.9652943},"labels":[],"label_agreement":null},{"id":"W2091166220","doi":"10.1016/j.jctb.2007.02.006","title":"Large independent sets in regular graphs of large girth","year":2007,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":45,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Girth (graph theory); Combinatorics; Discrete mathematics; Independence (probability theory); Differential equation; Independent set; Strongly regular graph; Graph; Statistics; Pathwidth; Mathematical analysis; Line graph","score_opus":0.011854564236731115,"score_gpt":0.2906598480540324,"score_spread":0.2788052838173013,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2091166220","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9907446,0.00039835653,0.00073802896,0.00003570052,0.0051360265,0.00016592767,0.000016913149,0.000015710257,0.0027487706],"genre_scores_gemma":[0.998706,0.00007799448,0.00075297523,0.000047809583,0.00026106442,9.102031e-7,0.0000011196688,0.000033147295,0.000119005446],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970094,0.00041970186,0.0012534552,0.00014665078,0.00070959167,0.0004611903],"domain_scores_gemma":[0.9973812,0.00075602654,0.0009936376,0.00038902095,0.00034370535,0.00013640674],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008898954,0.00023367528,0.00070210366,0.00046473657,0.00013482622,0.000020368567,0.0005294762,0.00024820757,0.00018201269],"category_scores_gemma":[0.0006707676,0.00018394699,0.0003240693,0.00038970643,0.00015892902,0.0003515452,0.00013603862,0.0006042636,6.531975e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0022472618,0.0004178401,0.0025968824,0.00008305936,0.00013664663,0.00014289338,0.004189818,0.0000010602533,0.00048174808,0.9892388,0.00028387655,0.00018011432],"study_design_scores_gemma":[0.0034414004,0.0004755576,0.0022363784,0.00012554995,0.00005408105,0.0001134333,0.002582171,6.601508e-7,0.009074561,0.9784443,0.003269552,0.00018238426],"about_ca_topic_score_codex":9.107331e-7,"about_ca_topic_score_gemma":0.000011331701,"teacher_disagreement_score":0.010794529,"about_ca_system_score_codex":0.0000638493,"about_ca_system_score_gemma":0.000070109745,"threshold_uncertainty_score":0.750114},"labels":[],"label_agreement":null},{"id":"W2093635261","doi":"10.1016/j.jctb.2014.06.005","title":"The inducibility of blow-up graphs","year":2014,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":37,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada; Fonds Québécois de la Recherche sur la Nature et les Technologies","keywords":"Combinatorics; Vertex (graph theory); Mathematics; Graph; Discrete mathematics","score_opus":0.016463360356692252,"score_gpt":0.2747567065996173,"score_spread":0.25829334624292505,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2093635261","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9818374,0.00021067659,0.00019543285,0.00014767496,0.012938316,0.000115319075,0.0000028668235,0.000015176363,0.0045371307],"genre_scores_gemma":[0.99881077,0.00006183171,0.00038010723,0.000028281283,0.0005093608,0.0000013322285,1.594637e-7,0.000019659943,0.00018849637],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99738,0.0009196979,0.0008840107,0.00011609992,0.00048444944,0.0002157338],"domain_scores_gemma":[0.99473447,0.0030545052,0.00098619,0.0006227424,0.0005108845,0.00009122339],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0070151156,0.00017157725,0.00048541982,0.00008489394,0.00036720058,0.00003915505,0.00070130546,0.00013145899,0.00008821542],"category_scores_gemma":[0.0041397945,0.00009732579,0.0003418435,0.00018552181,0.0006286783,0.00021420006,0.00013178684,0.0004250525,5.13417e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012013662,0.00006420742,0.000226881,0.000036628582,0.00013695851,0.0000014330259,0.0010247804,6.1210613e-7,0.00030397397,0.9931528,0.0007087898,0.003141557],"study_design_scores_gemma":[0.0009443925,0.0005496603,0.00031972738,0.000041100957,0.00007783648,0.000041743268,0.0005030872,0.0000013134236,0.007922568,0.9811414,0.008351223,0.0001059708],"about_ca_topic_score_codex":8.4958936e-7,"about_ca_topic_score_gemma":9.025756e-7,"teacher_disagreement_score":0.016973365,"about_ca_system_score_codex":0.00002238342,"about_ca_system_score_gemma":0.0000622679,"threshold_uncertainty_score":0.49560195},"labels":[],"label_agreement":null},{"id":"W2094202793","doi":"10.1016/j.jctb.2004.08.003","title":"The perfect matching polytope and solid bricks","year":2004,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Polytope; Combinatorics; Mathematics; Matching (statistics); Perfect graph theorem; Birkhoff polytope; Convex hull; Convex polytope; Degree (music); Regular polygon; Discrete mathematics; Graph; Convex set; Line graph; Convex optimization; Geometry; Physics","score_opus":0.008220812949512369,"score_gpt":0.2701819619439301,"score_spread":0.26196114899441775,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2094202793","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.69021446,0.0049155853,0.27983344,0.006384028,0.013448854,0.00039636152,0.0000019431675,0.00012141093,0.0046839267],"genre_scores_gemma":[0.9965603,0.000345308,0.0024332139,0.00008090173,0.00038790703,0.0000020218324,6.334675e-8,0.000014150357,0.00017618715],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99823046,0.0003867634,0.00038702012,0.00015432539,0.0004969357,0.00034448435],"domain_scores_gemma":[0.99818295,0.00072570425,0.00029246978,0.00038348505,0.00025369044,0.00016172606],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030056,0.00014865922,0.00025232576,0.00011424918,0.0006073418,0.00041122208,0.0012183042,0.000056376794,0.000005103502],"category_scores_gemma":[0.00042441822,0.000096329604,0.00011487385,0.00031286737,0.00034192187,0.0013469843,0.00035892148,0.0005031619,0.0000044256694],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00036181396,0.000032293803,0.000019376736,0.0000047332724,0.00004038067,0.000054493994,0.0009776383,0.000088854445,0.0015507671,0.98930675,0.000024194856,0.007538692],"study_design_scores_gemma":[0.0009794415,0.0006469293,0.0001349165,0.00003592668,0.000006708223,0.0005707818,0.00035844586,0.0000063911507,0.0062198127,0.9873368,0.0035900315,0.00011378131],"about_ca_topic_score_codex":0.0000023483,"about_ca_topic_score_gemma":9.3323905e-7,"teacher_disagreement_score":0.3063458,"about_ca_system_score_codex":0.00007201483,"about_ca_system_score_gemma":0.00018684378,"threshold_uncertainty_score":0.46712437},"labels":[],"label_agreement":null},{"id":"W2094667324","doi":"10.1006/jctb.2001.2051","title":"A Characterization of Weakly Bipartite Graphs","year":2001,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":53,"is_retracted":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":"Bipartite graph; Combinatorics; Mathematics; Discrete mathematics; Conjecture; Minor (academic); Strong perfect graph theorem; Robertson–Seymour theorem; Edge-transitive graph; Graph; Voltage graph; Line graph; 1-planar graph; Law","score_opus":0.005445700705337558,"score_gpt":0.18846807641930555,"score_spread":0.18302237571396798,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2094667324","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98911124,0.00021080347,0.0006589277,0.000020807272,0.007146918,0.00007350973,0.000004735727,0.000041444717,0.0027315803],"genre_scores_gemma":[0.9992424,0.00024199091,0.000018953644,0.000007659924,0.00034338425,0.0000021235523,0.0000020826699,0.00002209789,0.00011930639],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99886346,0.0001515287,0.00057201454,0.000054362175,0.00020841192,0.000150212],"domain_scores_gemma":[0.99926555,0.00006265347,0.00027597797,0.00015128746,0.00016842652,0.00007611908],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00078207743,0.0001289437,0.00033313432,0.00018966265,0.000041475112,0.000024657596,0.00017936858,0.00008411442,0.00010649799],"category_scores_gemma":[0.0000484428,0.000113658054,0.00015794183,0.0003297054,0.00007409035,0.0004997302,0.000012311172,0.00015773594,0.000004645457],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00067637966,0.00005649973,0.00056672783,0.000055329037,0.00013605258,0.000021074284,0.00058006035,0.00010897753,0.34532833,0.6517143,0.000064214364,0.00069201784],"study_design_scores_gemma":[0.0014030308,0.0006970584,0.0023887428,0.00023359984,0.00008647796,0.0003531274,0.00044380414,0.00003796097,0.16249707,0.78872114,0.042843875,0.00029412142],"about_ca_topic_score_codex":4.1295763e-7,"about_ca_topic_score_gemma":2.3505083e-7,"teacher_disagreement_score":0.18283126,"about_ca_system_score_codex":0.00001830006,"about_ca_system_score_gemma":0.00001846577,"threshold_uncertainty_score":0.46348408},"labels":[],"label_agreement":null},{"id":"W2096188165","doi":"10.1016/j.jctb.2008.08.005","title":"Cayley sum graphs and eigenvalues of<mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.gif\" overflow=\"scroll\"><mml:mo stretchy=\"false\">(</mml:mo><mml:mn>3</mml:mn><mml:mo>,</mml:mo><mml:mn>6</mml:mn><mml:mo stretchy=\"false\">)</mml:mo></mml:math>-fullerenes","year":2008,"lang":"lv","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Graph theory and applications","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":"Simon Fraser University","funders":"","keywords":"Mathematics; Scroll; Eigenvalues and eigenvectors; Discrete mathematics; Combinatorics; Physics; Theology","score_opus":0.01973134371674429,"score_gpt":0.24777375698998824,"score_spread":0.22804241327324395,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2096188165","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98296136,0.0039743707,0.00033329704,0.0006275332,0.0060340855,0.0003307547,0.0012920243,0.00037648078,0.0040701167],"genre_scores_gemma":[0.98668665,0.0055862316,0.0021647476,0.0005278798,0.002966533,0.00050119666,0.00040650187,0.00086019444,0.0003000934],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9853115,0.0015622617,0.004583631,0.002101648,0.0035980034,0.0028429474],"domain_scores_gemma":[0.98492146,0.00399552,0.0057639205,0.0025712927,0.0010356915,0.0017121397],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","research_integrity","insufficient_payload"],"consensus_categories":["metaepi_narrow","sts","research_integrity"],"category_scores_codex":[0.0054254374,0.0020166738,0.0017669126,0.0010225183,0.0032939024,0.0013680817,0.0033155775,0.0030116767,0.00141757],"category_scores_gemma":[0.0028135802,0.0026974056,0.0032489258,0.0017994776,0.004013768,0.0025388983,0.0018629433,0.003266511,0.00058899744],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0057282643,0.0017329447,0.000053672014,0.0015607777,0.0037802155,0.0008022798,0.0060339654,0.00038210562,0.0039722566,0.9611637,0.013163599,0.0016261911],"study_design_scores_gemma":[0.0055936584,0.0045096944,0.0000824921,0.0022758432,0.0036153325,0.0032867629,0.008128688,0.0067544873,0.2600624,0.69218993,0.010798238,0.002702439],"about_ca_topic_score_codex":0.00046487458,"about_ca_topic_score_gemma":0.00022228695,"teacher_disagreement_score":0.26897377,"about_ca_system_score_codex":0.00008911343,"about_ca_system_score_gemma":0.0017946424,"threshold_uncertainty_score":0.9996686},"labels":[],"label_agreement":null},{"id":"W2096249258","doi":"10.1016/j.jctb.2013.11.003","title":"Packing of rigid spanning subgraphs and spanning trees","year":2013,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Structural Analysis and Optimization","field":"Engineering","cited_by":19,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Spanning tree; Combinatorics; Minimum degree spanning tree; Minimum spanning tree; Connected dominating set; Mathematics; Connected component; Graph factorization; Graph; Connectivity; Vertex connectivity; Trémaux tree; Disjoint sets; Distance-hereditary graph; Discrete mathematics; Line graph; Graph power; Pathwidth","score_opus":0.003737840103404133,"score_gpt":0.18034843346995832,"score_spread":0.17661059336655419,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2096249258","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9952264,0.00097511144,0.0013308133,0.00003281279,0.001451913,0.000046256348,7.3557106e-7,0.00002172834,0.00091424293],"genre_scores_gemma":[0.99833375,0.00020507487,0.0011629232,0.00000563715,0.00025162258,7.422521e-7,7.7389655e-7,0.000014781413,0.000024719497],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991885,0.000049260907,0.00041321415,0.000056490142,0.00016785374,0.00012467008],"domain_scores_gemma":[0.9993473,0.000095495656,0.00022340493,0.00008051825,0.00019027958,0.00006296601],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002813908,0.00011686685,0.0003179621,0.0001499889,0.00005566232,0.000062910236,0.000104831975,0.000057693574,0.00011924925],"category_scores_gemma":[0.00008280796,0.000091130605,0.00010031264,0.0001838611,0.00006602141,0.0006092194,0.000020442774,0.00014289757,6.572815e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007343849,0.00008704339,0.038952965,0.00037765683,0.0019626352,0.00004238887,0.008043679,0.14305328,0.11379254,0.6412793,0.0015811366,0.050092995],"study_design_scores_gemma":[0.0027741122,0.00080382224,0.045014538,0.00052291504,0.0003911738,0.00019227271,0.003838021,0.01046247,0.06585141,0.86761785,0.0018073592,0.0007240583],"about_ca_topic_score_codex":0.000006061164,"about_ca_topic_score_gemma":5.8066325e-7,"teacher_disagreement_score":0.22633854,"about_ca_system_score_codex":0.000017090999,"about_ca_system_score_gemma":0.000008876022,"threshold_uncertainty_score":0.37161982},"labels":[],"label_agreement":null},{"id":"W2100494081","doi":"10.1006/jctb.2000.1987","title":"On the Dissection of Rectangles into Right-Angled Isosceles Triangles","year":2000,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Interconnection Networks and Systems","field":"Computer Science","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":"Isosceles triangle; Rectangle; Digraph; Generalization; Combinatorics; Mathematics; Square (algebra); Geometry; Mathematical analysis","score_opus":0.006297096261391931,"score_gpt":0.21416959232477364,"score_spread":0.2078724960633817,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2100494081","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95186126,0.00048137837,0.010497445,0.0017259689,0.017392574,0.00025992372,0.000001519233,0.00005790889,0.017722001],"genre_scores_gemma":[0.99808997,0.00005816381,0.00018441025,0.00006847189,0.0008257651,0.0000036995764,2.2731209e-7,0.000009612517,0.0007597044],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99793196,0.0007592899,0.00064996694,0.00012953827,0.00037598592,0.00015328029],"domain_scores_gemma":[0.9980002,0.0008326056,0.00050441216,0.00033665646,0.00026759008,0.000058544974],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018742535,0.00014542024,0.00034925176,0.000114087605,0.0002173979,0.00012663446,0.0007445431,0.000089769615,0.00038383808],"category_scores_gemma":[0.00022685308,0.000084804706,0.00024012422,0.00033034984,0.00010116607,0.00053052086,0.000033048313,0.00024937218,0.0000099796125],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009816295,0.00010940258,0.000009455593,0.000007825835,0.00007233826,0.000012293703,0.001288769,0.00009661943,0.0006281547,0.988169,0.0023395137,0.006284954],"study_design_scores_gemma":[0.0008320945,0.0017292239,0.00004938062,0.00015634492,0.00001726767,0.0001526699,0.00038382228,0.00018792429,0.012838867,0.96248955,0.021029899,0.00013298633],"about_ca_topic_score_codex":0.000008009667,"about_ca_topic_score_gemma":0.0000048164716,"teacher_disagreement_score":0.046228666,"about_ca_system_score_codex":0.000056744906,"about_ca_system_score_gemma":0.000057054127,"threshold_uncertainty_score":0.42027578},"labels":[],"label_agreement":null},{"id":"W2102110641","doi":"10.1016/j.jctb.2006.02.008","title":"Mutually embeddable graphs and the tree alternative conjecture","year":2006,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Royal Military College of Canada; Wilfrid Laurier University","funders":"Division of Mathematical Sciences","keywords":"Mathematics; Combinatorics; Conjecture; Tree (set theory); Vertex (graph theory); Discrete mathematics; Embedding; Graph; Computer science","score_opus":0.006309784519698531,"score_gpt":0.2422969169776194,"score_spread":0.23598713245792088,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2102110641","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6062277,0.010976088,0.2912575,0.01099696,0.024226902,0.0016314944,0.00001610526,0.00029859782,0.054368623],"genre_scores_gemma":[0.9961032,0.00012792545,0.0024887105,0.000111660556,0.00042211928,0.000005696888,3.6959247e-7,0.000016018275,0.0007242972],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975339,0.0008866807,0.00047188232,0.00019343145,0.0006019997,0.0003121099],"domain_scores_gemma":[0.9973462,0.0013006963,0.00046392702,0.00040165786,0.00038782883,0.000099658726],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002918388,0.00019364532,0.0004028266,0.00019121077,0.00028224653,0.00027226284,0.0013366444,0.00007300122,0.000019447454],"category_scores_gemma":[0.00034495117,0.00011551443,0.00017706628,0.00044980878,0.00088118174,0.0011951203,0.00028062452,0.0005096202,0.0000025265526],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013570902,0.000048220638,0.00004298129,0.0000054879383,0.00006835309,0.000063625404,0.0006352195,0.00010037411,0.0002456334,0.99510604,0.0003804934,0.0019465075],"study_design_scores_gemma":[0.0038365053,0.00047579277,0.00010657424,0.000021787064,0.00001638821,0.00033241077,0.00018779977,0.00009938957,0.0035295263,0.9870025,0.0042587956,0.0001325089],"about_ca_topic_score_codex":0.00000858644,"about_ca_topic_score_gemma":0.0000036433473,"teacher_disagreement_score":0.3898755,"about_ca_system_score_codex":0.000037078255,"about_ca_system_score_gemma":0.00010959054,"threshold_uncertainty_score":0.47105417},"labels":[],"label_agreement":null},{"id":"W2115589427","doi":"10.1016/j.jctb.2011.07.004","title":"The disjoint paths problem in quadratic time","year":2011,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":203,"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":"Disjoint sets; Minor (academic); Combinatorics; Time complexity; Mathematics; Mathematical proof; Discrete mathematics; Computer science; Algorithm","score_opus":0.014700443154393136,"score_gpt":0.24615038814903964,"score_spread":0.2314499449946465,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2115589427","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.506521,0.0067302315,0.3023675,0.006385008,0.04040901,0.0039208205,0.000009920644,0.0005407917,0.13311574],"genre_scores_gemma":[0.98523915,0.00014154462,0.0132495565,0.00005524397,0.00027126746,0.000016331707,1.8414572e-7,0.000027250313,0.0009994494],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997382,0.0009029455,0.0006502079,0.0001602164,0.00051520497,0.0003894156],"domain_scores_gemma":[0.9979442,0.000704257,0.00040889592,0.00052180764,0.00028724055,0.00013361401],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004588527,0.00015656404,0.00029576567,0.00017123841,0.00021294624,0.00014300225,0.0018438146,0.00006248014,0.000046898764],"category_scores_gemma":[0.00050651137,0.000098406636,0.0001345395,0.00053905096,0.0003014266,0.001350912,0.00030356608,0.00049946556,0.000030439325],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00062460016,0.00011879528,0.000085690415,0.0000060171305,0.000025785674,0.00008620477,0.0020067433,0.0000062647973,0.0004680037,0.99011064,0.00010076415,0.0063605146],"study_design_scores_gemma":[0.00067631877,0.00080733135,0.0002641143,0.000044557783,0.00000420122,0.00010191728,0.00023970589,0.00006841685,0.0023751112,0.9928981,0.0023995566,0.000120679244],"about_ca_topic_score_codex":0.0000018396008,"about_ca_topic_score_gemma":0.0000015057758,"teacher_disagreement_score":0.4787182,"about_ca_system_score_codex":0.000078678706,"about_ca_system_score_gemma":0.000192281,"threshold_uncertainty_score":0.40129063},"labels":[],"label_agreement":null},{"id":"W2116039510","doi":"10.1016/j.jctb.2018.12.007","title":"Treewidth of graphs with balanced separations","year":2018,"lang":"en","type":"preprint","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","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":"McGill University","funders":"Grantová Agentura České Republiky","keywords":"Treewidth; Combinatorics; Partial k-tree; Mathematics; Graph; Clique-sum; Discrete mathematics; Chordal graph; 1-planar graph; Pathwidth; Line graph","score_opus":0.015484421120492703,"score_gpt":0.29012519452983754,"score_spread":0.27464077340934484,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2116039510","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3208135,0.0018024523,0.6321325,0.0010610372,0.027081912,0.0013825675,0.00007701389,0.0002178666,0.01543118],"genre_scores_gemma":[0.96916294,0.00019425573,0.029593976,0.00003246267,0.0006165343,0.000015867072,0.0000040573045,0.000041930827,0.00033799556],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99635077,0.000813026,0.000970765,0.00037678768,0.0010988351,0.00038983906],"domain_scores_gemma":[0.9942007,0.0005503863,0.0017971295,0.0012516412,0.001981766,0.00021839226],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0024336695,0.00037302938,0.0009479325,0.0005907963,0.00016264396,0.00017349115,0.0029431726,0.00025399344,0.000051191462],"category_scores_gemma":[0.0003668208,0.00028528846,0.0003602126,0.00074974983,0.0008314426,0.0010446465,0.0009636192,0.0010798567,0.0000040919413],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0019371178,0.00019145456,0.00017696612,0.00007415768,0.00032518042,0.000047039648,0.00077027397,0.00037019438,0.00052165246,0.9943604,0.0004546684,0.0007709269],"study_design_scores_gemma":[0.0012808471,0.0022663602,0.00018299119,0.0002999345,0.00005111813,0.00011928195,0.000091118156,0.000059132348,0.009797849,0.9839258,0.0016395553,0.0002859895],"about_ca_topic_score_codex":0.0000018472273,"about_ca_topic_score_gemma":0.0000018262431,"teacher_disagreement_score":0.6483494,"about_ca_system_score_codex":0.000089366586,"about_ca_system_score_gemma":0.000872337,"threshold_uncertainty_score":0.99995995},"labels":[],"label_agreement":null},{"id":"W2120958076","doi":"10.1016/j.jctb.2007.10.008","title":"Tangles, tree-decompositions and grids in matroids","year":2009,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":39,"is_retracted":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":"Tangle; Matroid; Graphic matroid; Combinatorics; Matroid partitioning; Mathematics; Tree decomposition; Grid; Graph; Tree (set theory); Order (exchange); Finite field; Discrete mathematics; Pure mathematics; Geometry","score_opus":0.007818567983791677,"score_gpt":0.2651665826904393,"score_spread":0.25734801470664764,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2120958076","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7364257,0.005043049,0.21874033,0.01047969,0.009389095,0.0006744423,0.000008766331,0.00021390521,0.019025],"genre_scores_gemma":[0.9883742,0.00011344385,0.011037813,0.0001101241,0.00024297858,0.0000015955062,3.5174818e-7,0.000008196215,0.00011131492],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99838305,0.00038317335,0.00043917855,0.00015917212,0.0003561072,0.00027929922],"domain_scores_gemma":[0.99888915,0.00029421973,0.000198186,0.00028674005,0.00017591479,0.00015576693],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001471703,0.00013938779,0.00030528658,0.00036449436,0.000116957155,0.00014262929,0.00075731275,0.00006789971,0.000012410887],"category_scores_gemma":[0.00016470252,0.000121518286,0.000088918256,0.0005369087,0.00014700806,0.0015013784,0.00011153101,0.00040034117,0.000002530062],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00039490077,0.00012478209,0.00013171512,0.000003599242,0.000012125553,0.00011764167,0.00031396683,0.000018525134,0.003967017,0.98339075,0.000113058944,0.011411896],"study_design_scores_gemma":[0.0012065249,0.0012384237,0.0017531893,0.000042401618,0.000004891884,0.00035891045,0.000102407896,0.00003507536,0.0030525352,0.9901549,0.001924643,0.00012608475],"about_ca_topic_score_codex":6.071e-7,"about_ca_topic_score_gemma":8.46421e-7,"teacher_disagreement_score":0.25194845,"about_ca_system_score_codex":0.00007012659,"about_ca_system_score_gemma":0.00008762771,"threshold_uncertainty_score":0.4955372},"labels":[],"label_agreement":null},{"id":"W2127521998","doi":"10.1016/j.jctb.2014.02.004","title":"A base exchange property for regular matroids","year":2014,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Algebra and Logic","field":"Computer Science","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":"Thompson Rivers University","funders":"","keywords":"Matroid; Element (criminal law); Property (philosophy); Base (topology); Combinatorics; Mathematics; Discrete mathematics; Mathematical analysis; Philosophy; Political science","score_opus":0.010447833759310764,"score_gpt":0.22570754075854352,"score_spread":0.21525970699923275,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2127521998","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011692808,0.00036284767,0.9746186,0.0018586408,0.009290556,0.00026745492,0.0000017249589,0.00007264657,0.0018347257],"genre_scores_gemma":[0.93022025,0.0000529173,0.06378974,0.0006383858,0.0029343974,0.000022463624,0.000001009477,0.00003259663,0.0023082362],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99871975,0.00024721204,0.00036550526,0.00015665713,0.00026750544,0.00024339574],"domain_scores_gemma":[0.99858916,0.00025619473,0.00035448393,0.0003514465,0.0003207415,0.00012798193],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017211746,0.00014389055,0.0003140146,0.00008902132,0.00014773232,0.000103289196,0.00082552235,0.00006767007,0.000021439946],"category_scores_gemma":[0.00049301045,0.00008765801,0.00017249161,0.00016195833,0.00007943247,0.0010285304,0.00011965072,0.00015567886,0.0000045404013],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00037097177,0.00006402672,0.0000073424744,0.000027735809,0.00001999582,0.000009253967,0.00024206105,0.00001441302,0.001006544,0.9822162,0.0012201627,0.014801304],"study_design_scores_gemma":[0.0012183157,0.0014524241,0.000013715175,0.000027173732,0.000011997318,0.000094631345,0.00003861861,0.00018644228,0.004606078,0.83978814,0.15243694,0.00012555033],"about_ca_topic_score_codex":3.1042524e-7,"about_ca_topic_score_gemma":1.5949072e-7,"teacher_disagreement_score":0.9185274,"about_ca_system_score_codex":0.000038365724,"about_ca_system_score_gemma":0.00007018722,"threshold_uncertainty_score":0.35745898},"labels":[],"label_agreement":null},{"id":"W2128954556","doi":"10.1016/j.jctb.2005.09.007","title":"Augmenting chains in graphs without a skew star","year":2005,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","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":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Skew; Star (game theory); Computer science; Mathematics; Combinatorics; Telecommunications","score_opus":0.012703002840513162,"score_gpt":0.2792198242773306,"score_spread":0.26651682143681743,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2128954556","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.91516554,0.0012463923,0.07088275,0.0021441584,0.005653434,0.00040314338,0.0000023647215,0.00011343699,0.004388757],"genre_scores_gemma":[0.98089486,0.00010138219,0.018116865,0.000102620645,0.00040884735,0.0000048102934,2.3282804e-7,0.00001995882,0.00035044074],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972825,0.0006104248,0.00069272675,0.0002243513,0.00069752545,0.0004924755],"domain_scores_gemma":[0.99828637,0.00033571242,0.00045321207,0.00044184286,0.00029675555,0.00018610487],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038808037,0.0001983006,0.00041920398,0.00055376906,0.00014829106,0.0001546857,0.0014464153,0.00008276473,0.000047936377],"category_scores_gemma":[0.0004275333,0.00017175691,0.0001705046,0.00084066385,0.00018442993,0.0023036262,0.00028853372,0.00062087656,0.000009436454],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004982689,0.00015628278,0.0006702636,0.0000101394035,0.000036135854,0.000063174535,0.0011837424,0.00008751462,0.0012742726,0.9879134,0.000052286854,0.00805448],"study_design_scores_gemma":[0.001901702,0.00051024323,0.00034054252,0.00008248175,0.0000061530536,0.00012152362,0.00020659232,0.00023738321,0.0050727837,0.9822872,0.009038307,0.0001950412],"about_ca_topic_score_codex":0.0000015761173,"about_ca_topic_score_gemma":0.0000046252667,"teacher_disagreement_score":0.06572928,"about_ca_system_score_codex":0.00014326234,"about_ca_system_score_gemma":0.00018707958,"threshold_uncertainty_score":0.70040435},"labels":[],"label_agreement":null},{"id":"W2130764977","doi":"10.1016/j.jctb.2007.11.003","title":"A weaker version of Lovász' path removal conjecture","year":2008,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; McGill University","funders":"","keywords":"Mathematics; Conjecture; Combinatorics; Graph; Existential quantification; Path (computing); Discrete mathematics; Computer science","score_opus":0.011137663498495029,"score_gpt":0.24954757915373396,"score_spread":0.23840991565523895,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2130764977","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8948021,0.001533226,0.08409245,0.00081260386,0.011168583,0.00030760287,0.00000925953,0.00008023826,0.0071939463],"genre_scores_gemma":[0.9908142,0.00020976807,0.008121981,0.000045517812,0.00034611553,8.7563905e-7,5.11599e-7,0.000016525404,0.00044450106],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975933,0.0005306449,0.00055681146,0.00018142043,0.00084206904,0.0002957943],"domain_scores_gemma":[0.99769473,0.0004585805,0.0005723608,0.0005019457,0.00060363614,0.00016876309],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001577848,0.00017518802,0.0004532258,0.0002530187,0.00017701005,0.00003130937,0.0012554943,0.00011703114,0.000076431876],"category_scores_gemma":[0.00050468696,0.00013967522,0.0002444639,0.00057980756,0.0004213871,0.0011707691,0.00027193746,0.00048356227,0.000010129998],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001674444,0.00014129392,0.00013210908,0.000018176508,0.00006670602,0.00061700994,0.0009894164,0.000054588018,0.0052385214,0.9886545,0.0010155356,0.0013977126],"study_design_scores_gemma":[0.0021612975,0.0016523827,0.00021898185,0.00007100454,0.000012212665,0.002623703,0.00016119974,0.000029735707,0.024915375,0.9429146,0.025063995,0.00017550771],"about_ca_topic_score_codex":9.1394196e-7,"about_ca_topic_score_gemma":9.211054e-8,"teacher_disagreement_score":0.096012115,"about_ca_system_score_codex":0.00006577939,"about_ca_system_score_gemma":0.00029930362,"threshold_uncertainty_score":0.569579},"labels":[],"label_agreement":null},{"id":"W2132677029","doi":"10.1016/j.jctb.2008.03.006","title":"On the odd-minor variant of Hadwiger's conjecture","year":2008,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":75,"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 Waterloo","funders":"","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Disjoint sets; Conjecture; Graph; Discrete mathematics","score_opus":0.016178644568518676,"score_gpt":0.25031874771390306,"score_spread":0.2341401031453844,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2132677029","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.80698293,0.0012152361,0.14975233,0.0065475255,0.018809028,0.0007838398,0.000014353548,0.00011123571,0.015783513],"genre_scores_gemma":[0.9977749,0.00007677324,0.0012840229,0.00016849555,0.00031300884,0.0000030439908,1.7895147e-7,0.000015246326,0.00036430548],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973252,0.0008120286,0.0005510852,0.00017251461,0.0008368654,0.0003023494],"domain_scores_gemma":[0.9961569,0.0019523161,0.00059287646,0.00069415127,0.00047359732,0.00013020594],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002325977,0.00018737826,0.0004109716,0.00019906664,0.0002838429,0.00005176582,0.0019546915,0.00009319355,0.00010995726],"category_scores_gemma":[0.0010904036,0.000112928356,0.00023565463,0.00054065784,0.00056472473,0.0006474958,0.00022246776,0.00061806757,0.000009411304],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000857996,0.00013223098,0.000023711904,0.000006785278,0.00008060862,0.00024299516,0.0010470756,0.0000947105,0.0009774888,0.99505955,0.000938852,0.00053799315],"study_design_scores_gemma":[0.00087330333,0.0014959137,0.00011440208,0.000042335436,0.000008592713,0.00080461014,0.00011787582,0.000021951526,0.019144548,0.9729998,0.00425532,0.000121327175],"about_ca_topic_score_codex":0.0000011529457,"about_ca_topic_score_gemma":1.7546328e-7,"teacher_disagreement_score":0.190792,"about_ca_system_score_codex":0.000048413585,"about_ca_system_score_gemma":0.00027949584,"threshold_uncertainty_score":0.46050847},"labels":[],"label_agreement":null},{"id":"W2134453562","doi":"10.1016/j.jctb.2019.07.001","title":"On Frank's conjecture on k-connected orientations","year":2019,"lang":"en","type":"preprint","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":6,"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; University of Waterloo","keywords":"Conjecture; Combinatorics; Vertex (graph theory); Orientation (vector space); Graph; Mathematics; Strongly connected component; Discrete mathematics; Geometry","score_opus":0.013716950753505304,"score_gpt":0.2898674251964509,"score_spread":0.2761504744429456,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2134453562","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3828678,0.0012944961,0.40421882,0.0049874904,0.17500193,0.0028679548,0.00015216389,0.00052435056,0.028084984],"genre_scores_gemma":[0.9952809,0.00011139281,0.0023876932,0.00034290177,0.0011129469,0.00001712031,0.000009368938,0.0000606505,0.0006769924],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99546015,0.0013142182,0.00084869476,0.00055647834,0.0013441881,0.00047626792],"domain_scores_gemma":[0.99348456,0.0026107465,0.0012072648,0.0015192737,0.00092867855,0.00024950542],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0020815595,0.0005009761,0.00090467645,0.00074010243,0.0002359805,0.00038177878,0.0030407424,0.0004637114,0.0001590047],"category_scores_gemma":[0.0016133408,0.0004125189,0.0005047614,0.0005703465,0.000251336,0.0006603678,0.0008655617,0.0029373665,0.00007960026],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0019679193,0.00023417063,0.000012585767,0.00004754995,0.00023043042,0.00011970382,0.0006873764,0.0067624506,0.000130081,0.9872009,0.0014448164,0.0011619896],"study_design_scores_gemma":[0.0018650661,0.002795102,0.00006860453,0.00033996368,0.00003096587,0.0000703499,0.00010493189,0.00008162916,0.0038007468,0.9856192,0.0048350105,0.00038845142],"about_ca_topic_score_codex":0.0000012070835,"about_ca_topic_score_gemma":3.0437582e-7,"teacher_disagreement_score":0.6124131,"about_ca_system_score_codex":0.00025447144,"about_ca_system_score_gemma":0.00071321195,"threshold_uncertainty_score":0.9998327},"labels":[],"label_agreement":null},{"id":"W2135081210","doi":"10.1016/s0095-8956(02)00023-0","title":"Bounds for mean colour numbers of graphs","year":2003,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","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; Mathematics; Conjecture; Counterexample; Graph; Discrete mathematics; Split graph; Vertex (graph theory); Chordal graph; 1-planar graph","score_opus":0.014415090368387347,"score_gpt":0.2835429309123682,"score_spread":0.26912784054398087,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2135081210","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43102017,0.0015496808,0.51510316,0.0007525548,0.029400641,0.001210031,0.000021589129,0.000119957636,0.020822208],"genre_scores_gemma":[0.98081535,0.000050591163,0.018580435,0.000042071308,0.00011383306,0.0000075417424,3.3071163e-7,0.000020851008,0.00036897595],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976576,0.0005885678,0.0006445893,0.00017883298,0.000569361,0.0003610714],"domain_scores_gemma":[0.9968976,0.00093702995,0.00064114516,0.000447943,0.00089872745,0.00017760001],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003899517,0.00017012688,0.0004610322,0.00027683465,0.00017316778,0.00008591965,0.0012046967,0.000093961586,0.00003178263],"category_scores_gemma":[0.0011016015,0.00014717286,0.00032449892,0.000629175,0.00034098097,0.001093544,0.000088572335,0.0002788419,0.0000017039869],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00084940426,0.00013110346,0.00010564846,0.000025336909,0.00009699184,0.000012150495,0.0006395627,0.000024862715,0.0018931483,0.9951521,0.00038268825,0.0006870068],"study_design_scores_gemma":[0.0017728724,0.0014406666,0.000021534039,0.000029221084,0.000016331982,0.00010686596,0.00036874608,0.000008237659,0.03119546,0.94633985,0.018560871,0.00013934582],"about_ca_topic_score_codex":7.158661e-7,"about_ca_topic_score_gemma":7.8445487e-7,"teacher_disagreement_score":0.5497952,"about_ca_system_score_codex":0.000060680664,"about_ca_system_score_gemma":0.00031211923,"threshold_uncertainty_score":0.6001535},"labels":[],"label_agreement":null},{"id":"W2138481685","doi":"10.1016/s0095-8956(02)00010-2","title":"Disjoint cocircuits in matroids with large rank","year":2003,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","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; Combinatorics; Disjoint sets; Rank (graph theory); Mathematics; Integer (computer science); Discrete mathematics; Graphic matroid; Class (philosophy); Minor (academic); Computer science; Artificial intelligence","score_opus":0.008969961233094159,"score_gpt":0.2537563941132656,"score_spread":0.24478643288017146,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2138481685","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4374509,0.0016236296,0.5286141,0.001016527,0.008998504,0.00068593613,0.0000062921354,0.00012136715,0.021482764],"genre_scores_gemma":[0.99588025,0.000049826493,0.0036431274,0.000059087644,0.000111311,0.000005109987,2.2583916e-7,0.000020064866,0.00023102366],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971741,0.00092997175,0.0005211237,0.00021022165,0.0006701542,0.0004944507],"domain_scores_gemma":[0.9982752,0.00040733497,0.00033039035,0.00046276124,0.0003403889,0.0001838798],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0039039145,0.00019273447,0.00042835073,0.0003205854,0.00012674951,0.00013118345,0.0009853779,0.00007650541,0.0000590235],"category_scores_gemma":[0.00055101956,0.00014545608,0.00011502262,0.00083683163,0.00017177321,0.0015525928,0.00010693955,0.00057278236,0.000008350983],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006233888,0.00018957928,0.0008276839,0.000011677958,0.000033881322,0.00023422873,0.0006038503,0.000048758153,0.00046233268,0.9963676,0.000053054573,0.00054398796],"study_design_scores_gemma":[0.003506397,0.0010449066,0.0003778252,0.00006689178,0.0000064506175,0.00041638457,0.00036805007,0.000010907333,0.0053108227,0.9799746,0.008726246,0.00019049],"about_ca_topic_score_codex":5.593223e-7,"about_ca_topic_score_gemma":0.0000021465387,"teacher_disagreement_score":0.55842936,"about_ca_system_score_codex":0.00011332446,"about_ca_system_score_gemma":0.00027803727,"threshold_uncertainty_score":0.5931527},"labels":[],"label_agreement":null},{"id":"W2139284584","doi":"10.1016/j.jctb.2005.09.002","title":"On the extreme eigenvalues of regular graphs","year":2005,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Graph theory and applications","field":"Mathematics","cited_by":35,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Eigenvalues and eigenvectors; Mathematics; Combinatorics; Integer (computer science); Strongly regular graph; Graph; Discrete mathematics; Constant (computer programming); Pure mathematics; Pathwidth; Physics; Quantum mechanics; Line graph; Computer science","score_opus":0.03740442633194699,"score_gpt":0.2765691128428439,"score_spread":0.23916468651089692,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2139284584","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98937494,0.00020956226,0.00034223605,0.0013644069,0.0009648587,0.00018616213,0.0000056080453,0.000020667276,0.007531575],"genre_scores_gemma":[0.99818873,0.000048199603,0.0009403356,0.00007506749,0.00032633933,0.000005455937,3.1055524e-7,0.000018823484,0.00039671786],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984156,0.0004096503,0.00059154077,0.000081484985,0.0003575643,0.00014416438],"domain_scores_gemma":[0.99703413,0.001570127,0.00067512767,0.00040707094,0.00025351808,0.0000600359],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002495638,0.00013884045,0.00031147606,0.000104899766,0.00016389236,0.000022453061,0.0004772031,0.000073164185,0.00030812828],"category_scores_gemma":[0.00077743776,0.00008616905,0.00027191915,0.00022358225,0.0002808289,0.00019367212,0.0000345165,0.00025977448,0.000006477115],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00052553025,0.00026413414,0.000008757867,0.000012300785,0.00009951221,0.0000017122466,0.000566095,0.000006990078,0.003138472,0.9918642,0.0029862754,0.0005260243],"study_design_scores_gemma":[0.0004589449,0.0003217587,0.000024465282,0.000060737526,0.000068542155,0.00002574479,0.0004901686,0.0000012220621,0.041939445,0.94689554,0.009629836,0.00008360855],"about_ca_topic_score_codex":2.3553277e-7,"about_ca_topic_score_gemma":3.0258676e-7,"teacher_disagreement_score":0.04496867,"about_ca_system_score_codex":0.000020855226,"about_ca_system_score_gemma":0.00003780204,"threshold_uncertainty_score":0.3513872},"labels":[],"label_agreement":null},{"id":"W2140619995","doi":"10.1016/s0095-8956(03)00037-6","title":"Crossing-number critical graphs have bounded path-width","year":2003,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":31,"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; Fields Institute for Research in Mathematical Sciences","keywords":"Combinatorics; Crossing number (knot theory); Bounded function; Mathematics; 1-planar graph; Subdivision; Pathwidth; Embedding; Book embedding; Discrete mathematics; Planar graph; Graph; Assertion; Chordal graph; Line graph; Computer science","score_opus":0.010836903398999743,"score_gpt":0.2721763294949098,"score_spread":0.26133942609591004,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2140619995","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18642919,0.0007112554,0.7590039,0.0011361486,0.03511484,0.00018086439,0.0000036304637,0.0000937387,0.017326461],"genre_scores_gemma":[0.9742781,0.000011216246,0.024668138,0.0002763896,0.0004365166,0.0000019252905,6.6815585e-7,0.000010367018,0.0003166984],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979731,0.00050707615,0.00053866813,0.00017963597,0.0005482257,0.00025332038],"domain_scores_gemma":[0.99808055,0.00054829323,0.00026775664,0.00024409048,0.00068181916,0.00017750997],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017776552,0.00016012453,0.0002712449,0.00012731859,0.00042688372,0.00073532306,0.00045434656,0.00009282848,0.000120268334],"category_scores_gemma":[0.0012523474,0.00014215776,0.0001842174,0.00037261785,0.00023375773,0.0014438031,0.000061440296,0.0002730151,0.000014655223],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000113380745,0.00014075542,0.00017967405,0.00000776873,0.000029279203,0.000049301354,0.00039431464,0.00006054175,0.00029422663,0.9966277,0.0007689511,0.0013341365],"study_design_scores_gemma":[0.0007949502,0.00031550787,0.00018072383,0.000023091088,0.000015161128,0.0005218391,0.00006040431,0.000080426405,0.0049908697,0.9449464,0.047912017,0.00015862148],"about_ca_topic_score_codex":6.7368114e-7,"about_ca_topic_score_gemma":2.7078926e-7,"teacher_disagreement_score":0.7878489,"about_ca_system_score_codex":0.000056515542,"about_ca_system_score_gemma":0.00042289242,"threshold_uncertainty_score":0.7090737},"labels":[],"label_agreement":null},{"id":"W2143815444","doi":"10.1016/j.jctb.2006.10.001","title":"Paths with two blocks in n-chromatic digraphs","year":2006,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Chromatic scale; Computer science; Mathematics; Combinatorics","score_opus":0.006015535670932735,"score_gpt":0.24470165430450055,"score_spread":0.2386861186335678,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2143815444","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.91852224,0.00069534587,0.06855142,0.0004628905,0.0029056265,0.00033430505,0.0000019027995,0.000084451516,0.008441789],"genre_scores_gemma":[0.99328387,0.000017014909,0.006188033,0.000028904473,0.00025687148,0.000005698519,3.5315816e-7,0.000017628432,0.0002016015],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975853,0.00047627892,0.00061024225,0.00020521879,0.00071168575,0.0004112895],"domain_scores_gemma":[0.99817705,0.0005090334,0.00042225086,0.0004700267,0.00030393165,0.00011770984],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019550703,0.00020379471,0.0004214891,0.00046675748,0.00011322372,0.00016067944,0.0012166462,0.000060246744,0.000026136891],"category_scores_gemma":[0.00014328417,0.00015173537,0.00011999096,0.0010455026,0.00026635497,0.001489239,0.00015074974,0.0004749549,0.0000040261816],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00062827085,0.0002023309,0.0013354499,0.000011323388,0.000026549436,0.00038267407,0.0002815766,0.00037168746,0.0009070816,0.9942648,0.0000795827,0.0015087082],"study_design_scores_gemma":[0.0025004474,0.0009809522,0.0010241132,0.00010003722,0.000008090739,0.00036289677,0.00012475942,0.0000636666,0.004207215,0.9894341,0.001003739,0.00018998688],"about_ca_topic_score_codex":0.000008872472,"about_ca_topic_score_gemma":0.000010845152,"teacher_disagreement_score":0.07476163,"about_ca_system_score_codex":0.00008273367,"about_ca_system_score_gemma":0.00018219315,"threshold_uncertainty_score":0.61875886},"labels":[],"label_agreement":null},{"id":"W2152427009","doi":"10.1006/jctb.2002.2110","title":"Asymptotically the List Colouring Constants Are 1","year":2002,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":40,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Combinatorics; Conjecture; Vertex (graph theory); Mathematics; Graph; Discrete mathematics","score_opus":0.02972296561971398,"score_gpt":0.26133577630400334,"score_spread":0.23161281068428935,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2152427009","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94386494,0.0009892341,0.00032508263,0.0016352219,0.01509396,0.000281716,0.000011854402,0.00006269937,0.037735283],"genre_scores_gemma":[0.9974197,0.000106449275,0.00044777282,0.0001814636,0.0010490927,0.0000017382422,8.729263e-8,0.000028413091,0.0007652761],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99790835,0.0005228225,0.0006744304,0.000112401016,0.0005054555,0.0002765352],"domain_scores_gemma":[0.9964993,0.0018973164,0.00075775577,0.00036697544,0.00035779443,0.000120886994],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019298845,0.00020198025,0.00045424933,0.00008023482,0.00051024463,0.00010411655,0.0006466375,0.00013234797,0.00086530304],"category_scores_gemma":[0.0021001087,0.00011910486,0.00024823257,0.00017359955,0.0005350004,0.00027321654,0.0001418373,0.00057499774,0.000004321275],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00041001645,0.00010205463,0.00026039683,0.000023920244,0.00016161992,0.0000727628,0.0012609935,0.0000017543774,0.0000722701,0.99269146,0.004550979,0.0003917531],"study_design_scores_gemma":[0.0009537853,0.00030152456,0.00013807873,0.0000948638,0.00009745801,0.0003832648,0.0010008892,0.0000051848665,0.00073209003,0.98396766,0.012175023,0.00015018563],"about_ca_topic_score_codex":2.4588977e-7,"about_ca_topic_score_gemma":6.1706004e-7,"teacher_disagreement_score":0.05355476,"about_ca_system_score_codex":0.00005032394,"about_ca_system_score_gemma":0.000028122358,"threshold_uncertainty_score":0.9474461},"labels":[],"label_agreement":null},{"id":"W2160639448","doi":"10.1016/j.jctb.2005.02.006","title":"A polynomial recognition algorithm for balanced matrices","year":2005,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":18,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Modulo; Combinatorics; Matrix (chemical analysis); Polynomial; Square (algebra); Mathematics; Matrix polynomial; Polynomial matrix; Column (typography); Algorithm; Discrete mathematics","score_opus":0.0069574814401236005,"score_gpt":0.2074521148175733,"score_spread":0.20049463337744972,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2160639448","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.86725616,0.0056088464,0.049400084,0.0003103209,0.06409579,0.0010324727,0.00017492789,0.0006418913,0.011479488],"genre_scores_gemma":[0.990648,0.00013663936,0.0040691704,0.0000264055,0.0049431697,0.000014827511,0.000004911624,0.000038241236,0.00011868174],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99899423,0.0000959339,0.00048257934,0.00007071805,0.00015611817,0.00020039547],"domain_scores_gemma":[0.9992697,0.00018982713,0.00019446602,0.0000997961,0.00015897557,0.0000871859],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009329009,0.00014761345,0.0003102669,0.00013339455,0.00007935015,0.000055913373,0.00018820766,0.00010750813,0.000058471942],"category_scores_gemma":[0.000058165504,0.00013303781,0.00019531294,0.000127663,0.000040906707,0.0005881006,0.000009487896,0.00016964776,0.000011908399],"study_design_candidate":"design_other","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.0051615024,0.00036701155,0.00003713841,0.00032151272,0.0010921052,0.000037224854,0.002519947,0.0013013965,0.018894428,0.08814993,0.06234317,0.8197746],"study_design_scores_gemma":[0.00899559,0.0018065125,0.000054023734,0.0002971956,0.00025374105,0.0005718259,0.0013847783,0.002375471,0.080655694,0.41452438,0.48824158,0.00083921116],"about_ca_topic_score_codex":2.9037554e-7,"about_ca_topic_score_gemma":2.804241e-7,"teacher_disagreement_score":0.81893545,"about_ca_system_score_codex":0.000059969927,"about_ca_system_score_gemma":0.000024796056,"threshold_uncertainty_score":0.5425125},"labels":[],"label_agreement":null},{"id":"W2161005000","doi":"10.1016/j.jctb.2007.02.005","title":"Excluding a planar graph from<mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.gif\" overflow=\"scroll\"><mml:mi mathvariant=\"normal\">GF</mml:mi><mml:mo stretchy=\"false\">(</mml:mo><mml:mi>q</mml:mi><mml:mo stretchy=\"false\">)</mml:mo></mml:math>-representable matroids","year":2007,"lang":"lv","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","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":"Matroid; Scroll; Graphic matroid; Combinatorics; Antichain; Matroid partitioning; Mathematics; Oriented matroid; Binary number; Graph; Planar graph; Discrete mathematics; Partially ordered set; Arithmetic","score_opus":0.01835145302768177,"score_gpt":0.259835901032013,"score_spread":0.24148444800433122,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2161005000","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97004676,0.0026844759,0.008200562,0.0005931474,0.01122038,0.00017557768,0.00032958077,0.0003090888,0.0064404416],"genre_scores_gemma":[0.9873767,0.0015319075,0.0051799268,0.00058894977,0.0042595635,0.00017309556,0.000141158,0.0005830294,0.00016567565],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98516005,0.001415095,0.0033666564,0.0020350015,0.0045154896,0.003507691],"domain_scores_gemma":[0.9873999,0.0037287637,0.003739329,0.002631157,0.00068419037,0.0018166793],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","research_integrity","insufficient_payload"],"consensus_categories":["metaepi_narrow","research_integrity","insufficient_payload"],"category_scores_codex":[0.008564274,0.0013995748,0.0010691637,0.0011658977,0.0026595027,0.0027313994,0.0051987837,0.0020955137,0.0019350812],"category_scores_gemma":[0.0023536442,0.0020133671,0.0023127098,0.0022695211,0.002330605,0.0048697274,0.0030458965,0.0037096383,0.00086266466],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.008477434,0.0007298431,0.00007220373,0.00053480896,0.0022829357,0.0033786078,0.0033868353,0.0016663405,0.00452084,0.96505606,0.007214174,0.0026799275],"study_design_scores_gemma":[0.005196676,0.0043920074,0.00007264996,0.0017430726,0.0010200995,0.0030175224,0.005147141,0.020192627,0.25631103,0.69617206,0.004655645,0.0020794529],"about_ca_topic_score_codex":0.00076212845,"about_ca_topic_score_gemma":0.00018329817,"teacher_disagreement_score":0.26888397,"about_ca_system_score_codex":0.00011281945,"about_ca_system_score_gemma":0.0017179458,"threshold_uncertainty_score":0.9999153},"labels":[],"label_agreement":null},{"id":"W2161040448","doi":"10.1016/j.jctb.2010.09.001","title":"The edge-density for <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.gif\" overflow=\"scroll\"><mml:msub><mml:mi>K</mml:mi><mml:mrow><mml:mn>2</mml:mn><mml:mo>,</mml:mo><mml:mi>t</mml:mi></mml:mrow></mml:msub></mml:math> minors","year":2010,"lang":"lv","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Graph theory and applications","field":"Mathematics","cited_by":44,"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; Bipartite graph; Mathematics; Graph; Vertex (graph theory); Discrete mathematics","score_opus":0.015482498417395539,"score_gpt":0.2446875353190324,"score_spread":0.22920503690163685,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2161040448","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.836641,0.0009714217,0.0008272163,0.0012432834,0.012562659,0.00011372189,0.00033863515,0.00020641205,0.14709564],"genre_scores_gemma":[0.98824173,0.0010405767,0.0022547955,0.0009044633,0.0052285674,0.00075292983,0.00025599814,0.00076165533,0.00055926637],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9901335,0.000911337,0.002739214,0.0013423347,0.0025290232,0.002344543],"domain_scores_gemma":[0.9863508,0.005089802,0.0040566544,0.002663885,0.00056942704,0.0012694593],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","research_integrity","insufficient_payload"],"consensus_categories":["sts","research_integrity","insufficient_payload"],"category_scores_codex":[0.006199726,0.0010422685,0.0005956627,0.00050013524,0.0036401418,0.0019146566,0.003265577,0.0025927331,0.075143896],"category_scores_gemma":[0.004615697,0.001655442,0.0028827304,0.0011175413,0.0028918397,0.0018463787,0.0016420876,0.0029830614,0.0010718269],"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.004526382,0.0005847458,0.0000070028423,0.0007899318,0.0019033434,0.00039896482,0.002470749,0.00014027051,0.004302559,0.790733,0.19281292,0.0013301698],"study_design_scores_gemma":[0.003115276,0.0024710246,0.00002772729,0.00085757644,0.0022808297,0.0019141095,0.0036091653,0.002040497,0.8045479,0.15745772,0.020202726,0.0014754547],"about_ca_topic_score_codex":0.00025001366,"about_ca_topic_score_gemma":0.0005140413,"teacher_disagreement_score":0.80024534,"about_ca_system_score_codex":0.000026100084,"about_ca_system_score_gemma":0.0018190574,"threshold_uncertainty_score":0.9998217},"labels":[],"label_agreement":null},{"id":"W2162051090","doi":"10.1016/j.jctb.2005.09.005","title":"On Rota's conjecture and excluded minors containing large projective geometries","year":2005,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":34,"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":"Marsden Fund; Natural Sciences and Engineering Research Council of Canada","keywords":"Minor (academic); Matroid; Conjecture; Projective test; Projective plane; Combinatorics; Projective geometry; Mathematics; Class (philosophy); Finite geometry; Projective space; Pure mathematics; Algebraic geometry; Geometry; Computer science; Art; Artificial intelligence; Humanities","score_opus":0.010669057554638726,"score_gpt":0.2770127638668002,"score_spread":0.2663437063121615,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2162051090","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.93643993,0.0014702023,0.05171362,0.0017247634,0.00394492,0.00055315875,0.000012392687,0.000108866945,0.004032136],"genre_scores_gemma":[0.996579,0.000056507317,0.0024462664,0.0001797389,0.00046819498,0.000005925781,4.8267145e-7,0.000018432873,0.00024546572],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99773425,0.00047637324,0.0004609697,0.00026107024,0.00062645995,0.0004408634],"domain_scores_gemma":[0.9973001,0.0013034608,0.00043592922,0.0003450906,0.00042002875,0.00019542189],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026356135,0.00023507369,0.00045831478,0.00050903525,0.00029780096,0.00022264947,0.00082146627,0.00011841866,0.00004305511],"category_scores_gemma":[0.0013763632,0.00018575379,0.00012550938,0.00064787,0.00026236716,0.0016196541,0.0002747083,0.0006594556,0.000005376435],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0019744723,0.000121163124,0.00012803753,0.000009701464,0.0000844673,0.000057185753,0.0020144598,0.000029668761,0.00030885282,0.98718625,0.00015279868,0.007932959],"study_design_scores_gemma":[0.0028514976,0.0031728875,0.00027363916,0.00006156518,0.000012677438,0.00024406426,0.0007264028,0.00003714812,0.011303521,0.9690886,0.012003084,0.0002249147],"about_ca_topic_score_codex":8.3468154e-7,"about_ca_topic_score_gemma":0.0000017537187,"teacher_disagreement_score":0.060139045,"about_ca_system_score_codex":0.00011678779,"about_ca_system_score_gemma":0.0001760485,"threshold_uncertainty_score":0.757482},"labels":[],"label_agreement":null},{"id":"W2162598482","doi":"10.1006/jctb.2000.1963","title":"The Excluded Minors for GF(4)-Representable Matroids","year":2000,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":105,"is_retracted":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; Combinatorics; GF(2); Mathematics; Computer science; Finite field","score_opus":0.012505341486421347,"score_gpt":0.28252195724150875,"score_spread":0.2700166157550874,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2162598482","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48278478,0.009039613,0.37563023,0.015556116,0.05127778,0.0036664098,0.00003574699,0.00052159384,0.06148776],"genre_scores_gemma":[0.94688904,0.00089163054,0.01979956,0.00026106197,0.002658059,0.00007538418,0.0000017086942,0.000083172265,0.029340405],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99757606,0.00049491687,0.00058473943,0.00020748902,0.0006166329,0.00052015134],"domain_scores_gemma":[0.9967272,0.0016409431,0.00030113597,0.00070052914,0.00044807137,0.00018210667],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003382055,0.00018225715,0.00032379403,0.000110105204,0.0006381573,0.00036979455,0.002374902,0.00007608746,0.00012859178],"category_scores_gemma":[0.0004969822,0.00012192123,0.00028288824,0.0004407145,0.0003327017,0.0014592528,0.00016900031,0.00034182775,0.000018074976],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0020800952,0.000071734976,0.00002416524,0.000007673475,0.00007374103,0.000015560548,0.00026202854,0.0000810728,0.00058790774,0.96559346,0.00291904,0.02828351],"study_design_scores_gemma":[0.0011891251,0.000667971,0.000032346055,0.000014402309,0.000010150129,0.00011393442,0.0001441625,0.000072749375,0.0070502455,0.82348603,0.16709799,0.00012091584],"about_ca_topic_score_codex":0.0000013120224,"about_ca_topic_score_gemma":6.704346e-7,"teacher_disagreement_score":0.46410426,"about_ca_system_score_codex":0.000068779205,"about_ca_system_score_gemma":0.00016442104,"threshold_uncertainty_score":0.4971803},"labels":[],"label_agreement":null},{"id":"W2167749725","doi":"10.1016/j.jctb.2015.05.004","title":"Trees, ladders and graphs","year":2015,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Topology and Set 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 Toronto","funders":"","keywords":"Uncountable set; Mathematics; Combinatorics; Chromatic scale; Construct (python library); Discrete mathematics; Computer science; Countable set","score_opus":0.03221105724628146,"score_gpt":0.29962886522785925,"score_spread":0.26741780798157777,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2167749725","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9594134,0.0020683527,0.0029496748,0.0009820539,0.011662383,0.00018818147,0.000005534256,0.000072780764,0.022657657],"genre_scores_gemma":[0.99609375,0.000084838546,0.002554261,0.00007758745,0.00038811934,0.0000012183209,4.1581126e-7,0.00002013757,0.0007796474],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988616,0.0003387679,0.0003625381,0.00007991228,0.00019702071,0.00016013008],"domain_scores_gemma":[0.99853104,0.0006060317,0.00033292692,0.00015030766,0.00020778137,0.0001718909],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017185668,0.00012841352,0.00034465388,0.000096476964,0.0000793796,0.000018617424,0.00017262354,0.000111335205,0.000055257828],"category_scores_gemma":[0.0014690263,0.00010021567,0.00008261403,0.00009224042,0.000389607,0.00039696775,0.00004688792,0.00027417115,0.0000024292574],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015307359,0.000070541544,0.000102413425,0.000008483593,0.000079541576,0.00004912767,0.0010971263,0.0000015322246,0.00006691002,0.9938451,0.0025162026,0.0006322653],"study_design_scores_gemma":[0.0017361869,0.0006455306,0.000022318443,0.000020859241,0.00005605385,0.00034341073,0.0025719213,4.572258e-7,0.00066177273,0.9817512,0.0120833125,0.00010697519],"about_ca_topic_score_codex":4.1800598e-7,"about_ca_topic_score_gemma":0.0000011021574,"teacher_disagreement_score":0.036680393,"about_ca_system_score_codex":0.000024975447,"about_ca_system_score_gemma":0.00008120009,"threshold_uncertainty_score":0.40866765},"labels":[],"label_agreement":null},{"id":"W2171207326","doi":"10.1016/j.jctb.2014.12.006","title":"Representability of matroids with a large projective geometry minor","year":2014,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Finite Group Theory Research","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":"Office of Naval Research","keywords":"Matroid; Prime power; Rank (graph theory); Oriented matroid; Integer (computer science); Projective geometry; Prime (order theory); Order (exchange)","score_opus":0.021755493012433003,"score_gpt":0.31108328658130413,"score_spread":0.2893277935688711,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2171207326","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9883725,0.00004490859,0.0026425922,0.0000892268,0.0009989397,0.00035357222,0.000014591223,0.000025004492,0.007458641],"genre_scores_gemma":[0.99633217,0.000005659749,0.0026953302,0.000011054005,0.00046888768,0.00000757725,8.7267983e-7,0.000041367373,0.00043709637],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9962727,0.0014273684,0.00082833983,0.00019791056,0.00089960825,0.0003741025],"domain_scores_gemma":[0.9944063,0.0028689792,0.0009035091,0.0006342702,0.0010438658,0.00014309793],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008490865,0.00021760723,0.0007714795,0.00029743047,0.00010227527,0.000040997496,0.0005732371,0.00013270171,0.00026990118],"category_scores_gemma":[0.0061344802,0.00015366077,0.00022172542,0.00051691284,0.0004278486,0.0004691933,0.0001777945,0.00053224945,0.0000041523667],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.009373767,0.0007790344,0.004059592,0.00025143963,0.00024348115,0.000016907376,0.0013917808,0.0000010563359,0.0011754505,0.9820405,0.00035228624,0.00031470603],"study_design_scores_gemma":[0.0029574384,0.0033281222,0.00077137875,0.00011525392,0.000088067,0.00014686407,0.0020023778,0.000005789905,0.018626425,0.97027993,0.001512328,0.00016602708],"about_ca_topic_score_codex":0.0000037000482,"about_ca_topic_score_gemma":0.0000024370504,"teacher_disagreement_score":0.017450975,"about_ca_system_score_codex":0.0001018101,"about_ca_system_score_gemma":0.00019142058,"threshold_uncertainty_score":0.7343989},"labels":[],"label_agreement":null},{"id":"W2188204494","doi":"10.1016/j.jctb.2015.06.002","title":"On the crossing number of <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.gif\" overflow=\"scroll\"><mml:msub><mml:mrow><mml:mi>K</mml:mi></mml:mrow><mml:mrow><mml:mn>13</mml:mn></mml:mrow></mml:msub></mml:math>","year":2015,"lang":"lv","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":22,"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":"Scroll; Parity (physics); Simple (philosophy); Mathematics; Discrete mathematics; Computer science; Combinatorics; Physics; Theology; Particle physics; Philosophy","score_opus":0.01957744043638374,"score_gpt":0.2515529048650365,"score_spread":0.23197546442865277,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2188204494","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6618028,0.0007928045,0.002810408,0.0009154398,0.011980504,0.000030943465,0.00006703319,0.00007354729,0.32152647],"genre_scores_gemma":[0.9918294,0.00029493158,0.0019044642,0.0012299371,0.0038328154,0.0001155485,0.0001155086,0.00025827842,0.0004191437],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.992372,0.0008620485,0.001784529,0.00089621946,0.0027895744,0.0012956628],"domain_scores_gemma":[0.99225634,0.0022866614,0.0026898263,0.0014755502,0.00049642596,0.0007951843],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0045481822,0.0005824687,0.00033338793,0.00038830526,0.0015322613,0.0021273247,0.002203498,0.0011456177,0.16143316],"category_scores_gemma":[0.002718612,0.000925665,0.001302187,0.0012067339,0.0014579967,0.002299889,0.0013500771,0.0014326046,0.00070026144],"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.0026969172,0.00030351063,0.00000856237,0.00026945368,0.00079287123,0.00050678966,0.003125605,0.004286032,0.001121649,0.8073876,0.17767191,0.0018291294],"study_design_scores_gemma":[0.0026460458,0.0028615498,0.00008133262,0.0009942042,0.0006416068,0.0018360626,0.0016373036,0.029459411,0.93926466,0.011125505,0.008457347,0.0009949658],"about_ca_topic_score_codex":0.00024218597,"about_ca_topic_score_gemma":0.00011674688,"teacher_disagreement_score":0.938143,"about_ca_system_score_codex":0.00002451205,"about_ca_system_score_gemma":0.0027213215,"threshold_uncertainty_score":0.9997676},"labels":[],"label_agreement":null},{"id":"W2204554537","doi":"10.1016/j.jctb.2016.11.001","title":"Small cores in 3-uniform hypergraphs","year":2016,"lang":"en","type":"preprint","venue":"Journal of Combinatorial Theory Series B","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia; University of Toronto","funders":"European Research Council; Natural Sciences and Engineering Research Council of Canada","keywords":"Hypergraph; Combinatorics; Conjecture; Mathematics; Set (abstract data type); Core (optical fiber); Discrete mathematics; Computer science","score_opus":0.03283367440446975,"score_gpt":0.27851336671257326,"score_spread":0.24567969230810352,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2204554537","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9395182,0.001184275,0.00065957406,0.00032381725,0.03813961,0.0004632882,0.000048203106,0.000061240025,0.019601772],"genre_scores_gemma":[0.99436927,0.00056360493,0.0021438207,0.000058542082,0.0021986666,0.000010158451,0.000002050026,0.00008881064,0.00056509953],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9965615,0.0006658964,0.0015018105,0.0002800175,0.0005608589,0.00042987647],"domain_scores_gemma":[0.9953957,0.0015042183,0.0017051685,0.0007444718,0.00047840172,0.0001720041],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0033189992,0.000513348,0.0012890901,0.00060145755,0.00015188548,0.00009168269,0.001316001,0.00067066564,0.0001914457],"category_scores_gemma":[0.0014684249,0.00034045757,0.00066249224,0.00017216877,0.00041559298,0.00024296754,0.00089933927,0.0015521557,0.0000017923697],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0021698112,0.00014226076,0.00043296977,0.00022106743,0.00028320245,0.00013845351,0.001333522,0.000004753714,0.00009107605,0.99327844,0.00073030597,0.0011741269],"study_design_scores_gemma":[0.0017498205,0.0003803934,0.000197452,0.00087303447,0.00012567049,0.00015338068,0.00031768525,7.4381785e-7,0.0010793183,0.9910985,0.0036141265,0.00040986857],"about_ca_topic_score_codex":0.0000023525683,"about_ca_topic_score_gemma":0.000005304249,"teacher_disagreement_score":0.054851025,"about_ca_system_score_codex":0.00016144822,"about_ca_system_score_gemma":0.0002871803,"threshold_uncertainty_score":0.99990475},"labels":[],"label_agreement":null},{"id":"W2226875859","doi":"10.1016/j.jctb.2017.04.001","title":"Tournaments, 4-uniform hypergraphs, and an exact extremal result","year":2017,"lang":"en","type":"preprint","venue":"Journal of Combinatorial Theory Series B","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Connection (principal bundle); Combinatorics; Mathematics; Quadratic equation; Set (abstract data type); Subject (documents); Discrete mathematics; Computer science; Geometry","score_opus":0.0358942755046791,"score_gpt":0.32392821689909135,"score_spread":0.28803394139441224,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2226875859","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95948106,0.0017778458,0.0002301301,0.00023248029,0.026739262,0.00041574912,0.000070534035,0.00006140388,0.010991527],"genre_scores_gemma":[0.9895653,0.0014980998,0.004144523,0.000045851924,0.003924948,0.0000058208643,0.0000069738776,0.00009949212,0.0007089758],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9963601,0.0007158749,0.0013090402,0.00038403357,0.0008030624,0.00042788865],"domain_scores_gemma":[0.99407494,0.00060436217,0.0029691537,0.0013595808,0.0006157829,0.00037615703],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0041930606,0.00061145175,0.0013424343,0.00035630725,0.0008217483,0.0005221543,0.0015958284,0.000695763,0.00012095902],"category_scores_gemma":[0.0015604775,0.00046436614,0.00049730664,0.000059853526,0.0006496039,0.0008825331,0.0011465222,0.0019131693,5.7685435e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0029166203,0.00019273799,0.0001975927,0.00022735393,0.00057210954,0.00017279695,0.0022410355,0.0000039309534,0.000104687984,0.9888496,0.0011591479,0.0033623825],"study_design_scores_gemma":[0.0018277593,0.00084866694,0.00027275315,0.0005008378,0.00037457232,0.0004435271,0.0006391407,0.0000040981818,0.00048725103,0.98740375,0.006701963,0.0004956908],"about_ca_topic_score_codex":0.0000058700966,"about_ca_topic_score_gemma":0.00000313635,"teacher_disagreement_score":0.030084247,"about_ca_system_score_codex":0.00010076597,"about_ca_system_score_gemma":0.00025063174,"threshold_uncertainty_score":0.99978083},"labels":[],"label_agreement":null},{"id":"W223802390","doi":"10.1016/j.jctb.2015.12.006","title":"Three-edge-colouring doublecross cubic graphs","year":2016,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":13,"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":"Office of Naval Research; Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Combinatorics; Cubic graph; Planar graph; Mathematics; Graph minor; Petersen graph; Vertex (graph theory); Graph; Discrete mathematics; Line graph; Voltage graph","score_opus":0.016231280750028027,"score_gpt":0.27468993591215546,"score_spread":0.2584586551621274,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W223802390","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4008601,0.00094271457,0.57265186,0.002129553,0.01971948,0.0003572555,0.0000044540243,0.00019521578,0.003139392],"genre_scores_gemma":[0.99415827,0.00012466297,0.0046446538,0.000051548035,0.00059199263,0.0000070709384,1.08106214e-7,0.00003047481,0.00039122681],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973113,0.00034358428,0.0006617672,0.00028911713,0.0008031806,0.0005910786],"domain_scores_gemma":[0.9968657,0.0009021425,0.0005415634,0.0007318776,0.00065981055,0.0002989038],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031107296,0.00024701038,0.00045242772,0.0003855547,0.0002981878,0.0002244493,0.0023708865,0.000120959805,0.0000736813],"category_scores_gemma":[0.000596916,0.00015931603,0.00029608564,0.0007112115,0.0004718978,0.0028579768,0.00048588254,0.0004069382,0.00003494282],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009690059,0.0000855897,0.00047716757,0.000009349487,0.00007528674,0.00010786306,0.00019585673,0.0000063640623,0.008273088,0.97483426,0.00024443716,0.0147217205],"study_design_scores_gemma":[0.0022159598,0.00081603596,0.00029048964,0.00009624801,0.000009453699,0.00025016774,0.00004597764,0.0000054439624,0.030103846,0.95986295,0.0060832696,0.00022018357],"about_ca_topic_score_codex":9.435565e-7,"about_ca_topic_score_gemma":0.0000013202794,"teacher_disagreement_score":0.59329814,"about_ca_system_score_codex":0.00012561545,"about_ca_system_score_gemma":0.00023093443,"threshold_uncertainty_score":0.64967185},"labels":[],"label_agreement":null},{"id":"W2254274951","doi":"10.1016/j.jctb.2016.05.010","title":"A new proof of Seymour's 6-flow theorem","year":2016,"lang":"en","type":"preprint","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; Grantová Agentura České Republiky; Ministerstvo Školství, Mládeže a Tělovýchovy","keywords":"Conjecture; Mathematics; Flow (mathematics); Graph; Robertson–Seymour theorem; Combinatorics; Discrete mathematics; Perspective (graphical); Line graph; Pathwidth; Geometry","score_opus":0.015234688365248295,"score_gpt":0.28032227102838037,"score_spread":0.2650875826631321,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2254274951","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0033730373,0.0017991378,0.96787715,0.0014778691,0.01904223,0.00058754254,0.00002610388,0.00007664706,0.0057402644],"genre_scores_gemma":[0.8449177,0.0004938034,0.14355978,0.000108578795,0.0059676804,0.000027686541,0.0000038659673,0.0001902827,0.0047305874],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99459046,0.0013669578,0.0014413624,0.0004979122,0.001512535,0.0005907834],"domain_scores_gemma":[0.9929536,0.0010757454,0.0023877863,0.0016522955,0.0014869532,0.00044359494],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.004844645,0.00051862677,0.0013000034,0.0006388611,0.00011798189,0.00020356887,0.005144533,0.00044417198,0.00015341412],"category_scores_gemma":[0.0012421018,0.00037173126,0.00073590653,0.00049045356,0.0004824182,0.0012968103,0.0026973437,0.0014667514,0.0000070077936],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0018974307,0.00013632412,0.000019942629,0.00011588266,0.00030313848,0.00008859061,0.0008183278,0.00018853882,0.00076387974,0.9518642,0.00088883104,0.042914946],"study_design_scores_gemma":[0.0016409133,0.0010506217,0.000014607215,0.00065514515,0.000042098996,0.00016480846,0.000058277543,0.000038906608,0.036507435,0.95434564,0.005120792,0.0003607229],"about_ca_topic_score_codex":0.0000016604771,"about_ca_topic_score_gemma":3.5801366e-7,"teacher_disagreement_score":0.8415447,"about_ca_system_score_codex":0.00019243185,"about_ca_system_score_gemma":0.0020131192,"threshold_uncertainty_score":0.99987346},"labels":[],"label_agreement":null},{"id":"W2275781839","doi":"10.1016/j.jctb.2017.05.008","title":"The structure of matroids with a spanning clique or projective geometry","year":2017,"lang":"en","type":"preprint","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Office of Naval Research; Natural Sciences and Engineering Research Council of Canada","keywords":"Matroid; Combinatorics; Oriented matroid; Mathematics; Graphic matroid; Weighted matroid; Matroid partitioning; Projective geometry; Projective plane; Minor (academic); Discrete mathematics; Geometry; Algebraic geometry","score_opus":0.016436985967622077,"score_gpt":0.3087211658203098,"score_spread":0.29228417985268773,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2275781839","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.71018684,0.0044408226,0.23994575,0.0020874212,0.036935274,0.0029994382,0.000113988826,0.00017844001,0.0031120286],"genre_scores_gemma":[0.98723227,0.00029127905,0.011103351,0.000015562859,0.00084094965,0.0000075722583,0.0000010504791,0.0000479379,0.00046000053],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9959552,0.0010663873,0.00085606985,0.00039702485,0.0012318143,0.0004934815],"domain_scores_gemma":[0.9916402,0.0014190692,0.0031292944,0.0017779259,0.0018673933,0.00016613121],"candidate_categories":["open_science","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0033420403,0.0004279905,0.00095393666,0.0004083846,0.00062213076,0.0006323446,0.005473545,0.00033048535,0.000013650875],"category_scores_gemma":[0.0019134535,0.00022786134,0.00030387222,0.00040575193,0.0010793378,0.0011085767,0.002190968,0.0025085453,5.9622954e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.009474478,0.00007024168,0.00017490897,0.00015434485,0.00056606974,0.0001713921,0.001543107,0.0003620892,0.00071618444,0.98271936,0.00009032775,0.0039575165],"study_design_scores_gemma":[0.0010830318,0.0020943566,0.00020044885,0.0005509925,0.000048572732,0.0004333411,0.0005230712,0.000028265693,0.013217966,0.9799928,0.0015457955,0.0002813798],"about_ca_topic_score_codex":0.0000053034973,"about_ca_topic_score_gemma":0.000005286536,"teacher_disagreement_score":0.27704546,"about_ca_system_score_codex":0.000168566,"about_ca_system_score_gemma":0.0019087794,"threshold_uncertainty_score":0.9999073},"labels":[],"label_agreement":null},{"id":"W2289102318","doi":"10.1016/j.jctb.2016.12.006","title":"A proof of the Barát–Thomassen conjecture","year":2017,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"European Research Council; Centre International de Mathématiques et Informatique de Toulouse; Fonds Québécois de la Recherche sur la Nature et les Technologies; Agence Nationale de la Recherche","keywords":"Mathematics; Conjecture; Combinatorics; Bar (unit); Discrete mathematics","score_opus":0.019120371912559903,"score_gpt":0.2882693660115007,"score_spread":0.26914899409894083,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2289102318","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9732065,0.00021991911,0.00017348523,0.00070328475,0.01399433,0.00026380128,0.000010200424,0.000011292259,0.011417192],"genre_scores_gemma":[0.9980633,0.000011542061,0.0005007249,0.000029506547,0.0008507471,0.000001476338,8.8109935e-8,0.000023567463,0.00051904377],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998273,0.00037938342,0.00060371665,0.0000964373,0.00046436358,0.00018308942],"domain_scores_gemma":[0.99636185,0.0005235212,0.0017828892,0.0009052018,0.00035616837,0.000070365655],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018077082,0.00017250018,0.0005107542,0.000056367688,0.00065583613,0.000079456324,0.0013982212,0.00015578986,0.000089695684],"category_scores_gemma":[0.0023894496,0.00009789036,0.00038256773,0.000059905924,0.0006543037,0.00034028923,0.00032593936,0.0004450014,2.1847174e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007003228,0.000067353125,0.00050758244,0.00006248714,0.00017052551,0.000012179937,0.0011062558,0.0000014897315,0.0005123012,0.99521,0.00081166916,0.00083781144],"study_design_scores_gemma":[0.0012079529,0.00030963737,0.0011092507,0.00012217827,0.000111850386,0.0001475705,0.00022180303,6.116799e-7,0.031351097,0.9610955,0.004212196,0.00011035767],"about_ca_topic_score_codex":8.8512684e-7,"about_ca_topic_score_gemma":0.0000011510643,"teacher_disagreement_score":0.034114525,"about_ca_system_score_codex":0.000026369173,"about_ca_system_score_gemma":0.00012366122,"threshold_uncertainty_score":0.5044228},"labels":[],"label_agreement":null},{"id":"W2293176046","doi":"10.1016/j.jctb.2016.05.007","title":"On the Corrádi–Hajnal theorem and a question of Dirac","year":2016,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"National Security Agency; Russian Foundation for Basic Research; National Science Foundation","keywords":"Combinatorics; Disjoint sets; Mathematics; Graph; Vertex (graph theory); Independence number; Discrete mathematics","score_opus":0.013864062301766466,"score_gpt":0.2627733450029747,"score_spread":0.24890928270120827,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2293176046","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99074703,0.00015278399,0.0007535975,0.000553151,0.0033836248,0.00012417312,0.000007990688,0.000012770053,0.0042648776],"genre_scores_gemma":[0.9990121,0.00010015529,0.00020692497,0.000057568857,0.00038188422,0.0000015388971,7.2471146e-8,0.000017932409,0.00022179035],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982438,0.00065916387,0.00050243567,0.000090165886,0.00036086846,0.00014353826],"domain_scores_gemma":[0.99466246,0.004086634,0.00066351757,0.00026889937,0.00025492418,0.00006354263],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029241932,0.00015288967,0.00035581365,0.00008638264,0.00016254126,0.000021818782,0.00030100593,0.00009421556,0.00017516196],"category_scores_gemma":[0.002638269,0.00006546959,0.0001448504,0.000084045445,0.0005280745,0.00020380736,0.00008009331,0.00020735528,7.4771356e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002802001,0.000060700877,0.00006737156,0.000018648803,0.00009153955,0.0000063134353,0.00087217696,1.8584848e-7,0.0011889713,0.9923263,0.00050708797,0.0020586585],"study_design_scores_gemma":[0.00090302905,0.0010455318,0.00013938558,0.00023141775,0.000058736667,0.000095538795,0.0003249916,4.2079702e-7,0.006842692,0.98943186,0.0008346045,0.00009177056],"about_ca_topic_score_codex":3.811244e-7,"about_ca_topic_score_gemma":2.1469351e-7,"teacher_disagreement_score":0.008265101,"about_ca_system_score_codex":0.000028438995,"about_ca_system_score_gemma":0.000042560263,"threshold_uncertainty_score":0.3158445},"labels":[],"label_agreement":null},{"id":"W2293828016","doi":"10.1016/j.jctb.2017.09.010","title":"Characterizing 4-critical graphs with Ore-degree at most seven","year":2017,"lang":"en","type":"preprint","venue":"Journal of Combinatorial Theory Series B","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Conjecture; Graph; Degree (music); Discrete mathematics; Generalization; Physics","score_opus":0.03701311694568272,"score_gpt":0.3034976166614376,"score_spread":0.2664844997157549,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2293828016","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9448269,0.00083692657,0.00042043978,0.0008342415,0.037394766,0.0005426904,0.00012838497,0.00010781734,0.014907813],"genre_scores_gemma":[0.9927802,0.00024989006,0.0031723396,0.00009149814,0.0026999828,0.000012725233,0.000009547931,0.00014714358,0.0008366926],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9961268,0.00069447217,0.0012006306,0.00041240608,0.0010176783,0.00054806174],"domain_scores_gemma":[0.99349207,0.0015018692,0.0023364527,0.0014128598,0.00093131786,0.0003254386],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0027095128,0.00070325093,0.0016001486,0.00029521738,0.0009998304,0.00036213337,0.0017777963,0.0006978715,0.00025792044],"category_scores_gemma":[0.0025302817,0.0004934887,0.0005887582,0.00009545069,0.0011506857,0.00054028817,0.0016664692,0.0021290837,0.0000028134334],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0047191987,0.00014292893,0.00018135952,0.0004445759,0.0007249095,0.00032783247,0.0025609613,0.0000013327692,0.00029917786,0.9888987,0.0008756452,0.0008234074],"study_design_scores_gemma":[0.001321095,0.0007255299,0.00022440894,0.0010812253,0.00052291976,0.00090114743,0.00028829832,0.00000104301,0.0016595507,0.9856064,0.0070712604,0.0005971522],"about_ca_topic_score_codex":0.000002172082,"about_ca_topic_score_gemma":0.0000028565166,"teacher_disagreement_score":0.04795326,"about_ca_system_score_codex":0.00018677575,"about_ca_system_score_gemma":0.00034953194,"threshold_uncertainty_score":0.9997517},"labels":[],"label_agreement":null},{"id":"W2305610210","doi":"10.1016/j.jctb.2016.01.006","title":"Stabilizer theorems for even cycle matroids","year":2016,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Seventh Framework Programme; European Research Council","keywords":"Matroid; Combinatorics; Mathematics; Matroid partitioning; Graphic matroid; Minor (academic); Discrete mathematics; Graph","score_opus":0.011781528074291387,"score_gpt":0.27753434757196466,"score_spread":0.26575281949767326,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2305610210","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.095123515,0.0003817414,0.8904815,0.0026574808,0.008817768,0.00046268117,0.000015126538,0.000098712095,0.0019614957],"genre_scores_gemma":[0.9860543,0.000066158726,0.012109524,0.000061607614,0.0007498062,0.000017273325,2.2970995e-7,0.00003334107,0.0009077517],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976694,0.0004909792,0.00057224877,0.00023673684,0.0005682215,0.00046242328],"domain_scores_gemma":[0.99623793,0.0017944622,0.00042442346,0.0006169853,0.00071665156,0.00020953533],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036874516,0.00019583487,0.00039545266,0.00020806132,0.00017803336,0.00011497437,0.0017535916,0.00009373503,0.00008571684],"category_scores_gemma":[0.0012565245,0.00011921672,0.0002946067,0.00030739213,0.00033450892,0.001996927,0.00025525826,0.00019518436,0.000013960696],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015541872,0.0000848089,0.00006283878,0.000010970721,0.000058825917,0.000012093578,0.0002516177,0.000007105325,0.011245181,0.97378826,0.0003299956,0.012594092],"study_design_scores_gemma":[0.0022562612,0.0012675176,0.000049420694,0.000050746607,0.000010005506,0.00008635039,0.00009281791,0.000011133986,0.02314605,0.9504191,0.022438506,0.00017204932],"about_ca_topic_score_codex":2.907656e-7,"about_ca_topic_score_gemma":2.3358332e-7,"teacher_disagreement_score":0.8909308,"about_ca_system_score_codex":0.00011368737,"about_ca_system_score_gemma":0.00020142358,"threshold_uncertainty_score":0.48615167},"labels":[],"label_agreement":null},{"id":"W2515761800","doi":"10.1016/j.jctb.2017.06.004","title":"Five-list-coloring graphs on surfaces III. One list of size one and one list of size two","year":2017,"lang":"en","type":"preprint","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Combinatorics; Mathematics; Lemma (botany); Bounded function; Vertex (graph theory); Graph; Planar graph; List coloring; Discrete mathematics; Mathematical analysis","score_opus":0.028470303022839833,"score_gpt":0.30270284349428384,"score_spread":0.274232540471444,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2515761800","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9786107,0.0021072086,0.0025190876,0.00095532206,0.01010167,0.00086802227,0.000082674436,0.000075931406,0.0046793865],"genre_scores_gemma":[0.9909414,0.0015245683,0.0060872748,0.000028882137,0.0005851532,0.000013875038,0.0000021861583,0.00006252194,0.0007541576],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9934824,0.0013177344,0.0018010719,0.0007533249,0.0019710776,0.00067440985],"domain_scores_gemma":[0.9866935,0.0048899553,0.0041602864,0.0020521113,0.0017970253,0.00040711384],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0064207395,0.00065083976,0.0022755223,0.00050745124,0.00045835713,0.00045453044,0.0043428363,0.00042973383,0.00009648224],"category_scores_gemma":[0.0046571014,0.0006408115,0.0005835222,0.0004486339,0.001869981,0.0012613906,0.0029303615,0.0022358098,0.0000018157639],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0065974374,0.0010332486,0.00035150244,0.00053596287,0.0008045416,0.00007363465,0.0015752416,0.00045383323,0.013920251,0.9724919,0.000056397694,0.002106048],"study_design_scores_gemma":[0.0036586993,0.0022505212,0.0011835505,0.0017967348,0.00012755921,0.000031151652,0.00018494717,0.000055139244,0.048863377,0.94099754,0.00032761166,0.00052315625],"about_ca_topic_score_codex":0.00019036148,"about_ca_topic_score_gemma":0.000039662267,"teacher_disagreement_score":0.034943126,"about_ca_system_score_codex":0.0001799975,"about_ca_system_score_gemma":0.0006946402,"threshold_uncertainty_score":0.99960434},"labels":[],"label_agreement":null},{"id":"W2516346504","doi":"10.1016/j.jctb.2016.07.009","title":"Properties of regular graphs with large girth via local algorithms","year":2016,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","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":"Fundação de Amparo à Pesquisa do Estado do Rio Grande do Sul; Australian Research Council; Conselho Nacional de Desenvolvimento Científico e Tecnológico; Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Mathematics; Combinatorics; Girth (graph theory); Discrete mathematics; Upper and lower bounds","score_opus":0.009874030088849246,"score_gpt":0.23027590097219577,"score_spread":0.22040187088334653,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2516346504","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0984369,0.0007403746,0.8977489,0.0005178684,0.0020099634,0.00020119324,0.000004287944,0.000048713802,0.000291784],"genre_scores_gemma":[0.9938647,0.00008204872,0.0055570244,0.000024977959,0.00015698593,0.000004817456,1.1861027e-7,0.000024045701,0.00028526277],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971881,0.0005757804,0.0006008756,0.00023425491,0.0009530191,0.00044800484],"domain_scores_gemma":[0.9973837,0.0002363169,0.00057922007,0.00062965066,0.0009732821,0.00019784035],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023819704,0.00022357692,0.00050532486,0.0003082407,0.00014238167,0.00005344323,0.0014726879,0.000092317365,0.000028746012],"category_scores_gemma":[0.00019265077,0.00011891636,0.0001798623,0.0005981693,0.00083916815,0.0019012765,0.0002760806,0.0002746182,0.0000045055417],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0022712264,0.00018981655,0.00011410417,0.000028235954,0.00013005234,0.00007324385,0.0003869812,0.000010179758,0.017891541,0.96231973,0.00004629474,0.016538564],"study_design_scores_gemma":[0.0023477417,0.0021513742,0.000063114036,0.00022826287,0.000014280988,0.00024030927,0.00018454492,0.00002577498,0.17799348,0.81401986,0.0025499256,0.00018131183],"about_ca_topic_score_codex":0.0000010569704,"about_ca_topic_score_gemma":7.7195926e-7,"teacher_disagreement_score":0.8954278,"about_ca_system_score_codex":0.00006435217,"about_ca_system_score_gemma":0.00020548148,"threshold_uncertainty_score":0.48492682},"labels":[],"label_agreement":null},{"id":"W2519651985","doi":"10.1016/j.jctb.2017.05.006","title":"Layered separators in minor-closed graph classes with applications","year":2017,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":54,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; University of Ottawa","funders":"Australian Research Council; Natural Sciences and Engineering Research Council of Canada; Ontario Ministry of Research, Innovation and Science","keywords":"Mathematics; Combinatorics; Graph; Minor (academic); Discrete mathematics; Humanities","score_opus":0.015371805154149988,"score_gpt":0.29770729704332677,"score_spread":0.2823354918891768,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2519651985","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.66246855,0.00094483764,0.30698738,0.002384416,0.0057221167,0.0013979077,0.000011466569,0.0001515156,0.019931821],"genre_scores_gemma":[0.9933226,0.0000607751,0.0061094095,0.000029779481,0.00022946214,0.000025103871,3.4798356e-7,0.000016802212,0.0002057004],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998093,0.0003287971,0.000453308,0.00023585474,0.0005427398,0.0003462841],"domain_scores_gemma":[0.9972307,0.00035508475,0.0007297004,0.0010685099,0.00043651,0.0001794899],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015506465,0.00018836757,0.00038493265,0.0003392368,0.0004436316,0.0003998016,0.002604816,0.000086767046,0.000014707251],"category_scores_gemma":[0.00026886925,0.00014674153,0.00011431231,0.0004127005,0.0004664055,0.002331081,0.00025658731,0.00045729545,0.000006970436],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008212189,0.0001463821,0.0024574143,0.000011418745,0.000048981008,0.00008712111,0.0002347463,0.000053283165,0.00071622065,0.9927591,0.00007306963,0.00259104],"study_design_scores_gemma":[0.0019259455,0.00063944055,0.003263188,0.000048625177,0.000008457613,0.00010102637,0.0001668205,0.000012897645,0.0052000037,0.9801695,0.00827277,0.00019136602],"about_ca_topic_score_codex":0.0000032443281,"about_ca_topic_score_gemma":0.000008851009,"teacher_disagreement_score":0.33085406,"about_ca_system_score_codex":0.000066436,"about_ca_system_score_gemma":0.0002633198,"threshold_uncertainty_score":0.5983946},"labels":[],"label_agreement":null},{"id":"W2526183036","doi":"10.1016/j.jctb.2016.09.007","title":"Generalised Mycielski graphs, signature systems, and bounds on chromatic numbers","year":2016,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Topological and Geometric Data Analysis","field":"Computer Science","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":"Royal Military College of Canada","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Chromatic scale; Mathematics; Signature (topology); Combinatorics; Computer science; Geometry","score_opus":0.008151347987678085,"score_gpt":0.21954110571909125,"score_spread":0.21138975773141316,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2526183036","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8951197,0.005960771,0.05665053,0.008268254,0.02711375,0.00038801655,0.000053932352,0.00017267863,0.0062723206],"genre_scores_gemma":[0.99792296,0.00027607102,0.0005432244,0.00016148774,0.00034667176,0.0000018374759,6.0929045e-7,0.000006527789,0.00074060465],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99825954,0.0003585843,0.0004626234,0.00019951095,0.00049061736,0.00022910984],"domain_scores_gemma":[0.99823713,0.00058791396,0.00044545732,0.00035596118,0.00018669902,0.0001868451],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001191916,0.0001712427,0.00042659193,0.00030187974,0.00014667748,0.00024720986,0.0008118521,0.00012064667,0.00006531195],"category_scores_gemma":[0.0004433016,0.000090143614,0.00014854172,0.0006841263,0.00017414431,0.0009401958,0.00013783992,0.0001813819,0.000010506704],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013126551,0.000070600894,0.00009860177,0.000010122163,0.000117850745,0.000056405996,0.00007185727,0.0000068780428,0.0006916743,0.9932354,0.0028129944,0.002696365],"study_design_scores_gemma":[0.0016189626,0.0013682535,0.0006654717,0.00011177309,0.00006129358,0.00019859985,0.00008346508,0.000022210157,0.0008925681,0.96273357,0.03199773,0.0002461099],"about_ca_topic_score_codex":0.0000042468237,"about_ca_topic_score_gemma":3.0504964e-7,"teacher_disagreement_score":0.102803215,"about_ca_system_score_codex":0.000047418587,"about_ca_system_score_gemma":0.00005283862,"threshold_uncertainty_score":0.367595},"labels":[],"label_agreement":null},{"id":"W2568140225","doi":"10.1016/j.jctb.2012.11.002","title":"Flow-cut gaps for integer and fractional multiflows","year":2012,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","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":"McGill University","funders":"","keywords":"Conjecture; Mathematics; Combinatorics; Integer (computer science); Flow (mathematics); Maximum flow problem; Integer programming; Graph; Discrete mathematics; Planar graph; Mathematical optimization; Computer science; Geometry","score_opus":0.01700801821673222,"score_gpt":0.29596328350016127,"score_spread":0.27895526528342907,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2568140225","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07622166,0.0017328374,0.90047467,0.00087774236,0.019037578,0.00038325315,0.0000101617,0.000059069473,0.0012030329],"genre_scores_gemma":[0.9596093,0.00008211527,0.03805509,0.000107625514,0.0017358322,0.00001372686,9.4195275e-7,0.00002171648,0.00037361748],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984231,0.00027603665,0.0003851333,0.00013789181,0.00040351236,0.00037435343],"domain_scores_gemma":[0.99759054,0.0011535028,0.00027687813,0.00025287268,0.00046951478,0.00025669232],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027548033,0.00015119927,0.00028174664,0.0001909096,0.00020439955,0.000111067726,0.0005868725,0.00008704992,0.000043649175],"category_scores_gemma":[0.00090075453,0.0001226508,0.00014264965,0.00020330066,0.00018110772,0.0028336893,0.00018504034,0.0003570092,0.000005623881],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009581696,0.00012094735,0.00015713411,0.000015354532,0.00006061243,0.000004455002,0.00060729595,0.00003739785,0.0010572611,0.9904471,0.0005286788,0.0060055866],"study_design_scores_gemma":[0.0013572141,0.00047091927,0.00017858933,0.000026140946,0.000012904888,0.0002276447,0.00017761678,0.0004524318,0.0060396167,0.9352195,0.055683102,0.00015431987],"about_ca_topic_score_codex":3.2749466e-7,"about_ca_topic_score_gemma":1.8729519e-7,"teacher_disagreement_score":0.8833877,"about_ca_system_score_codex":0.000059975948,"about_ca_system_score_gemma":0.00009054804,"threshold_uncertainty_score":0.5001555},"labels":[],"label_agreement":null},{"id":"W2585703313","doi":"10.1016/j.jctb.2018.06.007","title":"The list chromatic number of graphs with small clique number","year":2018,"lang":"en","type":"preprint","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Clique number; Chromatic scale; Mathematics; Clique; Graph; Discrete mathematics","score_opus":0.01616007451721822,"score_gpt":0.2906845463848654,"score_spread":0.27452447186764717,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2585703313","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.80368775,0.0010821401,0.134869,0.0016304695,0.031863097,0.0016351908,0.000030034082,0.00019641711,0.025005883],"genre_scores_gemma":[0.96934897,0.000609779,0.027790824,0.00006677734,0.0011670225,0.00003696149,0.0000023319672,0.00009617916,0.00088118063],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.994725,0.0017190281,0.0013171685,0.0004211068,0.0012361651,0.00058155315],"domain_scores_gemma":[0.99157786,0.001841116,0.0024114982,0.0017747305,0.0021382095,0.0002565867],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.005745589,0.00049301784,0.0010052162,0.00017786706,0.00038775514,0.00043984933,0.0048273276,0.00033343933,0.00010063447],"category_scores_gemma":[0.00079067127,0.00030632553,0.00049479713,0.0006560185,0.001749613,0.0007062634,0.0017985228,0.0017402902,0.000018518163],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0018493156,0.00016536571,0.0006270641,0.00015337858,0.000442028,0.00007539678,0.0008021572,0.000029272058,0.000072764495,0.994336,0.00040302868,0.0010442124],"study_design_scores_gemma":[0.0009990183,0.0007538752,0.00014811692,0.0005581168,0.00005899642,0.00057486043,0.00015869174,0.000023040247,0.0035360784,0.98818344,0.00466933,0.00033641735],"about_ca_topic_score_codex":0.00000826301,"about_ca_topic_score_gemma":0.0000071103245,"teacher_disagreement_score":0.16566117,"about_ca_system_score_codex":0.0001293545,"about_ca_system_score_gemma":0.00092494657,"threshold_uncertainty_score":0.9999389},"labels":[],"label_agreement":null},{"id":"W2605561794","doi":"10.1016/j.jctb.2017.04.002","title":"Rainbow triangles in three-colored graphs","year":2017,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":32,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"National Science Foundation","keywords":"Rainbow; Combinatorics; Flag (linear algebra); Colored; Conjecture; Mathematics; Limit (mathematics); Discrete mathematics; Physics; Algebra over a field; Pure mathematics; Quantum mechanics","score_opus":0.03102249671856014,"score_gpt":0.30305261986703763,"score_spread":0.2720301231484775,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2605561794","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9818338,0.00023292878,0.00006204296,0.00030668956,0.010722444,0.00019692443,0.000004688568,0.000019651114,0.006620786],"genre_scores_gemma":[0.9979662,0.00006302432,0.0010142258,0.00003336302,0.0006805188,0.0000036795527,2.789334e-7,0.000030267194,0.00020850085],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980645,0.00033228353,0.0007743631,0.00013998458,0.00040030497,0.0002885344],"domain_scores_gemma":[0.99697673,0.00081729994,0.0012158955,0.0006545253,0.00022260795,0.000112931695],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003229754,0.00022402934,0.00066057825,0.00023813736,0.00056760025,0.00016477915,0.00109587,0.00019136837,0.0001386018],"category_scores_gemma":[0.0031971924,0.00016526181,0.00032823344,0.00009717693,0.00047977295,0.0006932296,0.00019871778,0.00049037515,0.0000011869116],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002741371,0.00011227477,0.0016544119,0.000028826544,0.00011815428,0.00011274298,0.0010512156,0.0000011540228,0.00013295205,0.9922227,0.0004426914,0.0013815018],"study_design_scores_gemma":[0.003470392,0.00044268067,0.00352319,0.00010072573,0.000056217068,0.00008844148,0.00031886494,0.0000014532985,0.0010120372,0.98887265,0.0019259888,0.00018737727],"about_ca_topic_score_codex":0.0000029835344,"about_ca_topic_score_gemma":0.000013044758,"teacher_disagreement_score":0.016132299,"about_ca_system_score_codex":0.00004988951,"about_ca_system_score_gemma":0.00008470912,"threshold_uncertainty_score":0.67391807},"labels":[],"label_agreement":null},{"id":"W2606086083","doi":"10.1016/j.jctb.2018.04.003","title":"Infinitely many excluded minors for frame matroids and for lifted-graphic matroids","year":2018,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","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":"Office of Naval Research; Natural Sciences and Engineering Research Council of Canada","keywords":"Matroid; Class (philosophy); Combinatorics; Graphic matroid; Frame (networking); Mathematics; Computer science; Artificial intelligence","score_opus":0.021781755135505218,"score_gpt":0.3062087531804304,"score_spread":0.28442699804492516,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2606086083","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35432023,0.0008461155,0.63234574,0.0011909993,0.009365709,0.001027427,0.00002884976,0.00011491468,0.000760062],"genre_scores_gemma":[0.9309213,0.000099720346,0.06642654,0.00021373144,0.0018546185,0.00005309094,0.000001703331,0.000054711258,0.0003745725],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99761516,0.00028615643,0.00070761685,0.00032931464,0.00048352266,0.000578236],"domain_scores_gemma":[0.99602634,0.0014631416,0.00053611264,0.00052321074,0.0011681762,0.00028302954],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029596812,0.00028288987,0.00054860796,0.0005010533,0.0004211843,0.00030681217,0.0013637309,0.00018020418,0.000019247456],"category_scores_gemma":[0.0010345266,0.00024395689,0.0003000865,0.00054303464,0.0007039059,0.0014918657,0.00028411121,0.00034340765,0.0000036991617],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0032312353,0.00007956673,0.00012557862,0.00006196281,0.00011231216,0.000007590823,0.0005690551,0.0000021662497,0.0040092445,0.98766094,0.0006996885,0.0034406553],"study_design_scores_gemma":[0.0028703357,0.004885865,0.00017764063,0.00005805807,0.00003289574,0.00015209096,0.00024006718,0.00015570257,0.012364711,0.95745736,0.02134267,0.00026258026],"about_ca_topic_score_codex":6.193174e-7,"about_ca_topic_score_gemma":7.951301e-7,"teacher_disagreement_score":0.5766011,"about_ca_system_score_codex":0.0000484987,"about_ca_system_score_gemma":0.00016585359,"threshold_uncertainty_score":0.99482733},"labels":[],"label_agreement":null},{"id":"W2617552753","doi":"10.1016/j.jctb.2017.05.003","title":"Every finite non-solvable group admits an oriented regular representation","year":2017,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Finite Group Theory Research","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 Lethbridge","funders":"","keywords":"Mathematics; Solvable group; Finite group; Combinatorics; Group (periodic table); Graph; Representation (politics); Discrete mathematics","score_opus":0.053800333418807814,"score_gpt":0.35773772432619766,"score_spread":0.30393739090738986,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2617552753","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97628653,0.00008180265,0.00411353,0.00029938904,0.008762271,0.00046487755,0.0000144744545,0.00006302528,0.009914089],"genre_scores_gemma":[0.99217355,0.000060277158,0.0033217713,0.000029863286,0.0017242092,0.000011283518,0.0000076428905,0.00008085703,0.0025905299],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99627805,0.0009579104,0.00096453464,0.00028627185,0.0010406115,0.00047264138],"domain_scores_gemma":[0.9940984,0.0015476672,0.0015574873,0.0015177982,0.00095947797,0.0003191507],"candidate_categories":["metaresearch","metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0060500535,0.00028806436,0.00068316987,0.00026589714,0.00080991164,0.00043312786,0.0013642306,0.00022744999,0.00033113023],"category_scores_gemma":[0.009953655,0.00025233568,0.00026820964,0.00019870803,0.00043163652,0.0031852855,0.0003137588,0.00068003056,0.00002391346],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0060516167,0.0005203517,0.0006531441,0.000078610734,0.0002009997,0.00027067572,0.0011290802,0.000008583962,0.0038937419,0.9846147,0.0015703741,0.0010081246],"study_design_scores_gemma":[0.0029946063,0.0017591886,0.00080777134,0.0001690642,0.00008936892,0.00014877177,0.001040603,0.000051588024,0.008597778,0.97934943,0.0047234185,0.00026842725],"about_ca_topic_score_codex":0.000008136363,"about_ca_topic_score_gemma":0.0000045716156,"teacher_disagreement_score":0.015887024,"about_ca_system_score_codex":0.0001275505,"about_ca_system_score_gemma":0.00019074464,"threshold_uncertainty_score":0.9999929},"labels":[],"label_agreement":null},{"id":"W2621129476","doi":"10.1016/j.jctb.2018.11.006","title":"Balanced independent sets in graphs omitting large cliques","year":2018,"lang":"en","type":"preprint","venue":"Journal of Combinatorial Theory Series B","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"H2020 European Research Council; Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada; Austrian Science Fund","keywords":"Combinatorics; Bipartite graph; Mathematics; Countable set; Conjecture; Discrete mathematics; Partition (number theory); Graph; Homogeneous; Independent set","score_opus":0.020525847306395707,"score_gpt":0.3118381453852428,"score_spread":0.29131229807884707,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2621129476","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96754116,0.0006301661,0.0002774846,0.000092487106,0.026678786,0.00039744197,0.00003975565,0.00006019664,0.0042825006],"genre_scores_gemma":[0.9950855,0.00033363324,0.0024750235,0.00008797781,0.0018094487,0.00001020087,0.0000050858766,0.00008508494,0.00010808968],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99503255,0.0013715499,0.0018331329,0.00037081636,0.0008337867,0.00055815204],"domain_scores_gemma":[0.99498564,0.0010817723,0.0023600906,0.0007381923,0.0006607285,0.00017358913],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0074790632,0.0005547998,0.0014477036,0.0005609231,0.00023876649,0.00014732147,0.0012389829,0.0008404495,0.00022834587],"category_scores_gemma":[0.0020056963,0.00044694796,0.00063998246,0.00021860018,0.000292364,0.00034424383,0.0012782529,0.002351819,0.0000017824581],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0019810237,0.00024058638,0.0021741218,0.00029786973,0.0003385814,0.00013658602,0.0037636845,0.0000043100654,0.00004304671,0.9895995,0.0011178802,0.00030276924],"study_design_scores_gemma":[0.002145272,0.00043713723,0.0008482881,0.00087296613,0.00012377911,0.00010673177,0.0007111244,0.0000048502043,0.0012087593,0.9916353,0.0014608019,0.00044494035],"about_ca_topic_score_codex":0.0000030178562,"about_ca_topic_score_gemma":0.0000067044093,"teacher_disagreement_score":0.027544275,"about_ca_system_score_codex":0.00019067437,"about_ca_system_score_gemma":0.00027644186,"threshold_uncertainty_score":0.9999498},"labels":[],"label_agreement":null},{"id":"W2739763930","doi":"10.1016/j.jctb.2019.10.005","title":"The inverse eigenvalue problem of a graph: Multiplicities and minors","year":2019,"lang":"en","type":"preprint","venue":"Journal of Combinatorial Theory Series B","topic":"Graph theory and applications","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":"American Institute of Mathematics","keywords":"Eigenvalues and eigenvectors; Mathematics; Monotonic function; Inverse; Multiplicity (mathematics); Combinatorics; Diagonal; Discrete mathematics; Mathematical analysis","score_opus":0.02327575785812396,"score_gpt":0.2748947017448028,"score_spread":0.2516189438866788,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2739763930","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9910293,0.0010401051,0.00036767282,0.00030610905,0.0035083645,0.0008509615,0.00004567412,0.000026078278,0.002825702],"genre_scores_gemma":[0.99406505,0.0010397467,0.003404272,0.000021122907,0.00041029803,0.00003753902,0.0000026240918,0.000052384094,0.0009669934],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976347,0.00056783744,0.0010293484,0.00017633256,0.00037749784,0.000214279],"domain_scores_gemma":[0.9947529,0.0021447334,0.0019268927,0.00057758583,0.0005047384,0.00009315836],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029876821,0.0002980135,0.0007287095,0.00016548923,0.00023010392,0.00008670415,0.00069463573,0.00027507724,0.000019075569],"category_scores_gemma":[0.0004830153,0.00020193368,0.0003845859,0.00013941735,0.0007228151,0.00015623335,0.00041315035,0.00080205576,0.0000014035035],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007913436,0.00012700976,0.000109063854,0.00040115128,0.0003756366,0.0000024618314,0.0024835898,0.000032283177,0.00031037172,0.99388796,0.001152858,0.00032628753],"study_design_scores_gemma":[0.00077030325,0.000259628,0.000041059557,0.00031684953,0.00024720808,0.00003942278,0.002570858,0.0000051164857,0.0026962245,0.988143,0.004719076,0.0001912265],"about_ca_topic_score_codex":0.000004607079,"about_ca_topic_score_gemma":0.000005377769,"teacher_disagreement_score":0.005744916,"about_ca_system_score_codex":0.000031181262,"about_ca_system_score_gemma":0.00019795827,"threshold_uncertainty_score":0.82346165},"labels":[],"label_agreement":null},{"id":"W2766396921","doi":"10.1016/j.jctb.2017.10.001","title":"Domination in tournaments","year":2017,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":10,"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":"Office of Naval Research; McGill University; Agence Nationale de la Recherche; National Science Foundation","keywords":"Tournament; Conjecture; Combinatorics; Mathematics; Vertex (graph theory); Dimension (graph theory); Transitive relation; Set (abstract data type); Bounded function; Class (philosophy); Discrete mathematics; Computer science; Artificial intelligence; Graph","score_opus":0.016693407880547576,"score_gpt":0.30968788798114705,"score_spread":0.2929944801005995,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2766396921","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8295842,0.0005048379,0.11472967,0.0041526724,0.026247706,0.0004533529,0.0000021670335,0.000053463642,0.02427195],"genre_scores_gemma":[0.99613994,0.00006169426,0.003171192,0.000024663099,0.000266242,0.0000022093898,8.966435e-8,0.00000818545,0.000325776],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99837524,0.00032809225,0.00042176375,0.00013092336,0.0005018353,0.00024212177],"domain_scores_gemma":[0.9980346,0.0002213799,0.0006933172,0.0006359343,0.00030895718,0.00010582761],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003115864,0.000109536035,0.00025838864,0.0002643073,0.0002838623,0.00038704555,0.0023060073,0.00006230925,0.000023308672],"category_scores_gemma":[0.0013012275,0.0000937472,0.000096585,0.00014030456,0.00017607656,0.0035735592,0.00034837524,0.00036196757,0.0000067391625],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00046430508,0.00008612854,0.00077910844,0.000004618888,0.000017009035,0.00012667643,0.00035456024,0.000014792993,0.00089662505,0.9821826,0.00006268404,0.015010855],"study_design_scores_gemma":[0.0017552339,0.00036151553,0.0034482323,0.000051614734,0.0000027978751,0.000076393284,0.00007613173,0.000036671598,0.005952689,0.9856028,0.002538643,0.00009730171],"about_ca_topic_score_codex":0.0000015645658,"about_ca_topic_score_gemma":0.0000012339758,"teacher_disagreement_score":0.16655578,"about_ca_system_score_codex":0.00010832257,"about_ca_system_score_gemma":0.000112321446,"threshold_uncertainty_score":0.42851737},"labels":[],"label_agreement":null},{"id":"W2797572581","doi":"10.1016/j.jctb.2019.10.001","title":"k-regular subgraphs near the k-core threshold of a random graph","year":2019,"lang":"en","type":"preprint","venue":"Journal of Combinatorial Theory Series B","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University; University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; Université de Lyon; Agence Nationale de la Recherche","keywords":"Combinatorics; Mathematics; Graph; Core (optical fiber); Degree (music); Window (computing); Factor-critical graph; Induced subgraph; Discrete mathematics; Physics; Computer science; Line graph; Graph power","score_opus":0.024710718242157738,"score_gpt":0.2782392494595172,"score_spread":0.25352853121735947,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2797572581","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9609947,0.0038409897,0.00053591136,0.00021346753,0.03011133,0.0009623235,0.000057231722,0.000041258274,0.0032427972],"genre_scores_gemma":[0.9967992,0.00046096763,0.0010250573,0.000063993735,0.0012474137,0.0000108214435,0.0000040817117,0.00009845975,0.00029004953],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9954027,0.0008484818,0.0018322817,0.00031780338,0.0011879632,0.0004108],"domain_scores_gemma":[0.9918812,0.0022110564,0.003206668,0.0016231983,0.00094057375,0.00013733462],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0059278365,0.0006228831,0.001936839,0.00030738275,0.0004516284,0.00019883332,0.0021937226,0.0006849183,0.00018059563],"category_scores_gemma":[0.0010757325,0.00037006944,0.0018604094,0.000312006,0.0015622855,0.00023048167,0.0010268888,0.002126377,0.0000013278084],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0061490866,0.00015238892,0.00030396483,0.0004918777,0.0014030902,0.000029518193,0.0039738705,0.00023606668,0.000106893574,0.9844566,0.0025074,0.00018926263],"study_design_scores_gemma":[0.0034637414,0.0005084802,0.00007269125,0.0005681146,0.0007328432,0.000131889,0.0006983024,0.00001221213,0.0014851402,0.98848426,0.0034663363,0.000375975],"about_ca_topic_score_codex":0.0000038255403,"about_ca_topic_score_gemma":8.6134725e-7,"teacher_disagreement_score":0.035804465,"about_ca_system_score_codex":0.000051867864,"about_ca_system_score_gemma":0.00045568804,"threshold_uncertainty_score":0.9998751},"labels":[],"label_agreement":null},{"id":"W2802999861","doi":"10.1016/j.jctb.2019.08.007","title":"Matroid fragility and relaxations of circuit hyperplanes","year":2019,"lang":"en","type":"preprint","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Office of Naval Research; Natural Sciences and Engineering Research Council of Canada","keywords":"Matroid; Conjecture; Hyperplane; Combinatorics; Bounded function; Mathematics; Function (biology); Discrete mathematics; Mathematical analysis","score_opus":0.01814264768711815,"score_gpt":0.27175819323546824,"score_spread":0.2536155455483501,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2802999861","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6677359,0.0062691187,0.28765425,0.0008347291,0.028707992,0.001106659,0.00008974235,0.0001193926,0.007482228],"genre_scores_gemma":[0.99560326,0.00037821414,0.003431307,0.000019723018,0.00031145467,0.0000047680514,0.0000025498716,0.00002203775,0.00022668026],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9969293,0.0008099156,0.00089904765,0.00033312372,0.00075251004,0.00027613214],"domain_scores_gemma":[0.9954667,0.0010495363,0.0014402797,0.0010133919,0.0008705788,0.00015950396],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031417827,0.00027214614,0.00082473765,0.00037221113,0.00010834301,0.00014518148,0.0018438991,0.000284357,0.00003278412],"category_scores_gemma":[0.0009403338,0.000239374,0.00025377344,0.00026714196,0.00041259412,0.0008177759,0.0013528757,0.0012471306,0.0000041880403],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00039758417,0.00009779742,0.0006864232,0.0001993034,0.00013840444,0.000021907834,0.0007416533,0.00026395003,0.0006022531,0.99520326,0.000075404634,0.0015720517],"study_design_scores_gemma":[0.00065888994,0.00048466818,0.0008874663,0.00016075303,0.00003308879,0.0001703383,0.00013867425,0.000052557767,0.0017451422,0.99398893,0.0014757898,0.0002036741],"about_ca_topic_score_codex":0.0000033453841,"about_ca_topic_score_gemma":3.5388396e-7,"teacher_disagreement_score":0.32786736,"about_ca_system_score_codex":0.000078231526,"about_ca_system_score_gemma":0.0004233065,"threshold_uncertainty_score":0.9761389},"labels":[],"label_agreement":null},{"id":"W2825514135","doi":"10.1016/j.jctb.2018.07.001","title":"Peripheral circuits in infinite binary matroids","year":2018,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Binary number; Matroid; Electronic circuit; Mathematics; Computer science; Combinatorics; Discrete mathematics; Physics; Arithmetic; Quantum mechanics","score_opus":0.015186765259390072,"score_gpt":0.28264592315740134,"score_spread":0.2674591578980113,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2825514135","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9153987,0.00070715894,0.05304738,0.00091938424,0.016592244,0.00030233877,0.0000029547843,0.00010793402,0.012921882],"genre_scores_gemma":[0.9957853,0.000046445453,0.0027283807,0.000115454015,0.0009735136,0.0000035142587,2.6415233e-7,0.000020115753,0.0003270426],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99735534,0.0006864369,0.000661791,0.000222659,0.00061144395,0.0004623285],"domain_scores_gemma":[0.9980444,0.00034639396,0.00035807228,0.00051280827,0.0005532643,0.00018510464],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028243777,0.00019526409,0.00040691614,0.00050991814,0.00015952061,0.0001657564,0.0016868188,0.00010753391,0.0001221105],"category_scores_gemma":[0.0004919416,0.00017161462,0.0001515237,0.001036362,0.00047848898,0.0022346969,0.0003481689,0.0005540529,0.000024668829],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006282628,0.00012374338,0.00067394064,0.000010050253,0.00002873384,0.00018209392,0.0013446128,0.000026280397,0.00369408,0.987567,0.00018973093,0.005531446],"study_design_scores_gemma":[0.0015854749,0.0022899997,0.0012050516,0.000065146385,0.0000041732146,0.00025979365,0.0002151091,0.00008189176,0.0038907551,0.9803491,0.009853106,0.00020038696],"about_ca_topic_score_codex":0.0000013744277,"about_ca_topic_score_gemma":0.0000013607956,"teacher_disagreement_score":0.08038655,"about_ca_system_score_codex":0.0001387448,"about_ca_system_score_gemma":0.00025740688,"threshold_uncertainty_score":0.6998241},"labels":[],"label_agreement":null},{"id":"W2889694999","doi":"10.1016/j.jctb.2018.09.004","title":"Connectivity in bridge-addable graph classes: The McDiarmid–Steger–Welsh conjecture","year":2018,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Graph theory and applications","field":"Mathematics","cited_by":6,"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; McGill University","keywords":"Mathematics; Combinatorics; Conjecture; Graph; Partition (number theory); Class (philosophy); Discrete mathematics","score_opus":0.02475842331205823,"score_gpt":0.2984947733449122,"score_spread":0.27373635003285396,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2889694999","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98641914,0.00015485678,0.0010976798,0.0010859381,0.0037581015,0.0003721561,0.0000129454265,0.000040617815,0.007058549],"genre_scores_gemma":[0.99828076,0.000035404868,0.00021884286,0.00015112334,0.0010168529,0.00001529406,7.784377e-7,0.000029652214,0.00025130983],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976417,0.00084549363,0.00068079075,0.00017495528,0.0003364553,0.00032062264],"domain_scores_gemma":[0.9961741,0.002196907,0.00065483694,0.00049442844,0.00037672455,0.00010299706],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037524616,0.00023205334,0.0004971792,0.00016823718,0.00035470512,0.000096047996,0.0006469588,0.00016749618,0.00024938973],"category_scores_gemma":[0.0012866975,0.00015522771,0.00024337454,0.0006015313,0.0006857461,0.0004449246,0.00008360742,0.000646297,0.000013869753],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00072083867,0.00026855053,0.00040741172,0.000020857062,0.00009204515,0.000012976587,0.0012997484,0.000002533686,0.00057615765,0.99329966,0.0030273944,0.00027184162],"study_design_scores_gemma":[0.001294757,0.00049231586,0.00096170086,0.00007103186,0.00007106481,0.00015821103,0.0008539195,0.0000017502166,0.0063660303,0.9733906,0.01616321,0.0001754288],"about_ca_topic_score_codex":0.000008210832,"about_ca_topic_score_gemma":0.000037232945,"teacher_disagreement_score":0.019909065,"about_ca_system_score_codex":0.00005985247,"about_ca_system_score_gemma":0.00015158136,"threshold_uncertainty_score":0.63300025},"labels":[],"label_agreement":null},{"id":"W2897904393","doi":"10.1016/j.jctb.2022.01.009","title":"Colouring graphs with sparse neighbourhoods: Bounds and applications","year":2022,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":43,"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":"European Research Council; Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Neighbourhood (mathematics); Conjecture; Clique number; Chromatic scale; Vertex (graph theory); Brooks' theorem; Graph; Edge coloring; Discrete mathematics; Chordal graph; Graph power; 1-planar graph; Line graph","score_opus":0.009261596198324534,"score_gpt":0.24523861306012232,"score_spread":0.23597701686179778,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2897904393","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5250181,0.0036557855,0.4500131,0.0025088927,0.006188903,0.0014632491,0.000022163595,0.00026822096,0.010861586],"genre_scores_gemma":[0.99512655,0.000062627456,0.004299604,0.000077233526,0.00016897342,0.00005195132,4.892331e-7,0.000018029397,0.00019452511],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99812347,0.00045219716,0.0003261721,0.0002018556,0.00061864033,0.0002776842],"domain_scores_gemma":[0.9984866,0.00035447988,0.0003625883,0.00039338128,0.00023026811,0.00017270082],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018074481,0.0001408254,0.00026325785,0.00028282942,0.0007162683,0.0001759299,0.0010714512,0.000028612056,0.00004816549],"category_scores_gemma":[0.00006123313,0.00012003658,0.000073275805,0.0007814466,0.00027631628,0.000969834,0.00051933323,0.0005466981,9.938899e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00067348924,0.00010806272,0.00038504452,0.000008216773,0.000057660633,0.00005620481,0.00040525387,0.00017773366,0.00029089142,0.99459046,0.000052162053,0.0031948336],"study_design_scores_gemma":[0.0011123877,0.0015031694,0.0002210093,0.000009519398,0.000013674598,0.0007464081,0.00059719686,0.000022170967,0.0006071121,0.9675163,0.027505003,0.00014606903],"about_ca_topic_score_codex":8.996852e-7,"about_ca_topic_score_gemma":5.1692274e-7,"teacher_disagreement_score":0.47010848,"about_ca_system_score_codex":0.00007957069,"about_ca_system_score_gemma":0.0001958609,"threshold_uncertainty_score":0.5509029},"labels":[],"label_agreement":null},{"id":"W2901962989","doi":"10.1016/j.jctb.2018.10.006","title":"Deltas, extended odd holes and their blockers","year":2018,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"graph theory and CDMA systems","field":"Engineering","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":"Office of Naval Research; Natural Sciences and Engineering Research Council of Canada","keywords":"Minor (academic); Combinatorics; Set (abstract data type); Clutter; Physics; Delta; Element (criminal law); Mathematics; Geometry; Telecommunications; Computer science; Law; Political science; Radar","score_opus":0.0047313300477104005,"score_gpt":0.19036915651607395,"score_spread":0.18563782646836355,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2901962989","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98203665,0.0019522401,0.0008098532,0.00006235439,0.010891032,0.00009044368,0.0000067727938,0.000087108245,0.004063516],"genre_scores_gemma":[0.9983789,0.00012306028,0.000086272026,0.000020736834,0.0012805484,0.0000016380734,4.809041e-7,0.00002846197,0.000079936144],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99901825,0.00016708966,0.00038707492,0.00008312007,0.00013946262,0.00020499599],"domain_scores_gemma":[0.9992772,0.0001296815,0.00013565189,0.00017016748,0.00015975724,0.00012753786],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00096650206,0.00018490755,0.00032952733,0.00011749757,0.00012155172,0.00006481799,0.00021922667,0.000101855956,0.000064282875],"category_scores_gemma":[0.00007200613,0.00013942269,0.00010568388,0.00014135292,0.00036959656,0.00035166924,0.000029262603,0.00021778446,0.000006370861],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00091658783,0.000049661543,0.00010018597,0.000058824935,0.00033664677,0.000025046462,0.002745496,0.000019307958,0.013011216,0.9750633,0.0023917495,0.0052819583],"study_design_scores_gemma":[0.001102073,0.00074453314,0.00016251775,0.00010448424,0.00003753818,0.00038360676,0.0023937456,0.000034925353,0.045271993,0.89838266,0.051147077,0.0002348364],"about_ca_topic_score_codex":4.6111958e-7,"about_ca_topic_score_gemma":6.3102544e-7,"teacher_disagreement_score":0.07668065,"about_ca_system_score_codex":0.000023622162,"about_ca_system_score_gemma":0.000021821696,"threshold_uncertainty_score":0.5685492},"labels":[],"label_agreement":null},{"id":"W2902113597","doi":"10.1016/j.jctb.2022.02.007","title":"Matrix representations of frame and lifted-graphic matroids correspond to gain functions","year":2022,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Douglas College","funders":"Simons Foundation","keywords":"Mathematics; Combinatorics; Matroid; Graph; Matrix (chemical analysis); Canonical form; Discrete mathematics; Pure mathematics","score_opus":0.016331647362705017,"score_gpt":0.3126353802706066,"score_spread":0.2963037329079016,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2902113597","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96162117,0.0005093253,0.020383487,0.0007708543,0.0139282895,0.0007658405,0.000089632544,0.00008673781,0.0018446838],"genre_scores_gemma":[0.9874088,0.000028246031,0.010543229,0.00004202874,0.00041780312,0.000041242853,0.0000023619018,0.00006679822,0.0014494862],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99698275,0.00063869596,0.0011362041,0.0001886067,0.0007936306,0.00026013324],"domain_scores_gemma":[0.99557716,0.0021619233,0.0010787859,0.0004951305,0.00048561054,0.00020141083],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020826475,0.0002301327,0.00068269175,0.0005071726,0.00036045,0.000047339243,0.0004681817,0.00008142528,0.00029806836],"category_scores_gemma":[0.003241129,0.00022599015,0.00021956756,0.0008547201,0.00016746228,0.00036916276,0.00036889114,0.00058381667,0.0000029201087],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001823319,0.000383646,0.0001542557,0.00007825818,0.00014809522,0.00002367912,0.0020898394,0.0002491478,0.0032202736,0.9886758,0.0030392075,0.000114497154],"study_design_scores_gemma":[0.0014668477,0.0017024446,0.000038337574,0.00005431425,0.00016025844,0.00028940162,0.006686373,0.00001529171,0.0012813971,0.98183835,0.0062661553,0.0002008054],"about_ca_topic_score_codex":0.0000024046512,"about_ca_topic_score_gemma":7.8391224e-7,"teacher_disagreement_score":0.025787653,"about_ca_system_score_codex":0.0001158263,"about_ca_system_score_gemma":0.00016495494,"threshold_uncertainty_score":0.9215611},"labels":[],"label_agreement":null},{"id":"W2911309437","doi":"10.1016/j.jctb.2005.04.007","title":"Cayley maps","year":2005,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Finite Group Theory Research","field":"Mathematics","cited_by":77,"is_retracted":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":"Cayley graph; Cayley's theorem; Cayley transform; Combinatorics; Mathematics; Vertex-transitive graph; Vertex (graph theory); Transitive relation; Discrete mathematics; Graph; Voltage graph; Line graph","score_opus":0.03559547643093926,"score_gpt":0.3204301378384334,"score_spread":0.28483466140749414,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2911309437","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.901361,0.0007580586,0.002171581,0.002490136,0.010013121,0.00044904326,0.000019929594,0.00013811495,0.082599014],"genre_scores_gemma":[0.98915666,0.000028407892,0.0040235966,0.00006524634,0.0029310102,0.0000033833714,7.599197e-7,0.000054555967,0.0037363803],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974286,0.00063468516,0.00074646453,0.00012341447,0.0007110211,0.00035580862],"domain_scores_gemma":[0.99702626,0.0014156126,0.00048055014,0.00038229156,0.00049990613,0.00019535706],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00458518,0.00019226562,0.0004731667,0.00023039713,0.00012930694,0.000083002946,0.0006555372,0.00013669432,0.00082977925],"category_scores_gemma":[0.0026045104,0.00015589898,0.00023184385,0.00025539045,0.00020926502,0.0006960301,0.00012312105,0.00060601055,0.00007986119],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016568572,0.00023326244,0.000053438853,0.00003084015,0.00010243639,0.00005203999,0.00066718366,0.000003898364,0.0010264755,0.98807764,0.006632541,0.0014633796],"study_design_scores_gemma":[0.0014322478,0.0005676876,0.000019701669,0.000048827555,0.000038442537,0.00027926444,0.0005338429,0.0000015744777,0.0061561144,0.9297912,0.060979355,0.00015175166],"about_ca_topic_score_codex":6.86556e-7,"about_ca_topic_score_gemma":0.0000012064581,"teacher_disagreement_score":0.08779565,"about_ca_system_score_codex":0.00019280678,"about_ca_system_score_gemma":0.00018213189,"threshold_uncertainty_score":0.9085501},"labels":[],"label_agreement":null},{"id":"W2913508203","doi":"10.1016/j.jctb.2016.04.002","title":"Disjoint dijoins","year":2016,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","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":"Office of Naval Research; Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Digraph; Disjoint sets; Combinatorics; Conjecture; Pairwise comparison; Partition (number theory); Mathematics; Directed graph; Discrete mathematics","score_opus":0.012839882021510558,"score_gpt":0.26601016317363857,"score_spread":0.25317028115212803,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2913508203","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07528315,0.00051828957,0.8942166,0.005867018,0.015777906,0.00022839733,0.0000053976964,0.00014152803,0.0079617435],"genre_scores_gemma":[0.9932199,0.00012181995,0.0048480933,0.00006549745,0.0005992406,0.0000029387027,7.287512e-8,0.000017676364,0.0011247246],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978816,0.000476895,0.0004962085,0.00017973328,0.00061423244,0.00035133486],"domain_scores_gemma":[0.9976515,0.00074789673,0.0003793058,0.00055893546,0.00043801553,0.0002243273],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021912884,0.00015690002,0.000317493,0.00021927869,0.00012993143,0.00010028991,0.0015508399,0.000065573055,0.000098311684],"category_scores_gemma":[0.00092637225,0.000091378446,0.00020036047,0.00036657182,0.00027650953,0.0022039078,0.0003429398,0.00023177011,0.00003624075],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00043610652,0.00007227324,0.00008368243,0.000004013163,0.000038465703,0.000070294576,0.00016837547,0.0000015935448,0.0078170225,0.97212243,0.00036428866,0.018821431],"study_design_scores_gemma":[0.0011586172,0.0007718283,0.00016995757,0.00005752492,0.0000052515215,0.00018948968,0.00004303788,0.0000020716623,0.022489255,0.94909245,0.025884874,0.00013566417],"about_ca_topic_score_codex":2.3154337e-7,"about_ca_topic_score_gemma":1.701962e-7,"teacher_disagreement_score":0.9179368,"about_ca_system_score_codex":0.00009545438,"about_ca_system_score_gemma":0.00016708317,"threshold_uncertainty_score":0.37263048},"labels":[],"label_agreement":null},{"id":"W2914098655","doi":"10.1016/j.jctb.2008.06.009","title":"Lehman matrices","year":2008,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"graph theory and CDMA systems","field":"Engineering","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 Waterloo","funders":"","keywords":"Circulant matrix; Mathematics; Combinatorics; Matrix (chemical analysis); Integer (computer science); Integer matrix; Class (philosophy); Complex matrix; Pure mathematics; Discrete mathematics; Nonnegative matrix; Symmetric matrix; Physics; Eigenvalues and eigenvectors; Computer science; Materials science","score_opus":0.006861563315849809,"score_gpt":0.18614867137685437,"score_spread":0.17928710806100456,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2914098655","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96563864,0.0022828425,0.00036085918,0.000023713093,0.014075468,0.00006555691,0.0000022799475,0.00010218009,0.017448436],"genre_scores_gemma":[0.99827135,0.00035951106,0.00007013677,0.000010360771,0.00097632915,0.0000014493221,3.8833437e-7,0.000024625086,0.00028584246],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989698,0.00013230288,0.00043436803,0.000054869,0.00023407476,0.0001746122],"domain_scores_gemma":[0.9993865,0.00011329126,0.00014497108,0.000148789,0.00010695347,0.00009949367],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006634288,0.00013906926,0.00030582567,0.00013770348,0.00011362555,0.000023724764,0.0002726818,0.0000831302,0.00011898515],"category_scores_gemma":[0.000051782816,0.0001172378,0.0001597829,0.00019471443,0.00009893726,0.00048420855,0.000015621343,0.000236003,0.000020692916],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005708763,0.00006463768,0.00042252688,0.00007073672,0.00021757341,0.00025726625,0.0016086048,0.0006495291,0.0035149078,0.9862078,0.0058067427,0.000608813],"study_design_scores_gemma":[0.0016458023,0.0006192409,0.00050919154,0.0000995867,0.00005684654,0.0024904308,0.0008900083,0.000018928677,0.019182628,0.84516525,0.12894846,0.00037359],"about_ca_topic_score_codex":4.8580716e-7,"about_ca_topic_score_gemma":1.2087222e-7,"teacher_disagreement_score":0.1410425,"about_ca_system_score_codex":0.000031100433,"about_ca_system_score_gemma":0.00002622847,"threshold_uncertainty_score":0.47808188},"labels":[],"label_agreement":null},{"id":"W2927674350","doi":"10.1016/j.jctb.2019.03.003","title":"Tools for counting odd cycles in graphs","year":2019,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia, Okanagan Campus; University of British Columbia","funders":"","keywords":"Combinatorics; Bipartite graph; Mathematics; Vertex (graph theory); Graph; Chordal graph; Discrete mathematics","score_opus":0.023085181156103293,"score_gpt":0.28879435769302014,"score_spread":0.26570917653691684,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2927674350","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98731536,0.00018178172,0.00017834318,0.00006742883,0.008213163,0.00031049756,0.000006550552,0.00001691089,0.0037099451],"genre_scores_gemma":[0.99736524,0.00003705279,0.0018643048,0.00005627375,0.00045098262,0.0000045487645,7.5764586e-7,0.00003156109,0.00018927334],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99840516,0.00019988079,0.0007119331,0.0001207665,0.00030142005,0.00026083805],"domain_scores_gemma":[0.99638397,0.0024788883,0.0005861506,0.0002398652,0.00025320242,0.00005790326],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002752072,0.00017392417,0.00052639813,0.00019749724,0.00011272695,0.00009317272,0.00039301484,0.00013678799,0.0001142395],"category_scores_gemma":[0.0014699018,0.00013406613,0.00027006798,0.00016289044,0.00009762105,0.000740396,0.00007039023,0.00030444548,0.0000013944878],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014516625,0.00006539734,0.001182833,0.00009764685,0.00007519547,0.000007418551,0.0009371593,0.000005995757,0.000519726,0.9943478,0.00025266025,0.0010564798],"study_design_scores_gemma":[0.00209368,0.0004216201,0.00043776282,0.00012556852,0.000036378824,0.000046048575,0.0010986414,0.0000031496077,0.0018779914,0.9886669,0.005028831,0.00016341692],"about_ca_topic_score_codex":5.623179e-7,"about_ca_topic_score_gemma":7.77381e-7,"teacher_disagreement_score":0.0100498665,"about_ca_system_score_codex":0.00004547214,"about_ca_system_score_gemma":0.00006079686,"threshold_uncertainty_score":0.5467058},"labels":[],"label_agreement":null},{"id":"W2944171269","doi":"10.1016/j.jctb.2020.07.001","title":"The pseudoforest analogue for the Strong Nine Dragon Tree Conjecture is true","year":2020,"lang":"en","type":"preprint","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","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","keywords":"Conjecture; Combinatorics; Mathematics; Graph; Tree (set theory); Degree (music); Component (thermodynamics); Connected component; Physics","score_opus":0.026241279213906985,"score_gpt":0.29976136910398044,"score_spread":0.2735200898900734,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2944171269","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006168235,0.007819844,0.8862408,0.050274394,0.04509766,0.0026114692,0.00015522557,0.00016323545,0.0014691433],"genre_scores_gemma":[0.9874706,0.0012690814,0.0040392885,0.00054027286,0.005473693,0.00011957461,0.000010940917,0.00010918007,0.00096735806],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9956493,0.0009978861,0.0010625996,0.0005126447,0.0011024346,0.0006751819],"domain_scores_gemma":[0.99135894,0.004754299,0.0012859495,0.0013853371,0.00094457297,0.0002709313],"candidate_categories":["metaepi_narrow","open_science","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0044596298,0.000528253,0.0008511656,0.00017281396,0.0010151783,0.00096836506,0.006360789,0.00033968088,0.000026682526],"category_scores_gemma":[0.0018233261,0.00029044965,0.0008626478,0.000497485,0.0007968233,0.00063369574,0.0020226077,0.0025382326,0.000004288851],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002233648,0.000040238487,0.000017086968,0.0000549616,0.0005312854,0.0000391213,0.0010165443,0.0010803911,0.00008623691,0.98038805,0.0044352086,0.010077205],"study_design_scores_gemma":[0.0014061796,0.0011846955,0.00006825786,0.00009095345,0.000099341574,0.00010253871,0.0003809361,0.0020373669,0.0019473704,0.9509273,0.041452356,0.0003026947],"about_ca_topic_score_codex":0.0000046974124,"about_ca_topic_score_gemma":0.000011082537,"teacher_disagreement_score":0.9813024,"about_ca_system_score_codex":0.00020380359,"about_ca_system_score_gemma":0.0010176888,"threshold_uncertainty_score":0.99995476},"labels":[],"label_agreement":null},{"id":"W2963299469","doi":"10.1016/j.jctb.2013.09.007","title":"The number of rank- k flats in a matroid with no<mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.gif\" overflow=\"scroll\"><mml:msub><mml:mrow><mml:mi>U</mml:mi></mml:mrow><mml:mrow><mml:mn>2</mml:mn><mml:mo>,</mml:mo><mml:mi>n</mml:mi></mml:mrow></mml:msub></mml:math>-minor","year":2014,"lang":"lv","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Finite Group Theory Research","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":"Office of Naval Research","keywords":"Matroid; Rank (graph theory); Minor (academic); Combinatorics; Mathematics; Prime power; Prime (order theory); Art","score_opus":0.016078731397069643,"score_gpt":0.2519183165433745,"score_spread":0.23583958514630485,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963299469","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.55974376,0.0009896909,0.00039748006,0.0005885998,0.0057059424,0.000073368785,0.00019612214,0.00013872828,0.4321663],"genre_scores_gemma":[0.98817074,0.0015077561,0.0022674077,0.00077949837,0.0043181903,0.00070255256,0.0002681028,0.0012252193,0.0007605428],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9843467,0.0021122624,0.0036302134,0.0017001355,0.0048396145,0.00337106],"domain_scores_gemma":[0.9829723,0.0067969235,0.0047697183,0.003235868,0.000707208,0.0015179676],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","research_integrity","insufficient_payload"],"consensus_categories":["metaepi_narrow","sts","research_integrity","insufficient_payload"],"category_scores_codex":[0.009348658,0.0012867093,0.00078498025,0.00085765735,0.002089683,0.00218143,0.004189436,0.0029581634,0.37836567],"category_scores_gemma":[0.0072885416,0.002105054,0.0026602966,0.0018152485,0.0036937466,0.0026248258,0.0026629467,0.0037143931,0.002224039],"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.013685576,0.0006758481,0.00002802725,0.0018480904,0.0026518768,0.0015134988,0.0035420514,0.0004347891,0.0025679588,0.75987315,0.2120043,0.0011748039],"study_design_scores_gemma":[0.0067612105,0.00576523,0.00007136316,0.0028911934,0.002116932,0.0039035364,0.0047212476,0.005560117,0.9367417,0.022201102,0.007114993,0.0021513412],"about_ca_topic_score_codex":0.0006900159,"about_ca_topic_score_gemma":0.000758947,"teacher_disagreement_score":0.93417376,"about_ca_system_score_codex":0.0000453668,"about_ca_system_score_gemma":0.0028374656,"threshold_uncertainty_score":0.9999885},"labels":[],"label_agreement":null},{"id":"W2963559342","doi":"10.1016/j.jctb.2018.03.004","title":"Explicit bounds for graph minors","year":2018,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","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; Nederlandse Organisatie voor Wetenschappelijk Onderzoek","keywords":"Combinatorics; Mathematics; Disjoint sets; Vertex (graph theory); Homeomorphism (graph theory); Graph; Discrete mathematics","score_opus":0.017899772074264998,"score_gpt":0.2954854718971994,"score_spread":0.2775856998229344,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963559342","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11803021,0.00046885747,0.85368514,0.0010408118,0.021088481,0.0004628826,0.000006514404,0.00010883631,0.005108238],"genre_scores_gemma":[0.9735824,0.000039721108,0.023013262,0.0001700473,0.0022325898,0.000016265763,5.560074e-7,0.000030825806,0.0009143556],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980032,0.0002863728,0.0005237479,0.00022197797,0.0005246932,0.00044003085],"domain_scores_gemma":[0.99707544,0.00065158075,0.0004218187,0.00054029346,0.001101588,0.00020927246],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002636008,0.0001846355,0.00035797822,0.0003366626,0.00034354342,0.00020777695,0.0017908713,0.000093701696,0.000044115484],"category_scores_gemma":[0.0006662904,0.00015414991,0.00026907644,0.00061267253,0.00040255144,0.0016722985,0.00021882175,0.0002563013,0.000010801595],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012024809,0.000078432524,0.000032666732,0.000010530027,0.000063192274,0.000012271751,0.00062384905,0.0000018552053,0.0021233507,0.98977304,0.0013302618,0.004748082],"study_design_scores_gemma":[0.0012576209,0.0025719865,0.00003604656,0.000024942412,0.000011128151,0.000105240884,0.00016457676,0.000021073649,0.027348125,0.92141896,0.046878804,0.00016150957],"about_ca_topic_score_codex":5.6382726e-7,"about_ca_topic_score_gemma":5.964417e-7,"teacher_disagreement_score":0.85555214,"about_ca_system_score_codex":0.000059022324,"about_ca_system_score_gemma":0.00018046789,"threshold_uncertainty_score":0.62860507},"labels":[],"label_agreement":null},{"id":"W2963637355","doi":"10.1016/j.jctb.2019.02.005","title":"Goldberg's conjecture is true for random multigraphs","year":2019,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Israel Science Foundation","keywords":"Multigraph; Combinatorics; Conjecture; Mathematics; Edge coloring; Space (punctuation); Degree (music); Discrete mathematics; Physics; Graph; Computer science","score_opus":0.012289576074293191,"score_gpt":0.27411417064528815,"score_spread":0.26182459457099494,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963637355","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96941674,0.00065789383,0.0015445009,0.00030880762,0.022886682,0.0008626677,0.00004351054,0.00004794529,0.004231247],"genre_scores_gemma":[0.9947173,0.00006138438,0.00231743,0.00021889826,0.0011286353,0.000007692033,0.0000013567123,0.000053608273,0.0014936714],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998078,0.0002881118,0.0007612885,0.00017692501,0.0003894069,0.0003062807],"domain_scores_gemma":[0.9960775,0.0022150325,0.0007696137,0.00041396182,0.00039718492,0.00012670373],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019109073,0.00028119088,0.0008072258,0.00017039292,0.00019499795,0.00006381069,0.00052248075,0.00024413658,0.000552452],"category_scores_gemma":[0.0007949926,0.00019660656,0.00066452485,0.00015380963,0.00016278186,0.00035142916,0.00007132,0.00039467792,0.0000031097977],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.006756716,0.000080920574,0.00021539617,0.00013973529,0.00037004938,0.0000075138387,0.0025757113,0.00000356077,0.0005790856,0.9843125,0.0044659288,0.00049290643],"study_design_scores_gemma":[0.009395742,0.0009201522,0.000040954004,0.00009831148,0.00015074776,0.00011188502,0.00051503105,0.000004236295,0.0077120056,0.94757646,0.033237938,0.00023656063],"about_ca_topic_score_codex":6.954782e-7,"about_ca_topic_score_gemma":3.6791877e-7,"teacher_disagreement_score":0.03673604,"about_ca_system_score_codex":0.00003871134,"about_ca_system_score_gemma":0.000080249156,"threshold_uncertainty_score":0.8017383},"labels":[],"label_agreement":null},{"id":"W2969413889","doi":"10.1016/j.jctb.2019.08.002","title":"The genus of complete 3-uniform hypergraphs","year":2019,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"graph theory and CDMA systems","field":"Engineering","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":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; Javna Agencija za Raziskovalno Dejavnost RS","keywords":"Mathematics; Combinatorics; Hypergraph; Conjecture; Genus; Vertex (graph theory); Graph; Discrete mathematics; Botany","score_opus":0.005066796062146385,"score_gpt":0.18156300372263182,"score_spread":0.17649620766048543,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2969413889","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9649432,0.0015131222,0.00010299926,0.00003249128,0.016801268,0.00014301219,0.000007153632,0.00003275277,0.01642401],"genre_scores_gemma":[0.9992819,0.0001693826,0.000028319795,0.0000071263485,0.00027971744,0.0000015092274,5.043114e-7,0.000023045388,0.00020852145],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99872625,0.00016115641,0.00058088306,0.00005502394,0.0002795884,0.00019707881],"domain_scores_gemma":[0.9988514,0.0003571217,0.00026879387,0.00027987637,0.00017527486,0.00006750985],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013844952,0.00014187612,0.00036204976,0.000089088884,0.00009007089,0.000036489215,0.00044939632,0.00007559346,0.00006727508],"category_scores_gemma":[0.00005352684,0.00009453879,0.00023137231,0.00019369881,0.0001328603,0.0002600553,0.00002724042,0.0002561072,0.00001607965],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00056180556,0.000020716452,0.0002457438,0.00006116377,0.00021788832,0.0000055864657,0.00037763934,0.00049741607,0.0071288864,0.9895182,0.0003376358,0.0010273197],"study_design_scores_gemma":[0.0015057577,0.0007499731,0.0003347892,0.00011867078,0.00005443635,0.00019149733,0.0017557812,0.00006823663,0.010365127,0.7915698,0.19306149,0.00022442403],"about_ca_topic_score_codex":8.218239e-7,"about_ca_topic_score_gemma":4.8355e-7,"teacher_disagreement_score":0.19794837,"about_ca_system_score_codex":0.000024274523,"about_ca_system_score_gemma":0.000026437967,"threshold_uncertainty_score":0.38551798},"labels":[],"label_agreement":null},{"id":"W2970565780","doi":"10.1016/j.jctb.2019.08.001","title":"A local epsilon version of Reed's Conjecture","year":2019,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Conjecture; Clique number; Degree (music); Perfect graph; Graph; Vertex (graph theory); Upper and lower bounds; Chromatic scale","score_opus":0.006527394455921615,"score_gpt":0.24898183700530913,"score_spread":0.2424544425493875,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2970565780","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7558259,0.0008945249,0.2184164,0.0008484612,0.015621488,0.00042913793,0.0000064042624,0.00006529019,0.007892401],"genre_scores_gemma":[0.99627346,0.000035897567,0.0032078354,0.000035348152,0.000103080856,6.7708476e-7,4.13919e-7,0.000012766781,0.00033052792],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979141,0.00044543087,0.00048519764,0.00017364601,0.00071895815,0.00026271315],"domain_scores_gemma":[0.9977976,0.0005238299,0.0005244975,0.00052391365,0.0004965459,0.00013359869],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018926648,0.000152599,0.00043424955,0.0002417473,0.00006562637,0.000046180423,0.0013464664,0.000116274,0.00014660743],"category_scores_gemma":[0.00023367516,0.00012153816,0.00020378736,0.0004787238,0.00025992104,0.0011820969,0.00029796798,0.0004623286,0.000028512166],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0018285854,0.00008494212,0.0001562164,0.000030856707,0.00005362417,0.00003632916,0.00036519882,0.00025592925,0.0057077035,0.988671,0.00020452282,0.0026050685],"study_design_scores_gemma":[0.0019754174,0.0025408869,0.0001495967,0.00009142513,0.000010285318,0.00015977013,0.0003021344,0.000102346115,0.03310083,0.95234334,0.0090847,0.00013925435],"about_ca_topic_score_codex":0.0000011743793,"about_ca_topic_score_gemma":1.513404e-7,"teacher_disagreement_score":0.24044755,"about_ca_system_score_codex":0.00007465566,"about_ca_system_score_gemma":0.00019689275,"threshold_uncertainty_score":0.49561825},"labels":[],"label_agreement":null},{"id":"W2992786313","doi":"10.1016/j.jctb.2019.11.004","title":"Stability and exact Turán numbers for matroids","year":2019,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Bounding overwatch; Mathematics; Term (time); Combinatorics; Matroid; Upper and lower bounds; Type (biology); Class (philosophy); Stability (learning theory); Set (abstract data type); Discrete mathematics; Mathematical analysis; Physics; Computer science; Quantum mechanics","score_opus":0.016346597040299046,"score_gpt":0.274427257906122,"score_spread":0.25808066086582293,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2992786313","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9887809,0.000176466,0.00033435712,0.0000932783,0.007067201,0.00030901394,0.000011544523,0.000018946079,0.0032082484],"genre_scores_gemma":[0.99678814,0.000029494442,0.002311449,0.000038856313,0.0005152861,0.000002855401,5.359665e-7,0.000027452561,0.00028594967],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986391,0.00023110023,0.00052190066,0.00013296725,0.00026511616,0.00020982223],"domain_scores_gemma":[0.9974144,0.0015012916,0.0004400784,0.00028186291,0.0002587498,0.00010360195],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002377341,0.00017410926,0.00048614963,0.00006476474,0.00014105607,0.000052603074,0.00025617855,0.00012856025,0.00030503428],"category_scores_gemma":[0.00071794516,0.00012675904,0.00021775183,0.000070893155,0.00017414556,0.0003710692,0.000083332874,0.00025865546,9.4492805e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0023073647,0.000056033452,0.0011153844,0.00014609228,0.000116525705,0.0000026116386,0.0010905657,3.5672977e-7,0.0007211268,0.99366075,0.00047550662,0.0003077038],"study_design_scores_gemma":[0.001782668,0.0007708053,0.00020139982,0.000038709935,0.00007085567,0.00008592659,0.0010600103,0.0000016666936,0.0034295407,0.98582864,0.0065804557,0.0001493026],"about_ca_topic_score_codex":4.6009325e-7,"about_ca_topic_score_gemma":2.9979117e-7,"teacher_disagreement_score":0.008007176,"about_ca_system_score_codex":0.00004349696,"about_ca_system_score_gemma":0.000053709457,"threshold_uncertainty_score":0.51690835},"labels":[],"label_agreement":null},{"id":"W3002997249","doi":"10.1016/j.jctb.2020.01.002","title":"Maximum number of colourings: 4-chromatic graphs","year":2020,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; Javna Agencija za Raziskovalno Dejavnost RS","keywords":"Combinatorics; Conjecture; Chromatic scale; Mathematics; Graph; Discrete mathematics","score_opus":0.020092332676251042,"score_gpt":0.2785898590540383,"score_spread":0.2584975263777873,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3002997249","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98759764,0.00013526935,0.00029779036,0.0003210712,0.0038427182,0.00015322074,0.0000075684384,0.000033066382,0.007611673],"genre_scores_gemma":[0.9962007,0.000033695593,0.0030521767,0.00013015565,0.00048465029,0.0000015132695,3.4306325e-7,0.0000345042,0.00006228324],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978743,0.0003503883,0.0009479387,0.00011693489,0.00049886253,0.00021154345],"domain_scores_gemma":[0.9974589,0.00073310384,0.0010503783,0.00024178838,0.00033894315,0.00017689756],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010991928,0.00021047278,0.00071122916,0.000077755045,0.00012873134,0.000028377126,0.0005394503,0.0001348502,0.0005797744],"category_scores_gemma":[0.0012602456,0.0001603322,0.00036156128,0.00026810393,0.00029738815,0.00031087,0.00014176665,0.0003673454,0.0000034389464],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013654334,0.00009765084,0.00043997128,0.00025067976,0.00023467118,0.000038985625,0.0031488321,0.0000017460084,0.00059025787,0.9921935,0.001442057,0.00019617632],"study_design_scores_gemma":[0.0013721084,0.0006279556,0.0000908373,0.000082772494,0.00015110149,0.00017055814,0.0008722395,0.0000015827715,0.0069355965,0.9877253,0.0018090238,0.0001609075],"about_ca_topic_score_codex":5.121753e-7,"about_ca_topic_score_gemma":8.7114685e-8,"teacher_disagreement_score":0.008603055,"about_ca_system_score_codex":0.000023390672,"about_ca_system_score_gemma":0.00006259896,"threshold_uncertainty_score":0.65381575},"labels":[],"label_agreement":null},{"id":"W3003586411","doi":"10.1016/j.jctb.2023.12.006","title":"Excluded minors for the Klein bottle II. Cascades","year":2024,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","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":"Javna Agencija za Raziskovalno Dejavnost RS; Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Klein bottle; Genus; Embedding; Combinatorics; Euler's formula; Euler characteristic; Mathematics; Surface (topology); Discrete mathematics; Computer science; Biology; Geometry; Zoology; Mathematical analysis; Artificial intelligence","score_opus":0.019614385251058644,"score_gpt":0.3024421195788242,"score_spread":0.2828277343277656,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3003586411","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.059373636,0.020453252,0.84069115,0.014644798,0.059560306,0.0012238971,0.000023014009,0.00033917537,0.003690793],"genre_scores_gemma":[0.98783344,0.00026551483,0.0061615007,0.000120811994,0.0018147634,0.00002982282,5.4914346e-7,0.00003915473,0.0037344452],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99818426,0.00028293484,0.0004437486,0.00020554157,0.0005258834,0.0003576218],"domain_scores_gemma":[0.9964905,0.0024301813,0.00017086658,0.00045410488,0.00033164778,0.00012273464],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033130448,0.00017387488,0.00027543618,0.0002060256,0.00044150607,0.00037535143,0.0017560322,0.0000815897,0.000045447592],"category_scores_gemma":[0.0006768019,0.00010775713,0.00030710088,0.00056483404,0.00027583272,0.0013500379,0.00032733302,0.00045200193,0.000008475207],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00041654884,0.00004122233,0.0000030109961,0.0000287366,0.00012478442,0.000046347053,0.0010084421,0.000040491977,0.0012326229,0.97992414,0.0041130097,0.013020637],"study_design_scores_gemma":[0.0004617543,0.0007440417,0.000012509058,0.00005313303,0.00002307615,0.00018135303,0.00022791045,0.0003243967,0.010152926,0.82613724,0.1615662,0.000115444105],"about_ca_topic_score_codex":0.0000010012434,"about_ca_topic_score_gemma":6.7681265e-7,"teacher_disagreement_score":0.9284598,"about_ca_system_score_codex":0.00007598883,"about_ca_system_score_gemma":0.0002370805,"threshold_uncertainty_score":0.43942082},"labels":[],"label_agreement":null},{"id":"W3003878869","doi":"10.1016/j.jctb.2023.10.002","title":"Excluded minors for the Klein bottle I. Low connectivity case","year":2023,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","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":"Javna Agencija za Raziskovalno Dejavnost RS; Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Klein bottle; Combinatorics; Embedding; Mathematics; Robertson–Seymour theorem; Vertex (graph theory); Genus; Euler characteristic; Euler's formula; Discrete mathematics; Graph; 1-planar graph; Computer science; Chordal graph; Artificial intelligence; Geometry; Torus; Biology; Mathematical analysis","score_opus":0.025210782009681694,"score_gpt":0.30544620852283433,"score_spread":0.28023542651315264,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3003878869","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.58299035,0.00065997476,0.38381562,0.0047050687,0.025491009,0.0011913296,0.000026298709,0.00028722687,0.00083311734],"genre_scores_gemma":[0.997005,0.000059542937,0.0014130647,0.000068772824,0.0006979635,0.000029115088,5.649043e-7,0.00002494404,0.0007010284],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978183,0.000570325,0.00044255596,0.00021668167,0.000499265,0.00045287918],"domain_scores_gemma":[0.9934084,0.004934695,0.0003597312,0.00061292085,0.00052611355,0.00015815788],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005330225,0.00018123644,0.00034214027,0.00023496899,0.0005427394,0.00020251791,0.001429387,0.00008396942,0.000026125119],"category_scores_gemma":[0.0020394595,0.00012357566,0.0002794242,0.00095623394,0.00030088736,0.0011077452,0.00033996766,0.00039084567,0.00001596163],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00081780535,0.00007242241,0.000022239747,0.000022410808,0.0000996216,0.00074566476,0.000727824,0.00019839927,0.00088356814,0.98568165,0.0022117998,0.008516562],"study_design_scores_gemma":[0.0014829863,0.0007144504,0.00007406102,0.000023555769,0.000018685081,0.0014549413,0.0006976835,0.0007651247,0.009637103,0.9737541,0.011214622,0.00016265837],"about_ca_topic_score_codex":0.0000026641412,"about_ca_topic_score_gemma":0.0000033043104,"teacher_disagreement_score":0.41401464,"about_ca_system_score_codex":0.00006929588,"about_ca_system_score_gemma":0.0001845076,"threshold_uncertainty_score":0.50392693},"labels":[],"label_agreement":null},{"id":"W3006616331","doi":"10.1016/j.jctb.2020.02.001","title":"Corrigendum to “Bisimplicial vertices in even-hole-free graphs”","year":2020,"lang":"en","type":"erratum","venue":"Journal of Combinatorial Theory Series B","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","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":"Army Research Office; Air Force Office of Scientific Research; National Science Foundation","keywords":"Mathematics; Combinatorics; Discrete mathematics","score_opus":0.015395560638991857,"score_gpt":0.238693414439034,"score_spread":0.22329785380004213,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3006616331","genre_codex":"editorial","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"editorial","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004032249,0.004692319,0.0030740278,0.011868351,0.95505416,0.00079662364,0.00004186424,0.00026361368,0.020176802],"genre_scores_gemma":[0.6653142,0.0071924482,0.05340177,0.03355899,0.040693153,0.00026253736,0.00020836713,0.0017006538,0.19766788],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9956681,0.0005812601,0.0014339444,0.00052249455,0.0012176426,0.00057654205],"domain_scores_gemma":[0.9965834,0.0001711944,0.0011014326,0.0010168368,0.000613341,0.0005138204],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0018874137,0.0005142958,0.0011798085,0.00082214404,0.00017257423,0.00038253798,0.0041409996,0.00054348115,0.000033211105],"category_scores_gemma":[0.0012718611,0.0004551911,0.00043265813,0.0014594633,0.00013814408,0.0008668592,0.00097024144,0.0020070402,0.000030481908],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00042552644,0.00009647777,0.000011594285,0.00003542575,0.00006360881,0.00018312837,0.00068417547,0.000019689558,0.00008998486,0.5362514,0.46157926,0.00055969984],"study_design_scores_gemma":[0.0011290632,0.0012764005,0.000033565277,0.00032283168,0.000037267746,0.000047601832,0.00012244344,0.000028684637,0.00016578965,0.6866104,0.30986655,0.00035942515],"about_ca_topic_score_codex":0.00001561674,"about_ca_topic_score_gemma":0.00001342995,"teacher_disagreement_score":0.914361,"about_ca_system_score_codex":0.00011095225,"about_ca_system_score_gemma":0.00084304996,"threshold_uncertainty_score":0.99978995},"labels":[],"label_agreement":null},{"id":"W3014452398","doi":"10.1016/j.jctb.2023.03.004","title":"Graph product structure for non-minor-closed classes","year":2023,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":28,"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 Ottawa","funders":"","keywords":"Combinatorics; Treewidth; 1-planar graph; Mathematics; Planar graph; Pathwidth; Discrete mathematics; Indifference graph; Partial k-tree; Graph product; Adjacency list; Clique-sum; Chordal graph; Graph; Line graph","score_opus":0.015486756748058885,"score_gpt":0.2911500817685745,"score_spread":0.2756633250205156,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3014452398","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.81255347,0.00054996903,0.13413496,0.004088317,0.04470081,0.00189025,0.00006425779,0.00051122316,0.0015067316],"genre_scores_gemma":[0.9902881,0.00007277757,0.007554167,0.000058951744,0.0012944962,0.000015110202,0.0000034860761,0.000037516533,0.0006753921],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997606,0.00031799785,0.0005569237,0.00031197807,0.0006773367,0.00052977994],"domain_scores_gemma":[0.9969603,0.0009217114,0.0004546437,0.0006388983,0.0008332141,0.0001912332],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022434327,0.00023575898,0.00045756847,0.0005527009,0.00029372875,0.00019768407,0.0018205487,0.00009728798,0.000022406008],"category_scores_gemma":[0.00117616,0.00018986371,0.00027599433,0.0014805824,0.00023558667,0.0015548215,0.00027387904,0.0004344703,0.000008298206],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010856662,0.000058355992,0.0001320224,0.000056293364,0.00011047949,0.000055553704,0.00052827614,0.00009822312,0.013777125,0.97545385,0.0032912008,0.0053529716],"study_design_scores_gemma":[0.0013885901,0.00093838613,0.00056009577,0.000035621793,0.000014915786,0.00008660986,0.00017704854,0.000047040987,0.037782148,0.94544727,0.013318591,0.00020368947],"about_ca_topic_score_codex":3.7268154e-7,"about_ca_topic_score_gemma":5.1838737e-7,"teacher_disagreement_score":0.17773461,"about_ca_system_score_codex":0.000054713873,"about_ca_system_score_gemma":0.00027634192,"threshold_uncertainty_score":0.77424175},"labels":[],"label_agreement":null},{"id":"W3046024813","doi":"10.1016/j.jctb.2023.10.010","title":"Edge-colouring graphs with local list sizes","year":2023,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","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; Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Conjecture; Combinatorics; Mathematics; Generalization; Hypergraph; Edge coloring; Chromatic scale; Degree (music); Graph; Discrete mathematics; Line graph; Graph power","score_opus":0.012261408479186386,"score_gpt":0.26337507367268187,"score_spread":0.2511136651934955,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3046024813","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6970888,0.00069308915,0.2741758,0.0025704254,0.016295014,0.00055233407,0.0000059828662,0.0006929722,0.007925622],"genre_scores_gemma":[0.9963099,0.00008957725,0.0024967347,0.000052819807,0.00034089517,0.000006831181,5.469891e-7,0.000029874322,0.0006728652],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974789,0.00045787316,0.00046319142,0.0002424186,0.0008479913,0.0005096106],"domain_scores_gemma":[0.99753803,0.00084180915,0.0003537579,0.0005082675,0.000512075,0.00024603837],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025911098,0.00021459247,0.00040771518,0.0004978125,0.00029585412,0.00021872073,0.0016301933,0.00008568762,0.000038111953],"category_scores_gemma":[0.0003578445,0.00016111898,0.0001701984,0.0017517079,0.00052217045,0.0016781482,0.0003728751,0.0005585054,0.000025791906],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011505517,0.00006494701,0.00021034454,0.00001866462,0.000085888394,0.00042173098,0.00054913067,0.00041324142,0.0005871095,0.99095213,0.0005260024,0.005020235],"study_design_scores_gemma":[0.0013565883,0.0014279871,0.00030873428,0.00007588071,0.000012159702,0.0002816862,0.0004976795,0.00009918112,0.0077436473,0.98182535,0.006161707,0.00020941353],"about_ca_topic_score_codex":0.0000013257612,"about_ca_topic_score_gemma":0.000001656417,"teacher_disagreement_score":0.29922107,"about_ca_system_score_codex":0.00007436161,"about_ca_system_score_gemma":0.0002282932,"threshold_uncertainty_score":0.65702415},"labels":[],"label_agreement":null},{"id":"W3087827845","doi":"10.1016/j.jctb.2022.12.007","title":"Packing A-paths of length zero modulo a prime","year":2023,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; National Sleep Foundation; National Science Foundation","keywords":"Mathematics; Modulo; Combinatorics; Prime (order theory); Mod; Abelian group; Property (philosophy); Zero (linguistics); Discrete mathematics","score_opus":0.0252346203530725,"score_gpt":0.29120211964587833,"score_spread":0.26596749929280583,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3087827845","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9862129,0.0001625363,0.0006623642,0.000109858884,0.009115619,0.0001509213,0.00001077272,0.00006884663,0.0035061885],"genre_scores_gemma":[0.9976889,0.00008741589,0.0009263956,0.000019219411,0.0008169339,0.0000017936397,8.4502375e-7,0.000042249143,0.00041626772],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99778205,0.00039008437,0.0008599328,0.0001248363,0.00056145125,0.0002816453],"domain_scores_gemma":[0.9970919,0.001134537,0.000913503,0.00037846417,0.0003785476,0.00010307987],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028319894,0.00020524248,0.0006311803,0.00027846848,0.00018018231,0.000031493902,0.00050581235,0.00015120604,0.00009767991],"category_scores_gemma":[0.0015906167,0.00015520812,0.0003351341,0.0004129102,0.00023311158,0.00034096983,0.0001883116,0.00037547073,0.0000029366313],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00082636654,0.00007684501,0.00014278208,0.000084824336,0.00021146495,0.00004457696,0.0028139437,0.0000087606795,0.0018246683,0.9910096,0.0015732943,0.0013828878],"study_design_scores_gemma":[0.001053192,0.0005012815,0.00019540584,0.00013043484,0.00008561021,0.00008019963,0.00071101845,0.0000060111574,0.0151217105,0.9793033,0.002655388,0.00015647453],"about_ca_topic_score_codex":7.034714e-7,"about_ca_topic_score_gemma":1.3073128e-7,"teacher_disagreement_score":0.013297042,"about_ca_system_score_codex":0.000038139995,"about_ca_system_score_gemma":0.00008907726,"threshold_uncertainty_score":0.6329204},"labels":[],"label_agreement":null},{"id":"W3088215122","doi":"10.1016/j.jctb.2023.02.011","title":"Packing cycles in undirected group-labelled graphs","year":2023,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Mathematics; Combinatorics; Abelian group; Element (criminal law); Group (periodic table); Undirected graph; Integer (computer science); Order (exchange); Cyclic group; Graph; Discrete mathematics; Property (philosophy)","score_opus":0.02458348691211084,"score_gpt":0.29347984964724433,"score_spread":0.2688963627351335,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3088215122","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98910356,0.00019685847,0.000040065013,0.00011651462,0.0076196017,0.00014443786,0.0000038697854,0.00010229025,0.0026728024],"genre_scores_gemma":[0.9985965,0.00019937514,0.00051800994,0.000030461131,0.00042050326,0.000003625387,0.0000017021981,0.000043496613,0.00018630779],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976143,0.0006346747,0.00080596283,0.00014685444,0.0004477385,0.00035045235],"domain_scores_gemma":[0.99734145,0.0015841814,0.0005234862,0.00027627122,0.0001734355,0.00010118795],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030682082,0.00022064238,0.00057867327,0.00057456165,0.00022333737,0.000055498444,0.00045051242,0.00016473941,0.000105551684],"category_scores_gemma":[0.0013450852,0.00017202253,0.00024156364,0.0009393744,0.00018848987,0.00036715931,0.00014782473,0.00048167346,0.0000036875351],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009620573,0.000089246496,0.0010897305,0.00004661538,0.00012315184,0.000140091,0.0020506901,0.0000048991883,0.0007428893,0.99306375,0.00077516725,0.00091171876],"study_design_scores_gemma":[0.0018619761,0.00026784578,0.0018958804,0.00013799408,0.000045899527,0.00006615701,0.0011654672,0.0000042789065,0.0010549679,0.991973,0.001334104,0.00019244602],"about_ca_topic_score_codex":0.0000017522397,"about_ca_topic_score_gemma":0.0000040688947,"teacher_disagreement_score":0.009492959,"about_ca_system_score_codex":0.000056315774,"about_ca_system_score_gemma":0.00004452561,"threshold_uncertainty_score":0.7014875},"labels":[],"label_agreement":null},{"id":"W3102338202","doi":"10.1016/j.jctb.2015.12.009","title":"Quantum homomorphisms","year":2016,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":74,"is_retracted":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":"Homomorphism; Graph homomorphism; Mathematics; Discrete mathematics; Combinatorics; Quantum; Graph; Line graph; Graph power; Quantum mechanics","score_opus":0.006803118382228696,"score_gpt":0.2154634902829134,"score_spread":0.2086603719006847,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3102338202","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26881793,0.00056543306,0.6929932,0.0062674657,0.029646575,0.000117934826,0.0000036599304,0.00016572539,0.0014220927],"genre_scores_gemma":[0.9916044,0.00004277437,0.006842621,0.00010770511,0.0011560033,7.476011e-7,7.1573325e-8,0.000013668534,0.00023203254],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99839854,0.00027404018,0.00046677535,0.00016450055,0.00042121697,0.0002749206],"domain_scores_gemma":[0.9982779,0.0004632411,0.0004436622,0.0003880718,0.00027064478,0.00015646717],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013196322,0.00016278356,0.0003151989,0.00014554967,0.0001374345,0.00011456361,0.0012321108,0.00007060626,0.000035509787],"category_scores_gemma":[0.00028945605,0.00009242236,0.00018494042,0.0002446619,0.00013807527,0.0007238897,0.00021427115,0.00021098471,0.00001743084],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011632215,0.000057717207,0.00001957339,0.0000034472364,0.00003401148,0.000090209105,0.00019301196,0.000016386435,0.0018359447,0.96239316,0.0006199359,0.034620292],"study_design_scores_gemma":[0.0010894263,0.00089195673,0.00014462731,0.000092646915,0.000008344765,0.0005838381,0.00001930161,0.00022915997,0.005490836,0.96672094,0.024563126,0.00016579838],"about_ca_topic_score_codex":4.8586935e-7,"about_ca_topic_score_gemma":4.4741363e-8,"teacher_disagreement_score":0.7227865,"about_ca_system_score_codex":0.000040196654,"about_ca_system_score_gemma":0.00014049993,"threshold_uncertainty_score":0.37688744},"labels":[],"label_agreement":null},{"id":"W3132307481","doi":"10.1016/j.jctb.2021.02.001","title":"Connectivity and choosability of graphs with no K minor","year":2021,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; McGill University","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Combinatorics; Minor (academic); Mathematics; Graph; Conjecture; Graph minor; Upper and lower bounds; Discrete mathematics; Graph power; Line graph","score_opus":0.00907079580733079,"score_gpt":0.2509396275268328,"score_spread":0.24186883171950202,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3132307481","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98103637,0.00051320466,0.014649578,0.0002920036,0.0017447867,0.00011252804,0.000003615603,0.000018644665,0.0016292826],"genre_scores_gemma":[0.99305356,0.00006173347,0.00665165,0.000022911609,0.00008920258,0.0000017639632,2.0538407e-7,0.000008734384,0.00011025603],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99800116,0.00070761924,0.00038175925,0.00021206756,0.00048172203,0.00021566763],"domain_scores_gemma":[0.9967729,0.00093152694,0.00036718047,0.00047464436,0.0013001289,0.0001536439],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019643353,0.00013957321,0.00042996512,0.00011458126,0.000100430516,0.000069453876,0.0005304418,0.00006084661,0.0000344761],"category_scores_gemma":[0.0011103798,0.000106728454,0.00010779698,0.0005272009,0.00051092677,0.001111247,0.00023848681,0.00032346713,9.62933e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013313849,0.00019716655,0.0028697941,0.00004589551,0.000083901,0.00007595482,0.00030373575,0.0000063650364,0.0060865106,0.98708975,0.00002503281,0.0018845274],"study_design_scores_gemma":[0.0013535318,0.0012560694,0.0034499085,0.00004864175,0.00001391164,0.0003281397,0.00016970566,0.000009034408,0.04757929,0.94485575,0.0008157837,0.00012022848],"about_ca_topic_score_codex":0.0000013362663,"about_ca_topic_score_gemma":0.0000013191238,"teacher_disagreement_score":0.042233974,"about_ca_system_score_codex":0.000030423558,"about_ca_system_score_gemma":0.00028036788,"threshold_uncertainty_score":0.435226},"labels":[],"label_agreement":null},{"id":"W3143193920","doi":"10.1016/j.jctb.2023.09.002","title":"Intersecting families of sets are typically trivial","year":2023,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Lemma (botany); Combinatorics; Mathematics; Graph; Container (type theory); Discrete mathematics; Biology","score_opus":0.02700673949303215,"score_gpt":0.2992173281957878,"score_spread":0.2722105887027556,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3143193920","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98779625,0.000058896978,0.00012618124,0.00009220345,0.0093799215,0.00009032577,0.000008478255,0.000047691203,0.0024000786],"genre_scores_gemma":[0.99848616,0.000058812573,0.00055455585,0.000021474909,0.00066250795,0.0000012207109,5.749574e-7,0.000028103628,0.00018656261],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981161,0.00036102845,0.0007927847,0.0001039634,0.0004084117,0.00021773182],"domain_scores_gemma":[0.996936,0.0014456701,0.00094311486,0.00023862094,0.00035874345,0.00007785181],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021112487,0.00016873975,0.00057293207,0.0002754942,0.00015567859,0.000026143356,0.00042110708,0.00013343687,0.000092449605],"category_scores_gemma":[0.0026526235,0.00012600867,0.00030182986,0.0003614965,0.00023235122,0.00024242535,0.00017693441,0.00036819084,0.0000022878721],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001965717,0.00006159311,0.00047270372,0.000107112675,0.0002001288,0.000047124126,0.0037646224,0.0000055431856,0.0007325267,0.9900273,0.0013045169,0.0013111051],"study_design_scores_gemma":[0.0010839971,0.0004825024,0.00074039487,0.00016057948,0.0000665011,0.00006924936,0.005966154,0.0000027793512,0.0035715627,0.986586,0.0011450622,0.00012521999],"about_ca_topic_score_codex":5.7619883e-7,"about_ca_topic_score_gemma":8.4091323e-7,"teacher_disagreement_score":0.010689964,"about_ca_system_score_codex":0.000030823485,"about_ca_system_score_gemma":0.00005728712,"threshold_uncertainty_score":0.5138485},"labels":[],"label_agreement":null},{"id":"W3157297330","doi":"10.1016/j.jctb.2024.03.001","title":"Typical structure of hereditary properties of binary matroids","year":2024,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; McGill University","funders":"Fonds de recherche du Québec – Nature et technologies","keywords":"Matroid; Mathematics; Binary number; Graph; Combinatorics; Graphic matroid; Discrete mathematics; Arithmetic","score_opus":0.012493392506069081,"score_gpt":0.258757780643422,"score_spread":0.2462643881373529,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3157297330","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97669166,0.007064924,0.006095807,0.0004160193,0.009264687,0.00015410631,0.000012858298,0.00005017687,0.00024974326],"genre_scores_gemma":[0.99658674,0.0000710304,0.0027539788,0.000010031515,0.00044105866,8.113148e-7,3.5716943e-7,0.000017749677,0.00011825814],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99783695,0.0004077336,0.0006880321,0.00016678245,0.0006726432,0.00022786843],"domain_scores_gemma":[0.99848366,0.00027261407,0.0002760432,0.0003908717,0.00047272712,0.00010411514],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009975747,0.00016245856,0.00046269307,0.00034239516,0.000054890475,0.00005955316,0.0011976992,0.00010764391,0.000053795786],"category_scores_gemma":[0.0002785655,0.00011457027,0.00022609043,0.0006183001,0.00046928425,0.001293546,0.0003085803,0.0005009009,0.0000019515699],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016074217,0.00007105275,0.000027597209,0.00022948839,0.0001231595,0.00010875785,0.00069878367,0.00006605195,0.14715807,0.84811234,0.00026907676,0.0015282214],"study_design_scores_gemma":[0.00039142053,0.0013529973,0.000086244414,0.00031008045,0.000018636722,0.00030043325,0.00023986814,0.00009114249,0.16608004,0.82977265,0.0012491688,0.000107310865],"about_ca_topic_score_codex":8.250372e-7,"about_ca_topic_score_gemma":1.3868505e-7,"teacher_disagreement_score":0.019895047,"about_ca_system_score_codex":0.000043921133,"about_ca_system_score_gemma":0.0003262505,"threshold_uncertainty_score":0.46720397},"labels":[],"label_agreement":null},{"id":"W3181044363","doi":"10.1016/j.jctb.2022.04.004","title":"Structure in sparse k-critical graphs","year":2022,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Combinatorics; Disjoint sets; Conjecture; Mathematics; Corollary; Graph; Upper and lower bounds; Discrete mathematics","score_opus":0.017049024680044603,"score_gpt":0.2849124472556697,"score_spread":0.2678634225756251,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3181044363","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98296136,0.00040772976,0.00005303451,0.0002765531,0.014152321,0.00012917351,0.000027031834,0.000021246924,0.0019715535],"genre_scores_gemma":[0.99836916,0.000018215398,0.00095907337,0.00010763436,0.00041407213,0.0000035913224,8.6912667e-7,0.000030352965,0.000097006814],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972713,0.00093382644,0.0007307504,0.00014145461,0.0006323616,0.00029032197],"domain_scores_gemma":[0.9979122,0.0011842375,0.00035002953,0.00029452905,0.000151154,0.00010780468],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0020220152,0.00019328078,0.0004985818,0.00031335684,0.00038660152,0.00003649866,0.0005967252,0.00009017177,0.001391098],"category_scores_gemma":[0.0012879396,0.00015937637,0.00022790715,0.00037183255,0.0002544074,0.00029999603,0.0002926924,0.0010162765,3.1667867e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016373862,0.0001385981,0.0003677941,0.000028849332,0.000056518915,0.00019652517,0.0017608304,0.000021827953,0.00029067168,0.99419606,0.0010014025,0.000303513],"study_design_scores_gemma":[0.0012271403,0.0006334698,0.0001731246,0.000021027914,0.000045403463,0.0005861911,0.001606367,0.0000016286002,0.0006858292,0.98851293,0.0063312766,0.0001755848],"about_ca_topic_score_codex":9.4141046e-7,"about_ca_topic_score_gemma":0.000001035693,"teacher_disagreement_score":0.015407829,"about_ca_system_score_codex":0.0000980683,"about_ca_system_score_gemma":0.00009396155,"threshold_uncertainty_score":0.9995218},"labels":[],"label_agreement":null},{"id":"W3196344216","doi":"10.1016/j.jctb.2023.10.005","title":"Induced subgraphs and tree decompositions II. Toward walls and their line graphs in graphs of bounded degree","year":2023,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","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 Waterloo","funders":"","keywords":"Combinatorics; Mathematics; Treewidth; Bounded function; Disjoint sets; Discrete mathematics; Degree (music); Conjecture; Vertex (graph theory); Clique-sum; 1-planar graph; Induced subgraph; Graph; Pathwidth; Chordal graph; Line graph","score_opus":0.035810595052561615,"score_gpt":0.2923976960918472,"score_spread":0.25658710103928556,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3196344216","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99523866,0.0006299497,0.0015940528,0.00068613497,0.0012687235,0.00021861802,0.000007851892,0.00005188767,0.000304132],"genre_scores_gemma":[0.9974128,0.00084830733,0.0016043696,0.000029846928,0.000050839702,0.0000076420265,0.0000015614461,0.000019534215,0.000025093455],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975788,0.00056408567,0.0007422016,0.00028302983,0.00042222528,0.00040968176],"domain_scores_gemma":[0.9976694,0.000934274,0.00041350213,0.00040209186,0.0003603831,0.00022036897],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021884108,0.0002529358,0.00060739846,0.0013376625,0.00023979163,0.000111721565,0.00087367854,0.00013689585,0.000006009141],"category_scores_gemma":[0.00032275208,0.00020489182,0.0001772396,0.0020992022,0.00048730214,0.0012076632,0.00052052253,0.00052660936,6.6306905e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007092551,0.00014644547,0.0008443472,0.000033572953,0.00009254517,0.000052650223,0.0027594161,0.000006814401,0.019891517,0.9666224,0.000027154136,0.008813864],"study_design_scores_gemma":[0.001996434,0.0016616789,0.004744335,0.00010201828,0.0000117356185,0.00012656735,0.00065556244,0.00006705389,0.018770523,0.9715521,0.000121564,0.00019044845],"about_ca_topic_score_codex":0.0000070514775,"about_ca_topic_score_gemma":0.000016292252,"teacher_disagreement_score":0.008623415,"about_ca_system_score_codex":0.000031889587,"about_ca_system_score_gemma":0.00013239955,"threshold_uncertainty_score":0.83552456},"labels":[],"label_agreement":null},{"id":"W4205300480","doi":"10.1016/j.jctb.2015.02.003","title":"Projective geometries in exponentially dense matroids. I","year":2015,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Matroid; Combinatorics; Mathematics; Rank (graph theory); Graphic matroid; Integer (computer science); Prime (order theory); Prime power; Matroid partitioning; Discrete mathematics; Computer science","score_opus":0.02429588280191961,"score_gpt":0.28916004476698653,"score_spread":0.2648641619650669,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4205300480","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.82249385,0.001907402,0.15350676,0.0010378873,0.014716516,0.0006108785,0.000003923066,0.00012029924,0.005602508],"genre_scores_gemma":[0.9923814,0.00005000242,0.0068464587,0.000039448205,0.00036593663,0.000007444596,3.2626284e-7,0.000019318828,0.00028968474],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99712163,0.0007337147,0.0006206255,0.00021830226,0.0008984027,0.00040734452],"domain_scores_gemma":[0.9974904,0.0004949396,0.00042044817,0.00042553752,0.0009148871,0.00025376535],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0049241874,0.00018864176,0.00043308258,0.0008516629,0.00008027111,0.0001980971,0.0014368518,0.00009456183,0.000013239405],"category_scores_gemma":[0.0020906192,0.00016033542,0.00013435773,0.0014250453,0.00025691395,0.00261326,0.00039025405,0.0005270659,0.000013277748],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0023413545,0.00017595838,0.0004997681,0.000008660579,0.00004458989,0.00029255744,0.0024368905,0.000086882836,0.00077624584,0.990862,0.00026176372,0.0022133172],"study_design_scores_gemma":[0.0022340266,0.0014067728,0.0002551402,0.00003805214,0.0000061094865,0.00028700172,0.001086078,0.000018894183,0.008932978,0.98177963,0.0037801906,0.00017513987],"about_ca_topic_score_codex":0.0000039089764,"about_ca_topic_score_gemma":0.0000021548847,"teacher_disagreement_score":0.16988754,"about_ca_system_score_codex":0.00022293144,"about_ca_system_score_gemma":0.0006095797,"threshold_uncertainty_score":0.65382886},"labels":[],"label_agreement":null},{"id":"W4205800876","doi":"10.1016/j.jctb.2010.08.001","title":"On inequivalent representations of matroids over non-prime fields","year":2010,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","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":"Matroid; Prime (order theory); Combinatorics; Finite field; Mathematics; Order (exchange); Mace; Graphic matroid; Field (mathematics); Discrete mathematics; Pure mathematics","score_opus":0.009937836447893521,"score_gpt":0.3008611600237114,"score_spread":0.29092332357581785,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4205800876","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8984709,0.000044527835,0.083253406,0.000691592,0.0112261595,0.00019971558,0.000004231282,0.000031373474,0.0060781455],"genre_scores_gemma":[0.99514747,0.000016225777,0.0040876046,0.000049392333,0.00034849206,0.000003002215,3.6078995e-7,0.000012442424,0.00033499248],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981441,0.00023645151,0.00054968806,0.00016822129,0.000664884,0.0002366801],"domain_scores_gemma":[0.99737597,0.0008289797,0.00047782215,0.00071848027,0.0004533674,0.00014540911],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016024348,0.00013983382,0.0003165359,0.00028639505,0.0001061265,0.00007004615,0.0013073564,0.000105812054,0.00016882009],"category_scores_gemma":[0.0008470983,0.00011552353,0.0002017059,0.00041093916,0.00022065139,0.00092824775,0.00025694325,0.0007351177,0.000007312212],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00059286,0.00016312177,0.00011901519,0.000009340799,0.000044949906,0.000029906016,0.00036700975,0.000070323884,0.024161717,0.97294664,0.00042481103,0.0010703264],"study_design_scores_gemma":[0.0010040341,0.001055882,0.00061815116,0.000027822338,0.000008509433,0.000059649676,0.000055824676,0.000058317444,0.07584758,0.9202747,0.00088487036,0.000104697894],"about_ca_topic_score_codex":0.0000022798572,"about_ca_topic_score_gemma":8.9933775e-7,"teacher_disagreement_score":0.09667664,"about_ca_system_score_codex":0.000027467335,"about_ca_system_score_gemma":0.00016597917,"threshold_uncertainty_score":0.47109127},"labels":[],"label_agreement":null},{"id":"W4221138707","doi":"10.1016/j.jctb.2022.09.001","title":"A counterexample to a conjecture about triangle-free induced subgraphs of graphs with large chromatic number","year":2022,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Combinatorics; Counterexample; Mathematics; Conjecture; Digraph; Clique number; Omega; Bounded function; Induced subgraph; Chromatic scale; Graph; Discrete mathematics; Clique; Vertex (graph theory); Physics","score_opus":0.016087984959408344,"score_gpt":0.27068684073979277,"score_spread":0.25459885578038444,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4221138707","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9933042,0.00013592835,0.00020236266,0.0001350145,0.0036782194,0.00046410382,0.000111082605,0.000032987544,0.0019361126],"genre_scores_gemma":[0.9982183,0.000009038637,0.0011598796,0.00016831089,0.00023746895,0.000024122895,0.0000025028219,0.00006223105,0.000118153344],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9964343,0.0008825768,0.0010432557,0.00020652555,0.0010379389,0.00039543732],"domain_scores_gemma":[0.99637306,0.0010537592,0.0012462337,0.0007461977,0.00039418117,0.00018656404],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0030799152,0.00032987073,0.0010577333,0.00034664775,0.00047347066,0.00004853263,0.0010970357,0.00011525773,0.0013310076],"category_scores_gemma":[0.0008829859,0.00023992086,0.00039920883,0.0007828495,0.00016609381,0.00026052885,0.00041307288,0.0006994,7.6625304e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0058393837,0.00035357533,0.0004864937,0.00012762497,0.00054206594,0.00007796325,0.0075662653,0.0000051511893,0.0007343125,0.9814524,0.0027301144,0.00008465001],"study_design_scores_gemma":[0.0058928407,0.0029231452,0.00029041967,0.00012457142,0.00021710672,0.00062560145,0.0030218044,6.5519924e-7,0.0019178179,0.9802878,0.0044122026,0.00028605017],"about_ca_topic_score_codex":0.0000057982406,"about_ca_topic_score_gemma":0.0000070537712,"teacher_disagreement_score":0.0049141035,"about_ca_system_score_codex":0.00008993612,"about_ca_system_score_gemma":0.00020255297,"threshold_uncertainty_score":0.99958193},"labels":[],"label_agreement":null},{"id":"W4289222390","doi":"10.1016/j.jctb.2022.06.002","title":"Bounding χ by a fraction of Δ for graphs without large cliques","year":2022,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","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","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Combinatorics; Mathematics; Degree (music); Upper and lower bounds; Conjecture; Discrete mathematics; Vertex (graph theory); Brooks' theorem; Bounding overwatch; Fractional coloring; Graph; Clique; Chromatic scale; Graph coloring; Greedy coloring; Clique number; Chordal graph; Graph power; Line graph; 1-planar graph; Computer science","score_opus":0.012658909168851392,"score_gpt":0.30400812249916687,"score_spread":0.2913492133303155,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4289222390","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30674118,0.0008897916,0.6830883,0.0005253882,0.0076225773,0.00048024073,0.000047345708,0.000064359374,0.0005408143],"genre_scores_gemma":[0.9943324,0.000046608773,0.005250904,0.000054984386,0.00014172512,0.000024452807,0.000001992648,0.000018435509,0.00012852742],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976502,0.0006922874,0.0005317228,0.00016563441,0.0006603411,0.00029983177],"domain_scores_gemma":[0.9977838,0.00062330026,0.00077255047,0.00030320216,0.0004209372,0.00009620259],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004612539,0.00012801288,0.00038606575,0.000294963,0.00045015162,0.00007346674,0.0010553072,0.000044181586,0.0000456978],"category_scores_gemma":[0.00042555353,0.00012026863,0.00022786371,0.0004940635,0.00011634715,0.0012815977,0.00029835413,0.0004340038,2.6728745e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001952532,0.00020831928,0.0002998413,0.000020386036,0.00006847309,0.000005582226,0.00053777406,0.000015978092,0.007204484,0.98779356,0.00088560145,0.0010074773],"study_design_scores_gemma":[0.0014303027,0.0020485464,0.00001732493,0.000015716205,0.000012557527,0.00006097144,0.000801851,0.00006767091,0.016325125,0.9358128,0.043294318,0.00011282251],"about_ca_topic_score_codex":0.0000010464514,"about_ca_topic_score_gemma":1.7131514e-7,"teacher_disagreement_score":0.6875912,"about_ca_system_score_codex":0.000119402575,"about_ca_system_score_gemma":0.00015706853,"threshold_uncertainty_score":0.49044126},"labels":[],"label_agreement":null},{"id":"W4321763399","doi":"10.1016/j.jctb.2023.02.003","title":"Proper orientations and proper chromatic number","year":2023,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","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":"Simon Fraser University","funders":"","keywords":"Combinatorics; Mathematics; Windmill graph; Chromatic scale; Friendship graph; Graph; Vertex (graph theory); Critical graph; Orientation (vector space); Mathematical proof; Discrete mathematics; Graph power; Line graph; Geometry","score_opus":0.010523207752898929,"score_gpt":0.24193141275374938,"score_spread":0.23140820500085046,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4321763399","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98245806,0.0001998566,0.0019483701,0.0022616696,0.008946415,0.00022264842,0.0000012448637,0.00018688872,0.0037748662],"genre_scores_gemma":[0.9955677,0.000056653873,0.0031725094,0.000095289506,0.00007528935,0.0000052370397,5.219374e-7,0.000011476482,0.0010153562],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988197,0.00017652081,0.00037111773,0.0001276116,0.0003290959,0.0001759579],"domain_scores_gemma":[0.99904406,0.000120836135,0.00020982811,0.00021177,0.00030154438,0.00011194291],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012051953,0.000105495055,0.00020092918,0.00012359496,0.00018519354,0.00017511606,0.0003325654,0.000046813824,0.00003288272],"category_scores_gemma":[0.0002108945,0.00007258745,0.000060772603,0.0005680909,0.00012638309,0.0008682933,0.00014026932,0.00015548464,0.000060627175],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000043317745,0.000046472367,0.00019767458,0.000018966139,0.00003385482,0.000030323274,0.0015450135,0.000018206169,0.001175056,0.9939168,0.0020273821,0.000946928],"study_design_scores_gemma":[0.00080191105,0.0002838789,0.0003315162,0.00006470731,0.000016743237,0.00021832874,0.00023908258,0.00012832382,0.0015966538,0.99112576,0.0050775586,0.000115525894],"about_ca_topic_score_codex":0.0000013676182,"about_ca_topic_score_gemma":1.3558592e-7,"teacher_disagreement_score":0.013109626,"about_ca_system_score_codex":0.000014368187,"about_ca_system_score_gemma":0.00010568328,"threshold_uncertainty_score":0.296003},"labels":[],"label_agreement":null},{"id":"W4362704061","doi":"10.1016/j.jctb.2023.03.002","title":"Disjoint isomorphic balanced clique subdivisions","year":2023,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Institute for Basic Science; Leverhulme Trust; UK Research and Innovation","keywords":"Combinatorics; Mathematics; Subdivision; Conjecture; Disjoint sets; Vertex (graph theory); Graph; Clique; Clique graph; Upper and lower bounds; Discrete mathematics; Line graph; Graph power","score_opus":0.026838286675701328,"score_gpt":0.30097029089983707,"score_spread":0.27413200422413575,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4362704061","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9795801,0.00012690142,0.0004743452,0.0006429618,0.014847707,0.0001917162,0.00002528705,0.00014499818,0.003965978],"genre_scores_gemma":[0.9977481,0.00017940822,0.00044530438,0.00007729911,0.00090816995,0.000004103513,0.0000028331797,0.000033706874,0.00060111145],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99779826,0.00047856494,0.00077002996,0.00014216252,0.0004839456,0.00032704553],"domain_scores_gemma":[0.9971169,0.0014503621,0.0005725795,0.00038754364,0.00031102504,0.00016159182],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00273057,0.00021766292,0.0005559785,0.00024995793,0.00033877738,0.000056642326,0.00051226607,0.00015709626,0.00028973285],"category_scores_gemma":[0.0018733152,0.00015802946,0.00033918332,0.00046042798,0.00023609187,0.0003273385,0.00020232741,0.00050469884,0.000017627253],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00093580026,0.00006612142,0.00015291883,0.000037199625,0.00012328001,0.00009112532,0.0011025331,0.000005660632,0.0006035956,0.98761207,0.008896742,0.0003729443],"study_design_scores_gemma":[0.0010682925,0.0004481692,0.0005521446,0.00008077431,0.000060763756,0.00013589083,0.0005990079,0.000003950684,0.0018577838,0.98645633,0.008552399,0.00018449296],"about_ca_topic_score_codex":4.3722758e-7,"about_ca_topic_score_gemma":3.7280728e-7,"teacher_disagreement_score":0.018167958,"about_ca_system_score_codex":0.00004494461,"about_ca_system_score_gemma":0.000087263776,"threshold_uncertainty_score":0.64442545},"labels":[],"label_agreement":null},{"id":"W4381433330","doi":"10.1016/j.jctb.2023.05.004","title":"Local Hadwiger's Conjecture","year":2023,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Combinatorics; Conjecture; Minor (academic); Complement (music); Mathematics; Graph; Vertex (graph theory); Discrete mathematics; Biology; Humanities","score_opus":0.012895943215520312,"score_gpt":0.27703519847462554,"score_spread":0.26413925525910525,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4381433330","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09206201,0.00088070455,0.86318856,0.005161068,0.030278316,0.00040641762,0.000007747839,0.00061098224,0.0074041663],"genre_scores_gemma":[0.9966219,0.00009113514,0.001724752,0.00011096649,0.0005332255,0.0000036649715,8.399063e-7,0.000023800156,0.00088972924],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99764866,0.0005130208,0.00046482307,0.00019755877,0.0007416797,0.0004342588],"domain_scores_gemma":[0.9978878,0.0007158468,0.00030207535,0.0004975102,0.00037778076,0.0002189931],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027611207,0.00017681549,0.00036209507,0.0004010304,0.00019396878,0.00015651288,0.0016946787,0.00011093072,0.00006196508],"category_scores_gemma":[0.000496214,0.00014194526,0.00020469853,0.0012944185,0.00033718674,0.0013178595,0.00037892786,0.0005569002,0.000082247534],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00036621944,0.00003699236,0.00002708038,0.000009391038,0.000055864028,0.00033315338,0.00043149258,0.00030278275,0.00063678605,0.987096,0.0019851099,0.008719132],"study_design_scores_gemma":[0.00089440035,0.0006950507,0.00009169498,0.000027277289,0.0000063950847,0.00026190782,0.0002595061,0.00012041559,0.008199979,0.9561441,0.03314909,0.00015021053],"about_ca_topic_score_codex":5.350363e-7,"about_ca_topic_score_gemma":2.4244363e-7,"teacher_disagreement_score":0.90455985,"about_ca_system_score_codex":0.000071191236,"about_ca_system_score_gemma":0.00022422052,"threshold_uncertainty_score":0.57883596},"labels":[],"label_agreement":null},{"id":"W4381615661","doi":"10.1016/j.jctb.2023.06.003","title":"On 2-cycles of graphs","year":2023,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"graph theory and CDMA systems","field":"Engineering","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":"National Science Foundation","keywords":"Combinatorics; Mathematics; Skew; Graph; Cycle basis; Vertex (graph theory); Discrete mathematics; Physics; Line graph; Graph power","score_opus":0.007034065921966524,"score_gpt":0.2091723375639919,"score_spread":0.20213827164202536,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4381615661","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9816843,0.0002102088,0.00004654674,0.00002152953,0.010782274,0.00005900319,0.00000590096,0.000095998075,0.007094212],"genre_scores_gemma":[0.9995241,0.00010101877,0.00001078014,0.0000062032627,0.00021620527,0.0000017019704,8.191363e-7,0.00002449145,0.000114646966],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998925,0.0001476727,0.00045618854,0.00005363166,0.0002574619,0.00016009044],"domain_scores_gemma":[0.99918866,0.00032062395,0.00016412335,0.00016519053,0.00009292965,0.00006844531],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011024029,0.00012470716,0.00032707755,0.00028852382,0.00004395144,0.0000164368,0.00024227954,0.00007925177,0.000059988804],"category_scores_gemma":[0.00012462295,0.00010426253,0.00019490634,0.0004175215,0.00008388568,0.00019170852,0.000016067052,0.00019503373,0.000018202292],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00045750572,0.000028174309,0.00006595342,0.00006315419,0.00012709414,0.000025694733,0.00042002264,0.0014735805,0.004801169,0.99009174,0.0019380852,0.0005077997],"study_design_scores_gemma":[0.0006229215,0.0004340559,0.00030400534,0.000114846276,0.000020993428,0.000028734543,0.0005428962,0.000014420771,0.020991065,0.97366774,0.003153217,0.00010508909],"about_ca_topic_score_codex":3.1227304e-7,"about_ca_topic_score_gemma":1.2183806e-7,"teacher_disagreement_score":0.017839806,"about_ca_system_score_codex":0.000015783748,"about_ca_system_score_gemma":0.000015430476,"threshold_uncertainty_score":0.42517027},"labels":[],"label_agreement":null},{"id":"W4382864813","doi":"10.1016/j.jctb.2023.06.004","title":"Every graph is eventually Turán-good","year":2023,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; Toronto Metropolitan University; Simon Fraser University; University of Victoria","funders":"","keywords":"Combinatorics; Conjecture; Graph; Mathematics; Discrete mathematics","score_opus":0.021264963002842956,"score_gpt":0.2863046884261066,"score_spread":0.26503972542326365,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4382864813","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9665675,0.00036502117,0.00021751013,0.0005145601,0.021906706,0.0002135453,0.00002149539,0.00015542128,0.01003823],"genre_scores_gemma":[0.9948641,0.00026092603,0.00059468165,0.00019210196,0.0015266419,0.0000037964003,0.000001630156,0.00006108533,0.0024950565],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99748576,0.0004194132,0.00083048607,0.00016962184,0.0007184327,0.00037627586],"domain_scores_gemma":[0.99722683,0.0011385378,0.00066928525,0.00042841223,0.00037216424,0.00016477349],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027426076,0.00026744264,0.0005836228,0.0003699928,0.00032412316,0.000069529524,0.0006724135,0.00019859463,0.00044512798],"category_scores_gemma":[0.00090895925,0.00020285425,0.0004984078,0.0006074105,0.00021774402,0.00048126208,0.00020795348,0.00050259946,0.000017133661],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00083174603,0.000077802324,0.00013620558,0.00005385692,0.00029405567,0.000091328955,0.0026708797,0.0000023377868,0.0002529901,0.97664046,0.018304333,0.0006439888],"study_design_scores_gemma":[0.0011665293,0.0005154425,0.00026960357,0.00008497452,0.00011000353,0.00016895862,0.0010348116,9.563724e-7,0.0027175439,0.9763175,0.017385334,0.00022834165],"about_ca_topic_score_codex":5.3250363e-7,"about_ca_topic_score_gemma":2.4897741e-7,"teacher_disagreement_score":0.02829657,"about_ca_system_score_codex":0.00004289196,"about_ca_system_score_gemma":0.000103928345,"threshold_uncertainty_score":0.8272156},"labels":[],"label_agreement":null},{"id":"W4386266281","doi":"10.1016/j.jctb.2023.08.001","title":"A proof of the tree alternative conjecture under the topological minor relation","year":2023,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Mathematics; Conjecture; Minor (academic); Equivalence relation; Relation (database); Combinatorics; Tree (set theory); Isomorphism (crystallography); Congruence relation; Discrete mathematics; Pure mathematics; Computer science","score_opus":0.023536585466061296,"score_gpt":0.2928676424930599,"score_spread":0.2693310570269986,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386266281","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8891283,0.00046299087,0.075085126,0.01629747,0.013856088,0.00083450146,0.0000071842915,0.00008279228,0.0042455383],"genre_scores_gemma":[0.99874187,0.000018433342,0.00026743952,0.00007789437,0.00028583707,0.000005303716,2.2021207e-7,0.000008452074,0.00059456617],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99742866,0.0011020922,0.00041621274,0.00014006352,0.00068412896,0.00022886225],"domain_scores_gemma":[0.9972755,0.0013306573,0.00053064874,0.0004733234,0.00033378636,0.000056100373],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002403306,0.00012670962,0.00024568615,0.000119854165,0.00023142975,0.00006018371,0.0017957463,0.00008508857,0.000024094581],"category_scores_gemma":[0.00071126583,0.00006066542,0.00020734887,0.00094540615,0.00057498034,0.0005274487,0.00041819212,0.0005343516,0.000003137316],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003459039,0.000041323827,0.000109028195,0.0000053922954,0.000060844905,0.000012388719,0.0010320678,0.00079959026,0.0007536313,0.995139,0.00019531295,0.0015055207],"study_design_scores_gemma":[0.00064178923,0.00052559486,0.0019862375,0.00002821821,0.000011519639,0.00007006723,0.00054449536,0.00015926562,0.016530268,0.9782632,0.0011696919,0.00006967278],"about_ca_topic_score_codex":0.0000011327502,"about_ca_topic_score_gemma":0.0000013893324,"teacher_disagreement_score":0.109613545,"about_ca_system_score_codex":0.00005304122,"about_ca_system_score_gemma":0.00014513303,"threshold_uncertainty_score":0.33369732},"labels":[],"label_agreement":null},{"id":"W4388471823","doi":"10.1016/j.jctb.2023.10.008","title":"Induced subgraphs and tree decompositions VII. Basic obstructions in H-free graphs","year":2023,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","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":"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; Induced subgraph; Subdivision; Bipartite graph; Discrete mathematics; Treewidth; Chordal graph; Cograph; Graph; Pathwidth; 1-planar graph; Line graph; Vertex (graph theory)","score_opus":0.017087698286873558,"score_gpt":0.27820646013842604,"score_spread":0.26111876185155247,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388471823","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9843213,0.00054803345,0.0031525206,0.0024551733,0.007596295,0.0002331426,0.000008379176,0.00014378635,0.001541377],"genre_scores_gemma":[0.99556136,0.00043869132,0.0035956332,0.000039264673,0.00018164518,0.000013741026,0.0000013417485,0.000022946708,0.00014537033],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99782825,0.00053079386,0.00052861945,0.00023552502,0.000471165,0.00040562646],"domain_scores_gemma":[0.9979729,0.0007444876,0.00023888737,0.00057417015,0.0002646671,0.00020485593],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014785004,0.00017697817,0.0003399947,0.0012687896,0.0002486713,0.00015901853,0.0012079593,0.00010868109,0.00001622054],"category_scores_gemma":[0.0005037342,0.0001682008,0.00014955517,0.0026738439,0.000275659,0.0018603441,0.0003999632,0.0005755012,0.000006208588],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021479589,0.000083760984,0.00039818222,0.0000101839405,0.000039613984,0.00012499047,0.0005502587,0.000027055861,0.0032611063,0.9891317,0.0003136877,0.005844667],"study_design_scores_gemma":[0.0016047801,0.00055143016,0.0039961417,0.000053557786,0.000009351082,0.00028980145,0.00033513943,0.000041604635,0.0023722767,0.9897938,0.00078988884,0.00016223585],"about_ca_topic_score_codex":0.000004044423,"about_ca_topic_score_gemma":0.0000116599995,"teacher_disagreement_score":0.0112400735,"about_ca_system_score_codex":0.000057884055,"about_ca_system_score_gemma":0.00012403619,"threshold_uncertainty_score":0.68590295},"labels":[],"label_agreement":null},{"id":"W4389129622","doi":"10.1016/j.jctb.2023.11.005","title":"Hitting all maximum stable sets in P5-free graphs","year":2023,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","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 Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada; Government of Ontario","keywords":"Combinatorics; Mathematics; Bounded function; Induced subgraph; Conjecture; Discrete mathematics; Graph; Vertex (graph theory); Induced path; Cardinality (data modeling); Longest path problem; Chordal graph; Computer science","score_opus":0.021601945378098928,"score_gpt":0.29157513236965915,"score_spread":0.2699731869915602,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389129622","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9433268,0.0010858133,0.018386204,0.0047727292,0.022484267,0.0006875432,0.000015690024,0.000511906,0.008729057],"genre_scores_gemma":[0.9916977,0.00028612252,0.0068212426,0.0001591232,0.00032515204,0.000012412913,0.0000020185917,0.000051793573,0.00064442115],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9966235,0.000769429,0.0007413983,0.0002780557,0.0008855832,0.00070200005],"domain_scores_gemma":[0.9972453,0.00096964935,0.0004210472,0.0008063126,0.00034102795,0.00021666837],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0061016,0.00021793075,0.00045750744,0.00087809365,0.00015732151,0.00020422667,0.0027300953,0.00011300344,0.00003639555],"category_scores_gemma":[0.0014274837,0.00019640838,0.00018946003,0.0021056987,0.00018114479,0.0021585145,0.00088058616,0.0007166486,0.000027803171],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005007337,0.00008374595,0.00043671258,0.00002230621,0.000050689887,0.00046701526,0.0010022387,0.0002244311,0.001202735,0.99041855,0.0013077812,0.0042830794],"study_design_scores_gemma":[0.0017544071,0.00046789335,0.00044038877,0.00006776933,0.000005701451,0.00010462584,0.0004076074,0.00013298626,0.0028061273,0.9864131,0.007201367,0.00019798719],"about_ca_topic_score_codex":0.0000036508316,"about_ca_topic_score_gemma":0.0000027459441,"teacher_disagreement_score":0.048370924,"about_ca_system_score_codex":0.0001109489,"about_ca_system_score_gemma":0.00019568406,"threshold_uncertainty_score":0.80093014},"labels":[],"label_agreement":null},{"id":"W4395681799","doi":"10.1016/j.jctb.2024.04.002","title":"Mutual embeddability in groups, trees, and spheres","year":2024,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Topology and Set Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Royal Military College of Canada","funders":"","keywords":"Mathematics; SPHERES; Combinatorics; Physics; Astronomy","score_opus":0.015621251694879374,"score_gpt":0.3052243481088574,"score_spread":0.289603096413978,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4395681799","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9878863,0.0027821853,0.0009791387,0.00025654127,0.0050970726,0.00010764359,0.0000045384495,0.00004259797,0.002843979],"genre_scores_gemma":[0.9979021,0.000106267296,0.000956711,0.00002139323,0.0005207393,0.0000020489558,4.1846292e-7,0.000019625351,0.00047070222],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99854815,0.00045299035,0.0005188353,0.00013484897,0.0001622166,0.00018296414],"domain_scores_gemma":[0.99782735,0.0017406218,0.00013975355,0.00015538708,0.00006301048,0.000073860974],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017663212,0.00014932326,0.00039318725,0.00010498182,0.000055907665,0.000039275084,0.00016232919,0.00014069575,0.00030413436],"category_scores_gemma":[0.0011524061,0.000115433584,0.000098371136,0.000144157,0.00038606086,0.00051014766,0.00005977301,0.000490625,0.0000036605215],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012792815,0.000101925005,0.00031200712,0.00007782565,0.000059024747,0.00018740712,0.0015036418,0.0000022337372,0.00018567058,0.99344534,0.00039297837,0.002452639],"study_design_scores_gemma":[0.0006916276,0.00040276404,0.0001793666,0.000110601206,0.000036778863,0.00026636678,0.0018913397,0.000006986208,0.00058923295,0.99089175,0.0048176493,0.00011553825],"about_ca_topic_score_codex":0.000001082039,"about_ca_topic_score_gemma":0.000017791454,"teacher_disagreement_score":0.010015791,"about_ca_system_score_codex":0.00006138278,"about_ca_system_score_gemma":0.0000811941,"threshold_uncertainty_score":0.47072452},"labels":[],"label_agreement":null},{"id":"W4396683686","doi":"10.1016/j.jctb.2024.04.001","title":"The inducibility of oriented stars","year":2024,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","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":"Stars; Astrophysics; Astronomy; Physics","score_opus":0.009695795141661441,"score_gpt":0.25018538364967846,"score_spread":0.24048958850801702,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4396683686","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.67752284,0.0058203596,0.20525731,0.004876056,0.10229088,0.0005851544,0.000012611667,0.00027183004,0.0033629818],"genre_scores_gemma":[0.9959663,0.000069367605,0.0032321876,0.000022956321,0.0005781871,0.0000021608464,2.5221394e-7,0.000011755266,0.00011680427],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971579,0.0006955629,0.00089568313,0.00026663672,0.000714308,0.0002699481],"domain_scores_gemma":[0.9962078,0.0018010184,0.00037680977,0.000809647,0.00068438274,0.00012034174],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006106789,0.00017674954,0.00037536476,0.00012679987,0.00017386921,0.0002690666,0.0015687326,0.00008886754,0.000024435087],"category_scores_gemma":[0.0010758926,0.000110971254,0.0002749986,0.00078029337,0.00038700073,0.0009835439,0.00046329925,0.000510629,0.0000042807383],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021487013,0.000115737486,0.000083045896,0.000031045656,0.000090881476,0.000035283483,0.0009915398,0.00002937685,0.00038973734,0.9734655,0.00044201838,0.024110967],"study_design_scores_gemma":[0.00038473852,0.0009084611,0.0005925664,0.000057683505,0.000020930216,0.00011314509,0.00021981962,0.0005982023,0.0043328987,0.95485735,0.03778904,0.00012518279],"about_ca_topic_score_codex":0.0000041050766,"about_ca_topic_score_gemma":0.000001330365,"teacher_disagreement_score":0.3184435,"about_ca_system_score_codex":0.00013799209,"about_ca_system_score_gemma":0.0004979083,"threshold_uncertainty_score":0.45252764},"labels":[],"label_agreement":null},{"id":"W4399120955","doi":"10.1016/j.jctb.2024.05.003","title":"The burning number conjecture holds asymptotically","year":2024,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Conjecture; Mathematics; Combinatorics","score_opus":0.01176928435438561,"score_gpt":0.2922803584006069,"score_spread":0.2805110740462213,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399120955","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.831754,0.0053700125,0.0038354197,0.003410812,0.08536928,0.00043464729,0.000013732179,0.00027751015,0.06953457],"genre_scores_gemma":[0.99499583,0.00017194032,0.00065786793,0.00006941511,0.002383,0.0000021743,3.0961195e-7,0.00004626959,0.0016732016],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99791276,0.00047600453,0.00066405686,0.00013318245,0.00051775435,0.00029626518],"domain_scores_gemma":[0.99542975,0.0036391127,0.00026772905,0.00030526443,0.00024228943,0.000115851304],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032149763,0.00022202688,0.00037067774,0.000066133565,0.00054478087,0.0003473727,0.00055544614,0.0001763267,0.00030347332],"category_scores_gemma":[0.0013744537,0.000119080134,0.00034929343,0.00021958472,0.0003869411,0.00034195694,0.00013367194,0.0008661726,0.0000086226055],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00047731263,0.00002281354,0.000034408145,0.000050818744,0.00031275678,0.00012221372,0.0012893223,0.000002702574,0.0000973246,0.99062216,0.0049540107,0.0020141813],"study_design_scores_gemma":[0.00037485082,0.00023086833,0.000023281737,0.00013840596,0.00011604408,0.00075997476,0.00039773635,0.000004717658,0.0006288528,0.8943648,0.10282128,0.00013921507],"about_ca_topic_score_codex":2.3733939e-7,"about_ca_topic_score_gemma":2.6406406e-7,"teacher_disagreement_score":0.1632418,"about_ca_system_score_codex":0.000054477387,"about_ca_system_score_gemma":0.00013063557,"threshold_uncertainty_score":0.48559472},"labels":[],"label_agreement":null},{"id":"W4399149997","doi":"10.1016/j.jctb.2024.05.002","title":"Directed cycles with zero weight in Zpk","year":2024,"lang":"lv","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"graph theory and CDMA systems","field":"Engineering","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":"Natural Sciences and Engineering Research Council of Canada; Royal Society","keywords":"Zero (linguistics); Mathematics; Algorithm; Philosophy","score_opus":0.00466580706083357,"score_gpt":0.20019280797731395,"score_spread":0.19552700091648037,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399149997","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.89595336,0.030005218,0.00072494266,0.00026445216,0.056639,0.0003631229,0.000030239864,0.000324088,0.015695572],"genre_scores_gemma":[0.996643,0.0007244466,0.0000852301,0.000010979288,0.0017118944,0.0000066188304,0.0000021951375,0.00011023618,0.0007053959],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9969433,0.0007081962,0.0011023111,0.00023753721,0.0005216816,0.00048695074],"domain_scores_gemma":[0.9984342,0.0006114602,0.00025401587,0.00030940748,0.00018151046,0.00020943569],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0022108315,0.00046357317,0.0008818799,0.00059272686,0.000096230055,0.00031624542,0.00046694383,0.00029956474,0.00025066233],"category_scores_gemma":[0.00012383686,0.00036084445,0.000295585,0.0009777959,0.00021753513,0.0010452516,0.00004745137,0.0011259757,0.00003843335],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0029092317,0.00015209324,0.00039648122,0.0006551684,0.0008291744,0.0016575226,0.003445383,0.00068318483,0.0016959133,0.98458695,0.0011495285,0.0018393516],"study_design_scores_gemma":[0.0024549724,0.0012243134,0.0005881127,0.004350515,0.00029190927,0.0010607587,0.0012633044,0.00019364145,0.0062123653,0.9156384,0.066053726,0.00066802226],"about_ca_topic_score_codex":0.00000729028,"about_ca_topic_score_gemma":0.000005263972,"teacher_disagreement_score":0.10068964,"about_ca_system_score_codex":0.00020117157,"about_ca_system_score_gemma":0.0002084125,"threshold_uncertainty_score":0.99988437},"labels":[],"label_agreement":null},{"id":"W4399771641","doi":"10.1016/j.jctb.2024.05.006","title":"On the use of senders for asymmetric tuples of cliques in Ramsey theory","year":2024,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Engineering and Physical Sciences Research Council; Deutsche Forschungsgemeinschaft; Australian Government","keywords":"Tuple; Mathematics; Combinatorics; Discrete mathematics","score_opus":0.06546077576914389,"score_gpt":0.31444724990977746,"score_spread":0.24898647414063357,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399771641","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98627174,0.0011889648,0.0027101373,0.00032582344,0.0073630516,0.00052227697,0.0000471184,0.000027805821,0.0015430932],"genre_scores_gemma":[0.998254,0.00017810363,0.001053368,0.000057647354,0.00026790667,0.000005490036,6.02827e-7,0.00003639935,0.0001464536],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975161,0.00084317493,0.0009371545,0.00012301418,0.00038626656,0.00019430197],"domain_scores_gemma":[0.98128927,0.017505076,0.0005693365,0.00031015833,0.00028128453,0.000044858538],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0047258413,0.00019558308,0.00057643466,0.00049133855,0.00007945797,0.000050498442,0.00041243175,0.00014837937,0.000054141365],"category_scores_gemma":[0.005650765,0.000113130656,0.00041553736,0.00046250867,0.0003705236,0.0003088844,0.0000744308,0.0004071207,2.1428937e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0033078534,0.00012621503,0.00003392211,0.00027299332,0.00029166686,0.000010226634,0.0021985515,0.000023586099,0.00020224527,0.99004567,0.00153388,0.0019531732],"study_design_scores_gemma":[0.00065389875,0.00092663214,0.00004051845,0.0004072122,0.00010751773,0.00002213531,0.0010898751,0.000017065928,0.010330354,0.98352134,0.0027705238,0.00011290961],"about_ca_topic_score_codex":0.0000014582845,"about_ca_topic_score_gemma":8.012996e-7,"teacher_disagreement_score":0.016661901,"about_ca_system_score_codex":0.000047499212,"about_ca_system_score_gemma":0.00011142593,"threshold_uncertainty_score":0.6764901},"labels":[],"label_agreement":null},{"id":"W4400619204","doi":"10.1016/j.jctb.2024.06.007","title":"Spectral arbitrariness for trees fails spectacularly","year":2024,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Markov Chains and Monte Carlo Methods","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 Regina","funders":"Natural Sciences and Engineering Research Council of Canada; Javna Agencija za Raziskovalno Dejavnost RS","keywords":"Arbitrariness; Mathematics; Philosophy; Epistemology","score_opus":0.0339013001840233,"score_gpt":0.3340395112551943,"score_spread":0.300138211071171,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400619204","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7481944,0.003678088,0.15313637,0.0022276004,0.059073653,0.0010779648,0.000047446127,0.00029203,0.032272443],"genre_scores_gemma":[0.9349344,0.00013785997,0.048441984,0.00007714884,0.00840354,0.000023551363,0.0000027089004,0.00013190963,0.007846919],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983348,0.0002511603,0.00064810144,0.00016292254,0.00032596465,0.00027701753],"domain_scores_gemma":[0.9976702,0.0014524431,0.0002449576,0.00022742976,0.00027700662,0.00012800228],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030227678,0.00022208085,0.00055575045,0.00018023039,0.00008660098,0.0003023259,0.00031958564,0.00012177914,0.00007332799],"category_scores_gemma":[0.0012158221,0.00016673788,0.0005366705,0.00019412697,0.00009180019,0.0006685192,0.000040997722,0.00035023215,1.5335326e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000955882,0.000089296744,0.0000072372045,0.0002011484,0.0002567773,0.00012418607,0.0006194591,0.0000011520397,0.003008403,0.9893874,0.0031786875,0.002170393],"study_design_scores_gemma":[0.0009014556,0.0007589829,0.000007512028,0.00016894873,0.0001754169,0.00023308881,0.000623299,0.00002318557,0.011553974,0.92378783,0.061580006,0.00018629496],"about_ca_topic_score_codex":0.0000010415873,"about_ca_topic_score_gemma":0.0000024476483,"teacher_disagreement_score":0.18673997,"about_ca_system_score_codex":0.00008805387,"about_ca_system_score_gemma":0.00017344709,"threshold_uncertainty_score":0.67993736},"labels":[],"label_agreement":null},{"id":"W4400887743","doi":"10.1016/j.jctb.2024.07.001","title":"The Erdős-Gyárfás function <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.svg\"><mml:mi>f</mml:mi><mml:mo stretchy=\"false\">(</mml:mo><mml:mi>n</mml:mi><mml:mo>,</mml:mo><mml:mn>4</mml:mn><mml:mo>,</mml:mo><mml:mn>5</mml:mn><mml:mo stretchy=\"false\">)</mml:mo><mml:mo linebreak=\"goodbreak\" linebreakstyle=\"after\">=</mml:mo><mml:mfrac><mml:mrow><mml:mn>5</mml:mn></mml:mrow><mml:mrow><mml:mn>6</mml:mn></mml:mrow></mml:mfrac><mml:mi>n</mml:mi><mml:mo linebreak=\"goodbreak\" linebreakstyle=\"after\">+</mml:mo><mml:mi>o</mml:mi><mml:mo stretchy=\"false\">(</mml:mo><mml:mi>n</mml:mi><mml:mo stretchy=\"false\">)</mml:mo></mml:math> — So Gyárfás was right","year":2024,"lang":"lv","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Analytic Number Theory Research","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; Simons Foundation","keywords":"Mathematics; Combinatorics","score_opus":0.01501190542327529,"score_gpt":0.25325647123607425,"score_spread":0.23824456581279896,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400887743","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6740311,0.016671611,0.00413753,0.0053651053,0.029499266,0.0009086025,0.00826335,0.0033858381,0.25773764],"genre_scores_gemma":[0.9381143,0.010367895,0.0052037593,0.004692671,0.018755686,0.00733733,0.0068581523,0.007189659,0.001480585],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9379306,0.0060311477,0.014041457,0.010634432,0.016582567,0.014779792],"domain_scores_gemma":[0.9477408,0.014629824,0.014954081,0.010779462,0.0029267035,0.008969132],"candidate_categories":["metaresearch","metaepi_narrow","metaepi_broad","sts","scholarly_communication","open_science","research_integrity","insufficient_payload"],"consensus_categories":["metaepi_narrow","sts","open_science","research_integrity","insufficient_payload"],"category_scores_codex":[0.018068884,0.007436129,0.0034489243,0.0052438877,0.010913282,0.013774143,0.016114093,0.015732467,0.29713464],"category_scores_gemma":[0.013965824,0.013198083,0.013981628,0.009357156,0.012946148,0.010199922,0.013390774,0.015704772,0.010514226],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":true,"about_ca_system_consensus":false,"study_design_scores_codex":[0.015089364,0.0027145296,0.00004931185,0.0051676417,0.013223915,0.007855199,0.0058828215,0.0032775868,0.003209582,0.54066074,0.39482522,0.008044076],"study_design_scores_gemma":[0.012310562,0.01145649,0.000082781626,0.008855195,0.014477063,0.013818754,0.01278179,0.011653571,0.80434483,0.062385567,0.03621778,0.01161559],"about_ca_topic_score_codex":0.0072320425,"about_ca_topic_score_gemma":0.0066560167,"teacher_disagreement_score":0.8011353,"about_ca_system_score_codex":0.00037448236,"about_ca_system_score_gemma":0.011823663,"threshold_uncertainty_score":0.99937886},"labels":[],"label_agreement":null},{"id":"W4400888188","doi":"10.1016/j.jctb.2024.07.002","title":"Fractional coloring with local demands and applications to degree-sequence bounds on the independence number","year":2024,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"graph theory and CDMA systems","field":"Engineering","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":"Canada Excellence Research Chairs, Government of Canada; Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs; Government of Ontario; National Science Foundation","keywords":"Mathematics; Degree (music); Combinatorics; Independence (probability theory); Sequence (biology); Independence number; Discrete mathematics; Statistics; Graph","score_opus":0.014636745229695129,"score_gpt":0.23990438999761646,"score_spread":0.22526764476792133,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400888188","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.85753375,0.000934784,0.109545685,0.0006432814,0.0078078215,0.0005428536,0.000016007107,0.00020897685,0.022766849],"genre_scores_gemma":[0.9991518,0.000031259664,0.000049350147,0.000040076455,0.0005485669,0.000036341597,3.583604e-7,0.000020514308,0.00012170208],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991468,0.00008240136,0.00023538254,0.00009767701,0.0002988312,0.00013890876],"domain_scores_gemma":[0.9991931,0.00043714812,0.000048931004,0.00013004841,0.00009515052,0.00009565325],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008940197,0.0001294993,0.0001590717,0.00007135854,0.00015699191,0.0001519032,0.0001844691,0.000069504975,0.000065879096],"category_scores_gemma":[0.000029626384,0.00008274861,0.000046572062,0.0002666011,0.00013919517,0.00033155628,0.000019605663,0.00042674286,0.000020891262],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031147202,0.000013170115,0.00011171887,0.00003831724,0.00010393239,0.000028403618,0.00031180252,0.001706447,0.00039297028,0.9950649,0.00021818336,0.0016986824],"study_design_scores_gemma":[0.00044169833,0.0006285542,0.0003878989,0.00048060407,0.000073195566,0.0013817714,0.0017221252,0.00026253943,0.0040363776,0.8730569,0.11722482,0.00030350688],"about_ca_topic_score_codex":0.0000011974693,"about_ca_topic_score_gemma":0.0000017467735,"teacher_disagreement_score":0.14161809,"about_ca_system_score_codex":0.000070161834,"about_ca_system_score_gemma":0.000055746023,"threshold_uncertainty_score":0.33743903},"labels":[],"label_agreement":null},{"id":"W4409508401","doi":"10.1016/j.jctb.2025.04.001","title":"Haar graphical representations of finite groups and an application to poset representations","year":2025,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Finite Group Theory Research","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 Lethbridge","funders":"Natural Sciences and Engineering Research Council of Canada; European Commission","keywords":"Mathematics; Partially ordered set; Combinatorics; Haar; Algebra over a field; Discrete mathematics; Pure mathematics; Computer science; Artificial intelligence","score_opus":0.024431382018134055,"score_gpt":0.36805849261172136,"score_spread":0.3436271105935873,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409508401","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95032597,0.000114535236,0.039977126,0.0019054977,0.0014325767,0.00077540387,0.000045918307,0.000046807494,0.005376152],"genre_scores_gemma":[0.99519414,0.000039389335,0.0041036247,0.000057837253,0.00022167036,0.00002638704,0.0000074052073,0.000021503989,0.0003280698],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99752605,0.0007619254,0.00085248053,0.00020956059,0.0004520105,0.00019797611],"domain_scores_gemma":[0.9952871,0.0028221468,0.0004109207,0.00056414615,0.00074218836,0.0001734612],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00259544,0.00014871388,0.00042394805,0.0005657301,0.00017794818,0.00006997528,0.00043641438,0.00011710756,0.00004836875],"category_scores_gemma":[0.0042097475,0.00013721369,0.00012386047,0.0008597754,0.00030413555,0.00052666385,0.00016135268,0.00034350698,0.0000021398487],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001561165,0.00032734143,0.001139766,0.00006980623,0.00011830748,0.0000064996693,0.0013842547,0.0000291041,0.0047804886,0.98914945,0.00073188025,0.0007019105],"study_design_scores_gemma":[0.001033024,0.0006068021,0.002013551,0.00006783955,0.000087011555,0.00002349007,0.0019141658,0.00003834314,0.004176064,0.9890841,0.0008491374,0.00010644987],"about_ca_topic_score_codex":0.000007907683,"about_ca_topic_score_gemma":0.0000069205944,"teacher_disagreement_score":0.044868127,"about_ca_system_score_codex":0.000039655737,"about_ca_system_score_gemma":0.000121127996,"threshold_uncertainty_score":0.55954117},"labels":[],"label_agreement":null},{"id":"W4411491172","doi":"10.1016/j.jctb.2025.06.002","title":"Hyperbolicity theorems for correspondence colouring","year":2025,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Discrete mathematics","score_opus":0.0074636932120930605,"score_gpt":0.24771919893624686,"score_spread":0.2402555057241538,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411491172","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5080636,0.0020786095,0.42235604,0.0041741095,0.054513644,0.00061171886,0.0000064890264,0.00021517345,0.00798062],"genre_scores_gemma":[0.9905691,0.000037837814,0.008051412,0.00036504786,0.00008727989,0.0000063602147,2.1315024e-7,0.000007805284,0.0008749532],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986523,0.00021156922,0.0004904191,0.000160291,0.0002563792,0.00022905703],"domain_scores_gemma":[0.9978809,0.00078628346,0.0003410873,0.00032396291,0.0005815261,0.000086255815],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025418608,0.00013464765,0.00031638605,0.00022634068,0.0002272933,0.00016015854,0.0009804404,0.00008520952,0.00000678899],"category_scores_gemma":[0.0008113522,0.000108334374,0.00017851678,0.00042629274,0.00014024816,0.0005831208,0.00016204573,0.00021030944,0.000001796446],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00065611367,0.000076279444,0.000058245958,0.000016269594,0.00004432637,0.000006854106,0.00022134882,0.0000745685,0.0039793164,0.99136376,0.0015262567,0.0019766463],"study_design_scores_gemma":[0.001214463,0.00041705725,0.000051397903,0.00009597113,0.000021105947,0.000037907004,0.0000769877,0.00020867254,0.019922154,0.9648246,0.013024028,0.00010564326],"about_ca_topic_score_codex":0.0000013532562,"about_ca_topic_score_gemma":1.9980139e-7,"teacher_disagreement_score":0.48250547,"about_ca_system_score_codex":0.000039052833,"about_ca_system_score_gemma":0.00024829977,"threshold_uncertainty_score":0.44177476},"labels":[],"label_agreement":null},{"id":"W4414056851","doi":"10.1016/j.jctb.2025.08.003","title":"Tree independence number II. Three-path-configurations","year":2025,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","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":"Division of Mathematical Sciences; Natural Sciences and Engineering Research Council of Canada; Division of Computing and Communication Foundations; Ministry of Colleges and Universities; Air Force Office of Scientific Research; Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada; U.S. Air Force; Alfred P. Sloan Foundation","keywords":"Tree (set theory); Independence number; Independence (probability theory); Class (philosophy); Graph","score_opus":0.01070042686151122,"score_gpt":0.2865333438356005,"score_spread":0.27583291697408924,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414056851","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05795628,0.0006472302,0.8132339,0.0035492966,0.01828758,0.0004450879,0.000006501942,0.00017041984,0.105703704],"genre_scores_gemma":[0.9904978,0.000051442257,0.0066372408,0.0001545125,0.0003168086,0.000009372091,5.4024423e-7,0.000013352195,0.0023188929],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99769133,0.00039080824,0.0006136328,0.00023467018,0.00072000927,0.00034957312],"domain_scores_gemma":[0.9973842,0.0005786802,0.00036292334,0.0006324178,0.00089696987,0.0001448122],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021751367,0.00019415654,0.00036762608,0.00027359312,0.0004635624,0.00020861824,0.0019871201,0.00013850123,0.0001574106],"category_scores_gemma":[0.00084639946,0.00016676745,0.00017782496,0.0011024999,0.00026973733,0.0021140743,0.00045817968,0.0007034765,0.0000200384],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035892177,0.00012240837,0.00026895656,0.000009121653,0.00007386529,0.000050739625,0.0002780117,0.00001733469,0.0014035545,0.98640347,0.0010004464,0.010013147],"study_design_scores_gemma":[0.0009877419,0.0003371121,0.00041630855,0.00007001017,0.000015098767,0.000114699236,0.0001379043,0.000070652095,0.0069363103,0.97775275,0.01301171,0.00014971373],"about_ca_topic_score_codex":0.0000019251618,"about_ca_topic_score_gemma":0.0000038292023,"teacher_disagreement_score":0.93254155,"about_ca_system_score_codex":0.00008227373,"about_ca_system_score_gemma":0.00059060706,"threshold_uncertainty_score":0.68005794},"labels":[],"label_agreement":null},{"id":"W4414273302","doi":"10.1016/j.jctb.2025.08.005","title":"Dense minors of graphs with independence number two","year":2025,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Air Force Office of Scientific Research; Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Independence number; Chromatic scale; Graph; Simple (philosophy); Independent set; Simple graph","score_opus":0.0051207234804243025,"score_gpt":0.2359603110307333,"score_spread":0.230839587550309,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414273302","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9698915,0.00041825624,0.012784028,0.00051884336,0.0074092206,0.0001270738,0.0000011420589,0.000047810372,0.008802112],"genre_scores_gemma":[0.9936297,0.000026932556,0.005799314,0.000102509744,0.000019049765,0.00000127065,1.1866622e-7,0.0000060889483,0.00041500785],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99840605,0.00022838959,0.00052463,0.000154079,0.0005010218,0.00018579978],"domain_scores_gemma":[0.99804413,0.00024599483,0.000489589,0.00037720817,0.00075653853,0.000086513246],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013800547,0.00014372742,0.00034574207,0.00021726369,0.00009688413,0.00007263756,0.00078786816,0.00007237837,0.000025220306],"category_scores_gemma":[0.00014413842,0.00010416124,0.00012346367,0.0007409177,0.00023199177,0.0006151538,0.00013447521,0.00028989126,0.0000026144517],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00050084357,0.000111537636,0.0020070556,0.000018409148,0.00009406538,0.000037454083,0.00034139404,0.000055895987,0.0011057882,0.9942675,0.00035851143,0.0011015437],"study_design_scores_gemma":[0.0016895772,0.00041021113,0.0002418808,0.00017129893,0.000035342673,0.000154062,0.00011555208,0.000015081057,0.020516187,0.97575676,0.0007837981,0.00011024563],"about_ca_topic_score_codex":0.000010621235,"about_ca_topic_score_gemma":0.0000017330227,"teacher_disagreement_score":0.023738194,"about_ca_system_score_codex":0.00001966369,"about_ca_system_score_gemma":0.00028269025,"threshold_uncertainty_score":0.4247572},"labels":[],"label_agreement":null},{"id":"W4414436080","doi":"10.1016/j.jctb.2025.08.001","title":"The degree-restricted random process is far from uniform","year":2025,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Stochastic processes and statistical mechanics","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 Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; Alfred P. Sloan Foundation; National Science Foundation","keywords":"Random graph; Random regular graph; Degree (music); Vertex (graph theory); Graph; Sequence (biology); Enumeration; Stochastic process; Random sequence","score_opus":0.02638414600453434,"score_gpt":0.3028405919474399,"score_spread":0.2764564459429056,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414436080","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.069472395,0.0031519856,0.88334405,0.0036500269,0.024459831,0.0009099786,0.00010959786,0.00012484902,0.014777256],"genre_scores_gemma":[0.9941812,0.00035319504,0.003057718,0.00027381245,0.00075295917,0.000017023303,0.0000020443424,0.000037262984,0.0013247589],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99826884,0.0001427243,0.00076767744,0.00012180364,0.00045035558,0.0002485781],"domain_scores_gemma":[0.9934532,0.0049108514,0.0005371275,0.0002568227,0.00074558676,0.00009639625],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00086811197,0.00019102315,0.0004720161,0.00007224798,0.00033624328,0.00013875382,0.0006220272,0.00012626956,0.00008935051],"category_scores_gemma":[0.007484196,0.0001156438,0.00014584532,0.00035897293,0.0001298377,0.00019929938,0.0000744567,0.00040502913,0.0000035862226],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0037709384,0.00008945991,0.0000033574918,0.00004519487,0.00021929726,0.00001533599,0.00036107178,0.0000011133511,0.000048842456,0.9886069,0.0019578012,0.0048806337],"study_design_scores_gemma":[0.0030478612,0.00030138384,0.000010949433,0.00014130058,0.00020740801,0.000014410532,0.0009716485,0.000096507196,0.0021877233,0.98530626,0.00759533,0.000119244076],"about_ca_topic_score_codex":0.0000031310915,"about_ca_topic_score_gemma":0.000002249079,"teacher_disagreement_score":0.92470884,"about_ca_system_score_codex":0.00005825463,"about_ca_system_score_gemma":0.00034721958,"threshold_uncertainty_score":0.8959822},"labels":[],"label_agreement":null},{"id":"W4414962663","doi":"10.1016/j.jctb.2025.09.005","title":"Induced subgraphs and tree decompositions XVI. Complete bipartite induced minors","year":2025,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"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; Alfred P. Sloan Foundation; National Science Foundation","keywords":"Bipartite graph; Robertson–Seymour theorem; Minor (academic); Graph; Set (abstract data type); Complete bipartite graph","score_opus":0.02026782751886669,"score_gpt":0.29336489469822086,"score_spread":0.27309706717935417,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414962663","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95356834,0.00046298598,0.031462844,0.0019728323,0.0061309645,0.0003237676,0.0000058979995,0.000090578185,0.0059818192],"genre_scores_gemma":[0.9938151,0.00007187086,0.0056414567,0.0001605975,0.00015056973,0.000008321964,9.3003933e-7,0.0000141311975,0.00013699639],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974105,0.0007596725,0.00066971016,0.00028635084,0.0004684804,0.0004052931],"domain_scores_gemma":[0.99744356,0.0008730561,0.00037724437,0.0005526707,0.00052124413,0.00023222397],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014416595,0.00024125994,0.0004999621,0.0007963169,0.00043099924,0.00027392697,0.001256098,0.00012899215,0.000016550792],"category_scores_gemma":[0.0003247731,0.00021591049,0.00018733999,0.0012889871,0.00028772923,0.0014286076,0.0004218007,0.0006693567,0.0000034482678],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004037509,0.00011181561,0.0004162252,0.000016052225,0.00011896954,0.000039635117,0.00032484805,0.0000040139835,0.048543673,0.9426611,0.00013225978,0.007227667],"study_design_scores_gemma":[0.001770364,0.0008154433,0.0031827327,0.000091451744,0.00002988773,0.000108487984,0.00017535106,0.000058762773,0.017832866,0.97327065,0.002456026,0.00020799162],"about_ca_topic_score_codex":0.0000035322664,"about_ca_topic_score_gemma":0.0000043906066,"teacher_disagreement_score":0.040246814,"about_ca_system_score_codex":0.00007775287,"about_ca_system_score_gemma":0.0002716507,"threshold_uncertainty_score":0.88045746},"labels":[],"label_agreement":null},{"id":"W4417044359","doi":"10.1016/j.jctb.2025.11.010","title":"Reduced bandwidth: A qualitative strengthening of twin-width in minor-closed classes (and beyond)","year":2025,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"School Choice and Performance","field":"Social Sciences","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":"Australian Research Council; Natural Sciences and Engineering Research Council of Canada; Institute for Basic Science; National Research Foundation of Korea; Agence Nationale de la Recherche","keywords":"Class (philosophy); Algebra over a field; Field (mathematics); Qualitative analysis","score_opus":0.01785419864163944,"score_gpt":0.34433023251591693,"score_spread":0.3264760338742775,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4417044359","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97587556,0.00078625925,0.00001268714,0.0012009267,0.002841907,0.00009637894,0.000003175376,0.000007821832,0.019175313],"genre_scores_gemma":[0.99817693,0.00038735213,0.00025571298,0.000074067655,0.00042201031,0.0000022874278,5.00279e-7,0.0000059310537,0.00067518326],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977317,0.0009820262,0.0006127792,0.00010471585,0.0003600465,0.00020873794],"domain_scores_gemma":[0.99738514,0.0016613927,0.00046002294,0.000103637496,0.0003109372,0.00007884489],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036791852,0.00011577928,0.00039940575,0.00025847997,0.0001751091,0.000057870235,0.00028195343,0.00011686335,0.0000748755],"category_scores_gemma":[0.0021343129,0.00010205237,0.00009117886,0.00049459754,0.0003843081,0.00069793855,0.000040636038,0.0003144517,7.0550914e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0021806285,0.0001375851,0.005981652,0.000055634813,0.00010643458,0.0000093275185,0.111061096,0.0000056353765,0.0017707491,0.8739938,0.00073536957,0.003962053],"study_design_scores_gemma":[0.0022976024,0.00043886955,0.0041026683,0.00030774655,0.000050913353,0.0000026536259,0.09997539,0.0000013776075,0.0062819594,0.8694942,0.016889721,0.00015686972],"about_ca_topic_score_codex":0.0000885618,"about_ca_topic_score_gemma":0.00010084947,"teacher_disagreement_score":0.022301426,"about_ca_system_score_codex":0.00007775908,"about_ca_system_score_gemma":0.00051527674,"threshold_uncertainty_score":0.41615748},"labels":[],"label_agreement":null}]}